{"workbook":{"problemsBrief":"{\"CodeForces-160B\":[\"Unlucky Ticket\",16612,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/160\\\"\\u003eCodeforces Round 111 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1623B\":[\"Game on Ranges\",14801,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1623\\\"\\u003eCodeforces Round 763 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-196A\":[\"Lexicographically Maximum Subsequence\",6121,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/196\\\"\\u003eCodeforces Round 124 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1417B\":[\"Two Arrays\",15064,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1417\\\"\\u003eCodeforces Round 673 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-68A\":[\"Irrational problem\",5521,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/68\\\"\\u003eCodeforces Beta Round 62\\u003c/a\\u003e\"],\"CodeForces-116B\":[\"Little Pigs and Wolves\",15053,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/116\\\"\\u003eCodeforces Beta Round 87 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1255B\":[\"Fridge Lockers\",12963,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1255\\\"\\u003eCodeforces Round 601 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-225A\":[\"Dice Tower\",18118,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/225\\\"\\u003eCodeforces Round 139 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1001A\":[\"Generate plus state or minus state\",1035,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1001\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018 - Warmup\\u003c/a\\u003e\"],\"CodeForces-1146B\":[\"Hate \\\"A\\\"\",9635,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1146\\\"\\u003eForethought Future Cup - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-618B\":[\"Guess the Permutation\",8863,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/618\\\"\\u003eWunder Fund Round 2016 (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-1594B\":[\"Special Numbers\",22283,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1594\\\"\\u003eCodeforces Round 747 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1950D\":[\"Product of Binary Decimals\",26247,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1950\\\"\\u003eCodeforces Round 937 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1231C\":[\"Increasing Matrix\",4633,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1231\\\"\\u003eDasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists)\\u003c/a\\u003e\"],\"CodeForces-835B\":[\"The number on the board\",12319,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-467B\":[\"Fedor and New Game\",43771,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/467\\\"\\u003eCodeforces Round 267 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1743C\":[\"Save the Magazines\",20529,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1743\\\"\\u003eEducational Codeforces Round 137 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1731B\":[\"Kill Demodogs\",23598,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1731\\\"\\u003eCodeforces Round 841 (Div. 2) and Divide by Zero 2022\\u003c/a\\u003e\"],\"CodeForces-292A\":[\"SMSC\",2862,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/292\\\"\\u003eCroc Champ 2013 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1840B\":[\"Binary Cafe\",24426,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1840\\\"\\u003eCodeforces Round 878 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1610B\":[\"Kalindrome Array\",21081,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1610\\\"\\u003eCodeforces Global Round 17\\u003c/a\\u003e\"],\"CodeForces-1864B\":[\"Swap and Reverse\",16517,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1864\\\"\\u003eHarbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1157A\":[\"Reachable Numbers\",17541,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1157\\\"\\u003eCodeforces Round 555 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1428C\":[\"ABBB\",23666,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1428\\\"\\u003eCodeforces Raif Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1121A\":[\"Technogoblet of Fire\",7704,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1121\\\"\\u003eCodeforces Round 543 (Div. 2, based on Technocup 2019 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1472C\":[\"Long Jumps\",35807,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1472\\\"\\u003eCodeforces Round 693 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-224A\":[\"Parallelepiped\",30115,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/224\\\"\\u003eCodeforces Round 138 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-103A\":[\"Testing Pants for Sadness\",7132,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/103\\\"\\u003eCodeforces Beta Round 80 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-508A\":[\"Pasha and Pixels\",8928,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/508\\\"\\u003eCodeforces Round 288 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-629B\":[\"Far Relative’s Problem\",8992,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/629\\\"\\u003eCodeforces Round 343 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1375A\":[\"Sign Flipping\",19085,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1375\\\"\\u003eCodeforces Global Round 9\\u003c/a\\u003e\"],\"CodeForces-714A\":[\"Meeting of Old Friends\",12048,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/714\\\"\\u003eCodeforces Round 371 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1496B\":[\"Max and Mex\",18405,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1496\\\"\\u003eCodeforces Round 706 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-834B\":[\"The Festive Evening\",9757,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/834\\\"\\u003eCodeforces Round 426 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-955A\":[\"Feed the cat\",7682,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/955\\\"\\u003eCodeforces Round 471 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-478A\":[\"Initial Bet\",28047,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/478\\\"\\u003eCodeforces Round 273 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1863B\":[\"Split Sort\",16607,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1863\\\"\\u003ePinely Round 2 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1669D\":[\"Colorful Stamp\",25376,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1669\\\"\\u003eCodeforces Round 784 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1863C\":[\"MEX Repetition\",15528,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1863\\\"\\u003ePinely Round 2 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1899C\":[\"Yarik and Array\",29608,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1899\\\"\\u003eCodeforces Round 909 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1633C\":[\"Kill the Monster\",21343,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1633\\\"\\u003eEducational Codeforces Round 122 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1669F\":[\"Eating Candies\",36623,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1669\\\"\\u003eCodeforces Round 784 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1899B\":[\"250 Thousand Tons of TNT\",28954,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1899\\\"\\u003eCodeforces Round 909 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-66B\":[\"Petya and Countryside\",23338,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/66\\\"\\u003eCodeforces Beta Round 61 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1415B\":[\"Repainting Street\",12598,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1415\\\"\\u003eTechnocup 2021 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1132A\":[\"Regular Bracket Sequence\",10919,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1132\\\"\\u003eEducational Codeforces Round 61 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1471B\":[\"Strange List\",20188,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1471\\\"\\u003eCodeforces Round 694 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-368B\":[\"Sereja and Suffixes\",53954,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/368\\\"\\u003eCodeforces Round 215 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-259B\":[\"Little Elephant and Magic Square\",15780,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/259\\\"\\u003eCodeforces Round 157 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-519B\":[\"A and B and Compilation Errors\",45693,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/519\\\"\\u003eCodeforces Round 294 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-967A\":[\"Mind the Gap\",4796,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/967\\\"\\u003eCodeforces Round 477 (rated, Div. 2, based on VK Cup 2018 Round 3)\\u003c/a\\u003e\"],\"CodeForces-1742D\":[\"Coprime\",31298,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1742\\\"\\u003eCodeforces Round 827 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-858A\":[\"k-rounding\",9697,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/858\\\"\\u003eТехнокубок 2018 - Отборочный Раунд 1\\u003c/a\\u003e\"],\"CodeForces-845A\":[\"Chess Tourney\",8797,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"CodeForces-712B\":[\"Memory and Trident\",11456,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/712\\\"\\u003eCodeforces Round 370 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-792A\":[\"New Bus Route\",10356,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/792\\\"\\u003eEducational Codeforces Round 18\\u003c/a\\u003e\"],\"CodeForces-1905B\":[\"Begginer\\u0027s Zelda\",18274,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1905\\\"\\u003eCodeforces Round 915 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1917B\":[\"Erase First or Second Letter\",31129,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1917\\\"\\u003eCodeforces Round 917 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1426C\":[\"Increase and Copy\",21079,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1426\\\"\\u003eCodeforces Round 674 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1523B\":[\"Lord of the Values\",12442,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1523\\\"\\u003eDeltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1547C\":[\"Pair Programming\",24846,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1547\\\"\\u003eCodeforces Round 731 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1656B\":[\"Subtract Operation\",27464,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1656\\\"\\u003eCodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1511C\":[\"Yet Another Card Deck\",31859,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1511\\\"\\u003eEducational Codeforces Round 107 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1511B\":[\"GCD Length\",24800,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1511\\\"\\u003eEducational Codeforces Round 107 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-43B\":[\"Letter\",20569,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/43\\\"\\u003eCodeforces Beta Round 42 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-355B\":[\"Vasya and Public Transport\",5146,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/355\\\"\\u003eCodeforces Round 206 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-355A\":[\"Vasya and Digital Root\",10283,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/355\\\"\\u003eCodeforces Round 206 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1288B\":[\"Yet Another Meme Problem\",18244,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1288\\\"\\u003eEducational Codeforces Round 80 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-258A\":[\"Little Elephant and Bits\",30314,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/258\\\"\\u003eCodeforces Round 157 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1288A\":[\"Deadline\",20305,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1288\\\"\\u003eEducational Codeforces Round 80 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1850E\":[\"Cardboard for Pictures\",32536,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1850\\\"\\u003eCodeforces Round 886 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-869B\":[\"The Eternal Immortality\",16980,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/869\\\"\\u003eCodeforces Round 439 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1741C\":[\"Minimize the Thickness\",19432,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1741\\\"\\u003eCodeforces Round 826 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1862C\":[\"Flower City Fence\",22975,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1862\\\"\\u003eCodeforces Round 894 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-869A\":[\"The Artful Expedient\",10658,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/869\\\"\\u003eCodeforces Round 439 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-735B\":[\"Urbanization\",9411,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/735\\\"\\u003eCodeforces Round 382 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-602A\":[\"Two Bases\",9763,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/602\\\"\\u003eCodeforces Round 333 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-723B\":[\"Text Document Analysis\",11367,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/723\\\"\\u003eCodeforces Round 375 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-488A\":[\"Giga Tower\",15372,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/488\\\"\\u003eCodeforces Round 278 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-682A\":[\"Alyona and Numbers\",25142,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/682\\\"\\u003eCodeforces Round 358 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1904B\":[\"Collecting Game\",24062,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1904\\\"\\u003eCodeforces Round 914 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-370A\":[\"Rook, Bishop and King\",12467,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/370\\\"\\u003eCodeforces Round 217 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1700B\":[\"Palindromic Numbers\",20069,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1700\\\"\\u003eCodeforces Round 802 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1712C\":[\"Sort Zero\",21065,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1712\\\"\\u003eCodeforces Round 813 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1821B\":[\"Sort the Subarray\",24575,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1821\\\"\\u003eEducational Codeforces Round 147 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-382A\":[\"Ksenia and Pan Scales\",14217,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/382\\\"\\u003eCodeforces Round 224 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-883M\":[\"Quadcopter Competition\",4192,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/883\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1942B\":[\"Bessie and MEX\",15453,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1942\\\"\\u003eCodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-12B\":[\"Correct Solution?\",10232,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/12\\\"\\u003eCodeforces Beta Round 12 (Div 2 Only)\\u003c/a\\u003e\"],\"CodeForces-285A\":[\"Slightly Decreasing Permutations\",14427,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/285\\\"\\u003eCodeforces Round 175 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-188D\":[\"Asterisks\",729,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/188\\\"\\u003eSurprise Language Round 6\\u003c/a\\u003e\"],\"CodeForces-1506B\":[\"Partial Replacement\",21600,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1506\\\"\\u003eCodeforces Round 710 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-188A\":[\"Hexagonal Numbers\",826,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/188\\\"\\u003eSurprise Language Round 6\\u003c/a\\u003e\"],\"CodeForces-1869B\":[\"2D Traveling\",22004,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1869\\\"\\u003eCodeforces Round 896 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-12C\":[\"Fruits\",8031,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/12\\\"\\u003eCodeforces Beta Round 12 (Div 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1857B\":[\"Maximum Rounding\",24934,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1857\\\"\\u003eCodeforces Round 891 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1780B\":[\"GCD Partition\",23078,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1780\\\"\\u003eCodeforces Round 846 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-719A\":[\"Vitya in the Countryside\",17208,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/719\\\"\\u003eCodeforces Round 373 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1332A\":[\"Exercising Walk\",20438,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1332\\\"\\u003eCodeforces Round 630 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1574B\":[\"Combinatorics Homework\",18533,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1574\\\"\\u003eEducational Codeforces Round 114 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1085B\":[\"Div Times Mod\",10376,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1085\\\"\\u003eTechnocup 2019 - Elimination Round 4\\u003c/a\\u003e\"],\"CodeForces-544A\":[\"Set of Strings\",9383,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/544\\\"\\u003eCodeforces Round 302 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-556B\":[\"Case of Fake Numbers\",8698,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/556\\\"\\u003eCodeforces Round 310 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-381B\":[\"Sereja and Stairs\",7635,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/381\\\"\\u003eCodeforces Round 223 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1832B\":[\"Maximum Sum\",35820,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1832\\\"\\u003eEducational Codeforces Round 148 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1820B\":[\"JoJo\\u0027s Incredible Adventures\",19735,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1820\\\"\\u003eCodeforces Round 866 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1626B\":[\"Minor Reduction\",23999,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1626\\\"\\u003eEducational Codeforces Round 121 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-296A\":[\"Yaroslav and Permutations\",26155,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/296\\\"\\u003eCodeforces Round 179 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1638B\":[\"Odd Swap Sort\",23326,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1638\\\"\\u003eCodeforces Round 771 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1602B\":[\"Divine Array\",14759,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1602\\\"\\u003eCodeforces Round 751 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1759C\":[\"Thermostat\",19356,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1759\\\"\\u003eCodeforces Round 834 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1670B\":[\"Dorms War\",13353,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1670\\\"\\u003eCodeforces Round 788 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1791E\":[\"Negatives and Positives\",37234,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1791\\\"\\u003eCodeforces Round 849 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-25B\":[\"Phone numbers\",11649,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/25\\\"\\u003eCodeforces Beta Round 25 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-313B\":[\"Ilya and Queries\",57382,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/313\\\"\\u003eCodeforces Round 186 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-609B\":[\"The Best Gift\",10711,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/609\\\"\\u003eEducational Codeforces Round 3\\u003c/a\\u003e\"],\"CodeForces-706B\":[\"Interesting drink\",94677,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/706\\\"\\u003eCodeforces Round 367 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-349A\":[\"Cinema Line\",35562,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/349\\\"\\u003eCodeforces Round 202 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1682B\":[\"AND Sorting\",23652,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1682\\\"\\u003eCodeforces Round 793 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-911A\":[\"Nearest Minimums\",13905,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1060B\":[\"Maximum Sum of Digits\",10081,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1060\\\"\\u003eCodeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-797A\":[\"k-Factorization\",22942,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"CodeForces-785B\":[\"Anton and Classes\",11593,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/785\\\"\\u003eCodeforces Round 404 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1409B\":[\"Minimum Product\",31326,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1409\\\"\\u003eCodeforces Round 667 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1722D\":[\"Line\",26786,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1722\\\"\\u003eCodeforces Round 817 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-162A\":[\"Pentagonal numbers\",830,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/162\\\"\\u003eVK Cup 2012 Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-1366A\":[\"Shovels and Swords\",33723,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1366\\\"\\u003eEducational Codeforces Round 89 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-186A\":[\"Comparing Strings\",18766,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/186\\\"\\u003eCodeforces Round 118 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1637B\":[\"MEX and Array\",15428,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1637\\\"\\u003eCodeforces Global Round 19\\u003c/a\\u003e\"],\"CodeForces-1867B\":[\"XOR Palindromes\",18629,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1867\\\"\\u003eCodeforces Round 897 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-46B\":[\"T-shirts from Sponsor\",4348,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/46\\\"\\u003eSchool Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-174A\":[\"Problem About Equation\",3339,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/174\\\"\\u003eVK Cup 2012 Round 3 (Unofficial Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-1625B\":[\"Elementary Particles\",17111,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1625\\\"\\u003eCodeforces Round 765 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-300A\":[\"Array\",34401,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/300\\\"\\u003eCodeforces Round 181 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1221B\":[\"Knights\",13128,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1221\\\"\\u003eEducational Codeforces Round 73 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-312A\":[\"Whose sentence is it?\",5854,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/312\\\"\\u003eCodeforces Round 185 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-433A\":[\"Kitahara Haruki\\u0027s Gift\",18513,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/433\\\"\\u003eCodeforces Round 248 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1015C\":[\"Songs Compression\",25380,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1015\\\"\\u003eCodeforces Round 501 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-227B\":[\"Effective Approach\",31874,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/227\\\"\\u003eCodeforces Round 140 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1463A\":[\"Dungeon\",28266,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1463\\\"\\u003eEducational Codeforces Round 100 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1342B\":[\"Binary Period\",24827,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1342\\\"\\u003eEducational Codeforces Round 86 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-705B\":[\"Spider Man\",10202,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/705\\\"\\u003eCodeforces Round 366 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-801A\":[\"Vicious Keyboard\",8572,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/801\\\"\\u003eCodeforces Round 409 (rated, Div. 2, based on VK Cup 2017 Round 2)\\u003c/a\\u003e\"],\"CodeForces-675A\":[\"Infinite Sequence\",16445,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/675\\\"\\u003eCodeforces Round 353 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-651A\":[\"Joysticks\",25560,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/651\\\"\\u003eCodeforces Round 345 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1529B\":[\"Sifid and Strange Subsequences\",21383,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1529\\\"\\u003eCodeforces Round 722 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-90B\":[\"African Crossword\",6215,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/90\\\"\\u003eCodeforces Beta Round 74 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-270A\":[\"Fancy Fence\",52070,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/270\\\"\\u003eCodeforces Round 165 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1624C\":[\"Division by Two and Permutation\",27082,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1624\\\"\\u003eCodeforces Round 764 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1842B\":[\"Tenzing and Books\",22072,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1842\\\"\\u003eCodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1038B\":[\"Non-Coprime Partition\",14991,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1038\\\"\\u003eCodeforces Round 508 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-347B\":[\"Fixed Points\",10625,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/347\\\"\\u003eCodeforces Round 201 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-456A\":[\"Laptops\",60333,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/456\\\"\\u003eCodeforces Round 260 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1692D\":[\"The Clock\",21681,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1692\\\"\\u003eCodeforces Round 799 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1365A\":[\"Matrix Game\",25196,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1365\\\"\\u003eCodeforces Round 648 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-946B\":[\"Weird Subtraction Process\",12010,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/946\\\"\\u003eEducational Codeforces Round 39 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-813A\":[\"The Contest\",5574,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"CodeForces-825A\":[\"Binary Protocol\",8513,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-686B\":[\"Little Robber Girl\\u0027s Zoo\",8722,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/686\\\"\\u003eCodeforces Round 359 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1070K\":[\"Video Posts\",5488,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1070\\\"\\u003e2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1407A\":[\"Ahahahahahahahaha\",21576,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1407\\\"\\u003eCodeforces Round 669 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1227A\":[\"Math Problem\",10230,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1227\\\"\\u003eTechnocup 2020 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-120C\":[\"Winnie-the-Pooh and honey\",4256,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-1324B\":[\"Yet Another Palindrome Problem\",32923,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1324C\":[\"Frog Jumps\",31504,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-362B\":[\"Petya and Staircases\",15227,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/362\\\"\\u003eCodeforces Round 212 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-120B\":[\"Quiz League\",3725,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-1910A\":[\"Username\",1938,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1910\\\"\\u003eKotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!)\\u003c/a\\u003e\"],\"CodeForces-253A\":[\"Boys and Girls\",12671,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/253\\\"\\u003eCodeforces Round 154 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1946B\":[\"Maximum Sum\",22933,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1946\\\"\\u003eCodeforces Round 936 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-289A\":[\"Polo the Penguin and Segments\",10471,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/289\\\"\\u003eCodeforces Round 177 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1760E\":[\"Binary Inversions\",23016,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1760\\\"\\u003eCodeforces Round 835 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1421B\":[\"Putting Bricks in the Wall\",13580,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1421\\\"\\u003eCodeforces Round 676 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1675C\":[\"Detective Task\",19493,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1675\\\"\\u003eCodeforces Round 787 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-427B\":[\"Prison Transfer\",16602,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/427\\\"\\u003eCodeforces Round 244 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-548A\":[\"Mike and Fax\",10840,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/548\\\"\\u003eCodeforces Round 305 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-633A\":[\"Ebony and Ivory\",17263,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/633\\\"\\u003eManthan, Codefest 16\\u003c/a\\u003e\"],\"CodeForces-754B\":[\"Ilya and tic-tac-toe game\",8285,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/754\\\"\\u003eCodeforces Round 390 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-984B\":[\"Minesweeper\",8571,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/984\\\"\\u003eCodeforces Round 483 (Div. 2) [Thanks, Botan Investments and Victor Shaburov!]\\u003c/a\\u003e\"],\"CodeForces-1717B\":[\"Madoka and Underground Competitions\",15627,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1717\\\"\\u003eCodeforces Round 818 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1729C\":[\"Jumping on Tiles\",22695,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1729\\\"\\u003eCodeforces Round 820 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1838B\":[\"Minimize Permutation Subarrays\",17571,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1838\\\"\\u003eCodeforces Round 877 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-495A\":[\"Digital Counter\",9573,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/495\\\"\\u003eCodeforces Round 282 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1826B\":[\"Lunatic Never Content\",24203,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1826\\\"\\u003eCodeforces Round 870 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-483A\":[\"Counterexample\",25663,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/483\\\"\\u003eCodeforces Round 275 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-471A\":[\"MUH and Sticks\",14465,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/471\\\"\\u003eCodeforces Round 269 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-592B\":[\"The Monster and the Squirrel\",9334,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/592\\\"\\u003eCodeforces Round 328 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1117A\":[\"Best Subsegment\",11837,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1117\\\"\\u003eEducational Codeforces Round 60 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1921D\":[\"Very Different Array\",23923,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1921\\\"\\u003eCodeforces Round 920 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1335C\":[\"Two Teams Composing\",38770,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1335\\\"\\u003eCodeforces Round 634 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1933C\":[\"Turtle Fingers: Count the Values of k\",25244,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1933\\\"\\u003eCodeforces Round 929 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-252A\":[\"Little Xor\",6464,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/252\\\"\\u003eCodeforces Round 153 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1202A\":[\"You Are Given Two Binary Strings...\",10771,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1202\\\"\\u003eEducational Codeforces Round 70 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1214B\":[\"Badges\",11673,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1214\\\"\\u003eCodeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-1703D\":[\"Double Strings\",29929,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1703\\\"\\u003eCodeforces Round 806 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1105B\":[\"Zuhair and Strings\",10852,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1105\\\"\\u003eCodeforces Round 533 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1836B\":[\"Astrophysicists\",13493,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1836\\\"\\u003eCodeforces Round 880 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-155B\":[\"Combination\",11400,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/155\\\"\\u003eCodeforces Round 109 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1105A\":[\"Salem and Sticks\",12000,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1105\\\"\\u003eCodeforces Round 533 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-402A\":[\"Nuts\",5160,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/402\\\"\\u003eCodeforces Round 236 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1173B\":[\"Nauuo and Chess\",9713,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1173\\\"\\u003eCodeforces Round 564 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1783B\":[\"Matrix of Differences\",19338,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1783\\\"\\u003eEducational Codeforces Round 141 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-789A\":[\"Anastasia and pebbles\",10734,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/789\\\"\\u003eCodeforces Round 407 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-898B\":[\"Proper Nutrition\",11294,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-535B\":[\"Tavas and SaDDas\",31719,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/535\\\"\\u003eCodeforces Round 299 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-765B\":[\"Code obfuscation\",8026,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/765\\\"\\u003eCodeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-82A\":[\"Double Cola\",33921,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/82\\\"\\u003eYandex.Algorithm 2011: Qualification 2\\u003c/a\\u003e\"],\"CodeForces-1685A\":[\"Circular Local MiniMax\",18600,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1685\\\"\\u003eCodeforces Round 794 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1811C\":[\"Restore the Array\",22240,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1811\\\"\\u003eCodeforces Round 863 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1334B\":[\"Middle Class\",28018,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1334\\\"\\u003eEducational Codeforces Round 85 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1920B\":[\"Summation Game\",23127,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1920\\\"\\u003eCodeforces Round 919 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1213B\":[\"Bad Prices\",35849,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1932B\":[\"Chaya Calendar\",23845,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1932\\\"\\u003eCodeforces Round 927 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1702C\":[\"Train and Queries\",25281,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1702\\\"\\u003eCodeforces Round 805 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1944B\":[\"Equal XOR\",18128,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1944\\\"\\u003eCodeforces Round 934 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-166A\":[\"Rank List\",22811,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/166\\\"\\u003eCodeforces Round 113 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1726B\":[\"Mainak and Interesting Sequence\",16792,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1726\\\"\\u003eCodeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022\\u003c/a\\u003e\"],\"CodeForces-287A\":[\"IQ Test\",22392,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/287\\\"\\u003eCodeforces Round 176 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1099B\":[\"Squares and Segments\",12014,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1099\\\"\\u003eCodeforces Round 530 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1455C\":[\"Ping-pong\",20789,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1455\\\"\\u003eEducational Codeforces Round 99 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1673B\":[\"A Perfectly Balanced String?\",19057,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1673\\\"\\u003eCodeforces Round 785 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1293A\":[\"ConneR and the A.R.C. Markland-N\",16674,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1293\\\"\\u003eCodeforces Round 614 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1891B\":[\"Deja Vu\",24955,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1891\\\"\\u003eCodeforces Round 907 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-558A\":[\"Lala Land and Apple Trees\",12147,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/558\\\"\\u003eCodeforces Round 312 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-667A\":[\"Pouring Rain\",8990,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/667\\\"\\u003eCodeforces Round 349 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-534A\":[\"Exam\",14477,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/534\\\"\\u003eCodeforces Round 298 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-667B\":[\"Coat of Anticubism\",6373,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/667\\\"\\u003eCodeforces Round 349 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-522B\":[\"Photo to Remember\",9822,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/522\\\"\\u003eVK Cup 2015 - Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-7A\":[\"Kalevitch and Chess\",8743,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/7\\\"\\u003eCodeforces Beta Round 7\\u003c/a\\u003e\"],\"CodeForces-1509B\":[\"TMT Document\",23095,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1509\\\"\\u003eCodeforces Round 715 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1739B\":[\"Array Recovery\",24647,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1739\\\"\\u003eEducational Codeforces Round 136 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1606B\":[\"Update Files\",19678,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1606\\\"\\u003eEducational Codeforces Round 116 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1618C\":[\"Paint the Array\",29319,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1618\\\"\\u003eCodeforces Round 760 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1478B\":[\"Nezzar and Lucky Number\",19639,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1478\\\"\\u003eCodeforces Round 698 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1575A\":[\"Another Sorting Problem\",5223,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1575\\\"\\u003eCOMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1345B\":[\"Card Constructions\",28771,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1345\\\"\\u003eCodeforces Round 639 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1604B\":[\"XOR Specia-LIS-t\",16416,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1604\\\"\\u003eCodeforces Round 752 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1616B\":[\"Mirror in the String\",20682,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1616\\\"\\u003eGood Bye 2021: 2022 is NEAR\\u003c/a\\u003e\"],\"CodeForces-39D\":[\"Cubical Planet\",4674,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/39\\\"\\u003eSchool Team Contest 1 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-902A\":[\"Visiting a Friend\",10928,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/902\\\"\\u003eCodeforces Round 453 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1333B\":[\"Kind Anton\",22561,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1333\\\"\\u003eCodeforces Round 632 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1793B\":[\"Fedya and Array\",17003,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1793\\\"\\u003eCodeforces Round 852 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-218B\":[\"Airport\",18582,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/218\\\"\\u003eCodeforces Round 134 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-938B\":[\"Run For Your Prize\",9968,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/938\\\"\\u003eEducational Codeforces Round 38 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1672C\":[\"Unequal Array\",13981,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1672\\\"\\u003eCodeforces Global Round 20\\u003c/a\\u003e\"],\"CodeForces-218A\":[\"Mountain Scenery\",10599,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/218\\\"\\u003eCodeforces Round 134 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-6B\":[\"President\\u0027s Office\",15441,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/6\\\"\\u003eCodeforces Beta Round 6 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-557A\":[\"Ilya and Diplomas\",9485,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/557\\\"\\u003eCodeforces Round 311 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-799A\":[\"Carrot Cakes\",21755,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/799\\\"\\u003ePlayrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-545B\":[\"Equidistant String\",13442,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/545\\\"\\u003eCodeforces Round 303 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-884B\":[\"Japanese Crosswords Strike Back\",8044,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/884\\\"\\u003eEducational Codeforces Round 31\\u003c/a\\u003e\"],\"CodeForces-630C\":[\"Lucky Numbers\",27649,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-630D\":[\"Hexagons!\",13054,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-630J\":[\"Divisibility\",13734,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-1304B\":[\"Longest Palindrome\",19697,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1304\\\"\\u003eCodeforces Round 620 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1534B\":[\"Histogram Ugliness\",12902,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1534\\\"\\u003eCodeforces LATOKEN Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1413B\":[\"A New Technique\",12054,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1413\\\"\\u003eTechnocup 2021 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1401B\":[\"Ternary Sequence\",22325,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1401\\\"\\u003eCodeforces Round 665 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1631B\":[\"Fun with Even Subarrays\",24253,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1631\\\"\\u003eCodeforces Round 768 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1788B\":[\"Sum of Two Numbers\",22548,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1788\\\"\\u003eCodeforces Round 851 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-100A\":[\"Carpeting the Room\",1063,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/100\\\"\\u003eUnknown Language Round 3\\u003c/a\\u003e\"],\"CodeForces-463B\":[\"Caisa and Pylons\",30997,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/463\\\"\\u003eCodeforces Round 264 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1902B\":[\"Getting Points\",16539,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1902\\\"\\u003eEducational Codeforces Round 159 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1914C\":[\"Quests\",34651,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1914\\\"\\u003eCodeforces Round 916 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-136B\":[\"Ternary Logic\",5479,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/136\\\"\\u003eCodeforces Beta Round 97 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-245B\":[\"Internet Address\",5954,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/245\\\"\\u003eCROC-MBTU 2012, Elimination Round (ACM-ICPC)\\u003c/a\\u003e\"],\"CodeForces-1263A\":[\"Sweet Problem\",18234,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1263\\\"\\u003eCodeforces Round 603 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-366A\":[\"Dima and Guards\",5105,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/366\\\"\\u003eCodeforces Round 214 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1033B\":[\"Square Difference\",12685,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1033\\\"\\u003eLyft Level 5 Challenge 2018 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1166B\":[\"All the Vowels Please\",12293,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1166\\\"\\u003eCodeforces Round 561 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-257A\":[\"Sockets\",7167,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/257\\\"\\u003eCodeforces Round 159 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1481B\":[\"New Colony\",20307,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1481\\\"\\u003eCodeforces Round 699 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1360C\":[\"Similar Pairs\",36792,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1360\\\"\\u003eCodeforces Round 644 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1873E\":[\"Building an Aquarium\",39925,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1873\\\"\\u003eCodeforces Round 898 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-638A\":[\"Home Numbers\",4447,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/638\\\"\\u003eVK Cup 2016 - Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-505A\":[\"Mr. Kitayuta\\u0027s Gift\",8043,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/505\\\"\\u003eCodeforces Round 286 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-758B\":[\"Blown Garland\",11227,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/758\\\"\\u003eCodeforces Round 392 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-988B\":[\"Substrings Sort\",22108,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/988\\\"\\u003eCodeforces Round 486 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-475A\":[\"Bayan Bus\",5497,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/475\\\"\\u003eBayan 2015 Contest Warm Up\\u003c/a\\u003e\"],\"CodeForces-596A\":[\"Wilbur and Swimming Pool\",8740,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/596\\\"\\u003eCodeforces Round 331 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-596B\":[\"Wilbur and Array\",11734,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/596\\\"\\u003eCodeforces Round 331 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-192B\":[\"Walking in the Rain\",7031,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/192\\\"\\u003eCodeforces Round 121 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1557B\":[\"Moamen and k-subarrays\",24732,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1557\\\"\\u003eCodeforces Round 737 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1884B\":[\"Haunted House\",15117,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1884\\\"\\u003eCodeforces Round 904 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1787B\":[\"Number Factorization\",14710,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1787\\\"\\u003eTypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-53A\":[\"Autocomplete\",6131,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/53\\\"\\u003eCodeforces Beta Round 49 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1327A\":[\"Sum of Odd Integers\",46640,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1327\\\"\\u003eEducational Codeforces Round 84 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1901B\":[\"Chip and Ribbon\",17880,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1901\\\"\\u003eEducational Codeforces Round 158 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-365B\":[\"The Fibonacci Segment\",16106,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/365\\\"\\u003eCodeforces Round 213 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-365A\":[\"Good Number\",26056,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/365\\\"\\u003eCodeforces Round 213 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1395B\":[\"Boboniu Plays Chess\",16506,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1395\\\"\\u003eCodeforces Round 664 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-389B\":[\"Fox and Cross\",7943,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/389\\\"\\u003eCodeforces Round 228 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1165A\":[\"Remainder\",15283,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1165\\\"\\u003eCodeforces Round 560 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1189B\":[\"Number Circle\",16028,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1189\\\"\\u003eCodeforces Round 572 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1492B\":[\"Card Deck\",24334,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1492\\\"\\u003eCodeforces Round 704 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-159B\":[\"Matchmaker\",4297,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/159\\\"\\u003eVK Cup 2012 Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-1872C\":[\"Non-coprime Split\",27318,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1872\\\"\\u003eCodeforces Round 895 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-987B\":[\"High School: Become Human\",13533,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/987\\\"\\u003eCodeforces Round 485 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-975B\":[\"Mancala\",7455,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/975\\\"\\u003eCodeforces Round 478 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-648C\":[\"Путь Робота\",1231,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/648\\\"\\u003eТехнокубок 2016 - Отборочный Раунд 1\\u003c/a\\u003e\"],\"CodeForces-624B\":[\"Making a String\",8869,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/624\\\"\\u003eAIM Tech Round (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-733B\":[\"Parade\",11778,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/733\\\"\\u003eCodeforces Round 378 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-721B\":[\"Passwords\",13306,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/721\\\"\\u003eCodeforces Round 374 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-842B\":[\"Gleb And Pizza\",11964,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/842\\\"\\u003eCodeforces Round 430 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1829E\":[\"The Lakes\",27276,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1829\\\"\\u003eCodeforces Round 871 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1708B\":[\"Difference of GCDs\",25403,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1708\\\"\\u003eCodeforces Round 808 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1108B\":[\"Divisors of Two Integers\",26815,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1108\\\"\\u003eCodeforces Round 535 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-110B\":[\"Lucky String\",11622,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/110\\\"\\u003eCodeforces Beta Round 84 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-158B\":[\"Taxi\",111204,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/158\\\"\\u003eVK Cup 2012 Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-1176B\":[\"Merge it!\",19376,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1176\\\"\\u003eCodeforces Round 565 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1382B\":[\"Sequential Nim\",26834,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1382\\\"\\u003eCodeforces Round 658 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-919B\":[\"Perfect Number\",33513,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/919\\\"\\u003eCodeforces Round 460 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1370B\":[\"GCD Compression\",25669,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1370\\\"\\u003eCodeforces Round 651 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-405B\":[\"Domino Effect\",6435,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/405\\\"\\u003eCodeforces Round 238 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1762B\":[\"Make Array Good\",18366,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1762\\\"\\u003eCodeforces Round 838 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-527A\":[\"Playing with Paper\",17212,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/527\\\"\\u003eCodeforces Round 296 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-877A\":[\"Alex and broken contest\",12662,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-635A\":[\"Orchestra\",3281,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/635\\\"\\u003e8VC Venture Cup 2016 - Final Round (Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-841B\":[\"Godsend\",13955,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/841\\\"\\u003eCodeforces Round 429 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-950B\":[\"Intercepted Message\",8694,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/950\\\"\\u003eCodeforces Round 469 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-570A\":[\"Elections\",15242,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/570\\\"\\u003eCodeforces Round 316 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-190A\":[\"Vasya and the Bus\",6547,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/190\\\"\\u003eCodeforces Round 120 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1797B\":[\"Li Hua and Pattern\",21222,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1797\\\"\\u003eCodeforces Round 864 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1579B\":[\"Shifting Sort\",19152,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1579\\\"\\u003eCodeforces Round 744 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1119A\":[\"Ilya and a Colorful Walk\",12934,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1119\\\"\\u003eCodeforces Global Round 2\\u003c/a\\u003e\"],\"CodeForces-242B\":[\"Big Segment\",17705,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/242\\\"\\u003eCodeforces Round 149 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-363B\":[\"Fence\",67710,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/363\\\"\\u003eCodeforces Round 211 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-242A\":[\"Heads or Tails\",7018,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/242\\\"\\u003eCodeforces Round 149 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1923B\":[\"Monsters Attack!\",19546,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1923\\\"\\u003eEducational Codeforces Round 162 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-121A\":[\"Lucky Sum\",12033,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/121\\\"\\u003eCodeforces Beta Round 91 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-169B\":[\"Replacing Digits\",3887,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/169\\\"\\u003eVK Cup 2012 Round 2 (Unofficial Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-1066A\":[\"Vova and Train\",16935,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1066\\\"\\u003eCodeforces Round 515 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1030B\":[\"Vasya and Cornfield\",13492,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1030\\\"\\u003eTechnocup 2019 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1676E\":[\"Eating Queries\",34313,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1676\\\"\\u003eCodeforces Round 790 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1042A\":[\"Benches\",15391,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1042\\\"\\u003eCodeforces Round 510 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-767A\":[\"Snacktower\",23753,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/767\\\"\\u003eCodeforces Round 398 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-779B\":[\"Weird Rounding\",11299,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/779\\\"\\u003eCodeforces Round 402 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-525A\":[\"Vitaliy and Pie\",17115,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/525\\\"\\u003eCodeforces Round 297 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-985A\":[\"Chess Placing\",9006,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/985\\\"\\u003eEducational Codeforces Round 44 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-755B\":[\"PolandBall and Game\",14022,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/755\\\"\\u003e8VC Venture Cup 2017 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-501B\":[\"Misha and Changing Handles\",23877,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/501\\\"\\u003eCodeforces Round 285 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-731B\":[\"Coupons and Discounts\",8898,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/731\\\"\\u003eCodeforces Round 376 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1490C\":[\"Sum of Cubes\",39260,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1490\\\"\\u003eCodeforces Round 702 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1706B\":[\"Making Towers\",17420,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1706\\\"\\u003eCodeforces Round 809 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1609B\":[\"William the Vigilant\",12302,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1609\\\"\\u003eDeltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1948B\":[\"Array Fix\",26304,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1948\\\"\\u003eEducational Codeforces Round 163 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1827A\":[\"Counting Orders\",24924,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1827\\\"\\u003eCodeforces Round 873 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1839B\":[\"Lamps\",16364,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/1839\\\"\\u003eCodeforces Round 876 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-581B\":[\"Luxurious Houses\",14221,\"\\u003ca href\\u003d\\\"https://codeforces.com/contest/581\\\"\\u003eCodeforces Round 322 (Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"collectingGroups":[[24409,"jxnu-art","JXNU-软院ART","https://cdn.vjudge.net.cn/group/logo/24409?v\u003d1731325483",true],[19231,"acallacall","ECUT-Acm","https://cdn.vjudge.net.cn/group/logo/19231?v\u003d1735719876",true],[23286,"algorithm-learning","守矢神社三幻神-算法竞赛小分队","https://cn.cravatar.com/avatar/28eca72ce51ee83131d6ee25c2e7f413?d\u003dretro",false]],"author":"ExtractStars","updateTime":1713880160000,"title":"CodeForces rating 1100 题目集","dislikeCnt":0,"content":"[problem:CodeForces-158B] Taxi,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-706B] Interesting drink二分搜索（binary search）,动态规划（dp）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-363B] Fence暴力枚举（brute force）,动态规划（dp）\n[problem:CodeForces-456A] Laptops排序算法（sortings）\n[problem:CodeForces-270A] Fancy Fence计算几何（geometry）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-313B] Ilya and Queries动态规划（dp）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-368B] Sereja and Suffixes数据结构（data structures）,动态规划（dp）\n[problem:CodeForces-519B] A and B and Compilation Errors数据结构（data structures）,实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-1327A] Sum of Odd Integers数学（math）\n[problem:CodeForces-467B] Fedor and New Game位掩码（bitmasks）,暴力枚举（brute force）,构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1335C] Two Teams Composing二分搜索（binary search）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-1360C] Similar Pairs构造算法（constructive algorithms）,图匹配（graph matchings）,贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-1490C] Sum of Cubes二分搜索（binary search）,暴力枚举（brute force）,暴力枚举（brute force）,数学（math）\n[problem:CodeForces-1472C] Long Jumps动态规划（dp）,图论（graphs）\n[problem:CodeForces-82A] Double Cola实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1366A] Shovels and Swords二分搜索（binary search）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-349A] Cinema Line贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1409B] Minimum Product暴力枚举（brute force）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-1324B] Yet Another Palindrome Problem暴力枚举（brute force）,字符串处理（strings）\n[problem:CodeForces-1324C] Frog Jumps二分搜索（binary search）,数据结构（data structures）,深度优先搜索及其变种（dfs and similar）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-919B] Perfect Number二分搜索（binary search）,暴力枚举（brute force）,动态规划（dp）,实现问题，编程技巧，模拟（implementation）,数论（number theory）\n[problem:CodeForces-227B] Effective Approach实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-463B] Caisa and Pylons暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1213B] Bad Prices数据结构（data structures）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1345B] Card Constructions二分搜索（binary search）,暴力枚举（brute force）,动态规划（dp）,数学（math）\n[problem:CodeForces-1791E] Negatives and Positives动态规划（dp）,贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-224A] Parallelepiped暴力枚举（brute force）,计算几何（geometry）,数学（math）\n[problem:CodeForces-1334B] Middle Class贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-478A] Initial Bet实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1676E] Eating Queries二分搜索（binary search）,贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-1463A] Dungeon二分搜索（binary search）,数学（math）\n[problem:CodeForces-1703D] Double Strings暴力枚举（brute force）,数据结构（data structures）,字符串处理（strings）\n[problem:CodeForces-1624C] Division by Two and Permutation构造算法（constructive algorithms）,流（flows）,图匹配（graph matchings）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-1382B] Sequential Nim动态规划（dp）,博弈论（games）\n[problem:CodeForces-1365A] Matrix Game博弈论（games）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1342B] Binary Period构造算法（constructive algorithms）,字符串处理（strings）\n[problem:CodeForces-1370B] GCD Compression构造算法（constructive algorithms）,数学（math）,数论（number theory）\n[problem:CodeForces-1669F] Eating Candies二分搜索（binary search）,数据结构（data structures）,贪心策略（greedy）,双指针算法（two pointers）\n[problem:CodeForces-1557B] Moamen and k-subarrays贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-1873E] Building an Aquarium二分搜索（binary search）,排序算法（sortings）\n[problem:CodeForces-651A] Joysticks动态规划（dp）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1108B] Divisors of Two Integers暴力枚举（brute force）,贪心策略（greedy）,数学（math）,数论（number theory）\n[problem:CodeForces-1626B] Minor Reduction贪心策略（greedy）,字符串处理（strings）\n[problem:CodeForces-1722D] Line贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-483A] Counterexample暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,数学（math）,数论（number theory）\n[problem:CodeForces-1511C] Yet Another Card Deck暴力枚举（brute force）,数据结构（data structures）,实现问题，编程技巧，模拟（implementation）,树形结构（trees）\n[problem:CodeForces-258A] Little Elephant and Bits贪心策略（greedy）,数学（math）\n[problem:CodeForces-1857B] Maximum Rounding贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1547C] Pair Programming贪心策略（greedy）,双指针算法（two pointers）\n[problem:CodeForces-1511B] GCD Length构造算法（constructive algorithms）,数学（math）,数论（number theory）\n[problem:CodeForces-296A] Yaroslav and Permutations贪心策略（greedy）,数学（math）\n[problem:CodeForces-300A] Array暴力枚举（brute force）,构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1872C] Non-coprime Split数学（math）,数论（number theory）\n[problem:CodeForces-535B] Tavas and SaDDas位掩码（bitmasks）,暴力枚举（brute force）,组合数学（combinatorics）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1742D] Coprime暴力枚举（brute force）,贪心策略（greedy）,数论（number theory）\n[problem:CodeForces-1702C] Train and Queries数据结构（data structures）,贪心策略（greedy）\n[problem:CodeForces-1840B] Binary Cafe位掩码（bitmasks）,组合数学（combinatorics）,数学（math）\n[problem:CodeForces-1739B] Array Recovery构造算法（constructive algorithms）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-1618C] Paint the Array数学（math）\n[problem:CodeForces-1333B] Kind Anton贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1509B] TMT Document贪心策略（greedy）\n[problem:CodeForces-1669D] Colorful Stamp实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1401B] Ternary Sequence构造算法（constructive algorithms）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-1850E] Cardboard for Pictures二分搜索（binary search）,计算几何（geometry）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1914C] Quests贪心策略（greedy）,数学（math）\n[problem:CodeForces-682A] Alyona and Numbers构造算法（constructive algorithms）,数学（math）,数论（number theory）\n[problem:CodeForces-1638B] Odd Swap Sort数据结构（data structures）,数学（math）,排序算法（sortings）\n[problem:CodeForces-630C] Lucky Numbers组合数学（combinatorics）,数学（math）\n[problem:CodeForces-1529B] Sifid and Strange Subsequences贪心策略（greedy）,数学（math）,排序算法（sortings）\n[problem:CodeForces-1933C] Turtle Fingers: Count the Values of k暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,数学（math）,数论（number theory）\n[problem:CodeForces-1407A] Ahahahahahahahaha构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-1948B] Array Fix暴力枚举（brute force）,动态规划（dp）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1506B] Partial Replacement贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1921D] Very Different Array数据结构（data structures）,贪心策略（greedy）,排序算法（sortings）,双指针算法（two pointers）\n[problem:CodeForces-1428C] ABBB暴力枚举（brute force）,数据结构（data structures）,贪心策略（greedy）,字符串处理（strings）\n[problem:CodeForces-1633C] Kill the Monster暴力枚举（brute force）,数学（math）\n[problem:CodeForces-1862C] Flower City Fence二分搜索（binary search）,数据结构（data structures）,实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-1832B] Maximum Sum暴力枚举（brute force）,排序算法（sortings）,双指针算法（two pointers）\n[problem:CodeForces-1708B] Difference of GCDs构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-66B] Petya and Countryside暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1729C] Jumping on Tiles构造算法（constructive algorithms）,字符串处理（strings）\n[problem:CodeForces-1631B] Fun with Even Subarrays动态规划（dp）,贪心策略（greedy）\n[problem:CodeForces-1455C] Ping-pong构造算法（constructive algorithms）,博弈论（games）,数学（math）\n[problem:CodeForces-1950D] Product of Binary Decimals暴力枚举（brute force）,动态规划（dp）,实现问题，编程技巧，模拟（implementation）,数论（number theory）\n[problem:CodeForces-1712C] Sort Zero贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-1788B] Sum of Two Numbers构造算法（constructive algorithms）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,数学（math）,概率论（probabilities）\n[problem:CodeForces-767A] Snacktower数据结构（data structures）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1917B] Erase First or Second Letter暴力枚举（brute force）,组合数学（combinatorics）,数据结构（data structures）,动态规划（dp）,字符串处理（strings）\n[problem:CodeForces-1471B] Strange List暴力枚举（brute force）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1760E] Binary Inversions数据结构（data structures）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-1920B] Summation Game博弈论（games）,贪心策略（greedy）,数学（math）,排序算法（sortings）\n[problem:CodeForces-1332A] Exercising Walk贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1616B] Mirror in the String贪心策略（greedy）,字符串处理（strings）\n[problem:CodeForces-1481B] New Colony暴力枚举（brute force）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1426C] Increase and Copy二分搜索（binary search）,构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-1811C] Restore the Array构造算法（constructive algorithms）,贪心策略（greedy）\n[problem:CodeForces-1594B] Special Numbers位掩码（bitmasks）,数学（math）\n[problem:CodeForces-287A] IQ Test暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1692D] The Clock暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1743C] Save the Magazines构造算法（constructive algorithms）,动态规划（dp）,贪心策略（greedy）\n[problem:CodeForces-1700B] Palindromic Numbers构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1606B] Update Files贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1492B] Card Deck数据结构（data structures）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-1932B] Chaya Calendar数论（number theory）\n[problem:CodeForces-1829E] The Lakes深度优先搜索及其变种（dfs and similar）,并查集（dsu）,图论（graphs）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1375A] Sign Flipping构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-1478B] Nezzar and Lucky Number暴力枚举（brute force）,动态规划（dp）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-1899C] Yarik and Array动态规划（dp）,贪心策略（greedy）,双指针算法（two pointers）\n[problem:CodeForces-1899B] 250 Thousand Tons of TNT暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,数论（number theory）\n[problem:CodeForces-1288A] Deadline二分搜索（binary search）,暴力枚举（brute force）,数学（math）,三分搜索（ternary search）\n[problem:CodeForces-988B] Substrings Sort排序算法（sortings）,字符串处理（strings）\n[problem:CodeForces-799A] Carrot Cakes暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1579B] Shifting Sort实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-1675C] Detective Task实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1656B] Subtract Operation数据结构（data structures）,贪心策略（greedy）,数学（math）,双指针算法（two pointers）\n[problem:CodeForces-1304B] Longest Palindrome暴力枚举（brute force）,构造算法（constructive algorithms）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-1827A] Counting Orders组合数学（combinatorics）,数学（math）,排序算法（sortings）,双指针算法（two pointers）\n[problem:CodeForces-1946B] Maximum Sum动态规划（dp）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-365A] Good Number实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1015C] Songs Compression排序算法（sortings）\n[problem:CodeForces-1496B] Max and Mex数学（math）\n[problem:CodeForces-1741C] Minimize the Thickness暴力枚举（brute force）,贪心策略（greedy）,数学（math）,双指针算法（two pointers）\n[problem:CodeForces-1783B] Matrix of Differences构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-1682B] AND Sorting位掩码（bitmasks）,构造算法（constructive algorithms）,排序算法（sortings）\n[problem:CodeForces-1574B] Combinatorics Homework组合数学（combinatorics）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-1759C] Thermostat贪心策略（greedy）,数学（math）,最短路算法（shortest paths）\n[problem:CodeForces-1821B] Sort the Subarray暴力枚举（brute force）,贪心策略（greedy）\n[problem:CodeForces-1176B] Merge it!数学（math）\n[problem:CodeForces-1288B] Yet Another Meme Problem数学（math）\n[problem:CodeForces-166A] Rank List二分搜索（binary search）,实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-1731B] Kill Demodogs贪心策略（greedy）,数学（math）\n[problem:CodeForces-1780B] GCD Partition暴力枚举（brute force）,贪心策略（greedy）,数学（math）,数论（number theory）\n[problem:CodeForces-1685A] Circular Local MiniMax构造算法（constructive algorithms）,贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-1706B] Making Towers动态规划（dp）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-186A] Comparing Strings实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-1762B] Make Array Good构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）,数论（number theory）,排序算法（sortings）\n[problem:CodeForces-1923B] Monsters Attack!动态规划（dp）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1263A] Sweet Problem数学（math）\n[problem:CodeForces-1625B] Elementary Particles暴力枚举（brute force）,贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-1838B] Minimize Permutation Subarrays构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-1395B] Boboniu Plays Chess构造算法（constructive algorithms）\n[problem:CodeForces-1867B] XOR Palindromes位掩码（bitmasks）,构造算法（constructive algorithms）,字符串处理（strings）\n[problem:CodeForces-433A] Kitahara Haruki\u0027s Gift暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-218B] Airport实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-43B] Letter实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-1826B] Lunatic Never Content数学（math）,数论（number theory）\n[problem:CodeForces-1891B] Deja Vu暴力枚举（brute force）,数学（math）,排序算法（sortings）\n[problem:CodeForces-501B] Misha and Changing Handles数据结构（data structures）,并查集（dsu）,字符串处理（strings）\n[problem:CodeForces-1842B] Tenzing and Books位掩码（bitmasks）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-1604B] XOR Specia-LIS-t\n[problem:CodeForces-719A] Vitya in the Countryside实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1157A] Reachable Numbers实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1793B] Fedya and Array构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-242B] Big Segment实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-1905B] Begginer\u0027s Zelda贪心策略（greedy）,树形结构（trees）\n[problem:CodeForces-1293A] ConneR and the A.R.C. Markland-N二分搜索（binary search）,暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-675A] Infinite Sequence数学（math）\n[problem:CodeForces-1864B] Swap and Reverse构造算法（constructive algorithms）,贪心策略（greedy）,排序算法（sortings）,字符串处理（strings）\n[problem:CodeForces-1610B] Kalindrome Array贪心策略（greedy）,双指针算法（two pointers）\n[problem:CodeForces-1637B] MEX and Array暴力枚举（brute force）,动态规划（dp）,贪心策略（greedy）,数学（math）\n[problem:CodeForces-1726B] Mainak and Interesting Sequence位掩码（bitmasks）,构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-1863B] Split Sort贪心策略（greedy）,数学（math）,排序算法（sortings）\n[problem:CodeForces-1717B] Madoka and Underground Competitions构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1839B] Lamps贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-1797B] Li Hua and Pattern构造算法（constructive algorithms）,贪心策略（greedy）\n[problem:CodeForces-1417B] Two Arrays贪心策略（greedy）,数学（math）,排序算法（sortings）\n[problem:CodeForces-1869B] 2D Traveling计算几何（geometry）,数学（math）,最短路算法（shortest paths）,排序算法（sortings）\n[problem:CodeForces-1066A] Vova and Train数学（math）\n[problem:CodeForces-1673B] A Perfectly Balanced String?暴力枚举（brute force）,贪心策略（greedy）,字符串处理（strings）\n[problem:CodeForces-527A] Playing with Paper实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-488A] Giga Tower暴力枚举（brute force）\n[problem:CodeForces-365B] The Fibonacci Segment实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1901B] Chip and Ribbon贪心策略（greedy）,数学（math）\n[problem:CodeForces-1623B] Game on Ranges暴力枚举（brute force）,深度优先搜索及其变种（dfs and similar）,实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-797A] k-Factorization实现问题，编程技巧，模拟（implementation）,数学（math）,数论（number theory）\n[problem:CodeForces-1944B] Equal XOR位掩码（bitmasks）,构造算法（constructive algorithms）\n[problem:CodeForces-525A] Vitaliy and Pie贪心策略（greedy）,哈希表（hashing）,字符串处理（strings）\n[problem:CodeForces-1602B] Divine Array构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-570A] Elections实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-427B] Prison Transfer数据结构（data structures）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-259B] Little Elephant and Magic Square暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1189B] Number Circle贪心策略（greedy）,数学（math）,排序算法（sortings）\n[problem:CodeForces-160B] Unlucky Ticket贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-362B] Petya and Staircases实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-1165A] Remainder实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-116B] Little Pigs and Wolves贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-471A] MUH and Sticks实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1863C] MEX Repetition实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1820B] JoJo\u0027s Incredible Adventures数学（math）,字符串处理（strings）,双指针算法（two pointers）\n[problem:CodeForces-1902B] Getting Points二分搜索（binary search）,暴力枚举（brute force）,贪心策略（greedy）\n[problem:CodeForces-285A] Slightly Decreasing Permutations贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1038B] Non-Coprime Partition构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-1672C] Unequal Array构造算法（constructive algorithms）,贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-581B] Luxurious Houses实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1421B] Putting Bricks in the Wall构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-869B] The Eternal Immortality数学（math）\n[problem:CodeForces-1904B] Collecting Game二分搜索（binary search）,动态规划（dp）,贪心策略（greedy）,排序算法（sortings）,双指针算法（two pointers）\n[problem:CodeForces-1787B] Number Factorization贪心策略（greedy）,数学（math）,数论（number theory）\n[problem:CodeForces-1042A] Benches二分搜索（binary search）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1670B] Dorms War暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-1534B] Histogram Ugliness贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-633A] Ebony and Ivory暴力枚举（brute force）,数学（math）,数论（number theory）\n[problem:CodeForces-1836B] Astrophysicists贪心策略（greedy）,数学（math）\n[problem:CodeForces-6B] President\u0027s Office实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-534A] Exam构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1415B] Repainting Street暴力枚举（brute force）,暴力枚举（brute force）,贪心策略（greedy）\n[problem:CodeForces-721B] Passwords实现问题，编程技巧，模拟（implementation）,数学（math）,排序算法（sortings）,字符串处理（strings）\n[problem:CodeForces-1523B] Lord of the Values构造算法（constructive algorithms）\n[problem:CodeForces-841B] Godsend博弈论（games）,数学（math）\n[problem:CodeForces-1942B] Bessie and MEX构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-1030B] Vasya and Cornfield计算几何（geometry）\n[problem:CodeForces-382A] Ksenia and Pan Scales贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1255B] Fridge Lockers图论（graphs）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1413B] A New Technique实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1884B] Haunted House二分搜索（binary search）,贪心策略（greedy）,数学（math）,双指针算法（two pointers）\n[problem:CodeForces-1221B] Knights构造算法（constructive algorithms）,贪心策略（greedy）\n[problem:CodeForces-1609B] William the Vigilant实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-545B] Equidistant String贪心策略（greedy）\n[problem:CodeForces-987B] High School: Become Human数学（math）\n[problem:CodeForces-911A] Nearest Minimums实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1166B] All the Vowels Please构造算法（constructive algorithms）,数学（math）,数论（number theory）\n[problem:CodeForces-225A] Dice Tower构造算法（constructive algorithms）,贪心策略（greedy）\n[problem:CodeForces-1099B] Squares and Segments二分搜索（binary search）,构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-253A] Boys and Girls贪心策略（greedy）\n[problem:CodeForces-755B] PolandBall and Game二分搜索（binary search）,数据结构（data structures）,博弈论（games）,贪心策略（greedy）,排序算法（sortings）,字符串处理（strings）\n[problem:CodeForces-835B] The number on the board贪心策略（greedy）\n[problem:CodeForces-1105A] Salem and Sticks暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1117A] Best Subsegment实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-877A] Alex and broken contest实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-714A] Meeting of Old Friends实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-946B] Weird Subtraction Process数学（math）,数论（number theory）\n[problem:CodeForces-630J] Divisibility数学（math）,数论（number theory）\n[problem:CodeForces-733B] Parade数学（math）\n[problem:CodeForces-1214B] Badges暴力枚举（brute force）,数学（math）\n[problem:CodeForces-1119A] Ilya and a Colorful Walk贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-596B] Wilbur and Array贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-779B] Weird Rounding暴力枚举（brute force）,贪心策略（greedy）\n[problem:CodeForces-558A] Lala Land and Apple Trees暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-785B] Anton and Classes贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-758B] Blown Garland暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,数论（number theory）\n[problem:CodeForces-155B] Combination贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-723B] Text Document Analysis表达式解析（expression parsing）,实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-842B] Gleb And Pizza计算几何（geometry）\n[problem:CodeForces-110B] Lucky String构造算法（constructive algorithms）,字符串处理（strings）\n[problem:CodeForces-370A] Rook,Bishop and King图论（graphs）,数学（math）,最短路算法（shortest paths）\n[problem:CodeForces-548A] Mike and Fax暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-1105B] Zuhair and Strings暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-630D] Hexagons!数学（math）\n[problem:CodeForces-902A] Visiting a Friend贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-712B] Memory and Trident实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-1227A] Math Problem数学（math）\n[problem:CodeForces-869A] The Artful Expedient暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1132A] Regular Bracket Sequence贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-355A] Vasya and Digital Root构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-25B] Phone numbers实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-898B] Proper Nutrition暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,数论（number theory）\n[problem:CodeForces-789A] Anastasia and pebbles实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-1085B] Div Times Mod数学（math）\n[problem:CodeForces-1033B] Square Difference数学（math）,数论（number theory）\n[problem:CodeForces-347B] Fixed Points暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-705B] Spider Man博弈论（games）,数学（math）\n[problem:CodeForces-218A] Mountain Scenery暴力枚举（brute force）,构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-121A] Lucky Sum实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-609B] The Best Gift构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1060B] Maximum Sum of Digits贪心策略（greedy）\n[problem:CodeForces-1202A] You Are Given Two Binary Strings...位掩码（bitmasks）,贪心策略（greedy）\n[problem:CodeForces-1173B] Nauuo and Chess构造算法（constructive algorithms）,贪心策略（greedy）\n[problem:CodeForces-938B] Run For Your Prize暴力枚举（brute force）,贪心策略（greedy）\n[problem:CodeForces-792A] New Bus Route实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-289A] Polo the Penguin and Segments暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-522B] Photo to Remember,数据结构（data structures）,动态规划（dp）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-592B] The Monster and the Squirrel数学（math）\n[problem:CodeForces-834B] The Festive Evening数据结构（data structures）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-602A] Two Bases暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-735B] Urbanization贪心策略（greedy）,数论（number theory）,排序算法（sortings）\n[problem:CodeForces-495A] Digital Counter实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1146B] Hate 实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-557A] Ilya and Diplomas贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-985A] Chess Placing实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-629B] Far Relative’s Problem暴力枚举（brute force）\n[problem:CodeForces-12B] Correct Solution?实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-556B] Case of Fake Numbers暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-731B] Coupons and Discounts构造算法（constructive algorithms）,贪心策略（greedy）\n[problem:CodeForces-858A] k-rounding暴力枚举（brute force）,数学（math）,数论（number theory）\n[problem:CodeForces-624B] Making a String贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-618B] Guess the Permutation构造算法（constructive algorithms）\n[problem:CodeForces-508A] Pasha and Pixels暴力枚举（brute force）\n[problem:CodeForces-667A] Pouring Rain计算几何（geometry）,数学（math）\n[problem:CodeForces-544A] Set of Strings实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-686B] Little Robber Girl\u0027s Zoo构造算法（constructive algorithms）,实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-845A] Chess Tourney实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-596A] Wilbur and Swimming Pool计算几何（geometry）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-825A] Binary Protocol实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-950B] Intercepted Message贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-984B] Minesweeper实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-801A] Vicious Keyboard暴力枚举（brute force）\n[problem:CodeForces-754B] Ilya and tic-tac-toe game暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1121A] Technogoblet of Fire实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-765B] Code obfuscation贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-7A] Kalevitch and Chess暴力枚举（brute force）,构造算法（constructive algorithms）\n[problem:CodeForces-389B] Fox and Cross贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-884B] Japanese Crosswords Strike Back实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-975B] Mancala暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-505A] Mr. Kitayuta\u0027s Gift暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-381B] Sereja and Stairs贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-955A] Feed the cat贪心策略（greedy）,数学（math）\n[problem:CodeForces-257A] Sockets贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-242A] Heads or Tails暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-192B] Walking in the Rain暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-103A] Testing Pants for Sadness贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-190A] Vasya and the Bus贪心策略（greedy）,数学（math）\n[problem:CodeForces-12C] Fruits贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）,排序算法（sortings）\n[problem:CodeForces-405B] Domino Effect\n[problem:CodeForces-667B] Coat of Anticubism构造算法（constructive algorithms）,计算几何（geometry）\n[problem:CodeForces-196A] Lexicographically Maximum Subsequence贪心策略（greedy）,字符串处理（strings）\n[problem:CodeForces-252A] Little Xor暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-90B] African Crossword实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-245B] Internet Address实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-813A] The Contest实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-312A] Whose sentence is it?实现问题，编程技巧，模拟（implementation）,字符串处理（strings）\n[problem:CodeForces-1070K] Video Posts实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-53A] Autocomplete实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-68A] Irrational problem实现问题，编程技巧，模拟（implementation）,数论（number theory）\n[problem:CodeForces-475A] Bayan Bus实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-136B] Ternary Logic实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-402A] Nuts贪心策略（greedy）,数学（math）\n[problem:CodeForces-366A] Dima and Guards实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-355B] Vasya and Public Transport贪心策略（greedy）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-967A] Mind the Gap实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1575A] Another Sorting Problem数据结构（data structures）,排序算法（sortings）,字符串处理（strings）\n[problem:CodeForces-638A] Home Numbers,构造算法（constructive algorithms）,数学（math）\n[problem:CodeForces-39D] Cubical Planet数学（math）\n[problem:CodeForces-159B] Matchmaker,贪心策略（greedy）,排序算法（sortings）\n[problem:CodeForces-120C] Winnie-the-Pooh and honey实现问题，编程技巧，模拟（implementation）,数学（math）\n[problem:CodeForces-46B] T-shirts from Sponsor实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-883M] Quadcopter Competition贪心策略（greedy）,数学（math）\n[problem:CodeForces-1231C] Increasing Matrix贪心策略（greedy）\n[problem:CodeForces-120B] Quiz League实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-169B] Replacing Digits贪心策略（greedy）\n[problem:CodeForces-635A] Orchestra暴力枚举（brute force）,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-292A] SMSC实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-174A] Problem About Equation数学（math）\n[problem:CodeForces-1910A] Username,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-1001A] Generate plus state or minus state\n[problem:CodeForces-100A] Carpeting the Room,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-648C] Путь Робота构造算法（constructive algorithms）,深度优先搜索及其变种（dfs and similar）,图论（graphs）\n[problem:CodeForces-162A] Pentagonal numbers,实现问题，编程技巧，模拟（implementation）\n[problem:CodeForces-188A] Hexagonal Numbers\n[problem:CodeForces-188D] Asterisks,实现问题，编程技巧，模拟（implementation）","threadId":190420,"likeCnt":1,"createTime":1713880160000,"isWorkbook":true,"viewCnt":2590,"openness":2,"fav":false,"id":4924,"trustable":false}
