Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-172C\":[\"Bus\",1143,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/172\\\"\\u003eCroc Champ 2012 - Qualification Round\\u003c/a\\u003e\"],\"CodeForces-293A\":[\"Weird Game\",2994,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/293\\\"\\u003eCroc Champ 2013 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1158A\":[\"The Party and Sweets\",7015,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1158\\\"\\u003eCodeforces Round 559 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-44B\":[\"Cola\",2296,\"\\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-1473C\":[\"No More Inversions\",12626,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1473\\\"\\u003eEducational Codeforces Round 102 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1461C\":[\"Random Events\",11361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1461\\\"\\u003eCodeforces Round 689 (Div. 2, based on Zed Code Competition)\\u003c/a\\u003e\"],\"CodeForces-1352E\":[\"Special Elements\",19668,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1352\\\"\\u003eCodeforces Round 640 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1352F\":[\"Binary String Reconstruction\",16533,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1352\\\"\\u003eCodeforces Round 640 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1110C\":[\"Meaningless Operations\",9264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1110\\\"\\u003eCodeforces Global Round 1\\u003c/a\\u003e\"],\"CodeForces-1340A\":[\"Nastya and Strange Generator\",13284,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1340\\\"\\u003eCodeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov!\\u003c/a\\u003e\"],\"CodeForces-702B\":[\"Powers of Two\",12767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/702\\\"\\u003eEducational Codeforces Round 15\\u003c/a\\u003e\"],\"CodeForces-702C\":[\"Cellular Network\",15003,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/702\\\"\\u003eEducational Codeforces Round 15\\u003c/a\\u003e\"],\"CodeForces-172D\":[\"Calendar Reform\",1457,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/172\\\"\\u003eCroc Champ 2012 - Qualification Round\\u003c/a\\u003e\"],\"CodeForces-1169B\":[\"Pairs\",10218,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1169\\\"\\u003eCodeforces Round 562 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1000B\":[\"Light It Up\",6179,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1000\\\"\\u003eEducational Codeforces Round 46 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1242A\":[\"Tile Painting\",12542,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1242\\\"\\u003eCodeforces Round 599 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1012A\":[\"Photo of The Sky\",6411,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1012\\\"\\u003eCodeforces Round 500 (Div. 1) [based on EJOI]\\u003c/a\\u003e\"],\"CodeForces-1278B\":[\"A and B\",13399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1278\\\"\\u003eEducational Codeforces Round 78 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-859C\":[\"Pie Rules\",5659,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/859\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1399D\":[\"Binary String To Subsequences\",18092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1399\\\"\\u003eCodeforces Round 661 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-847A\":[\"Union of Doubly Linked Lists\",3649,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1133D\":[\"Zero Quantity Maximization\",11449,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1133\\\"\\u003eCodeforces Round 544 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-316B1\":[\"EKG\",1398,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-858C\":[\"Did you mean...\",5541,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/858\\\"\\u003eТехнокубок 2018 - Отборочный Раунд 1\\u003c/a\\u003e\"],\"CodeForces-701C\":[\"They Are Everywhere\",15426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/701\\\"\\u003eCodeforces Round 364 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1690E\":[\"Price Maximization\",14806,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1690\\\"\\u003eCodeforces Round 797 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1809C\":[\"Sum on Subarrays\",11990,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1809\\\"\\u003eEducational Codeforces Round 145 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1213D1\":[\"Equalizing by Division (easy version)\",11434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-409H\":[\"A + B Strikes Back\",8963,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/409\\\"\\u003eApril Fools Day Contest 2014\\u003c/a\\u003e\"],\"CodeForces-749C\":[\"Voting\",6592,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/749\\\"\\u003eCodeforces Round 388 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-846A\":[\"Curriculum Vitae\",4574,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"CodeForces-858B\":[\"Which floor?\",3920,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/858\\\"\\u003eТехнокубок 2018 - Отборочный Раунд 1\\u003c/a\\u003e\"],\"CodeForces-1253C\":[\"Sweets Eating\",14530,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1253\\\"\\u003eCodeforces Round 600 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-724B\":[\"Batch Sort\",4471,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/724\\\"\\u003eIntel Code Challenge Final Round (Div. 1 + Div. 2, Combined)\\u003c/a\\u003e\"],\"CodeForces-978D\":[\"Almost Arithmetic Progression\",9128,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/978\\\"\\u003eCodeforces Round 481 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-930A\":[\"Peculiar apple-tree\",6931,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/930\\\"\\u003eCodeforces Round 468 (Div. 1, based on Technocup 2018 Final Round)\\u003c/a\\u003e\"],\"CodeForces-845C\":[\"Two TVs\",8572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"CodeForces-821C\":[\"Okabe and Boxes\",7589,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/821\\\"\\u003eCodeforces Round 420 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-978F\":[\"Mentors\",8619,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/978\\\"\\u003eCodeforces Round 481 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-31B\":[\"Sysadmin Bob\",4588,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/31\\\"\\u003eCodeforces Beta Round 31 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1179A\":[\"Valeriy and Deque\",10321,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1179\\\"\\u003eCodeforces Round 569 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1915F\":[\"Greetings\",11511,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1915\\\"\\u003eCodeforces Round 918 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1167D\":[\"Bicolored RBS\",7090,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1167\\\"\\u003eEducational Codeforces Round 65 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1010A\":[\"Fly\",8461,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1010\\\"\\u003eCodeforces Round 499 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1264A\":[\"Beautiful Regional Contest\",10040,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1264\\\"\\u003eCodeforces Round 604 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1385D\":[\"a-Good String\",19848,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1385\\\"\\u003eCodeforces Round 656 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1482B\":[\"Restore Modulo\",9092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1482\\\"\\u003eТехнокубок 2021 - Финал\\u003c/a\\u003e\"],\"CodeForces-748B\":[\"Santa Claus and Keyboard Check\",5707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/748\\\"\\u003eTechnocup 2017 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1397B\":[\"Power Sequence\",14705,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1397\\\"\\u003eCodeforces Round 666 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-614A\":[\"Link/Cut Tree\",8925,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/614\\\"\\u003eCodeforces Round 339 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-868C\":[\"Qualification Rounds\",4746,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/868\\\"\\u003eCodeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-1676H2\":[\"Maximum Crossings (Hard Version)\",10672,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1676\\\"\\u003eCodeforces Round 790 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-977E\":[\"Cyclic Components\",20805,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/977\\\"\\u003eCodeforces Round 479 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-290B\":[\"QR code\",2481,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/290\\\"\\u003eApril Fools Day Contest 2013\\u003c/a\\u003e\"],\"CodeForces-1368B\":[\"Codeforces Subsequences\",19385,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1368\\\"\\u003eCodeforces Global Round 8\\u003c/a\\u003e\"],\"CodeForces-1368C\":[\"Even Picture\",13126,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1368\\\"\\u003eCodeforces Global Round 8\\u003c/a\\u003e\"],\"CodeForces-1114B\":[\"Yet Another Array Partitioning Task\",9292,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1114\\\"\\u003eCodeforces Round 538 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-48D\":[\"Permutations\",2682,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/48\\\"\\u003eSchool Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-24B\":[\"F1 Champions\",1891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/24\\\"\\u003eCodeforces Beta Round 24\\u003c/a\\u003e\"],\"CodeForces-1102D\":[\"Balanced Ternary String\",8287,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1102\\\"\\u003eCodeforces Round 531 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1005D\":[\"Polycarp and Div 3\",10812,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1005\\\"\\u003eCodeforces Round 496 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1211B\":[\"Traveling Around the Golden Ring of Berland\",757,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1211\\\"\\u003eKotlin Heroes: Episode 2\\u003c/a\\u003e\"],\"CodeForces-1792C\":[\"Min Max Sort\",13357,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1792\\\"\\u003eEducational Codeforces Round 142 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-707C\":[\"Pythagorean Triples\",13306,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/707\\\"\\u003eCodeforces Round 368 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-901A\":[\"Hashing Trees\",5127,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/901\\\"\\u003eCodeforces Round 453 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1332C\":[\"K-Complete Word\",16052,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1332\\\"\\u003eCodeforces Round 630 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1562C\":[\"Rings\",13025,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1562\\\"\\u003eCodeforces Round 741 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-272C\":[\"Dima and Staircase\",7037,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/272\\\"\\u003eCodeforces Round 167 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1379A\":[\"Acacius and String\",11824,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1379\\\"\\u003eCodeforces Round 657 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1379B\":[\"Dubious Cyrpto\",12983,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1379\\\"\\u003eCodeforces Round 657 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-187A\":[\"Permutations\",2927,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/187\\\"\\u003eCodeforces Round 119 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-49B\":[\"Sum\",2794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/49\\\"\\u003eCodeforces Beta Round 46 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1101C\":[\"Division and Union\",8193,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1101\\\"\\u003eEducational Codeforces Round 58 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1234C\":[\"Pipes\",12949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1234\\\"\\u003eCodeforces Round 590 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-609C\":[\"Load Balancing\",6861,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/609\\\"\\u003eEducational Codeforces Round 3\\u003c/a\\u003e\"],\"CodeForces-839C\":[\"Journey\",17266,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/839\\\"\\u003eCodeforces Round 428 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1101E\":[\"Polycarp\\u0027s New Job\",7997,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1101\\\"\\u003eEducational Codeforces Round 58 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1791F\":[\"Range Update Point Query\",11742,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1791\\\"\\u003eCodeforces Round 849 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-490B\":[\"Queue\",6246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/490\\\"\\u003eCodeforces Round 279 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-271C\":[\"Secret\",3016,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/271\\\"\\u003eCodeforces Round 166 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1269B\":[\"Modulo Equality\",9204,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1269\\\"\\u003eCodeforces Round 609 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-10B\":[\"Cinema Cashier\",1921,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/10\\\"\\u003eCodeforces Beta Round 10\\u003c/a\\u003e\"],\"CodeForces-22B\":[\"Bargaining Table\",4655,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/22\\\"\\u003eCodeforces Beta Round 22 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1136C\":[\"Nastya Is Transposing Matrices\",7848,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1136\\\"\\u003eCodeforces Round 546 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-608B\":[\"Hamming Distance Sum\",7230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/608\\\"\\u003eCodeforces Round 336 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-959C\":[\"Mahmoud and Ehab and the wrong algorithm\",5884,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/959\\\"\\u003eCodeforces Round 473 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1499C\":[\"Minimum Grid Path\",12473,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1499\\\"\\u003eEducational Codeforces Round 106 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1366C\":[\"Palindromic Paths\",13419,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1366\\\"\\u003eEducational Codeforces Round 89 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1487C\":[\"Minimum Ties\",13997,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1487\\\"\\u003eEducational Codeforces Round 104 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1487D\":[\"Pythagorean Triples\",17213,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1487\\\"\\u003eEducational Codeforces Round 104 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-825D\":[\"Suitable Replacement\",3419,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-316E1\":[\"Summer Homework\",1469,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-282C\":[\"XOR and OR\",9781,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/282\\\"\\u003eCodeforces Round 173 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-282B\":[\"Painting Eggs\",12990,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/282\\\"\\u003eCodeforces Round 173 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-35C\":[\"Fire Again\",7573,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/35\\\"\\u003eCodeforces Beta Round 35 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1147A\":[\"Hide and Seek\",5228,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1147\\\"\\u003eForethought Future Cup - Final Round (Onsite Finalists Only)\\u003c/a\\u003e\"],\"CodeForces-1256D\":[\"Binary String Minimizing\",12385,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1256\\\"\\u003eCodeforces Round 598 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1389C\":[\"Good String\",18985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1389\\\"\\u003eEducational Codeforces Round 92 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1486B\":[\"Eastern Exhibition\",15409,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1486\\\"\\u003eCodeforces Round 703 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-837C\":[\"Two Seals\",4282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"CodeForces-2A\":[\"Winner\",26662,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/2\\\"\\u003eCodeforces Beta Round 2\\u003c/a\\u003e\"],\"CodeForces-812C\":[\"Sagheer and Nubian Market\",14753,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/812\\\"\\u003eCodeforces Round 417 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-177C1\":[\"Party\",2540,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/177\\\"\\u003eABBYY Cup 2.0 - Easy\\u003c/a\\u003e\"],\"CodeForces-350B\":[\"Resort\",3337,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/350\\\"\\u003eCodeforces Round 203 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-144C\":[\"Anagram Search\",4226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/144\\\"\\u003eCodeforces Round 103 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-362A\":[\"Two Semiknights Meet\",2841,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/362\\\"\\u003eCodeforces Round 212 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-374B\":[\"Inna and Nine\",3529,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/374\\\"\\u003eCodeforces Round 220 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1089G\":[\"Guest Student\",2942,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1089\\\"\\u003e2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1283C\":[\"Friends and Gifts\",13420,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1283\\\"\\u003eCodeforces Round 611 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1186D\":[\"Vus the Cossack and Numbers\",9026,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1186\\\"\\u003eCodeforces Round 571 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-177C2\":[\"Party\",2479,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/177\\\"\\u003eABBYY Cup 2.0 - Easy\\u003c/a\\u003e\"],\"CodeForces-72I\":[\"Goofy Numbers\",455,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/72\\\"\\u003eUnknown Language Round 2\\u003c/a\\u003e\"],\"CodeForces-580B\":[\"Kefa and Company\",27367,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/580\\\"\\u003eCodeforces Round 321 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-580C\":[\"Kefa and Park\",44268,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/580\\\"\\u003eCodeforces Round 321 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-178D1\":[\"Magic Squares\",634,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-1933E\":[\"Turtle vs. Rabbit Race: Optimal Trainings\",9567,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1933\\\"\\u003eCodeforces Round 929 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-264B\":[\"Good Sequences\",10185,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/264\\\"\\u003eCodeforces Round 162 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-276C\":[\"Little Girl and Maximum Sum\",26119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/276\\\"\\u003eCodeforces Round 169 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-288B\":[\"Polo the Penguin and Houses\",2980,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/288\\\"\\u003eCodeforces Round 177 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1195D1\":[\"Submarine in the Rybinsk Sea (easy edition)\",7837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1195\\\"\\u003eCodeforces Round 574 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1391C\":[\"Cyclic Permutations\",14830,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1391\\\"\\u003eCodeforces Round 663 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-494A\":[\"Treasure\",6465,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/494\\\"\\u003eCodeforces Round 282 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-130D\":[\"Exponentiation\",382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/130\\\"\\u003eUnknown Language Round 4\\u003c/a\\u003e\"],\"CodeForces-1811E\":[\"Living Sequence\",11869,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1811\\\"\\u003eCodeforces Round 863 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-166E\":[\"Tetrahedron\",21599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/166\\\"\\u003eCodeforces Round 113 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-130C\":[\"Decimal sum\",483,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/130\\\"\\u003eUnknown Language Round 4\\u003c/a\\u003e\"],\"CodeForces-166C\":[\"Median\",6980,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/166\\\"\\u003eCodeforces Round 113 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-384B\":[\"Multitasking\",3714,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/384\\\"\\u003eCodeforces Round 225 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1738C\":[\"Even Number Addicts\",10697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1738\\\"\\u003eCodeforces Global Round 22\\u003c/a\\u003e\"],\"CodeForces-709B\":[\"Checkpoints\",5176,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/709\\\"\\u003eAIM Tech Round 3 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1196C\":[\"Robot Breakout\",9447,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1196\\\"\\u003eCodeforces Round 575 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-926G\":[\"Large Bouquets\",1443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/926\\\"\\u003eVK Cup 2018 - Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-1002A3\":[\"Generate superposition of two basis states\",469,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1002\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018\\u003c/a\\u003e\"],\"CodeForces-1051C\":[\"Vasya and Multisets\",9428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1051\\\"\\u003eEducational Codeforces Round 51 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1739C\":[\"Card Game\",8823,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1739\\\"\\u003eEducational Codeforces Round 136 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1725G\":[\"Garage\",5718,\"\\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-250B\":[\"Restoring IPv6\",2209,\"\\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-165B\":[\"Burning Midnight Oil\",18361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/165\\\"\\u003eCodeforces Round 112 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1616C\":[\"Representative Edges\",12079,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1616\\\"\\u003eGood Bye 2021: 2022 is NEAR\\u003c/a\\u003e\"],\"CodeForces-274A\":[\"k-Multiple Free Set\",10357,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/274\\\"\\u003eCodeforces Round 168 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1858B\":[\"The Walkway\",11064,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1858\\\"\\u003eCodeforces Round 893 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1737C\":[\"Ela and Crickets\",5629,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1737\\\"\\u003eDytechlab Cup 2022\\u003c/a\\u003e\"],\"CodeForces-1062B\":[\"Math\",9156,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1062\\\"\\u003eCodeforces Round 520 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-817B\":[\"Makes And The Product\",6432,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"CodeForces-1326D1\":[\"Prefix-Suffix Palindrome (Easy version)\",12140,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1326\\\"\\u003eCodeforces Global Round 7\\u003c/a\\u003e\"],\"CodeForces-64B\":[\"Expression\",1010,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/64\\\"\\u003eUnknown Language Round 1\\u003c/a\\u003e\"],\"CodeForces-100D\":[\"World of Mouth\",299,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/100\\\"\\u003eUnknown Language Round 3\\u003c/a\\u003e\"],\"CodeForces-245D\":[\"Restoring Table\",2422,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/245\\\"\\u003eCROC-MBTU 2012, Elimination Round (ACM-ICPC)\\u003c/a\\u003e\"],\"CodeForces-342B\":[\"Xenia and Spies\",4230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/342\\\"\\u003eCodeforces Round 199 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1926E\":[\"Vlad and an Odd Ordering\",9827,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1926\\\"\\u003eCodeforces Round 928 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-100B\":[\"Friendly Numbers\",540,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/100\\\"\\u003eUnknown Language Round 3\\u003c/a\\u003e\"],\"CodeForces-88B\":[\"Keyboard\",4558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/88\\\"\\u003eCodeforces Beta Round 73 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-354A\":[\"Vasya and Robot\",5514,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/354\\\"\\u003eCodeforces Round 206 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1166C\":[\"A Tale of Two Lands\",9689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1166\\\"\\u003eCodeforces Round 561 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1178D\":[\"Prime Graph\",7468,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1178\\\"\\u003eCodeforces Global Round 4\\u003c/a\\u003e\"],\"CodeForces-1287B\":[\"Hyperset\",9610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1287\\\"\\u003eCodeforces Round 612 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1372C\":[\"Omkar and Baseball\",17724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1372\\\"\\u003eCodeforces Round 655 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-148B\":[\"Escape\",5946,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/148\\\"\\u003eCodeforces Round 105 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1299A\":[\"Anu Has a Function\",11936,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1299\\\"\\u003eCodeforces Round 618 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1263D\":[\"Secret Passwords\",14132,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1263\\\"\\u003eCodeforces Round 603 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1154D\":[\"Walking Robot\",10102,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1154\\\"\\u003eCodeforces Round 552 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-584B\":[\"Kolya and Tanya\",12458,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/584\\\"\\u003eCodeforces Round 324 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-100I\":[\"Rotation\",349,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/100\\\"\\u003eUnknown Language Round 3\\u003c/a\\u003e\"],\"CodeForces-53D\":[\"Physical Education\",2147,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/53\\\"\\u003eCodeforces Beta Round 49 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1804C\":[\"Pull Your Luck\",11588,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1804\\\"\\u003eNebius Welcome Round (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-268C\":[\"Beautiful Sets of Points\",13796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/268\\\"\\u003eCodeforces Round 164 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-908C\":[\"New Year and Curling\",7078,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"CodeForces-159D\":[\"Palindrome pairs\",4546,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/159\\\"\\u003eVK Cup 2012 Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-1492C\":[\"Maximum width\",15999,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1492\\\"\\u003eCodeforces Round 704 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1141D\":[\"Colored Boots\",8821,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1141\\\"\\u003eCodeforces Round 547 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1141C\":[\"Polycarp Restores Permutation\",11990,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1141\\\"\\u003eCodeforces Round 547 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1313C1\":[\"Skyscrapers (easy version)\",10373,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1313\\\"\\u003eCodeforces Round 622 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1249C2\":[\"Good Numbers (hard version)\",12916,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1249\\\"\\u003eCodeforces Round 595 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1250H\":[\"Happy Birthday\",4509,\"\\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-1817A\":[\"Almost Increasing Subsequence\",10380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1817\\\"\\u003eCodeforces Round 869 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1250L\":[\"Divide The Students\",4696,\"\\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-74B\":[\"Train\",1632,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/74\\\"\\u003eCodeforces Beta Round 68\\u003c/a\\u003e\"],\"CodeForces-50B\":[\"Choosing Symbol Pairs\",6542,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/50\\\"\\u003eCodeforces Beta Round 47\\u003c/a\\u003e\"],\"CodeForces-340D\":[\"Bubble Sort Graph\",7676,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/340\\\"\\u003eCodeforces Round 198 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-231B\":[\"Magic, Wizardry and Wonders\",3698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/231\\\"\\u003eCodeforces Round 143 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-255C\":[\"Almost Arithmetical Progression\",4938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/255\\\"\\u003eCodeforces Round 156 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-690C2\":[\"Brain Network (medium)\",4319,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/690\\\"\\u003eHelvetic Coding Contest 2016 online mirror (teams, unrated)\\u003c/a\\u003e\"],\"CodeForces-1031B\":[\"Curiosity Has No Limits\",4014,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1031\\\"\\u003eTechnocup 2019 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1043C\":[\"Smallest Word\",7092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1043\\\"\\u003eCodeforces Round 519 by Botan Investments\\u003c/a\\u003e\"],\"CodeForces-75B\":[\"Facetook Priority Wall\",3545,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/75\\\"\\u003eCodeforces Beta Round 67 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-177D2\":[\"Encrypting Messages\",1816,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/177\\\"\\u003eABBYY Cup 2.0 - Easy\\u003c/a\\u003e\"],\"CodeForces-460B\":[\"Little Dima and Equation\",12636,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/460\\\"\\u003eCodeforces Round 262 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-121B\":[\"Lucky Transformation\",2647,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/121\\\"\\u003eCodeforces Beta Round 91 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-254B\":[\"Jury Size\",2246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/254\\\"\\u003eCodeforces Round 155 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-87A\":[\"Trains\",5359,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/87\\\"\\u003eCodeforces Beta Round 73 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1814C\":[\"Search in Parallel\",10252,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1814\\\"\\u003eEducational Codeforces Round 146 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-278B\":[\"New Problem\",3616,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/278\\\"\\u003eCodeforces Round 170 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1066B\":[\"Heaters\",9352,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1066\\\"\\u003eCodeforces Round 515 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-809A\":[\"Do you want a date?\",4783,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/809\\\"\\u003eCodeforces Round 415 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1296D\":[\"Fight with Monsters\",14464,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1296\\\"\\u003eCodeforces Round 617 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1054C\":[\"Candies Distribution\",4350,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1054\\\"\\u003eMail.Ru Cup 2018 Round 1\\u003c/a\\u003e\"],\"CodeForces-1296C\":[\"Yet Another Walking Robot\",15128,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1296\\\"\\u003eCodeforces Round 617 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1490F\":[\"Equalize the Array\",16301,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1490\\\"\\u003eCodeforces Round 702 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1272D\":[\"Remove One Element\",16861,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1272\\\"\\u003eCodeforces Round 605 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1924A\":[\"Did We Get Everything Covered?\",12221,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1924\\\"\\u003eCodeforces Round 921 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-496B\":[\"Secret Combination\",6258,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/496\\\"\\u003eCodeforces Round 283 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-496C\":[\"Removing Columns\",8049,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/496\\\"\\u003eCodeforces Round 283 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1538F\":[\"Interesting Function\",18670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1538\\\"\\u003eCodeforces Round 725 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1611D\":[\"Weights Assignment For Tree Edges\",9684,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1611\\\"\\u003eCodeforces Round 756 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1659C\":[\"Line Empire\",9749,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1659\\\"\\u003eCodeforces Round 782 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-443B\":[\"Kolya and Tandem Repeat\",4270,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/443\\\"\\u003eCodeforces Round 253 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-455A\":[\"Boredom\",58843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/455\\\"\\u003eCodeforces Round 260 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-237B\":[\"Young Table\",2355,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/237\\\"\\u003eCodeforces Round 147 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-358B\":[\"Dima and Text Messages\",3922,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/358\\\"\\u003eCodeforces Round 208 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-128A\":[\"Statues\",3322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/128\\\"\\u003eCodeforces Beta Round 94 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1081C\":[\"Colorful Bricks\",7550,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1081\\\"\\u003eAvito Cool Challenge 2018\\u003c/a\\u003e\"],\"CodeForces-1081B\":[\"Farewell Party\",4565,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1081\\\"\\u003eAvito Cool Challenge 2018\\u003c/a\\u003e\"],\"CodeForces-576A\":[\"Vasya and Petya\\u0027s Game\",13679,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/576\\\"\\u003eCodeforces Round 319 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-891A\":[\"Pride\",9856,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/891\\\"\\u003eCodeforces Round 446 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-958F1\":[\"Lightsabers (easy)\",1659,\"\\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-770C\":[\"Online Courses In BSU\",2891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/770\\\"\\u003eVK Cup 2017 - Qualification 2\\u003c/a\\u003e\"],\"CodeForces-1646C\":[\"Factorials and Powers of Two\",13490,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1646\\\"\\u003eCodeforces Round 774 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1876B\":[\"Effects of Anti Pimples\",7471,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1876\\\"\\u003eCodeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round)\\u003c/a\\u003e\"],\"CodeForces-1767D\":[\"Playoff\",9428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1767\\\"\\u003eEducational Codeforces Round 140 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-212E\":[\"IT Restaurants\",1826,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/212\\\"\\u003eVK Cup 2012 Finals (unofficial online-version)\\u003c/a\\u003e\"],\"CodeForces-1416A\":[\"k-Amazing Numbers\",11913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1416\\\"\\u003eCodeforces Round 673 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1439A1\":[\"Binary Table (Easy Version)\",9197,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1439\\\"\\u003eCodeforces Round 684 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1307C\":[\"Cow and Message\",11879,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1307\\\"\\u003eCodeforces Round 621 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1404A\":[\"Balanced Bitstring\",14895,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1404\\\"\\u003eCodeforces Round 668 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-103B\":[\"Cthulhu\",9483,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/103\\\"\\u003eCodeforces Beta Round 80 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-224B\":[\"Array\",7559,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/224\\\"\\u003eCodeforces Round 138 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-345A\":[\"Expecting Trouble\",477,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/345\\\"\\u003eFriday the 13th, Programmers Day\\u003c/a\\u003e\"],\"CodeForces-115B\":[\"Lawnmower\",2605,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/115\\\"\\u003eCodeforces Beta Round 87 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1115U1\":[\"Anti-diagonal unitary\",250,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1115\\\"\\u003eMicrosoft Q# Coding Contest - Winter 2019 - Warmup\\u003c/a\\u003e\"],\"CodeForces-587A\":[\"Duff and Weight Lifting\",7657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/587\\\"\\u003eCodeforces Round 326 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-599B\":[\"Spongebob and Joke\",4598,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/599\\\"\\u003eCodeforces Round 332 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-696A\":[\"Lorenzo Von Matterhorn\",6118,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/696\\\"\\u003eCodeforces Round 362 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1080C\":[\"Masha and two friends\",4226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1080\\\"\\u003eCodeforces Round 524 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1536C\":[\"Diluc and Kaeya\",13748,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1536\\\"\\u003eCodeforces Round 724 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1209C\":[\"Paint the Digits\",7493,\"\\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-1621B\":[\"Integers Shop\",13242,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1621\\\"\\u003eHello 2022\\u003c/a\\u003e\"],\"CodeForces-441C\":[\"Valera and Tubes\",11261,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/441\\\"\\u003eCodeforces Round 252 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-320B\":[\"Ping-Pong (Easy Version)\",7707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/320\\\"\\u003eCodeforces Round 189 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-332B\":[\"Maximum Absurdity\",8351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/332\\\"\\u003eCodeforces Round 193 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-114B\":[\"PFAST Inc.\",3886,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/114\\\"\\u003eCodeforces Beta Round 86 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-356A\":[\"Knight Tournament\",13860,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/356\\\"\\u003eCodeforces Round 207 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1742F\":[\"Smaller\",10875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1742\\\"\\u003eCodeforces Round 827 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1851E\":[\"Nastya and Potions\",9551,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1851\\\"\\u003eCodeforces Round 888 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1742G\":[\"Orray\",9956,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1742\\\"\\u003eCodeforces Round 827 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1163B1\":[\"Cat Party (Easy Edition)\",6956,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1163\\\"\\u003eCodeforces Round 558 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-574B\":[\"Bear and Three Musketeers\",8055,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/574\\\"\\u003eCodeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-550A\":[\"Two Substrings\",38811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/550\\\"\\u003eCodeforces Round 306 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-550C\":[\"Divisibility by Eight\",29067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/550\\\"\\u003eCodeforces Round 306 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1426D\":[\"Non-zero Segments\",15994,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1426\\\"\\u003eCodeforces Round 674 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1208B\":[\"Uniqueness\",11585,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1208\\\"\\u003eManthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1789C\":[\"Serval and Toxel\\u0027s Arrays\",8117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1789\\\"\\u003eCodeforces Round 853 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1898B\":[\"Milena and Admirer\",10621,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1898\\\"\\u003eCodeforces Round 910 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1547E\":[\"Air Conditioners\",14240,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1547\\\"\\u003eCodeforces Round 731 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-137C\":[\"History\",7541,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/137\\\"\\u003eCodeforces Beta Round 98 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1765K\":[\"Torus Path\",5399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"CodeForces-670D2\":[\"Magic Powder - 2\",15640,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/670\\\"\\u003eCodeforces Round 350 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-367A\":[\"Sereja and Algorithm\",4465,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/367\\\"\\u003eCodeforces Round 215 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-149C\":[\"Division into Teams\",5613,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1850G\":[\"The Morning Star\",11302,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1850\\\"\\u003eCodeforces Round 886 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1526C1\":[\"Potions (Easy Version)\",21662,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1526\\\"\\u003eCodeforces Round 723 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1765N\":[\"Number Reduction\",4477,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"CodeForces-1857E\":[\"Power of Points\",11505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1857\\\"\\u003eCodeforces Round 891 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1409D\":[\"Decrease the Sum of Digits\",19184,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1409\\\"\\u003eCodeforces Round 667 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1506E\":[\"Restoring the Permutation\",12862,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1506\\\"\\u003eCodeforces Round 710 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-229A\":[\"Shifts\",3663,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/229\\\"\\u003eCodeforces Round 142 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1753A2\":[\"Make Nonzero Sum (hard version)\",9789,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1753\\\"\\u003eCodeforces Round 829 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-677C\":[\"Vanya and Label\",6678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/677\\\"\\u003eCodeforces Round 355 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-520C\":[\"DNA Alignment\",4452,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/520\\\"\\u003eCodeforces Round 295 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-774D\":[\"Lie or Truth\",1933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/774\\\"\\u003eVK Cup 2017 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-883E\":[\"Field of Wonders\",2092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/883\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1408C\":[\"Discrete Acceleration\",8951,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1408\\\"\\u003eGrakn Forces 2020\\u003c/a\\u003e\"],\"CodeForces-1759E\":[\"The Humanoid\",10033,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1759\\\"\\u003eCodeforces Round 834 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1614C\":[\"Divan and bitwise operations\",10143,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1614\\\"\\u003eCodeforces Round 757 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-331A2\":[\"Oh Sweet Beaverette\",1465,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/331\\\"\\u003eABBYY Cup 3.0 - Finals (online version)\\u003c/a\\u003e\"],\"CodeForces-204B\":[\"Little Elephant and Cards\",5692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/204\\\"\\u003eCodeforces Round 129 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-204A\":[\"Little Elephant and Interval\",6033,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/204\\\"\\u003eCodeforces Round 129 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-325A\":[\"Square and Rectangles\",2221,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/325\\\"\\u003eMemSQL start[c]up Round 1\\u003c/a\\u003e\"],\"CodeForces-1181B\":[\"Split a Number\",6447,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1181\\\"\\u003eCodeforces Round 567 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1084C\":[\"The Fair Nut and String\",8221,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1084\\\"\\u003eCodeforces Round 526 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-555A\":[\"Case of Matryoshkas\",6815,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/555\\\"\\u003eCodeforces Round 310 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-676B\":[\"Pyramid of Glasses\",6307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/676\\\"\\u003eCodeforces Round 354 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-676C\":[\"Vasya and String\",20874,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/676\\\"\\u003eCodeforces Round 354 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-761C\":[\"Dasha and Password\",6144,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/761\\\"\\u003eCodeforces Round 394 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-991C\":[\"Candies\",11005,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/991\\\"\\u003eCodeforces Round 491 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-991D\":[\"Bishwock\",7556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/991\\\"\\u003eCodeforces Round 491 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1710A\":[\"Color the Picture\",10767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1710\\\"\\u003eCodeforces Round 810 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1419C\":[\"Killjoy\",15242,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1419\\\"\\u003eCodeforces Round 671 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1516B\":[\"AGAGA XOOORRR\",18627,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1516\\\"\\u003eCodeforces Round 717 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-300B\":[\"Coach\",6572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/300\\\"\\u003eCodeforces Round 181 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-239B\":[\"Easy Tape Programming\",1485,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/239\\\"\\u003eCodeforces Round 148 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1722G\":[\"Even-Odd XOR\",10579,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1722\\\"\\u003eCodeforces Round 817 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1180B\":[\"Nick and Array\",9903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1180\\\"\\u003eCodeforces Round 569 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-687A\":[\"NP-Hard Problem\",14577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/687\\\"\\u003eCodeforces Round 360 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-530A\":[\"Quadratic equation\",669,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/530\\\"\\u003eVK Cup 2015 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-760B\":[\"Frodo and pillows\",6806,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/760\\\"\\u003eCodeforces Round 393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-530C\":[\"Diophantine equation\",539,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/530\\\"\\u003eVK Cup 2015 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-566F\":[\"Clique in the Divisibility Graph\",3775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/566\\\"\\u003eVK Cup 2015 - Finals, online mirror\\u003c/a\\u003e\"],\"CodeForces-990C\":[\"Bracket Sequences Concatenation Problem\",6097,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/990\\\"\\u003eEducational Codeforces Round 45 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1002E1\":[\"Bernstein-Vazirani algorithm\",316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1002\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018\\u003c/a\\u003e\"],\"CodeForces-1842C\":[\"Tenzing and Balls\",11783,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1842\\\"\\u003eCodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1515D\":[\"Phoenix and Socks\",11599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1515\\\"\\u003eCodeforces Global Round 14\\u003c/a\\u003e\"],\"CodeForces-1418C\":[\"Mortal Kombat Tower\",18869,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1418\\\"\\u003eEducational Codeforces Round 95 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1196D1\":[\"RGB Substring (easy version)\",10566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1196\\\"\\u003eCodeforces Round 575 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-468A\":[\"24 Game\",8565,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/468\\\"\\u003eCodeforces Round 268 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1070F\":[\"Debate\",3857,\"\\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-1744E1\":[\"Divisible Numbers (easy version)\",10693,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1744\\\"\\u003eCodeforces Round 828 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1732D1\":[\"Balance (Easy version)\",8352,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1732\\\"\\u003eCodeforces Round 830 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-553A\":[\"Kyoya and Colored Balls\",9132,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/553\\\"\\u003eCodeforces Round 309 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-771B\":[\"Bear and Different Names\",6867,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/771\\\"\\u003eVK Cup 2017 - Round 1\\u003c/a\\u003e\"],\"CodeForces-771A\":[\"Bear and Friendship Condition\",15595,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/771\\\"\\u003eVK Cup 2017 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1070H\":[\"BerOS File Suggestion\",3837,\"\\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-91B\":[\"Queue\",7702,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/91\\\"\\u003eCodeforces Beta Round 75 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-91A\":[\"Newspaper Headline\",3673,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/91\\\"\\u003eCodeforces Beta Round 75 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1106D\":[\"Lunar New Year and a Wander\",14838,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1106\\\"\\u003eCodeforces Round 536 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1215C\":[\"Swap Letters\",11395,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1215\\\"\\u003eCodeforces Round 585 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1106B\":[\"Lunar New Year and Food Ordering\",6977,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1106\\\"\\u003eCodeforces Round 536 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1760F\":[\"Quests\",11602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1760\\\"\\u003eCodeforces Round 835 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1203E\":[\"Boxers\",14169,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1203\\\"\\u003eCodeforces Round 579 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1881E\":[\"Block Sequence\",11839,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1881\\\"\\u003eCodeforces Round 903 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-415B\":[\"Mashmokh and Tokens\",6512,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/415\\\"\\u003eCodeforces Round 240 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1542B\":[\"Plus and Multiply\",22852,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1542\\\"\\u003eCodeforces Round 729 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1651C\":[\"Fault-tolerant Network\",10613,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1651\\\"\\u003eEducational Codeforces Round 124 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1675E\":[\"Replace With the Previous, Minimize\",10252,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1675\\\"\\u003eCodeforces Round 787 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-742B\":[\"Arpa’s obvious problem and Mehrdad’s terrible solution\",9803,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/742\\\"\\u003eCodeforces Round 383 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-863B\":[\"Kayaking\",8372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"CodeForces-875B\":[\"Sorting the Coins\",5234,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/875\\\"\\u003eCodeforces Round 441 (Div. 1, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-887C\":[\"Solution for Cube\",3149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/887\\\"\\u003eCodeforces Round 444 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-960B\":[\"Minimize the error\",7919,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/960\\\"\\u003eDivide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1444A\":[\"Division\",12941,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1444\\\"\\u003eCodeforces Round 680 (Div. 1, based on Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-1323B\":[\"Count Subrectangles\",8813,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1323\\\"\\u003eCodeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"CodeForces-1105C\":[\"Ayoub and Lost Array\",11043,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1105\\\"\\u003eCodeforces Round 533 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-17B\":[\"Hierarchy\",5295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/17\\\"\\u003eCodeforces Beta Round 17\\u003c/a\\u003e\"],\"CodeForces-402C\":[\"Searching for Graph\",6176,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/402\\\"\\u003eCodeforces Round 236 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-414A\":[\"Mashmokh and Numbers\",9912,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/414\\\"\\u003eCodeforces Round 240 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-29B\":[\"Traffic Lights\",3376,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/29\\\"\\u003eCodeforces Beta Round 29 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-329B\":[\"Biridian Forest\",6759,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/329\\\"\\u003eCodeforces Round 192 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1553D\":[\"Backspace\",13581,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1553\\\"\\u003eHarbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1795C\":[\"Tea Tasting\",11551,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1795\\\"\\u003eEducational Codeforces Round 143 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-523B\":[\"Mean Requests\",945,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/523\\\"\\u003eVK Cup 2015 - Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-620C\":[\"Pearls in a Row\",7096,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/620\\\"\\u003eEducational Codeforces Round 6\\u003c/a\\u003e\"],\"CodeForces-1891C\":[\"Smilo and Monsters\",11294,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1891\\\"\\u003eCodeforces Round 907 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1201B\":[\"Zero Array\",18963,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1201\\\"\\u003eCodeforces Round 577 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1552B\":[\"Running for Gold\",15458,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1552\\\"\\u003eCodeforces Global Round 15\\u003c/a\\u003e\"],\"CodeForces-425A\":[\"Sereja and Swaps\",4129,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/425\\\"\\u003eCodeforces Round 243 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-437B\":[\"The Child and Set\",9916,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/437\\\"\\u003eCodeforces Round 250 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-328B\":[\"Sheldon and Ice Pieces\",1338,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/328\\\"\\u003eTesting Round 8\\u003c/a\\u003e\"],\"CodeForces-1431D\":[\"Used Markers\",447,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1431\\\"\\u003eKotlin Heroes 5: ICPC Round\\u003c/a\\u003e\"],\"CodeForces-1673C\":[\"Palindrome Basis\",11873,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1673\\\"\\u003eCodeforces Round 785 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-329A\":[\"Purification\",4710,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/329\\\"\\u003eCodeforces Round 192 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-643A\":[\"Bear and Colors\",4231,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/643\\\"\\u003eVK Cup 2016 - Round 3\\u003c/a\\u003e\"],\"CodeForces-1462E1\":[\"Close Tuples (easy version)\",13456,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1462\\\"\\u003eCodeforces Round 690 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-510B\":[\"Fox And Two Dots\",15512,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/510\\\"\\u003eCodeforces Round 290 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-873B\":[\"Balanced Substring\",8873,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/873\\\"\\u003eEducational Codeforces Round 30\\u003c/a\\u003e\"],\"CodeForces-982C\":[\"Cut \\u0027em all!\",11596,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/982\\\"\\u003eCodeforces Round 484 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-630K\":[\"Indivisibility\",5625,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-39J\":[\"Spelling Check\",3171,\"\\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-1236B\":[\"Alice and the List of Presents\",11179,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1236\\\"\\u003eCodeforces Round 593 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1139C\":[\"Edgy Trees\",12760,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1139\\\"\\u003eCodeforces Round 548 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-400C\":[\"Inna and Huge Candy Matrix\",3134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/400\\\"\\u003eCodeforces Round 234 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-436A\":[\"Feed with Candy\",3553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/436\\\"\\u003eZepto Code Rush 2014\\u003c/a\\u003e\"],\"CodeForces-1466D\":[\"13th Labour of Heracles\",10985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1466\\\"\\u003eGood Bye 2020\\u003c/a\\u003e\"],\"CodeForces-1551C\":[\"Interesting Story\",13050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1551\\\"\\u003eCodeforces Round 734 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-569A\":[\"Music\",5236,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/569\\\"\\u003eCodeforces Round 315 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-557B\":[\"Pasha and Tea\",7996,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/557\\\"\\u003eCodeforces Round 311 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-545C\":[\"Woodcutters\",28102,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/545\\\"\\u003eCodeforces Round 303 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1575J\":[\"Jeopardy of Dropped Balls\",3835,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1575\\\"\\u003eCOMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-884C\":[\"Bertown Subway\",5001,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/884\\\"\\u003eEducational Codeforces Round 31\\u003c/a\\u003e\"],\"CodeForces-1207C\":[\"Gas Pipeline\",10077,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1207\\\"\\u003eEducational Codeforces Round 71 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1304C\":[\"Air Conditioner\",16526,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1304\\\"\\u003eCodeforces Round 620 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1419D2\":[\"Sage\\u0027s Birthday (hard version)\",15132,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1419\\\"\\u003eCodeforces Round 671 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1776L\":[\"Controllers\",5274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1776\\\"\\u003eSWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1873G\":[\"ABBC or BACB\",11698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1873\\\"\\u003eCodeforces Round 898 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1740D\":[\"Knowledge Cards\",7745,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1740\\\"\\u003eCodeforces Round 831 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-638B\":[\"Making Genome in Berland\",1989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/638\\\"\\u003eVK Cup 2016 - Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-649C\":[\"Печать условий\",440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/649\\\"\\u003eТехнокубок 2016 - Отборочный Раунд 2\\u003c/a\\u003e\"],\"CodeForces-976C\":[\"Nested Segments\",6904,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/976\\\"\\u003eEducational Codeforces Round 43 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-746D\":[\"Green and Black Tea\",5494,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/746\\\"\\u003eCodeforces Round 386 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-855B\":[\"Marvolo Gaunt\\u0027s Ring\",9314,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-710C\":[\"Magic Odd Square\",5440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/710\\\"\\u003eEducational Codeforces Round 16\\u003c/a\\u003e\"],\"CodeForces-940C\":[\"Phone Numbers\",6163,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/940\\\"\\u003eCodeforces Round 466 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1436C\":[\"Binary Search\",10786,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1436\\\"\\u003eCodeforces Round 678 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1545A\":[\"AquaMoon and Strange Sort\",13628,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1545\\\"\\u003eCodeforces Round 732 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1569C\":[\"Jury Meeting\",11770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1569\\\"\\u003eEducational Codeforces Round 113 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1630A\":[\"And Matching\",14197,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1630\\\"\\u003eCodeforces Round 768 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1218F\":[\"Workout plan\",3029,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1218\\\"\\u003eBubble Cup 12 - Finals [Online Mirror, unrated, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-1400C\":[\"Binary String Reconstruction\",17085,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1400\\\"\\u003eEducational Codeforces Round 94 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1872E\":[\"Data Structures Fan\",12378,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1872\\\"\\u003eCodeforces Round 895 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-527B\":[\"Error Correct System\",4240,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/527\\\"\\u003eCodeforces Round 296 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-527C\":[\"Glass Carving\",7505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/527\\\"\\u003eCodeforces Round 296 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-191A\":[\"Dynasty Puzzles\",4545,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/191\\\"\\u003eCodeforces Round 121 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1774B\":[\"Coloring\",11724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1774\\\"\\u003ePolynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1338A\":[\"Powered Addition\",22827,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1338\\\"\\u003eCodeforces Round 633 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1800E2\":[\"Unforgivable Curse (hard version)\",12265,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1800\\\"\\u003eCodeforces Round 855 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1883D\":[\"In Love\",9973,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1883\\\"\\u003eCodeforces Round 905 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-18A\":[\"Triangle\",6274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/18\\\"\\u003eCodeforces Beta Round 18 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-659D\":[\"Bicycle Race\",6868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/659\\\"\\u003eCodeforces Round 346 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-853A\":[\"Planning\",6326,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/853\\\"\\u003eCodeforces Round 433 (Div. 1, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-744A\":[\"Hongcow Builds A Nation\",8393,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/744\\\"\\u003eCodeforces Round 385 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-877B\":[\"Nikita and string\",10724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-611C\":[\"New Year and Domino\",8792,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/611\\\"\\u003eGood Bye 2015\\u003c/a\\u003e\"],\"CodeForces-190C\":[\"STL\",3186,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/190\\\"\\u003eCodeforces Round 120 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1119C\":[\"Ramesses and Corner Inversion\",6760,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1119\\\"\\u003eCodeforces Global Round 2\\u003c/a\\u003e\"],\"CodeForces-1579C\":[\"Ticks\",10785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1579\\\"\\u003eCodeforces Round 744 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1325C\":[\"Ehab and Path-etic MEXs\",13187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1325\\\"\\u003eCodeforces Round 628 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1301B\":[\"Motarack\\u0027s Birthday\",14475,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1301\\\"\\u003eCodeforces Round 619 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1882C\":[\"Card Game\",11319,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1882\\\"\\u003eCodeforces Round 899 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-404B\":[\"Marathon\",3215,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/404\\\"\\u003eCodeforces Round 237 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-417A\":[\"Elimination\",3288,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/417\\\"\\u003eRCC 2014 Warmup (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-997A\":[\"Convert to Ones\",8393,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/997\\\"\\u003eCodeforces Round 493 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-743C\":[\"Vladik and fractions\",13136,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/743\\\"\\u003eCodeforces Round 384 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-864C\":[\"Bus\",6406,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/864\\\"\\u003eCodeforces Round 436 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-501C\":[\"Misha and Forest\",5872,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/501\\\"\\u003eCodeforces Round 285 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-864D\":[\"Make a Permutation!\",6354,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/864\\\"\\u003eCodeforces Round 436 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-985C\":[\"Liebig\\u0027s Barrels\",6029,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/985\\\"\\u003eEducational Codeforces Round 44 (Rated for Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1711955734000,"title":"CodeForces rating 1500 题目集","dislikeCnt":0,"content":"[problem:CodeForces-455A] Boredom动态规划(dp \n[problem:CodeForces-580C] Kefa and park深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-550A] Two substrings暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-550C] Divisibility by eight暴力枚举(brute force) 动态规划(dp), 数学(math\n[problem:CodeForces-545C] Woodcutters动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-580B] Kefa and company二分搜索(binary search) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-2A] Winner哈希表(hashing) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-276C] Little girl and maximum sum数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1338A] Powered addition贪心策略(greedy) 数学(math\n[problem:CodeForces-1542B] Plus and multiply构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-1526C1] Potions (easy version)暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-166E] Tetrahedron动态规划(dp) 数学(math), 矩阵(matrices\n[problem:CodeForces-1352E] Special elements暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1368B] Codeforces subsequences暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math), 字符串处理(strings\n[problem:CodeForces-977E] Cyclic components深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1409D] Decrease the sum of digits贪心策略(greedy) 数学(math\n[problem:CodeForces-1389C] Good string暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1385D] A-good string位掩码(bitmasks) 暴力枚举(brute force), 分治算法(divide and conquer), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1538F] Interesting function二分搜索(binary search) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-676C] Vasya and string二分搜索(binary search) 动态规划(dp), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1516B] Agaga xooorrr位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1418C] Mortal kombat tower动态规划(dp) 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1399D] Binary string to subsequences构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1201B] Zero array贪心策略(greedy) 数学(math\n[problem:CodeForces-1372C] Omkar and baseball构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1487D] Pythagorean triples二分搜索(binary search) 暴力枚举(brute force), 数学(math), 数论(number theory\n[problem:CodeForces-1400C] Binary string reconstruction二分图可满足性问题(2-sat) 暴力枚举(brute force), 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-165B] Burning midnight oil二分搜索(binary search) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1352F] Binary string reconstruction构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 数学(math\n[problem:CodeForces-839C] Journey深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-1272D] Remove one element暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-1492C] Maximum width二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1304C] Air conditioner动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1332C] K-complete word深度优先搜索及其变种(dfs and similar) 并查集(dsu), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1426D] Non-zero segments构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1490F] Equalize the array二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1486B] Eastern exhibition二分搜索(binary search) 计算几何(geometry), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-1552B] Running for gold组合数学(combinatorics) 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1419C] Killjoy贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1404A] Balanced bitstring实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-1419D2] Sage\u0027s birthday (hard version)二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1391C] Cyclic permutations组合数学(combinatorics) 动态规划(dp), 图论(graphs), 数学(math\n[problem:CodeForces-771A] Bear and friendship condition深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1690E] Price maximization二分搜索(binary search) 贪心策略(greedy), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1296C] Yet another walking robot数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1397B] Power sequence暴力枚举(brute force) 数学(math), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-1630A] And matching位掩码(bitmasks) 构造算法(constructive algorithms\n[problem:CodeForces-1301B] Motarack\u0027s birthday二分搜索(binary search) 贪心策略(greedy), 三分搜索(ternary search\n[problem:CodeForces-1106D] Lunar new year and a wander数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1253C] Sweets eating动态规划(dp) 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1296D] Fight with monsters贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-1547E] Air conditioners数据结构(data structures) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1487C] Minimum ties暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-687A] Np-hard problem深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1545A] Aquamoon and strange sort排序算法(sortings \n[problem:CodeForces-701C] They are everywhere二分搜索(binary search) 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1536C] Diluc and kaeya数据结构(data structures) 动态规划(dp), 哈希表(hashing), 数论(number theory\n[problem:CodeForces-1203E] Boxers贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-510B] Fox and two dots深度优先搜索及其变种(dfs and similar \n[problem:CodeForces-1553D] Backspace动态规划(dp) 贪心策略(greedy), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-268C] Beautiful sets of points构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1263D] Secret passwords深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1340A] Nastya and strange generator暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1366C] Palindromic paths贪心策略(greedy) 数学(math\n[problem:CodeForces-576A] Vasya and petya\u0027s game数学(math) 数论(number theory\n[problem:CodeForces-1462E1] Close tuples (easy version)二分搜索(binary search) 组合数学(combinatorics), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1621B] Integers shop数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1792C] Min max sort二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1368C] Even picture构造算法(constructive algorithms \n[problem:CodeForces-1646C] Factorials and powers of two位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 动态规划(dp), 数学(math\n[problem:CodeForces-812C] Sagheer and nubian market二分搜索(binary search) 排序算法(sortings\n[problem:CodeForces-1562C] Rings构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1551C] Interesting story贪心策略(greedy) 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-1325C] Ehab and path-etic mexs构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1278B] A and b贪心策略(greedy) 数学(math\n[problem:CodeForces-670D2] Magic powder - 2二分搜索(binary search) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1283C] Friends and gifts构造算法(constructive algorithms) 数据结构(data structures), 数学(math\n[problem:CodeForces-356A] Knight tournament数据结构(data structures) 并查集(dsu\n[problem:CodeForces-702C] Cellular network二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1506E] Restoring the permutation构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-282B] Painting eggs贪心策略(greedy) 数学(math\n[problem:CodeForces-1444A] Division暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-1379B] Dubious cyrpto二分搜索(binary search) 暴力枚举(brute force), 数学(math), 数论(number theory\n[problem:CodeForces-1473C] No more inversions构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1499C] Minimum grid path暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1242A] Tile painting构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-1249C2] Good numbers (hard version)二分搜索(binary search) 贪心策略(greedy), 数学(math), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-1234C] Pipes动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-707C] Pythagorean triples数学(math) 数论(number theory\n[problem:CodeForces-460B] Little dima and equation暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1616C] Representative edges暴力枚举(brute force) 计算几何(geometry), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1924A] Did we get everything covered?构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy), 最短路算法(shortest paths), 字符串处理(strings\n[problem:CodeForces-1800E2] Unforgivable curse (hard version)暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-743C] Vladik and fractions暴力枚举(brute force) 构造算法(constructive algorithms), 数学(math), 数论(number theory\n[problem:CodeForces-1139C] Edgy trees深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 数学(math), 树形结构(trees\n[problem:CodeForces-1809C] Sum on subarrays构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1256D] Binary string minimizing贪心策略(greedy \n[problem:CodeForces-1379A] Acacius and string暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1416A] K-amazing numbers二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1326D1] Prefix-suffix palindrome (easy version)哈希表(hashing) 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-1299A] Anu has a function暴力枚举(brute force) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1872E] Data structures fan二分搜索(binary search) 位掩码(bitmasks), 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-1569C] Jury meeting组合数学(combinatorics) 数学(math\n[problem:CodeForces-584B] Kolya and tanya组合数学(combinatorics \n[problem:CodeForces-1673C] Palindrome basis暴力枚举(brute force) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1307C] Cow and message暴力枚举(brute force) 动态规划(dp), 数学(math), 字符串处理(strings\n[problem:CodeForces-1774B] Coloring构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1804C] Pull your luck暴力枚举(brute force) 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-1873G] Abbc or bacb构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1811E] Living sequence二分搜索(binary search) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1842C] Tenzing and balls动态规划(dp \n[problem:CodeForces-1857E] Power of points数学(math) 排序算法(sortings\n[problem:CodeForces-1791F] Range update point query二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures\n[problem:CodeForces-702B] Powers of two暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1141C] Polycarp restores permutation数学(math \n[problem:CodeForces-1881E] Block sequence动态规划(dp \n[problem:CodeForces-1795C] Tea tasting二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1515D] Phoenix and socks贪心策略(greedy) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1915F] Greetings数据结构(data structures) 分治算法(divide and conquer), 排序算法(sortings\n[problem:CodeForces-1760F] Quests二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1882C] Card game暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-1850G] The morning star组合数学(combinatorics) 数据结构(data structures), 计算几何(geometry), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-1213D1] Equalizing by division (easy version)暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1891C] Smilo and monsters二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1461C] Random events动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-441C] Valera and tubes构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1215C] Swap letters构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1466D] 13th labour of heracles数据结构(data structures) 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-982C] Cut \u0027em all!深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1742F] Smaller构造算法(constructive algorithms) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1236B] Alice and the list of presents组合数学(combinatorics) 数学(math\n[problem:CodeForces-1710A] Color the picture构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1133D] Zero quantity maximization哈希表(hashing) 数学(math), 数论(number theory\n[problem:CodeForces-1436C] Binary search二分搜索(binary search) 组合数学(combinatorics\n[problem:CodeForces-1858B] The walkway暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-1651C] Fault-tolerant network暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1738C] Even number addicts动态规划(dp) 博弈论(games), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1579C] Ticks贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1817A] Almost increasing subsequence二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1196D1] Rgb substring (easy version)实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1898B] Milena and admirer贪心策略(greedy) 数学(math\n[problem:CodeForces-1722G] Even-odd xor位掩码(bitmasks) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-1179A] Valeriy and deque数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1105C] Ayoub and lost array组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1208B] Uniqueness二分搜索(binary search) 暴力枚举(brute force), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1744E1] Divisible numbers (easy version)暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-1814C] Search in parallel构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1313C1] Skyscrapers (easy version)暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1675E] Replace with the previous Minimize并查集(dsu), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-877B] Nikita and string暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-1676H2] Maximum crossings (hard version)数据结构(data structures) 分治算法(divide and conquer), 排序算法(sortings\n[problem:CodeForces-1614C] Divan and bitwise operations位掩码(bitmasks) 组合数学(combinatorics), 构造算法(constructive algorithms), 动态规划(dp), 数学(math\n[problem:CodeForces-1264A] Beautiful regional contest贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-274A] K-multiple free set二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-991C] Candies二分搜索(binary search) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1005D] Polycarp and div 3动态规划(dp) 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-1759E] The humanoid暴力枚举(brute force) 动态规划(dp), 排序算法(sortings\n[problem:CodeForces-1753A2] Make nonzero sum (hard version)构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-414A] Mashmokh and numbers构造算法(constructive algorithms) 数论(number theory\n[problem:CodeForces-1883D] In love数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-1154D] Walking robot贪心策略(greedy \n[problem:CodeForces-1742G] Orray位掩码(bitmasks) 暴力枚举(brute force), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-264B] Good sequences动态规划(dp) 数论(number theory\n[problem:CodeForces-1207C] Gas pipeline动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-891A] Pride暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-1659C] Line empire二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1611D] Weights assignment for tree edges构造算法(constructive algorithms) 树形结构(trees\n[problem:CodeForces-1180B] Nick and array贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1926E] Vlad and an odd ordering二分搜索(binary search) 位掩码(bitmasks), 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1767D] Playoff组合数学(combinatorics) 构造算法(constructive algorithms), 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1169B] Pairs图论(graphs) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1851E] Nastya and potions深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 排序算法(sortings\n[problem:CodeForces-1439A1] Binary table (easy version)构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1287B] Hyperset暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1051C] Vasya and multisets暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-437B] The child and set位掩码(bitmasks) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-282C] Xor and or构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1196C] Robot breakout实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1933E] Turtle vs. rabbit race: optimal 训练二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math), 三分搜索(ternary search\n[problem:CodeForces-1482B] Restore modulo实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-742B] Arpa’s obvious problem and mehrdad’s terrible solution暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-1110C] Meaningless operations构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-1114B] Yet another array partitioning task构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1269B] Modulo equality暴力枚举(brute force) 排序算法(sortings\n[problem:CodeForces-1166C] A tale of two lands二分搜索(binary search) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1186D] Vus the cossack and numbers构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1739C] Card game组合数学(combinatorics) 构造算法(constructive algorithms), 动态规划(dp), 博弈论(games\n[problem:CodeForces-1408C] Discrete acceleration二分搜索(binary search) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-409H] A + b strikes back 暴力枚举(brute force), 构造算法(constructive algorithms), 并查集(dsu), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-103B] Cthulhu深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1323B] Count subrectangles二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1062B] Math贪心策略(greedy) 数学(math), 数论(number theory\n[problem:CodeForces-553A] Kyoya and colored balls组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-611C] New year and domino动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-855B] Marvolo gaunt\u0027s ring暴力枚举(brute force) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-978D] Almost arithmetic progression暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1141D] Colored boots贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-997A] Convert to ones暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1732D1] Balance (easy version)暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数论(number theory\n[problem:CodeForces-1066B] Heaters贪心策略(greedy) 双指针算法(two pointers\n[problem:CodeForces-1010A] Fly二分搜索(binary search) 数学(math\n[problem:CodeForces-978F] Mentors二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1789C] Serval and toxel\u0027s arrays组合数学(combinatorics) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-744A] Hongcow builds a nation深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-332B] Maximum absurdity数据结构(data structures) 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1102D] Balanced ternary string贪心策略(greedy) 字符串处理(strings\n[problem:CodeForces-845C] Two tvs数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-468A] 24 game构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1101E] Polycarp\u0027s new job实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1195D1] Submarine in the rybinsk sea (easy edition)组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-1740D] Knowledge cards构造算法(constructive algorithms) 数据结构(data structures\n[problem:CodeForces-574B] Bear and three musketeers暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 哈希表(hashing\n[problem:CodeForces-496C] Removing columns暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1101C] Division and union排序算法(sortings \n[problem:CodeForces-1136C] Nastya is transposing matrices构造算法(constructive algorithms) 排序算法(sortings\n[problem:CodeForces-863B] Kayaking暴力枚举(brute force) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1084C] The fair nut and string组合数学(combinatorics) 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-614A] Link/cut tree暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-873B] Balanced substring动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-587A] Duff and weight lifting贪心策略(greedy \n[problem:CodeForces-1876B] Effects of anti pimples组合数学(combinatorics) 数论(number theory), 排序算法(sortings\n[problem:CodeForces-960B] Minimize the error数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1209C] Paint the digits构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1178D] Prime graph构造算法(constructive algorithms) 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-224B] Array位掩码(bitmasks) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-557B] Pasha and tea构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-320B] Ping-pong (easy version)深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-137C] History排序算法(sortings \n[problem:CodeForces-991D] Bishwock动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-340D] Bubble sort graph二分搜索(binary search) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-1081C] Colorful bricks组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1043C] Smallest word构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-930A] Peculiar apple-tree深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-1158A] The party and sweets二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1163B1] Cat party (easy edition)数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1167D] Bicolored rbs构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1106B] Lunar new year and food ordering数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-272C] Dima and staircase数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-908C] New year and curling暴力枚举(brute force) 计算几何(geometry), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-527C] Glass carving二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-771B] Bear and different names构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-821C] Okabe and boxes数据结构(data structures) 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1119C] Ramesses and corner inversion构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-91B] Queue二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-608B] Hamming distance sum组合数学(combinatorics) 字符串处理(strings\n[problem:CodeForces-555A] Case of matryoshkas实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-166C] Median贪心策略(greedy) 数学(math), 排序算法(sortings\n[problem:CodeForces-620C] Pearls in a row贪心策略(greedy \n[problem:CodeForces-609C] Load balancing实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-677C] Vanya and label位掩码(bitmasks) 组合数学(combinatorics), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-976C] Nested segments贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-35C] Fire again暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 最短路算法(shortest paths\n[problem:CodeForces-1181B] Split a number贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1012A] Photo of the sky暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-659D] Bicycle race计算几何(geometry) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-494A] Treasure贪心策略(greedy \n[problem:CodeForces-415B] Mashmokh and tokens二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-300B] Coach暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-760B] Frodo and pillows二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-329B] Biridian forest深度优先搜索及其变种(dfs and similar) 最短路算法(shortest paths\n[problem:CodeForces-696A] Lorenzo von matterhorn暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-864D] Make a permutation!贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-749C] Voting贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-490B] Queue并查集(dsu) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-864C] Bus贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-761C] Dasha and password暴力枚举(brute force) 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-496B] Secret combination暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-990C] Bracket sequences concatenation problem实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-853A] Planning贪心策略(greedy \n[problem:CodeForces-959C] Mahmoud and ehab and the wrong algorithm构造算法(constructive algorithms) 树形结构(trees\n[problem:CodeForces-402C] Searching for graph暴力枚举(brute force) 构造算法(constructive algorithms), 图论(graphs\n[problem:CodeForces-18A] Triangle暴力枚举(brute force) 计算几何(geometry\n[problem:CodeForces-940C] Phone numbers构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1000B] Light it up贪心策略(greedy \n[problem:CodeForces-985C] Liebig\u0027s barrels贪心策略(greedy \n[problem:CodeForces-1725G] Garage二分搜索(binary search) 计算几何(geometry), 数学(math\n[problem:CodeForces-817B] Makes and the product组合数学(combinatorics) 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-1737C] Ela and crickets构造算法(constructive algorithms) 博弈论(games), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-50B] Choosing symbol pairs字符串处理(strings \n[problem:CodeForces-501C] Misha and forest构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-204A] Little elephant and interval二分搜索(binary search) 组合数学(combinatorics), 动态规划(dp\n[problem:CodeForces-676B] Pyramid of glasses实现问题,编程技巧,模拟(implementation) 数学(math), 数学(math\n[problem:CodeForces-858C] Did you mean...动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-354A] Vasya and robot暴力枚举(brute force) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1765K] Torus path贪心策略(greedy) 数学(math\n[problem:CodeForces-748B] Santa claus and keyboard check实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-149C] Division into teams贪心策略(greedy) 数学(math), 排序算法(sortings\n[problem:CodeForces-148B] Escape实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-859C] Pie rules动态规划(dp) 博弈论(games\n[problem:CodeForces-87A] Trains实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-875B] Sorting the coins并查集(dsu) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-630K] Indivisibility数学(math) 数论(number theory\n[problem:CodeForces-901A] Hashing trees构造算法(constructive algorithms) 树形结构(trees\n[problem:CodeForces-1147A] Hide and seek图论(graphs \n[problem:CodeForces-1776L] Controllers二分搜索(binary search) 数学(math\n[problem:CodeForces-204B] Little elephant and cards二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-746D] Green and black tea构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-710C] Magic odd square构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-569A] Music实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-709B] Checkpoints贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-809A] Do you want a date?实现问题,编程技巧,模拟(implementation) 数学(math), 排序算法(sortings\n[problem:CodeForces-255C] Almost arithmetical progression暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-884C] Bertown subway深度优先搜索及其变种(dfs and similar) 贪心策略(greedy), 数学(math\n[problem:CodeForces-329A] Purification构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-868C] Qualification rounds位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 动态规划(dp\n[problem:CodeForces-17B] Hierarchy深度优先搜索及其变种(dfs and similar) 并查集(dsu), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1081B] Farewell party构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1765N] Number reduction贪心策略(greedy \n[problem:CodeForces-599B] Spongebob and joke实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-88B] Keyboard实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-367A] Sereja and algorithm数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-159D] Palindrome pairs 暴力枚举(brute force), 动态规划(dp), 字符串处理(strings\n[problem:CodeForces-1054C] Candies distribution构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-846A] Curriculum vitae暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-643A] Bear and colors实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-520C] Dna alignment数学(math) 字符串处理(strings\n[problem:CodeForces-31B] Sysadmin bob贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-22B] Bargaining table暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-1250L] Divide the students二分搜索(binary search) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1080C] Masha and two friends实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-342B] Xenia and spies暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-443B] Kolya and tandem repeat暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1250H] Happy birthday数学(math \n[problem:CodeForces-724B] Batch sort暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-837C] Two seals暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1031B] Curiosity has no limit \n[problem:CodeForces-144C] Anagram search实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-527B] Error correct system贪心策略(greedy \n[problem:CodeForces-425A] Sereja and swaps暴力枚举(brute force) 排序算法(sortings\n[problem:CodeForces-191A] Dynasty puzzles动态规划(dp \n[problem:CodeForces-858B] Which floor?暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-358B] Dima and text messages暴力枚举(brute force) 字符串处理(strings\n[problem:CodeForces-1575J] Jeopardy of dropped balls二分搜索(binary search) 暴力枚举(brute force), 并查集(dsu), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1070H] Beros file suggestion暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1070F] Debate贪心策略(greedy \n[problem:CodeForces-231B] Magic Wizardry and wonders构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-690C2] Brain network (medium)深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-566F] Clique in the divisibility graph动态规划(dp) 数学(math), 数论(number theory\n[problem:CodeForces-114B] Pfast inc.位掩码(bitmasks) 暴力枚举(brute force), 图论(graphs\n[problem:CodeForces-384B] Multitasking贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-91A] Newspaper headline贪心策略(greedy) 字符串处理(strings\n[problem:CodeForces-229A] Shifts暴力枚举(brute force) 双指针算法(two pointers\n[problem:CodeForces-278B] New problem暴力枚举(brute force) 字符串处理(strings\n[problem:CodeForces-436A] Feed with candy贪心策略(greedy \n[problem:CodeForces-847A] Union of doubly linked lists实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-374B] Inna and nine组合数学(combinatorics) 贪心策略(greedy\n[problem:CodeForces-75B] Facetook priority wall表达式解析(expression parsing) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-825D] Suitable replacement二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-128A] Statues深度优先搜索及其变种(dfs and similar \n[problem:CodeForces-350B] Resort图论(graphs \n[problem:CodeForces-271C] Secret构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-404B] Marathon实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-1218F] Workout plan数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-400C] Inna and huge candy matrix实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-417A] Elimination动态规划(dp) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1089G] Guest student数学(math \n[problem:CodeForces-288B] Polo the penguin and houses组合数学(combinatorics \n[problem:CodeForces-887C] Solution for cube暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-29B] Traffic lights实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-39J] Spelling check哈希表(hashing) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-293A] Weird game博弈论(games) 贪心策略(greedy\n[problem:CodeForces-187A] Permutations贪心策略(greedy \n[problem:CodeForces-190C] Stl深度优先搜索及其变种(dfs and similar \n[problem:CodeForces-362A] Two semiknights meet贪心策略(greedy) 数学(math\n[problem:CodeForces-121B] Lucky transformation字符串处理(strings \n[problem:CodeForces-770C] Online courses in bsu 深度优先搜索及其变种(dfs and similar), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-177C1] Party深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-115B] Lawnmower贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-177C2] Party暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-48D] Permutations贪心策略(greedy \n[problem:CodeForces-290B] Qr code 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-49B] Sum数学(math \n[problem:CodeForces-237B] Young table实现问题,编程技巧,模拟(implementation) 排序算法(sortings\n[problem:CodeForces-245D] Restoring table构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-325A] Square and rectangles实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-254B] Jury size暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-250B] Restoring ipv6实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-638B] Making genome in berland 深度优先搜索及其变种(dfs and similar), 字符串处理(strings\n[problem:CodeForces-774D] Lie or truth 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-44B] Cola实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-883E] Field of wonders实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-177D2] Encrypting messages数据结构(data structures \n[problem:CodeForces-53D] Physical education排序算法(sortings \n[problem:CodeForces-24B] F1 champions实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-10B] Cinema cashier动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-212E] It restaurants深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-958F1] Lightsabers (easy)实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-74B] Train动态规划(dp) 博弈论(games), 贪心策略(greedy\n[problem:CodeForces-316E1] Summer homework暴力枚举(brute force) 数据结构(data structures\n[problem:CodeForces-926G] Large bouquet \n[problem:CodeForces-172D] Calendar reform 数论(number theory\n[problem:CodeForces-331A2] Oh sweet beaverette数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-316B1] Ekg暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-239B] Easy tape programming暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-328B] Sheldon and ice pieces贪心策略(greedy \n[problem:CodeForces-172C] Bus 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-64B] Expression 表达式解析(expression parsing\n[problem:CodeForces-523B] Mean requests 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1211B] Traveling around the golden ring of berland 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-530A] Quadratic equation\n[problem:CodeForces-178D1] Magic square \n[problem:CodeForces-530C] Diophantine equation\n[problem:CodeForces-100B] Friendly numbers 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-130C] Decimal sum\n[problem:CodeForces-345A] Expecting trouble 概率论(probabilities\n[problem:CodeForces-1002A3] Generate superposition of two basis state \n[problem:CodeForces-72I] Goofy numbers 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1431D] Used markers 贪心策略(greedy\n[problem:CodeForces-649C] Печать условий构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-130D] Exponentiation\n[problem:CodeForces-100I] Rotation 计算几何(geometry), 数学(math\n[problem:CodeForces-1002E1] Bernstein-vazirani algorith \n[problem:CodeForces-100D] World of mouth 字符串处理(strings\n[problem:CodeForces-1115U1] Anti-diagonal unitary","threadId":188466,"likeCnt":0,"createTime":1711955682000,"isWorkbook":true,"viewCnt":207,"openness":2,"fav":false,"id":4788,"trustable":false}