Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-172B\":[\"Pseudorandom Sequence Period\",2775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/172\\\"\\u003eCroc Champ 2012 - Qualification Round\\u003c/a\\u003e\"],\"CodeForces-1744D\":[\"Divisibility by 2^n\",20635,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1744\\\"\\u003eCodeforces Round 828 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1635C\":[\"Differential Sorting\",16478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1635\\\"\\u003eCodeforces Round 772 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1720C\":[\"Corners\",16549,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1720\\\"\\u003eCodeforces Round 815 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1877C\":[\"Joyboard\",10054,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1877\\\"\\u003eCodeforces Round 902 (Div. 2, based on COMPFEST 15 - Final Round)\\u003c/a\\u003e\"],\"CodeForces-1853B\":[\"Fibonaccharsis\",16750,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1853\\\"\\u003eCodeforces Round 887 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1514B\":[\"AND 0, Sum Big\",23712,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1514\\\"\\u003eCodeforces Round 716 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-431B\":[\"Shower Line\",10945,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/431\\\"\\u003eCodeforces Round 247 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1647B\":[\"Madoka and the Elegant Gift\",15361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1647\\\"\\u003eCodeforces Round 777 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1352C\":[\"K-th Not Divisible by n\",53346,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1352\\\"\\u003eCodeforces Round 640 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1582C\":[\"Grandma Capa Knits a Scarf\",14626,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1582\\\"\\u003eCodeforces Round 750 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1594C\":[\"Make Them Equal\",18186,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1594\\\"\\u003eCodeforces Round 747 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1013B\":[\"And\",8285,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1013\\\"\\u003eCodeforces Round 500 (Div. 2) [based on EJOI]\\u003c/a\\u003e\"],\"CodeForces-606A\":[\"Magic Spheres\",8692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/606\\\"\\u003eCodeforces Round 335 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1364A\":[\"XXXXX\",27386,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1364\\\"\\u003eCodeforces Round 649 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1497B\":[\"M-arrays\",18854,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1497\\\"\\u003eCodeforces Round 708 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1485B\":[\"Replace and Keep Sorted\",17112,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1485\\\"\\u003eCodeforces Round 701 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1352B\":[\"Same Parity Summands\",36720,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1352\\\"\\u003eCodeforces Round 640 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-714B\":[\"Filya and Homework\",15314,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/714\\\"\\u003eCodeforces Round 371 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-920B\":[\"Tea Queue\",7802,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1001H\":[\"Oracle for f(x) \\u003d parity of the number of 1s in x\",525,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1001\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018 - Warmup\\u003c/a\\u003e\"],\"CodeForces-811B\":[\"Vladik and Complicated Book\",6981,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/811\\\"\\u003eCodeforces Round 416 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-552B\":[\"Vanya and Books\",16224,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/552\\\"\\u003eCodeforces Round 308 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-794B\":[\"Cutting Carrot\",7191,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/794\\\"\\u003eTinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1907C\":[\"Removal of Unattractive Pairs\",18434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1907\\\"\\u003eCodeforces Round 913 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-171A\":[\"Mysterious numbers - 1\",4545,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/171\\\"\\u003eApril Fools Day Contest\\u003c/a\\u003e\"],\"CodeForces-292B\":[\"Network Topology\",8278,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/292\\\"\\u003eCroc Champ 2013 - Round 1\\u003c/a\\u003e\"],\"CodeForces-33A\":[\"What is for dinner?\",4300,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/33\\\"\\u003eCodeforces Beta Round 33 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1428B\":[\"Belted Rooms\",14414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1428\\\"\\u003eCodeforces Raif Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1537C\":[\"Challenging Cliffs\",26600,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1537\\\"\\u003eCodeforces Round 726 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-454B\":[\"Little Pony and Sort by Shift\",18530,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/454\\\"\\u003eCodeforces Round 259 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1000A\":[\"Codehorses T-shirts\",9604,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1000\\\"\\u003eEducational Codeforces Round 46 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1121B\":[\"Mike and Children\",9182,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1121\\\"\\u003eCodeforces Round 543 (Div. 2, based on Technocup 2019 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1133C\":[\"Balanced Team\",24244,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1133\\\"\\u003eCodeforces Round 544 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1581B\":[\"Diameter of Graph\",11709,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1581\\\"\\u003eCodeforces Round 745 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1133B\":[\"Preparation for International Women\\u0027s Day\",13248,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1133\\\"\\u003eCodeforces Round 544 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-69B\":[\"Bets\",3440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/69\\\"\\u003eCodeforces Beta Round 63 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1472D\":[\"Even-Odd Game\",26890,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1472\\\"\\u003eCodeforces Round 693 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1399C\":[\"Boats Competition\",28427,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1399\\\"\\u003eCodeforces Round 661 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1363A\":[\"Odd Selection\",35923,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1363\\\"\\u003eCodeforces Round 646 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1375B\":[\"Neighbor Grid\",17189,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1375\\\"\\u003eCodeforces Global Round 9\\u003c/a\\u003e\"],\"CodeForces-725B\":[\"Food on the Plane\",5312,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/725\\\"\\u003eCanada Cup 2016\\u003c/a\\u003e\"],\"CodeForces-931B\":[\"World Cup\",7553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/931\\\"\\u003eCodeforces Round 468 (Div. 2, based on Technocup 2018 Final Round)\\u003c/a\\u003e\"],\"CodeForces-701B\":[\"Cells Not Under Attack\",12703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/701\\\"\\u003eCodeforces Round 364 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-466A\":[\"Cheap Travel\",61822,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/466\\\"\\u003eCodeforces Round 266 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-660A\":[\"Co-prime Array\",9651,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/660\\\"\\u003eEducational Codeforces Round 11\\u003c/a\\u003e\"],\"CodeForces-194B\":[\"Square\",3697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/194\\\"\\u003eCodeforces Round 122 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1669E\":[\"2-Letter Strings\",17238,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1669\\\"\\u003eCodeforces Round 784 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1657C\":[\"Bracket Sequence Deletion\",16774,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1657\\\"\\u003eEducational Codeforces Round 125 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1512D\":[\"Corrupted Array\",22141,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1512\\\"\\u003eCodeforces Round 713 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1669G\":[\"Fall Down\",17866,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1669\\\"\\u003eCodeforces Round 784 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1512C\":[\"A-B Palindrome\",20043,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1512\\\"\\u003eCodeforces Round 713 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-78B\":[\"Easter Eggs\",13700,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/78\\\"\\u003eCodeforces Beta Round 70 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1536B\":[\"Prinzessin der Verurteilung\",17875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1536\\\"\\u003eCodeforces Round 724 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-102A\":[\"Clothes\",3451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/102\\\"\\u003eCodeforces Beta Round 79 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-344B\":[\"Simple Molecules\",9316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/344\\\"\\u003eCodeforces Round 200 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1362B\":[\"Johnny and His Hobbies\",18926,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1362\\\"\\u003eCodeforces Round 647 (Div. 2) - Thanks, Algo Muse!\\u003c/a\\u003e\"],\"CodeForces-1592B\":[\"Hemose Shopping\",15940,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1592\\\"\\u003eCodeforces Round 746 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1011B\":[\"Planning The Expedition\",10511,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1011\\\"\\u003eCodeforces Round 499 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1023C\":[\"Bracket Subsequence\",10091,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1023\\\"\\u003eCodeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)\\u003c/a\\u003e\"],\"CodeForces-1277B\":[\"Make Them Odd\",15406,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1277\\\"\\u003eCodeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-1023A\":[\"Single Wildcard Pattern Matching\",9055,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1023\\\"\\u003eCodeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)\\u003c/a\\u003e\"],\"CodeForces-1495A\":[\"Diamond Miner\",16896,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1495\\\"\\u003eCodeforces Round 706 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1730C\":[\"Minimum Notation\",16209,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1730\\\"\\u003eCodeforces Round 823 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-749B\":[\"Parallelogram is Back\",9275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/749\\\"\\u003eCodeforces Round 388 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1742E\":[\"Scuza\",22584,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1742\\\"\\u003eCodeforces Round 827 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1091B\":[\"New Year and the Treasure Geolocation\",10985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1091\\\"\\u003eGood Bye 2018\\u003c/a\\u003e\"],\"CodeForces-489A\":[\"SwapSort\",10648,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/489\\\"\\u003eCodeforces Round 277.5 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-489B\":[\"BerSU Ball\",49247,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/489\\\"\\u003eCodeforces Round 277.5 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-574A\":[\"Bear and Elections\",9752,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/574\\\"\\u003eCodeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-683A\":[\"The Check of the Point\",863,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/683\\\"\\u003eSurprise Language Round 8\\u003c/a\\u003e\"],\"CodeForces-1808B\":[\"Playing in a Casino\",14946,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1808\\\"\\u003eCodeforces Round 861 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1656C\":[\"Make Equal With Mod\",18796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1656\\\"\\u003eCodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1886B\":[\"Fear of the Dark\",15266,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1886\\\"\\u003eEducational Codeforces Round 156 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1874A\":[\"Jellyfish and Game\",15744,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1874\\\"\\u003eCodeforces Round 901 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-55A\":[\"Flea travel\",3706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"CodeForces-31A\":[\"Worms Evolution\",11256,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/31\\\"\\u003eCodeforces Beta Round 31 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1559C\":[\"Mocha and Hiking\",20019,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1559\\\"\\u003eCodeforces Round 738 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1305B\":[\"Kuroni and Simple Strings\",11669,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1305\\\"\\u003eOzon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!)\\u003c/a\\u003e\"],\"CodeForces-222A\":[\"Shooshuns and Sequence\",10894,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/222\\\"\\u003eCodeforces Round 137 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1143B\":[\"Nirvana\",10672,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1143\\\"\\u003eCodeforces Round 549 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1385C\":[\"Make It Good\",26770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1385\\\"\\u003eCodeforces Round 656 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-101A\":[\"Homework\",3973,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/101\\\"\\u003eCodeforces Beta Round 79 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-234A\":[\"Lefthanders and Righthanders\",4728,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/234\\\"\\u003eCodeforces Round 145 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1155B\":[\"Game with Telephone Numbers\",12336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1155\\\"\\u003eEducational Codeforces Round 63 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-79A\":[\"Bus Game\",4220,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/79\\\"\\u003eCodeforces Beta Round 71\\u003c/a\\u003e\"],\"CodeForces-379B\":[\"New Year Present\",7591,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/379\\\"\\u003eGood Bye 2013\\u003c/a\\u003e\"],\"CodeForces-639A\":[\"Bear and Displayed Friends\",6077,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/639\\\"\\u003eVK Cup 2016 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1131C\":[\"Birthday\",15431,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1131\\\"\\u003eCodeforces Round 541 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-977C\":[\"Less or Equal\",35373,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/977\\\"\\u003eCodeforces Round 479 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-989B\":[\"A Tide of Riverscape\",7319,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/989\\\"\\u003eCodeforces Round 487 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1916C\":[\"Training Before the Olympiad\",16681,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1916\\\"\\u003eGood Bye 2023\\u003c/a\\u003e\"],\"CodeForces-682B\":[\"Alyona and Mex\",12603,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/682\\\"\\u003eCodeforces Round 358 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1928B\":[\"Equalize\",15238,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1928\\\"\\u003eCodeforces Round 924 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-285C\":[\"Building Permutation\",24366,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/285\\\"\\u003eCodeforces Round 175 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1954C\":[\"Long Multiplication\",14981,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1954\\\"\\u003eEducational Codeforces Round 164 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-285B\":[\"Find Marble\",15483,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/285\\\"\\u003eCodeforces Round 175 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1857C\":[\"Assembly via Minimums\",23099,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1857\\\"\\u003eCodeforces Round 891 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1954B\":[\"Make It Ugly\",14764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1954\\\"\\u003eEducational Codeforces Round 164 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1029B\":[\"Creating the Contest\",17487,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1029\\\"\\u003eCodeforces Round 506 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-176A\":[\"Trading Business\",1548,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/176\\\"\\u003eCroc Champ 2012 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1017B\":[\"The Bits\",9815,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1017\\\"\\u003eCodeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1736B\":[\"Playing with GCD\",17687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1736\\\"\\u003eCodeforces Round 825 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1671C\":[\"Dolce Vita\",16087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1671\\\"\\u003eEducational Codeforces Round 127 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-302B\":[\"Eugeny and Play List\",8493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/302\\\"\\u003eCodeforces Round 182 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-828A\":[\"Restaurant Tables\",8433,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/828\\\"\\u003eCodeforces Round 423 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-1102C\":[\"Doors Breaking and Repairing\",13722,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1102\\\"\\u003eCodeforces Round 531 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-48B\":[\"Land Lot\",3004,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/48\\\"\\u003eSchool Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-913B\":[\"Christmas Spruce\",16575,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/913\\\"\\u003eHello 2018\\u003c/a\\u003e\"],\"CodeForces-1598C\":[\"Delete Two Elements\",20582,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1598\\\"\\u003eEducational Codeforces Round 115 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1792B\":[\"Stand-up Comedian\",20466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1792\\\"\\u003eEducational Codeforces Round 142 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-217A\":[\"Ice Skating\",22258,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/217\\\"\\u003eCodeforces Round 134 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-459A\":[\"Pashmak and Garden\",32401,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/459\\\"\\u003eCodeforces Round 261 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1097B\":[\"Petr and a Combination Lock\",29046,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1097\\\"\\u003eHello 2019\\u003c/a\\u003e\"],\"CodeForces-895A\":[\"Pizza Separation\",6871,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-774C\":[\"Maximum Number\",4102,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/774\\\"\\u003eVK Cup 2017 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-80B\":[\"Depression\",4570,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/80\\\"\\u003eCodeforces Beta Round 69 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1941D\":[\"Rudolf and the Ball Game\",16575,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1941\\\"\\u003eCodeforces Round 933 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-151B\":[\"Phone Numbers\",6957,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/151\\\"\\u003eCodeforces Round 107 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1355A\":[\"Sequence with Digits\",26236,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1355\\\"\\u003eCodeforces Round 643 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1832C\":[\"Contrast Value\",18730,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1832\\\"\\u003eEducational Codeforces Round 148 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1747C\":[\"Swap Game\",20552,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1747\\\"\\u003eCodeforces Round 832 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1517B\":[\"Morning Jogging\",13253,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1517\\\"\\u003eContest 2050 and Codeforces Round 718 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1028B\":[\"Unnatural Conditions\",9129,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1028\\\"\\u003eAIM Tech Round 5 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1149A\":[\"Prefix Sum Primes\",15440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1149\\\"\\u003eCodeforces Round 556 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1084B\":[\"Kvass and the Fair Nut\",8258,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1084\\\"\\u003eCodeforces Round 526 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1355B\":[\"Young Explorers\",25550,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1355\\\"\\u003eCodeforces Round 643 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-216A\":[\"Tiling with Hexagons\",5336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/216\\\"\\u003eCodeforces Round 133 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-803B\":[\"Distances to Zero\",7128,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-1343C\":[\"Alternating Subsequence\",37500,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1343\\\"\\u003eCodeforces Round 636 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1694B\":[\"Paranoid String\",18719,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1694\\\"\\u003eCodeforces Round 800 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-911B\":[\"Two Cakes\",11749,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-870B\":[\"Maximum of Maximums of Minimums\",9655,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/870\\\"\\u003eTechnocup 2018 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-802M\":[\"April Fools\\u0027 Problem (easy)\",3173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1409C\":[\"Yet Another Array Restoration\",23248,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1409\\\"\\u003eCodeforces Round 667 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1843D\":[\"Apple Tree\",17478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1843\\\"\\u003eCodeforces Round 881 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1613C\":[\"Poisoned Dagger\",23797,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1613\\\"\\u003eEducational Codeforces Round 118 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1734C\":[\"Removing Smallest Multiples\",17032,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1734\\\"\\u003eCodeforces Round 822 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1027B\":[\"Numbers on the Chessboard\",8573,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1027\\\"\\u003eEducational Codeforces Round 49 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-186B\":[\"Growing Mushrooms\",5483,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/186\\\"\\u003eCodeforces Round 118 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1015B\":[\"Obtaining the String\",12056,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1015\\\"\\u003eCodeforces Round 501 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1504B\":[\"Flip the Bits\",17461,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1504\\\"\\u003eCodeforces Round 712 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1637C\":[\"Andrew and Stones\",17535,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1637\\\"\\u003eCodeforces Global Round 19\\u003c/a\\u003e\"],\"CodeForces-1100C\":[\"NN and the Optical Illusion\",11168,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1100\\\"\\u003eCodeforces Round 532 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1221C\":[\"Perfect Team\",21730,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1221\\\"\\u003eEducational Codeforces Round 73 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1681C\":[\"Double Sort\",17168,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1681\\\"\\u003eEducational Codeforces Round 129 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-433B\":[\"Kuriyama Mirai\\u0027s Stones\",40472,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/433\\\"\\u003eCodeforces Round 248 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1790D\":[\"Matryoshkas\",18528,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1790\\\"\\u003eCodeforces Round 847 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-203A\":[\"Two Problems\",4445,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/203\\\"\\u003eCodeforces Round 128 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-445A\":[\"DZY Loves Chessboard\",29912,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/445\\\"\\u003eCodeforces Round 254 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1245B\":[\"Restricted RPS\",14279,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1245\\\"\\u003eCodeforces Round 597 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1257C\":[\"Dominated Subarray\",16836,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1257\\\"\\u003eEducational Codeforces Round 76 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1487B\":[\"Cat Cycle\",20230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1487\\\"\\u003eEducational Codeforces Round 104 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-729B\":[\"Spotlights\",8196,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/729\\\"\\u003eTechnocup 2017 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1354B\":[\"Ternary String\",30490,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1354\\\"\\u003eEducational Codeforces Round 87 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-239A\":[\"Two Bags of Potatoes\",18882,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/239\\\"\\u003eCodeforces Round 148 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-717C\":[\"Potions Homework\",4129,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/717\\\"\\u003eBubble Cup 9 - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-959B\":[\"Mahmoud and Ehab and the message\",9647,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/959\\\"\\u003eCodeforces Round 473 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-934B\":[\"A Prosperous Lot\",9267,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/934\\\"\\u003eCodeforces Round 462 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-554B\":[\"Ohana Cleans Up\",10772,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/554\\\"\\u003eCodeforces Round 309 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-651B\":[\"Beautiful Paintings\",13003,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/651\\\"\\u003eCodeforces Round 345 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-990B\":[\"Micro-World\",8547,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/990\\\"\\u003eEducational Codeforces Round 45 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1909B\":[\"Make Almost Equal With Mod\",13757,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1909\\\"\\u003ePinely Round 3 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1951B\":[\"Battle Cows\",11575,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1951\\\"\\u003eCodeforces Global Round 25\\u003c/a\\u003e\"],\"CodeForces-1539C\":[\"Stable Groups\",21523,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1539\\\"\\u003eCodeforces Round 727 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-23A\":[\"You\\u0027re Given a String...\",6652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/23\\\"\\u003eCodeforces Beta Round 23\\u003c/a\\u003e\"],\"CodeForces-1406B\":[\"Maximum Product\",22846,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1406\\\"\\u003eCodeforces Round 670 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-432B\":[\"Football Kit\",12027,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/432\\\"\\u003eCodeforces Round 246 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-47B\":[\"Coins\",14371,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/47\\\"\\u003eCodeforces Beta Round 44 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-456B\":[\"Fedya and Maths\",18130,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/456\\\"\\u003eCodeforces Round 260 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1692E\":[\"Binary Deque\",20316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1692\\\"\\u003eCodeforces Round 799 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-59B\":[\"Fortune Telling\",7556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/59\\\"\\u003eCodeforces Beta Round 55 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-129B\":[\"Students and Shoelaces\",12546,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/129\\\"\\u003eCodeforces Beta Round 94 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1583B\":[\"Omkar and Heavenly Tree\",12015,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1583\\\"\\u003eTechnocup 2022 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-812A\":[\"Sagheer and Crossroads\",6578,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/812\\\"\\u003eCodeforces Round 417 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1191B\":[\"Tokitsukaze and Mahjong\",9775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1191\\\"\\u003eCodeforces Round 573 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1082A\":[\"Vasya and Book\",9066,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1082\\\"\\u003eEducational Codeforces Round 55 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-892B\":[\"Wrath\",9991,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/892\\\"\\u003eCodeforces Round 446 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1419B\":[\"Stairs\",16343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1419\\\"\\u003eCodeforces Round 671 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1118B\":[\"Tanya and Candies\",12334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1118\\\"\\u003eCodeforces Round 540 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-350A\":[\"TL\",16640,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/350\\\"\\u003eCodeforces Round 203 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1203B\":[\"Equal Rectangles\",16249,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1203\\\"\\u003eCodeforces Round 579 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1922B\":[\"Forming Triangles\",19093,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1922\\\"\\u003eEducational Codeforces Round 161 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1934B\":[\"Yet Another Coin Problem\",16572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1934\\\"\\u003eCodeforces Round 931 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1227B\":[\"Box\",9465,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1227\\\"\\u003eTechnocup 2020 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1704C\":[\"Virus\",14500,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1704\\\"\\u003eCodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1433D\":[\"Districts Connection\",22316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1433\\\"\\u003eCodeforces Round 677 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1578E\":[\"Easy Scheduling\",3900,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1578\\\"\\u003eICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1881C\":[\"Perfect Square\",15958,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1881\\\"\\u003eCodeforces Round 903 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1174B\":[\"Ehab Is an Odd Person\",16198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1174\\\"\\u003eCodeforces Round 563 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-439B\":[\"Devu, the Dumb Guy\",14924,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/439\\\"\\u003eCodeforces Round 251 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1530C\":[\"Pursuit\",14660,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1530\\\"\\u003eCodeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine))\\u003c/a\\u003e\"],\"CodeForces-5B\":[\"Center Alignment\",6180,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/5\\\"\\u003eCodeforces Beta Round 5\\u003c/a\\u003e\"],\"CodeForces-645A\":[\"Amity Assessment\",3558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/645\\\"\\u003eCROC 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-754A\":[\"Lesha and array splitting\",9377,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/754\\\"\\u003eCodeforces Round 390 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-875A\":[\"Classroom Watch\",9900,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/875\\\"\\u003eCodeforces Round 441 (Div. 1, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-645B\":[\"Mischievous Mess Makers\",3598,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/645\\\"\\u003eCROC 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-899B\":[\"Months and Years\",6199,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-960A\":[\"Check the string\",8795,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/960\\\"\\u003eDivide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1392C\":[\"Omkar and Waterslide\",18696,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1392\\\"\\u003eCodeforces Global Round 10\\u003c/a\\u003e\"],\"CodeForces-1608B\":[\"Build the Permutation\",11584,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1608\\\"\\u003eCodeforces Round 758 (Div.1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1826A\":[\"Trust Nobody\",14717,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1826\\\"\\u003eCodeforces Round 870 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1729D\":[\"Friends and the Restaurant\",19117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1729\\\"\\u003eCodeforces Round 820 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-592A\":[\"PawnChess\",6586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/592\\\"\\u003eCodeforces Round 328 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-72C\":[\"Extraordinarily Nice Numbers\",857,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/72\\\"\\u003eUnknown Language Round 2\\u003c/a\\u003e\"],\"CodeForces-1703E\":[\"Mirror Grid\",17048,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1703\\\"\\u003eCodeforces Round 806 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-361B\":[\"Levko and Permutation\",8559,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/361\\\"\\u003eCodeforces Round 210 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1800D\":[\"Remove Two Letters\",22312,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1800\\\"\\u003eCodeforces Round 855 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1933D\":[\"Turtle Tenacity: Continual Mods\",17718,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1933\\\"\\u003eCodeforces Round 929 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-143B\":[\"Help Kingdom of Far Far Away 2\",5237,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/143\\\"\\u003eCodeforces Round 102 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1214C\":[\"Bad Sequence\",13897,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1214\\\"\\u003eCodeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-131B\":[\"Opposites Attract\",7680,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/131\\\"\\u003eCodeforces Beta Round 95 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-385B\":[\"Bear and Strings\",10207,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/385\\\"\\u003eCodeforces Round 226 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1945C\":[\"Left and Right Houses\",12529,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1945\\\"\\u003eCodeforces Round 935 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-264A\":[\"Escape from Stones\",11313,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/264\\\"\\u003eCodeforces Round 162 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-928A\":[\"Login Verification\",3383,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/928\\\"\\u003eVK Cup 2018 - Квалификация 1\\u003c/a\\u003e\"],\"CodeForces-1076A\":[\"Minimizing the String\",13756,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1076\\\"\\u003eEducational Codeforces Round 54 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1311B\":[\"WeirdSort\",19697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1311\\\"\\u003eCodeforces Round 624 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1541B\":[\"Pleasant Pairs\",27268,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1541\\\"\\u003eCodeforces Round 728 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1553C\":[\"Penalty\",17642,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1553\\\"\\u003eHarbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-208D\":[\"Prizes, Prizes, more Prizes\",7753,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/208\\\"\\u003eCodeforces Round 130 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1294B\":[\"Collecting Packages\",22378,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1294\\\"\\u003eCodeforces Round 615 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1420B\":[\"Rock and Lever\",24837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1420\\\"\\u003eCodeforces Round 672 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1064B\":[\"Equations of Mathematical Magic\",7924,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1064\\\"\\u003eCodeforces Round 516 (Div. 2, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-1185B\":[\"Email from Polycarp\",13495,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1185\\\"\\u003eCodeforces Round 568 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1650C\":[\"Weight of the System of Nested Segments\",16801,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1650\\\"\\u003eCodeforces Round 776 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1076B\":[\"Divisor Subtraction\",13683,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1076\\\"\\u003eEducational Codeforces Round 54 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1674D\":[\"A-B-C Sort\",15989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1674\\\"\\u003eCodeforces Round 786 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-4B\":[\"Before an Exam\",25173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/4\\\"\\u003eCodeforces Beta Round 4 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-523A\":[\"Rotate, Flip and Zoom\",2740,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/523\\\"\\u003eVK Cup 2015 - Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-1270B\":[\"Interesting Subarray\",16578,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1270\\\"\\u003eGood Bye 2019\\u003c/a\\u003e\"],\"CodeForces-632A\":[\"Grandma Laura and Apples\",4831,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/632\\\"\\u003eEducational Codeforces Round 9\\u003c/a\\u003e\"],\"CodeForces-765C\":[\"Table Tennis Game 2\",7426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/765\\\"\\u003eCodeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-482A\":[\"Diverse Permutation\",10269,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/482\\\"\\u003eCodeforces Round 275 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1619C\":[\"Wrong Addition\",20898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1619\\\"\\u003eCodeforces Round 762 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-591B\":[\"Rebranding\",8966,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/591\\\"\\u003eCodeforces Round 327 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1334A\":[\"Level Statistics\",23095,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1334\\\"\\u003eEducational Codeforces Round 85 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1455B\":[\"Jumps\",21796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1455\\\"\\u003eEducational Codeforces Round 99 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1104B\":[\"Game with string\",16519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1104\\\"\\u003eCodeforces Round 534 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1859C\":[\"Another Permutation Problem\",16428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1859\\\"\\u003eCodeforces Round 892 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-38B\":[\"Chess\",3857,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/38\\\"\\u003eSchool Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-401B\":[\"Sereja and Contests\",4647,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/401\\\"\\u003eCodeforces Round 235 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1213C\":[\"Book Reading\",18940,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-413A\":[\"Data Recovery\",2716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/413\\\"\\u003eCoder-Strike 2014 - Round 2\\u003c/a\\u003e\"],\"CodeForces-903B\":[\"The Modcrab\",8621,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-304A\":[\"Pythagorean Theorem II\",11134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/304\\\"\\u003eCodeforces Round 183 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-903C\":[\"Boxes Packing\",19166,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1051A\":[\"Vasya And Password\",8589,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1051\\\"\\u003eEducational Codeforces Round 51 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1075B\":[\"Taxi drivers and Lyft\",4422,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1075\\\"\\u003eLyft Level 5 Challenge 2018 - Final Round (Open Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1196B\":[\"Odd Sum Segments\",17295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1196\\\"\\u003eCodeforces Round 575 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1099C\":[\"Postcard\",9796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1099\\\"\\u003eCodeforces Round 530 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-546B\":[\"Soldier and Badges\",18790,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/546\\\"\\u003eCodeforces Round 304 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-522A\":[\"Reposts\",16932,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/522\\\"\\u003eVK Cup 2015 - Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-982A\":[\"Row\",9807,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/982\\\"\\u003eCodeforces Round 484 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-776B\":[\"Sherlock and his girlfriend\",21156,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/776\\\"\\u003eICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-631B\":[\"Print Check\",7829,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/631\\\"\\u003eCodeforces Round 344 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-740B\":[\"Alyona and flowers\",8675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/740\\\"\\u003eCodeforces Round 381 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1848B\":[\"Vika and the Bridge\",13411,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1848\\\"\\u003eCodeforces Round 885 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1369B\":[\"AccurateLee\",24307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1369\\\"\\u003eCodeforces Round 652 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-262B\":[\"Roma and Changing Signs\",11364,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/262\\\"\\u003eCodeforces Round 160 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1822D\":[\"Super-Permutation\",16144,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1822\\\"\\u003eCodeforces Round 867 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1006C\":[\"Three Parts of the Array\",22156,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1006\\\"\\u003eCodeforces Round 498 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1846C\":[\"Rudolf and the Another Competition\",18190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1846\\\"\\u003eCodeforces Round 883 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1713C\":[\"Build Permutation\",16983,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1713\\\"\\u003eCodeforces Round 812 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1834C\":[\"Game with Reversing\",12749,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1834\\\"\\u003eCodeforces Round 879 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1846D\":[\"Rudolph and Christmas Tree\",18536,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1846\\\"\\u003eCodeforces Round 883 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-298B\":[\"Sail\",14696,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/298\\\"\\u003eCodeforces Round 180 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-630R\":[\"Game\",8985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-1006B\":[\"Polycarp\\u0027s Practice\",13866,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1006\\\"\\u003eCodeforces Round 498 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-15A\":[\"Cottage Village\",3946,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/15\\\"\\u003eCodeforces Beta Round 15\\u003c/a\\u003e\"],\"CodeForces-27A\":[\"Next Test\",20940,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/27\\\"\\u003eCodeforces Beta Round 27 (Codeforces format, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-400B\":[\"Inna and New Matrix of Candies\",7800,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/400\\\"\\u003eCodeforces Round 234 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-412C\":[\"Pattern\",4097,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/412\\\"\\u003eCoder-Strike 2014 - Round 1\\u003c/a\\u003e\"],\"CodeForces-817A\":[\"Treasure Hunt\",6679,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"CodeForces-1200B\":[\"Block Adventure\",14210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1200\\\"\\u003eCodeforces Round 578 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-424B\":[\"Megacity\",8065,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/424\\\"\\u003eCodeforces Round 242 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-708A\":[\"Letters Cyclic Shift\",9259,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/708\\\"\\u003eAIM Tech Round 3 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-315B\":[\"Sereja and Array\",7418,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/315\\\"\\u003eCodeforces Round 187 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-914B\":[\"Conan and Agasa play a Card Game\",9087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-327B\":[\"Hungry Sequence\",20393,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/327\\\"\\u003eCodeforces Round 191 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-902B\":[\"Coloring a Tree\",11503,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/902\\\"\\u003eCodeforces Round 453 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1454C\":[\"Sequence Transformation\",21735,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1454\\\"\\u003eCodeforces Round 686 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1793C\":[\"Dora and Search\",19155,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1793\\\"\\u003eCodeforces Round 852 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-327A\":[\"Flipping Game\",42109,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/327\\\"\\u003eCodeforces Round 191 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-6C\":[\"Alice, Bob and Chocolate\",14956,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/6\\\"\\u003eCodeforces Beta Round 6 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-569B\":[\"Inventory\",7949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/569\\\"\\u003eCodeforces Round 315 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-787A\":[\"The Monster\",12201,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/787\\\"\\u003eCodeforces Round 406 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-630B\":[\"Moore\\u0027s Law\",7569,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-1738B\":[\"Prefix Sum Addicts\",14952,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1738\\\"\\u003eCodeforces Global Round 22\\u003c/a\\u003e\"],\"CodeForces-492B\":[\"Vanya and Lanterns\",76220,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/492\\\"\\u003eCodeforces Round 280 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1207B\":[\"Square Filling\",13612,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1207\\\"\\u003eEducational Codeforces Round 71 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1546B\":[\"AquaMoon and Stolen String\",13091,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1546\\\"\\u003eCodeforces Round 732 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-88A\":[\"Chord\",3960,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/88\\\"\\u003eCodeforces Beta Round 73 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-112B\":[\"Petya and Square\",4396,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/112\\\"\\u003eCodeforces Beta Round 85 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1679B\":[\"Stone Age Problem\",17229,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1679\\\"\\u003eCodeforces Round 791 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1914D\":[\"Three Activities\",18174,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1914\\\"\\u003eCodeforces Round 916 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-342A\":[\"Xenia and Divisors\",12923,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/342\\\"\\u003eCodeforces Round 199 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-463A\":[\"Caisa and Sugar\",9610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/463\\\"\\u003eCodeforces Round 264 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1328C\":[\"Ternary XOR\",30172,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1328\\\"\\u003eCodeforces Round 629 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1437B\":[\"Reverse Binary Strings\",19218,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1437\\\"\\u003eEducational Codeforces Round 97 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-366B\":[\"Dima and To-do List\",6998,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/366\\\"\\u003eCodeforces Round 214 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1154B\":[\"Make Them Equal\",17011,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1154\\\"\\u003eCodeforces Round 552 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1130B\":[\"Two Cakes\",8133,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1130\\\"\\u003eCodeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1384A\":[\"Common Prefixes\",18863,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1384\\\"\\u003eCodeforces Round 659 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-637B\":[\"Chat Order\",19486,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/637\\\"\\u003eVK Cup 2016 - Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-408B\":[\"Garland\",9291,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/408\\\"\\u003eCodeforces Round 239 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-625B\":[\"War of the Corporations\",11773,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/625\\\"\\u003eCodeforces Round 342 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-879B\":[\"Table Tennis\",13511,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/879\\\"\\u003eCodeforces Round 443 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-722B\":[\"Verse Pattern\",6698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/722\\\"\\u003eIntel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-9B\":[\"Running Student\",5681,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/9\\\"\\u003eCodeforces Beta Round 9 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1510K\":[\"King\\u0027s Task\",5374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1510\\\"\\u003e2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-9C\":[\"Hexadecimal\\u0027s Numbers\",13447,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/9\\\"\\u003eCodeforces Beta Round 9 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-940A\":[\"Points on the line\",8904,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/940\\\"\\u003eCodeforces Round 466 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1903B\":[\"StORage room\",11351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1903\\\"\\u003eCodeforces Round 912 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-180F\":[\"Mathematical Analysis Rocks!\",2535,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/180\\\"\\u003eCodeforces Round 116 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-560B\":[\"Gerald is into Art\",8413,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/560\\\"\\u003eCodeforces Round 313 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-53C\":[\"Little Frog\",6863,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/53\\\"\\u003eCodeforces Beta Round 49 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1315C\":[\"Restoring Permutation\",10136,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1315\\\"\\u003eCodeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine)\\u003c/a\\u003e\"],\"CodeForces-1763B\":[\"Incinerate\",14197,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1763\\\"\\u003eCodeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT\\u003c/a\\u003e\"],\"CodeForces-1799B\":[\"Equalize by Divide\",10889,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1799\\\"\\u003eCodeforces Round 854 by cybercats (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1339B\":[\"Sorted Adjacent Differences\",26610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1339\\\"\\u003eCodeforces Round 633 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-353A\":[\"Domino\",18324,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/353\\\"\\u003eCodeforces Round 205 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1327B\":[\"Princesses and Princes\",18688,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1327\\\"\\u003eEducational Codeforces Round 84 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1068B\":[\"LCM\",12265,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1068\\\"\\u003eCodeforces Round 518 (Div. 2) [Thanks, Mail.Ru!]\\u003c/a\\u003e\"],\"CodeForces-1371B\":[\"Magical Calendar\",19251,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1371\\\"\\u003eCodeforces Round 654 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-908B\":[\"New Year and Buggy Bot\",8458,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"CodeForces-1872D\":[\"Plus Minus Permutation\",21149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1872\\\"\\u003eCodeforces Round 895 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1032B\":[\"Personalized Cup\",5003,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1032\\\"\\u003eTechnocup 2019 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1153B\":[\"Serval and Toy Bricks\",9356,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1153\\\"\\u003eCodeforces Round 551 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1860B\":[\"Fancy Coins\",16125,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1860\\\"\\u003eEducational Codeforces Round 153 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-999C\":[\"Alphabetic Removals\",18463,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/999\\\"\\u003eCodeforces Round 490 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-769B\":[\"News About Credit\",3326,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/769\\\"\\u003eVK Cup 2017 - Qualification 1\\u003c/a\\u003e\"],\"CodeForces-854B\":[\"Maxim Buys an Apartment\",8872,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/854\\\"\\u003eCodeforces Round 433 (Div. 2, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-842A\":[\"Kirill And The Game\",11063,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/842\\\"\\u003eCodeforces Round 430 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-612B\":[\"HDD is Outdated Technology\",7491,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/612\\\"\\u003eEducational Codeforces Round 4\\u003c/a\\u003e\"],\"CodeForces-8A\":[\"Train and Peter\",6102,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/8\\\"\\u003eCodeforces Beta Round 8\\u003c/a\\u003e\"],\"CodeForces-1926C\":[\"Vlad and a Sum of Sum of Digits\",23060,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1926\\\"\\u003eCodeforces Round 928 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-474B\":[\"Worms\",49844,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/474\\\"\\u003eCodeforces Round 271 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-583B\":[\"Robot\\u0027s Task\",9142,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/583\\\"\\u003eCodeforces Round 323 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1205A\":[\"Almost Equal\",14059,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1205\\\"\\u003eCodeforces Round 580 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1641A\":[\"Great Sequence\",17635,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1641\\\"\\u003eCodeforces Round 773 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-340A\":[\"The Wall\",8308,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/340\\\"\\u003eCodeforces Round 198 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-461A\":[\"Appleman and Toastman\",15996,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/461\\\"\\u003eCodeforces Round 263 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-255B\":[\"Code Parsing\",5328,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/255\\\"\\u003eCodeforces Round 156 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-18C\":[\"Stripe\",14311,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/18\\\"\\u003eCodeforces Beta Round 18 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-134A\":[\"Average Numbers\",4228,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/134\\\"\\u003eCodeforces Testing Round 3\\u003c/a\\u003e\"],\"CodeForces-1491B\":[\"Minimal Cost\",13722,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1491\\\"\\u003eCodeforces Global Round 13\\u003c/a\\u003e\"],\"CodeForces-1140B\":[\"Good String\",11701,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1140\\\"\\u003eEducational Codeforces Round 62 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1043B\":[\"Lost Array\",6434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1043\\\"\\u003eCodeforces Round 519 by Botan Investments\\u003c/a\\u003e\"],\"CodeForces-1520D\":[\"Same Differences\",45596,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1520\\\"\\u003eCodeforces Round 719 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-998B\":[\"Cutting\",13689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/998\\\"\\u003eCodeforces Round 493 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-514A\":[\"Chewbaсca and Number\",50379,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/514\\\"\\u003eCodeforces Round 291 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-659C\":[\"Tanya and Toys\",12334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/659\\\"\\u003eCodeforces Round 346 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1140D\":[\"Minimum Triangulation\",13313,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1140\\\"\\u003eEducational Codeforces Round 62 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-732C\":[\"Sanatorium\",10194,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/732\\\"\\u003eCodeforces Round 377 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1925B\":[\"A Balanced Problemset?\",18669,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1925\\\"\\u003eCodeforces Round 921 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-63B\":[\"Settlers\\u0027 Training\",5255,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/63\\\"\\u003eCodeforces Beta Round 59 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-133B\":[\"Unary\",9095,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/133\\\"\\u003eCodeforces Beta Round 96 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-254A\":[\"Cards with Numbers\",7120,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/254\\\"\\u003eCodeforces Round 155 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-387B\":[\"George and Round\",12608,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/387\\\"\\u003eCodeforces Round 227 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1935B\":[\"Informatics in MAC\",16347,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1935\\\"\\u003eCodeforces Round 932 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-145A\":[\"Lucky Conversion\",7542,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/145\\\"\\u003eCodeforces Round 104 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1272C\":[\"Yet Another Broken Keyboard\",26249,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1272\\\"\\u003eCodeforces Round 605 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1870B\":[\"Friendly Arrays\",13390,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1870\\\"\\u003eCodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1272B\":[\"Snow Walking Robot\",14117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1272\\\"\\u003eCodeforces Round 605 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1042B\":[\"Vitamins\",15777,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1042\\\"\\u003eCodeforces Round 510 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-743A\":[\"Vladik and flights\",11733,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/743\\\"\\u003eCodeforces Round 384 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-779C\":[\"Dishonest Sellers\",12849,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/779\\\"\\u003eCodeforces Round 402 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-961B\":[\"Lecture Sleep\",22168,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/961\\\"\\u003eEducational Codeforces Round 41 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-743B\":[\"Chloe and the sequence\",15446,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/743\\\"\\u003eCodeforces Round 384 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-985B\":[\"Switches and Lamps\",8208,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/985\\\"\\u003eEducational Codeforces Round 44 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1490D\":[\"Permutation Transformation\",20210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1490\\\"\\u003eCodeforces Round 702 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-593A\":[\"2Char\",6434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/593\\\"\\u003eCodeforces Round 329 (Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1713880014000,"title":"CodeForces rating 1200 题目集","dislikeCnt":0,"content":"[problem:CodeForces-492B] Vanya and Lanterns二分搜索(binary search),实现问题,编程技巧,模拟(implementation),数学(math),排序算法(sortings)\n[problem:CodeForces-466A] Cheap Travel实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1352C] K-th Not Divisible by n二分搜索(binary search),数学(math)\n[problem:CodeForces-489B] BerSU Ball深度优先搜索及其变种(dfs and similar),动态规划(dp),图匹配(graph matchings),贪心策略(greedy),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-514A] Chewbaсca and Number贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-474B] Worms二分搜索(binary search),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1520D] Same Differences数据结构(data structures),哈希表(hashing),数学(math)\n[problem:CodeForces-327A] Flipping Game暴力枚举(brute force),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1343C] Alternating Subsequence动态规划(dp),贪心策略(greedy),双指针算法(two pointers)\n[problem:CodeForces-433B] Kuriyama Mirai\u0027s Stones动态规划(dp),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1352B] Same Parity Summands构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-1363A] Odd Selection暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-977C] Less or Equal排序算法(sortings)\n[problem:CodeForces-459A] Pashmak and Garden实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1328C] Ternary XOR贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1354B] Ternary String二分搜索(binary search),动态规划(dp),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-445A] DZY Loves Chessboard深度优先搜索及其变种(dfs and similar),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1399C] Boats Competition暴力枚举(brute force),贪心策略(greedy),双指针算法(two pointers)\n[problem:CodeForces-1364A] XXXXX暴力枚举(brute force),数据结构(data structures),数论(number theory),双指针算法(two pointers)\n[problem:CodeForces-1097B] Petr and a Combination Lock位掩码(bitmasks),暴力枚举(brute force),动态规划(dp)\n[problem:CodeForces-1541B] Pleasant Pairs暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-1537C] Challenging Cliffs构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1385C] Make It Good贪心策略(greedy)\n[problem:CodeForces-1472D] Even-Odd Game动态规划(dp),博弈论(games),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1339B] Sorted Adjacent Differences构造算法(constructive algorithms),排序算法(sortings)\n[problem:CodeForces-1355A] Sequence with Digits暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1272C] Yet Another Broken Keyboard组合数学(combinatorics),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1355B] Young Explorers动态规划(dp),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1369B] AccurateLee贪心策略(greedy),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-4B] Before an Exam构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1420B] Rock and Lever位掩码(bitmasks),数学(math)\n[problem:CodeForces-1409C] Yet Another Array Restoration暴力枚举(brute force),数学(math),数论(number theory)\n[problem:CodeForces-1857C] Assembly via Minimums贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1334A] Level Statistics实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1926C] Vlad and a Sum of Sum of Digits动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1514B] AND 0,Sum Big位掩码(bitmasks),组合数学(combinatorics),数学(math)\n[problem:CodeForces-1613C] Poisoned Dagger二分搜索(binary search)\n[problem:CodeForces-285C] Building Permutation贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1406B] Maximum Product暴力枚举(brute force),动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1433D] Districts Connection构造算法(constructive algorithms),深度优先搜索及其变种(dfs and similar)\n[problem:CodeForces-1512D] Corrupted Array构造算法(constructive algorithms),数据结构(data structures),贪心策略(greedy)\n[problem:CodeForces-1742E] Scuza二分搜索(binary search),贪心策略(greedy),数学(math)\n[problem:CodeForces-1800D] Remove Two Letters数据结构(data structures),贪心策略(greedy),哈希表(hashing),字符串处理(strings)\n[problem:CodeForces-1455B] Jumps构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-1133C] Balanced Team排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1294B] Collecting Packages实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1539C] Stable Groups贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1454C] Sequence Transformation贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1872D] Plus Minus Permutation数学(math)\n[problem:CodeForces-217A] Ice Skating暴力枚举(brute force),深度优先搜索及其变种(dfs and similar),并查集(dsu),图论(graphs)\n[problem:CodeForces-1747C] Swap Game博弈论(games)\n[problem:CodeForces-1619C] Wrong Addition实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1744D] Divisibility by 2^n贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1792B] Stand-up Comedian贪心策略(greedy),数学(math)\n[problem:CodeForces-1006C] Three Parts of the Array二分搜索(binary search),数据结构(data structures),双指针算法(two pointers)\n[problem:CodeForces-1221C] Perfect Team二分搜索(binary search),数学(math)\n[problem:CodeForces-1598C] Delete Two Elements数据结构(data structures),动态规划(dp),实现问题,编程技巧,模拟(implementation),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1692E] Binary Deque二分搜索(binary search),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-1559C] Mocha and Hiking构造算法(constructive algorithms),图论(graphs)\n[problem:CodeForces-1487B] Cat Cycle数学(math),数论(number theory)\n[problem:CodeForces-1512C] A-B Palindrome构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-27A] Next Test实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-776B] Sherlock and his girlfriend构造算法(constructive algorithms),数论(number theory)\n[problem:CodeForces-961B] Lecture Sleep数据结构(data structures),动态规划(dp),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-1371B] Magical Calendar数学(math)\n[problem:CodeForces-327B] Hungry Sequence数学(math)\n[problem:CodeForces-1922B] Forming Triangles组合数学(combinatorics),构造算法(constructive algorithms),数学(math),排序算法(sortings)\n[problem:CodeForces-1490D] Permutation Transformation深度优先搜索及其变种(dfs and similar),分治算法(divide and conquer),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1729D] Friends and the Restaurant贪心策略(greedy),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1437B] Reverse Binary Strings构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1694B] Paranoid String构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1311B] WeirdSort深度优先搜索及其变种(dfs and similar),排序算法(sortings)\n[problem:CodeForces-1497B] M-arrays构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-1656C] Make Equal With Mod构造算法(constructive algorithms),数学(math),数论(number theory),排序算法(sortings)\n[problem:CodeForces-1384A] Common Prefixes构造算法(constructive algorithms),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1392C] Omkar and Waterslide贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1362B] Johnny and His Hobbies位掩码(bitmasks),暴力枚举(brute force)\n[problem:CodeForces-1327B] Princesses and Princes暴力枚举(brute force),图论(graphs),贪心策略(greedy)\n[problem:CodeForces-1846D] Rudolph and Christmas Tree构造算法(constructive algorithms),计算几何(geometry),数学(math)\n[problem:CodeForces-1907C] Removal of Unattractive Pairs构造算法(constructive algorithms),贪心策略(greedy),数学(math),字符串处理(strings)\n[problem:CodeForces-239A] Two Bags of Potatoes贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1832C] Contrast Value贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1790D] Matryoshkas数据结构(data structures),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1925B] A Balanced Problemset?暴力枚举(brute force),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1793C] Dora and Search构造算法(constructive algorithms),数据结构(data structures),双指针算法(two pointers)\n[problem:CodeForces-1213C] Book Reading数学(math)\n[problem:CodeForces-1914D] Three Activities暴力枚举(brute force),动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1846C] Rudolf and the Another Competition构造算法(constructive algorithms),数据结构(data structures),动态规划(dp),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1594C] Make Them Equal暴力枚举(brute force),贪心策略(greedy),数学(math),字符串处理(strings)\n[problem:CodeForces-454B] Little Pony and Sort by Shift实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-353A] Domino实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1536B] Prinzessin der Verurteilung暴力枚举(brute force),构造算法(constructive algorithms),字符串处理(strings)\n[problem:CodeForces-1641A] Great Sequence暴力枚举(brute force),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1933D] Turtle Tenacity: Continual Mods构造算法(constructive algorithms),贪心策略(greedy),数学(math),数论(number theory),排序算法(sortings)\n[problem:CodeForces-1637C] Andrew and Stones贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1553C] Penalty位掩码(bitmasks),暴力枚举(brute force),动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1669G] Fall Down深度优先搜索及其变种(dfs and similar),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1736B] Playing with GCD数学(math),数论(number theory)\n[problem:CodeForces-999C] Alphabetic Removals实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1504B] Flip the Bits构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-546B] Soldier and Badges暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1843D] Apple Tree组合数学(combinatorics),深度优先搜索及其变种(dfs and similar),动态规划(dp),数学(math),树形结构(trees)\n[problem:CodeForces-1681C] Double Sort实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1375B] Neighbor Grid构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1679B] Stone Age Problem数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1669E] 2-Letter Strings数据结构(data structures),数学(math),字符串处理(strings)\n[problem:CodeForces-1713C] Build Permutation构造算法(constructive algorithms),动态规划(dp),数学(math)\n[problem:CodeForces-1734C] Removing Smallest Multiples贪心策略(greedy),数学(math)\n[problem:CodeForces-1703E] Mirror Grid实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1495A] Diamond Miner计算几何(geometry),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1485B] Replace and Keep Sorted动态规划(dp),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1916C] Training Before the Olympiad构造算法(constructive algorithms),博弈论(games),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1657C] Bracket Sequence Deletion贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1853B] Fibonaccharsis二分搜索(binary search),暴力枚举(brute force),数学(math)\n[problem:CodeForces-1029B] Creating the Contest动态规划(dp),贪心策略(greedy),数学(math)\n[problem:CodeForces-1650C] Weight of the System of Nested Segments贪心策略(greedy),哈希表(hashing),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-903C] Boxes Packing贪心策略(greedy)\n[problem:CodeForces-1934B] Yet Another Coin Problem暴力枚举(brute force),动态规划(dp),贪心策略(greedy),数学(math)\n[problem:CodeForces-1635C] Differential Sorting构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1720C] Corners贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1154B] Make Them Equal数学(math)\n[problem:CodeForces-1941D] Rudolf and the Ball Game深度优先搜索及其变种(dfs and similar),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1859C] Another Permutation Problem暴力枚举(brute force),动态规划(dp),贪心策略(greedy),数学(math)\n[problem:CodeForces-1935B] Informatics in MAC构造算法(constructive algorithms)\n[problem:CodeForces-1196B] Odd Sum Segments构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-1730C] Minimum Notation数据结构(data structures),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-456B] Fedya and Maths数学(math),数论(number theory)\n[problem:CodeForces-1270B] Interesting Subarray构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-1419B] Stairs暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1860B] Fancy Coins二分搜索(binary search),暴力枚举(brute force),贪心策略(greedy),数学(math)\n[problem:CodeForces-350A] TL暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1822D] Super-Permutation构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-1671C] Dolce Vita二分搜索(binary search),暴力枚举(brute force),贪心策略(greedy),数学(math)\n[problem:CodeForces-1674D] A-B-C Sort构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1881C] Perfect Square暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-522A] Reposts,深度优先搜索及其变种(dfs and similar),动态规划(dp),图论(graphs),树形结构(trees)\n[problem:CodeForces-1874A] Jellyfish and Game暴力枚举(brute force),博弈论(games),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1592B] Hemose Shopping构造算法(constructive algorithms),并查集(dsu),数学(math),排序算法(sortings)\n[problem:CodeForces-1257C] Dominated Subarray贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings),字符串处理(strings),双指针算法(two pointers)\n[problem:CodeForces-1203B] Equal Rectangles贪心策略(greedy),数学(math)\n[problem:CodeForces-913B] Christmas Spruce实现问题,编程技巧,模拟(implementation),树形结构(trees)\n[problem:CodeForces-552B] Vanya and Books实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-461A] Appleman and Toastman贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1174B] Ehab Is an Odd Person排序算法(sortings)\n[problem:CodeForces-1042B] Vitamins位掩码(bitmasks),暴力枚举(brute force),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1886B] Fear of the Dark二分搜索(binary search),计算几何(geometry),数学(math)\n[problem:CodeForces-1647B] Madoka and the Elegant Gift暴力枚举(brute force),构造算法(constructive algorithms),图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1928B] Equalize二分搜索(binary search),贪心策略(greedy),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-637B] Chat Order,二分搜索(binary search),构造算法(constructive algorithms),数据结构(data structures),排序算法(sortings)\n[problem:CodeForces-285B] Find Marble实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1738B] Prefix Sum Addicts构造算法(constructive algorithms),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1277B] Make Them Odd贪心策略(greedy),数论(number theory)\n[problem:CodeForces-1149A] Prefix Sum Primes构造算法(constructive algorithms),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1808B] Playing in a Casino数学(math),排序算法(sortings)\n[problem:CodeForces-1826A] Trust Nobody暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1104B] Game with string数据结构(data structures),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1131C] Birthday二分搜索(binary search),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1704C] Virus贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1582C] Grandma Capa Knits a Scarf暴力枚举(brute force),数据结构(data structures),贪心策略(greedy),字符串处理(strings),双指针算法(two pointers)\n[problem:CodeForces-1530C] Pursuit二分搜索(binary search),暴力枚举(brute force),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-743B] Chloe and the sequence二分搜索(binary search),位掩码(bitmasks),构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1428B] Belted Rooms图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-439B] Devu,the Dumb Guy实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-714B] Filya and Homework实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1954B] Make It Ugly实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1954C] Long Multiplication贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1763B] Incinerate二分搜索(binary search),暴力枚举(brute force),数据结构(data structures),实现问题,编程技巧,模拟(implementation),数学(math),排序算法(sortings)\n[problem:CodeForces-1205A] Almost Equal构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-1909B] Make Almost Equal With Mod位掩码(bitmasks),构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-1200B] Block Adventure动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1491B] Minimal Cost暴力枚举(brute force),数学(math)\n[problem:CodeForces-298B] Sail暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1272B] Snow Walking Robot构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1245B] Restricted RPS构造算法(constructive algorithms),动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1870B] Friendly Arrays位掩码(bitmasks),贪心策略(greedy),数学(math)\n[problem:CodeForces-1848B] Vika and the Bridge二分搜索(binary search),数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math),排序算法(sortings)\n[problem:CodeForces-1517B] Morning Jogging构造算法(constructive algorithms),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-47B] Coins实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-6C] Alice,Bob and Chocolate贪心策略(greedy),双指针算法(two pointers)\n[problem:CodeForces-1207B] Square Filling构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1185B] Email from Polycarp实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1546B] AquaMoon and Stolen String交互性问题(interactive),数学(math)\n[problem:CodeForces-1076A] Minimizing the String贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1214C] Bad Sequence数据结构(data structures),贪心策略(greedy)\n[problem:CodeForces-1006B] Polycarp\u0027s Practice贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1102C] Doors Breaking and Repairing博弈论(games)\n[problem:CodeForces-998B] Cutting动态规划(dp),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-78B] Easter Eggs构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1834C] Game with Reversing博弈论(games),贪心策略(greedy),数学(math),字符串处理(strings)\n[problem:CodeForces-1076B] Divisor Subtraction实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-18C] Stripe数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1140D] Minimum Triangulation动态规划(dp),贪心策略(greedy),数学(math)\n[problem:CodeForces-9C] Hexadecimal\u0027s Numbers暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1133B] Preparation for International Women\u0027s Day数学(math),数论(number theory)\n[problem:CodeForces-1945C] Left and Right Houses暴力枚举(brute force)\n[problem:CodeForces-342A] Xenia and Divisors贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1583B] Omkar and Heavenly Tree构造算法(constructive algorithms),树形结构(trees)\n[problem:CodeForces-387B] George and Round暴力枚举(brute force),贪心策略(greedy),双指针算法(two pointers)\n[problem:CodeForces-879B] Table Tennis数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1155B] Game with Telephone Numbers博弈论(games),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-129B] Students and Shoelaces暴力枚举(brute force),深度优先搜索及其变种(dfs and similar),图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1118B] Tanya and Candies实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-779C] Dishonest Sellers构造算法(constructive algorithms),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-701B] Cells Not Under Attack数据结构(data structures),数学(math)\n[problem:CodeForces-432B] Football Kit暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1608B] Build the Permutation构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-659C] Tanya and Toys贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-651B] Beautiful Paintings贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1015B] Obtaining the String实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1305B] Kuroni and Simple Strings构造算法(constructive algorithms),贪心策略(greedy),字符串处理(strings),双指针算法(two pointers)\n[problem:CodeForces-1903B] StORage room位掩码(bitmasks),暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1951B] Battle Cows二分搜索(binary search),数据结构(data structures),贪心策略(greedy)\n[problem:CodeForces-1140B] Good String实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-682B] Alyona and Mex排序算法(sortings)\n[problem:CodeForces-1068B] LCM数学(math),数论(number theory)\n[problem:CodeForces-787A] The Monster暴力枚举(brute force),数学(math),数论(number theory)\n[problem:CodeForces-1581B] Diameter of Graph构造算法(constructive algorithms),图论(graphs),贪心策略(greedy),数学(math)\n[problem:CodeForces-262B] Roma and Changing Signs贪心策略(greedy)\n[problem:CodeForces-743A] Vladik and flights构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-911B] Two Cakes二分搜索(binary search),暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1799B] Equalize by Divide暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-264A] Escape from Stones构造算法(constructive algorithms),数据结构(data structures),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-1091B] New Year and the Treasure Geolocation暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-431B] Shower Line暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-902B] Coloring a Tree深度优先搜索及其变种(dfs and similar),并查集(dsu),贪心策略(greedy)\n[problem:CodeForces-222A] Shooshuns and Sequence暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-304A] Pythagorean Theorem II暴力枚举(brute force),数学(math)\n[problem:CodeForces-625B] War of the Corporations构造算法(constructive algorithms),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1877C] Joyboard数学(math),数论(number theory)\n[problem:CodeForces-842A] Kirill And The Game暴力枚举(brute force),双指针算法(two pointers)\n[problem:CodeForces-1143B] Nirvana暴力枚举(brute force),数学(math),数论(number theory)\n[problem:CodeForces-31A] Worms Evolution实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-489A] SwapSort贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1011B] Planning The Expedition二分搜索(binary search),暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1315C] Restoring Permutation贪心策略(greedy)\n[problem:CodeForces-1100C] NN and the Optical Illusion二分搜索(binary search),计算几何(geometry),数学(math)\n[problem:CodeForces-554B] Ohana Cleans Up暴力枚举(brute force),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1023C] Bracket Subsequence贪心策略(greedy)\n[problem:CodeForces-482A] Diverse Permutation构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-385B] Bear and Strings暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math),字符串处理(strings)\n[problem:CodeForces-875A] Classroom Watch暴力枚举(brute force),数学(math)\n[problem:CodeForces-732C] Sanatorium二分搜索(binary search),构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1191B] Tokitsukaze and Mahjong暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1099C] Postcard构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1227B] Box构造算法(constructive algorithms)\n[problem:CodeForces-870B] Maximum of Maximums of Minimums贪心策略(greedy)\n[problem:CodeForces-463A] Caisa and Sugar暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-959B] Mahmoud and Ehab and the message并查集(dsu),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1017B] The Bits实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-574A] Bear and Elections贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-982A] Row暴力枚举(brute force),构造算法(constructive algorithms)\n[problem:CodeForces-1153B] Serval and Toy Bricks构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-708A] Letters Cyclic Shift构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-408B] Garland实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1028B] Unnatural Conditions构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-892B] Wrath贪心策略(greedy),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-344B] Simple Molecules暴力枚举(brute force),图论(graphs),数学(math)\n[problem:CodeForces-133B] Unary实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-583B] Robot\u0027s Task贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1000A] Codehorses T-shirts贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1121B] Mike and Children暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-754A] Lesha and array splitting构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-934B] A Prosperous Lot构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-660A] Co-prime Array贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-1023A] Single Wildcard Pattern Matching暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-914B] Conan and Agasa play a Card Game博弈论(games),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1082A] Vasya and Book实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-749B] Parallelogram is Back暴力枚举(brute force),构造算法(constructive algorithms),计算几何(geometry)\n[problem:CodeForces-1051A] Vasya And Password贪心策略(greedy),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-630R] Game博弈论(games),数学(math)\n[problem:CodeForces-940A] Points on the line暴力枚举(brute force),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-591B] Rebranding实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-854B] Maxim Buys an Apartment构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-740B] Alyona and flowers构造算法(constructive algorithms)\n[problem:CodeForces-1027B] Numbers on the Chessboard实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-960A] Check the string实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-990B] Micro-World贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-361B] Levko and Permutation构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-560B] Gerald is into Art构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-828A] Restaurant Tables实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-302B] Eugeny and Play List二分搜索(binary search),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-606A] Magic Spheres实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-729B] Spotlights动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1130B] Two Cakes贪心策略(greedy)\n[problem:CodeForces-1084B] Kvass and the Fair Nut贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-292B] Network Topology图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-908B] New Year and Buggy Bot暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-903B] The Modcrab贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-208D] Prizes,Prizes,more Prizes实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1013B] And贪心策略(greedy)\n[problem:CodeForces-1064B] Equations of Mathematical Magic数学(math)\n[problem:CodeForces-340A] The Wall数学(math)\n[problem:CodeForces-424B] Megacity二分搜索(binary search),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-400B] Inna and New Matrix of Candies暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),调度算法(schedules)\n[problem:CodeForces-985B] Switches and Lamps实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-631B] Print Check构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-379B] New Year Present构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-920B] Tea Queue实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-931B] World Cup构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-989B] A Tide of Riverscape构造算法(constructive algorithms),字符串处理(strings)\n[problem:CodeForces-145A] Lucky Conversion贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-630B] Moore\u0027s Law数学(math)\n[problem:CodeForces-569B] Inventory贪心策略(greedy),数学(math)\n[problem:CodeForces-131B] Opposites Attract实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-315B] Sereja and Array实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-254A] Cards with Numbers构造算法(constructive algorithms),排序算法(sortings)\n[problem:CodeForces-765C] Table Tennis Game 2数学(math)\n[problem:CodeForces-612B] HDD is Outdated Technology实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-366B] Dima and To-do List暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-59B] Fortune Telling实现问题,编程技巧,模拟(implementation),数论(number theory)\n[problem:CodeForces-895A] Pizza Separation暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-811B] Vladik and Complicated Book实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-803B] Distances to Zero构造算法(constructive algorithms)\n[problem:CodeForces-722B] Verse Pattern实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-794B] Cutting Carrot计算几何(geometry),数学(math)\n[problem:CodeForces-592A] PawnChess实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-151B] Phone Numbers实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-53C] Little Frog构造算法(constructive algorithms)\n[problem:CodeForces-1043B] Lost Array实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-812A] Sagheer and Crossroads实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-817A] Treasure Hunt实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-639A] Bear and Displayed Friends实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-899B] Months and Years实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-593A] 2Char暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-5B] Center Alignment实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-8A] Train and Peter字符串处理(strings)\n[problem:CodeForces-186B] Growing Mushrooms贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1510K] King\u0027s Task暴力枚举(brute force),图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-9B] Running Student暴力枚举(brute force),计算几何(geometry),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-725B] Food on the Plane实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-23A] You\u0027re Given a String...暴力枚举(brute force),贪心策略(greedy)\n[problem:CodeForces-1032B] Personalized Cup\n[problem:CodeForces-216A] Tiling with Hexagons实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-143B] Help Kingdom of Far Far Away 2实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-255B] Code Parsing实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-63B] Settlers\u0027 Training实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-632A] Grandma Laura and Apples\n[problem:CodeForces-401B] Sereja and Contests贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-234A] Lefthanders and Righthanders实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-171A] Mysterious numbers - 1,构造算法(constructive algorithms)\n[problem:CodeForces-80B] Depression计算几何(geometry),数学(math)\n[problem:CodeForces-1075B] Taxi drivers and Lyft实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-203A] Two Problems暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-112B] Petya and Square实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-774C] Maximum Number,构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-79A] Bus Game贪心策略(greedy)\n[problem:CodeForces-717C] Potions Homework实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-412C] Pattern实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-33A] What is for dinner?贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-134A] Average Numbers暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-88A] Chord暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1578E] Easy Scheduling实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-101A] Homework贪心策略(greedy)\n[problem:CodeForces-15A] Cottage Village实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-194B] Square数学(math)\n[problem:CodeForces-38B] Chess暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-645A] Amity Assessment暴力枚举(brute force),构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-928A] Login Verification,字符串处理(strings)\n[problem:CodeForces-645B] Mischievous Mess Makers贪心策略(greedy),数学(math)\n[problem:CodeForces-55A] Flea travel实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-769B] News About Credit,贪心策略(greedy),双指针算法(two pointers)\n[problem:CodeForces-69B] Bets贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-802M] April Fools\u0027 Problem 贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-102A] Clothes暴力枚举(brute force)\n[problem:CodeForces-172B] Pseudorandom Sequence Period,实现问题,编程技巧,模拟(implementation),数论(number theory)\n[problem:CodeForces-48B] Land Lot暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-523A] Rotate,Flip and Zoom,实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-413A] Data Recovery实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-180F] Mathematical Analysis Rocks!构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-176A] Trading Business贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-72C] Extraordinarily Nice Numbers,数学(math)\n[problem:CodeForces-683A] The Check of the Point,计算几何(geometry)\n[problem:CodeForces-1001H] Oracle for f \u003d parity of the number of 1s in x","threadId":190419,"likeCnt":0,"createTime":1713880014000,"isWorkbook":true,"viewCnt":65,"openness":2,"fav":false,"id":4923,"trustable":false}