Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-20B\":[\"Equation\",4123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/20\\\"\\u003eCodeforces Alpha Round 20 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-207D3\":[\"The Beaver\\u0027s Problem - 3\",119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-196B\":[\"Infinite Maze\",2309,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/196\\\"\\u003eCodeforces Round 124 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1582E\":[\"Pchelyonok and Segments\",3657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1582\\\"\\u003eCodeforces Round 750 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-509C\":[\"Sums of Digits\",2247,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/509\\\"\\u003eCodeforces Round 289 (Div. 2, ACM ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1388D\":[\"Captain Flint and Treasure\",6279,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1388\\\"\\u003eCodeforces Round 660 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-509E\":[\"Pretty Song\",1891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/509\\\"\\u003eCodeforces Round 289 (Div. 2, ACM ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1248D1\":[\"The World Is Just a Programming Task (Easy Version)\",2380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1248\\\"\\u003eCodeforces Round 594 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-920F\":[\"SUM and REPLACE\",7052,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-207D2\":[\"The Beaver\\u0027s Problem - 3\",101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-44J\":[\"Triminoes\",629,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/44\\\"\\u003eSchool Team Contest 2 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-280A\":[\"Rectangle Puzzle\",1570,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/280\\\"\\u003eCodeforces Round 172 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-45E\":[\"Director\",556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/45\\\"\\u003eSchool Team Contest 3 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-21C\":[\"Stripe 2\",2401,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/21\\\"\\u003eCodeforces Alpha Round 21 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-33D\":[\"Knights\",1246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/33\\\"\\u003eCodeforces Beta Round 33 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-69C\":[\"Game\",589,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/69\\\"\\u003eCodeforces Beta Round 63 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-21B\":[\"Intersection\",1553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/21\\\"\\u003eCodeforces Alpha Round 21 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1266D\":[\"Decreasing Debts\",3482,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1266\\\"\\u003eCodeforces Global Round 6\\u003c/a\\u003e\"],\"CodeForces-1363E\":[\"Tree Shuffling\",6581,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1363\\\"\\u003eCodeforces Round 646 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-629C\":[\"Famil Door and Brackets\",2926,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/629\\\"\\u003eCodeforces Round 343 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-629D\":[\"Babaei and Birthday Cake\",4227,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/629\\\"\\u003eCodeforces Round 343 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1157F\":[\"Maximum Balanced Circle\",2607,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1157\\\"\\u003eCodeforces Round 555 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-749D\":[\"Leaving Auction\",2658,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/749\\\"\\u003eCodeforces Round 388 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1690G\":[\"Count the Trains\",3334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1690\\\"\\u003eCodeforces Round 797 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-171E\":[\"MYSTERIOUS LANGUAGE\",1437,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/171\\\"\\u003eApril Fools Day Contest\\u003c/a\\u003e\"],\"CodeForces-171C\":[\"A Piece of Cake\",1108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/171\\\"\\u003eApril Fools Day Contest\\u003c/a\\u003e\"],\"CodeForces-195E\":[\"Building Forest\",753,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/195\\\"\\u003eCodeforces Round 123 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-292C\":[\"Beautiful IP Addresses\",1008,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/292\\\"\\u003eCroc Champ 2013 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1827B1\":[\"Range Sorting (Easy Version)\",3642,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1827\\\"\\u003eCodeforces Round 873 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-66E\":[\"Petya and Post\",752,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/66\\\"\\u003eCodeforces Beta Round 61 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-54C\":[\"First Digit Law\",1441,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/54\\\"\\u003eCodeforces Beta Round 50\\u003c/a\\u003e\"],\"CodeForces-78C\":[\"Beaver Game\",2157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/78\\\"\\u003eCodeforces Beta Round 70 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1156C\":[\"Match Points\",6512,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1132F\":[\"Clear the String\",7811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1132\\\"\\u003eEducational Codeforces Round 61 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-615C\":[\"Running Track\",2388,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/615\\\"\\u003eCodeforces Round 338 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-615D\":[\"Multipliers\",4175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/615\\\"\\u003eCodeforces Round 338 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-954G\":[\"Castle Defense\",2163,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-954E\":[\"Water Taps\",1921,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1905D\":[\"Cyclic MEX\",3469,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1905\\\"\\u003eCodeforces Round 915 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-291E\":[\"Tree-String Problem\",1393,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/291\\\"\\u003eCroc Champ 2013 - Qualification Round\\u003c/a\\u003e\"],\"CodeForces-182C\":[\"Optimal Sum\",775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/182\\\"\\u003eCodeforces Round 117 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-43D\":[\"Journey\",1116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/43\\\"\\u003eCodeforces Beta Round 42 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-193B\":[\"Xor\",1038,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/193\\\"\\u003eCodeforces Round 122 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-207A3\":[\"Beaver\\u0027s Calculator 1.0\",217,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-31D\":[\"Chocolate\",1115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/31\\\"\\u003eCodeforces Beta Round 31 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1903E\":[\"Geo Game\",1809,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1903\\\"\\u003eCodeforces Round 912 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1288D\":[\"Minimax Problem\",7029,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1288\\\"\\u003eEducational Codeforces Round 80 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1385E\":[\"Directing Edges\",7055,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1385\\\"\\u003eCodeforces Round 656 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1010D\":[\"Mars rover\",2409,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1010\\\"\\u003eCodeforces Round 499 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1131D\":[\"Gourmet choice\",3271,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1131\\\"\\u003eCodeforces Round 541 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1288E\":[\"Messenger Simulator\",3512,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1288\\\"\\u003eEducational Codeforces Round 80 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-965C\":[\"Greedy Arkady\",2232,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/965\\\"\\u003eCodeforces Round 476 (Div. 2) [Thanks, Telegram!]\\u003c/a\\u003e\"],\"CodeForces-261C\":[\"Maxim and Matrix\",803,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/261\\\"\\u003eCodeforces Round 160 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-382B\":[\"Number Busters\",1554,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/382\\\"\\u003eCodeforces Round 224 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-176C\":[\"Playing with Superglue\",555,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/176\\\"\\u003eCroc Champ 2012 - Round 2\\u003c/a\\u003e\"],\"CodeForces-164B\":[\"Ancient Berland Hieroglyphs\",470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/164\\\"\\u003eVK Cup 2012 Round 3\\u003c/a\\u003e\"],\"CodeForces-1211D\":[\"Teams\",225,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1211\\\"\\u003eKotlin Heroes: Episode 2\\u003c/a\\u003e\"],\"CodeForces-1223D\":[\"Sequence Sorting\",4009,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1223\\\"\\u003eTechnocup 2020 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1029F\":[\"Multicolored Markers\",2640,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1029\\\"\\u003eCodeforces Round 506 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1344B\":[\"Monopole Magnets\",5864,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1344\\\"\\u003eCodeforces Round 639 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1574D\":[\"The Strongest Build\",4388,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1574\\\"\\u003eEducational Codeforces Round 114 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1102F\":[\"Elongated Matrix\",2015,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1102\\\"\\u003eCodeforces Round 531 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1211E\":[\"Double Permutation Inc.\",188,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1211\\\"\\u003eKotlin Heroes: Episode 2\\u003c/a\\u003e\"],\"CodeForces-1320C\":[\"World of Darkraft: Battle for Azathoth\",2895,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1320\\\"\\u003eCodeforces Round 625 (Div. 1, based on Technocup 2020 Final Round)\\u003c/a\\u003e\"],\"CodeForces-900D\":[\"Unusual Sequences\",3273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/900\\\"\\u003eCodeforces Round 450 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-803F\":[\"Coprime Subsequences\",3208,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-803E\":[\"Roma and Poker\",2218,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-163B\":[\"Lemmings\",1125,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/163\\\"\\u003eVK Cup 2012 Round 2\\u003c/a\\u003e\"],\"CodeForces-490E\":[\"Restoring Increasing Sequence\",1739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/490\\\"\\u003eCodeforces Round 279 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1379C\":[\"Choosing flowers\",5652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1379\\\"\\u003eCodeforces Round 657 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-296B\":[\"Yaroslav and Two Strings\",2210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/296\\\"\\u003eCodeforces Round 179 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-13B\":[\"Letter A\",871,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/13\\\"\\u003eCodeforces Beta Round 13\\u003c/a\\u003e\"],\"CodeForces-187C\":[\"Weak Memory\",1360,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/187\\\"\\u003eCodeforces Round 119 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1101D\":[\"GCD Counting\",4657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1101\\\"\\u003eEducational Codeforces Round 58 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1210C\":[\"Kamil and Making a Stream\",3310,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1210\\\"\\u003eDasha Code Championship - SPb Finals Round (only for onsite-finalists)\\u003c/a\\u003e\"],\"CodeForces-1234E\":[\"Special Permutations\",2706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1234\\\"\\u003eCodeforces Round 590 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1682D\":[\"Circular Spanning Tree\",3183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1682\\\"\\u003eCodeforces Round 793 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-609D\":[\"Gadgets for dollars and pounds\",2789,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/609\\\"\\u003eEducational Codeforces Round 3\\u003c/a\\u003e\"],\"CodeForces-814D\":[\"An overnight dance in discotheque\",2319,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/814\\\"\\u003eCodeforces Round 418 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1672F1\":[\"Array Shuffling\",2996,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1672\\\"\\u003eCodeforces Global Round 20\\u003c/a\\u003e\"],\"CodeForces-911E\":[\"Stack Sorting\",2659,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-34E\":[\"Collisions\",599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/34\\\"\\u003eCodeforces Beta Round 34 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-10C\":[\"Digital Root\",1514,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/10\\\"\\u003eCodeforces Beta Round 10\\u003c/a\\u003e\"],\"CodeForces-58D\":[\"Calendar\",796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/58\\\"\\u003eCodeforces Beta Round 54 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1257E\":[\"The Contest\",4368,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1257\\\"\\u003eEducational Codeforces Round 76 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1584D\":[\"Guess the Permutation\",3547,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1584\\\"\\u003eTechnocup 2022 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1366D\":[\"Two Divisors\",10455,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1366\\\"\\u003eEducational Codeforces Round 89 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1487E\":[\"Cheap Dinner\",4415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1487\\\"\\u003eEducational Codeforces Round 104 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-162I\":[\"Truncatable primes\",71,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/162\\\"\\u003eVK Cup 2012 Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-162G\":[\"Non-decimal sum\",55,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/162\\\"\\u003eVK Cup 2012 Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-380C\":[\"Sereja and Brackets\",14743,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/380\\\"\\u003eCodeforces Round 223 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-59E\":[\"Shortest Path\",3428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/59\\\"\\u003eCodeforces Beta Round 55 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1268B\":[\"Domino for Young\",5811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1268\\\"\\u003eCodeforces Round 609 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-59D\":[\"Team Arrangement\",656,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/59\\\"\\u003eCodeforces Beta Round 55 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-47C\":[\"Crossword\",842,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/47\\\"\\u003eCodeforces Beta Round 44 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1919H\":[\"Tree Diameter\",130,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1919\\\"\\u003eHello 2024\\u003c/a\\u003e\"],\"CodeForces-1256E\":[\"Yet Another Division Into Teams\",4022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1256\\\"\\u003eCodeforces Round 598 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1244C\":[\"The Football Season\",7876,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1244\\\"\\u003eCodeforces Round 592 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1147C\":[\"Thanos Nim\",3305,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1147\\\"\\u003eForethought Future Cup - Final Round (Onsite Finalists Only)\\u003c/a\\u003e\"],\"CodeForces-1244E\":[\"Minimizing Difference\",5087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1244\\\"\\u003eCodeforces Round 592 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1256F\":[\"Equalizing Two Strings\",3185,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1256\\\"\\u003eCodeforces Round 598 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1354C2\":[\"Not So Simple Polygon Embedding\",5911,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1354\\\"\\u003eEducational Codeforces Round 87 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-933B\":[\"A Determined Cleanup\",1960,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/933\\\"\\u003eCodeforces Round 462 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1571F\":[\"Kotlinforces\",177,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1571\\\"\\u003eKotlin Heroes: Episode 8\\u003c/a\\u003e\"],\"CodeForces-1680E\":[\"Moving Chips\",3676,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1680\\\"\\u003eEducational Codeforces Round 128 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-2B\":[\"The least round way\",10918,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/2\\\"\\u003eCodeforces Beta Round 2\\u003c/a\\u003e\"],\"CodeForces-1910F\":[\"Build Railway Stations\",154,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1910\\\"\\u003eKotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!)\\u003c/a\\u003e\"],\"CodeForces-178E2\":[\"The Beaver\\u0027s Problem - 2\",208,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-241C\":[\"Mirror Box\",537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/241\\\"\\u003eBayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)\\u003c/a\\u003e\"],\"CodeForces-253D\":[\"Table with Letters - 2\",944,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/253\\\"\\u003eCodeforces Round 154 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-374D\":[\"Inna and Sequence\",934,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/374\\\"\\u003eCodeforces Round 220 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1619F\":[\"Let\\u0027s Play the Hat?\",2033,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1619\\\"\\u003eCodeforces Round 762 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-386C\":[\"Diverse Substrings\",761,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/386\\\"\\u003eTesting Round 9\\u003c/a\\u003e\"],\"CodeForces-374A\":[\"Inna and Pink Pony\",3124,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/374\\\"\\u003eCodeforces Round 220 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1716C\":[\"Robot in a Hallway\",4029,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1716\\\"\\u003eEducational Codeforces Round 133 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-156C\":[\"Cipher\",2529,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/156\\\"\\u003eCodeforces Round 110 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1619G\":[\"Unusual Minesweeper\",2327,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1619\\\"\\u003eCodeforces Round 762 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1716D\":[\"Chip Move\",5074,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1716\\\"\\u003eEducational Codeforces Round 133 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1198C\":[\"Matching vs Independent Set\",3390,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1198\\\"\\u003eCodeforces Round 576 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1380D\":[\"Berserk And Fireball\",4722,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1380\\\"\\u003eEducational Codeforces Round 91 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-131F\":[\"Present to Mom\",611,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/131\\\"\\u003eCodeforces Beta Round 95 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-73B\":[\"Need For Brake\",524,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/73\\\"\\u003eCodeforces Beta Round 66\\u003c/a\\u003e\"],\"CodeForces-264C\":[\"Choosing Balls\",2854,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/264\\\"\\u003eCodeforces Round 162 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1618F\":[\"Reverse\",4146,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1618\\\"\\u003eCodeforces Round 760 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-916B\":[\"Jamie and Binary Sequence (changed after round)\",1860,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/916\\\"\\u003eCodeforces Round 457 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1088D\":[\"Ehab and another another xor problem\",2850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1088\\\"\\u003eCodeforces Round 525 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1294F\":[\"Three Paths on a Tree\",5710,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1294\\\"\\u003eCodeforces Round 615 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1185E\":[\"Polycarp and Snakes\",2506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1185\\\"\\u003eCodeforces Round 568 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1391D\":[\"505\",5023,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1391\\\"\\u003eCodeforces Round 663 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-494B\":[\"Obsessive String\",2702,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/494\\\"\\u003eCodeforces Round 282 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-61C\":[\"Capture Valerian\",742,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/61\\\"\\u003eCodeforces Beta Round 57 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-251C\":[\"Number Transformation\",1053,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/251\\\"\\u003eCodeforces Round 153 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-360B\":[\"Levko and Array\",2943,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/360\\\"\\u003eCodeforces Round 210 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-263C\":[\"Circle of Numbers\",1103,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/263\\\"\\u003eCodeforces Round 161 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1726D\":[\"Edge Split\",3577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1726\\\"\\u003eCodeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022\\u003c/a\\u003e\"],\"CodeForces-178C3\":[\"Smart Beaver and Resolving Collisions\",310,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-818C\":[\"Sofa Thief\",1290,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"CodeForces-926F\":[\"Mobile Communications\",226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/926\\\"\\u003eVK Cup 2018 - Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-82C\":[\"General Mobilization\",860,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/82\\\"\\u003eYandex.Algorithm 2011: Qualification 2\\u003c/a\\u003e\"],\"CodeForces-82D\":[\"Two out of Three\",1989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/82\\\"\\u003eYandex.Algorithm 2011: Qualification 2\\u003c/a\\u003e\"],\"CodeForces-492E\":[\"Vanya and Field\",1687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/492\\\"\\u003eCodeforces Round 280 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-383C\":[\"Propagating tree\",6731,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/383\\\"\\u003eCodeforces Round 225 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-153D\":[\"Date Change\",77,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/153\\\"\\u003eSurprise Language Round 5\\u003c/a\\u003e\"],\"CodeForces-1725C\":[\"Circular Mirror\",1621,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1725\\\"\\u003eCOMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1943B\":[\"Non-Palindromic Substring\",3142,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1943\\\"\\u003eCodeforces Round 934 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1616D\":[\"Keep the Average High\",4771,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1616\\\"\\u003eGood Bye 2021: 2022 is NEAR\\u003c/a\\u003e\"],\"CodeForces-938D\":[\"Buy a Ticket\",5901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/938\\\"\\u003eEducational Codeforces Round 38 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-817E\":[\"Choosing The Commander\",2959,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"CodeForces-1931G\":[\"One-Dimensional Puzzle\",2417,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1931\\\"\\u003eCodeforces Round 925 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1183E\":[\"Subsequences (easy version)\",4790,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1183\\\"\\u003eCodeforces Round 570 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1280C\":[\"Jeremy Bearimy\",2534,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1280\\\"\\u003eCodeforces Round 607 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1183G\":[\"Candy Box (hard version)\",2348,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1183\\\"\\u003eCodeforces Round 570 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-250E\":[\"Mad Joe\",455,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/250\\\"\\u003eCROC-MBTU 2012, Final Round (Online version, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-371E\":[\"Subway Innovation\",1287,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/371\\\"\\u003eCodeforces Round 218 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-451D\":[\"Count Good Substrings\",4822,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/451\\\"\\u003eCodeforces Round 258 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-245F\":[\"Log Stream Analysis\",1001,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/245\\\"\\u003eCROC-MBTU 2012, Elimination Round (ACM-ICPC)\\u003c/a\\u003e\"],\"CodeForces-366D\":[\"Dima and Trap Graph\",1399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/366\\\"\\u003eCodeforces Round 214 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1057C\":[\"Tanya and Colored Candies\",1071,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1057\\\"\\u003eMail.Ru Cup 2018 - Practice Round\\u003c/a\\u003e\"],\"CodeForces-1493C\":[\"K-beautiful Strings\",4557,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1493\\\"\\u003eCodeforces Round 705 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1033D\":[\"Divisors\",2505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1033\\\"\\u003eLyft Level 5 Challenge 2018 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1142B\":[\"Lynyrd Skynyrd\",2758,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1142\\\"\\u003eCodeforces Round 549 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1481D\":[\"AB Graph\",4451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1481\\\"\\u003eCodeforces Round 699 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-487B\":[\"Strip\",3620,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/487\\\"\\u003eCodeforces Round 278 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-475D\":[\"CGCDSSQ\",5069,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/475\\\"\\u003eBayan 2015 Contest Warm Up\\u003c/a\\u003e\"],\"CodeForces-64F\":[\"Domain\",175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/64\\\"\\u003eUnknown Language Round 1\\u003c/a\\u003e\"],\"CodeForces-681D\":[\"Gifts by the List\",1801,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/681\\\"\\u003eCodeforces Round 357 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1204D1\":[\"Kirk and a Binary String (easy version)\",2927,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1204\\\"\\u003eCodeforces Round 581 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-353D\":[\"Queue\",3156,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/353\\\"\\u003eCodeforces Round 205 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1804D\":[\"Accommodation\",4477,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1804\\\"\\u003eNebius Welcome Round (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1250N\":[\"Wires\",1750,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1250\\\"\\u003e2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-474C\":[\"Captain Marmot\",3163,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/474\\\"\\u003eCodeforces Round 271 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-571B\":[\"Minimization\",2695,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/571\\\"\\u003eCodeforces Round 317 [AimFund Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-474E\":[\"Pillars\",3462,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/474\\\"\\u003eCodeforces Round 271 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-340E\":[\"Iahub and Permutations\",2539,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/340\\\"\\u003eCodeforces Round 198 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1900D\":[\"Small GCD\",3737,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1900\\\"\\u003eCodeforces Round 911 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-461B\":[\"Appleman and Tree\",5959,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/461\\\"\\u003eCodeforces Round 263 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-243B\":[\"Hydra\",1236,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/243\\\"\\u003eCodeforces Round 150 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-388C\":[\"Fox and Card Game\",3515,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/388\\\"\\u003eCodeforces Round 228 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-267B\":[\"Dominoes\",667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/267\\\"\\u003eCodeforces Testing Round 5\\u003c/a\\u003e\"],\"CodeForces-1370D\":[\"Odd-Even Subsequence\",9328,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1370\\\"\\u003eCodeforces Round 651 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-50C\":[\"Happy Farm 5\",895,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/50\\\"\\u003eCodeforces Beta Round 47\\u003c/a\\u003e\"],\"CodeForces-87C\":[\"Interesting Game\",1381,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/87\\\"\\u003eCodeforces Beta Round 73 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-242E\":[\"XOR on Segment\",9405,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/242\\\"\\u003eCodeforces Round 149 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-75D\":[\"Big Maximum Sum\",1857,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/75\\\"\\u003eCodeforces Beta Round 67 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1923E\":[\"Count Paths\",3154,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1923\\\"\\u003eEducational Codeforces Round 162 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1030E\":[\"Vasya and Good Sequences\",3044,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1030\\\"\\u003eTechnocup 2019 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1936B\":[\"Pinball\",2373,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1936\\\"\\u003eCodeforces Round 930 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1815B\":[\"Sum Graph\",2859,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1815\\\"\\u003eCodeforces Round 865 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1718B\":[\"Fibonacci Strings\",2902,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1718\\\"\\u003eCodeforces Round 814 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-63E\":[\"Sweets Game\",763,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/63\\\"\\u003eCodeforces Beta Round 59 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1514D\":[\"Cut and Stick\",4196,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1514\\\"\\u003eCodeforces Round 716 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-201C\":[\"Fragile Bridges\",1427,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/201\\\"\\u003eCodeforces Round 127 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-213C\":[\"Relay Race\",2850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/213\\\"\\u003eCodeforces Round 131 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-237E\":[\"Build String\",1724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/237\\\"\\u003eCodeforces Round 147 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-237D\":[\"T-decomposition\",599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/237\\\"\\u003eCodeforces Round 147 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-128C\":[\"Games with Rectangle\",3007,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/128\\\"\\u003eCodeforces Beta Round 94 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-346B\":[\"Lucky Common Subsequence\",3777,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/346\\\"\\u003eCodeforces Round 201 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-358C\":[\"Dima and Containers\",2059,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/358\\\"\\u003eCodeforces Round 208 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-128D\":[\"Numbers\",1250,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/128\\\"\\u003eCodeforces Beta Round 94 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1744F\":[\"MEX vs MED\",2906,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1744\\\"\\u003eCodeforces Round 828 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1841D\":[\"Pairs of Segments\",4172,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1841\\\"\\u003eEducational Codeforces Round 150 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1190D\":[\"Tokitsukaze and Strange Rectangle\",2273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1190\\\"\\u003eCodeforces Round 573 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-540C\":[\"Ice Cave\",8389,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/540\\\"\\u003eCodeforces Round 301 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-661C\":[\"Array Sum\",127,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/661\\\"\\u003eVK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror)\\u003c/a\\u003e\"],\"CodeForces-891B\":[\"Gluttony\",3108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/891\\\"\\u003eCodeforces Round 446 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-661E\":[\"Divisibility Check\",78,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/661\\\"\\u003eVK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror)\\u003c/a\\u003e\"],\"CodeForces-1646D\":[\"Weight the Tree\",3608,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1646\\\"\\u003eCodeforces Round 774 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1525C\":[\"Robot Collisions\",4412,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1525\\\"\\u003eEducational Codeforces Round 109 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1622D\":[\"Shuffle\",3972,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1622\\\"\\u003eEducational Codeforces Round 120 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1513D\":[\"GCD and MST\",5143,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1513\\\"\\u003eDivide by Zero 2021 and Codeforces Round 714 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1634D\":[\"Finding Zero\",4273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1634\\\"\\u003eCodeforces Round 770 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1416B\":[\"Make Them Equal\",5970,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1416\\\"\\u003eCodeforces Round 673 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1416C\":[\"XOR Inverse\",4244,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1416\\\"\\u003eCodeforces Round 673 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-345C\":[\"Counting Fridays\",123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/345\\\"\\u003eFriday the 13th, Programmers Day\\u003c/a\\u003e\"],\"CodeForces-248C\":[\"Robo-Footballer\",843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/248\\\"\\u003eCodeforces Round 152 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1610D\":[\"Not Quite Lee\",2613,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1610\\\"\\u003eCodeforces Global Round 17\\u003c/a\\u003e\"],\"CodeForces-1731E\":[\"Graph Cost\",2663,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1731\\\"\\u003eCodeforces Round 841 (Div. 2) and Divide by Zero 2022\\u003c/a\\u003e\"],\"CodeForces-1733D2\":[\"Zero-One (Hard Version)\",4026,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1733\\\"\\u003eCodeforces Round 821 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-466B\":[\"Wonder Room\",4762,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/466\\\"\\u003eCodeforces Round 266 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1080D\":[\"Olya and magical square\",1677,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1080\\\"\\u003eCodeforces Round 524 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1092E\":[\"Minimal Diameter Forest\",1661,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1092\\\"\\u003eCodeforces Round 527 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-478D\":[\"Red-Green Towers\",5884,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/478\\\"\\u003eCodeforces Round 273 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-696C\":[\"PLEASE\",2214,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/696\\\"\\u003eCodeforces Round 362 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1427D\":[\"Unshuffling a Deck\",3419,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1427\\\"\\u003eCodeforces Global Round 11\\u003c/a\\u003e\"],\"CodeForces-1536D\":[\"Omkar and Medians\",4613,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1536\\\"\\u003eCodeforces Round 724 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1657D\":[\"For Gamers. By Gamers.\",4738,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1657\\\"\\u003eEducational Codeforces Round 125 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1415D\":[\"XOR-gun\",5250,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1415\\\"\\u003eTechnocup 2021 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1889C1\":[\"Doremy\\u0027s Drying Plan (Easy Version)\",3042,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1889\\\"\\u003eCodeforces Round 906 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1867E1\":[\"Salyg1n and Array (simple version)\",3539,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1867\\\"\\u003eCodeforces Round 897 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-453B\":[\"Little Pony and Harmony Chest\",4789,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/453\\\"\\u003eCodeforces Round 259 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1427C\":[\"The Hard Work of Paparazzi\",5607,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1427\\\"\\u003eCodeforces Global Round 11\\u003c/a\\u003e\"],\"CodeForces-126C\":[\"E-reader Display\",740,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/126\\\"\\u003eCodeforces Beta Round 93 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1165F2\":[\"Microtransactions (hard version)\",2121,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1165\\\"\\u003eCodeforces Round 560 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-235B\":[\"Let\\u0027s Play Osu!\",3554,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/235\\\"\\u003eCodeforces Round 146 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1165F1\":[\"Microtransactions (easy version)\",1831,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1165\\\"\\u003eCodeforces Round 560 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1851G\":[\"Vlad and the Mountains\",2991,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1851\\\"\\u003eCodeforces Round 888 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-598E\":[\"Chocolate Bar\",4894,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/598\\\"\\u003eEducational Codeforces Round 1\\u003c/a\\u003e\"],\"CodeForces-671B\":[\"Robin Hood\",3222,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/671\\\"\\u003eCodeforces Round 352 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-792C\":[\"Divide by Three\",4585,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/792\\\"\\u003eEducational Codeforces Round 18\\u003c/a\\u003e\"],\"CodeForces-1753C\":[\"Wish I Knew How to Sort\",4239,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1753\\\"\\u003eCodeforces Round 829 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-234H\":[\"Merging Two Decks\",569,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/234\\\"\\u003eCodeforces Round 145 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1426F\":[\"Number of Subsequences\",5324,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1426\\\"\\u003eCodeforces Round 674 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-137E\":[\"Last Chance\",1260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/137\\\"\\u003eCodeforces Beta Round 98 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-101C\":[\"Vectors\",757,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/101\\\"\\u003eCodeforces Beta Round 79 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1438C\":[\"Engineer Artem\",10411,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1438\\\"\\u003eCodeforces Round 682 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-367C\":[\"Sereja and the Arrangement of Numbers\",1811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/367\\\"\\u003eCodeforces Round 215 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-379D\":[\"New Year Letter\",1597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/379\\\"\\u003eGood Bye 2013\\u003c/a\\u003e\"],\"CodeForces-113B\":[\"Petr#\",2998,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/113\\\"\\u003eCodeforces Beta Round 86 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-258C\":[\"Little Elephant and LCM\",1927,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/258\\\"\\u003eCodeforces Round 157 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1862G\":[\"The Great Equalizer\",2657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1862\\\"\\u003eCodeforces Round 894 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1620D\":[\"Exact Change\",4149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1620\\\"\\u003eEducational Codeforces Round 119 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1632D\":[\"New Year Concert\",4561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1632\\\"\\u003eCodeforces Round 769 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1741F\":[\"Multi-Colored Segments\",2229,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1741\\\"\\u003eCodeforces Round 826 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-464B\":[\"Restore Cube\",1737,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/464\\\"\\u003eCodeforces Round 265 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1090I\":[\"Minimal Product\",1040,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1090\\\"\\u003e2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1209E1\":[\"Rotate Columns (easy version)\",2828,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1209\\\"\\u003eCodeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1090L\":[\"Berland University\",1263,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1090\\\"\\u003e2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1090K\":[\"Right Expansion Of The Mind\",1064,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1090\\\"\\u003e2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1506G\":[\"Maximize the Remaining String\",4234,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1506\\\"\\u003eCodeforces Round 710 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1857G\":[\"Counting Graphs\",4105,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1857\\\"\\u003eCodeforces Round 891 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-774L\":[\"Bars\",322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/774\\\"\\u003eVK Cup 2017 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-1506F\":[\"Triangular Paths\",3165,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1506\\\"\\u003eCodeforces Round 710 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1712D\":[\"Empty Graph\",4276,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1712\\\"\\u003eCodeforces Round 813 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-435D\":[\"Special Grid\",787,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/435\\\"\\u003eCodeforces Round 249 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-314C\":[\"Sereja and Subsequences\",1843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/314\\\"\\u003eCodeforces Round 187 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-314B\":[\"Sereja and Periods\",1495,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/314\\\"\\u003eCodeforces Round 187 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1061D\":[\"TV Shows\",2443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1061\\\"\\u003eCodeforces Round 523 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-786A\":[\"Berzerk\",2392,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-689E\":[\"Mike and Geometry Problem\",2027,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/689\\\"\\u003eCodeforces Round 361 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-895C\":[\"Square Subsets\",5494,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1296E2\":[\"String Coloring (hard version)\",4894,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1296\\\"\\u003eCodeforces Round 617 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-641E\":[\"Little Artem and Time Machine\",2998,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/641\\\"\\u003eVK Cup 2016 - Round 2\\u003c/a\\u003e\"],\"CodeForces-774J\":[\"Stepan\\u0027s Series\",351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/774\\\"\\u003eVK Cup 2017 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-958C2\":[\"Encryption (medium)\",1230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/958\\\"\\u003eHelvetic Coding Contest 2018 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1408D\":[\"Searchlights\",4248,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1408\\\"\\u003eGrakn Forces 2020\\u003c/a\\u003e\"],\"CodeForces-1638D\":[\"Big Brush\",4087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1638\\\"\\u003eCodeforces Round 771 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-216E\":[\"Martian Luck\",565,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/216\\\"\\u003eCodeforces Round 133 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-204C\":[\"Little Elephant and Furik and Rubik\",1144,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/204\\\"\\u003eCodeforces Round 129 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-337D\":[\"Book of Evil\",6426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/337\\\"\\u003eCodeforces Round 196 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-446B\":[\"DZY Loves Modification\",3801,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/446\\\"\\u003eCodeforces Round #FF (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-119C\":[\"Education Reform\",885,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/119\\\"\\u003eCodeforces Beta Round 90\\u003c/a\\u003e\"],\"CodeForces-228C\":[\"Fractal Detector\",451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/228\\\"\\u003eCodeforces Round 141 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1941G\":[\"Rudolf and Subway\",2864,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1941\\\"\\u003eCodeforces Round 933 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-555B\":[\"Case of Fugitive\",3844,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/555\\\"\\u003eCodeforces Round 310 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-773B\":[\"Dynamic Problem Scoring\",1148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/773\\\"\\u003eVK Cup 2017 - Round 3\\u003c/a\\u003e\"],\"CodeForces-676D\":[\"Theseus and labyrinth\",1959,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/676\\\"\\u003eCodeforces Round 354 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1060E\":[\"Sergey and Subway\",3209,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1060\\\"\\u003eCodeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-797E\":[\"Array Queries\",4337,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"CodeForces-761E\":[\"Dasha and Puzzle\",1987,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/761\\\"\\u003eCodeforces Round 394 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-870D\":[\"Something with XOR Queries\",1212,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/870\\\"\\u003eTechnocup 2018 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1209G1\":[\"Into Blocks (easy version)\",2919,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1209\\\"\\u003eCodeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1613E\":[\"Crazy Robot\",5119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1613\\\"\\u003eEducational Codeforces Round 118 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-433D\":[\"Nanami\\u0027s Digital Board\",1073,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/433\\\"\\u003eCodeforces Round 248 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-118E\":[\"Bertown roads\",6447,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1083B\":[\"The Fair Nut and Strings\",1936,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1083\\\"\\u003eCodeforces Round 526 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-578C\":[\"Weakness and Poorness\",4720,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/578\\\"\\u003eCodeforces Round 320 (Div. 1) [Bayan Thanks-Round]\\u003c/a\\u003e\"],\"CodeForces-784B\":[\"Kids\\u0027 Riddle\",878,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/784\\\"\\u003eApril Fools Contest 2017\\u003c/a\\u003e\"],\"CodeForces-542C\":[\"Idempotent functions\",1180,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/542\\\"\\u003eVK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)\\u003c/a\\u003e\"],\"CodeForces-893E\":[\"Counting Arrays\",3609,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-784E\":[\"Twisted Circuit\",1966,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/784\\\"\\u003eApril Fools Contest 2017\\u003c/a\\u003e\"],\"CodeForces-784G\":[\"BF Calculator\",773,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/784\\\"\\u003eApril Fools Contest 2017\\u003c/a\\u003e\"],\"CodeForces-1830B\":[\"The BOSS Can Count Pairs\",4602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1830\\\"\\u003eCodeforces Round 875 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1612E\":[\"Messages\",2494,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1612\\\"\\u003eEducational Codeforces Round 117 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1624F\":[\"Interacdive Problem\",3225,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1624\\\"\\u003eCodeforces Round 764 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-958A2\":[\"Death Stars (medium)\",940,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/958\\\"\\u003eHelvetic Coding Contest 2018 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1624E\":[\"Masha-forgetful\",3989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1624\\\"\\u003eCodeforces Round 764 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-432D\":[\"Prefixes and Suffixes\",9387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/432\\\"\\u003eCodeforces Round 246 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-117C\":[\"Cycle\",2747,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/117\\\"\\u003eCodeforces Beta Round 88\\u003c/a\\u003e\"],\"CodeForces-359D\":[\"Pair of Numbers\",5450,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/359\\\"\\u003eCodeforces Round 209 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1070C\":[\"Cloud Computing\",2124,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1070\\\"\\u003e2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-468B\":[\"Two Sets\",4194,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/468\\\"\\u003eCodeforces Round 268 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1082E\":[\"Increasing Frequency\",4177,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1082\\\"\\u003eEducational Codeforces Round 55 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-662D\":[\"International Olympiad\",1659,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/662\\\"\\u003eCROC 2016 - Final Round [Private, For Onsite Finalists Only]\\u003c/a\\u003e\"],\"CodeForces-1009E\":[\"Intercity Travelling\",3109,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1009\\\"\\u003eEducational Codeforces Round 47 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1881G\":[\"Anya and the Mysterious String\",2170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1881\\\"\\u003eCodeforces Round 903 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-427E\":[\"Police Patrol\",1532,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/427\\\"\\u003eCodeforces Round 244 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1772F\":[\"Copy of a Copy of a Copy\",2239,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1772\\\"\\u003eCodeforces Round 839 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1566E\":[\"Buds Re-hanging\",4052,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1566\\\"\\u003eCodeforces Global Round 16\\u003c/a\\u003e\"],\"CodeForces-1893C\":[\"Freedom of Choice\",2431,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1893\\\"\\u003eCodeforces Round 908 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1796D\":[\"Maximum Subarray\",3960,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1796\\\"\\u003eEducational Codeforces Round 144 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-766D\":[\"Mahmoud and a Dictionary\",3634,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/766\\\"\\u003eCodeforces Round 396 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-899E\":[\"Segments Removal\",2911,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-633D\":[\"Fibonacci-ish\",2795,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/633\\\"\\u003eManthan, Codefest 16\\u003c/a\\u003e\"],\"CodeForces-621E\":[\"Wet Shark and Blocks\",3067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/621\\\"\\u003eCodeforces Round 341 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-863E\":[\"Turn Off The TV\",3231,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"CodeForces-730I\":[\"Olympiad in Programming and Sports\",2052,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/730\\\"\\u003e2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1129B\":[\"Wrong Answer\",2255,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1129\\\"\\u003eCodeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1359D\":[\"Yet Another Yet Another Task\",9183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1359\\\"\\u003eEducational Codeforces Round 88 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1359E\":[\"Modular Stability\",5858,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1359\\\"\\u003eEducational Codeforces Round 88 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-29D\":[\"Ant on the Tree\",2553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/29\\\"\\u003eCodeforces Beta Round 29 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1674G\":[\"Remove Directed Edges\",2424,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1674\\\"\\u003eCodeforces Round 786 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1214E\":[\"Petya and Construction Set\",2630,\"\\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-1783D\":[\"Different Arrays\",4205,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1783\\\"\\u003eEducational Codeforces Round 141 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-317B\":[\"Ants\",1586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/317\\\"\\u003eCodeforces Round 188 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1311D\":[\"Three Integers\",9069,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1311\\\"\\u003eCodeforces Round 624 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1674E\":[\"Breaking the Wall\",6225,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1674\\\"\\u003eCodeforces Round 786 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-656C\":[\"Without Text\",685,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/656\\\"\\u003eApril Fools Day Contest 2016\\u003c/a\\u003e\"],\"CodeForces-656E\":[\"Out of Controls\",728,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/656\\\"\\u003eApril Fools Day Contest 2016\\u003c/a\\u003e\"],\"CodeForces-777E\":[\"Hanoi Factory\",4366,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-886D\":[\"Restoration of string\",1748,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/886\\\"\\u003eТехнокубок 2018 - Отборочный Раунд 3\\u003c/a\\u003e\"],\"CodeForces-862D\":[\"Mahmoud and Ehab and the binary string\",1784,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/862\\\"\\u003eCodeforces Round 435 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1019B\":[\"The hat\",1940,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1019\\\"\\u003eCodeforces Round 503 (by SIS, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1237D\":[\"Balanced Playlist\",3989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1237\\\"\\u003eCodeforces Global Round 5\\u003c/a\\u003e\"],\"CodeForces-401D\":[\"Roman and Numbers\",4470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/401\\\"\\u003eCodeforces Round 235 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1431E\":[\"Chess Match\",219,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1431\\\"\\u003eKotlin Heroes 5: ICPC Round\\u003c/a\\u003e\"],\"CodeForces-413D\":[\"2048\",806,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/413\\\"\\u003eCoder-Strike 2014 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1891F\":[\"A Growing Tree\",3383,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1891\\\"\\u003eCodeforces Round 907 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-26C\":[\"Parquet\",930,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/26\\\"\\u003eCodeforces Beta Round 26 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1770D\":[\"Koxia and Game\",3703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1770\\\"\\u003eGood Bye 2022: 2023 is NEAR\\u003c/a\\u003e\"],\"CodeForces-1685B\":[\"Linguistics\",3162,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1685\\\"\\u003eCodeforces Round 794 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-449B\":[\"Jzzhu and Cities\",9543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/449\\\"\\u003eCodeforces Round 257 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1346F\":[\"Dune II: Battle For Arrakis\",218,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1346\\\"\\u003eKotlin Heroes: Episode 4\\u003c/a\\u003e\"],\"CodeForces-522D\":[\"Closest Equals\",3175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/522\\\"\\u003eVK Cup 2015 - Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-776D\":[\"The Door Problem\",5396,\"\\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-1599C\":[\"Bubble Strike\",1593,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1599\\\"\\u003eBubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-630O\":[\"Arrow\",817,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-1103B\":[\"Game with modulo\",3285,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1103\\\"\\u003eCodeforces Round 534 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-27E\":[\"Number With The Given Amount Of Divisors\",4686,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/27\\\"\\u003eCodeforces Beta Round 27 (Codeforces format, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-400D\":[\"Dima and Bacteria\",2951,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/400\\\"\\u003eCodeforces Round 234 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-412D\":[\"Giving Awards\",1965,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/412\\\"\\u003eCoder-Strike 2014 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1551E\":[\"Fixed Points\",3755,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1551\\\"\\u003eCodeforces Round 734 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-39E\":[\"What Has Dirichlet Got to Do with That?\",933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/39\\\"\\u003eSchool Team Contest 1 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-15C\":[\"Industrial Nim\",2530,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/15\\\"\\u003eCodeforces Beta Round 15\\u003c/a\\u003e\"],\"CodeForces-109D\":[\"Lucky Sorting\",671,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/109\\\"\\u003eCodeforces Beta Round 84 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-39A\":[\"C*++ Calculations\",730,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/39\\\"\\u003eSchool Team Contest 1 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-1696E\":[\"Placing Jinas\",3915,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1696\\\"\\u003eCodeforces Global Round 21\\u003c/a\\u003e\"],\"CodeForces-1200E\":[\"Compress Words\",7886,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1200\\\"\\u003eCodeforces Round 578 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1399E1\":[\"Weights Division (easy version)\",5785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1399\\\"\\u003eCodeforces Round 661 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1454E\":[\"Number of Simple Paths\",5702,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1454\\\"\\u003eCodeforces Round 686 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-666B\":[\"World Tour\",2172,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/666\\\"\\u003eCodeforces Round 349 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-896B\":[\"Ithea Plays With Chtholly\",2092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/896\\\"\\u003eCodeforces Round 449 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-533B\":[\"Work Group\",2434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/533\\\"\\u003eVK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)\\u003c/a\\u003e\"],\"CodeForces-557D\":[\"Vitaly and Cycle\",2329,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/557\\\"\\u003eCodeforces Round 311 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1451E1\":[\"Bitwise Queries (Easy Version)\",4268,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1451\\\"\\u003eCodeforces Round 685 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-545E\":[\"Paths and Trees\",4798,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/545\\\"\\u003eCodeforces Round 303 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1788D\":[\"Moving Dots\",3784,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1788\\\"\\u003eCodeforces Round 851 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1316D\":[\"Nash Matrix\",3282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1316\\\"\\u003eCodeCraft-20 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1558C\":[\"Bottom-Tier Reversals\",3233,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1558\\\"\\u003eCodeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine))\\u003c/a\\u003e\"],\"CodeForces-1304E\":[\"1-Trees and Queries\",5070,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1304\\\"\\u003eCodeforces Round 620 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1219G\":[\"Harvester\",656,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1219\\\"\\u003eBubble Cup 12 - Finals [Online Mirror, unrated, Div. 2]\\u003c/a\\u003e\"],\"CodeForces-1764D\":[\"Doremy\\u0027s Pegging Game\",2693,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1764\\\"\\u003eCodeforces Global Round 24\\u003c/a\\u003e\"],\"CodeForces-843B\":[\"Interactive LowerBound\",2214,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/843\\\"\\u003eAIM Tech Round 4 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-855C\":[\"Helga Hufflepuff\\u0027s Cup\",2099,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-758D\":[\"Ability To Convert\",2930,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/758\\\"\\u003eCodeforces Round 392 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-952E\":[\"Cheese Board\",635,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/952\\\"\\u003eApril Fools Contest 2018\\u003c/a\\u003e\"],\"CodeForces-710E\":[\"Generate a String\",5335,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/710\\\"\\u003eEducational Codeforces Round 16\\u003c/a\\u003e\"],\"CodeForces-940E\":[\"Cashback\",3671,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/940\\\"\\u003eCodeforces Round 466 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1872G\":[\"Replace With Product\",4016,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1872\\\"\\u003eCodeforces Round 895 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1521C\":[\"Nastia and a Hidden Permutation\",4308,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1521\\\"\\u003eCodeforces Round 720 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1763C\":[\"Another Array Problem\",6356,\"\\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-515D\":[\"Drazil and Tiles\",2860,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/515\\\"\\u003eCodeforces Round 292 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-842C\":[\"Ilya And The Tree\",3771,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/842\\\"\\u003eCodeforces Round 430 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-600D\":[\"Area of Two Circles\\u0027 Intersection\",2367,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/600\\\"\\u003eEducational Codeforces Round 2\\u003c/a\\u003e\"],\"CodeForces-963B\":[\"Destruction of a Tree\",2792,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/963\\\"\\u003eTinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-999E\":[\"Reachability from the Capital\",6953,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/999\\\"\\u003eCodeforces Round 490 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1702G2\":[\"Passable Paths (hard version)\",4383,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1702\\\"\\u003eCodeforces Round 805 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-8C\":[\"Looking for Order\",3589,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/8\\\"\\u003eCodeforces Beta Round 8\\u003c/a\\u003e\"],\"CodeForces-721D\":[\"Maxim and Array\",2430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/721\\\"\\u003eCodeforces Round 374 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-842D\":[\"Vitya and Strange Lesson\",3536,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/842\\\"\\u003eCodeforces Round 430 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-975D\":[\"Ghosts\",1972,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/975\\\"\\u003eCodeforces Round 478 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-999F\":[\"Cards and Joy\",2697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/999\\\"\\u003eCodeforces Round 490 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-18D\":[\"Seller Bob\",1119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/18\\\"\\u003eCodeforces Beta Round 18 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-18E\":[\"Flag 2\",1089,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/18\\\"\\u003eCodeforces Beta Round 18 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1641B\":[\"Repetitions Decoding\",3744,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1641\\\"\\u003eCodeforces Round 773 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1665D\":[\"GCD Guess\",3764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1665\\\"\\u003eCodeforces Round 781 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-309A\":[\"Morning run\",478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/309\\\"\\u003eCroc Champ 2013 - Finals (online version, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-526C\":[\"Om Nom and Candies\",2485,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/526\\\"\\u003eZeptoLab Code Rush 2015\\u003c/a\\u003e\"],\"CodeForces-514C\":[\"Watto and Mechanism\",7179,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/514\\\"\\u003eCodeforces Round 291 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-514D\":[\"R2D2 and Droid Army\",4592,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/514\\\"\\u003eCodeforces Round 291 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-659F\":[\"Polycarp and Hay\",1831,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/659\\\"\\u003eCodeforces Round 346 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-877E\":[\"Danil and a Part-time Job\",4713,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-720A\":[\"Closing ceremony\",882,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/720\\\"\\u003eRussian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]\\u003c/a\\u003e\"],\"CodeForces-611D\":[\"New Year and Ancient Prophecy\",2648,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/611\\\"\\u003eGood Bye 2015\\u003c/a\\u003e\"],\"CodeForces-1349C\":[\"Orac and Game of Life\",4291,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1349\\\"\\u003eCodeforces Round 641 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1458B\":[\"Glass Half Spilled\",3439,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1458\\\"\\u003eCodeforces Round 691 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1567D\":[\"Expression Evaluation Error\",4495,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1567\\\"\\u003eCodeforces Round 742 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1349B\":[\"Orac and Medians\",7816,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1349\\\"\\u003eCodeforces Round 641 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1301D\":[\"Time to Run\",3876,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1301\\\"\\u003eCodeforces Round 619 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-997B\":[\"Roman Digits\",3173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/997\\\"\\u003eCodeforces Round 493 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-767C\":[\"Garland\",4435,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/767\\\"\\u003eCodeforces Round 398 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-513C\":[\"Second price auction\",1616,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/513\\\"\\u003eRockethon 2015\\u003c/a\\u003e\"],\"CodeForces-755D\":[\"PolandBall and Polygon\",2628,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/755\\\"\\u003e8VC Venture Cup 2017 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-852B\":[\"Neural Network country\",1429,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/852\\\"\\u003eBubble Cup X - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-501D\":[\"Misha and Permutations Summation\",2425,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/501\\\"\\u003eCodeforces Round 285 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-864E\":[\"Fire\",4606,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/864\\\"\\u003eCodeforces Round 436 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-961D\":[\"Pair Of Lines\",4547,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/961\\\"\\u003eEducational Codeforces Round 41 (Rated for Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1711957282000,"title":"CodeForces rating 2000 题目集","dislikeCnt":0,"content":"[problem:CodeForces-380C] Sereja and brackets数据结构(data structures) 调度算法(schedules\n[problem:CodeForces-1438C] Engineer artem二分图可满足性问题(2-sat) 中国剩余定理(chinese remainder theorem), 构造算法(constructive algorithms), 快速傅里叶变换(fft), 流(flows\n[problem:CodeForces-2B] The least round way动态规划(dp) 数学(math\n[problem:CodeForces-1366D] Two divisors构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-1370D] Odd-even subsequence二分搜索(binary search) 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1359D] Yet another yet another task数据结构(data structures) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1311D] Three integers暴力枚举(brute force) 数学(math\n[problem:CodeForces-242E] Xor on segment位掩码(bitmasks) 数据结构(data structures\n[problem:CodeForces-432D] Prefixes and suffixes动态规划(dp) 字符串后缀结构(string suffix structures), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-449B] Jzzhu and cities图论(graphs) 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1349B] Orac and medians构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1244C] The football season暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-1132F] Clear the string动态规划(dp \n[problem:CodeForces-540C] Ice cave深度优先搜索及其变种(dfs and similar \n[problem:CodeForces-1200E] Compress words暴力枚举(brute force) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-1385E] Directing edges构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-1288D] Minimax problem二分搜索(binary search) 位掩码(bitmasks), 动态规划(dp\n[problem:CodeForces-1363E] Tree shuffling深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-514C] Watto and mechanism二分搜索(binary search) 数据结构(data structures), 哈希表(hashing), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-999E] Reachability from the capital深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1763C] Another array problem暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-920F] Sum and replace暴力枚举(brute force) 数据结构(data structures), 并查集(dsu), 数论(number theory\n[problem:CodeForces-1388D] Captain flint and treasure数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1674E] Breaking the wall二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-383C] Propagating tree数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1416B] Make them equal构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-118E] Bertown roads深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1354C2] Not so simple polygon embedding二分搜索(binary search) 暴力枚举(brute force), 计算几何(geometry), 数学(math\n[problem:CodeForces-1344B] Monopole magnets构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-337D] Book of evil深度优先搜索及其变种(dfs and similar) 分治算法(divide and conquer), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1156C] Match points二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings), 三分搜索(ternary search), 双指针算法(two pointers\n[problem:CodeForces-1359E] Modular stability组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-1399E1] Weights division (easy version)数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1268B] Domino for young动态规划(dp) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1454E] Number of simple paths组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1427C] The hard work of paparazzi动态规划(dp \n[problem:CodeForces-478D] Red-green towers动态规划(dp \n[problem:CodeForces-1379C] Choosing flowers二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-461B] Appleman and tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1294F] Three paths on a tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1415D] Xor-gun位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms\n[problem:CodeForces-1426F] Number of subsequences组合数学(combinatorics) 动态规划(dp), 字符串处理(strings\n[problem:CodeForces-895C] Square subsets位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-938D] Buy a ticket数据结构(data structures) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1513D] Gcd and mst构造算法(constructive algorithms) 并查集(dsu), 图论(graphs), 贪心策略(greedy), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-1613E] Crazy robot深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-710E] Generate a string深度优先搜索及其变种(dfs and similar) 动态规划(dp\n[problem:CodeForces-1716D] Chip move暴力枚举(brute force) 动态规划(dp), 数学(math\n[problem:CodeForces-1391D] 505位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1304E] 1-trees and queries数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-359D] Pair of numbers二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1244E] Minimizing difference二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 排序算法(sortings), 三分搜索(ternary search), 双指针算法(two pointers\n[problem:CodeForces-776D] The door problem二分图可满足性问题(2-sat) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1657D] For gamers. by gamers.二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1616D] Keep the average high动态规划(dp) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1296E2] String coloring (hard version)数据结构(data structures) 动态规划(dp\n[problem:CodeForces-451D] Count good substrings数学(math \n[problem:CodeForces-1380D] Berserk and fireball构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-466B] Wonder room暴力枚举(brute force) 数学(math\n[problem:CodeForces-1536D] Omkar and medians数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1830B] The boss can count pairs暴力枚举(brute force) 数学(math\n[problem:CodeForces-453B] Little pony and harmony chest位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp\n[problem:CodeForces-1183E] Subsequences (easy version)动态规划(dp) 图论(graphs), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-1493C] K-beautiful strings二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1632D] New year concert二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 数学(math), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-598E] Chocolate bar暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-475D] Cgcdssq暴力枚举(brute force) 数据结构(data structures), 数学(math\n[problem:CodeForces-1567D] Expression evaluation error构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1804D] Accommodation暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1481D] Ab graph暴力枚举(brute force) 构造算法(constructive algorithms), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1101D] Gcd counting数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 数论(number theory), 树形结构(trees\n[problem:CodeForces-1487E] Cheap dinner暴力枚举(brute force) 数据结构(data structures), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-545E] Paths and trees图论(graphs) 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1574D] The strongest build二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1525C] Robot collisions数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1521C] Nastia and a hidden permutation构造算法(constructive algorithms) 交互性问题(interactive\n[problem:CodeForces-1712D] Empty graph二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1702G2] Passable paths (hard version)数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-578C] Weakness and poorness三分搜索(ternary search \n[problem:CodeForces-1349C] Orac and game of life深度优先搜索及其变种(dfs and similar) 图论(graphs), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-1634D] Finding zero构造算法(constructive algorithms) 交互性问题(interactive), 数学(math\n[problem:CodeForces-877E] Danil and a part-time job位掩码(bitmasks) 数据结构(data structures), 树形结构(trees\n[problem:CodeForces-1451E1] Bitwise queries (easy version)位掩码(bitmasks) 构造算法(constructive algorithms), 交互性问题(interactive), 数学(math\n[problem:CodeForces-792C] Divide by three动态规划(dp) 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-1416C] Xor inverse位掩码(bitmasks) 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp), 贪心策略(greedy), 数学(math), 排序算法(sortings), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1408D] Searchlights二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1783D] Different arrays暴力枚举(brute force) 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1753C] Wish i knew how to sort动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-864E] Fire动态规划(dp) 排序算法(sortings\n[problem:CodeForces-1257E] The contest数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-514D] R2d2 and droid army二分搜索(binary search) 数据结构(data structures), 双指针算法(two pointers\n[problem:CodeForces-1506G] Maximize the remaining string暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-961D] Pair of lines计算几何(geometry \n[problem:CodeForces-1841D] Pairs of segments数据结构(data structures) 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1514D] Cut and stick二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1638D] Big brush构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-797E] Array queries暴力枚举(brute force) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-1566E] Buds re-hanging构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1618F] Reverse位掩码(bitmasks) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation), 数学(math), 字符串处理(strings\n[problem:CodeForces-1716C] Robot in a hallway数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 三分搜索(ternary search\n[problem:CodeForces-1857G] Counting graphs组合数学(combinatorics) 分治算法(divide and conquer), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1620D] Exact change暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-401D] Roman and numbers位掩码(bitmasks) 暴力枚举(brute force), 组合数学(combinatorics), 动态规划(dp), 数论(number theory\n[problem:CodeForces-27E] Number with the given amount of divisors暴力枚举(brute force) 动态规划(dp), 数论(number theory\n[problem:CodeForces-767C] Garland深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1733D2] Zero-one (hard version)动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1223D] Sequence sorting动态规划(dp) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1082E] Increasing frequency二分搜索(binary search) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1624E] Masha-forgetful暴力枚举(brute force) 构造算法(constructive algorithms), 动态规划(dp), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1872G] Replace with product暴力枚举(brute force) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1622D] Shuffle组合数学(combinatorics) 数学(math), 双指针算法(two pointers\n[problem:CodeForces-629D] Babaei and birthday cake数据结构(data structures) 动态规划(dp\n[problem:CodeForces-1256E] Yet another division into teams动态规划(dp) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-777E] Hanoi factory暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1796D] Maximum subarray数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1696E] Placing jinas组合数学(combinatorics) 数学(math\n[problem:CodeForces-615D] Multipliers数学(math) 数论(number theory\n[problem:CodeForces-1237D] Balanced playlist二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1301D] Time to run构造算法(constructive algorithms) 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-468B] Two sets二分图可满足性问题(2-sat) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图匹配(graph matchings), 贪心策略(greedy\n[problem:CodeForces-1641B] Repetitions decoding构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-555B] Case of fugitive数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1788D] Moving dots二分搜索(binary search) 暴力枚举(brute force), 组合数学(combinatorics), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1665D] Gcd guess位掩码(bitmasks) 中国剩余定理(chinese remainder theorem), 构造算法(constructive algorithms), 博弈论(games), 交互性问题(interactive), 数学(math), 数论(number theory\n[problem:CodeForces-1551E] Fixed points二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp\n[problem:CodeForces-1770D] Koxia and game构造算法(constructive algorithms) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 流(flows), 博弈论(games), 图匹配(graph matchings), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-20B] Equation数学(math \n[problem:CodeForces-1827B1] Range sorting (easy version)二分搜索(binary search) 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1680E] Moving chips位掩码(bitmasks) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1582E] Pchelyonok and segments二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1900D] Small gcd位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1726D] Edge split暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-446B] Dzy loves modification暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1584D] Guess the permutation二分搜索(binary search) 组合数学(combinatorics), 交互性问题(interactive), 数学(math\n[problem:CodeForces-1646D] Weight the tree构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1867E1] Salyg1n and array (simple version)构造算法(constructive algorithms) 交互性问题(interactive), 数学(math\n[problem:CodeForces-842C] Ilya and the tree深度优先搜索及其变种(dfs and similar) 图论(graphs), 数学(math), 数论(number theory), 树形结构(trees\n[problem:CodeForces-940E] Cashback数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1905D] Cyclic mex数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1266D] Decreasing debts构造算法(constructive algorithms) 数据结构(data structures), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1458B] Glass half spilled动态规划(dp \n[problem:CodeForces-1427D] Unshuffling a deck构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-487B] Strip二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-346B] Lucky common subsequence动态规划(dp) 字符串处理(strings\n[problem:CodeForces-235B] Let\u0027s play osu!动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-1891F] A growing tree数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1288E] Messenger simulator数据结构(data structures \n[problem:CodeForces-1198C] Matching vs independent set构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-766D] Mahmoud and a dictionary数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 并查集(dsu), 图论(graphs\n[problem:CodeForces-893E] Counting arrays组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1210C] Kamil and making a stream数学(math) 数论(number theory), 树形结构(trees\n[problem:CodeForces-842D] Vitya and strange lesson二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-1690G] Count the trains二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-8C] Looking for order位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-1103B] Game with modulo二分搜索(binary search) 构造算法(constructive algorithms), 交互性问题(interactive\n[problem:CodeForces-1682D] Circular spanning tree构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1624F] Interacdive problem二分搜索(binary search) 构造算法(constructive algorithms), 交互性问题(interactive\n[problem:CodeForces-1316D] Nash matrix构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1685B] Linguistics贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-1558C] Bottom-tier reversals构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1506F] Triangular paths构造算法(constructive algorithms) 图论(graphs), 数学(math), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-388C] Fox and card game博弈论(games) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-474E] Pillars二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-474C] Captain marmot暴力枚举(brute force) 计算几何(geometry\n[problem:CodeForces-59E] Shortest path图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-1256F] Equalizing two strings构造算法(constructive algorithms) 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-1131D] Gourmet choice深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1147C] Thanos nim博弈论(games \n[problem:CodeForces-803F] Coprime subsequences位掩码(bitmasks) 组合数学(combinatorics), 数论(number theory\n[problem:CodeForces-1060E] Sergey and subway深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-671B] Robin hood二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-1030E] Vasya and good sequences位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-900D] Unusual sequences位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1672F1] Array shuffling构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1889C1] Doremy\u0027s drying plan (easy version)暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-522D] Closest equals 数据结构(data structures\n[problem:CodeForces-1923E] Count paths数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-641E] Little artem and time machine数据结构(data structures \n[problem:CodeForces-863E] Turn off the tv数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-891B] Gluttony构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1009E] Intercity travelling组合数学(combinatorics) 数学(math), 概率论(probabilities\n[problem:CodeForces-997B] Roman digits暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1718B] Fibonacci strings贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1320C] World of darkraft: battle for azathoth暴力枚举(brute force) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-1851G] Vlad and the mountains二分搜索(binary search) 数据结构(data structures), 并查集(dsu), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1204D1] Kirk and a binary string (easy version)暴力枚举(brute force) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-374A] Inna and pink pony贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1744F] Mex vs med数学(math) 双指针算法(two pointers\n[problem:CodeForces-1209G1] Into blocks (easy version)数据结构(data structures) 并查集(dsu), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1815B] Sum graph暴力枚举(brute force) 构造算法(constructive algorithms), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-400D] Dima and bacteria并查集(dsu) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1943B] Non-palindromic substring哈希表(hashing) 实现问题,编程技巧,模拟(implementation), 数学(math), 字符串处理(strings\n[problem:CodeForces-515D] Drazil and tiles构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1088D] Ehab and another another xor problem位掩码(bitmasks) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive\n[problem:CodeForces-629C] Famil door and brackets动态规划(dp) 字符串处理(strings\n[problem:CodeForces-899E] Segments removal数据结构(data structures) 并查集(dsu), 流(flows), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1209E1] Rotate columns (easy version)位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-621E] Wet shark and blocks动态规划(dp) 矩阵(matrices\n[problem:CodeForces-353D] Queue构造算法(constructive algorithms) 动态规划(dp\n[problem:CodeForces-113B] Petr#暴力枚举(brute force) 数据结构(data structures), 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-360B] Levko and array二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-963B] Destruction of a tree构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-758D] Ability to convert构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy), 数学(math), 字符串处理(strings\n[problem:CodeForces-128C] Games with rectangle组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-817E] Choosing the commander位掩码(bitmasks) 数据结构(data structures), 树形结构(trees\n[problem:CodeForces-264C] Choosing balls动态规划(dp \n[problem:CodeForces-213C] Relay race动态规划(dp \n[problem:CodeForces-1142B] Lynyrd skynyrd数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 数学(math), 树形结构(trees\n[problem:CodeForces-1731E] Graph cost动态规划(dp) 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-1941G] Rudolf and subway构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1764D] Doremy\u0027s pegging game组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1862G] The great equalizer二分搜索(binary search) 数据结构(data structures), 数学(math), 排序算法(sortings\n[problem:CodeForces-1234E] Special permutations数学(math \n[problem:CodeForces-633D] Fibonacci-ish暴力枚举(brute force) 动态规划(dp), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-494B] Obsessive string动态规划(dp) 字符串处理(strings\n[problem:CodeForces-1610D] Not quite lee组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-117C] Cycle深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-609D] Gadgets for dollars and pounds二分搜索(binary search) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-571B] Minimization动态规划(dp) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-611D] New year and ancient prophecy动态规划(dp) 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1214E] Petya and construction set构造算法(constructive algorithms) 图论(graphs), 数学(math), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-999F] Cards and joy动态规划(dp \n[problem:CodeForces-749D] Leaving auction二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-755D] Polandball and polygon数据结构(data structures \n[problem:CodeForces-1029F] Multicolored markers二分搜索(binary search) 暴力枚举(brute force), 数学(math), 数论(number theory\n[problem:CodeForces-911E] Stack sorting构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1185E] Polycarp and snakes暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1280C] Jeremy bearimy深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1612E] Messages暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 概率论(probabilities), 排序算法(sortings\n[problem:CodeForces-1893C] Freedom of choice暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1674G] Remove directed edges深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs\n[problem:CodeForces-1157F] Maximum balanced circle构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1931G] One-dimensional puzzle组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-501D] Misha and permutations summation数据结构(data structures \n[problem:CodeForces-1010D] Mars rover深度优先搜索及其变种(dfs and similar) 图论(graphs), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-786A] Berzerk深度优先搜索及其变种(dfs and similar) 动态规划(dp), 博弈论(games\n[problem:CodeForces-533B] Work group深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-340E] Iahub and permutations组合数学(combinatorics) 数学(math\n[problem:CodeForces-1033D] Divisors交互性问题(interactive) 数学(math), 数论(number theory\n[problem:CodeForces-1248D1] The world is just a programming task (easy version)暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-29D] Ant on the tree构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1061D] Tv shows数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-156C] Cipher组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-1183G] Candy box (hard version)贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-721D] Maxim and array构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-615C] Running track动态规划(dp) 贪心策略(greedy), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1619G] Unusual minesweeper二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-526C] Om nom and candies暴力枚举(brute force) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1190D] Tokitsukaze and strange rectangle数据结构(data structures) 分治算法(divide and conquer), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1772F] Copy of a copy of a copy构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1936B] Pinball二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1741F] Multi-colored segments二分搜索(binary search) 数据结构(data structures), 数学(math), 排序算法(sortings\n[problem:CodeForces-15C] Industrial nim博弈论(games \n[problem:CodeForces-1129B] Wrong answer构造算法(constructive algorithms \n[problem:CodeForces-557D] Vitaly and cycle组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 数学(math\n[problem:CodeForces-843B] Interactive lowerbound暴力枚举(brute force) 交互性问题(interactive), 概率论(probabilities\n[problem:CodeForces-814D] An overnight dance in discotheque深度优先搜索及其变种(dfs and similar) 动态规划(dp), 计算几何(geometry), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-600D] Area of two circles\u0027 intersection计算几何(geometry \n[problem:CodeForces-196B] Infinite maze深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1881G] Anya and the mysterious string二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-803E] Roma and poker动态规划(dp) 图论(graphs\n[problem:CodeForces-666B] World tour图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-965C] Greedy arkady数学(math \n[problem:CodeForces-696C] Please组合数学(combinatorics) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 矩阵(matrices\n[problem:CodeForces-896B] Ithea plays with chtholly二分搜索(binary search) 构造算法(constructive algorithms), 博弈论(games), 贪心策略(greedy), 交互性问题(interactive\n[problem:CodeForces-1165F2] Microtransactions (hard version)二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1070C] Cloud computing数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-21C] Stripe 2二分搜索(binary search) 动态规划(dp), 排序算法(sortings\n[problem:CodeForces-509C] Sums of digits动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1619F] Let\u0027s play the hat?暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-855C] Helga hufflepuff\u0027s cup动态规划(dp) 树形结构(trees\n[problem:CodeForces-358C] Dima and containers构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-296B] Yaroslav and two strings组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-82D] Two out of three动态规划(dp \n[problem:CodeForces-954G] Castle defense二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-761E] Dasha and puzzle构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1019B] The hat二分搜索(binary search) 交互性问题(interactive\n[problem:CodeForces-933B] A determined cleanup数学(math \n[problem:CodeForces-975D] Ghosts计算几何(geometry) 数学(math\n[problem:CodeForces-1102F] Elongated matrix二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 动态规划(dp), 图论(graphs\n[problem:CodeForces-730I] Olympiad in programming and sports动态规划(dp) 流(flows), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-784E] Twisted circuit 暴力枚举(brute force), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1083B] The fair nut and strings贪心策略(greedy) 字符串处理(strings\n[problem:CodeForces-676D] Theseus and labyrinth图论(graphs) 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-689E] Mike and geometry problem组合数学(combinatorics) 数据结构(data structures), 动态规划(dp), 计算几何(geometry), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-78C] Beaver game动态规划(dp) 博弈论(games), 数论(number theory\n[problem:CodeForces-954E] Water taps二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-412D] Giving awards深度优先搜索及其变种(dfs and similar \n[problem:CodeForces-509E] Pretty song数学(math) 字符串处理(strings\n[problem:CodeForces-314C] Sereja and subsequences数据结构(data structures) 动态规划(dp\n[problem:CodeForces-1165F1] Microtransactions (easy version)二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-258C] Little elephant and lcm二分搜索(binary search) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-659F] Polycarp and hay深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-886D] Restoration of string构造算法(constructive algorithms) 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-681D] Gifts by the list构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-75D] Big maximum sum数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 树形结构(trees\n[problem:CodeForces-1903E] Geo game贪心策略(greedy) 交互性问题(interactive), 数学(math\n[problem:CodeForces-367C] Sereja and the arrangement of numbers图论(graphs) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-916B] Jamie and binary sequence (changed after round)位掩码(bitmasks) 贪心策略(greedy), 数学(math\n[problem:CodeForces-464B] Restore cube暴力枚举(brute force) 计算几何(geometry\n[problem:CodeForces-862D] Mahmoud and ehab and the binary string二分搜索(binary search) 分治算法(divide and conquer), 交互性问题(interactive\n[problem:CodeForces-662D] International olympiad构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1092E] Minimal diameter forest构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-492E] Vanya and field数学(math \n[problem:CodeForces-237E] Build string流(flows) 图论(graphs\n[problem:CodeForces-1599C] Bubble strike组合数学(combinatorics) 数学(math), 概率论(probabilities), 三分搜索(ternary search\n[problem:CodeForces-1250N] Wires深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-317B] Ants暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1725C] Circular mirror二分搜索(binary search) 组合数学(combinatorics), 计算几何(geometry), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-513C] Second price auction位掩码(bitmasks) 概率论(probabilities\n[problem:CodeForces-490E] Restoring increasing sequence二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1080D] Olya and magical square构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-379D] New year letter位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp\n[problem:CodeForces-314B] Sereja and periods二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 字符串处理(strings\n[problem:CodeForces-280A] Rectangle puzzle计算几何(geometry \n[problem:CodeForces-427E] Police patrol贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math), 三分搜索(ternary search\n[problem:CodeForces-10C] Digital root数论(number theory \n[problem:CodeForces-171E] Mysterious language proble \n[problem:CodeForces-382B] Number busters二分搜索(binary search) 数学(math\n[problem:CodeForces-852B] Neural network country动态规划(dp) 矩阵(matrices\n[problem:CodeForces-187C] Weak memory深度优先搜索及其变种(dfs and similar) 并查集(dsu\n[problem:CodeForces-21B] Intersection实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-201C] Fragile bridges动态规划(dp \n[problem:CodeForces-87C] Interesting game动态规划(dp) 博弈论(games), 数学(math\n[problem:CodeForces-291E] Tree-string problem 深度优先搜索及其变种(dfs and similar), 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-366D] Dima and trap graph二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 最短路算法(shortest paths), 双指针算法(two pointers\n[problem:CodeForces-1090L] Berland university贪心策略(greedy) 数学(math\n[problem:CodeForces-54C] First digit law动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-818C] Sofa thief暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-137E] Last chance数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-243B] Hydra图论(graphs) 排序算法(sortings\n[problem:CodeForces-870D] Something with xor queries暴力枚举(brute force) 交互性问题(interactive), 概率论(probabilities\n[problem:CodeForces-773B] Dynamic problem scoring暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-958C2] Encryption (medium)动态规划(dp \n[problem:CodeForces-33D] Knights计算几何(geometry) 图论(graphs), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-371E] Subway innovation贪心策略(greedy) 数学(math), 双指针算法(two pointers\n[problem:CodeForces-542C] Idempotent functions构造算法(constructive algorithms) 图论(graphs), 数学(math\n[problem:CodeForces-128D] Numbers构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-204C] Little elephant and furik and rubik数学(math) 概率论(probabilities\n[problem:CodeForces-263C] Circle of numbers暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-163B] Lemmings二分搜索(binary search \n[problem:CodeForces-1090K] Right expansion of the mind数学(math \n[problem:CodeForces-43D] Journey暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-171C] A piece of cake 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-433D] Nanami\u0027s digital board并查集(dsu) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-18D] Seller bob暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1090I] Minimal produc \n[problem:CodeForces-251C] Number transformation动态规划(dp) 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-18E] Flag 2动态规划(dp \n[problem:CodeForces-31D] Chocolate深度优先搜索及其变种(dfs and similar) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-193B] Xor暴力枚举(brute force \n[problem:CodeForces-292C] Beautiful ip addresses暴力枚举(brute force \n[problem:CodeForces-958A2] Death stars (medium)哈希表(hashing) 字符串处理(strings\n[problem:CodeForces-245F] Log stream analysis二分搜索(binary search) 暴力枚举(brute force), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1057C] Tanya and colored candies 动态规划(dp\n[problem:CodeForces-39E] What has dirichlet got to do with that?动态规划(dp) 博弈论(games\n[problem:CodeForces-119C] Education reform动态规划(dp \n[problem:CodeForces-374D] Inna and sequence二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-784B] Kids\u0027 riddle proble \n[problem:CodeForces-26C] Parquet组合数学(combinatorics) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-720A] Closing ceremony贪心策略(greedy \n[problem:CodeForces-253D] Table with letters - 2暴力枚举(brute force) 双指针算法(two pointers\n[problem:CodeForces-82C] General mobilization数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 排序算法(sortings\n[problem:CodeForces-248C] Robo-footballer二分搜索(binary search) 计算几何(geometry\n[problem:CodeForces-13B] Letter a计算几何(geometry) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-261C] Maxim and matrix构造算法(constructive algorithms) 动态规划(dp), 数学(math\n[problem:CodeForces-413D] 2048位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-435D] Special grid暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-47C] Crossword实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-50C] Happy farm 5计算几何(geometry \n[problem:CodeForces-630O] Arrow计算几何(geometry \n[problem:CodeForces-656E] Out of controls proble \n[problem:CodeForces-784G] Bf calculator proble \n[problem:CodeForces-63E] Sweets game位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 博弈论(games), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-58D] Calendar贪心策略(greedy) 字符串处理(strings\n[problem:CodeForces-386C] Diverse substrings动态规划(dp) 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-182C] Optimal sum数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-126C] E-reader display构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-61C] Capture valerian数学(math \n[problem:CodeForces-195E] Building forest数据结构(data structures) 并查集(dsu), 图论(graphs\n[problem:CodeForces-101C] Vectors实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-66E] Petya and post数据结构(data structures) 动态规划(dp\n[problem:CodeForces-656C] Without text proble \n[problem:CodeForces-39A] C++ calculations表达式解析(expression parsing) 贪心策略(greedy\n[problem:CodeForces-952E] Cheese boar \n[problem:CodeForces-109D] Lucky sorting构造算法(constructive algorithms) 排序算法(sortings\n[problem:CodeForces-267B] Dominoes深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-59D] Team arrangement构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1219G] Harvester实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-131F] Present to mom二分搜索(binary search) 双指针算法(two pointers\n[problem:CodeForces-34E] Collisions暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-69C] Game实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-234H] Merging two decks构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-44J] Triminoes构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-237D] T-decomposition深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-216E] Martian luck数学(math) 数论(number theory\n[problem:CodeForces-45E] Director构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-241C] Mirror box计算几何(geometry) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-73B] Need for brake二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-176C] Playing with superglue组合数学(combinatorics) 构造算法(constructive algorithms\n[problem:CodeForces-309A] Morning run二分搜索(binary search) 数学(math), 双指针算法(two pointers\n[problem:CodeForces-164B] Ancient berland hieroglyphs双指针算法(two pointers \n[problem:CodeForces-228C] Fractal detector动态规划(dp) 哈希表(hashing\n[problem:CodeForces-250E] Mad joe暴力枚举(brute force \n[problem:CodeForces-774J] Stepan\u0027s series 动态规划(dp\n[problem:CodeForces-774L] Bars 二分搜索(binary search\n[problem:CodeForces-178C3] Smart beaver and resolving collision \n[problem:CodeForces-178E2] The beaver\u0027s problem - \n[problem:CodeForces-926F] Mobile communication \n[problem:CodeForces-1211D] Teams 二分搜索(binary search), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1346F] Dune ii: battle for arrakis 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1431E] Chess match proble \n[problem:CodeForces-207A3] Beaver\u0027s calculator 1.0贪心策略(greedy \n[problem:CodeForces-1211E] Double permutation inc. 二分搜索(binary search), 贪心策略(greedy\n[problem:CodeForces-1571F] Kotlinforces 构造算法(constructive algorithms), 动态规划(dp\n[problem:CodeForces-64F] Domain 表达式解析(expression parsing\n[problem:CodeForces-1910F] Build railway stations 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-207D3] The beaver\u0027s problem - \n[problem:CodeForces-661C] Array sum proble \n[problem:CodeForces-345C] Counting fridays proble \n[problem:CodeForces-1919H] Tree diameter交互性问题(interactive) 树形结构(trees\n[problem:CodeForces-207D2] The beaver\u0027s problem - \n[problem:CodeForces-661E] Divisibility check proble \n[problem:CodeForces-153D] Date change proble \n[problem:CodeForces-162I] Truncatable primes proble \n[problem:CodeForces-162G] Non-decimal sum proble \n","threadId":188470,"likeCnt":0,"createTime":1711957282000,"isWorkbook":true,"viewCnt":56,"openness":2,"fav":false,"id":4792,"trustable":false}