Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-32D\":[\"Constellation\",1339,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/32\\\"\\u003eCodeforces Beta Round 32 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-207D5\":[\"The Beaver\\u0027s Problem - 3\",131,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-68B\":[\"Energy exchange\",4959,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/68\\\"\\u003eCodeforces Beta Round 62\\u003c/a\\u003e\"],\"CodeForces-207D7\":[\"The Beaver\\u0027s Problem - 3\",91,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-1255C\":[\"League of Leesins\",6715,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1255\\\"\\u003eCodeforces Round 601 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1025B\":[\"Weakened Common Divisor\",8131,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1025\\\"\\u003eCodeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)\\u003c/a\\u003e\"],\"CodeForces-1461D\":[\"Divide and Summarize\",9251,\"\\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-1025C\":[\"Plasticine zebra\",6226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1025\\\"\\u003eCodeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)\\u003c/a\\u003e\"],\"CodeForces-1582D\":[\"Vupsen, Pupsen and 0\",10310,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1582\\\"\\u003eCodeforces Round 750 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-848A\":[\"From Y to Y\",5154,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/848\\\"\\u003eCodeforces Round 431 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-606B\":[\"Testing Robots\",3004,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/606\\\"\\u003eCodeforces Round 335 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-618C\":[\"Constellation\",4572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/618\\\"\\u003eWunder Fund Round 2016 (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-715A\":[\"Plus and Square Root\",5691,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/715\\\"\\u003eCodeforces Round 372 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-727B\":[\"Bill Total Value\",2131,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/727\\\"\\u003eTechnocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1001E\":[\"Distinguish Bell states\",552,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1001\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018 - Warmup\\u003c/a\\u003e\"],\"CodeForces-1364C\":[\"Ehab and Prefix MEXs\",12942,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1364\\\"\\u003eCodeforces Round 649 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-835C\":[\"Star sky\",8507,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-932C\":[\"Permutation Cycle\",4185,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/932\\\"\\u003eICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-847H\":[\"Load Testing\",2536,\"\\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-1352G\":[\"Special Permutation\",20393,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1352\\\"\\u003eCodeforces Round 640 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1907E\":[\"Good Triples\",8761,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1907\\\"\\u003eCodeforces Round 913 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-57B\":[\"Martian Architecture\",1100,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/57\\\"\\u003eCodeforces Beta Round 53\\u003c/a\\u003e\"],\"CodeForces-1036D\":[\"Vasya and Arrays\",10815,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1036\\\"\\u003eEducational Codeforces Round 50 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1363C\":[\"Game On Leaves\",18444,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1363\\\"\\u003eCodeforces Round 646 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1036B\":[\"Diagonal Walking v.2\",5926,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1036\\\"\\u003eEducational Codeforces Round 50 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1593E\":[\"Gardener and Tree\",11850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1593\\\"\\u003eCodeforces Round 748 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-508C\":[\"Anya and Ghosts\",4770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/508\\\"\\u003eCodeforces Round 288 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-605A\":[\"Sorting Railway Cars\",7438,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/605\\\"\\u003eCodeforces Round 335 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-847B\":[\"Preparing for Merge Sort\",5023,\"\\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-316B2\":[\"EKG\",1646,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-617C\":[\"Watering Flowers\",5434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/617\\\"\\u003eCodeforces Round 340 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1121C\":[\"System Testing\",2045,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1121\\\"\\u003eCodeforces Round 543 (Div. 2, based on Technocup 2019 Final Round)\\u003c/a\\u003e\"],\"CodeForces-616C\":[\"The Labyrinth\",6030,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/616\\\"\\u003eEducational Codeforces Round 5\\u003c/a\\u003e\"],\"CodeForces-725C\":[\"Hidden Word\",2708,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/725\\\"\\u003eCanada Cup 2016\\u003c/a\\u003e\"],\"CodeForces-858D\":[\"Polycarp\\u0027s phone book\",3824,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/858\\\"\\u003eТехнокубок 2018 - Отборочный Раунд 1\\u003c/a\\u003e\"],\"CodeForces-616D\":[\"Longest k-Good Segment\",11039,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/616\\\"\\u003eEducational Codeforces Round 5\\u003c/a\\u003e\"],\"CodeForces-822C\":[\"Hacker, pack your bags!\",4858,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/822\\\"\\u003eCodeforces Round 422 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-979C\":[\"Kuro and Walking Route\",6430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/979\\\"\\u003eCodeforces Round 482 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-171G\":[\"Mysterious numbers - 2\",903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/171\\\"\\u003eApril Fools Day Contest\\u003c/a\\u003e\"],\"CodeForces-171F\":[\"ucyhf\",1311,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/171\\\"\\u003eApril Fools Day Contest\\u003c/a\\u003e\"],\"CodeForces-1213D2\":[\"Equalizing by Division (hard version)\",11501,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-207B1\":[\"Military Trainings\",264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-1520F1\":[\"Guess the K-th Zero (Easy version)\",11066,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1520\\\"\\u003eCodeforces Round 719 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1059C\":[\"Sequence Transformation\",7511,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1059\\\"\\u003eCodeforces Round 514 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1398C\":[\"Good Subarrays\",25088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1398\\\"\\u003eEducational Codeforces Round 93 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-603A\":[\"Alternative Thinking\",7796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/603\\\"\\u003eCodeforces Round 334 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-615B\":[\"Longtail Hedgehog\",5346,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/615\\\"\\u003eCodeforces Round 338 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-845B\":[\"Luba And The Ticket\",5413,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"CodeForces-712C\":[\"Memory and De-Evolution\",6152,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/712\\\"\\u003eCodeforces Round 370 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-930B\":[\"Game with String\",2716,\"\\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-954D\":[\"Fight Against Traffic\",7052,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1917C\":[\"Watering an Array\",9361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1917\\\"\\u003eCodeforces Round 917 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-291D\":[\"Parallel Programming\",1485,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/291\\\"\\u003eCroc Champ 2013 - Qualification Round\\u003c/a\\u003e\"],\"CodeForces-291C\":[\"Network Mask\",1697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/291\\\"\\u003eCroc Champ 2013 - Qualification Round\\u003c/a\\u003e\"],\"CodeForces-207A1\":[\"Beaver\\u0027s Calculator 1.0\",285,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-55B\":[\"Smallest number\",3073,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"CodeForces-1904D1\":[\"Set To Max (Easy Version)\",5658,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1904\\\"\\u003eCodeforces Round 914 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1288C\":[\"Two Arrays\",12979,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1288\\\"\\u003eEducational Codeforces Round 80 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1373D\":[\"Maximum Sum on Even Positions\",15276,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1373\\\"\\u003eEducational Codeforces Round 90 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1482C\":[\"Basic Diplomacy\",9163,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1482\\\"\\u003eТехнокубок 2021 - Финал\\u003c/a\\u003e\"],\"CodeForces-518A\":[\"Vitaly and Strings\",10623,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/518\\\"\\u003eCodeforces Round 293 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-639B\":[\"Bear and Forgotten Tree 3\",6602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/639\\\"\\u003eVK Cup 2016 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1252C\":[\"Even Path\",3901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1252\\\"\\u003e2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-518C\":[\"Anya and Smartphone\",6268,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/518\\\"\\u003eCodeforces Round 293 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-626C\":[\"Block Towers\",5082,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/626\\\"\\u003e8VC Venture Cup 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-856A\":[\"Set Theory\",1417,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/856\\\"\\u003eRussian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]\\u003c/a\\u003e\"],\"CodeForces-723C\":[\"Polycarp at the Radio\",4714,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/723\\\"\\u003eCodeforces Round 375 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-735D\":[\"Taxes\",13899,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/735\\\"\\u003eCodeforces Round 382 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-832B\":[\"Petya and Exam\",4778,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/832\\\"\\u003eCodeforces Round 425 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-735C\":[\"Tennis Championship\",7761,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/735\\\"\\u003eCodeforces Round 382 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-723D\":[\"Lakes in Berland\",7458,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/723\\\"\\u003eCodeforces Round 375 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1928C\":[\"Physical Education Lesson\",7407,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1928\\\"\\u003eCodeforces Round 924 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-188G\":[\"Array Sorting\",325,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/188\\\"\\u003eSurprise Language Round 6\\u003c/a\\u003e\"],\"CodeForces-1115G3\":[\"Palindrome checker oracle\",224,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1115\\\"\\u003eMicrosoft Q# Coding Contest - Winter 2019 - Warmup\\u003c/a\\u003e\"],\"CodeForces-1344A\":[\"Hilbert\\u0027s Hotel\",15368,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1344\\\"\\u003eCodeforces Round 639 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1017C\":[\"The Phone Number\",6197,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1017\\\"\\u003eCodeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-297B\":[\"Fish Weight\",3558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/297\\\"\\u003eCodeforces Round 180 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1029C\":[\"Maximal Intersection\",7749,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1029\\\"\\u003eCodeforces Round 506 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1671D\":[\"Insert a Progression\",7320,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1671\\\"\\u003eEducational Codeforces Round 127 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-949A\":[\"Zebras\",5374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/949\\\"\\u003eCodeforces Round 469 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-36B\":[\"Fractal\",1600,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/36\\\"\\u003eCodeforces Beta Round 36\\u003c/a\\u003e\"],\"CodeForces-1223C\":[\"Save the Nature\",8017,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1223\\\"\\u003eTechnocup 2020 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1115G2\":[\"OR oracle\",305,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1115\\\"\\u003eMicrosoft Q# Coding Contest - Winter 2019 - Warmup\\u003c/a\\u003e\"],\"CodeForces-925A\":[\"Stairs and Elevators\",3430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/925\\\"\\u003eVK Cup 2018 - Round 3\\u003c/a\\u003e\"],\"CodeForces-1B\":[\"Spreadsheet\",23221,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1\\\"\\u003eCodeforces Beta Round 1\\u003c/a\\u003e\"],\"CodeForces-272D\":[\"Dima and Two Sequences\",2712,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/272\\\"\\u003eCodeforces Round 167 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-260B\":[\"Ancient Prophesy\",4029,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/260\\\"\\u003eCodeforces Round 158 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-175C\":[\"Geometry Horse\",1427,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/175\\\"\\u003eCodeforces Round 115\\u003c/a\\u003e\"],\"CodeForces-1028C\":[\"Rectangles\",4558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1028\\\"\\u003eAIM Tech Round 5 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1137B\":[\"Camp Schedule\",6366,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1137\\\"\\u003eCodeforces Round 545 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1137A\":[\"Skyscrapers\",4526,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1137\\\"\\u003eCodeforces Round 545 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1452D\":[\"Radio Towers\",7899,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1452\\\"\\u003eEducational Codeforces Round 98 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1234D\":[\"Distinct Characters Queries\",15648,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1234\\\"\\u003eCodeforces Round 590 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-924B\":[\"Three-level Laser\",5181,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/924\\\"\\u003eVK Cup 2018 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1476C\":[\"Longest Simple Cycle\",11304,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1476\\\"\\u003eEducational Codeforces Round 103 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-706C\":[\"Hard problem\",16800,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/706\\\"\\u003eCodeforces Round 367 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-814C\":[\"An impassioned circulation of affection\",6689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/814\\\"\\u003eCodeforces Round 418 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-935C\":[\"Fifa and Fafa\",4931,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/935\\\"\\u003eCodeforces Round 465 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-923B\":[\"Producing Snow\",7344,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/923\\\"\\u003eVK Cup 2018 - Round 1\\u003c/a\\u003e\"],\"CodeForces-150B\":[\"Quantity of Strings\",4254,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/150\\\"\\u003eCodeforces Round 107 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-380A\":[\"Sereja and Prefixes\",2777,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/380\\\"\\u003eCodeforces Round 223 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-283A\":[\"Cows and Sequence\",6706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/283\\\"\\u003eCodeforces Round 174 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-46C\":[\"Hamsters and Tigers\",2748,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/46\\\"\\u003eSchool Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1027C\":[\"Minimum Value Rectangle\",7078,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1027\\\"\\u003eEducational Codeforces Round 49 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1148B\":[\"Born This Way\",7320,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1148\\\"\\u003eCodeforces Global Round 3\\u003c/a\\u003e\"],\"CodeForces-34D\":[\"Road Map\",5626,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/34\\\"\\u003eCodeforces Beta Round 34 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1003D\":[\"Coins and Queries\",8216,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1003\\\"\\u003eCodeforces Round 494 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1475E\":[\"Advertising Agency\",13520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1475\\\"\\u003eCodeforces Round 697 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1015D\":[\"Walking Between Houses\",8317,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1015\\\"\\u003eCodeforces Round 501 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1342C\":[\"Yet Another Counting Problem\",14003,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1342\\\"\\u003eEducational Codeforces Round 86 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-910B\":[\"Door Frames\",2002,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/910\\\"\\u003eTesting Round 14 (Unrated)\\u003c/a\\u003e\"],\"CodeForces-922C\":[\"Cave Painting\",7578,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1486C1\":[\"Guessing the Greatest (easy version)\",11801,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1486\\\"\\u003eCodeforces Round 703 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-825C\":[\"Multi-judge Solving\",4765,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-1389B\":[\"Array Walk\",16086,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1389\\\"\\u003eEducational Codeforces Round 92 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-23B\":[\"Party\",3671,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/23\\\"\\u003eCodeforces Beta Round 23\\u003c/a\\u003e\"],\"CodeForces-197A\":[\"Plate Game\",7400,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/197\\\"\\u003eCodeforces Round 124 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-11B\":[\"Jumping Jack\",4787,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/11\\\"\\u003eCodeforces Beta Round 11\\u003c/a\\u003e\"],\"CodeForces-1353D\":[\"Constructing the Array\",17995,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1353\\\"\\u003eCodeforces Round 642 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-59C\":[\"Title\",2333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/59\\\"\\u003eCodeforces Beta Round 55 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1680C\":[\"Binary String\",9622,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1680\\\"\\u003eEducational Codeforces Round 128 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-607A\":[\"Chain Reaction\",9702,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/607\\\"\\u003eCodeforces Round 336 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-849B\":[\"Tell Your World\",3790,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/849\\\"\\u003eCodeforces Round 431 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1498C\":[\"Planar Reflections\",9301,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1498\\\"\\u003eCodeCraft-21 and Codeforces Round 711 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-825B\":[\"Five-In-a-Row\",4708,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-704A\":[\"Thor\",9425,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/704\\\"\\u003eCodeforces Round 366 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-837B\":[\"Flag of Berland\",4224,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"CodeForces-812B\":[\"Sagheer, the Hausmeister\",5574,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/812\\\"\\u003eCodeforces Round 417 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-350C\":[\"Bombs\",6680,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/350\\\"\\u003eCodeforces Round 203 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1910C\":[\"Poisonous Swamp\",572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1910\\\"\\u003eKotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!)\\u003c/a\\u003e\"],\"CodeForces-253C\":[\"Text Editor\",2756,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/253\\\"\\u003eCodeforces Round 154 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1607E\":[\"Robot on the Board 1\",9183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1607\\\"\\u003eCodeforces Round 753 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1910B\":[\"Security Guard\",580,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1910\\\"\\u003eKotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!)\\u003c/a\\u003e\"],\"CodeForces-156B\":[\"Suspects\",2341,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/156\\\"\\u003eCodeforces Round 110 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1946C\":[\"Tree Cutting\",8859,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1946\\\"\\u003eCodeforces Round 936 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1801A\":[\"The Very Beautiful Blanket\",8178,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1801\\\"\\u003eCodeforces Round 857 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1198B\":[\"Welfare State\",9409,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1198\\\"\\u003eCodeforces Round 576 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1198A\":[\"MP3\",9257,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1198\\\"\\u003eCodeforces Round 576 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1041C\":[\"Coffee Break\",9613,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1041\\\"\\u003eCodeforces Round 509 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1184D1\":[\"Parallel Universes (Easy)\",2561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1184\\\"\\u003eHelvetic Coding Contest 2019 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1295C\":[\"Obtain The String\",13033,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1295\\\"\\u003eEducational Codeforces Round 81 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1065C\":[\"Make It Equal\",8081,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1065\\\"\\u003eEducational Codeforces Round 52 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1077D\":[\"Cutting Out\",9756,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1077\\\"\\u003eCodeforces Round 521 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-72H\":[\"Reverse It!\",259,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/72\\\"\\u003eUnknown Language Round 2\\u003c/a\\u003e\"],\"CodeForces-495B\":[\"Modular Equations\",7235,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/495\\\"\\u003eCodeforces Round 282 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-73A\":[\"The Elder Trolls IV: Oblivon\",1382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/73\\\"\\u003eCodeforces Beta Round 66\\u003c/a\\u003e\"],\"CodeForces-1703G\":[\"Good Key, Bad Key\",10113,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1703\\\"\\u003eCodeforces Round 806 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1921E\":[\"Eat the Chip\",8913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1921\\\"\\u003eCodeforces Round 920 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-131D\":[\"Subway\",4765,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/131\\\"\\u003eCodeforces Beta Round 95 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-373B\":[\"Making Sequences is Fun\",2647,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/373\\\"\\u003eCodeforces Round 219 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-167A\":[\"Wizards and Trolleybuses\",2093,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/167\\\"\\u003eCodeforces Round 114 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-916C\":[\"Jamie and Interesting Graph\",5351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/916\\\"\\u003eCodeforces Round 457 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1002B3\":[\"Distinguish four 2-qubit states\",405,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1002\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018\\u003c/a\\u003e\"],\"CodeForces-1002B2\":[\"Distinguish GHZ state and W state\",441,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1002\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018\\u003c/a\\u003e\"],\"CodeForces-1294D\":[\"MEX maximizing\",11760,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1294\\\"\\u003eCodeforces Round 615 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1849C\":[\"Binary String Copying\",9911,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1849\\\"\\u003eEducational Codeforces Round 152 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-130E\":[\"Tribonacci numbers\",292,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/130\\\"\\u003eUnknown Language Round 4\\u003c/a\\u003e\"],\"CodeForces-1932E\":[\"Final Countdown\",6722,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1932\\\"\\u003eCodeforces Round 927 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1920C\":[\"Partitioning the Array\",11782,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1920\\\"\\u003eCodeforces Round 919 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1702E\":[\"Split Into Two Sets\",12544,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1702\\\"\\u003eCodeforces Round 805 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1811D\":[\"Umka and a Long Flight\",7090,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1811\\\"\\u003eCodeforces Round 863 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-142A\":[\"Help Farmer\",2666,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/142\\\"\\u003eCodeforces Round 102 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-154B\":[\"Colliders\",5220,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/154\\\"\\u003eCodeforces Round 109 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-372A\":[\"Counting Kangaroos is Fun\",14705,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/372\\\"\\u003eCodeforces Round 219 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1714D\":[\"Color with Occurrences\",8670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1714\\\"\\u003eCodeforces Round 811 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-154A\":[\"Hometask\",4181,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/154\\\"\\u003eCodeforces Round 109 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-818B\":[\"Permutation Game\",3181,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"CodeForces-178C1\":[\"Smart Beaver and Resolving Collisions\",483,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-939C\":[\"Convenient For Everybody\",4819,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/939\\\"\\u003eCodeforces Round 464 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-939D\":[\"Love Rescue\",7862,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/939\\\"\\u003eCodeforces Round 464 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1281B\":[\"Azamon Web Services\",8353,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1281\\\"\\u003eCodeforces Round 607 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-70B\":[\"Text Messaging\",1878,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/70\\\"\\u003eCodeforces Beta Round 64\\u003c/a\\u003e\"],\"CodeForces-130H\":[\"Balanced brackets\",477,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/130\\\"\\u003eUnknown Language Round 4\\u003c/a\\u003e\"],\"CodeForces-493C\":[\"Vasya and Basketball\",7030,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/493\\\"\\u003eCodeforces Round 281 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-130F\":[\"Prime factorization\",272,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/130\\\"\\u003eUnknown Language Round 4\\u003c/a\\u003e\"],\"CodeForces-1822E\":[\"Making Anti-Palindromes\",9794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1822\\\"\\u003eCodeforces Round 867 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-250C\":[\"Movie Critics\",2006,\"\\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-371C\":[\"Hamburgers\",27619,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/371\\\"\\u003eCodeforces Round 218 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-95A\":[\"Hockey\",1705,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/95\\\"\\u003eCodeforces Beta Round 77 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-153A\":[\"A + B\",762,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/153\\\"\\u003eSurprise Language Round 5\\u003c/a\\u003e\"],\"CodeForces-383A\":[\"Milking cows\",5450,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/383\\\"\\u003eCodeforces Round 225 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-165C\":[\"Another Problem on Strings\",12865,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/165\\\"\\u003eCodeforces Round 112 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1519D\":[\"Maximum Sum of Products\",15949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1519\\\"\\u003eEducational Codeforces Round 108 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1098A\":[\"Sum in the tree\",8569,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1098\\\"\\u003eCodeforces Round 530 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-178B2\":[\"Greedy Merchants\",646,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-817C\":[\"Really Big Numbers\",8053,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"CodeForces-926D\":[\"Choose Place\",903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/926\\\"\\u003eVK Cup 2018 - Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-178B1\":[\"Greedy Merchants\",736,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-913C\":[\"Party Lemonade\",8534,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/913\\\"\\u003eHello 2018\\u003c/a\\u003e\"],\"CodeForces-1062C\":[\"Banh-mi\",5744,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1062\\\"\\u003eCodeforces Round 520 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-71C\":[\"Round Table Knights\",6595,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/71\\\"\\u003eCodeforces Beta Round 65 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-64C\":[\"Table\",336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/64\\\"\\u003eUnknown Language Round 1\\u003c/a\\u003e\"],\"CodeForces-52B\":[\"Right Triangles\",2329,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/52\\\"\\u003eCodeforces Testing Round 1\\u003c/a\\u003e\"],\"CodeForces-100E\":[\"Lamps in a Line\",266,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/100\\\"\\u003eUnknown Language Round 3\\u003c/a\\u003e\"],\"CodeForces-40B\":[\"Repaintings\",1149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/40\\\"\\u003eCodeforces Beta Round 39\\u003c/a\\u003e\"],\"CodeForces-1938H\":[\"Pho Restaurant\",1866,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1938\\\"\\u003e2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1829G\":[\"Hits Different\",9493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1829\\\"\\u003eCodeforces Round 871 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-269A\":[\"Magical Boxes\",3596,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/269\\\"\\u003eCodeforces Round 165 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1481C\":[\"Fence Painting\",11499,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1481\\\"\\u003eCodeforces Round 699 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1251C\":[\"Minimize The Integer\",12505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1251\\\"\\u003eEducational Codeforces Round 75 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1033C\":[\"Permutation Game\",5649,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1033\\\"\\u003eLyft Level 5 Challenge 2018 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1396A\":[\"Multiples of Length\",15132,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1396\\\"\\u003eCodeforces Round 666 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1566D2\":[\"Seating Arrangements (hard version)\",7757,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1566\\\"\\u003eCodeforces Global Round 16\\u003c/a\\u003e\"],\"CodeForces-1045I\":[\"Palindrome Pairs\",4850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1045\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-1227D1\":[\"Optimal Subsequences (Easy Version)\",6192,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1227\\\"\\u003eTechnocup 2020 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1806C\":[\"Sequence Master\",7211,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1806\\\"\\u003eCodeforces Round 858 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-681C\":[\"Heap Operations\",9958,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/681\\\"\\u003eCodeforces Round 357 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-353C\":[\"Find Maximum\",4931,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/353\\\"\\u003eCodeforces Round 205 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-232A\":[\"Cycles\",2578,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/232\\\"\\u003eCodeforces Round 144 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-244B\":[\"Undoubtedly Lucky Numbers\",4871,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/244\\\"\\u003eCodeforces Round 150 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-135B\":[\"Rectangle and Square\",2457,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/135\\\"\\u003eCodeforces Beta Round 97 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-377A\":[\"Maze\",24443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/377\\\"\\u003eCodeforces Round 222 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1056B\":[\"Divide Candies\",4230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1056\\\"\\u003eMail.Ru Cup 2018 Round 3\\u003c/a\\u003e\"],\"CodeForces-1395C\":[\"Boboniu and Bit Operations\",13956,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1395\\\"\\u003eCodeforces Round 664 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1165E\":[\"Two Arrays and Sum of Functions\",8201,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1165\\\"\\u003eCodeforces Round 560 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1165D\":[\"Almost All Divisors\",16796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1165\\\"\\u003eCodeforces Round 560 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1056D\":[\"Decorate Apple Tree\",5806,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1056\\\"\\u003eMail.Ru Cup 2018 Round 3\\u003c/a\\u003e\"],\"CodeForces-1371D\":[\"Grid-00100\",12979,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1371\\\"\\u003eCodeforces Round 654 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-595B\":[\"Pasha and Phone\",3105,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/595\\\"\\u003eCodeforces Round 330 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-231D\":[\"Magic Box\",4283,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/231\\\"\\u003eCodeforces Round 143 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-340C\":[\"Tourist Problem\",4394,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/340\\\"\\u003eCodeforces Round 198 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-231C\":[\"To Add or Not to Add\",8900,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/231\\\"\\u003eCodeforces Round 143 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-86A\":[\"Reflection\",1406,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"CodeForces-243A\":[\"The Brand New Function\",4041,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/243\\\"\\u003eCodeforces Round 150 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-364A\":[\"Matrix\",4741,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/364\\\"\\u003eCodeforces Round 213 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1031C\":[\"Cram Time\",5322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1031\\\"\\u003eTechnocup 2019 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1140C\":[\"Playlist\",9854,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1140\\\"\\u003eEducational Codeforces Round 62 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1707A\":[\"Doremy\\u0027s IQ\",13149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1707\\\"\\u003eCodeforces Round 808 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-691B\":[\"s-palindrome\",5671,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/691\\\"\\u003eEducational Codeforces Round 14\\u003c/a\\u003e\"],\"CodeForces-570C\":[\"Replacement\",9736,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/570\\\"\\u003eCodeforces Round 316 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1203D1\":[\"Remove the Substring (easy version)\",8670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1203\\\"\\u003eCodeforces Round 579 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-75C\":[\"Modified GCD\",14127,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/75\\\"\\u003eCodeforces Beta Round 67 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-375B\":[\"Maximum Submatrix 2\",5178,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/375\\\"\\u003eCodeforces Round 221 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-375A\":[\"Divisible by Seven\",4955,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/375\\\"\\u003eCodeforces Round 221 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-906A\":[\"Shockers\",4187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/906\\\"\\u003eCodeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-1151B\":[\"Dima and a Bad XOR\",11370,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1151\\\"\\u003eCodeforces Round 553 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1284C\":[\"New Year and Permutation\",7957,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1284\\\"\\u003eHello 2020\\u003c/a\\u003e\"],\"CodeForces-1175C\":[\"Electrification\",6941,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1175\\\"\\u003eEducational Codeforces Round 66 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1175B\":[\"Catch Overflow!\",10639,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1175\\\"\\u003eEducational Codeforces Round 66 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1151D\":[\"Stas and the Queue at the Buffet\",8711,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1151\\\"\\u003eCodeforces Round 553 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-593B\":[\"Anton and Lines\",4390,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/593\\\"\\u003eCodeforces Round 329 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1609D\":[\"Social Network\",7075,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1609\\\"\\u003eDeltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1623C\":[\"Balanced Stone Heaps\",11561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1623\\\"\\u003eCodeforces Round 763 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1514C\":[\"Product 1 Modulo N\",14565,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1514\\\"\\u003eCodeforces Round 716 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-431C\":[\"k-Tree\",26065,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/431\\\"\\u003eCodeforces Round 247 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-322B\":[\"Ciel and Flowers\",12268,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/322\\\"\\u003eCodeforces Round 190 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-225B\":[\"Well-known Numbers\",3291,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/225\\\"\\u003eCodeforces Round 139 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-237C\":[\"Primes on Interval\",6421,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/237\\\"\\u003eCodeforces Round 147 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-346A\":[\"Alice and Bob\",9108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/346\\\"\\u003eCodeforces Round 201 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1513C\":[\"Add One\",13666,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1513\\\"\\u003eDivide by Zero 2021 and Codeforces Round 714 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1610C\":[\"Keshi Is Throwing a Party\",10899,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1610\\\"\\u003eCodeforces Global Round 17\\u003c/a\\u003e\"],\"CodeForces-1622C\":[\"Set or Decrease\",12662,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1622\\\"\\u003eEducational Codeforces Round 120 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1779C\":[\"Least Prefix Sum\",11896,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1779\\\"\\u003eHello 2023\\u003c/a\\u003e\"],\"CodeForces-430A\":[\"Points and Segments (easy)\",2386,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/430\\\"\\u003eCodeforces Round 245 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-333A\":[\"Secrets\",4170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/333\\\"\\u003eCodeforces Round 194 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-369C\":[\"Valera and Elections\",9906,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/369\\\"\\u003eCodeforces Round 216 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1840E\":[\"Character Blocking\",7554,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1840\\\"\\u003eCodeforces Round 878 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-139B\":[\"Wallpaper\",1343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/139\\\"\\u003eCodeforces Beta Round 99 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1115U2\":[\"Chessboard unitary\",227,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1115\\\"\\u003eMicrosoft Q# Coding Contest - Winter 2019 - Warmup\\u003c/a\\u003e\"],\"CodeForces-599C\":[\"Day at the Beach\",4820,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/599\\\"\\u003eCodeforces Round 332 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-793B\":[\"Igor and his way to work\",4668,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/793\\\"\\u003eTinkoff Challenge - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-660C\":[\"Hard Process\",10818,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/660\\\"\\u003eEducational Codeforces Round 11\\u003c/a\\u003e\"],\"CodeForces-1658D1\":[\"388535 (Easy Version)\",8874,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1658\\\"\\u003eCodeforces Round 779 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1766D\":[\"Lucky Chains\",8487,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1766\\\"\\u003eEducational Codeforces Round 139 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1730B\":[\"Meeting on the Line\",12143,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1730\\\"\\u003eCodeforces Round 823 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1875D\":[\"Jellyfish and Mex\",7597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1875\\\"\\u003eCodeforces Round 901 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1899F\":[\"Alex\\u0027s whims\",6638,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1899\\\"\\u003eCodeforces Round 909 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1633D\":[\"Make Them Equal\",13384,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1633\\\"\\u003eEducational Codeforces Round 122 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1778C\":[\"Flexible String\",7708,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1778\\\"\\u003eCodeforces Round 848 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-453A\":[\"Little Pony and Expected Maximum\",11005,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/453\\\"\\u003eCodeforces Round 259 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-235A\":[\"LCM Challenge\",18231,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/235\\\"\\u003eCodeforces Round 146 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-138A\":[\"Literature Lesson\",2426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/138\\\"\\u003eCodeforces Beta Round 99 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1512E\":[\"Permutation by Sum\",10244,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1512\\\"\\u003eCodeforces Round 713 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1163B2\":[\"Cat Party (Hard Edition)\",7276,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1163\\\"\\u003eCodeforces Round 558 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-683B\":[\"The Teacher of Physical Education\",316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/683\\\"\\u003eSurprise Language Round 8\\u003c/a\\u003e\"],\"CodeForces-683C\":[\"Symmetric Difference\",314,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/683\\\"\\u003eSurprise Language Round 8\\u003c/a\\u003e\"],\"CodeForces-780B\":[\"The Meeting Place Cannot Be Changed\",9455,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/780\\\"\\u003eТехнокубок 2017 - Финал (только для онсайт-финалистов)\\u003c/a\\u003e\"],\"CodeForces-780C\":[\"Andryusha and Colored Balloons\",9526,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/780\\\"\\u003eТехнокубок 2017 - Финал (только для онсайт-финалистов)\\u003c/a\\u003e\"],\"CodeForces-1305C\":[\"Kuroni and Impossible Calculation\",14415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1305\\\"\\u003eOzon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!)\\u003c/a\\u003e\"],\"CodeForces-1753B\":[\"Factorial Divisibility\",12382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1753\\\"\\u003eCodeforces Round 829 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1886C\":[\"Decreasing String\",10187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1886\\\"\\u003eEducational Codeforces Round 156 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1632C\":[\"Strange Test\",12422,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1632\\\"\\u003eCodeforces Round 769 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-234G\":[\"Practice\",1543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/234\\\"\\u003eCodeforces Round 145 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1523C\":[\"Compression and Expansion\",8746,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1523\\\"\\u003eDeltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-234E\":[\"Champions\\u0027 League\",1088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/234\\\"\\u003eCodeforces Round 145 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-440B\":[\"Balancer\",2076,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/440\\\"\\u003eTesting Round 10\\u003c/a\\u003e\"],\"CodeForces-234D\":[\"Cinema\",1599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/234\\\"\\u003eCodeforces Round 145 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-958E1\":[\"Guard Duty (easy)\",1598,\"\\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-246D\":[\"Colorful Graph\",9722,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/246\\\"\\u003eCodeforces Round 151 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-343B\":[\"Alternating Current\",16278,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/343\\\"\\u003eCodeforces Round 200 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-113A\":[\"Grammar Lessons\",2374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/113\\\"\\u003eCodeforces Beta Round 86 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-246C\":[\"Beauty Pageant\",2767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/246\\\"\\u003eCodeforces Round 151 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-343A\":[\"Rational Resistance\",9031,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/343\\\"\\u003eCodeforces Round 200 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-125C\":[\"Hobbits\\u0027 Party\",1035,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/125\\\"\\u003eCodeforces Testing Round 2\\u003c/a\\u003e\"],\"CodeForces-149B\":[\"Martian Clock\",2393,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1741E\":[\"Sending a Sequence Over the Network\",11230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1741\\\"\\u003eCodeforces Round 826 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1862E\":[\"Kolya and Movie Theatre\",9626,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1862\\\"\\u003eCodeforces Round 894 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1511D\":[\"Min Cost String\",11307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1511\\\"\\u003eEducational Codeforces Round 107 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1526C2\":[\"Potions (Hard Version)\",23706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1526\\\"\\u003eCodeforces Round 723 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-597A\":[\"Divisibility\",4928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/597\\\"\\u003eTesting Round 12\\u003c/a\\u003e\"],\"CodeForces-597B\":[\"Restaurant\",5570,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/597\\\"\\u003eTesting Round 12\\u003c/a\\u003e\"],\"CodeForces-476C\":[\"Dreamoon and Sums\",5743,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/476\\\"\\u003eCodeforces Round 272 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-573B\":[\"Bear and Blocks\",6020,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/573\\\"\\u003eCodeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-682C\":[\"Alyona and the Tree\",7834,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/682\\\"\\u003eCodeforces Round 358 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1833E\":[\"Round Dance\",10351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1833\\\"\\u003eCodeforces Round 874 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1857F\":[\"Sum and Product\",10399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1857\\\"\\u003eCodeforces Round 891 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1603B\":[\"Moderate Modular Mode\",13328,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1603\\\"\\u003eCodeforces Round 752 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1615C\":[\"Menorah\",8106,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1615\\\"\\u003eCodeforces Global Round 18\\u003c/a\\u003e\"],\"CodeForces-1748C\":[\"Zero-Sum Prefixes\",10542,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1748\\\"\\u003eCodeforces Round 833 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-411B\":[\"Multi-core Processor\",1290,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/411\\\"\\u003eCoder-Strike 2014 - Qualification Round\\u003c/a\\u003e\"],\"CodeForces-435C\":[\"Cardiogram\",2679,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/435\\\"\\u003eCodeforces Round 249 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-314A\":[\"Sereja and Contest\",2100,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/314\\\"\\u003eCodeforces Round 187 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1085C\":[\"Connect Three\",5507,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1085\\\"\\u003eTechnocup 2019 - Elimination Round 4\\u003c/a\\u003e\"],\"CodeForces-568A\":[\"Primes or Palindromes?\",5782,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/568\\\"\\u003eCodeforces Round 315 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-689B\":[\"Mike and Shortcuts\",6354,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/689\\\"\\u003eCodeforces Round 361 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-665A\":[\"Buses Between Cities\",3066,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/665\\\"\\u003eEducational Codeforces Round 12\\u003c/a\\u003e\"],\"CodeForces-750C\":[\"New Year and Rating\",6989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/750\\\"\\u003eGood Bye 2016\\u003c/a\\u003e\"],\"CodeForces-992B\":[\"Nastya Studies Informatics\",6557,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/992\\\"\\u003eCodeforces Round 489 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-980B\":[\"Marlin\",4972,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/980\\\"\\u003eCodeforces Round 480 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-992C\":[\"Nastya and a Wardrobe\",4825,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/992\\\"\\u003eCodeforces Round 489 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-774K\":[\"Stepan and Vowels\",1266,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/774\\\"\\u003eVK Cup 2017 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-1505B\":[\"DMCA\",6024,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1505\\\"\\u003eApril Fools Day Contest 2021\\u003c/a\\u003e\"],\"CodeForces-1856C\":[\"To Become Max\",11423,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1856\\\"\\u003eCodeforces Round 890 (Div. 2) supported by Constructor Institute\\u003c/a\\u003e\"],\"CodeForces-337C\":[\"Quiz\",5096,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/337\\\"\\u003eCodeforces Round 196 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-107B\":[\"Basketball Team\",3847,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/107\\\"\\u003eCodeforces Beta Round 83 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-446A\":[\"DZY Loves Sequences\",12724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/446\\\"\\u003eCodeforces Round #FF (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1096C\":[\"Polygon for the Angle\",7062,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1096\\\"\\u003eEducational Codeforces Round 57 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1941E\":[\"Rudolf and k Bridges\",8039,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1941\\\"\\u003eCodeforces Round 933 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1060C\":[\"Maximum Subrectangle\",5265,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1060\\\"\\u003eCodeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1290A\":[\"Mind Control\",8434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1290\\\"\\u003eCodeforces Round 616 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-785C\":[\"Anton and Fairy Tale\",7999,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/785\\\"\\u003eCodeforces Round 404 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1722E\":[\"Counting Rectangles\",10299,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1722\\\"\\u003eCodeforces Round 817 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1843E\":[\"Tracking Segments\",11123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1843\\\"\\u003eCodeforces Round 881 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1407C\":[\"Chocolate Bunny\",11653,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1407\\\"\\u003eCodeforces Round 669 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-348A\":[\"Mafia\",13591,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/348\\\"\\u003eCodeforces Round 202 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1537E1\":[\"Erase and Extend (Easy Version)\",12960,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1537\\\"\\u003eCodeforces Round 726 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1095D\":[\"Circular Dance\",7813,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1095\\\"\\u003eCodeforces Round 529 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-530B\":[\"String inside out\",537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/530\\\"\\u003eVK Cup 2015 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-1282B2\":[\"K for the Price of One (Hard Version)\",10148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1282\\\"\\u003eCodeforces Round 610 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-530D\":[\"Set subtraction\",446,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/530\\\"\\u003eVK Cup 2015 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-1878D\":[\"Reverse Madness\",7584,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1878\\\"\\u003eCodeforces Round 900 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1612D\":[\"X-Magic Pair\",9083,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1612\\\"\\u003eEducational Codeforces Round 117 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1539D\":[\"PriceFixed\",11440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1539\\\"\\u003eCodeforces Round 727 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1503A\":[\"Balance the Bits\",13141,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1503\\\"\\u003eCodeforces Round 712 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1527C\":[\"Sequence Pair Weight\",13313,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1527\\\"\\u003eCodeforces Round 721 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-214B\":[\"Hometask\",5178,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/214\\\"\\u003eCodeforces Round 131 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-323A\":[\"Black-and-White Cube\",757,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/323\\\"\\u003eTesting Round 7\\u003c/a\\u003e\"],\"CodeForces-444A\":[\"DZY Loves Physics\",3632,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/444\\\"\\u003eCodeforces Round 254 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1184C1\":[\"Heidi and the Turing Test (Easy)\",2666,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1184\\\"\\u003eHelvetic Coding Contest 2019 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1196D2\":[\"RGB Substring (hard version)\",9713,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1196\\\"\\u003eCodeforces Round 575 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1082C\":[\"Multi-Subject Competition\",5749,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1082\\\"\\u003eEducational Codeforces Round 55 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1082B\":[\"Vova and Trophies\",7975,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1082\\\"\\u003eEducational Codeforces Round 55 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1002D3\":[\"Oracle for majority function\",313,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1002\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018\\u003c/a\\u003e\"],\"CodeForces-1528A\":[\"Parsa\\u0027s Humongous Tree\",14292,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1528\\\"\\u003eCodeforces Round 722 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1336A\":[\"Linova and Kingdom\",19697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1336\\\"\\u003eCodeforces Round 635 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1687A\":[\"The Enchanted Forest\",10035,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1687\\\"\\u003eCodeforces Round 796 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1348C\":[\"Phoenix and Distribution\",14429,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1348\\\"\\u003eCodeforces Round 638 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1469C\":[\"Building a Fence\",10707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1469\\\"\\u003eEducational Codeforces Round 101 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-28B\":[\"pSort\",4921,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/28\\\"\\u003eCodeforces Beta Round 28 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1542C\":[\"Strange Function\",13847,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1542\\\"\\u003eCodeforces Round 729 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-28A\":[\"Bender Problem\",829,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/28\\\"\\u003eCodeforces Beta Round 28 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1530D\":[\"Secret Santa\",9019,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1530\\\"\\u003eCodeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine))\\u003c/a\\u003e\"],\"CodeForces-1796C\":[\"Maximum Set\",9847,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1796\\\"\\u003eEducational Codeforces Round 144 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-319A\":[\"Malek Dance Club\",2851,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/319\\\"\\u003eCodeforces Round 189 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1243B2\":[\"Character Swap (Hard Version)\",7088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1243\\\"\\u003eCodeforces Round 599 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-524A\":[\"Возможно, вы знаете этих людей?\",1392,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/524\\\"\\u003eVK Cup 2015 - Round 1\\u003c/a\\u003e\"],\"CodeForces-645C\":[\"Enduring Exodus\",3770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/645\\\"\\u003eCROC 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-500B\":[\"New Year Permutation\",9513,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/500\\\"\\u003eGood Bye 2014\\u003c/a\\u003e\"],\"CodeForces-500C\":[\"New Year Book Reading\",6619,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/500\\\"\\u003eGood Bye 2014\\u003c/a\\u003e\"],\"CodeForces-730G\":[\"Car Repair Shop\",2261,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/730\\\"\\u003e2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1238C\":[\"Standard Free2play\",7405,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1238\\\"\\u003eEducational Codeforces Round 74 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1468K\":[\"The Robot\",5138,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1468\\\"\\u003e2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-305C\":[\"Ivan and Powers of Two\",2733,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/305\\\"\\u003eCodeforces Round 184 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1795D\":[\"Triangle Coloring\",8517,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1795\\\"\\u003eEducational Codeforces Round 143 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1698D\":[\"Fixed Point Guessing\",8769,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1698\\\"\\u003eCodeforces Round 803 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1771C\":[\"Hossam and Trainees\",9296,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1771\\\"\\u003eCodeforces Round 837 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-305A\":[\"Strange Addition\",4888,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/305\\\"\\u003eCodeforces Round 184 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-317A\":[\"Perfect Pair\",4742,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/317\\\"\\u003eCodeforces Round 188 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-559A\":[\"Gerald\\u0027s Hexagon\",10903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/559\\\"\\u003eCodeforces Round 313 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-209A\":[\"Multicolored Marbles\",2467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/209\\\"\\u003eVK Cup 2012 Finals, Practice Session\\u003c/a\\u003e\"],\"CodeForces-741A\":[\"Arpa\\u0027s loud Owf and Mehrdad\\u0027s evil plan\",5504,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/741\\\"\\u003eCodeforces Round 383 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-753B\":[\"Interactive Bulls and Cows (Easy)\",1246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/753\\\"\\u003eTesting Round 13\\u003c/a\\u003e\"],\"CodeForces-898D\":[\"Alarm Clock\",4059,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-777C\":[\"Alyona and Spreadsheet\",6862,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-523D\":[\"Statistics of Recompressing Videos\",2324,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/523\\\"\\u003eVK Cup 2015 - Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-741B\":[\"Arpa\\u0027s weak amphitheater and Mehrdad\\u0027s valuable Hoses\",5321,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/741\\\"\\u003eCodeforces Round 383 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-898E\":[\"Squares and not squares\",4925,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1497C2\":[\"k-LCM (hard version)\",16710,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1497\\\"\\u003eCodeforces Round 708 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1358C\":[\"Celex Update\",17363,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1358\\\"\\u003eCodeforces Round 645 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1346C\":[\"Spring Cleaning\",580,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1346\\\"\\u003eKotlin Heroes: Episode 4\\u003c/a\\u003e\"],\"CodeForces-1225C\":[\"p-binary\",8793,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1225\\\"\\u003eTechnocup 2020 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1334C\":[\"Circle of Monsters\",16519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1334\\\"\\u003eEducational Codeforces Round 85 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1346D\":[\"Constructing the Dungeon\",479,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1346\\\"\\u003eKotlin Heroes: Episode 4\\u003c/a\\u003e\"],\"CodeForces-1455D\":[\"Sequence and Swaps\",12185,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1455\\\"\\u003eEducational Codeforces Round 99 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-219C\":[\"Color Stripe\",7118,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/219\\\"\\u003eCodeforces Round 135 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1431C\":[\"Black Friday\",693,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1431\\\"\\u003eKotlin Heroes 5: ICPC Round\\u003c/a\\u003e\"],\"CodeForces-788A\":[\"Functions again\",9479,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/788\\\"\\u003eCodeforces Round 407 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-534C\":[\"Polycarpus\\u0027 Dice\",5403,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/534\\\"\\u003eCodeforces Round 298 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-643B\":[\"Bear and Two Paths\",3185,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/643\\\"\\u003eVK Cup 2016 - Round 3\\u003c/a\\u003e\"],\"CodeForces-873C\":[\"Strange Game On Matrix\",3553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/873\\\"\\u003eEducational Codeforces Round 30\\u003c/a\\u003e\"],\"CodeForces-7B\":[\"Memory Manager\",2568,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/7\\\"\\u003eCodeforces Beta Round 7\\u003c/a\\u003e\"],\"CodeForces-510C\":[\"Fox And Names\",17148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/510\\\"\\u003eCodeforces Round 290 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1660D\":[\"Maximum Product Strikes Back\",8266,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1660\\\"\\u003eCodeforces Round 780 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-424C\":[\"Magic Formulas\",5451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/424\\\"\\u003eCodeforces Round 242 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1006E\":[\"Military Problem\",10197,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1006\\\"\\u003eCodeforces Round 498 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1781C\":[\"Equal Frequencies\",7061,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1781\\\"\\u003eVK Cup 2022 - Отборочный раунд (Engine)\\u003c/a\\u003e\"],\"CodeForces-1660E\":[\"Matrix and Shifts\",7112,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1660\\\"\\u003eCodeforces Round 780 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1321C\":[\"Remove Adjacent\",9893,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1321\\\"\\u003eCodeforces Round 625 (Div. 2, based on Technocup 2020 Final Round)\\u003c/a\\u003e\"],\"CodeForces-678B\":[\"The Same Calendar\",4594,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/678\\\"\\u003eEducational Codeforces Round 13\\u003c/a\\u003e\"],\"CodeForces-678C\":[\"Joty and Chocolate\",10164,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/678\\\"\\u003eEducational Codeforces Round 13\\u003c/a\\u003e\"],\"CodeForces-763A\":[\"Timofey and a tree\",10473,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/763\\\"\\u003eCodeforces Round 395 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-993A\":[\"Two Squares\",4038,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/993\\\"\\u003eCodeforces Round 488 by NEAR (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-630G\":[\"Challenge Pennants\",2812,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-1437D\":[\"Minimal Height Tree\",12796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1437\\\"\\u003eEducational Codeforces Round 97 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1861C\":[\"Queries for the Array\",9612,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1861\\\"\\u003eEducational Codeforces Round 154 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-649D\":[\"Дефрагментация памяти\",342,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/649\\\"\\u003eТехнокубок 2016 - Отборочный Раунд 2\\u003c/a\\u003e\"],\"CodeForces-601A\":[\"The Two Routes\",12769,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/601\\\"\\u003eCodeforces Round 333 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-637D\":[\"Running with Obstacles\",2014,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/637\\\"\\u003eVK Cup 2016 - Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-734C\":[\"Anton and Making Potions\",5568,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/734\\\"\\u003eCodeforces Round 379 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-746C\":[\"Tram\",4045,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/746\\\"\\u003eCodeforces Round 386 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-722C\":[\"Destroying Array\",9748,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/722\\\"\\u003eIntel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-940D\":[\"Alena And The Heater\",3832,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/940\\\"\\u003eCodeforces Round 466 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-952C\":[\"Ravioli Sort\",2930,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/952\\\"\\u003eApril Fools Contest 2018\\u003c/a\\u003e\"],\"CodeForces-1327C\":[\"Game with Chips\",13412,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1327\\\"\\u003eEducational Codeforces Round 84 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1787C\":[\"Remove the Bracket\",6757,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1787\\\"\\u003eTypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1775C\":[\"Interesting Sequence\",9716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1775\\\"\\u003eCodeforces Round 843 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1303C\":[\"Perfect Keyboard\",12310,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1303\\\"\\u003eEducational Codeforces Round 82 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1109A\":[\"Sasha and a Bit of Relax\",8484,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1109\\\"\\u003eCodeforces Round 539 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1188A1\":[\"Add on a Tree\",8297,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1188\\\"\\u003eCodeforces Round 572 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1133F1\":[\"Spanning Tree with Maximum Degree\",7643,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1133\\\"\\u003eCodeforces Round 544 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-407B\":[\"Long Path\",6843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/407\\\"\\u003eCodeforces Round 239 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-407A\":[\"Triangle\",4961,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/407\\\"\\u003eCodeforces Round 239 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-878A\":[\"Short Program\",5507,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/878\\\"\\u003eCodeforces Round 443 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-600A\":[\"Extract Numbers\",5275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/600\\\"\\u003eEducational Codeforces Round 2\\u003c/a\\u003e\"],\"CodeForces-733D\":[\"Kostya the Sculptor\",4409,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/733\\\"\\u003eCodeforces Round 378 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-830B\":[\"Cards Sorting\",2896,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/830\\\"\\u003eCodeforces Round 424 (Div. 1, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-1217B\":[\"Zmei Gorynich\",11562,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1217\\\"\\u003eEducational Codeforces Round 72 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1689C\":[\"Infected Tree\",10735,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1689\\\"\\u003eCodeforces Round 798 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1677A\":[\"Tokitsukaze and Strange Inequality\",8146,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1677\\\"\\u003eCodeforces Round 789 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1798D\":[\"Shocking Arrangement\",9058,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1798\\\"\\u003eCodeforces Round 860 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1665C\":[\"Tree Infection\",8484,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1665\\\"\\u003eCodeforces Round 781 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1423K\":[\"Lonely Numbers\",4944,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1423\\\"\\u003eBubble Cup 13 - Finals [Online Mirror, unrated, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-405C\":[\"Unusual Product\",4801,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/405\\\"\\u003eCodeforces Round 238 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1774D\":[\"Same Count One\",7455,\"\\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-768B\":[\"Code For 1\",6926,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/768\\\"\\u003eDivide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-986A\":[\"Fair\",6851,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/986\\\"\\u003eCodeforces Round 485 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-538C\":[\"Tourist\\u0027s Notes\",6044,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/538\\\"\\u003eCodeforces Round 300\\u003c/a\\u003e\"],\"CodeForces-877C\":[\"Slava and tanks\",6171,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-659E\":[\"New Reform\",7828,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/659\\\"\\u003eCodeforces Round 346 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-756B\":[\"Travel Card\",3438,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/756\\\"\\u003e8VC Venture Cup 2017 - Final Round\\u003c/a\\u003e\"],\"CodeForces-962D\":[\"Merge Equals\",7484,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/962\\\"\\u003eEducational Codeforces Round 42 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1797C\":[\"Li Hua and Chess\",7275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1797\\\"\\u003eCodeforces Round 864 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1567C\":[\"Carrying Conundrum\",12050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1567\\\"\\u003eCodeforces Round 742 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1349A\":[\"Orac and LCM\",16136,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1349\\\"\\u003eCodeforces Round 641 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1458A\":[\"Row GCD\",16545,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1458\\\"\\u003eCodeforces Round 691 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1374E1\":[\"Reading Books (easy version)\",13829,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1374\\\"\\u003eCodeforces Round 653 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-416C\":[\"Booking System\",7985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/416\\\"\\u003eCodeforces Round 241 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1555D\":[\"Say No to Palindromes\",11974,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1555\\\"\\u003eEducational Codeforces Round 112 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-429B\":[\"Working out\",9838,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/429\\\"\\u003eCodeforces Round 245 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-525C\":[\"Ilya and Sticks\",6108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/525\\\"\\u003eCodeforces Round 297 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-888D\":[\"Almost Identity Permutations\",8254,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-731C\":[\"Socks\",7763,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/731\\\"\\u003eCodeforces Round 376 (Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1711956344000,"title":"CodeForces rating 1600 题目集","dislikeCnt":0,"content":"[problem:CodeForces-431C] K-tree动态规划(dp) 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1398C] Good subarrays数据结构(data structures) 动态规划(dp), 数学(math\n[problem:CodeForces-371C] Hamburgers二分搜索(binary search) 暴力枚举(brute force\n[problem:CodeForces-1B] Spreadsheet实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-377A] Maze深度优先搜索及其变种(dfs and similar \n[problem:CodeForces-1526C2] Potions (hard version)数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-1352G] Special permutation构造算法(constructive algorithms \n[problem:CodeForces-1336A] Linova and kingdom深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1363C] Game on leaves博弈论(games) 树形结构(trees\n[problem:CodeForces-1353D] Constructing the array构造算法(constructive algorithms) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-1358C] Celex update数学(math \n[problem:CodeForces-235A] Lcm challenge数论(number theory \n[problem:CodeForces-1497C2] K-lcm (hard version)构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1334C] Circle of monsters暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1349A] Orac and lcm数据结构(data structures) 数学(math), 数论(number theory\n[problem:CodeForces-1458A] Row gcd数学(math) 数论(number theory\n[problem:CodeForces-1389B] Array walk暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-706C] Hard problem动态规划(dp) 字符串处理(strings\n[problem:CodeForces-1344A] Hilbert\u0027s hotel数学(math) 数论(number theory), 排序算法(sortings\n[problem:CodeForces-1165D] Almost all divisors数学(math) 数论(number theory\n[problem:CodeForces-510C] Fox and names深度优先搜索及其变种(dfs and similar) 图论(graphs), 排序算法(sortings\n[problem:CodeForces-1396A] Multiples of length构造算法(constructive algorithms) 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-1373D] Maximum sum on even positions分治算法(divide and conquer) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1519D] Maximum sum of products暴力枚举(brute force) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1348C] Phoenix and distribution构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-1514C] Product 1 modulo n贪心策略(greedy) 数论(number theory\n[problem:CodeForces-1234D] Distinct characters queries数据结构(data structures \n[problem:CodeForces-1528A] Parsa\u0027s humongous tree深度优先搜索及其变种(dfs and similar) 分治算法(divide and conquer), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1342C] Yet another counting problem数学(math) 数论(number theory\n[problem:CodeForces-1374E1] Reading books (easy version)数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1395C] Boboniu and bit operations位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1305C] Kuroni and impossible calculation暴力枚举(brute force) 组合数学(combinatorics), 数学(math), 数论(number theory\n[problem:CodeForces-1542C] Strange function数学(math) 数论(number theory\n[problem:CodeForces-1527C] Sequence pair weight哈希表(hashing) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1327C] Game with chips构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1513C] Add one动态规划(dp) 矩阵(matrices\n[problem:CodeForces-1603B] Moderate modular mode构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-1503A] Balance the bits构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-343B] Alternating current数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1633D] Make them equal动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1371D] Grid-00100构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1475E] Advertising agency组合数学(combinatorics) 数学(math), 排序算法(sortings\n[problem:CodeForces-1707A] Doremy\u0027s iq二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1364C] Ehab and prefix mexs暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-735D] Taxes数学(math) 数论(number theory\n[problem:CodeForces-348A] Mafia二分搜索(binary search) 数学(math), 排序算法(sortings\n[problem:CodeForces-1295C] Obtain the string动态规划(dp) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-372A] Counting kangaroos is fun二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1437D] Minimal height tree图论(graphs) 贪心策略(greedy), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-446A] Dzy loves sequences动态规划(dp) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1622C] Set or decrease二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1288C] Two arrays组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-1632C] Strange test二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 动态规划(dp), 数学(math\n[problem:CodeForces-1537E1] Erase and extend (easy version)二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp), 贪心策略(greedy), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 字符串后缀结构(string suffix structures), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1702E] Split into two sets深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1455D] Sequence and swaps动态规划(dp) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1753B] Factorial divisibility数学(math) 数论(number theory\n[problem:CodeForces-75C] Modified gcd二分搜索(binary search) 数论(number theory\n[problem:CodeForces-165C] Another problem on strings二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp), 数学(math), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1567C] Carrying conundrum位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-1303C] Perfect keyboard深度优先搜索及其变种(dfs and similar) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1779C] Least prefix sum数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-1730B] Meeting on the line二分搜索(binary search) 计算几何(geometry), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 三分搜索(ternary search\n[problem:CodeForces-1555D] Say no to palindromes暴力枚举(brute force) 构造算法(constructive algorithms), 动态规划(dp), 字符串处理(strings\n[problem:CodeForces-1251C] Minimize the integer贪心策略(greedy) 双指针算法(two pointers\n[problem:CodeForces-1486C1] Guessing the greatest (easy version)二分搜索(binary search) 交互性问题(interactive\n[problem:CodeForces-1593E] Gardener and tree暴力枚举(brute force) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-322B] Ciel and flowers组合数学(combinatorics) 数学(math\n[problem:CodeForces-1920C] Partitioning the array暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-601A] The two routes图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-1407C] Chocolate bunny构造算法(constructive algorithms) 交互性问题(interactive), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1481C] Fence painting暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-1539D] Pricefixed二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1294D] Mex maximizing数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1623C] Balanced stone heaps二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-1476C] Longest simple cycle动态规划(dp) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1213D2] Equalizing by division (hard version)暴力枚举(brute force) 数学(math), 排序算法(sortings\n[problem:CodeForces-1511D] Min cost string暴力枚举(brute force) 构造算法(constructive algorithms), 图论(graphs), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1217B] Zmei gorynich贪心策略(greedy) 数学(math\n[problem:CodeForces-1856C] To become max二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-1520F1] Guess the k-th zero (easy version)二分搜索(binary search) 交互性问题(interactive\n[problem:CodeForces-1843E] Tracking segments二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 双指针算法(two pointers\n[problem:CodeForces-1610C] Keshi is throwing a party二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-1151B] Dima and a bad xor位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 动态规划(dp\n[problem:CodeForces-1741E] Sending a sequence over the network动态规划(dp \n[problem:CodeForces-1469C] Building a fence动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1689C] Infected tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1748C] Zero-sum prefixes暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-559A] Gerald\u0027s hexagon暴力枚举(brute force) 计算几何(geometry), 数学(math\n[problem:CodeForces-1857F] Sum and product二分搜索(binary search) 数据结构(data structures), 数学(math\n[problem:CodeForces-1175B] Catch overflow!数据结构(data structures) 表达式解析(expression parsing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-763A] Timofey and a tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1582D] Vupsen Pupsen and 0构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-1833E] Round dance深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1512E] Permutation by sum暴力枚举(brute force) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1886C] Decreasing string实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-453A] Little pony and expected maximum概率论(probabilities \n[problem:CodeForces-1687A] The enchanted forest暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-1703G] Good key Bad key位掩码(bitmasks), 暴力枚举(brute force), 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1722E] Counting rectangles暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1282B2] K for the price of one (hard version)动态规划(dp) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1849C] Binary string copying二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1796C] Maximum set二分搜索(binary search) 数学(math\n[problem:CodeForces-1822E] Making anti-palindromes贪心策略(greedy) 数学(math), 字符串处理(strings\n[problem:CodeForces-1775C] Interesting sequence位掩码(bitmasks) 数学(math\n[problem:CodeForces-1321C] Remove adjacent暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1680C] Binary string二分搜索(binary search) 贪心策略(greedy), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1862E] Kolya and movie theatre构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1006E] Military problem深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-369C] Valera and elections深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-1861C] Queries for the array数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1196D2] Rgb substring (hard version)数据结构(data structures) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-607A] Chain reaction二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-1041C] Coffee break二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-246D] Colorful graph暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-1829G] Hits different数据结构(data structures) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1198B] Welfare state二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-1917C] Watering an array暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1498C] Planar reflections暴力枚举(brute force) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-1140C] Playlist暴力枚举(brute force) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-1482C] Basic diplomacy暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1607E] Robot on the board 1实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-660C] Hard process二分搜索(binary search) 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-518A] Vitaly and strings构造算法(constructive algorithms) 字符串处理(strings\n[problem:CodeForces-788A] Functions again动态规划(dp) 双指针算法(two pointers\n[problem:CodeForces-704A] Thor暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1036D] Vasya and arrays贪心策略(greedy) 双指针算法(two pointers\n[problem:CodeForces-570C] Replacement构造算法(constructive algorithms) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1530D] Secret santa构造算法(constructive algorithms) 流(flows), 图论(graphs), 贪心策略(greedy), 数学(math\n[problem:CodeForces-678C] Joty and chocolate实现问题,编程技巧,模拟(implementation) 数学(math), 数论(number theory\n[problem:CodeForces-780B] The meeting place cannot be changed二分搜索(binary search \n[problem:CodeForces-1771C] Hossam and trainees贪心策略(greedy) 数学(math), 数论(number theory\n[problem:CodeForces-1461D] Divide and summarize二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 分治算法(divide and conquer), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1798D] Shocking arrangement构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-780C] Andryusha and colored balloons深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1612D] X-magic pair数学(math) 数论(number theory\n[problem:CodeForces-722C] Destroying array数据结构(data structures) 并查集(dsu\n[problem:CodeForces-1658D1] 388535 (easy version)位掩码(bitmasks) 数学(math\n[problem:CodeForces-500B] New year permutation深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1198A] Mp3排序算法(sortings) 双指针算法(two pointers\n[problem:CodeForces-1921E] Eat the chip暴力枚举(brute force) 博弈论(games), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1225C] P-binary位掩码(bitmasks) 暴力枚举(brute force), 数学(math\n[problem:CodeForces-616D] Longest k-good segment二分搜索(binary search) 数据结构(data structures), 双指针算法(two pointers\n[problem:CodeForces-1523C] Compression and expansion暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1698D] Fixed point guessing二分搜索(binary search) 构造算法(constructive algorithms), 交互性问题(interactive\n[problem:CodeForces-343A] Rational resistance数学(math) 数论(number theory\n[problem:CodeForces-1714D] Color with occurrences暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1907E] Good triples暴力枚举(brute force) 组合数学(combinatorics), 数论(number theory\n[problem:CodeForces-346A] Alice and bob博弈论(games) 数学(math), 数论(number theory\n[problem:CodeForces-1203D1] Remove the substring (easy version)贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1098A] Sum in the tree构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1795D] Triangle coloring组合数学(combinatorics) 数学(math\n[problem:CodeForces-231C] To add or not to add二分搜索(binary search) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1290A] Mind control暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-429B] Working out动态规划(dp \n[problem:CodeForces-1109A] Sasha and a bit of relax动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1077D] Cutting out二分搜索(binary search) 排序算法(sortings\n[problem:CodeForces-1766D] Lucky chains数学(math) 数论(number theory\n[problem:CodeForces-1188A1] Add on a tree树形结构(trees \n[problem:CodeForces-1677A] Tokitsukaze and strange inequality暴力枚举(brute force) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-1151D] Stas and the queue at the buffet贪心策略(greedy) 数学(math), 排序算法(sortings\n[problem:CodeForces-1801A] The very beautiful blanket位掩码(bitmasks) 构造算法(constructive algorithms\n[problem:CodeForces-1615C] Menorah暴力枚举(brute force) 图论(graphs), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1281B] Azamon web services贪心策略(greedy \n[problem:CodeForces-1660D] Maximum product strikes back暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1665C] Tree infection二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1015D] Walking between houses构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1025B] Weakened common divisor暴力枚举(brute force) 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-1452D] Radio towers组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-913C] Party lemonade位掩码(bitmasks) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1566D2] Seating arrangements (hard version)数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1223C] Save the nature二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-1284C] New year and permutation组合数学(combinatorics) 数学(math\n[problem:CodeForces-1165E] Two arrays and sum of functions贪心策略(greedy) 数学(math), 排序算法(sortings\n[problem:CodeForces-835C] Star sky动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-416C] Booking system二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1946C] Tree cutting二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1778C] Flexible string位掩码(bitmasks) 暴力枚举(brute force), 字符串处理(strings\n[problem:CodeForces-603A] Alternative thinking动态规划(dp) 贪心策略(greedy), 数学(math\n[problem:CodeForces-888D] Almost identity permutations组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1065C] Make it equal贪心策略(greedy \n[problem:CodeForces-1003D] Coins and queries贪心策略(greedy \n[problem:CodeForces-1840E] Character blocking数据结构(data structures) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1082B] Vova and trophies贪心策略(greedy \n[problem:CodeForces-1941E] Rudolf and k bridges二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-1878D] Reverse madness数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-1774D] Same count one暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-735C] Tennis championship组合数学(combinatorics) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-659E] New reform数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1875D] Jellyfish and mex动态规划(dp \n[problem:CodeForces-1671D] Insert a progression暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-1095D] Circular dance实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1133F1] Spanning tree with maximum degree图论(graphs \n[problem:CodeForces-785C] Anton and fairy tale二分搜索(binary search) 数学(math\n[problem:CodeForces-923B] Producing snow二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-1797C] Li hua and chess构造算法(constructive algorithms) 贪心策略(greedy), 交互性问题(interactive\n[problem:CodeForces-1148B] Born this way二分搜索(binary search) 暴力枚举(brute force), 双指针算法(two pointers\n[problem:CodeForces-681C] Heap operations构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1806C] Sequence master暴力枚举(brute force) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-1238C] Standard free2play动态规划(dp) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1928C] Physical education lesson暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-939D] Love rescue深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1029C] Maximal intersection贪心策略(greedy) 数学(math), 排序算法(sortings\n[problem:CodeForces-605A] Sorting railway cars构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-682C] Alyona and the tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1059C] Sequence transformation构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-817C] Really big numbers二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp), 数学(math\n[problem:CodeForces-1811D] Umka and a long flight构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1781C] Equal frequencies暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-1660E] Matrix and shifts暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1163B2] Cat party (hard edition)数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1609D] Social network并查集(dsu) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1243B2] Character swap (hard version)字符串处理(strings \n[problem:CodeForces-922C] Cave painting暴力枚举(brute force) 数论(number theory\n[problem:CodeForces-723D] Lakes in berland深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-731C] Socks深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-493C] Vasya and basketball二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-962D] Merge equals数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1787C] Remove the bracket动态规划(dp) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1175C] Electrification二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy\n[problem:CodeForces-1027C] Minimum value rectangle贪心策略(greedy \n[problem:CodeForces-1096C] Polygon for the angle暴力枚举(brute force) 计算几何(geometry\n[problem:CodeForces-219C] Color stripe暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-986A] Fair图论(graphs) 贪心策略(greedy), 数论(number theory), 最短路算法(shortest paths\n[problem:CodeForces-750C] New year and rating二分搜索(binary search) 贪心策略(greedy), 数学(math\n[problem:CodeForces-283A] Cows and sequence构造算法(constructive algorithms) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1899F] Alex\u0027s whims构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1255C] League of leesins构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-350C] Bombs贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-495B] Modular equations数学(math) 数论(number theory\n[problem:CodeForces-407B] Long path动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-639B] Bear and forgotten tree 3构造算法(constructive algorithms) 图论(graphs), 树形结构(trees\n[problem:CodeForces-954D] Fight against traffic深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-777C] Alyona and spreadsheet二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-814C] An impassioned circulation of affection暴力枚举(brute force) 动态规划(dp), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1932E] Final countdown实现问题,编程技巧,模拟(implementation) 数学(math), 数论(number theory\n[problem:CodeForces-71C] Round table knights动态规划(dp) 数学(math), 数论(number theory\n[problem:CodeForces-1227D1] Optimal subsequences (easy version)数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-992B] Nastya studies informatics数学(math) 数论(number theory\n[problem:CodeForces-979C] Kuro and walking route深度优先搜索及其变种(dfs and similar) 树形结构(trees\n[problem:CodeForces-197A] Plate game构造算法(constructive algorithms) 博弈论(games), 数学(math\n[problem:CodeForces-1505B] Dmca 实现问题,编程技巧,模拟(implementation), 数论(number theory\n[problem:CodeForces-518C] Anya and smartphone构造算法(constructive algorithms) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1025C] Plasticine zebra构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1017C] The phone number构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-768B] Code for 1构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer\n[problem:CodeForces-538C] Tourist\u0027s notes二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-500C] New year book reading构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-525C] Ilya and sticks贪心策略(greedy) 数学(math), 排序算法(sortings\n[problem:CodeForces-1137B] Camp schedule贪心策略(greedy) 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-573B] Bear and blocks二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 数学(math\n[problem:CodeForces-1036B] Diagonal walking v.2数学(math \n[problem:CodeForces-1056D] Decorate apple tree构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-689B] Mike and shortcuts深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-877C] Slava and tanks构造算法(constructive algorithms \n[problem:CodeForces-715A] Plus and square root构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-237C] Primes on interval二分搜索(binary search) 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-712C] Memory and de-evolution贪心策略(greedy) 数学(math\n[problem:CodeForces-1082C] Multi-subject competition贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-1904D1] Set to max (easy version)暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-476C] Dreamoon and sums数学(math \n[problem:CodeForces-741A] Arpa\u0027s loud owf and mehrdad\u0027s evil plan深度优先搜索及其变种(dfs and similar) 数学(math\n[problem:CodeForces-1085C] Connect three实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-1033C] Permutation game暴力枚举(brute force) 动态规划(dp), 博弈论(games\n[problem:CodeForces-1062C] Banh-mi贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-734C] Anton and making potions二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-616C] The labyrinth深度优先搜索及其变种(dfs and similar \n[problem:CodeForces-878A] Short program位掩码(bitmasks) 构造算法(constructive algorithms\n[problem:CodeForces-383A] Milking cows数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-949A] Zebras贪心策略(greedy \n[problem:CodeForces-424C] Magic formulas数学(math \n[problem:CodeForces-741B] Arpa\u0027s weak amphitheater and mehrdad\u0027s valuable hoses深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu\n[problem:CodeForces-1031C] Cram time贪心策略(greedy \n[problem:CodeForces-812B] Sagheer The hausmeister位掩码(bitmasks), 暴力枚举(brute force), 动态规划(dp\n[problem:CodeForces-924B] Three-level laser二分搜索(binary search) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-848A] From y to y构造算法(constructive algorithms \n[problem:CodeForces-568A] Primes or palindromes?暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1468K] The robot暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-375B] Maximum submatrix 2数据结构(data structures) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-845B] Luba and the ticket暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-534C] Polycarpus\u0027 dice数学(math \n[problem:CodeForces-916C] Jamie and interesting graph构造算法(constructive algorithms) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-214B] Hometask暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-615B] Longtail hedgehog动态规划(dp) 图论(graphs\n[problem:CodeForces-600A] Extract numbers实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-34D] Road map深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1060C] Maximum subrectangle二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-337C] Quiz二分搜索(binary search) 贪心策略(greedy), 数学(math), 矩阵(matrices), 数论(number theory\n[problem:CodeForces-617C] Watering flowers实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-407A] Triangle暴力枚举(brute force) 计算几何(geometry), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-353C] Find maximum实现问题,编程技巧,模拟(implementation) 数学(math), 数论(number theory\n[problem:CodeForces-691B] S-palindrome实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-375A] Divisible by seven数学(math) 数论(number theory\n[problem:CodeForces-1423K] Lonely numbers二分搜索(binary search) 数学(math), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-935C] Fifa and fafa计算几何(geometry \n[problem:CodeForces-980B] Marlin构造算法(constructive algorithms \n[problem:CodeForces-597B] Restaurant动态规划(dp) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-364A] Matrix组合数学(combinatorics) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-305A] Strange addition暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-847B] Preparing for merge sort二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-405C] Unusual product实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-599C] Day at the beach排序算法(sortings \n[problem:CodeForces-939C] Convenient for everybody二分搜索(binary search) 双指针算法(two pointers\n[problem:CodeForces-317A] Perfect pair暴力枚举(brute force \n[problem:CodeForces-992C] Nastya and a wardrobe数学(math \n[problem:CodeForces-723C] Polycarp at the radio贪心策略(greedy \n[problem:CodeForces-131D] Subway深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-898E] Squares and not squares构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-822C] Hacker Pack your bags!二分搜索(binary search), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-597A] Divisibility数学(math \n[problem:CodeForces-508C] Anya and ghosts构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-28B] Psort深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-244B] Undoubtedly lucky numbers位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-825C] Multi-judge solving贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-832B] Petya and exam实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-793B] Igor and his way to work深度优先搜索及其变种(dfs and similar) 图论(graphs), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-1028C] Rectangles计算几何(geometry) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1137A] Skyscrapers实现问题,编程技巧,模拟(implementation) 排序算法(sortings\n[problem:CodeForces-626C] Block towers暴力枚举(brute force) 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-11B] Jumping jack数学(math \n[problem:CodeForces-154B] Colliders数学(math) 数论(number theory\n[problem:CodeForces-618C] Constellation计算几何(geometry) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-733D] Kostya the sculptor数据结构(data structures) 哈希表(hashing\n[problem:CodeForces-340C] Tourist problem组合数学(combinatorics) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-906A] Shockers实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-68B] Energy exchange二分搜索(binary search \n[problem:CodeForces-1056B] Divide candies数学(math) 数论(number theory\n[problem:CodeForces-825B] Five-in-a-row暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-231D] Magic box暴力枚举(brute force) 计算几何(geometry\n[problem:CodeForces-1045I] Palindrome pairs哈希表(hashing) 字符串处理(strings\n[problem:CodeForces-678B] The same calendar实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-154A] Hometask贪心策略(greedy \n[problem:CodeForces-932C] Permutation cycle暴力枚举(brute force) 构造算法(constructive algorithms\n[problem:CodeForces-593B] Anton and lines计算几何(geometry) 排序算法(sortings\n[problem:CodeForces-150B] Quantity of strings组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 数学(math\n[problem:CodeForces-333A] Secrets贪心策略(greedy \n[problem:CodeForces-837B] Flag of berland暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-993A] Two squares计算几何(geometry) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-243A] The brand new function位掩码(bitmasks \n[problem:CodeForces-260B] Ancient prophesy暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-858D] Polycarp\u0027s phone book数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-746C] Tram构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1252C] Even path数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-898D] Alarm clock贪心策略(greedy \n[problem:CodeForces-940D] Alena and the heater二分搜索(binary search) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-849B] Tell your world暴力枚举(brute force) 计算几何(geometry\n[problem:CodeForces-269A] Magical boxes贪心策略(greedy) 数学(math\n[problem:CodeForces-297B] Fish weight构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-925A] Stairs and elevators二分搜索(binary search \n[problem:CodeForces-444A] Dzy loves physics贪心策略(greedy) 数学(math\n[problem:CodeForces-756B] Travel card二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-107B] Basketball team组合数学(combinatorics) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-873C] Strange game on matrix贪心策略(greedy) 双指针算法(two pointers\n[problem:CodeForces-23B] Party构造算法(constructive algorithms) 图论(graphs), 数学(math\n[problem:CodeForces-643B] Bear and two paths构造算法(constructive algorithms) 图论(graphs\n[problem:CodeForces-645C] Enduring exodus二分搜索(binary search) 双指针算法(two pointers\n[problem:CodeForces-225B] Well-known numbers二分搜索(binary search) 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-818B] Permutation game实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-595B] Pasha and phone二分搜索(binary search) 数学(math\n[problem:CodeForces-665A] Buses between cities实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-952C] Ravioli sort实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-319A] Malek dance club组合数学(combinatorics) 数学(math\n[problem:CodeForces-830B] Cards sorting数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-606B] Testing robots实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-380A] Sereja and prefixes二分搜索(binary search) 暴力枚举(brute force\n[problem:CodeForces-630G] Challenge pennants组合数学(combinatorics) 数学(math\n[problem:CodeForces-246C] Beauty pageant暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-55B] Smallest number暴力枚举(brute force \n[problem:CodeForces-930B] Game with string实现问题,编程技巧,模拟(implementation) 概率论(probabilities), 字符串处理(strings\n[problem:CodeForces-725C] Hidden word暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-272D] Dima and two sequences组合数学(combinatorics) 数学(math), 排序算法(sortings\n[problem:CodeForces-142A] Help farmer暴力枚举(brute force) 数学(math\n[problem:CodeForces-435C] Cardiogram实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-253C] Text editor数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1184D1] Parallel universes (easy)实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-373B] Making sequences is fun二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-232A] Cycles二分搜索(binary search) 构造算法(constructive algorithms), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-305C] Ivan and powers of two贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-847H] Load testing贪心策略(greedy \n[problem:CodeForces-138A] Literature lesson实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-7B] Memory manager实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-135B] Rectangle and square暴力枚举(brute force) 计算几何(geometry), 数学(math\n[problem:CodeForces-1184C1] Heidi and the turing test (easy)实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-523D] Statistics of recompressing videos 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-209A] Multicolored marbles动态规划(dp) 数学(math\n[problem:CodeForces-113A] Grammar lessons实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-430A] Points and segments (easy)构造算法(constructive algorithms) 排序算法(sortings\n[problem:CodeForces-46C] Hamsters and tigers双指针算法(two pointers \n[problem:CodeForces-149B] Martian clock实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-156B] Suspects构造算法(constructive algorithms) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-730G] Car repair shop实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-314A] Sereja and contest实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-167A] Wizards and trolleybuses实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-59C] Title表达式解析(expression parsing \n[problem:CodeForces-727B] Bill total value表达式解析(expression parsing) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-52B] Right triangles组合数学(combinatorics \n[problem:CodeForces-637D] Running with obstacles 数据结构(data structures), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1121C] System testing实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-440B] Balancer贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-250C] Movie critics贪心策略(greedy \n[problem:CodeForces-70B] Text messaging表达式解析(expression parsing) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1938H] Pho restauran \n[problem:CodeForces-910B] Door frames贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-291C] Network mask 位掩码(bitmasks), 暴力枚举(brute force), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-95A] Hockey实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-316B2] Ekg深度优先搜索及其变种(dfs and similar) 动态规划(dp\n[problem:CodeForces-234D] Cinema实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-958E1] Guard duty (easy)暴力枚举(brute force) 计算几何(geometry), 贪心策略(greedy), 数学(math\n[problem:CodeForces-291D] Parallel programming 贪心策略(greedy\n[problem:CodeForces-234G] Practice构造算法(constructive algorithms) 分治算法(divide and conquer), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-36B] Fractal实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-524A] Возможно Вы знаете этих людей?实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-856A] Set theory暴力枚举(brute force) 构造算法(constructive algorithms\n[problem:CodeForces-86A] Reflection数学(math \n[problem:CodeForces-73A] The elder trolls iv: oblivon贪心策略(greedy) 数学(math\n[problem:CodeForces-175C] Geometry horse贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-139B] Wallpaper实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-411B] Multi-core processor实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-774K] Stepan and vowels 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-32D] Constellation实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-171F] Ucyhf 暴力枚举(brute force), 实现问题,编程技巧,模拟(implementation), 数论(number theory\n[problem:CodeForces-753B] Interactive bulls and cows (easy)暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-40B] Repaintings数学(math \n[problem:CodeForces-57B] Martian architecture实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-234E] Champions\u0027 league实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-125C] Hobbits\u0027 party构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-926D] Choose plac \n[problem:CodeForces-171G] Mysterious numbers - 2 \n[problem:CodeForces-28A] Bender problem实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-153A] A + b \n[problem:CodeForces-178B1] Greedy merchant \n[problem:CodeForces-323A] Black-and-white cube组合数学(combinatorics) 构造算法(constructive algorithms\n[problem:CodeForces-1431C] Black friday 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-178B2] Greedy merchant \n[problem:CodeForces-1346C] Spring cleaning 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1910B] Security guard 贪心策略(greedy\n[problem:CodeForces-1001E] Distinguish bell states \n[problem:CodeForces-1910C] Poisonous swamp , 实现问题,编程技巧,模拟(implementation), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-530B] String inside out \n[problem:CodeForces-1346D] Constructing the dungeon 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-130H] Balanced brackets \n[problem:CodeForces-178C1] Smart beaver and resolving collision \n[problem:CodeForces-530D] Set subtraction \n[problem:CodeForces-1002B2] Distinguish ghz state and w stat \n[problem:CodeForces-1002B3] Distinguish four 2-qubit state \n[problem:CodeForces-649D] Дефрагментация памяти构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-64C] Table 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1002D3] Oracle for majority functio \n[problem:CodeForces-188G] Array sorting 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-683B] The teacher of physical education \n[problem:CodeForces-683C] Symmetric difference \n[problem:CodeForces-1115G2] Or oracle \n[problem:CodeForces-130E] Tribonacci numbers \n[problem:CodeForces-130F] Prime factorization \n[problem:CodeForces-207A1] Beaver\u0027s calculator 1.0贪心策略(greedy \n[problem:CodeForces-100E] Lamps in a line 数学(math\n[problem:CodeForces-72H] Reverse it! 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-207B1] Military 训 \n[problem:CodeForces-1115U2] Chessboard unitary \n[problem:CodeForces-1115G3] Palindrome checker oracle \n[problem:CodeForces-207D5] The beaver\u0027s problem - \n[problem:CodeForces-207D7] The beaver\u0027s problem - \n","threadId":188455,"likeCnt":3,"createTime":1711948041000,"isWorkbook":true,"viewCnt":542,"openness":2,"fav":false,"id":4787,"trustable":false}