Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-1841B\":[\"Keep it Beautiful\",20702,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1841\\\"\\u003eEducational Codeforces Round 150 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1732A\":[\"Bestie\",14687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1732\\\"\\u003eCodeforces Round 830 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1611C\":[\"Polycarp Recovers the Permutation\",18198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1611\\\"\\u003eCodeforces Round 756 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1744C\":[\"Traffic Light\",24778,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1744\\\"\\u003eCodeforces Round 828 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-56A\":[\"Bar\",8842,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/56\\\"\\u003eCodeforces Beta Round 52 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1659A\":[\"Red Versus Blue\",17180,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1659\\\"\\u003eCodeforces Round 782 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1405B\":[\"Array Cancellation\",21505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1405\\\"\\u003eCodeforces Round 668 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1691B\":[\"Shoe Shuffling\",21391,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1691\\\"\\u003eCodeCraft-22 and Codeforces Round 795 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-322A\":[\"Ciel and Dancing\",8853,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/322\\\"\\u003eCodeforces Round 190 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-334A\":[\"Candy Bags\",19400,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/334\\\"\\u003eCodeforces Round 194 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-237A\":[\"Free Cash\",26951,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/237\\\"\\u003eCodeforces Round 147 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-727A\":[\"Transformation: from A to B\",15139,\"\\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-1388B\":[\"Captain Flint and a Long Voyage\",22380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1388\\\"\\u003eCodeforces Round 660 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1485A\":[\"Add and Divide\",21395,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1485\\\"\\u003eCodeforces Round 701 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1473B\":[\"String LCM\",31431,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1473\\\"\\u003eEducational Codeforces Round 102 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-920A\":[\"Water The Garden\",8413,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-479A\":[\"Expression\",93766,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/479\\\"\\u003eCodeforces Round 274 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-552A\":[\"Vanya and Table\",10048,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/552\\\"\\u003eCodeforces Round 308 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1539A\":[\"Contest Start\",19983,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1539\\\"\\u003eCodeforces Round 727 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-847M\":[\"Weather Tomorrow\",6644,\"\\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-1418A\":[\"Buying Torches\",21587,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1418\\\"\\u003eEducational Codeforces Round 95 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1907B\":[\"YetnotherrokenKeoard\",23269,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1907\\\"\\u003eCodeforces Round 913 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1622B\":[\"Berland Music\",20696,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1622\\\"\\u003eEducational Codeforces Round 120 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1634C\":[\"OKEA\",18142,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1634\\\"\\u003eCodeforces Round 770 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-195A\":[\"Let\\u0027s Watch Football\",9201,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/195\\\"\\u003eCodeforces Round 123 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1278A\":[\"Shuffle Hashing\",16414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1278\\\"\\u003eEducational Codeforces Round 78 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1036A\":[\"Function Height\",10584,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1036\\\"\\u003eEducational Codeforces Round 50 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1876A\":[\"Helmets in Night Light\",14933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1876\\\"\\u003eCodeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round)\\u003c/a\\u003e\"],\"CodeForces-1593C\":[\"Save More Mice\",25010,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1593\\\"\\u003eCodeforces Round 748 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-127B\":[\"Canvas Frames\",8974,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/127\\\"\\u003eCodeforces Beta Round 93 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1133A\":[\"Middle of the Contest\",18302,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1133\\\"\\u003eCodeforces Round 544 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1266B\":[\"Dice Tower\",15000,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1266\\\"\\u003eCodeforces Global Round 6\\u003c/a\\u003e\"],\"CodeForces-69A\":[\"Young Physicist\",162243,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/69\\\"\\u003eCodeforces Beta Round 63 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-357A\":[\"Group of Students\",7137,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/357\\\"\\u003eCodeforces Round 207 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1266A\":[\"Competitive Programmer\",15428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1266\\\"\\u003eCodeforces Global Round 6\\u003c/a\\u003e\"],\"CodeForces-139A\":[\"Petr and Book\",30496,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/139\\\"\\u003eCodeforces Beta Round 99 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1840C\":[\"Ski Resort\",25200,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1840\\\"\\u003eCodeforces Round 878 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-859B\":[\"Lazy Security Guard\",7410,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/859\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1230B\":[\"Ania and Minimizing\",19107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1230\\\"\\u003eCodeforces Round 588 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-967B\":[\"Watering System\",7261,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/967\\\"\\u003eCodeforces Round 477 (rated, Div. 2, based on VK Cup 2018 Round 3)\\u003c/a\\u003e\"],\"CodeForces-822B\":[\"Crossword solving\",10227,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/822\\\"\\u003eCodeforces Round 422 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1690D\":[\"Black and White Stripe\",28769,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1690\\\"\\u003eCodeforces Round 797 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-672B\":[\"Different is Good\",18238,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/672\\\"\\u003eCodeforces Round 352 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-660B\":[\"Seating On Bus\",5745,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/660\\\"\\u003eEducational Codeforces Round 11\\u003c/a\\u003e\"],\"CodeForces-1809B\":[\"Points on Plane\",19213,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1809\\\"\\u003eEducational Codeforces Round 145 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1906A\":[\"Easy As ABC\",3587,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-182B\":[\"Vasya\\u0027s Calendar\",7092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/182\\\"\\u003eCodeforces Round 117 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1766B\":[\"Notepad#\",20740,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1766\\\"\\u003eEducational Codeforces Round 139 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1059A\":[\"Cashier\",12973,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1059\\\"\\u003eCodeforces Round 514 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-441A\":[\"Valera and Antique Items\",18838,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/441\\\"\\u003eCodeforces Round 252 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1023B\":[\"Pair of Toys\",11106,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1023\\\"\\u003eCodeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)\\u003c/a\\u003e\"],\"CodeForces-1144C\":[\"Two Shuffled Sequences\",15648,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1144\\\"\\u003eCodeforces Round 550 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1374C\":[\"Move Brackets\",45860,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1374\\\"\\u003eCodeforces Round 653 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-102B\":[\"Sum of Digits\",27434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/102\\\"\\u003eCodeforces Beta Round 79 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1253A\":[\"Single Push\",20134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1253\\\"\\u003eCodeforces Round 600 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1265A\":[\"Beautiful String\",15385,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1265\\\"\\u003eCodeforces Round 604 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-114A\":[\"Cifera\",14453,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/114\\\"\\u003eCodeforces Beta Round 86 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-368A\":[\"Sereja and Coat Rack\",7838,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/368\\\"\\u003eCodeforces Round 215 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1277A\":[\"Happy Birthday, Polycarp!\",13886,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1277\\\"\\u003eCodeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-259A\":[\"Little Elephant and Chess\",9589,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/259\\\"\\u003eCodeforces Round 157 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-979A\":[\"Pizza, Pizza, Pizza!!!\",14982,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/979\\\"\\u003eCodeforces Round 482 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-507A\":[\"Amr and Music\",18632,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/507\\\"\\u003eCodeforces Round 287 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-628A\":[\"Tennis Tournament\",6618,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/628\\\"\\u003eEducational Codeforces Round 8\\u003c/a\\u003e\"],\"CodeForces-725A\":[\"Jumping Ball\",7472,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/725\\\"\\u003eCanada Cup 2016\\u003c/a\\u003e\"],\"CodeForces-1851C\":[\"Tiles Comeback\",22385,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1851\\\"\\u003eCodeforces Round 888 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-604A\":[\"Uncowed Forces\",9606,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/604\\\"\\u003eCodeforces Round 334 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-616B\":[\"Dinner with Emma\",12151,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/616\\\"\\u003eEducational Codeforces Round 5\\u003c/a\\u003e\"],\"CodeForces-1362A\":[\"Johnny and Ancient Computer\",23121,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1362\\\"\\u003eCodeforces Round 647 (Div. 2) - Thanks, Algo Muse!\\u003c/a\\u003e\"],\"CodeForces-724A\":[\"Checking the Calendar\",7724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/724\\\"\\u003eIntel Code Challenge Final Round (Div. 1 + Div. 2, Combined)\\u003c/a\\u003e\"],\"CodeForces-978C\":[\"Letters\",27175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/978\\\"\\u003eCodeforces Round 481 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-465B\":[\"Inbox (100500)\",10934,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/465\\\"\\u003eCodeforces Round 265 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1620B\":[\"Triangles on a Rectangle\",19818,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1620\\\"\\u003eEducational Codeforces Round 119 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1632B\":[\"Roof Construction\",21014,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1632\\\"\\u003eCodeforces Round 769 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1438B\":[\"Valerii Against Everyone\",18684,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1438\\\"\\u003eCodeforces Round 682 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-43A\":[\"Football\",54705,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/43\\\"\\u003eCodeforces Beta Round 42 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-452A\":[\"Eevee\",8345,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/452\\\"\\u003eMemSQL Start[c]UP 2.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-125B\":[\"Simple XML\",3076,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/125\\\"\\u003eCodeforces Testing Round 2\\u003c/a\\u003e\"],\"CodeForces-234B\":[\"Reading\",7384,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/234\\\"\\u003eCodeforces Round 145 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1252A\":[\"Copying Homework\",6040,\"\\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-1155A\":[\"Reverse a Substring\",14554,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1155\\\"\\u003eEducational Codeforces Round 63 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-137B\":[\"Permutation\",14474,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/137\\\"\\u003eCodeforces Beta Round 98 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-379A\":[\"New Year Candles\",47072,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/379\\\"\\u003eGood Bye 2013\\u003c/a\\u003e\"],\"CodeForces-1765E\":[\"Exchange\",9777,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"CodeForces-1373A\":[\"Donut Shops\",26383,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1373\\\"\\u003eEducational Codeforces Round 90 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-844A\":[\"Diversity\",11242,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/844\\\"\\u003eAIM Tech Round 4 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-476A\":[\"Dreamoon and Stairs\",42971,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/476\\\"\\u003eCodeforces Round 272 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1765M\":[\"Minimum LCM\",13531,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"CodeForces-1916B\":[\"Two Divisors\",24019,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1916\\\"\\u003eGood Bye 2023\\u003c/a\\u003e\"],\"CodeForces-670B\":[\"Game of Robots\",11986,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/670\\\"\\u003eCodeforces Round 350 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1090M\":[\"The Pleasant Walk\",6313,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1090\\\"\\u003e2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1598B\":[\"Groups\",16016,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1598\\\"\\u003eEducational Codeforces Round 115 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1930B\":[\"Permutation Printing\",13544,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1930\\\"\\u003ethink-cell Round 1\\u003c/a\\u003e\"],\"CodeForces-1506C\":[\"Double-ended Strings\",24106,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1506\\\"\\u003eCodeforces Round 710 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1211A\":[\"Three Problems\",1259,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1211\\\"\\u003eKotlin Heroes: Episode 2\\u003c/a\\u003e\"],\"CodeForces-1223B\":[\"Strings Equalization\",14985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1223\\\"\\u003eTechnocup 2020 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-435A\":[\"Queue on Bus Stop\",10698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/435\\\"\\u003eCodeforces Round 249 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-447B\":[\"DZY Loves Strings\",20903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/447\\\"\\u003eCodeforces Round #FF (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-804A\":[\"Find Amir\",16426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/804\\\"\\u003eCodeforces Round 411 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1073B\":[\"Vasya and Books\",11123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1073\\\"\\u003eEducational Codeforces Round 53 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1182A\":[\"Filling Shapes\",30444,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1182\\\"\\u003eCodeforces Round 566 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1695B\":[\"Circle Game\",18173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1695\\\"\\u003eCodeforces Round 801 (Div. 2) and EPIC Institute of Technology Round\\u003c/a\\u003e\"],\"CodeForces-816A\":[\"Karen and Morning\",9803,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/816\\\"\\u003eCodeforces Round 419 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1073A\":[\"Diverse Substring\",16148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1073\\\"\\u003eEducational Codeforces Round 53 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-108A\":[\"Palindromic Times\",10102,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/108\\\"\\u003eCodeforces Beta Round 83 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1550B\":[\"Maximum Cost Deletion\",26735,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1550\\\"\\u003eEducational Codeforces Round 111 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1671B\":[\"Consecutive Points Segment\",18336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1671\\\"\\u003eEducational Codeforces Round 127 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1562B\":[\"Scenes From a Memory\",19457,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1562\\\"\\u003eCodeforces Round 741 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-109A\":[\"Lucky Sum of Digits\",17434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/109\\\"\\u003eCodeforces Beta Round 84 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-798A\":[\"Mike and palindrome\",23697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/798\\\"\\u003eCodeforces Round 410 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-641A\":[\"Little Artem and Grasshopper\",6035,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/641\\\"\\u003eVK Cup 2016 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1A\":[\"Theatre Square\",268048,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1\\\"\\u003eCodeforces Beta Round 1\\u003c/a\\u003e\"],\"CodeForces-491A\":[\"Up the hill\",2998,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/491\\\"\\u003eTesting Round 11\\u003c/a\\u003e\"],\"CodeForces-1941B\":[\"Rudolf and 121\",26196,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1941\\\"\\u003eCodeforces Round 933 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-272A\":[\"Dima and Friends\",24064,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/272\\\"\\u003eCodeforces Round 167 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-284B\":[\"Cows and Poker Game\",7030,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/284\\\"\\u003eCodeforces Round 174 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1476A\":[\"K-divisible Sum\",36127,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1476\\\"\\u003eEducational Codeforces Round 103 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1844B\":[\"Permutations \\u0026 Primes\",17691,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1844\\\"\\u003eCodeforces Round 884 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1614B\":[\"Divan and a New Project\",18005,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1614\\\"\\u003eCodeforces Round 757 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-37A\":[\"Towers\",25833,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/37\\\"\\u003eCodeforces Beta Round 37\\u003c/a\\u003e\"],\"CodeForces-1791D\":[\"Distinct Split\",27299,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1791\\\"\\u003eCodeforces Round 849 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-13A\":[\"Numbers\",8482,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/13\\\"\\u003eCodeforces Beta Round 13\\u003c/a\\u003e\"],\"CodeForces-1101A\":[\"Minimum Integer\",17758,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1101\\\"\\u003eEducational Codeforces Round 58 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1084A\":[\"The Fair Nut and Elevator\",8481,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1084\\\"\\u003eCodeforces Round 526 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-579A\":[\"Raising Bacteria\",60994,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/579\\\"\\u003eCodeforces Round 320 (Div. 2) [Bayan Thanks-Round]\\u003c/a\\u003e\"],\"CodeForces-1181A\":[\"Chunga-Changa\",13560,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1181\\\"\\u003eCodeforces Round 567 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-688B\":[\"Lovely Palindromes\",32038,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/688\\\"\\u003eCodeforces Round 360 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-761A\":[\"Dasha and Stairs\",15713,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/761\\\"\\u003eCodeforces Round 394 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-652B\":[\"z-sort\",11532,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/652\\\"\\u003eEducational Codeforces Round 10\\u003c/a\\u003e\"],\"CodeForces-991A\":[\"If at first you don\\u0027t succeed...\",10993,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/991\\\"\\u003eCodeforces Round 491 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1499B\":[\"Binary Removals\",20667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1499\\\"\\u003eEducational Codeforces Round 106 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1831B\":[\"Array merging\",18537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1831\\\"\\u003eCodeforces Round 875 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1136B\":[\"Nastya Is Playing Computer Games\",11977,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1136\\\"\\u003eCodeforces Round 546 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1245A\":[\"Good ol\\u0027 Numbers Coloring\",14476,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1245\\\"\\u003eCodeforces Round 597 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1257B\":[\"Magic Stick\",20588,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1257\\\"\\u003eEducational Codeforces Round 76 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1613B\":[\"Absent Remainder\",21583,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1613\\\"\\u003eEducational Codeforces Round 118 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1027A\":[\"Palindromic Twist\",16381,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1027\\\"\\u003eEducational Codeforces Round 49 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1790C\":[\"Premutation\",23220,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1790\\\"\\u003eCodeforces Round 847 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1100A\":[\"Roman and Browser\",10533,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1100\\\"\\u003eCodeforces Round 532 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1221A\":[\"2048 Game\",17902,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1221\\\"\\u003eEducational Codeforces Round 73 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-58A\":[\"Chat room\",128861,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/58\\\"\\u003eCodeforces Beta Round 54 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-608A\":[\"Saitama Destroys Hotel\",10282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/608\\\"\\u003eCodeforces Round 336 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-106A\":[\"Card Game\",7767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/106\\\"\\u003eCodeforces Beta Round 82 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-118B\":[\"Present from Lena\",29617,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-336A\":[\"Vasily the Bear and Triangle\",10543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/336\\\"\\u003eCodeforces Round 195 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-106B\":[\"Choosing Laptop\",6388,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/106\\\"\\u003eCodeforces Beta Round 82 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1342A\":[\"Road To Zero\",39382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1342\\\"\\u003eEducational Codeforces Round 86 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-118A\":[\"String Task\",191861,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1584B\":[\"Coloring Rectangles\",13176,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1584\\\"\\u003eTechnocup 2022 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-3A\":[\"Shortest path of the king\",20693,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/3\\\"\\u003eCodeforces Beta Round 3\\u003c/a\\u003e\"],\"CodeForces-699A\":[\"Launch of Collider\",17556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/699\\\"\\u003eCodeforces Round 363 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-893B\":[\"Beautiful Divisors\",11770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-990A\":[\"Commentary Boxes\",10851,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/990\\\"\\u003eEducational Codeforces Round 45 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-90A\":[\"Cableway\",4824,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/90\\\"\\u003eCodeforces Beta Round 74 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1721B\":[\"Deadly Laser\",22273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1721\\\"\\u003eEducational Codeforces Round 134 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1256A\":[\"Payment Without Change\",29672,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1256\\\"\\u003eCodeforces Round 598 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1515B\":[\"Phoenix and Puzzle\",24415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1515\\\"\\u003eCodeforces Global Round 14\\u003c/a\\u003e\"],\"CodeForces-420A\":[\"Start Up\",6336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/420\\\"\\u003eCoder-Strike 2014 - Finals (online edition, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1450B\":[\"Balls of Steel\",15121,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1450\\\"\\u003eCodeforces Global Round 12\\u003c/a\\u003e\"],\"CodeForces-35A\":[\"Shell Game\",7049,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/35\\\"\\u003eCodeforces Beta Round 35 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1111A\":[\"Superhero Transformation\",17586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1111\\\"\\u003eCodeCraft-19 and Codeforces Round 537 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1244B\":[\"Rooms and Staircases\",15918,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1244\\\"\\u003eCodeforces Round 592 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-359A\":[\"Table\",8721,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/359\\\"\\u003eCodeforces Round 209 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-849A\":[\"Odds and Ends\",9493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/849\\\"\\u003eCodeforces Round 431 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1474B\":[\"Different Divisors\",27634,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1474\\\"\\u003eCodeforces Round 696 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1353C\":[\"Board Moves\",35372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1353\\\"\\u003eCodeforces Round 642 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-577A\":[\"Multiplication Table\",40133,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/577\\\"\\u003eCodeforces Round 319 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1469B\":[\"Red and Blue\",26710,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1469\\\"\\u003eEducational Codeforces Round 101 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1784A\":[\"Monsters (easy version)\",14589,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1784\\\"\\u003eVK Cup 2022 - Финальный раунд (Engine)\\u003c/a\\u003e\"],\"CodeForces-1796B\":[\"Asterisk-Minor Template\",16188,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1796\\\"\\u003eEducational Codeforces Round 144 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1566C\":[\"MAX-MEX Cut\",17285,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1566\\\"\\u003eCodeforces Global Round 16\\u003c/a\\u003e\"],\"CodeForces-1312B\":[\"Bogosort\",25814,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1312\\\"\\u003eEducational Codeforces Round 83 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-120A\":[\"Elevator\",4657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-265B\":[\"Roadside Trees (Simplified Edition)\",17573,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/265\\\"\\u003eCodeforces Round 162 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1203A\":[\"Circle of Students\",17067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1203\\\"\\u003eCodeforces Round 579 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1704B\":[\"Luke is a Foodie\",16534,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1704\\\"\\u003eCodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1825B\":[\"LuoTianyi and the Table\",14233,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1825\\\"\\u003eCodeforces Round 872 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1837C\":[\"Best Binary String\",21259,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1837\\\"\\u003eEducational Codeforces Round 149 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1215A\":[\"Yellow Cards\",12177,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1215\\\"\\u003eCodeforces Round 585 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1469A\":[\"Regular Bracket Sequence\",27763,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1469\\\"\\u003eEducational Codeforces Round 101 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1077B\":[\"Disturbed People\",20660,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1077\\\"\\u003eCodeforces Round 521 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1760D\":[\"Challenging Valleys\",23231,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1760\\\"\\u003eCodeforces Round 835 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1041B\":[\"Buying a TV Set\",14446,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1041\\\"\\u003eCodeforces Round 509 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1300B\":[\"Assigning to Classes\",23216,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1300\\\"\\u003eCodeforces Round 618 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1772C\":[\"Different Differences\",23016,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1772\\\"\\u003eCodeforces Round 839 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1174A\":[\"Ehab Fails to Be Thanos\",18856,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1174\\\"\\u003eCodeforces Round 563 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-5A\":[\"Chat Servers Outgoing Traffic\",10245,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/5\\\"\\u003eCodeforces Beta Round 5\\u003c/a\\u003e\"],\"CodeForces-766B\":[\"Mahmoud and a Triangle\",34425,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/766\\\"\\u003eCodeforces Round 396 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-766A\":[\"Mahmoud and Longest Uncommon Subsequence\",30732,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/766\\\"\\u003eCodeforces Round 396 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-887A\":[\"Div. 64\",12198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/887\\\"\\u003eCodeforces Round 444 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-500A\":[\"New Year Transportation\",54298,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/500\\\"\\u003eGood Bye 2014\\u003c/a\\u003e\"],\"CodeForces-742A\":[\"Arpa’s hard exam and Mehrdad’s naive cheat\",42524,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/742\\\"\\u003eCodeforces Round 383 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-72G\":[\"Fibonacci army\",1984,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/72\\\"\\u003eUnknown Language Round 2\\u003c/a\\u003e\"],\"CodeForces-1359B\":[\"New Theatre Square\",27680,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1359\\\"\\u003eEducational Codeforces Round 88 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1008B\":[\"Turn the Rectangles\",11956,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1008\\\"\\u003eCodeforces Round 497 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-131A\":[\"cAPS lOCK\",86610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/131\\\"\\u003eCodeforces Beta Round 95 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1800B\":[\"Count the Number of Pairs\",24743,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1800\\\"\\u003eCodeforces Round 855 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-385A\":[\"Bear and Raspberry\",17206,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/385\\\"\\u003eCodeforces Round 226 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1715B\":[\"Beautiful Array\",20280,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1715\\\"\\u003eCodeforces Round 816 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-143A\":[\"Help Vasilisa the Wise 2\",13875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/143\\\"\\u003eCodeforces Round 102 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1117B\":[\"Emotes\",14586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1117\\\"\\u003eEducational Codeforces Round 60 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1359A\":[\"Berland Poker\",29314,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1359\\\"\\u003eEducational Codeforces Round 88 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1088B\":[\"Ehab and subtraction\",13355,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1088\\\"\\u003eCodeforces Round 525 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1040A\":[\"Palindrome Dance\",9706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1040\\\"\\u003eCodeforces Round 507 (Div. 2, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-1674C\":[\"Infinite Replacement\",23557,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1674\\\"\\u003eCodeforces Round 786 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-17A\":[\"Noldbach problem\",18451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/17\\\"\\u003eCodeforces Beta Round 17\\u003c/a\\u003e\"],\"CodeForces-29A\":[\"Spit Problem\",7648,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/29\\\"\\u003eCodeforces Beta Round 29 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1197B\":[\"Pillars\",14020,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1197\\\"\\u003eEducational Codeforces Round 69 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-535A\":[\"Tavas and Nafas\",13122,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/535\\\"\\u003eCodeforces Round 299 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-886A\":[\"ACM ICPC\",10986,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/886\\\"\\u003eТехнокубок 2018 - Отборочный Раунд 3\\u003c/a\\u003e\"],\"CodeForces-644A\":[\"Parliament of Berland\",4430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/644\\\"\\u003eCROC 2016 - Qualification\\u003c/a\\u003e\"],\"CodeForces-777A\":[\"Shell Game\",11080,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-862A\":[\"Mahmoud and Ehab and the MEX\",10408,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/862\\\"\\u003eCodeforces Round 435 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-753A\":[\"Santa Claus and Candies\",9239,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/753\\\"\\u003eTesting Round 13\\u003c/a\\u003e\"],\"CodeForces-886B\":[\"Vlad and Cafes\",7991,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/886\\\"\\u003eТехнокубок 2018 - Отборочный Раунд 3\\u003c/a\\u003e\"],\"CodeForces-620B\":[\"Grandfather Dovlet’s calculator\",9880,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/620\\\"\\u003eEducational Codeforces Round 6\\u003c/a\\u003e\"],\"CodeForces-1849B\":[\"Monsters\",22906,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1849\\\"\\u003eEducational Codeforces Round 152 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1607C\":[\"Minimum Extraction\",24881,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1607\\\"\\u003eCodeforces Round 753 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1358B\":[\"Maria Breaks the Self-isolation\",25440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1358\\\"\\u003eCodeforces Round 645 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1346A\":[\"Color Revolution\",1941,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1346\\\"\\u003eKotlin Heroes: Episode 4\\u003c/a\\u003e\"],\"CodeForces-1702D\":[\"Not a Cheap String\",23348,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1702\\\"\\u003eCodeforces Round 805 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1605B\":[\"Reverse Sort\",17960,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1605\\\"\\u003eCodeforces Round 754 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1811B\":[\"Conveyor Belts\",19993,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1811\\\"\\u003eCodeforces Round 863 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1847B\":[\"Hamon Odyssey\",19164,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1847\\\"\\u003eCodeforces Round 882 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1237A\":[\"Balanced Rating Changes\",18989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1237\\\"\\u003eCodeforces Global Round 5\\u003c/a\\u003e\"],\"CodeForces-299A\":[\"Ksusha and Array\",8510,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/299\\\"\\u003eCroc Champ 2013 - Round 2 (Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-939B\":[\"Hamster Farm\",10873,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/939\\\"\\u003eCodeforces Round 464 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-14B\":[\"Young Photographer\",7173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/14\\\"\\u003eCodeforces Beta Round 14 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1051B\":[\"Relatively Prime Pairs\",17869,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1051\\\"\\u003eEducational Codeforces Round 51 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1293B\":[\"JOE is on TV!\",22034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1293\\\"\\u003eCodeforces Round 614 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1770A\":[\"Koxia and Whiteboards\",23132,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1770\\\"\\u003eGood Bye 2022: 2023 is NEAR\\u003c/a\\u003e\"],\"CodeForces-1770B\":[\"Koxia and Permutation\",19118,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1770\\\"\\u003eGood Bye 2022: 2023 is NEAR\\u003c/a\\u003e\"],\"CodeForces-1931C\":[\"Make Equal Again\",26135,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1931\\\"\\u003eCodeforces Round 925 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-250A\":[\"Paper Work\",4422,\"\\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-371A\":[\"K-Periodic Array\",6644,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/371\\\"\\u003eCodeforces Round 218 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1333A\":[\"Little Artem\",24605,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1333\\\"\\u003eCodeforces Round 632 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1713B\":[\"Optimal Reduction\",20909,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1713\\\"\\u003eCodeforces Round 812 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1834B\":[\"Maximum Strength\",14614,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1834\\\"\\u003eCodeforces Round 879 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1955B\":[\"Progressive Square\",22876,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1955\\\"\\u003eCodeforces Round 938 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-165A\":[\"Supercentral Point\",23190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/165\\\"\\u003eCodeforces Round 112 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1139B\":[\"Chocolates\",16173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1139\\\"\\u003eCodeforces Round 548 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1248A\":[\"Integer Points\",14345,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1248\\\"\\u003eCodeforces Round 594 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1725B\":[\"Basketball Together\",11827,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1725\\\"\\u003eCOMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1858C\":[\"Yet Another Permutation Problem\",22126,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1858\\\"\\u003eCodeforces Round 893 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-400A\":[\"Inna and Choose Options\",7119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/400\\\"\\u003eCodeforces Round 234 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-805B\":[\"3-palindrome\",17707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/805\\\"\\u003eCodeforces Round 411 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-805A\":[\"Fake NP\",19344,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/805\\\"\\u003eCodeforces Round 411 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1195B\":[\"Sport Mafia\",19803,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1195\\\"\\u003eCodeforces Round 574 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1781B\":[\"Going to the Cinema\",13277,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1781\\\"\\u003eVK Cup 2022 - Отборочный раунд (Engine)\\u003c/a\\u003e\"],\"CodeForces-339B\":[\"Xenia and Ringroad\",67949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/339\\\"\\u003eCodeforces Round 197 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1195A\":[\"Drinks Choosing\",12816,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1195\\\"\\u003eCodeforces Round 574 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1430C\":[\"Numbers on Whiteboard\",24648,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1430\\\"\\u003eEducational Codeforces Round 96 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-219A\":[\"k-String\",27520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/219\\\"\\u003eCodeforces Round 135 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1859B\":[\"Olya and Game with Arrays\",24307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1859\\\"\\u003eCodeforces Round 892 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-981B\":[\"Businessmen Problems\",7464,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/981\\\"\\u003eAvito Code Challenge 2018\\u003c/a\\u003e\"],\"CodeForces-909A\":[\"Generate Login\",9861,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-221A\":[\"Little Elephant and Function\",15539,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/221\\\"\\u003eCodeforces Round 136 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-124A\":[\"The number of positions\",38754,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/124\\\"\\u003eCodeforces Beta Round 92 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1033A\":[\"King Escape\",13660,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1033\\\"\\u003eLyft Level 5 Challenge 2018 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1861B\":[\"Two Binary Strings\",20233,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1861\\\"\\u003eEducational Codeforces Round 154 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-626A\":[\"Robot Sequence\",6826,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/626\\\"\\u003e8VC Venture Cup 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1251A\":[\"Broken Keyboard\",20080,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1251\\\"\\u003eEducational Codeforces Round 75 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-831A\":[\"Unimodal Array\",11316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/831\\\"\\u003eCodeforces Round 424 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-499A\":[\"Watching a movie\",14620,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/499\\\"\\u003eCodeforces Round 284 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-499B\":[\"Lecture\",39262,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/499\\\"\\u003eCodeforces Round 284 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-584A\":[\"Olesya and Rodion\",44723,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/584\\\"\\u003eCodeforces Round 324 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1927C\":[\"Choose the Different Ones!\",25535,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1927\\\"\\u003eCodeforces Round 923 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-560A\":[\"Currency System in Geraldion\",20769,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/560\\\"\\u003eCodeforces Round 313 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1521A\":[\"Nastia and Nearly Good Numbers\",36502,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1521\\\"\\u003eCodeforces Round 720 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-450A\":[\"Jzzhu and Children\",36627,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/450\\\"\\u003eCodeforces Round 257 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-462A\":[\"Appleman and Easy Task\",17110,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/462\\\"\\u003eCodeforces Round 263 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1569B\":[\"Chess Tournament\",18835,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1569\\\"\\u003eEducational Codeforces Round 113 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1913B\":[\"Swap and Delete\",21732,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1913\\\"\\u003eEducational Codeforces Round 160 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1153A\":[\"Serval and Bus\",12397,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1153\\\"\\u003eCodeforces Round 551 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1165B\":[\"Polycarp Training\",21981,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1165\\\"\\u003eCodeforces Round 560 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-268B\":[\"Buttons\",32743,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/268\\\"\\u003eCodeforces Round 164 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-389A\":[\"Fox and Number Game\",15236,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/389\\\"\\u003eCodeforces Round 228 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1177A\":[\"Digits Sequence (Easy Edition)\",6403,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1177\\\"\\u003eTesting Round 15 (Unrated)\\u003c/a\\u003e\"],\"CodeForces-649A\":[\"Любимые числа Поликарпа\",1083,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/649\\\"\\u003eТехнокубок 2016 - Отборочный Раунд 2\\u003c/a\\u003e\"],\"CodeForces-1020A\":[\"New Building for SIS\",9360,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1020\\\"\\u003eCodeforces Round 503 (by SIS, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-637A\":[\"Voting for Photos\",5604,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/637\\\"\\u003eVK Cup 2016 - Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-1020B\":[\"Badge\",21876,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1020\\\"\\u003eCodeforces Round 503 (by SIS, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1141A\":[\"Game 23\",33913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1141\\\"\\u003eCodeforces Round 547 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1395A\":[\"Boboniu Likes to Color Balls\",23820,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1395\\\"\\u003eCodeforces Round 664 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-515A\":[\"Drazil and Date\",21355,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/515\\\"\\u003eCodeforces Round 292 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-757A\":[\"Gotta Catch Em\\u0027 All!\",12139,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/757\\\"\\u003eCodecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-733A\":[\"Grasshopper And the String\",17028,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/733\\\"\\u003eCodeforces Round 378 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1829D\":[\"Gold Rush\",25411,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1829\\\"\\u003eCodeforces Round 871 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-583A\":[\"Asphalting Roads\",11908,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/583\\\"\\u003eCodeforces Round 323 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-680B\":[\"Bear and Finding Criminals\",24977,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/680\\\"\\u003eCodeforces Round 356 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1447B\":[\"Numbers Box\",15634,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1447\\\"\\u003eCodeforces Round 683 (Div. 2, by Meet IT)\\u003c/a\\u003e\"],\"CodeForces-74A\":[\"Room Leader\",5255,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/74\\\"\\u003eCodeforces Beta Round 68\\u003c/a\\u003e\"],\"CodeForces-1411B\":[\"Fair Numbers\",18518,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1411\\\"\\u003eTechnocup 2021 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1798B\":[\"Three Sevens\",16344,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1798\\\"\\u003eCodeforces Round 860 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-122A\":[\"Lucky Division\",125039,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/122\\\"\\u003eCodeforces Beta Round 91 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-352A\":[\"Jeff and Digits\",25717,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/352\\\"\\u003eCodeforces Round 204 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-122B\":[\"Lucky Substring\",12783,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/122\\\"\\u003eCodeforces Beta Round 91 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1326A\":[\"Bad Ugly Numbers\",30381,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1326\\\"\\u003eCodeforces Global Round 7\\u003c/a\\u003e\"],\"CodeForces-1520C\":[\"Not Adjacent Matrix\",31875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1520\\\"\\u003eCodeforces Round 719 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1140A\":[\"Detective Book\",12839,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1140\\\"\\u003eEducational Codeforces Round 62 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1883C\":[\"Raspberries\",22585,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1883\\\"\\u003eCodeforces Round 905 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-998A\":[\"Balloons\",9884,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/998\\\"\\u003eCodeforces Round 493 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-732B\":[\"Cormen --- The Best Friend Of a Man\",25549,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/732\\\"\\u003eCodeforces Round 377 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1816B\":[\"Grid Reconstruction\",14818,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1816\\\"\\u003eCodeforces Round 865 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1804B\":[\"Vaccination\",13893,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1804\\\"\\u003eNebius Welcome Round (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-691A\":[\"Fashion in Berland\",10868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/691\\\"\\u003eEducational Codeforces Round 14\\u003c/a\\u003e\"],\"CodeForces-1107B\":[\"Digital root\",15761,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1107\\\"\\u003eEducational Codeforces Round 59 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1567B\":[\"MEXor Mixup\",21945,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1567\\\"\\u003eCodeforces Round 742 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-230A\":[\"Dragons\",80478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/230\\\"\\u003eCodeforces Round 142 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-75A\":[\"Life Without Zeros\",26296,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/75\\\"\\u003eCodeforces Beta Round 67 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1204A\":[\"BowWow and the Timetable\",20597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1204\\\"\\u003eCodeforces Round 581 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1802B\":[\"Settlement of Guinea Pigs\",13018,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1802\\\"\\u003eCodeforces Round 857 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-157B\":[\"Trace\",13954,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/157\\\"\\u003eCodeforces Round 110 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1199B\":[\"Water Lily\",20829,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1199\\\"\\u003eCodeforces Round 576 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1199A\":[\"City Day\",14588,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1199\\\"\\u003eCodeforces Round 576 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1260A\":[\"Heating\",14598,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1260\\\"\\u003eEducational Codeforces Round 77 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1676D\":[\"X-Sum\",24672,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1676\\\"\\u003eCodeforces Round 790 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-404A\":[\"Valera and X\",24188,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/404\\\"\\u003eCodeforces Round 237 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1151A\":[\"Maxim and Biology\",11847,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1151\\\"\\u003eCodeforces Round 553 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1894B\":[\"Two Out of Three\",14787,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1894\\\"\\u003eCodeforces Round 908 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-659A\":[\"Round House\",17264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/659\\\"\\u003eCodeforces Round 346 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1054B\":[\"Appending Mex\",6607,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1054\\\"\\u003eMail.Ru Cup 2018 Round 1\\u003c/a\\u003e\"],\"CodeForces-1761B\":[\"Elimination of a Ring\",13108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1761\\\"\\u003ePinely Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-779A\":[\"Pupils Redistribution\",9871,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/779\\\"\\u003eCodeforces Round 402 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-864A\":[\"Fair Game\",12458,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/864\\\"\\u003eCodeforces Round 436 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-622A\":[\"Infinite Sequence\",10161,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/622\\\"\\u003eEducational Codeforces Round 7\\u003c/a\\u003e\"],\"CodeForces-888B\":[\"Buggy Robot\",10449,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-610A\":[\"Pasha and Stick\",24402,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/610\\\"\\u003eCodeforces Round 337 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1490B\":[\"Balanced Remainders\",26657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1490\\\"\\u003eCodeforces Round 702 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-864B\":[\"Polycarp and Letters\",9404,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/864\\\"\\u003eCodeforces Round 436 (Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1713880283000,"title":"CodeForces rating 1000 题目集","dislikeCnt":0,"content":"[problem:CodeForces-1A] Theatre Square数学(math)\n[problem:CodeForces-118A] String Task实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-69A] Young Physicist实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-58A] Chat room贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-122A] Lucky Division暴力枚举(brute force),数论(number theory)\n[problem:CodeForces-479A] Expression暴力枚举(brute force),数学(math)\n[problem:CodeForces-131A] cAPS lOCK实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-230A] Dragons贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-339B] Xenia and Ringroad实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-579A] Raising Bacteria位掩码(bitmasks)\n[problem:CodeForces-43A] Football字符串处理(strings)\n[problem:CodeForces-500A] New Year Transportation深度优先搜索及其变种(dfs and similar),图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-379A] New Year Candles实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1374C] Move Brackets贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-584A] Olesya and Rodion数学(math)\n[problem:CodeForces-476A] Dreamoon and Stairs实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-742A] Arpa’s hard exam and Mehrdad’s naive cheat实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-1342A] Road To Zero贪心策略(greedy),数学(math)\n[problem:CodeForces-577A] Multiplication Table实现问题,编程技巧,模拟(implementation),数论(number theory)\n[problem:CodeForces-499B] Lecture实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-124A] The number of positions数学(math)\n[problem:CodeForces-1521A] Nastia and Nearly Good Numbers构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-1476A] K-divisible Sum二分搜索(binary search),构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-1353C] Board Moves数学(math)\n[problem:CodeForces-450A] Jzzhu and Children实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-766B] Mahmoud and a Triangle构造算法(constructive algorithms),计算几何(geometry),贪心策略(greedy),数学(math),数论(number theory),排序算法(sortings)\n[problem:CodeForces-268B] Buttons实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1520C] Not Adjacent Matrix构造算法(constructive algorithms)\n[problem:CodeForces-688B] Lovely Palindromes构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-1473B] String LCM暴力枚举(brute force),数学(math),数论(number theory),字符串处理(strings)\n[problem:CodeForces-1141A] Game 23实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1326A] Bad Ugly Numbers构造算法(constructive algorithms),数论(number theory)\n[problem:CodeForces-1182A] Filling Shapes动态规划(dp),数学(math)\n[problem:CodeForces-1359A] Berland Poker暴力枚举(brute force),贪心策略(greedy),数学(math)\n[problem:CodeForces-766A] Mahmoud and Longest Uncommon Subsequence构造算法(constructive algorithms),字符串处理(strings)\n[problem:CodeForces-139A] Petr and Book实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1256A] Payment Without Change数学(math)\n[problem:CodeForces-118B] Present from Lena构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1359B] New Theatre Square暴力枚举(brute force),动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-1791D] Distinct Split暴力枚举(brute force),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1690D] Black and White Stripe实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-1469A] Regular Bracket Sequence构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1474B] Different Divisors二分搜索(binary search),构造算法(constructive algorithms),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1469B] Red and Blue动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-219A] k-String实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1941B] Rudolf and 121暴力枚举(brute force),动态规划(dp),贪心策略(greedy),数学(math)\n[problem:CodeForces-1373A] Donut Shops贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-237A] Free Cash实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1931C] Make Equal Again暴力枚举(brute force),贪心策略(greedy),数学(math)\n[problem:CodeForces-1550B] Maximum Cost Deletion贪心策略(greedy),数学(math)\n[problem:CodeForces-1490B] Balanced Remainders暴力枚举(brute force),构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-1927C] Choose the Different Ones!暴力枚举(brute force),贪心策略(greedy),数学(math)\n[problem:CodeForces-75A] Life Without Zeros实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1358B] Maria Breaks the Self-isolation贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-352A] Jeff and Digits暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-102B] Sum of Digits实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1312B] Bogosort构造算法(constructive algorithms),排序算法(sortings)\n[problem:CodeForces-1840C] Ski Resort组合数学(combinatorics),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1607C] Minimum Extraction暴力枚举(brute force),排序算法(sortings)\n[problem:CodeForces-978C] Letters二分搜索(binary search),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-1515B] Phoenix and Puzzle暴力枚举(brute force),计算几何(geometry),数学(math),数论(number theory)\n[problem:CodeForces-1333A] Little Artem构造算法(constructive algorithms)\n[problem:CodeForces-1859B] Olya and Game with Arrays构造算法(constructive algorithms),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1829D] Gold Rush暴力枚举(brute force),深度优先搜索及其变种(dfs and similar),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1744C] Traffic Light二分搜索(binary search),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-732B] Cormen --- The Best Friend Of a Man动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1676D] X-Sum暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1800B] Count the Number of Pairs贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1593C] Save More Mice二分搜索(binary search),贪心策略(greedy),贪心策略(greedy)\n[problem:CodeForces-37A] Towers排序算法(sortings)\n[problem:CodeForces-272A] Dima and Friends实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1916B] Two Divisors构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-1395A] Boboniu Likes to Color Balls暴力枚举(brute force),数学(math)\n[problem:CodeForces-680B] Bear and Finding Criminals构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1430C] Numbers on Whiteboard构造算法(constructive algorithms),数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1506C] Double-ended Strings暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1907B] YetnotherrokenKeoard数据结构(data structures),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1702D] Not a Cheap String贪心策略(greedy)\n[problem:CodeForces-1790C] Premutation暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1674C] Infinite Replacement组合数学(combinatorics),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1770A] Koxia and Whiteboards暴力枚举(brute force),贪心策略(greedy)\n[problem:CodeForces-404A] Valera and X实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1772C] Different Differences构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-165A] Supercentral Point实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1849B] Monsters贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1362A] Johnny and Ancient Computer实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1883C] Raspberries动态规划(dp),数学(math)\n[problem:CodeForces-1760D] Challenging Valleys实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-1300B] Assigning to Classes贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1851C] Tiles Comeback贪心策略(greedy)\n[problem:CodeForces-610A] Pasha and Stick组合数学(combinatorics),数学(math)\n[problem:CodeForces-1388B] Captain Flint and a Long Voyage贪心策略(greedy),数学(math)\n[problem:CodeForces-1858C] Yet Another Permutation Problem构造算法(constructive algorithms),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1955B] Progressive Square构造算法(constructive algorithms),数据结构(data structures),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1721B] Deadly Laser实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1913B] Swap and Delete字符串处理(strings)\n[problem:CodeForces-1567B] MEXor Mixup位掩码(bitmasks),贪心策略(greedy)\n[problem:CodeForces-1418A] Buying Torches数学(math)\n[problem:CodeForces-1691B] Shoe Shuffling构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-1613B] Absent Remainder贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1837C] Best Binary String构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-798A] Mike and palindrome暴力枚举(brute force),构造算法(constructive algorithms),字符串处理(strings)\n[problem:CodeForces-1405B] Array Cancellation构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1293B] JOE is on TV!组合数学(combinatorics),贪心策略(greedy),数学(math)\n[problem:CodeForces-1632B] Roof Construction位掩码(bitmasks),构造算法(constructive algorithms)\n[problem:CodeForces-1485A] Add and Divide暴力枚举(brute force),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1713B] Optimal Reduction构造算法(constructive algorithms),排序算法(sortings)\n[problem:CodeForces-1622B] Berland Music数据结构(data structures),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1841B] Keep it Beautiful实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1499B] Binary Removals暴力枚举(brute force),动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1165B] Polycarp Training数据结构(data structures),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1020B] Badge暴力枚举(brute force),深度优先搜索及其变种(dfs and similar),图论(graphs)\n[problem:CodeForces-1766B] Notepad#实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1715B] Beautiful Array构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-1861B] Two Binary Strings构造算法(constructive algorithms),动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-447B] DZY Loves Strings贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1204A] BowWow and the Timetable数学(math)\n[problem:CodeForces-1811B] Conveyor Belts实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1257B] Magic Stick数学(math)\n[problem:CodeForces-1539A] Contest Start组合数学(combinatorics),计算几何(geometry),贪心策略(greedy),数学(math)\n[problem:CodeForces-1199B] Water Lily计算几何(geometry),数学(math)\n[problem:CodeForces-515A] Drazil and Date数学(math)\n[problem:CodeForces-1620B] Triangles on a Rectangle计算几何(geometry),贪心策略(greedy),数学(math)\n[problem:CodeForces-1562B] Scenes From a Memory暴力枚举(brute force),构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-1847B] Hamon Odyssey位掩码(bitmasks),贪心策略(greedy),双指针算法(two pointers)\n[problem:CodeForces-1770B] Koxia and Permutation构造算法(constructive algorithms)\n[problem:CodeForces-1809B] Points on Plane二分搜索(binary search),贪心策略(greedy),数学(math)\n[problem:CodeForces-1195B] Sport Mafia二分搜索(binary search),暴力枚举(brute force),数学(math)\n[problem:CodeForces-1251A] Broken Keyboard暴力枚举(brute force),字符串处理(strings),双指针算法(two pointers)\n[problem:CodeForces-1569B] Chess Tournament构造算法(constructive algorithms)\n[problem:CodeForces-1237A] Balanced Rating Changes实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-3A] Shortest path of the king贪心策略(greedy),最短路算法(shortest paths)\n[problem:CodeForces-1438B] Valerii Against Everyone构造算法(constructive algorithms),数据结构(data structures),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1831B] Array merging构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1230B] Ania and Minimizing贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1077B] Disturbed People贪心策略(greedy)\n[problem:CodeForces-441A] Valera and Antique Items实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1671B] Consecutive Points Segment暴力枚举(brute force),数学(math),排序算法(sortings)\n[problem:CodeForces-334A] Candy Bags实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1695B] Circle Game博弈论(games),贪心策略(greedy)\n[problem:CodeForces-1634C] OKEA构造算法(constructive algorithms)\n[problem:CodeForces-1611C] Polycarp Recovers the Permutation构造算法(constructive algorithms)\n[problem:CodeForces-1614B] Divan and a New Project构造算法(constructive algorithms),排序算法(sortings)\n[problem:CodeForces-1411B] Fair Numbers暴力枚举(brute force),数论(number theory)\n[problem:CodeForces-1253A] Single Push实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1605B] Reverse Sort贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-805A] Fake NP贪心策略(greedy),数学(math)\n[problem:CodeForces-1844B] Permutations \u0026 Primes构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-1174A] Ehab Fails to Be Thanos构造算法(constructive algorithms),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-672B] Different is Good构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1566C] MAX-MEX Cut位掩码(bitmasks),构造算法(constructive algorithms),动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-507A] Amr and Music贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-265B] Roadside Trees 贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1659A] Red Versus Blue构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-560A] Currency System in Geraldion实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1101A] Minimum Integer数学(math)\n[problem:CodeForces-1111A] Superhero Transformation实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-462A] Appleman and Easy Task暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-109A] Lucky Sum of Digits暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1051B] Relatively Prime Pairs贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1203A] Circle of Students实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1133A] Middle of the Contest实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1221A] 2048 Game暴力枚举(brute force),贪心策略(greedy),数学(math)\n[problem:CodeForces-1704B] Luke is a Foodie暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-385A] Bear and Raspberry暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-805B] 3-palindrome构造算法(constructive algorithms)\n[problem:CodeForces-1796B] Asterisk-Minor Template实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-733A] Grasshopper And the String实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1798B] Three Sevens暴力枚举(brute force),数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1598B] Groups暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1278A] Shuffle Hashing暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1139B] Chocolates贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1027A] Palindromic Twist实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-659A] Round House实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-804A] Find Amir构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-699A] Launch of Collider实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1244B] Rooms and Staircases暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1447B] Numbers Box贪心策略(greedy),数学(math)\n[problem:CodeForces-17A] Noldbach problem暴力枚举(brute force),数学(math),数论(number theory)\n[problem:CodeForces-1266A] Competitive Programmer中国剩余定理(chinese remainder theorem),数学(math)\n[problem:CodeForces-1450B] Balls of Steel暴力枚举(brute force),计算几何(geometry),贪心策略(greedy)\n[problem:CodeForces-1073A] Diverse Substring实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1107B] Digital root数学(math),数论(number theory)\n[problem:CodeForces-1144C] Two Shuffled Sequences构造算法(constructive algorithms),排序算法(sortings)\n[problem:CodeForces-1265A] Beautiful String构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1816B] Grid Reconstruction构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-221A] Little Elephant and Function实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1894B] Two Out of Three构造算法(constructive algorithms)\n[problem:CodeForces-1876A] Helmets in Night Light贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1834B] Maximum Strength贪心策略(greedy),数学(math)\n[problem:CodeForces-1223B] Strings Equalization字符串处理(strings)\n[problem:CodeForces-1784A] Monsters 暴力枚举(brute force),贪心策略(greedy)\n[problem:CodeForces-1732A] Bestie暴力枚举(brute force),组合数学(combinatorics),构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-761A] Dasha and Stairs暴力枚举(brute force),构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1266B] Dice Tower构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-1260A] Heating数学(math)\n[problem:CodeForces-1825B] LuoTianyi and the Table贪心策略(greedy),数学(math)\n[problem:CodeForces-1199A] City Day实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1245A] Good ol\u0027 Numbers Coloring数学(math),数论(number theory)\n[problem:CodeForces-114A] Cifera数学(math)\n[problem:CodeForces-389A] Fox and Number Game贪心策略(greedy),数学(math)\n[problem:CodeForces-1248A] Integer Points计算几何(geometry),数学(math)\n[problem:CodeForces-1804B] Vaccination贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-499A] Watching a movie贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1117B] Emotes贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1041B] Buying a TV Set数学(math)\n[problem:CodeForces-1197B] Pillars贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-979A] Pizza,Pizza,Pizza!!!数学(math)\n[problem:CodeForces-1155A] Reverse a Substring实现问题,编程技巧,模拟(implementation),排序算法(sortings),字符串处理(strings)\n[problem:CodeForces-1930B] Permutation Printing暴力枚举(brute force),构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-137B] Permutation贪心策略(greedy)\n[problem:CodeForces-1781B] Going to the Cinema暴力枚举(brute force),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-727A] Transformation: from A to B暴力枚举(brute force),深度优先搜索及其变种(dfs and similar),数学(math)\n[problem:CodeForces-1181A] Chunga-Changa贪心策略(greedy),数学(math)\n[problem:CodeForces-1584B] Coloring Rectangles贪心策略(greedy),数学(math)\n[problem:CodeForces-143A] Help Vasilisa the Wise 2暴力枚举(brute force),数学(math)\n[problem:CodeForces-1761B] Elimination of a Ring构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1277A] Happy Birthday,Polycarp!实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1033A] King Escape深度优先搜索及其变种(dfs and similar),图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1802B] Settlement of Guinea Pigs贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-157B] Trace计算几何(geometry),排序算法(sortings)\n[problem:CodeForces-1765M] Minimum LCM数学(math),数论(number theory)\n[problem:CodeForces-1059A] Cashier实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1195A] Drinks Choosing贪心策略(greedy),数学(math)\n[problem:CodeForces-1088B] Ehab and subtraction实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1140A] Detective Book实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-122B] Lucky Substring暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-535A] Tavas and Nafas暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1725B] Basketball Together二分搜索(binary search),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1136B] Nastya Is Playing Computer Games构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-864A] Fair Game实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1153A] Serval and Bus暴力枚举(brute force),数学(math)\n[problem:CodeForces-616B] Dinner with Emma博弈论(games),贪心策略(greedy)\n[problem:CodeForces-583A] Asphalting Roads实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1215A] Yellow Cards贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1008B] Turn the Rectangles贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-757A] Gotta Catch Em\u0027 All!实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-670B] Game of Robots实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1151A] Maxim and Biology暴力枚举(brute force),字符串处理(strings)\n[problem:CodeForces-887A] Div. 64实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-893B] Beautiful Divisors暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1023B] Pair of Toys数学(math)\n[problem:CodeForces-990A] Commentary Boxes实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1073B] Vasya and Books实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-844A] Diversity贪心策略(greedy),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-991A] If at first you don\u0027t succeed...实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-465B] Inbox 实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-939B] Hamster Farm实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-886A] ACM ICPC暴力枚举(brute force)\n[problem:CodeForces-777A] Shell Game构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1100A] Roman and Browser实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-831A] Unimodal Array实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1036A] Function Height数学(math)\n[problem:CodeForces-435A] Queue on Bus Stop实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-691A] Fashion in Berland实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-336A] Vasily the Bear and Triangle实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-652B] z-sort排序算法(sortings)\n[problem:CodeForces-888B] Buggy Robot贪心策略(greedy)\n[problem:CodeForces-1765E] Exchange暴力枚举(brute force),数学(math)\n[problem:CodeForces-862A] Mahmoud and Ehab and the MEX贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-552A] Vanya and Table实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-822B] Crossword solving暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1040A] Palindrome Dance贪心策略(greedy)\n[problem:CodeForces-5A] Chat Servers Outgoing Traffic实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-779A] Pupils Redistribution构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-620B] Grandfather Dovlet’s calculator实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-998A] Balloons构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-108A] Palindromic Times实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-608A] Saitama Destroys Hotel实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-909A] Generate Login暴力枚举(brute force),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-622A] Infinite Sequence实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-259A] Little Elephant and Chess暴力枚举(brute force),字符串处理(strings)\n[problem:CodeForces-849A] Odds and Ends实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-816A] Karen and Morning暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-864B] Polycarp and Letters暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1020A] New Building for SIS数学(math)\n[problem:CodeForces-604A] Uncowed Forces实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-753A] Santa Claus and Candies动态规划(dp),贪心策略(greedy),数学(math)\n[problem:CodeForces-195A] Let\u0027s Watch Football二分搜索(binary search),暴力枚举(brute force),数学(math)\n[problem:CodeForces-359A] Table构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-56A] Bar实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-127B] Canvas Frames实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-322A] Ciel and Dancing贪心策略(greedy)\n[problem:CodeForces-452A] Eevee暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1084A] The Fair Nut and Elevator暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-886B] Vlad and Cafes\n[problem:CodeForces-299A] Ksusha and Array暴力枚举(brute force),数论(number theory),排序算法(sortings)\n[problem:CodeForces-920A] Water The Garden实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-106A] Card Game实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-13A] Numbers实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-368A] Sereja and Coat Rack实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-725A] Jumping Ball实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-724A] Checking the Calendar实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-234B] Reading排序算法(sortings)\n[problem:CodeForces-967B] Watering System数学(math),排序算法(sortings)\n[problem:CodeForces-29A] Spit Problem暴力枚举(brute force)\n[problem:CodeForces-182B] Vasya\u0027s Calendar实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-981B] Businessmen Problems排序算法(sortings)\n[problem:CodeForces-859B] Lazy Security Guard暴力枚举(brute force),计算几何(geometry),数学(math)\n[problem:CodeForces-357A] Group of Students暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-284B] Cows and Poker Game暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-14B] Young Photographer实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-35A] Shell Game实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1054B] Appending Mex实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-400A] Inna and Choose Options实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-847M] Weather Tomorrow实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-628A] Tennis Tournament实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-626A] Robot Sequence暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1090M] The Pleasant Walk实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-371A] K-Periodic Array贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-106B] Choosing Laptop暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-420A] Start Up实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-641A] Little Artem and Grasshopper实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1252A] Copying Homework\n[problem:CodeForces-1177A] Digits Sequence 实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-637A] Voting for Photos,构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-660B] Seating On Bus实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-74A] Room Leader实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-90A] Cableway贪心策略(greedy),数学(math)\n[problem:CodeForces-120A] Elevator暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-644A] Parliament of Berland,构造算法(constructive algorithms)\n[problem:CodeForces-250A] Paper Work贪心策略(greedy)\n[problem:CodeForces-1906A] Easy As ABC暴力枚举(brute force)\n[problem:CodeForces-491A] Up the hill构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-125B] Simple XML实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-72G] Fibonacci army,动态规划(dp)\n[problem:CodeForces-1346A] Color Revolution,数学(math)\n[problem:CodeForces-1211A] Three Problems,实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-649A] Любимые числа Поликарпа构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)","threadId":190421,"likeCnt":0,"createTime":1713880283000,"isWorkbook":true,"viewCnt":30,"openness":2,"fav":false,"id":4925,"trustable":false}