Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-44D\":[\"Hyperdrive\",767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/44\\\"\\u003eSchool Team Contest 2 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-207D9\":[\"The Beaver\\u0027s Problem - 3\",82,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-1691D\":[\"Max GEQ Sum\",5594,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1691\\\"\\u003eCodeCraft-22 and Codeforces Round 795 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1388C\":[\"Uncle Bogdan and Country Happiness\",9520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1388\\\"\\u003eCodeforces Round 660 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-847C\":[\"Sum of Nestings\",2592,\"\\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-1267L\":[\"Lexicography\",2954,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1267\\\"\\u003e2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-847E\":[\"Packmen\",2977,\"\\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-1267J\":[\"Just Arrange the Icons\",2692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1267\\\"\\u003e2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1907F\":[\"Shift and Reverse\",4355,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1907\\\"\\u003eCodeforces Round 913 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-847K\":[\"Travel Cards\",1634,\"\\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-207D1\":[\"The Beaver\\u0027s Problem - 3\",115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-195C\":[\"Try and Catch\",1191,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/195\\\"\\u003eCodeforces Round 123 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-33C\":[\"Wonderful Randomized Sum\",3098,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/33\\\"\\u003eCodeforces Beta Round 33 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-69E\":[\"Subsegments\",4360,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/69\\\"\\u003eCodeforces Beta Round 63 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-33B\":[\"String Problem\",4811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/33\\\"\\u003eCodeforces Beta Round 33 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1133E\":[\"K Balanced Teams\",5608,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1133\\\"\\u003eCodeforces Round 544 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1335E2\":[\"Three Blocks Palindrome (hard version)\",8090,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1335\\\"\\u003eCodeforces Round 634 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-846C\":[\"Four Segments\",2746,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"CodeForces-846B\":[\"Math Show\",2629,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"CodeForces-513G1\":[\"Inversions problem\",1790,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/513\\\"\\u003eRockethon 2015\\u003c/a\\u003e\"],\"CodeForces-725D\":[\"Contest Balloons\",2891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/725\\\"\\u003eCanada Cup 2016\\u003c/a\\u003e\"],\"CodeForces-822D\":[\"My pretty girl Noora\",3092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/822\\\"\\u003eCodeforces Round 422 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-846F\":[\"Random Query\",2387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"CodeForces-1809D\":[\"Binary String Sorting\",5952,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1809\\\"\\u003eEducational Codeforces Round 145 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-45J\":[\"Planting Trees\",980,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/45\\\"\\u003eSchool Team Contest 3 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-280B\":[\"Maximum Xor Secondary\",4739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/280\\\"\\u003eCodeforces Round 172 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-30C\":[\"Shooting Gallery\",2166,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/30\\\"\\u003eCodeforces Beta Round 30 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-54B\":[\"Cutting Jigsaw Puzzle\",799,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/54\\\"\\u003eCodeforces Beta Round 50\\u003c/a\\u003e\"],\"CodeForces-66C\":[\"Petya and File System\",1122,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/66\\\"\\u003eCodeforces Beta Round 61 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1156B\":[\"Ugly Pairs\",6401,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1718A1\":[\"Burenka and Traditions (easy version)\",5519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1718\\\"\\u003eCodeforces Round 814 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-979B\":[\"Treasure Hunt\",4590,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/979\\\"\\u003eCodeforces Round 482 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-409E\":[\"Dome\",593,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/409\\\"\\u003eApril Fools Day Contest 2014\\u003c/a\\u003e\"],\"CodeForces-519D\":[\"A and B and Interesting Substrings\",6781,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/519\\\"\\u003eCodeforces Round 294 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1398D\":[\"Colored Rectangles\",11242,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1398\\\"\\u003eEducational Codeforces Round 93 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-603B\":[\"Moodular Arithmetic\",2635,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/603\\\"\\u003eCodeforces Round 334 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-869C\":[\"The Intriguing Obsession\",4676,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/869\\\"\\u003eCodeforces Round 439 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-700B\":[\"Connecting Universities\",4012,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/700\\\"\\u003eCodeforces Round 364 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-845D\":[\"Driving Test\",2515,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"CodeForces-724C\":[\"Ray Tracing\",2245,\"\\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-182E\":[\"Wooden Fence\",1593,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/182\\\"\\u003eCodeforces Round 117 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-207A2\":[\"Beaver\\u0027s Calculator 1.0\",225,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-79C\":[\"Beaver\",1843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/79\\\"\\u003eCodeforces Beta Round 71\\u003c/a\\u003e\"],\"CodeForces-67B\":[\"Restoration of the Permutation\",823,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/67\\\"\\u003eManthan 2011\\u003c/a\\u003e\"],\"CodeForces-1915G\":[\"Bicycles\",5443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1915\\\"\\u003eCodeforces Round 918 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-67A\":[\"Partial Teacher\",2285,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/67\\\"\\u003eManthan 2011\\u003c/a\\u003e\"],\"CodeForces-1034A\":[\"Enlarge GCD\",8830,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1034\\\"\\u003eCodeforces Round 511 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1179B\":[\"Tolik and His Uncle\",4361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1179\\\"\\u003eCodeforces Round 569 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1904D2\":[\"Set To Max (Hard Version)\",3799,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1904\\\"\\u003eCodeforces Round 914 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1010B\":[\"Rocket\",5158,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1010\\\"\\u003eCodeforces Round 499 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1010C\":[\"Border\",4920,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1010\\\"\\u003eCodeforces Round 499 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-638C\":[\"Road Improvement\",1603,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/638\\\"\\u003eVK Cup 2016 - Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-638D\":[\"Three-dimensional Turtle Super Computer\",708,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/638\\\"\\u003eVK Cup 2016 - Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-1252H\":[\"Twin Buildings\",2824,\"\\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-626D\":[\"Jerry\\u0027s Protest\",2853,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/626\\\"\\u003e8VC Venture Cup 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-747D\":[\"Winter Is Coming\",3260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/747\\\"\\u003eCodeforces Round 387 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-989C\":[\"A Mist of Florescence\",3942,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/989\\\"\\u003eCodeforces Round 487 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-140C\":[\"New Year Snowmen\",5023,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/140\\\"\\u003eCodeforces Round 100\\u003c/a\\u003e\"],\"CodeForces-370C\":[\"Mittens\",1606,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/370\\\"\\u003eCodeforces Round 217 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-140D\":[\"New Year Contest\",2298,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/140\\\"\\u003eCodeforces Round 100\\u003c/a\\u003e\"],\"CodeForces-188H\":[\"Stack\",242,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/188\\\"\\u003eSurprise Language Round 6\\u003c/a\\u003e\"],\"CodeForces-1477A\":[\"Nezzar and Board\",5740,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1477\\\"\\u003eCodeforces Round 698 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-140B\":[\"New Year Cards\",1543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/140\\\"\\u003eCodeforces Round 100\\u003c/a\\u003e\"],\"CodeForces-24C\":[\"Sequence of points\",1366,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/24\\\"\\u003eCodeforces Beta Round 24\\u003c/a\\u003e\"],\"CodeForces-1138B\":[\"Circus\",4178,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1138\\\"\\u003eCodeforces Round 545 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1780D\":[\"Bit Guessing Game\",4658,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1780\\\"\\u003eCodeforces Round 846 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-48C\":[\"The Race\",845,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/48\\\"\\u003eSchool Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-513B2\":[\"Permutations\",2685,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/513\\\"\\u003eRockethon 2015\\u003c/a\\u003e\"],\"CodeForces-1488B\":[\"RBS Deletion\",524,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1488\\\"\\u003eKotlin Heroes: Episode 6\\u003c/a\\u003e\"],\"CodeForces-187B\":[\"AlgoRace\",2062,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/187\\\"\\u003eCodeforces Round 119 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1016C\":[\"Vasya And The Mushrooms\",3869,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1016\\\"\\u003eEducational Codeforces Round 48 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-49D\":[\"Game\",2209,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/49\\\"\\u003eCodeforces Beta Round 46 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1016D\":[\"Vasya And The Matrix\",4619,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1016\\\"\\u003eEducational Codeforces Round 48 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-37B\":[\"Computer Game\",952,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/37\\\"\\u003eCodeforces Beta Round 37\\u003c/a\\u003e\"],\"CodeForces-827B\":[\"High Load\",3536,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/827\\\"\\u003eCodeforces Round 423 (Div. 1, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-1355C\":[\"Count Triangles\",10572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1355\\\"\\u003eCodeforces Round 643 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1367D\":[\"Task On The Board\",8091,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1367\\\"\\u003eCodeforces Round 650 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-706D\":[\"Vasiliy\\u0027s Multiset\",10265,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/706\\\"\\u003eCodeforces Round 367 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-802B\":[\"Heidi and Library (medium)\",1088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-911D\":[\"Inversion Counting\",4800,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-923C\":[\"Perfect Security\",4302,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/923\\\"\\u003eVK Cup 2018 - Round 1\\u003c/a\\u003e\"],\"CodeForces-162C\":[\"Prime factorization\",774,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/162\\\"\\u003eVK Cup 2012 Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-174C\":[\"Range Increments\",1166,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/174\\\"\\u003eVK Cup 2012 Round 3 (Unofficial Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-162B\":[\"Binary notation\",307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/162\\\"\\u003eVK Cup 2012 Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-58C\":[\"Trees\",2213,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/58\\\"\\u003eCodeforces Beta Round 54 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-46D\":[\"Parking Lot\",1151,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/46\\\"\\u003eSchool Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1136D\":[\"Nastya Is Buying Lunch\",3772,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1136\\\"\\u003eCodeforces Round 546 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1560E\":[\"Polycarp and String Transformation\",7688,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1560\\\"\\u003eCodeforces Round 739 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1148D\":[\"Dirty Deeds Done Dirt Cheap\",4992,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1148\\\"\\u003eCodeforces Global Round 3\\u003c/a\\u003e\"],\"CodeForces-802A\":[\"Heidi and Library (easy)\",1400,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1221D\":[\"Make The Fence Great Again\",9119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1221\\\"\\u003eEducational Codeforces Round 73 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1463C\":[\"Busy Robot\",5576,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1463\\\"\\u003eEducational Codeforces Round 100 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1475D\":[\"Cleaning the Phone\",10014,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1475\\\"\\u003eCodeforces Round 697 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1572A\":[\"Book\",8604,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1572\\\"\\u003eCodeforces Round 743 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-813B\":[\"The Golden Age\",4045,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"CodeForces-922D\":[\"Robot Vacuum Cleaner\",4806,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-946D\":[\"Timetable\",4690,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/946\\\"\\u003eEducational Codeforces Round 39 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-162J\":[\"Brackets\",88,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/162\\\"\\u003eVK Cup 2012 Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-3C\":[\"Tic-tac-toe\",7690,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/3\\\"\\u003eCodeforces Beta Round 3\\u003c/a\\u003e\"],\"CodeForces-162H\":[\"Alternating case\",212,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/162\\\"\\u003eVK Cup 2012 Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-162E\":[\"HQ9+\",173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/162\\\"\\u003eVK Cup 2012 Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-271D\":[\"Good Substrings\",11357,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/271\\\"\\u003eCodeforces Round 166 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-162F\":[\"Factorial zeros\",194,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/162\\\"\\u003eVK Cup 2012 Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-185B\":[\"Mushroom Scientists\",1672,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/185\\\"\\u003eCodeforces Round 118 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-173B\":[\"Chamber of Secrets\",3508,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/173\\\"\\u003eCroc Champ 2012 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1244D\":[\"Paint the Tree\",7486,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1244\\\"\\u003eCodeforces Round 592 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1583D\":[\"Omkar and the Meaning of Life\",5244,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1583\\\"\\u003eTechnocup 2022 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1571C\":[\"Rhyme\",359,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1571\\\"\\u003eKotlin Heroes: Episode 8\\u003c/a\\u003e\"],\"CodeForces-1038D\":[\"Slime\",8634,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1038\\\"\\u003eCodeforces Round 508 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1450D\":[\"Rating Compression\",5380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1450\\\"\\u003eCodeforces Global Round 12\\u003c/a\\u003e\"],\"CodeForces-1462F\":[\"The Treasure of The Segments\",6831,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1462\\\"\\u003eCodeforces Round 690 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1571D\":[\"Sweepstake\",318,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1571\\\"\\u003eKotlin Heroes: Episode 8\\u003c/a\\u003e\"],\"CodeForces-727D\":[\"T-shirts Distribution\",1970,\"\\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-933A\":[\"A Twisty Movement\",5160,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/933\\\"\\u003eCodeforces Round 462 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-161D\":[\"Distance in Tree\",14977,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/161\\\"\\u003eVK Cup 2012 Round 1\\u003c/a\\u003e\"],\"CodeForces-1910D\":[\"Remove and Add\",297,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1910\\\"\\u003eKotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1922E\":[\"Increasing Subsequences\",7038,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1922\\\"\\u003eEducational Codeforces Round 161 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-72A\":[\"Goshtasp, Vishtasp and Eidi\",185,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/72\\\"\\u003eUnknown Language Round 2\\u003c/a\\u003e\"],\"CodeForces-1801B\":[\"Buying gifts\",5806,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1801\\\"\\u003eCodeforces Round 857 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-132C\":[\"Logo Turtle\",2465,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/132\\\"\\u003eCodeforces Beta Round 96 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1728D\":[\"Letter Picking\",6898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1728\\\"\\u003eEducational Codeforces Round 135 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-917A\":[\"The Monster\",3529,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/917\\\"\\u003eCodeforces Round 459 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-690E1\":[\"Photographs (I)\",673,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/690\\\"\\u003eHelvetic Coding Contest 2016 online mirror (teams, unrated)\\u003c/a\\u003e\"],\"CodeForces-1295D\":[\"Same GCDs\",9084,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1295\\\"\\u003eEducational Codeforces Round 81 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1077E\":[\"Thematic Contests\",4716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1077\\\"\\u003eCodeforces Round 521 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1186C\":[\"Vus the Cossack and Strings\",6094,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1186\\\"\\u003eCodeforces Round 571 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1283E\":[\"New Year Parties\",6473,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1283\\\"\\u003eCodeforces Round 611 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1002C2\":[\"Distinguish zero state and plus state without errors\",262,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1002\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018\\u003c/a\\u003e\"],\"CodeForces-1283D\":[\"Christmas Trees\",7865,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1283\\\"\\u003eCodeforces Round 611 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-483B\":[\"Friends and Presents\",4508,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/483\\\"\\u003eCodeforces Round 275 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-592C\":[\"The Big Race\",3190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/592\\\"\\u003eCodeforces Round 328 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-120G\":[\"Boom\",697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-471D\":[\"MUH and Cube Walls\",8685,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/471\\\"\\u003eCodeforces Round 269 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-120H\":[\"Brevity is Soul of Wit\",1425,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-72E\":[\"Ali goes shopping\",151,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/72\\\"\\u003eUnknown Language Round 2\\u003c/a\\u003e\"],\"CodeForces-580D\":[\"Kefa and Dishes\",10466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/580\\\"\\u003eCodeforces Round 321 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-85B\":[\"Embassy Queue\",1000,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/85\\\"\\u003eYandex.Algorithm 2011: Round 1\\u003c/a\\u003e\"],\"CodeForces-73C\":[\"LionAge II\",2235,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/73\\\"\\u003eCodeforces Beta Round 66\\u003c/a\\u003e\"],\"CodeForces-252B\":[\"Unsorting Array\",1843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/252\\\"\\u003eCodeforces Round 153 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1108E1\":[\"Array and Segments (Easy version)\",4593,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1108\\\"\\u003eCodeforces Round 535 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-167B\":[\"Wizards and Huge Prize\",2246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/167\\\"\\u003eCodeforces Round 114 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1848C\":[\"Vika and Price Tags\",5980,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1848\\\"\\u003eCodeforces Round 885 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1076D\":[\"Edge Deletion\",5236,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1076\\\"\\u003eEducational Codeforces Round 54 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-690D2\":[\"The Wall (medium)\",1267,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/690\\\"\\u003eHelvetic Coding Contest 2016 online mirror (teams, unrated)\\u003c/a\\u003e\"],\"CodeForces-1195D2\":[\"Submarine in the Rybinsk Sea (hard edition)\",4545,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1195\\\"\\u003eCodeforces Round 574 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1282C\":[\"Petya and Exam\",4208,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1282\\\"\\u003eCodeforces Round 610 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1129A2\":[\"Toy Train\",3967,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1129\\\"\\u003eCodeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1619D\":[\"New Year\\u0027s Problem\",7495,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1619\\\"\\u003eCodeforces Round 762 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-61D\":[\"Eternal Victory\",6928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/61\\\"\\u003eCodeforces Beta Round 57 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-482B\":[\"Interesting Array\",6660,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/482\\\"\\u003eCodeforces Round 275 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-470B\":[\"Hexakosioihexekontahexaphobia\",256,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/470\\\"\\u003eSurprise Language Round 7\\u003c/a\\u003e\"],\"CodeForces-263D\":[\"Cycle in Graph\",3471,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/263\\\"\\u003eCodeforces Round 161 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-251B\":[\"Playing with Permutations\",1309,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/251\\\"\\u003eCodeforces Round 153 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-142B\":[\"Help General\",2230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/142\\\"\\u003eCodeforces Round 102 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1859D\":[\"Andrey and Escape from Capygrad\",6609,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1859\\\"\\u003eCodeforces Round 892 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-939E\":[\"Maximize!\",3423,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/939\\\"\\u003eCodeforces Round 464 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1172A\":[\"Nauuo and Cards\",4763,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1172\\\"\\u003eCodeforces Round 564 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1063B\":[\"Labyrinth\",7566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1063\\\"\\u003eCodeforces Round 516 (Div. 1, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-1196E\":[\"Connected Component on a Chessboard\",3631,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1196\\\"\\u003eCodeforces Round 575 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-130J\":[\"Date calculation\",320,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/130\\\"\\u003eUnknown Language Round 4\\u003c/a\\u003e\"],\"CodeForces-1509C\":[\"The Sports Festival\",12076,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1509\\\"\\u003eCodeforces Round 715 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-95B\":[\"Lucky Numbers\",1362,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/95\\\"\\u003eCodeforces Beta Round 77 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-371D\":[\"Vessels\",5892,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/371\\\"\\u003eCodeforces Round 218 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1725H\":[\"Hot Black Hot White\",2588,\"\\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-83B\":[\"Doctor\",1740,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/83\\\"\\u003eCodeforces Beta Round 72 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1713D\":[\"Tournament Countdown\",5462,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1713\\\"\\u003eCodeforces Round 812 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-141C\":[\"Queue\",2667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/141\\\"\\u003eCodeforces Round 101 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1846F\":[\"Rudolph and Mimic\",2908,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1846\\\"\\u003eCodeforces Round 883 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-274B\":[\"Zero Tree\",5166,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/274\\\"\\u003eCodeforces Round 168 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-153B\":[\"Binary notation\",149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/153\\\"\\u003eSurprise Language Round 5\\u003c/a\\u003e\"],\"CodeForces-1326D2\":[\"Prefix-Suffix Palindrome (Hard version)\",9898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1326\\\"\\u003eCodeforces Global Round 7\\u003c/a\\u003e\"],\"CodeForces-1725M\":[\"Moving Both Hands\",2969,\"\\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-178B3\":[\"Greedy Merchants\",1201,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-914C\":[\"Travelling Salesman and Special Numbers\",3922,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-926B\":[\"Add Points\",1651,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/926\\\"\\u003eVK Cup 2018 - Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-1062D\":[\"Fun with Integers\",4169,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1062\\\"\\u003eCodeforces Round 520 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1280B\":[\"Beingawesomeism\",3901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1280\\\"\\u003eCodeforces Round 607 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-913D\":[\"Too Easy Problems\",4743,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/913\\\"\\u003eHello 2018\\u003c/a\\u003e\"],\"CodeForces-1508B\":[\"Almost Sorted\",3865,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1508\\\"\\u003eCodeforces Round 715 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-492D\":[\"Vanya and Computer Game\",3310,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/492\\\"\\u003eCodeforces Round 280 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-100G\":[\"Name the album\",109,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/100\\\"\\u003eUnknown Language Round 3\\u003c/a\\u003e\"],\"CodeForces-64E\":[\"Prime Segment\",233,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/64\\\"\\u003eUnknown Language Round 1\\u003c/a\\u003e\"],\"CodeForces-245H\":[\"Queries for Number of Palindromes\",6875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/245\\\"\\u003eCROC-MBTU 2012, Elimination Round (ACM-ICPC)\\u003c/a\\u003e\"],\"CodeForces-100F\":[\"Polynom\",132,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/100\\\"\\u003eUnknown Language Round 3\\u003c/a\\u003e\"],\"CodeForces-64D\":[\"Presents\",282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/64\\\"\\u003eUnknown Language Round 1\\u003c/a\\u003e\"],\"CodeForces-1805D\":[\"A Wide, Wide Graph\",6087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1805\\\"\\u003eCodeforces Round 862 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-257C\":[\"View Angle\",4497,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/257\\\"\\u003eCodeforces Round 159 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-148D\":[\"Bag of mice\",8722,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/148\\\"\\u003eCodeforces Round 105 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1299B\":[\"Aerodynamic\",5117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1299\\\"\\u003eCodeforces Round 618 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-909C\":[\"Python Indentation\",5101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1154E\":[\"Two Teams\",6361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1154\\\"\\u003eCodeforces Round 552 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1396B\":[\"Stoned Game\",11098,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1396\\\"\\u003eCodeforces Round 666 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1005E1\":[\"Median on Segments (Permutations Edition)\",4034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1005\\\"\\u003eCodeforces Round 496 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1227D2\":[\"Optimal Subsequences (Hard Version)\",4263,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1227\\\"\\u003eTechnocup 2020 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-487A\":[\"Fight the Monster\",3833,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/487\\\"\\u003eCodeforces Round 278 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1709C\":[\"Recover an RBS\",8692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1709\\\"\\u003eEducational Codeforces Round 132 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-584D\":[\"Dima and Lisa\",9625,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/584\\\"\\u003eCodeforces Round 324 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-177F1\":[\"Script Generation\",295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/177\\\"\\u003eABBYY Cup 2.0 - Easy\\u003c/a\\u003e\"],\"CodeForces-1118F1\":[\"Tree Cutting (Easy Version)\",6001,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1118\\\"\\u003eCodeforces Round 540 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-89A\":[\"Robbery\",1577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/89\\\"\\u003eCodeforces Beta Round 74 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-220B\":[\"Little Elephant and Array\",10465,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/220\\\"\\u003eCodeforces Round 136 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-123B\":[\"Squares\",1172,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/123\\\"\\u003eCodeforces Beta Round 92 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-65A\":[\"Harry Potter and Three Spells\",1971,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/65\\\"\\u003eCodeforces Beta Round 60\\u003c/a\\u003e\"],\"CodeForces-77B\":[\"Falling Anvils\",2844,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/77\\\"\\u003eCodeforces Beta Round 69 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1286B\":[\"Numbers on Tree\",4480,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1286\\\"\\u003eCodeforces Round 612 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1177B\":[\"Digits Sequence (Hard Edition)\",2579,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1177\\\"\\u003eTesting Round 15 (Unrated)\\u003c/a\\u003e\"],\"CodeForces-1286A\":[\"Garland\",8578,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1286\\\"\\u003eCodeforces Round 612 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1250B\":[\"The Feast and the Bus\",2968,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1250\\\"\\u003e2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1250J\":[\"The Parade\",3297,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1250\\\"\\u003e2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-62B\":[\"Tyndex.Brome\",1380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/62\\\"\\u003eCodeforces Beta Round 58\\u003c/a\\u003e\"],\"CodeForces-255D\":[\"Mr. Bender and Square\",2047,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/255\\\"\\u003eCodeforces Round 156 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1394A\":[\"Boboniu Chats with Du\",6619,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1394\\\"\\u003eCodeforces Round 664 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1067B\":[\"Multihedgehog\",2594,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1067\\\"\\u003eCodeforces Round 518 (Div. 1) [Thanks, Mail.Ru!]\\u003c/a\\u003e\"],\"CodeForces-1152C\":[\"Neko does Maths\",6883,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1152\\\"\\u003eCodeforces Round 554 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1912K\":[\"Kim\\u0027s Quest\",2010,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1912\\\"\\u003e2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1176D\":[\"Recover it!\",5371,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1176\\\"\\u003eCodeforces Round 565 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1249D1\":[\"Too Many Segments (easy version)\",5054,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1249\\\"\\u003eCodeforces Round 595 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1249D2\":[\"Too Many Segments (hard version)\",5110,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1249\\\"\\u003eCodeforces Round 595 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1491D\":[\"Zookeeper and The Infinite Zoo\",6934,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1491\\\"\\u003eCodeforces Global Round 13\\u003c/a\\u003e\"],\"CodeForces-691C\":[\"Exponential notation\",2942,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/691\\\"\\u003eEducational Codeforces Round 14\\u003c/a\\u003e\"],\"CodeForces-51C\":[\"Three Base Stations\",2475,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/51\\\"\\u003eCodeforces Beta Round 48\\u003c/a\\u003e\"],\"CodeForces-363D\":[\"Renting Bikes\",4206,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/363\\\"\\u003eCodeforces Round 211 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-178F1\":[\"Representative Sampling\",296,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-242C\":[\"King\\u0027s Path\",9213,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/242\\\"\\u003eCodeforces Round 149 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1923D\":[\"Slimes\",5807,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1923\\\"\\u003eEducational Codeforces Round 162 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-254C\":[\"Anagram\",1569,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/254\\\"\\u003eCodeforces Round 155 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-351A\":[\"Jeff and Rounding\",2810,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/351\\\"\\u003eCodeforces Round 204 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1935D\":[\"Exam in MAC\",7264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1935\\\"\\u003eCodeforces Round 932 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-87B\":[\"Vasya and Types\",1162,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/87\\\"\\u003eCodeforces Beta Round 73 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-145B\":[\"Lucky Number 2\",2261,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/145\\\"\\u003eCodeforces Round 104 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1729E\":[\"Guess the Cycle Size\",6841,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1729\\\"\\u003eCodeforces Round 820 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1935C\":[\"Messenger in MAC\",7046,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1935\\\"\\u003eCodeforces Round 932 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1705D\":[\"Mark and Lightbulbs\",6177,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1705\\\"\\u003eCodeforces Round 807 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1381B\":[\"Unmerge\",8595,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1381\\\"\\u003eCodeforces Round 658 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1151C\":[\"Problem for Nazar\",5470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1151\\\"\\u003eCodeforces Round 553 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1042D\":[\"Petya and Array\",6119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1042\\\"\\u003eCodeforces Round 510 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1066D\":[\"Boxes Packing\",5804,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1066\\\"\\u003eCodeforces Round 515 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1187C\":[\"Vasya And Array\",6287,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1030D\":[\"Vasya and Triangle\",5873,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1030\\\"\\u003eTechnocup 2019 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1635D\":[\"Infinite Set\",6076,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1635\\\"\\u003eCodeforces Round 772 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1841C\":[\"Ranom Numbers\",7482,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1841\\\"\\u003eEducational Codeforces Round 150 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1768D\":[\"Lucky Permutation\",6721,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1768\\\"\\u003eCodeforces Round 842 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-958F2\":[\"Lightsabers (medium)\",1272,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/958\\\"\\u003eHelvetic Coding Contest 2018 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-201B\":[\"Guess That Car!\",1376,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/201\\\"\\u003eCodeforces Round 127 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-358D\":[\"Dima and Hares\",4103,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/358\\\"\\u003eCodeforces Round 208 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1611F\":[\"ATM and Students\",6292,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1611\\\"\\u003eCodeforces Round 756 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1190B\":[\"Tokitsukaze, CSL and Stone Game\",6416,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1190\\\"\\u003eCodeforces Round 573 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1081D\":[\"Maximum Distance\",4094,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1081\\\"\\u003eAvito Cool Challenge 2018\\u003c/a\\u003e\"],\"CodeForces-794C\":[\"Naming Company\",3306,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/794\\\"\\u003eTinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1525D\":[\"Armchairs\",9627,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1525\\\"\\u003eEducational Codeforces Round 109 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1852B\":[\"Imbalanced Arrays\",4150,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1852\\\"\\u003eCodeforces Round 887 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1852A\":[\"Ntarsis\\u0027 Set\",7591,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1852\\\"\\u003eCodeforces Round 887 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-200D\":[\"Programming Language\",962,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/200\\\"\\u003eCodeforces Round 126 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-200C\":[\"Football Championship\",1107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/200\\\"\\u003eCodeforces Round 126 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-442B\":[\"Andrey and Problem\",5151,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/442\\\"\\u003eCodeforces Round 253 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-333B\":[\"Chips\",2731,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/333\\\"\\u003eCodeforces Round 194 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-478C\":[\"Table Decorations\",18425,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/478\\\"\\u003eCodeforces Round 273 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-551B\":[\"ZgukistringZ\",4051,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/551\\\"\\u003eCodeforces Round 307 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-575H\":[\"Bots\",1752,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/575\\\"\\u003eBubble Cup 8 - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-1500A\":[\"Going Home\",8611,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1500\\\"\\u003eCodeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"CodeForces-1548B\":[\"Integers Have Friends\",9358,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1548\\\"\\u003eCodeforces Round 736 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1851F\":[\"Lisa and the Martians\",5329,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1851\\\"\\u003eCodeforces Round 888 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1930D1\":[\"Sum over all Substrings (Easy Version)\",3650,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1930\\\"\\u003ethink-cell Round 1\\u003c/a\\u003e\"],\"CodeForces-671A\":[\"Recycling Bottles\",4277,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/671\\\"\\u003eCodeforces Round 352 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-683E\":[\"Hammer throwing\",187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/683\\\"\\u003eSurprise Language Round 8\\u003c/a\\u003e\"],\"CodeForces-683F\":[\"Reformat the String\",146,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/683\\\"\\u003eSurprise Language Round 8\\u003c/a\\u003e\"],\"CodeForces-1402A\":[\"Fancy Fence\",1189,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1402\\\"\\u003eCentral-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated)\\u003c/a\\u003e\"],\"CodeForces-1208C\":[\"Magic Grid\",6065,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1208\\\"\\u003eManthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1426E\":[\"Rock, Paper, Scissors\",7711,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1426\\\"\\u003eCodeforces Round 674 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1856E1\":[\"PermuTree (easy version)\",4985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1856\\\"\\u003eCodeforces Round 890 (Div. 2) supported by Constructor Institute\\u003c/a\\u003e\"],\"CodeForces-1535D\":[\"Playoff Tournament\",7597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1535\\\"\\u003eEducational Codeforces Round 110 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-234F\":[\"Fence\",1906,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/234\\\"\\u003eCodeforces Round 145 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-440C\":[\"One-Based Arithmetic\",1058,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/440\\\"\\u003eTesting Round 10\\u003c/a\\u003e\"],\"CodeForces-1329A\":[\"Dreamoon Likes Coloring\",8890,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1329\\\"\\u003eCodeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov!\\u003c/a\\u003e\"],\"CodeForces-222C\":[\"Reducing Fractions\",2222,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/222\\\"\\u003eCodeforces Round 137 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-452B\":[\"4-point polyline\",2117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/452\\\"\\u003eMemSQL Start[c]UP 2.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1620C\":[\"BA-String\",6479,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1620\\\"\\u003eEducational Codeforces Round 119 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1862F\":[\"Magic Will Save the World\",5668,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1862\\\"\\u003eCodeforces Round 894 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1769D1\":[\"Игра в Девятку I\",368,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1769\\\"\\u003eVK Cup 2022 - Квалификация (Engine)\\u003c/a\\u003e\"],\"CodeForces-1090D\":[\"Similar Arrays\",2069,\"\\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-585A\":[\"Gennady the Dentist\",4224,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/585\\\"\\u003eCodeforces Round 325 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-883K\":[\"Road Widening\",1134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/883\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1845D\":[\"Rating System\",7346,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1845\\\"\\u003eEducational Codeforces Round 151 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1409E\":[\"Two Platforms\",7755,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1409\\\"\\u003eCodeforces Round 667 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-459D\":[\"Pashmak and Parmida\\u0027s problem\",10599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/459\\\"\\u003eCodeforces Round 261 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1833G\":[\"Ksyusha and Chinchilla\",5031,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1833\\\"\\u003eCodeforces Round 874 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1073C\":[\"Vasya and Robot\",4994,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1073\\\"\\u003eEducational Codeforces Round 53 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-665D\":[\"Simple Subset\",3416,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/665\\\"\\u003eEducational Codeforces Round 12\\u003c/a\\u003e\"],\"CodeForces-1720D1\":[\"Xor-Subsequence (easy version)\",5764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1720\\\"\\u003eCodeforces Round 815 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-641C\":[\"Little Artem and Dance\",2884,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/641\\\"\\u003eVK Cup 2016 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1296E1\":[\"String Coloring (easy version)\",7273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1296\\\"\\u003eCodeforces Round 617 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-883H\":[\"Palindromic Cut\",1753,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/883\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1505E\":[\"Cakewalk\",1734,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1505\\\"\\u003eApril Fools Day Contest 2021\\u003c/a\\u003e\"],\"CodeForces-1759F\":[\"All Possible Digits\",3741,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1759\\\"\\u003eCodeforces Round 834 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1505D\":[\"Xenolith? Hippodrome?\",744,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1505\\\"\\u003eApril Fools Day Contest 2021\\u003c/a\\u003e\"],\"CodeForces-1517D\":[\"Explorer Space\",7507,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1517\\\"\\u003eContest 2050 and Codeforces Round 718 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-301A\":[\"Yaroslav and Sequence\",3273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/301\\\"\\u003eCodeforces Round 182 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-216C\":[\"Hiring Staff\",1882,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/216\\\"\\u003eCodeforces Round 133 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-325B\":[\"Stadium and Games\",1525,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/325\\\"\\u003eMemSQL start[c]up Round 1\\u003c/a\\u003e\"],\"CodeForces-1941F\":[\"Rudolf and Imbalance\",5114,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1941\\\"\\u003eCodeforces Round 933 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1290B\":[\"Irreducible Anagrams\",5089,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1290\\\"\\u003eCodeforces Round 616 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1096D\":[\"Easy Problem\",8466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1096\\\"\\u003eEducational Codeforces Round 57 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-543A\":[\"Writing Code\",8231,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/543\\\"\\u003eCodeforces Round 302 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-894B\":[\"Ralph And His Magic Field\",4778,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/894\\\"\\u003eCodeforces Round 447 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-652C\":[\"Foe Pairs\",3321,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/652\\\"\\u003eEducational Codeforces Round 10\\u003c/a\\u003e\"],\"CodeForces-652D\":[\"Nested Segments\",4190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/652\\\"\\u003eEducational Codeforces Round 10\\u003c/a\\u003e\"],\"CodeForces-1678B2\":[\"Tokitsukaze and Good 01-String (hard version)\",6561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1678\\\"\\u003eCodeforces Round 789 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-991E\":[\"Bus Number\",3636,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/991\\\"\\u003eCodeforces Round 491 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1867D\":[\"Cyclic Operations\",5335,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1867\\\"\\u003eCodeforces Round 897 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1734D\":[\"Slime Escape\",6108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1734\\\"\\u003eCodeforces Round 822 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1758D\":[\"Range \\u003d √Sum\",7032,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1758\\\"\\u003eCodeforces Round 836 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1637D\":[\"Yet Another Minimization Problem\",7555,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1637\\\"\\u003eCodeforces Global Round 19\\u003c/a\\u003e\"],\"CodeForces-300C\":[\"Beautiful Numbers\",10060,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/300\\\"\\u003eCodeforces Round 181 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-433C\":[\"Ryouko\\u0027s Memory Note\",2552,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/433\\\"\\u003eCodeforces Round 248 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-336C\":[\"Vasily the Bear and Sequence\",2605,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/336\\\"\\u003eCodeforces Round 195 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1083A\":[\"The Fair Nut and the Best Path\",5419,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1083\\\"\\u003eCodeforces Round 526 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1732C1\":[\"Sheikh (Easy version)\",5650,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1732\\\"\\u003eCodeforces Round 830 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-687B\":[\"Remainders Game\",6165,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/687\\\"\\u003eCodeforces Round 360 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-663A\":[\"Rebus\",3315,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/663\\\"\\u003eCodeforces Round 347 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-772A\":[\"Voltage Keepsake\",4946,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/772\\\"\\u003eVK Cup 2017 - Round 2\\u003c/a\\u003e\"],\"CodeForces-675D\":[\"Tree Construction\",3838,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/675\\\"\\u003eCodeforces Round 353 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-784C\":[\"INTERCALC\",686,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/784\\\"\\u003eApril Fools Contest 2017\\u003c/a\\u003e\"],\"CodeForces-772B\":[\"Volatile Kite\",3162,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/772\\\"\\u003eVK Cup 2017 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1721D\":[\"Maximum AND\",6364,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1721\\\"\\u003eEducational Codeforces Round 134 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1648B\":[\"Integral Array\",6242,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1648\\\"\\u003eCodeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"CodeForces-1843F1\":[\"Omsk Metro (simple version)\",5010,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1843\\\"\\u003eCodeforces Round 881 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-420B\":[\"Online Meeting\",1056,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/420\\\"\\u003eCoder-Strike 2014 - Finals (online edition, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-432C\":[\"Prime Swaps\",2590,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/432\\\"\\u003eCodeforces Round 246 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-105B\":[\"Dark Assembly\",837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/105\\\"\\u003eCodeforces Beta Round 81\\u003c/a\\u003e\"],\"CodeForces-238B\":[\"Boring Partition\",1347,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/238\\\"\\u003eCodeforces Round 148 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-117B\":[\"Very Interesting Game\",1698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/117\\\"\\u003eCodeforces Beta Round 88\\u003c/a\\u003e\"],\"CodeForces-1082D\":[\"Maximum Diameter Graph\",3705,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1082\\\"\\u003eEducational Codeforces Round 55 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-16C\":[\"Monitor\",5050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/16\\\"\\u003eCodeforces Beta Round 16 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1554D\":[\"Diane\",9257,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1554\\\"\\u003eCodeforces Round 735 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1554C\":[\"Mikasa\",8680,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1554\\\"\\u003eCodeforces Round 735 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1324F\":[\"Maximum White Subtree\",9406,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1675F\":[\"Vlad and Unfinished Business\",5125,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1675\\\"\\u003eCodeforces Round 787 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-778B\":[\"Bitwise Formula\",2325,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/778\\\"\\u003eCodeforces Round 402 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-730A\":[\"Toda 2\",1675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/730\\\"\\u003e2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-645D\":[\"Robot Rapping Results Report\",2949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/645\\\"\\u003eCROC 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-899D\":[\"Shovel Sale\",2826,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-863D\":[\"Yet Another Array Queries Problem\",3386,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"CodeForces-730B\":[\"Minimum and Maximum\",2603,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/730\\\"\\u003e2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-863C\":[\"1-2-3\",2566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"CodeForces-402D\":[\"Upgrading Array\",2719,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/402\\\"\\u003eCodeforces Round 236 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1468J\":[\"Road Reform\",4190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1468\\\"\\u003e2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1674F\":[\"Desktop Rearrangement\",5011,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1674\\\"\\u003eCodeforces Round 786 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1420D\":[\"Rescue Nibel!\",7460,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1420\\\"\\u003eCodeforces Round 672 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-777D\":[\"Cloud of Hashtags\",5368,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-983B\":[\"XOR-pyramid\",5661,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/983\\\"\\u003eCodeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!]\\u003c/a\\u003e\"],\"CodeForces-1254B1\":[\"Send Boxes to Alice (Easy Version)\",4478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1254\\\"\\u003eCodeforces Round 601 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-38E\":[\"Let\\u0027s Go Rolling!\",2741,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/38\\\"\\u003eSchool Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1225D\":[\"Power Products\",7587,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1225\\\"\\u003eTechnocup 2020 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1334D\":[\"Minimum Euler Cycle\",7107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1334\\\"\\u003eEducational Codeforces Round 85 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1552D\":[\"Array Differentiation\",6751,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1552\\\"\\u003eCodeforces Global Round 15\\u003c/a\\u003e\"],\"CodeForces-328A\":[\"IQ Test\",2193,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/328\\\"\\u003eTesting Round 8\\u003c/a\\u003e\"],\"CodeForces-1213G\":[\"Path Queries\",7064,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1552C\":[\"Maximize the Intersections\",5833,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1552\\\"\\u003eCodeforces Global Round 15\\u003c/a\\u003e\"],\"CodeForces-7C\":[\"Line\",5443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/7\\\"\\u003eCodeforces Beta Round 7\\u003c/a\\u003e\"],\"CodeForces-776C\":[\"Molly\\u0027s Chemicals\",6382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/776\\\"\\u003eICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-873D\":[\"Merge Sort\",3382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/873\\\"\\u003eEducational Codeforces Round 30\\u003c/a\\u003e\"],\"CodeForces-1617D1\":[\"Too Many Impostors (easy version)\",4571,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1617\\\"\\u003eCodeforces Round 761 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-630M\":[\"Turn\",1170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-1793D\":[\"Moscow Gorillas\",6138,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1793\\\"\\u003eCodeforces Round 852 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-15B\":[\"Laser\",1408,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/15\\\"\\u003eCodeforces Beta Round 15\\u003c/a\\u003e\"],\"CodeForces-436C\":[\"Dungeons and Candies\",2782,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/436\\\"\\u003eZepto Code Rush 2014\\u003c/a\\u003e\"],\"CodeForces-448D\":[\"Multiplication Table\",14913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/448\\\"\\u003eCodeforces Round 256 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1781D\":[\"Many Perfect Squares\",5282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1781\\\"\\u003eVK Cup 2022 - Отборочный раунд (Engine)\\u003c/a\\u003e\"],\"CodeForces-1442A\":[\"Extreme Subtraction\",8781,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1442\\\"\\u003eCodeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final)\\u003c/a\\u003e\"],\"CodeForces-1442B\":[\"Identify the Operations\",4367,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1442\\\"\\u003eCodeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final)\\u003c/a\\u003e\"],\"CodeForces-1466E\":[\"Apollo versus Pan\",7026,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1466\\\"\\u003eGood Bye 2020\\u003c/a\\u003e\"],\"CodeForces-1575D\":[\"Divisible by Twenty-Five\",2440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1575\\\"\\u003eCOMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-666A\":[\"Reberland Linguistics\",3481,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/666\\\"\\u003eCodeforces Round 349 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-799C\":[\"Fountains\",3925,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/799\\\"\\u003ePlayrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-533E\":[\"Correcting Mistakes\",2245,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/533\\\"\\u003eVK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)\\u003c/a\\u003e\"],\"CodeForces-1824B1\":[\"LuoTianyi and the Floating Islands (Easy Version)\",4329,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1824\\\"\\u003eCodeforces Round 872 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1316C\":[\"Primitive Primes\",7247,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1316\\\"\\u003eCodeCraft-20 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1328D\":[\"Carousel\",12796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1328\\\"\\u003eCodeforces Round 629 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1437C\":[\"Chef Monocarp\",10370,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1437\\\"\\u003eEducational Codeforces Round 97 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1304D\":[\"Shortest and Longest LIS\",6312,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1304\\\"\\u003eCodeforces Round 620 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1534D\":[\"Lost Tree\",5802,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1534\\\"\\u003eCodeforces LATOKEN Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1582F1\":[\"Korney Korneevich and XOR (easy version)\",5341,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1582\\\"\\u003eCodeforces Round 750 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1207D\":[\"Number Of Permutations\",5989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1207\\\"\\u003eEducational Codeforces Round 71 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1401D\":[\"Maximum Distributed Tree\",9035,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1401\\\"\\u003eCodeforces Round 665 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1861D\":[\"Sorting By Multiplication\",6344,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1861\\\"\\u003eEducational Codeforces Round 154 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1740E\":[\"Hanging Hearts\",4159,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1740\\\"\\u003eCodeforces Round 831 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-988D\":[\"Points and Powers of Two\",7273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/988\\\"\\u003eCodeforces Round 486 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-952D\":[\"I\\u0027m Feeling Lucky!\",2447,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/952\\\"\\u003eApril Fools Contest 2018\\u003c/a\\u003e\"],\"CodeForces-180E\":[\"Cubes\",1903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/180\\\"\\u003eCodeforces Round 116 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-180A\":[\"Defragmentation\",540,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/180\\\"\\u003eCodeforces Round 116 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1109B\":[\"Sasha and One More Name\",4466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1109\\\"\\u003eCodeforces Round 539 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1327E\":[\"Count The Blocks\",8753,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1327\\\"\\u003eEducational Codeforces Round 84 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1666C\":[\"Connect the Points\",3195,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1666\\\"\\u003e2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1666L\":[\"Labyrinth\",3119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1666\\\"\\u003e2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1872F\":[\"Selling a Menagerie\",5832,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1872\\\"\\u003eCodeforces Round 895 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1630B\":[\"Range and Partition\",5561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1630\\\"\\u003eCodeforces Round 768 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1775D\":[\"Friendly Spiders\",5852,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1775\\\"\\u003eCodeforces Round 843 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-963A\":[\"Alternating Sum\",3414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/963\\\"\\u003eTinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-527D\":[\"Clique Problem\",4946,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/527\\\"\\u003eCodeforces Round 296 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-721C\":[\"Journey\",6076,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/721\\\"\\u003eCodeforces Round 374 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-600C\":[\"Make Palindrome\",6204,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/600\\\"\\u003eEducational Codeforces Round 2\\u003c/a\\u003e\"],\"CodeForces-612D\":[\"The Union of k-Segments\",4271,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/612\\\"\\u003eEducational Codeforces Round 4\\u003c/a\\u003e\"],\"CodeForces-733C\":[\"Epidemic in Monstropolis\",3450,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/733\\\"\\u003eCodeforces Round 378 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-830A\":[\"Office Keys\",6822,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/830\\\"\\u003eCodeforces Round 424 (Div. 1, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-1556D\":[\"Take a Guess\",6633,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1556\\\"\\u003eDeltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1556C\":[\"Compressed Bracket Sequence\",5685,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1556\\\"\\u003eDeltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1846E2\":[\"Rudolf and Snowflakes (hard version)\",6647,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1846\\\"\\u003eCodeforces Round 883 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1338B\":[\"Edge Weight Assignment\",8135,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1338\\\"\\u003eCodeforces Round 633 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1750D\":[\"Count GCD\",5670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1750\\\"\\u003eCodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-986B\":[\"Petr and Permutations\",4744,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/986\\\"\\u003eCodeforces Round 485 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-538D\":[\"Weird Chess\",2453,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/538\\\"\\u003eCodeforces Round 300\\u003c/a\\u003e\"],\"CodeForces-623A\":[\"Graph and String\",4605,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/623\\\"\\u003eAIM Tech Round (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-768C\":[\"Jon Snow and his Favourite Number\",3991,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/768\\\"\\u003eDivide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-853B\":[\"Jury Meeting\",2691,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/853\\\"\\u003eCodeforces Round 433 (Div. 1, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-190B\":[\"Surrounded\",3035,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/190\\\"\\u003eCodeforces Round 120 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1446B\":[\"Catching Cheaters\",7687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1446\\\"\\u003eCodeforces Round 683 (Div. 1, by Meet IT)\\u003c/a\\u003e\"],\"CodeForces-1107D\":[\"Compression\",3848,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1107\\\"\\u003eEducational Codeforces Round 59 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1119D\":[\"Frets On Fire\",4708,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1119\\\"\\u003eCodeforces Global Round 2\\u003c/a\\u003e\"],\"CodeForces-1870D\":[\"Prefix Purchase\",6444,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1870\\\"\\u003eCodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-404C\":[\"Restore Graph\",5300,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/404\\\"\\u003eCodeforces Round 237 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-888E\":[\"Maximum Subsequence\",7513,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-610C\":[\"Harmony Analysis\",3067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/610\\\"\\u003eCodeforces Round 337 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-743D\":[\"Chloe and pleasant prizes\",4500,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/743\\\"\\u003eCodeforces Round 384 (Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1711956667000,"title":"CodeForces rating 1800 题目集","dislikeCnt":0,"content":"[problem:CodeForces-478C] Table decorations贪心策略(greedy \n[problem:CodeForces-161D] Distance in tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-448D] Multiplication table二分搜索(binary search) 暴力枚举(brute force\n[problem:CodeForces-1328D] Carousel构造算法(constructive algorithms) 动态规划(dp), 图论(graphs), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1509C] The sports festival动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1398D] Colored rectangles动态规划(dp) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1396B] Stoned game暴力枚举(brute force) 构造算法(constructive algorithms), 博弈论(games), 贪心策略(greedy\n[problem:CodeForces-1355C] Count triangles二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-271D] Good substrings数据结构(data structures) 字符串处理(strings\n[problem:CodeForces-1437C] Chef monocarp动态规划(dp) 流(flows), 图匹配(graph matchings), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1475D] Cleaning the phone二分搜索(binary search) 动态规划(dp), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1326D2] Prefix-suffix palindrome (hard version)二分搜索(binary search) 贪心策略(greedy), 哈希表(hashing), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-459D] Pashmak and parmida\u0027s problem数据结构(data structures) 分治算法(divide and conquer), 排序算法(sortings\n[problem:CodeForces-1388C] Uncle bogdan and country happiness深度优先搜索及其变种(dfs and similar) 贪心策略(greedy), 数学(math), 树形结构(trees\n[problem:CodeForces-1525D] Armchairs动态规划(dp) 流(flows), 图匹配(graph matchings), 贪心策略(greedy\n[problem:CodeForces-220B] Little elephant and array构造算法(constructive algorithms) 数据结构(data structures\n[problem:CodeForces-1548B] Integers have friends二分搜索(binary search) 数据结构(data structures), 分治算法(divide and conquer), 数学(math), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-706D] Vasiliy\u0027s multiset二分搜索(binary search) 位掩码(bitmasks), 数据结构(data structures), 树形结构(trees\n[problem:CodeForces-580D] Kefa and dishes位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-1554D] Diane构造算法(constructive algorithms) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1324F] Maximum white subtree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1401D] Maximum distributed tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-300C] Beautiful numbers暴力枚举(brute force) 组合数学(combinatorics\n[problem:CodeForces-584D] Dima and lisa暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-1329A] Dreamoon likes coloring构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1221D] Make the fence great again动态规划(dp \n[problem:CodeForces-1442A] Extreme subtraction构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1500A] Going home暴力枚举(brute force) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1572A] Book二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1327E] Count the blocks组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1381B] Unmerge动态规划(dp \n[problem:CodeForces-1554C] Mikasa二分搜索(binary search) 位掩码(bitmasks), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1709C] Recover an rbs构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1295D] Same gcds数学(math) 数论(number theory\n[problem:CodeForces-1286A] Garland动态规划(dp) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1034A] Enlarge gcd数论(number theory \n[problem:CodeForces-1038D] Slime动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1338B] Edge weight assignment位掩码(bitmasks) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 数学(math), 树形结构(trees\n[problem:CodeForces-1367D] Task on the board构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-242C] King\u0027s path深度优先搜索及其变种(dfs and similar) 图论(graphs), 哈希表(hashing), 最短路算法(shortest paths\n[problem:CodeForces-1335E2] Three blocks palindrome (hard version)暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-543A] Writing code动态规划(dp \n[problem:CodeForces-1560E] Polycarp and string transformation二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-1096D] Easy problem动态规划(dp \n[problem:CodeForces-1409E] Two platforms二分搜索(binary search) 动态规划(dp), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1446B] Catching cheaters动态规划(dp) 字符串处理(strings\n[problem:CodeForces-1535D] Playoff tournament数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1852A] Ntarsis\u0027 set二分搜索(binary search) 数学(math), 数论(number theory\n[problem:CodeForces-1283D] Christmas trees图论(graphs) 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1225D] Power products哈希表(hashing) 数学(math), 数论(number theory\n[problem:CodeForces-471D] Muh and cube walls字符串后缀结构(string suffix structures) 字符串处理(strings\n[problem:CodeForces-1637D] Yet another minimization problem动态规划(dp) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1420D] Rescue nibel!组合数学(combinatorics) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-1517D] Explorer space动态规划(dp) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1426E] Rock Paper, Scissors暴力枚举(brute force), 构造算法(constructive algorithms), 流(flows), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1244D] Paint the tree暴力枚举(brute force) 构造算法(constructive algorithms), 动态规划(dp), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1619D] New year\u0027s problem二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1845D] Rating system二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1841C] Ranom numbers暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 数学(math), 字符串处理(strings\n[problem:CodeForces-1296E1] String coloring (easy version)构造算法(constructive algorithms) 动态规划(dp), 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1063B] Labyrinth图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-1334D] Minimum euler cycle构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1316C] Primitive primes构造算法(constructive algorithms) 数学(math), 三分搜索(ternary search\n[problem:CodeForces-1466E] Apollo versus pan位掩码(bitmasks) 暴力枚举(brute force), 数学(math\n[problem:CodeForces-1922E] Increasing subsequences位掩码(bitmasks) 构造算法(constructive algorithms), 分治算法(divide and conquer), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1491D] Zookeeper and the infinite zoo位掩码(bitmasks) 构造算法(constructive algorithms), 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1935D] Exam in mac二分搜索(binary search) 组合数学(combinatorics), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-3C] Tic-tac-toe暴力枚举(brute force) 博弈论(games), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1758D] Range \u003d √sum二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1728D] Letter picking构造算法(constructive algorithms) 动态规划(dp), 博弈论(games), 双指针算法(two pointers\n[problem:CodeForces-988D] Points and powers of two暴力枚举(brute force) 数学(math\n[problem:CodeForces-1729E] Guess the cycle size交互性问题(interactive) 概率论(probabilities\n[problem:CodeForces-148D] Bag of mice动态规划(dp) 博弈论(games), 数学(math), 概率论(probabilities\n[problem:CodeForces-1552D] Array differentiation位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 数学(math\n[problem:CodeForces-1768D] Lucky permutation构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1462F] The treasure of the segments二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1935C] Messenger in mac二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1213G] Path queries分治算法(divide and conquer) 并查集(dsu), 图论(graphs), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-888E] Maximum subsequence位掩码(bitmasks) 分治算法(divide and conquer), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-830A] Office keys二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1846E2] Rudolf and snowflakes (hard version)二分搜索(binary search) 暴力枚举(brute force), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1859D] Andrey and escape from capygrad二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1394A] Boboniu chats with du动态规划(dp) 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1556D] Take a guess位掩码(bitmasks) 构造算法(constructive algorithms), 交互性问题(interactive), 数学(math\n[problem:CodeForces-1152C] Neko does maths暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-1678B2] Tokitsukaze and good 01-string (hard version)动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1620C] Ba-string暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1870D] Prefix purchase贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-519D] A and b and interesting substrings数据结构(data structures) 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-61D] Eternal victory深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1721D] Maximum and位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1283E] New year parties动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1190B] Tokitsukaze Csl and stone game博弈论(games\n[problem:CodeForces-482B] Interesting array构造算法(constructive algorithms) 数据结构(data structures), 树形结构(trees\n[problem:CodeForces-1648B] Integral array暴力枚举(brute force) 构造算法(constructive algorithms), 数据结构(data structures), 数学(math\n[problem:CodeForces-1611F] Atm and students二分搜索(binary search) 数据结构(data structures), 双指针算法(two pointers\n[problem:CodeForces-1861D] Sorting by multiplication动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1705D] Mark and lightbulbs组合数学(combinatorics) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1187C] Vasya and array构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1304D] Shortest and longest lis构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1156B] Ugly pairs深度优先搜索及其变种(dfs and similar) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-1635D] Infinite set位掩码(bitmasks) 动态规划(dp), 数学(math), 矩阵(matrices), 数论(number theory), 字符串处理(strings\n[problem:CodeForces-1734D] Slime escape数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1805D] A wide Wide graph深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1154E] Two teams数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1848C] Vika and price tags数学(math) 数论(number theory\n[problem:CodeForces-245H] Queries for number of palindromes动态规划(dp) 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1186C] Vus the cossack and strings实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-1809D] Binary string sorting构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1208C] Magic grid构造算法(constructive algorithms \n[problem:CodeForces-1552C] Maximize the intersections组合数学(combinatorics) 构造算法(constructive algorithms), 计算几何(geometry), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1207D] Number of permutations组合数学(combinatorics \n[problem:CodeForces-776C] Molly\u0027s chemicals二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1534D] Lost tree构造算法(constructive algorithms) 交互性问题(interactive), 树形结构(trees\n[problem:CodeForces-1801B] Buying gifts数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1793D] Moscow gorillas二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1720D1] Xor-subsequence (easy version)位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 字符串处理(strings), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1030D] Vasya and triangle计算几何(geometry) 数论(number theory\n[problem:CodeForces-1775D] Friendly spiders深度优先搜索及其变种(dfs and similar) 图论(graphs), 数学(math), 数论(number theory), 最短路算法(shortest paths\n[problem:CodeForces-1042D] Petya and array数据结构(data structures) 分治算法(divide and conquer), 双指针算法(two pointers\n[problem:CodeForces-1872F] Selling a menagerie深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-721C] Journey动态规划(dp) 图论(graphs\n[problem:CodeForces-1477A] Nezzar and board构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-1556C] Compressed bracket sequence暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-600C] Make palindrome构造算法(constructive algorithms) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1118F1] Tree cutting (easy version)深度优先搜索及其变种(dfs and similar) 树形结构(trees\n[problem:CodeForces-1862F] Magic will save the world二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 动态规划(dp\n[problem:CodeForces-687B] Remainders game中国剩余定理(chinese remainder theorem) 数学(math), 数论(number theory\n[problem:CodeForces-1923D] Slimes二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1732C1] Sheikh (easy version)二分搜索(binary search) 位掩码(bitmasks), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1463C] Busy robot实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1750D] Count gcd组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-1630B] Range and partition二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1718A1] Burenka and traditions (easy version)动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1713D] Tournament countdown构造算法(constructive algorithms) 贪心策略(greedy), 交互性问题(interactive), 数论(number theory), 概率论(probabilities\n[problem:CodeForces-1691D] Max geq sum二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 分治算法(divide and conquer), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1450D] Rating compression二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1066D] Boxes packing二分搜索(binary search) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1867D] Cyclic operations暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1915G] Bicycles图论(graphs) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-1583D] Omkar and the meaning of life构造算法(constructive algorithms) 贪心策略(greedy), 交互性问题(interactive\n[problem:CodeForces-1781D] Many perfect squares暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-371D] Vessels数据结构(data structures) 并查集(dsu), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1582F1] Korney korneevich and xor (easy version)位掩码(bitmasks) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1851F] Lisa and the martians位掩码(bitmasks) 贪心策略(greedy), 数学(math), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-983B] Xor-pyramid动态规划(dp \n[problem:CodeForces-1083A] The fair nut and the best path数据结构(data structures) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1176D] Recover it!深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-1151C] Problem for nazar构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1010B] Rocket二分搜索(binary search) 交互性问题(interactive\n[problem:CodeForces-1133E] K balanced teams动态规划(dp) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1299B] Aerodynamic计算几何(geometry \n[problem:CodeForces-404C] Restore graph深度优先搜索及其变种(dfs and similar) 图论(graphs), 排序算法(sortings\n[problem:CodeForces-1675F] Vlad and unfinished business深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-777D] Cloud of hashtags二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1843F1] Omsk metro (simple version)数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 数学(math), 树形结构(trees\n[problem:CodeForces-274B] Zero tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1076D] Edge deletion图论(graphs) 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-442B] Andrey and problem贪心策略(greedy) 数学(math), 概率论(probabilities\n[problem:CodeForces-1249D2] Too many segments (hard version)数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1674F] Desktop rearrangement数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1833G] Ksyusha and chinchilla构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1290B] Irreducible anagrams二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1856E1] Permutree (easy version)深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1148D] Dirty deeds done dirt cheap贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-1249D1] Too many segments (easy version)贪心策略(greedy \n[problem:CodeForces-933A] A twisty movement动态规划(dp \n[problem:CodeForces-909C] Python indentation动态规划(dp \n[problem:CodeForces-1941F] Rudolf and imbalance二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1172A] Nauuo and cards贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1010C] Border数论(number theory \n[problem:CodeForces-527D] Clique problem数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1780D] Bit guessing game二分搜索(binary search) 位掩码(bitmasks), 构造算法(constructive algorithms), 交互性问题(interactive\n[problem:CodeForces-986B] Petr and permutations组合数学(combinatorics) 数学(math\n[problem:CodeForces-1073C] Vasya and robot二分搜索(binary search) 双指针算法(two pointers\n[problem:CodeForces-1617D1] Too many impostors (easy version)构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive\n[problem:CodeForces-913D] Too easy problems二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1119D] Frets on fire二分搜索(binary search) 排序算法(sortings\n[problem:CodeForces-16C] Monitor二分搜索(binary search) 数论(number theory\n[problem:CodeForces-1195D2] Submarine in the rybinsk sea (hard edition)组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-911D] Inversion counting暴力枚举(brute force) 数学(math\n[problem:CodeForces-1016D] Vasya and the matrix构造算法(constructive algorithms) 流(flows), 数学(math\n[problem:CodeForces-1108E1] Array and segments (easy version)暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1254B1] Send boxes to alice (easy version)构造算法(constructive algorithms) 贪心策略(greedy), 数学(math), 数论(number theory), 三分搜索(ternary search), 双指针算法(two pointers\n[problem:CodeForces-894B] Ralph and his magic field组合数学(combinatorics) 构造算法(constructive algorithms), 数学(math), 数论(number theory\n[problem:CodeForces-280B] Maximum xor secondary数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-979B] Treasure hunt贪心策略(greedy \n[problem:CodeForces-1077E] Thematic contests贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-1286B] Numbers on tree构造算法(constructive algorithms) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-869C] The intriguing obsession组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-623A] Graph and string构造算法(constructive algorithms) 图论(graphs\n[problem:CodeForces-1442B] Identify the operations组合数学(combinatorics) 数据结构(data structures), 并查集(dsu), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1179B] Tolik and his uncle构造算法(constructive algorithms \n[problem:CodeForces-1824B1] Luotianyi and the floating islands (easy version)组合数学(combinatorics) 数学(math), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-1109B] Sasha and one more name构造算法(constructive algorithms) 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-946D] Timetable动态规划(dp \n[problem:CodeForces-743D] Chloe and pleasant prizes深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1907F] Shift and reverse贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-1227D2] Optimal subsequences (hard version)数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-140C] New year snowmen二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-922D] Robot vacuum cleaner贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-257C] View angle暴力枚举(brute force) 计算几何(geometry), 数学(math\n[problem:CodeForces-7C] Line数学(math) 数论(number theory\n[problem:CodeForces-585A] Gennady the dentist暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-923C] Perfect security数据结构(data structures) 贪心策略(greedy), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-671A] Recycling bottles动态规划(dp) 计算几何(geometry), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-772A] Voltage keepsake二分搜索(binary search) 数学(math\n[problem:CodeForces-1740E] Hanging hearts构造算法(constructive algorithms) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1852B] Imbalanced arrays构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1282C] Petya and exam贪心策略(greedy) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-33B] String problem最短路算法(shortest paths \n[problem:CodeForces-69E] Subsegments数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-483B] Friends and presents二分搜索(binary search) 数学(math\n[problem:CodeForces-1081D] Maximum distance并查集(dsu) 图论(graphs), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-1468J] Road reform并查集(dsu) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1062D] Fun with integers深度优先搜索及其变种(dfs and similar) 图论(graphs), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-358D] Dima and hares动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1129A2] Toy train暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-1508B] Almost sorted二分搜索(binary search) 组合数学(combinatorics), 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1138B] Circus暴力枚举(brute force) 贪心策略(greedy), 数学(math), 字符串处理(strings\n[problem:CodeForces-652D] Nested segments数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-768C] Jon snow and his favourite number暴力枚举(brute force) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-813B] The golden age暴力枚举(brute force) 数学(math\n[problem:CodeForces-551B] Zgukistringz暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-700B] Connecting universities深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-363D] Renting bikes二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-1280B] Beingawesomeism实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-1005E1] Median on segments (permutations edition)排序算法(sortings \n[problem:CodeForces-1107D] Compression动态规划(dp) 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-487A] Fight the monster二分搜索(binary search) 暴力枚举(brute force), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1759F] All possible digits二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-612D] The union of k-segments贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-989C] A mist of florescence构造算法(constructive algorithms) 图论(graphs\n[problem:CodeForces-1904D2] Set to max (hard version)构造算法(constructive algorithms) 数据结构(data structures), 分治算法(divide and conquer), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1016C] Vasya and the mushrooms动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1136D] Nastya is buying lunch贪心策略(greedy \n[problem:CodeForces-914C] Travelling salesman and special numbers暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp\n[problem:CodeForces-799C] Fountains二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-675D] Tree construction数据结构(data structures) 树形结构(trees\n[problem:CodeForces-1082D] Maximum diameter graph构造算法(constructive algorithms) 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1930D1] Sum over all substrings (easy version)暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1196E] Connected component on a chessboard构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-827B] High load构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-917A] The monster动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-666A] Reberland linguistics动态规划(dp) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-991E] Bus number暴力枚举(brute force) 组合数学(combinatorics), 数学(math\n[problem:CodeForces-733C] Epidemic in monstropolis构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-663A] Rebus构造算法(constructive algorithms) 表达式解析(expression parsing), 贪心策略(greedy), 数学(math\n[problem:CodeForces-963A] Alternating sum数学(math) 数论(number theory\n[problem:CodeForces-263D] Cycle in graph深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-665D] Simple subset构造算法(constructive algorithms) 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-863D] Yet another array queries problem数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-772B] Volatile kite计算几何(geometry \n[problem:CodeForces-492D] Vanya and computer game二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-652C] Foe pairs组合数学(combinatorics) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1666C] Connect the points暴力枚举(brute force) 构造算法(constructive algorithms), 计算几何(geometry\n[problem:CodeForces-592C] The big race数学(math \n[problem:CodeForces-794C] Naming company博弈论(games) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-301A] Yaroslav and sequence构造算法(constructive algorithms \n[problem:CodeForces-939E] Maximize!二分搜索(binary search) 贪心策略(greedy), 三分搜索(ternary search), 双指针算法(two pointers\n[problem:CodeForces-873D] Merge sort构造算法(constructive algorithms) 分治算法(divide and conquer\n[problem:CodeForces-1666L] Labyrinth深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-822D] My pretty girl noora暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-747D] Winter is coming动态规划(dp) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1250J] The parade二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-641C] Little artem and dance暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1267L] Lexicography构造算法(constructive algorithms) 字符串处理(strings\n[problem:CodeForces-173B] Chamber of secrets深度优先搜索及其变种(dfs and similar) 最短路算法(shortest paths\n[problem:CodeForces-33C] Wonderful randomized sum贪心策略(greedy \n[problem:CodeForces-1846F] Rudolph and mimic构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive\n[problem:CodeForces-1725M] Moving both hands动态规划(dp) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-610C] Harmony analysis构造算法(constructive algorithms \n[problem:CodeForces-190B] Surrounded计算几何(geometry \n[problem:CodeForces-645D] Robot rapping results report二分搜索(binary search) 动态规划(dp), 图论(graphs\n[problem:CodeForces-351A] Jeff and rounding动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-899D] Shovel sale构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-725D] Contest balloons数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-847E] Packmen二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-626D] Jerry\u0027s protest暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 概率论(probabilities\n[problem:CodeForces-846C] Four segments暴力枚举(brute force) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-333B] Chips贪心策略(greedy \n[problem:CodeForces-1252H] Twin buildings贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-436C] Dungeons and candies并查集(dsu) 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-513B2] Permutations位掩码(bitmasks) 分治算法(divide and conquer), 数学(math\n[problem:CodeForces-1250B] The feast and the bus暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1267J] Just arrange the icons贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-77B] Falling anvils数学(math) 概率论(probabilities\n[problem:CodeForces-603B] Moodular arithmetic组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 数学(math), 数论(number theory\n[problem:CodeForces-402D] Upgrading array动态规划(dp) 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-853B] Jury meeting贪心策略(greedy) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1067B] Multihedgehog深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-691C] Exponential notation实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-1725H] Hot black hot white构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-38E] Let\u0027s go rolling!动态规划(dp) 排序算法(sortings\n[problem:CodeForces-846B] Math show暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-432C] Prime swaps贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-538D] Weird chess暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-433C] Ryouko\u0027s memory note实现问题,编程技巧,模拟(implementation) 数学(math), 排序算法(sortings\n[problem:CodeForces-863C] 1-2-3图论(graphs) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1177B] Digits sequence (hard edition)二分搜索(binary search) 分治算法(divide and conquer), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-952D] I\u0027m feeling lucky!概率论(probabilities \n[problem:CodeForces-730B] Minimum and maximum构造算法(constructive algorithms) 交互性问题(interactive\n[problem:CodeForces-1575D] Divisible by twenty-five暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 动态规划(dp\n[problem:CodeForces-336C] Vasily the bear and sequence暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数论(number theory\n[problem:CodeForces-141C] Queue构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-845D] Driving test数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-847C] Sum of nestings构造算法(constructive algorithms \n[problem:CodeForces-132C] Logo turtle动态规划(dp \n[problem:CodeForces-778B] Bitwise formula位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 表达式解析(expression parsing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-140D] New year contest贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-846F] Random query数据结构(data structures) 数学(math), 概率论(probabilities), 双指针算法(two pointers\n[problem:CodeForces-533E] Correcting mistakes构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy), 哈希表(hashing), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-145B] Lucky number 2构造算法(constructive algorithms \n[problem:CodeForces-142B] Help general构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-724C] Ray tracing贪心策略(greedy) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-167B] Wizards and huge prize动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-222C] Reducing fractions实现问题,编程技巧,模拟(implementation) 数学(math), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-73C] Lionage ii动态规划(dp \n[problem:CodeForces-67A] Partial teacher动态规划(dp) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1090D] Similar arrays构造算法(constructive algorithms \n[problem:CodeForces-452B] 4-point polyline暴力枚举(brute force) 构造算法(constructive algorithms), 计算几何(geometry), 树形结构(trees\n[problem:CodeForces-58C] Trees暴力枚举(brute force \n[problem:CodeForces-255D] Mr. bender and square二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-328A] Iq test实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-187B] Algorace动态规划(dp) 最短路算法(shortest paths\n[problem:CodeForces-30C] Shooting gallery动态规划(dp) 概率论(probabilities\n[problem:CodeForces-1912K] Kim\u0027s quest位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp\n[problem:CodeForces-49D] Game暴力枚举(brute force) 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-216C] Hiring staff贪心策略(greedy \n[problem:CodeForces-727D] T-shirts distribution构造算法(constructive algorithms) 流(flows), 贪心策略(greedy\n[problem:CodeForces-65A] Harry potter and three spells实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-51C] Three base stations二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-513G1] Inversions problem暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-1505E] Cakewalk 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-79C] Beaver数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 哈希表(hashing), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-180E] Cubes二分搜索(binary search) 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-234F] Fence动态规划(dp \n[problem:CodeForces-252B] Unsorting array暴力枚举(brute force) 排序算法(sortings\n[problem:CodeForces-575H] Bots组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-83B] Doctor二分搜索(binary search) 数学(math), 排序算法(sortings\n[problem:CodeForces-926B] Add point \n[problem:CodeForces-185B] Mushroom scientists数学(math) 三分搜索(ternary search\n[problem:CodeForces-883H] Palindromic cut暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-730A] Toda 2贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-117B] Very interesting game暴力枚举(brute force) 数论(number theory\n[problem:CodeForces-370C] Mittens构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-847K] Travel cards贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-140B] New year cards暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-638C] Road improvement 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-325B] Stadium and games二分搜索(binary search) 数学(math\n[problem:CodeForces-254C] Anagram贪心策略(greedy) 字符串处理(strings\n[problem:CodeForces-89A] Robbery贪心策略(greedy \n[problem:CodeForces-182E] Wooden fence动态规划(dp \n[problem:CodeForces-120H] Brevity is soul of wit图匹配(graph matchings \n[problem:CodeForces-802A] Heidi and library (easy)贪心策略(greedy \n[problem:CodeForces-238B] Boring partition构造算法(constructive algorithms \n[problem:CodeForces-62B] Tyndex.brome二分搜索(binary search) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-201B] Guess that car!数学(math) 三分搜索(ternary search\n[problem:CodeForces-251B] Playing with permutations实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-15B] Laser数学(math \n[problem:CodeForces-24C] Sequence of points计算几何(geometry) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-690D2] The wall (medium)组合数学(combinatorics \n[problem:CodeForces-958F2] Lightsabers (medium)二分搜索(binary search) 双指针算法(two pointers\n[problem:CodeForces-95B] Lucky numbers动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1402A] Fancy fence 数据结构(data structures), 并查集(dsu), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-195C] Try and catch表达式解析(expression parsing) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-87B] Vasya and types实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-178B3] Greedy merchant \n[problem:CodeForces-630M] Turn计算几何(geometry) 数学(math\n[problem:CodeForces-123B] Squares数学(math \n[problem:CodeForces-883K] Road widening构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-174C] Range increments数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-802B] Heidi and library (medium)数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-420B] Online meeting实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-200C] Football championship暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-66C] Petya and file system数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-85B] Embassy queue数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-46D] Parking lot数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-440C] One-based arithmetic暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer\n[problem:CodeForces-45J] Planting trees构造算法(constructive algorithms \n[problem:CodeForces-200D] Programming language二分搜索(binary search) 暴力枚举(brute force), 表达式解析(expression parsing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-37B] Computer game贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-105B] Dark assembly暴力枚举(brute force) 概率论(probabilities\n[problem:CodeForces-48C] The race数学(math \n[problem:CodeForces-67B] Restoration of the permutation贪心策略(greedy \n[problem:CodeForces-54B] Cutting jigsaw puzzle哈希表(hashing) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1505D] Xenolith? hippodrome? 数论(number theory\n[problem:CodeForces-44D] Hyperdrive数学(math \n[problem:CodeForces-638D] Three-dimensional turtle super computer暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-162C] Prime factorization \n[problem:CodeForces-120G] Boom实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-784C] Intercalc 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-690E1] Photographs (i \n[problem:CodeForces-409E] Dome \n[problem:CodeForces-180A] Defragmentation实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1488B] Rbs deletion 贪心策略(greedy\n[problem:CodeForces-178F1] Representative samplin \n[problem:CodeForces-1769D1] Игра в девятку i 暴力枚举(brute force), 动态规划(dp\n[problem:CodeForces-1571C] Rhyme 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-130J] Date calculation \n[problem:CodeForces-1571D] Sweepstake 暴力枚举(brute force), 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-162B] Binary notation \n[problem:CodeForces-1910D] Remove and add 贪心策略(greedy\n[problem:CodeForces-177F1] Script generatio \n[problem:CodeForces-64D] Presents 贪心策略(greedy\n[problem:CodeForces-1002C2] Distinguish zero state and plus state without error \n[problem:CodeForces-470B] Hexakosioihexekontahexaphobia \n[problem:CodeForces-188H] Stack 表达式解析(expression parsing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-64E] Prime segment 暴力枚举(brute force), 数学(math), 数论(number theory\n[problem:CodeForces-207A2] Beaver\u0027s calculator 1.0贪心策略(greedy \n[problem:CodeForces-162H] Alternating case \n[problem:CodeForces-162F] Factorial zeros \n[problem:CodeForces-683E] Hammer throwing \n[problem:CodeForces-72A] Goshtasp Vishtasp and eidi , 贪心策略(greedy), 数学(math\n[problem:CodeForces-162E] Hq9+ \n[problem:CodeForces-72E] Ali goes shopping 暴力枚举(brute force), 字符串处理(strings\n[problem:CodeForces-153B] Binary notation \n[problem:CodeForces-683F] Reformat the string \n[problem:CodeForces-100F] Polynom 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-207D1] The beaver\u0027s problem - \n[problem:CodeForces-100G] Name the album 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-162J] Brackets \n[problem:CodeForces-207D9] The beaver\u0027s problem - \n","threadId":188468,"likeCnt":0,"createTime":1711956667000,"isWorkbook":true,"viewCnt":58,"openness":2,"fav":false,"id":4790,"trustable":false}