Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-281B\":[\"Nearest Fraction\",3045,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/281\\\"\\u003eCodeforces Round 172 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1906M\":[\"Triangle Construction\",2337,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-32C\":[\"Flea\",2370,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/32\\\"\\u003eCodeforces Beta Round 32 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-20A\":[\"BerOS file system\",6490,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/20\\\"\\u003eCodeforces Alpha Round 20 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-56C\":[\"Corporation Mail\",1211,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/56\\\"\\u003eCodeforces Beta Round 52 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1267E\":[\"Elections\",3188,\"\\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-1340B\":[\"Nastya and Scoreboard\",7672,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1340\\\"\\u003eCodeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov!\\u003c/a\\u003e\"],\"CodeForces-1594D\":[\"The Number of Imposters\",7372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1594\\\"\\u003eCodeforces Round 747 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1473D\":[\"Program\",9760,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1473\\\"\\u003eEducational Codeforces Round 102 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1146C\":[\"Tree Diameter\",3593,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1146\\\"\\u003eForethought Future Cup - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1279D\":[\"Santa\\u0027s Bot\",6100,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1279\\\"\\u003eEducational Codeforces Round 79 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1037D\":[\"Valid BFS?\",15162,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1037\\\"\\u003eManthan, Codefest 18 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-739A\":[\"Alyona and mex\",7839,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/739\\\"\\u003eCodeforces Round 381 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1485C\":[\"Floor and Mod\",9879,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1485\\\"\\u003eCodeforces Round 701 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-617D\":[\"Polyline\",4466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/617\\\"\\u003eCodeforces Round 340 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1001I\":[\"Deutsch-Jozsa algorithm\",397,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1001\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018 - Warmup\\u003c/a\\u003e\"],\"CodeForces-44H\":[\"Phone Number\",1883,\"\\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-160C\":[\"Find Pair\",3668,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/160\\\"\\u003eCodeforces Round 111 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-183B\":[\"Zoo\",754,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/183\\\"\\u003eCroc Champ 2012 - Final\\u003c/a\\u003e\"],\"CodeForces-183A\":[\"Headquarters\",639,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/183\\\"\\u003eCroc Champ 2012 - Final\\u003c/a\\u003e\"],\"CodeForces-1157E\":[\"Minimum Array\",8572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1157\\\"\\u003eCodeforces Round 555 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1903D1\":[\"Maximum And Queries (easy version)\",5072,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1903\\\"\\u003eCodeforces Round 912 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1254A\":[\"Feeding Chicken\",5072,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1254\\\"\\u003eCodeforces Round 601 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1278C\":[\"Berry Jam\",7841,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1278\\\"\\u003eEducational Codeforces Round 78 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1472E\":[\"Correct Placement\",8008,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1472\\\"\\u003eCodeforces Round 693 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1000C\":[\"Covered Points Count\",7408,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1000\\\"\\u003eEducational Codeforces Round 46 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1335E1\":[\"Three Blocks Palindrome (easy version)\",10657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1335\\\"\\u003eCodeforces Round 634 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-605B\":[\"Lazy Student\",3569,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/605\\\"\\u003eCodeforces Round 335 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-931C\":[\"Laboratory Work\",3520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/931\\\"\\u003eCodeforces Round 468 (Div. 2, based on Technocup 2018 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1690F\":[\"Shifting String\",6915,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1690\\\"\\u003eCodeforces Round 797 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-171H\":[\"A polyline\",286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/171\\\"\\u003eApril Fools Day Contest\\u003c/a\\u003e\"],\"CodeForces-30B\":[\"Codeforces World Finals\",1426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/30\\\"\\u003eCodeforces Beta Round 30 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-42B\":[\"Game of chess unfinished\",1008,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/42\\\"\\u003eCodeforces Beta Round 41\\u003c/a\\u003e\"],\"CodeForces-66D\":[\"Petya and His Friends\",3500,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/66\\\"\\u003eCodeforces Beta Round 61 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-207B3\":[\"Military Trainings\",159,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-1168A\":[\"Increasing by Modulo\",6466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1168\\\"\\u003eCodeforces Round 562 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1807F\":[\"Bouncy Ball\",5981,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1807\\\"\\u003eCodeforces Round 859 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1580A\":[\"Portal\",3565,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1580\\\"\\u003eCodeforces Round 745 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1592C\":[\"Bakry and Partitioning\",7675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1592\\\"\\u003eCodeforces Round 746 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1144F\":[\"Graph Without Long Directed Paths\",11389,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1144\\\"\\u003eCodeforces Round 550 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1023D\":[\"Array Restoration\",4064,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1023\\\"\\u003eCodeforces Round 504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)\\u003c/a\\u003e\"],\"CodeForces-1253D\":[\"Harmonious Graph\",9494,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1253\\\"\\u003eCodeforces Round 600 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-507C\":[\"Guess Your Way Out!\",4538,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/507\\\"\\u003eCodeforces Round 287 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1132C\":[\"Painting the Fence\",5628,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1132\\\"\\u003eEducational Codeforces Round 61 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-518D\":[\"Ilya and Escalator\",7626,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/518\\\"\\u003eCodeforces Round 293 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-833A\":[\"The Meaningless Game\",6437,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/833\\\"\\u003eCodeforces Round 426 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-954C\":[\"Matrix Walk\",3871,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-978G\":[\"Petya\\u0027s Exams\",4472,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/978\\\"\\u003eCodeforces Round 481 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-193A\":[\"Cutting Figure\",4040,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/193\\\"\\u003eCodeforces Round 122 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-31C\":[\"Schedule\",1970,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/31\\\"\\u003eCodeforces Beta Round 31 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1361A\":[\"Johnny and Contribution\",8219,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1361\\\"\\u003eCodeforces Round 647 (Div. 1) - Thanks, Algo Muse!\\u003c/a\\u003e\"],\"CodeForces-627A\":[\"XOR Equation\",4157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/627\\\"\\u003e8VC Venture Cup 2016 - Final Round\\u003c/a\\u003e\"],\"CodeForces-627B\":[\"Factory Repairs\",2771,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/627\\\"\\u003e8VC Venture Cup 2016 - Final Round\\u003c/a\\u003e\"],\"CodeForces-409D\":[\"Big Data\",1742,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/409\\\"\\u003eApril Fools Day Contest 2014\\u003c/a\\u003e\"],\"CodeForces-409C\":[\"Magnum Opus\",1968,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/409\\\"\\u003eApril Fools Day Contest 2014\\u003c/a\\u003e\"],\"CodeForces-409B\":[\"Mysterious Language\",1361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/409\\\"\\u003eApril Fools Day Contest 2014\\u003c/a\\u003e\"],\"CodeForces-747E\":[\"Comments\",2054,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/747\\\"\\u003eCodeforces Round 387 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-409A\":[\"The Great Game\",2575,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/409\\\"\\u003eApril Fools Day Contest 2014\\u003c/a\\u003e\"],\"CodeForces-1131F\":[\"Asya And Kittens\",6736,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1131\\\"\\u003eCodeforces Round 541 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-711C\":[\"Coloring Trees\",8633,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/711\\\"\\u003eCodeforces Round 369 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-977F\":[\"Consecutive Subsequence\",18176,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/977\\\"\\u003eCodeforces Round 479 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1916D\":[\"Mathematical Problem\",7875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1916\\\"\\u003eGood Bye 2023\\u003c/a\\u003e\"],\"CodeForces-290C\":[\"WTF?\",1536,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/290\\\"\\u003eApril Fools Day Contest 2013\\u003c/a\\u003e\"],\"CodeForces-382C\":[\"Arithmetic Progression\",8566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/382\\\"\\u003eCodeforces Round 224 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1562D1\":[\"Two Hundred Twenty One (easy version)\",6277,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1562\\\"\\u003eCodeforces Round 741 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-140A\":[\"New Year Table\",4643,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/140\\\"\\u003eCodeforces Round 100\\u003c/a\\u003e\"],\"CodeForces-164A\":[\"Variable, or There and Back Again\",1091,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/164\\\"\\u003eVK Cup 2012 Round 3\\u003c/a\\u003e\"],\"CodeForces-176B\":[\"Word Cut\",1967,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/176\\\"\\u003eCroc Champ 2012 - Round 2\\u003c/a\\u003e\"],\"CodeForces-297A\":[\"Parity Game\",3731,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/297\\\"\\u003eCodeforces Round 180 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1102E\":[\"Monotonic Renumeration\",5873,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1102\\\"\\u003eCodeforces Round 531 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1211C\":[\"Ice Cream\",478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1211\\\"\\u003eKotlin Heroes: Episode 2\\u003c/a\\u003e\"],\"CodeForces-1550C\":[\"Manhattan Subarrays\",10068,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1550\\\"\\u003eEducational Codeforces Round 111 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1114C\":[\"Trailing Loves (or L\\u0027oeufs?)\",7643,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1114\\\"\\u003eCodeforces Round 538 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1792D\":[\"Fixed Prefix Permutations\",5922,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1792\\\"\\u003eEducational Codeforces Round 142 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-925B\":[\"Resource Distribution\",2216,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/925\\\"\\u003eVK Cup 2018 - Round 3\\u003c/a\\u003e\"],\"CodeForces-1368D\":[\"AND, OR and square sum\",11950,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1368\\\"\\u003eCodeforces Global Round 8\\u003c/a\\u003e\"],\"CodeForces-1598D\":[\"Training Session\",8503,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1598\\\"\\u003eEducational Codeforces Round 115 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-949B\":[\"A Leapfrog in the Array\",3811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/949\\\"\\u003eCodeforces Round 469 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1320B\":[\"Navigation System\",5897,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1320\\\"\\u003eCodeforces Round 625 (Div. 1, based on Technocup 2020 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1453C\":[\"Triangles\",6113,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1453\\\"\\u003eCodeforces Round 688 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1332D\":[\"Walk on Matrix\",8033,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1332\\\"\\u003eCodeforces Round 630 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1695C\":[\"Zero Path\",10544,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1695\\\"\\u003eCodeforces Round 801 (Div. 2) and EPIC Institute of Technology Round\\u003c/a\\u003e\"],\"CodeForces-900C\":[\"Remove Extra One\",4736,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/900\\\"\\u003eCodeforces Round 450 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-924C\":[\"Riverside Curio\",3817,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/924\\\"\\u003eVK Cup 2018 - Round 2\\u003c/a\\u003e\"],\"CodeForces-316G1\":[\"Good Substrings\",952,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-260C\":[\"Balls and Boxes\",3164,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/260\\\"\\u003eCodeforces Round 158 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-490C\":[\"Hacking Cypher\",9260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/490\\\"\\u003eCodeforces Round 279 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-163A\":[\"Substring and Subsequence\",2979,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/163\\\"\\u003eVK Cup 2012 Round 2\\u003c/a\\u003e\"],\"CodeForces-1210B\":[\"Marcin and Training Camp\",5730,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1210\\\"\\u003eDasha Code Championship - SPb Finals Round (only for onsite-finalists)\\u003c/a\\u003e\"],\"CodeForces-718A\":[\"Efim and Strange Grade\",4512,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/718\\\"\\u003eCodeforces Round 373 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1210A\":[\"Anadi and Domino\",5250,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1210\\\"\\u003eDasha Code Championship - SPb Finals Round (only for onsite-finalists)\\u003c/a\\u003e\"],\"CodeForces-49C\":[\"Disposition\",1780,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/49\\\"\\u003eCodeforces Beta Round 46 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1670D\":[\"Very Suspicious\",5033,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1670\\\"\\u003eCodeforces Round 788 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-815A\":[\"Karen and Game\",5713,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/815\\\"\\u003eCodeforces Round 419 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-827A\":[\"String Reconstruction\",4152,\"\\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-1476D\":[\"Journey\",8560,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1476\\\"\\u003eEducational Codeforces Round 103 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-936A\":[\"Save Energy!\",4599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/936\\\"\\u003eCodeforces Round 467 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1343D\":[\"Constant Palindrome Sum\",12506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1343\\\"\\u003eCodeforces Round 636 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-283B\":[\"Cow Program\",3861,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/283\\\"\\u003eCodeforces Round 174 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-295B\":[\"Greg and Graph\",14538,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/295\\\"\\u003eCodeforces Round 179 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1148C\":[\"Crazy Diamond\",5183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1148\\\"\\u003eCodeforces Global Round 3\\u003c/a\\u003e\"],\"CodeForces-22C\":[\"System Administrator\",3247,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/22\\\"\\u003eCodeforces Beta Round 22 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-198A\":[\"About Bacteria\",3161,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/198\\\"\\u003eCodeforces Round 125 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1451D\":[\"Circle Game\",9751,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1451\\\"\\u003eCodeforces Round 685 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1027D\":[\"Mouse Hunt\",7451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1027\\\"\\u003eEducational Codeforces Round 49 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1257D\":[\"Yet Another Monster Killing Problem\",7575,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1257\\\"\\u003eEducational Codeforces Round 76 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1681D\":[\"Required Length\",9363,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1681\\\"\\u003eEducational Codeforces Round 129 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-729C\":[\"Road to Cinema\",4112,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/729\\\"\\u003eTechnocup 2017 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1706D1\":[\"Chopping Carrots (Easy Version)\",6746,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1706\\\"\\u003eCodeforces Round 809 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-923A\":[\"Primal Sport\",5167,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/923\\\"\\u003eVK Cup 2018 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1693B\":[\"Fake Plastic Trees\",8152,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1693\\\"\\u003eCodeforces Round 800 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-729D\":[\"Sea Battle\",4018,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/729\\\"\\u003eTechnocup 2017 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-813C\":[\"The Tag Game\",6400,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"CodeForces-910C\":[\"Minimum Sum\",2015,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/910\\\"\\u003eTesting Round 14 (Unrated)\\u003c/a\\u003e\"],\"CodeForces-161B\":[\"Discounts\",2057,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/161\\\"\\u003eVK Cup 2012 Round 1\\u003c/a\\u003e\"],\"CodeForces-294B\":[\"Shaass and Bookshelf\",4882,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/294\\\"\\u003eCodeforces Round 178 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-35B\":[\"Warehouse\",1115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/35\\\"\\u003eCodeforces Beta Round 35 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1268A\":[\"Long Beautiful Integer\",8452,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1268\\\"\\u003eCodeforces Round 609 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1551D1\":[\"Domino (easy version)\",6938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1551\\\"\\u003eCodeforces Round 734 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-35D\":[\"Animals\",3816,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/35\\\"\\u003eCodeforces Beta Round 35 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1111C\":[\"Creative Snap\",6599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1111\\\"\\u003eCodeCraft-19 and Codeforces Round 537 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1111B\":[\"Average Superhero Gang Power\",6633,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1111\\\"\\u003eCodeCraft-19 and Codeforces Round 537 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1583C\":[\"Omkar and Determination\",6835,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1583\\\"\\u003eTechnocup 2022 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1256C\":[\"Platforms Jumping\",7179,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1256\\\"\\u003eCodeforces Round 598 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1571E\":[\"Fix the String\",322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1571\\\"\\u003eKotlin Heroes: Episode 8\\u003c/a\\u003e\"],\"CodeForces-1365D\":[\"Solve The Maze\",16696,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1365\\\"\\u003eCodeforces Round 648 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1474C\":[\"Array Destruction\",12461,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1474\\\"\\u003eCodeforces Round 696 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1692H\":[\"Gambling\",7139,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1692\\\"\\u003eCodeforces Round 799 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-84C\":[\"Biathlon\",1663,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/84\\\"\\u003eCodeforces Beta Round 72 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1619E\":[\"MEX and Increments\",8783,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1619\\\"\\u003eCodeforces Round 762 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1934C\":[\"Find a Mine\",5959,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1934\\\"\\u003eCodeforces Round 931 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1849D\":[\"Array Painting\",7794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1849\\\"\\u003eEducational Codeforces Round 152 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-156A\":[\"Message\",3185,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/156\\\"\\u003eCodeforces Round 110 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-168B\":[\"Wizards and Minimal Spell\",1301,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/168\\\"\\u003eCodeforces Round 114 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-917B\":[\"MADMAX\",3650,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/917\\\"\\u003eCodeforces Round 459 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-929C\":[\"Красивая команда\",1137,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/929\\\"\\u003eVK Cup 2018 - Квалификация 2\\u003c/a\\u003e\"],\"CodeForces-1295B\":[\"Infinite Prefixes\",9347,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1295\\\"\\u003eEducational Codeforces Round 81 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1089E\":[\"Easy Chess\",1960,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1089\\\"\\u003e2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1041D\":[\"Glider\",6331,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1041\\\"\\u003eCodeforces Round 509 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1392D\":[\"Omkar and Bed Wars\",8561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1392\\\"\\u003eCodeforces Global Round 10\\u003c/a\\u003e\"],\"CodeForces-1608C\":[\"Game Master\",6692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1608\\\"\\u003eCodeforces Round 758 (Div.1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1002C1\":[\"Distinguish zero state and plus state with minimum error\",296,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1002\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018\\u003c/a\\u003e\"],\"CodeForces-471C\":[\"MUH and House of Cards\",3793,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/471\\\"\\u003eCodeforces Round 269 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-131E\":[\"Yet Another Task with Queens\",1906,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/131\\\"\\u003eCodeforces Beta Round 95 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1945E\":[\"Binary Search\",6767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1945\\\"\\u003eCodeforces Round 935 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-276D\":[\"Little Girl and Maximum XOR\",14224,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/276\\\"\\u003eCodeforces Round 169 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-385C\":[\"Bear and Prime Numbers\",10222,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/385\\\"\\u003eCodeforces Round 226 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1618E\":[\"Singers\\u0027 Tour\",7041,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1618\\\"\\u003eCodeforces Round 760 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1129A1\":[\"Toy Train (Simplified)\",3802,\"\\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-288C\":[\"Polo the Penguin and XOR operation\",2392,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/288\\\"\\u003eCodeforces Round 177 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1715C\":[\"Monoblock\",8396,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1715\\\"\\u003eCodeforces Round 816 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1185D\":[\"Extra Element\",6614,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1185\\\"\\u003eCodeforces Round 568 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1002B4\":[\"Distinguish four 2-qubit states - 2\",303,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1002\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018\\u003c/a\\u003e\"],\"CodeForces-1015E1\":[\"Stars Drawing (Easy Edition)\",5660,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1015\\\"\\u003eCodeforces Round 501 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1702F\":[\"Equate Multisets\",8077,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1702\\\"\\u003eCodeforces Round 805 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1714G\":[\"Path Prefixes\",7311,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1714\\\"\\u003eCodeforces Round 811 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-360A\":[\"Levko and Array Recovery\",2080,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/360\\\"\\u003eCodeforces Round 210 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-275B\":[\"Convex Shape\",2903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/275\\\"\\u003eCodeforces Round 168 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-287B\":[\"Pipeline\",9926,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/287\\\"\\u003eCodeforces Round 176 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1835A\":[\"k-th equality\",7448,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1835\\\"\\u003eCodeforces Round 880 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-818D\":[\"Multicolored Cars\",3674,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"CodeForces-915C\":[\"Permute Digits\",7611,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1051D\":[\"Bicolorings\",7711,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1051\\\"\\u003eEducational Codeforces Round 51 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-926I\":[\"A Vital Problem\",649,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/926\\\"\\u003eVK Cup 2018 - Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-82B\":[\"Sets\",2102,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/82\\\"\\u003eYandex.Algorithm 2011: Qualification 2\\u003c/a\\u003e\"],\"CodeForces-590A\":[\"Median Smoothing\",3997,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/590\\\"\\u003eCodeforces Round 327 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-493D\":[\"Vasya and Chess\",10305,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/493\\\"\\u003eCodeforces Round 281 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-130G\":[\"CAPS LOCK ON\",273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/130\\\"\\u003eUnknown Language Round 4\\u003c/a\\u003e\"],\"CodeForces-1810D\":[\"Climbing the Tree\",7148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1810\\\"\\u003eCodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1822F\":[\"Gardening Friends\",5659,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1822\\\"\\u003eCodeforces Round 867 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1118D2\":[\"Coffee and Coursework (Hard Version)\",6286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1118\\\"\\u003eCodeforces Round 540 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1118D1\":[\"Coffee and Coursework (Easy version)\",5713,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1118\\\"\\u003eCodeforces Round 540 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-926C\":[\"Is This a Zebra?\",1865,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/926\\\"\\u003eVK Cup 2018 - Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-938C\":[\"Constructing Tests\",3423,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/938\\\"\\u003eEducational Codeforces Round 38 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1931F\":[\"Chat Screenshots\",6997,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1931\\\"\\u003eCodeforces Round 925 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1280A\":[\"Cut and Paste\",5229,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1280\\\"\\u003eCodeforces Round 607 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1292B\":[\"Aroma\\u0027s Search\",6138,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1292\\\"\\u003eCodeforces Round 614 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-76D\":[\"Plus and xor\",2151,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/76\\\"\\u003eAll-Ukrainian School Olympiad in Informatics\\u003c/a\\u003e\"],\"CodeForces-76E\":[\"Points\",1792,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/76\\\"\\u003eAll-Ukrainian School Olympiad in Informatics\\u003c/a\\u003e\"],\"CodeForces-451C\":[\"Predict Outcome of the Game\",3457,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/451\\\"\\u003eCodeforces Round 258 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1829H\":[\"Don\\u0027t Blame Me\",7236,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1829\\\"\\u003eCodeforces Round 871 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-245C\":[\"Game with Coins\",1785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/245\\\"\\u003eCROC-MBTU 2012, Elimination Round (ACM-ICPC)\\u003c/a\\u003e\"],\"CodeForces-148C\":[\"Terse princess\",3351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/148\\\"\\u003eCodeforces Round 105 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1142A\":[\"The Beatles\",3430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1142\\\"\\u003eCodeforces Round 549 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-269B\":[\"Greenhouse Effect\",6650,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/269\\\"\\u003eCodeforces Round 165 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1543D1\":[\"RPD and Rap Sheet (Easy Version)\",7466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1543\\\"\\u003eCodeforces Round 730 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1360F\":[\"Spy-string\",12098,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1360\\\"\\u003eCodeforces Round 644 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-596C\":[\"Wilbur and Points\",2312,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/596\\\"\\u003eCodeforces Round 331 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-584C\":[\"Marina and Vasya\",6440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/584\\\"\\u003eCodeforces Round 324 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1709D\":[\"Rorororobot\",8271,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1709\\\"\\u003eEducational Codeforces Round 132 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-53B\":[\"Blog Photo\",1446,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/53\\\"\\u003eCodeforces Beta Round 49 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1901D\":[\"Yet Another Monster Fight\",6195,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1901\\\"\\u003eEducational Codeforces Round 158 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-65B\":[\"Harry Potter and the History of Magic\",1467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/65\\\"\\u003eCodeforces Beta Round 60\\u003c/a\\u003e\"],\"CodeForces-159E\":[\"Zebra Tower\",1031,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/159\\\"\\u003eVK Cup 2012 Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-1044A\":[\"The Tower is Going Home\",2902,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1044\\\"\\u003eLyft Level 5 Challenge 2018 - Final Round\\u003c/a\\u003e\"],\"CodeForces-1056C\":[\"Pick Heroes\",2382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1056\\\"\\u003eMail.Ru Cup 2018 Round 3\\u003c/a\\u003e\"],\"CodeForces-1383A\":[\"String Transformation 1\",10337,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1383\\\"\\u003eCodeforces Round 659 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1068C\":[\"Colored Rooks\",3246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1068\\\"\\u003eCodeforces Round 518 (Div. 2) [Thanks, Mail.Ru!]\\u003c/a\\u003e\"],\"CodeForces-1153C\":[\"Serval and Parenthesis Sequence\",7841,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1153\\\"\\u003eCodeforces Round 551 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1032C\":[\"Playing Piano\",4024,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1032\\\"\\u003eTechnocup 2019 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1141E\":[\"Superhero Battle\",6753,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1141\\\"\\u003eCodeforces Round 547 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-498A\":[\"Crazy Town\",6738,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/498\\\"\\u003eCodeforces Round 284 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-486C\":[\"Palindrome Transformation\",11844,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/486\\\"\\u003eCodeforces Round 277 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-474D\":[\"Flowers\",25770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/474\\\"\\u003eCodeforces Round 271 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-177E1\":[\"Space Voyage\",595,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/177\\\"\\u003eABBYY Cup 2.0 - Easy\\u003c/a\\u003e\"],\"CodeForces-98A\":[\"Help Victoria the Wise\",1230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/98\\\"\\u003eCodeforces Beta Round 78 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1948D\":[\"Tandem Repeats?\",7989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1948\\\"\\u003eEducational Codeforces Round 163 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-279C\":[\"Ladder\",8429,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/279\\\"\\u003eCodeforces Round 171 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-919D\":[\"Substring\",10046,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/919\\\"\\u003eCodeforces Round 460 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1043D\":[\"Mysterious Crime\",4501,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1043\\\"\\u003eCodeforces Round 519 by Botan Investments\\u003c/a\\u003e\"],\"CodeForces-1176E\":[\"Cover it!\",10970,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1176\\\"\\u003eCodeforces Round 565 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1579E2\":[\"Array Optimization by Deque\",6434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1579\\\"\\u003eCodeforces Round 744 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1237C1\":[\"Balanced Removals (Easier)\",5935,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1237\\\"\\u003eCodeforces Global Round 5\\u003c/a\\u003e\"],\"CodeForces-1491C\":[\"Pekora and Trampoline\",7800,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1491\\\"\\u003eCodeforces Global Round 13\\u003c/a\\u003e\"],\"CodeForces-582A\":[\"GCD Table\",7964,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/582\\\"\\u003eCodeforces Round 323 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1203D2\":[\"Remove the Substring (hard version)\",7295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1203\\\"\\u003eCodeforces Round 579 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-691D\":[\"Swaps in Permutation\",5697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/691\\\"\\u003eEducational Codeforces Round 14\\u003c/a\\u003e\"],\"CodeForces-460C\":[\"Present\",6822,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/460\\\"\\u003eCodeforces Round 262 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-63C\":[\"Bulls and Cows\",1805,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/63\\\"\\u003eCodeforces Beta Round 59 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-51B\":[\"bHTML Tables Analisys\",940,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/51\\\"\\u003eCodeforces Beta Round 48\\u003c/a\\u003e\"],\"CodeForces-387C\":[\"George and Number\",2322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/387\\\"\\u003eCodeforces Round 227 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1814B\":[\"Long Legs\",9629,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1814\\\"\\u003eEducational Codeforces Round 146 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1826D\":[\"Running Miles\",8701,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1826\\\"\\u003eCodeforces Round 870 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-690B1\":[\"Recover Polygon (easy)\",969,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/690\\\"\\u003eHelvetic Coding Contest 2016 online mirror (teams, unrated)\\u003c/a\\u003e\"],\"CodeForces-1393C\":[\"Pinkie Pie Eats Patty-cakes\",10455,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1393\\\"\\u003eCodeforces Round 662 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1042C\":[\"Array Product\",4814,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1042\\\"\\u003eCodeforces Round 510 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1066E\":[\"Binary Numbers AND Sum\",6437,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1066\\\"\\u003eCodeforces Round 515 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1260C\":[\"Infinite Fence\",8234,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1260\\\"\\u003eEducational Codeforces Round 77 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-484A\":[\"Bits\",11928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/484\\\"\\u003eCodeforces Round 276 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1936A\":[\"Bitwise Operation Wizard\",6468,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1936\\\"\\u003eCodeforces Round 930 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-581D\":[\"Three Logos\",3675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/581\\\"\\u003eCodeforces Round 322 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1889B\":[\"Doremy\\u0027s Connecting Plan\",6706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1889\\\"\\u003eCodeforces Round 906 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1538D\":[\"Another Problem About Dividing Numbers\",13246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1538\\\"\\u003eCodeforces Round 725 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-201A\":[\"Clear Symmetry\",3363,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/201\\\"\\u003eCodeforces Round 127 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-225C\":[\"Barcode\",9561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/225\\\"\\u003eCodeforces Round 139 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-213A\":[\"Game\",1784,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/213\\\"\\u003eCodeforces Round 131 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1093D\":[\"Beautiful Graph\",8784,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1093\\\"\\u003eEducational Codeforces Round 56 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-467C\":[\"George and Job\",15319,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/467\\\"\\u003eCodeforces Round 267 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-479D\":[\"Long Jumps\",4930,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/479\\\"\\u003eCodeforces Round 274 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-685A\":[\"Robbers\\u0027 watch\",4270,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/685\\\"\\u003eCodeforces Round 359 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-540B\":[\"School Marks\",5113,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/540\\\"\\u003eCodeforces Round 301 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1537D\":[\"Deleting Divisors\",12431,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1537\\\"\\u003eCodeforces Round 726 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1743D\":[\"Problem with Random Tests\",7339,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1743\\\"\\u003eEducational Codeforces Round 137 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1731C\":[\"Even Subarrays\",9021,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1731\\\"\\u003eCodeforces Round 841 (Div. 2) and Divide by Zero 2022\\u003c/a\\u003e\"],\"CodeForces-1864D\":[\"Matrix Cascade\",6390,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1864\\\"\\u003eHarbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1779D\":[\"Boris and His Amazing Haircut\",7537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1779\\\"\\u003eHello 2023\\u003c/a\\u003e\"],\"CodeForces-1658C\":[\"Shinju and the Lost Permutation\",9140,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1658\\\"\\u003eCodeforces Round 779 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-321A\":[\"Ciel and Robot\",3831,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/321\\\"\\u003eCodeforces Round 190 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-442A\":[\"Borya and Hanabi\",2198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/442\\\"\\u003eCodeforces Round 253 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1731D\":[\"Valiant\\u0027s New Map\",6841,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1731\\\"\\u003eCodeforces Round 841 (Div. 2) and Divide by Zero 2022\\u003c/a\\u003e\"],\"CodeForces-1092C\":[\"Prefixes and Suffixes\",6020,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1092\\\"\\u003eCodeforces Round 527 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1115U3\":[\"Block unitary\",195,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1115\\\"\\u003eMicrosoft Q# Coding Contest - Winter 2019 - Warmup\\u003c/a\\u003e\"],\"CodeForces-466C\":[\"Number of Ways\",36381,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/466\\\"\\u003eCodeforces Round 266 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-696B\":[\"Puzzles\",3641,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/696\\\"\\u003eCodeforces Round 362 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-575D\":[\"Tablecity\",1958,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/575\\\"\\u003eBubble Cup 8 - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-1209D\":[\"Cow and Snacks\",9521,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1209\\\"\\u003eCodeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1621C\":[\"Hidden Permutations\",6819,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1621\\\"\\u003eHello 2022\\u003c/a\\u003e\"],\"CodeForces-1822G1\":[\"Magic Triples (Easy Version)\",6843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1822\\\"\\u003eCodeforces Round 867 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-223A\":[\"Bracket Sequence\",2653,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/223\\\"\\u003eCodeforces Round 138 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-126B\":[\"Password\",20621,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/126\\\"\\u003eCodeforces Beta Round 93 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1381A2\":[\"Prefix Flip (Hard Version)\",12821,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1381\\\"\\u003eCodeforces Round 658 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1512G\":[\"Short Task\",8187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1512\\\"\\u003eCodeforces Round 713 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1091D\":[\"New Year and the Permutation Concatenation\",6829,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1091\\\"\\u003eGood Bye 2018\\u003c/a\\u003e\"],\"CodeForces-489D\":[\"Unbearable Controversy of Being\",6985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/489\\\"\\u003eCodeforces Round 277.5 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-598D\":[\"Igor In the Museum\",12083,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/598\\\"\\u003eEducational Codeforces Round 1\\u003c/a\\u003e\"],\"CodeForces-1765D\":[\"Watch the Videos\",4003,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"CodeForces-1644D\":[\"Cross Coloring\",7148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1644\\\"\\u003eEducational Codeforces Round 123 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1777C\":[\"Quiz Master\",7731,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1777\\\"\\u003eCodeforces Round 845 (Div. 2) and ByteRace 2023\\u003c/a\\u003e\"],\"CodeForces-1898C\":[\"Colorful Grid\",4893,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1898\\\"\\u003eCodeforces Round 910 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1329B\":[\"Dreamoon Likes Sequences\",6452,\"\\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-101B\":[\"Buses\",2747,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/101\\\"\\u003eCodeforces Beta Round 79 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1850H\":[\"The Third Letter\",7592,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1850\\\"\\u003eCodeforces Round 886 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-464A\":[\"No to Palindromes!\",5931,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/464\\\"\\u003eCodeforces Round 265 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-585B\":[\"Phillip and Trains\",3816,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/585\\\"\\u003eCodeforces Round 325 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-670E\":[\"Correct Bracket Sequence Editor\",3444,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/670\\\"\\u003eCodeforces Round 350 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1833F\":[\"Ira and Flamenco\",6728,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1833\\\"\\u003eCodeforces Round 874 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1930C\":[\"Lexicographically Largest\",6342,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1930\\\"\\u003ethink-cell Round 1\\u003c/a\\u003e\"],\"CodeForces-1700C\":[\"Helping the Nature\",10762,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1700\\\"\\u003eCodeforces Round 802 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1611E1\":[\"Escape The Maze (easy version)\",7068,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1611\\\"\\u003eCodeforces Round 756 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-411C\":[\"Kicker\",1090,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/411\\\"\\u003eCoder-Strike 2014 - Qualification Round\\u003c/a\\u003e\"],\"CodeForces-229B\":[\"Planets\",4751,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/229\\\"\\u003eCodeforces Round 142 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1073D\":[\"Berland Fair\",6740,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1073\\\"\\u003eEducational Codeforces Round 53 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1061C\":[\"Multiplicity\",9130,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1061\\\"\\u003eCodeforces Round 523 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1182C\":[\"Beautiful Lyrics\",4481,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1182\\\"\\u003eCodeforces Round 566 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1194D\":[\"1-2-K Game\",6632,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1194\\\"\\u003eEducational Codeforces Round 68 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1085D\":[\"Minimum Diameter Tree\",5426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1085\\\"\\u003eTechnocup 2019 - Elimination Round 4\\u003c/a\\u003e\"],\"CodeForces-689C\":[\"Mike and Chocolate Thieves\",5387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/689\\\"\\u003eCodeforces Round 361 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-798C\":[\"Mike and gcd problem\",6273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/798\\\"\\u003eCodeforces Round 410 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-895B\":[\"XK Segments\",3676,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-980C\":[\"Posterized\",4002,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/980\\\"\\u003eCodeforces Round 480 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1628B\":[\"Peculiar Movie Preferences\",11316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1628\\\"\\u003eCodeforces Round 767 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-93A\":[\"Frames\",2056,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/93\\\"\\u003eCodeforces Beta Round 76 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1735D\":[\"Meta-set\",5338,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1735\\\"\\u003eCodeforces Round 824 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1626C\":[\"Monsters And Spells\",10687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1626\\\"\\u003eEducational Codeforces Round 121 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1185C2\":[\"Exam in BerSU (hard version)\",7395,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1185\\\"\\u003eCodeforces Round 568 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-216D\":[\"Spider\\u0027s Web\",1500,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/216\\\"\\u003eCodeforces Round 133 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-216B\":[\"Forming Teams\",6672,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/216\\\"\\u003eCodeforces Round 133 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-349B\":[\"Color the Fence\",14234,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/349\\\"\\u003eCodeforces Round 202 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-567C\":[\"Geometric Progression\",9870,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/567\\\"\\u003eCodeforces Round #Pi (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-567D\":[\"One-Dimensional Battle Ships\",5088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/567\\\"\\u003eCodeforces Round #Pi (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-773A\":[\"Success Rate\",4548,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/773\\\"\\u003eVK Cup 2017 - Round 3\\u003c/a\\u003e\"],\"CodeForces-797C\":[\"Minimal string\",7028,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"CodeForces-761D\":[\"Dasha and Very Difficult Problem\",4230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/761\\\"\\u003eCodeforces Round 394 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-81B\":[\"Sequence Formatting\",2072,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/81\\\"\\u003eYandex.Algorithm Open 2011: Qualification 1\\u003c/a\\u003e\"],\"CodeForces-81C\":[\"Average Score\",1707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/81\\\"\\u003eYandex.Algorithm Open 2011: Qualification 1\\u003c/a\\u003e\"],\"CodeForces-1528B\":[\"Kavi on Pairing Duty\",8901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1528\\\"\\u003eCodeforces Round 722 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1879D\":[\"Sum of XOR Functions\",6563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1879\\\"\\u003eEducational Codeforces Round 155 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1625C\":[\"Road Optimization\",10544,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1625\\\"\\u003eCodeforces Round 765 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1516C\":[\"Baby Ehab Partitions Again\",11727,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1516\\\"\\u003eCodeforces Round 717 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-203D\":[\"Hit Ball\",1498,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/203\\\"\\u003eCodeforces Round 128 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-331B1\":[\"Shave Beaver!\",737,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/331\\\"\\u003eABBYY Cup 3.0 - Finals (online version)\\u003c/a\\u003e\"],\"CodeForces-106C\":[\"Buns\",6844,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/106\\\"\\u003eCodeforces Beta Round 82 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-118D\":[\"Caesar\\u0027s Legions\",18177,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-106D\":[\"Treasure Island\",1374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/106\\\"\\u003eCodeforces Beta Round 82 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-457A\":[\"Golden System\",1307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/457\\\"\\u003eMemSQL Start[c]UP 2.0 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1722F\":[\"L-shapes\",6651,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1722\\\"\\u003eCodeforces Round 817 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-578A\":[\"A Problem about Polyline\",4878,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/578\\\"\\u003eCodeforces Round 320 (Div. 1) [Bayan Thanks-Round]\\u003c/a\\u003e\"],\"CodeForces-578B\":[\"\\\"Or\\\" Game\",5422,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/578\\\"\\u003eCodeforces Round 320 (Div. 1) [Bayan Thanks-Round]\\u003c/a\\u003e\"],\"CodeForces-784A\":[\"Numbers Joke\",3217,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/784\\\"\\u003eApril Fools Contest 2017\\u003c/a\\u003e\"],\"CodeForces-530E\":[\"Sum and product\",302,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/530\\\"\\u003eVK Cup 2015 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-990D\":[\"Graph And Its Complement\",3938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/990\\\"\\u003eEducational Codeforces Round 45 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1406C\":[\"Link Cut Centroids\",10128,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1406\\\"\\u003eCodeforces Round 670 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1503B\":[\"3-Coloring\",6925,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1503\\\"\\u003eCodeforces Round 712 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-202B\":[\"Brand New Easy Problem\",854,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/202\\\"\\u003eCodeforces Round 127 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-105A\":[\"Transmigration\",1992,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/105\\\"\\u003eCodeforces Beta Round 81\\u003c/a\\u003e\"],\"CodeForces-698B\":[\"Fix a Tree\",5879,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/698\\\"\\u003eCodeforces Round 363 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1009C\":[\"Annoying Present\",5565,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1009\\\"\\u003eEducational Codeforces Round 47 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1239A\":[\"Ivan the Fool and the Probability Theory\",7254,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1239\\\"\\u003eCodeforces Round 594 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1336B\":[\"Xenia and Colorful Gems\",11129,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1336\\\"\\u003eCodeforces Round 635 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1157C2\":[\"Increasing Subsequence (hard version)\",8222,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1157\\\"\\u003eCodeforces Round 555 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1469D\":[\"Ceil Divisions\",9307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1469\\\"\\u003eEducational Codeforces Round 101 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1554B\":[\"Cobb\",12618,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1554\\\"\\u003eCodeforces Round 735 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1687B\":[\"Railway System\",3528,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1687\\\"\\u003eCodeforces Round 796 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1699C\":[\"The Third Problem\",9505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1699\\\"\\u003eCodeforces Round 804 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1215D\":[\"Ticket Game\",6337,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1215\\\"\\u003eCodeforces Round 585 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1118E\":[\"Yet Another Ball Problem\",4257,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1118\\\"\\u003eCodeforces Round 540 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1009D\":[\"Relatively Prime Graph\",6545,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1009\\\"\\u003eEducational Codeforces Round 47 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1227C\":[\"Messy\",5345,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1227\\\"\\u003eTechnocup 2020 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1118C\":[\"Palindromic Matrix\",5874,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1118\\\"\\u003eCodeforces Round 540 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1881F\":[\"Minimum Maximum Distance\",6165,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1881\\\"\\u003eCodeforces Round 903 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1760G\":[\"SlavicG\\u0027s Favorite Problem\",7373,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1760\\\"\\u003eCodeforces Round 835 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1772E\":[\"Permutation Game\",6459,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1772\\\"\\u003eCodeforces Round 839 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-427C\":[\"Checkposts\",14125,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/427\\\"\\u003eCodeforces Round 244 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-439D\":[\"Devu and his Brother\",6385,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/439\\\"\\u003eCodeforces Round 251 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1312D\":[\"Count the Arrays\",9379,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1312\\\"\\u003eEducational Codeforces Round 83 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1324E\":[\"Sleeping Schedule\",12998,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-439C\":[\"Devu and Partitioning of the Array\",3985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/439\\\"\\u003eCodeforces Round 251 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1578H\":[\"Higher Order Functions\",2071,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1578\\\"\\u003eICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1893B\":[\"Neutral Tonality\",8034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1893\\\"\\u003eCodeforces Round 908 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-778A\":[\"String Game\",11560,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/778\\\"\\u003eCodeforces Round 402 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-524B\":[\"Фото на память - 2 (round version)\",1445,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/524\\\"\\u003eVK Cup 2015 - Round 1\\u003c/a\\u003e\"],\"CodeForces-766C\":[\"Mahmoud and a Message\",4562,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/766\\\"\\u003eCodeforces Round 396 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-621C\":[\"Wet Shark and Flowers\",5749,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/621\\\"\\u003eCodeforces Round 341 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-960C\":[\"Subsequence Counting\",4003,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/960\\\"\\u003eDivide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1359C\":[\"Mixing Water\",13840,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1359\\\"\\u003eEducational Codeforces Round 88 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1468D\":[\"Firecrackers\",4710,\"\\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-1202B\":[\"You Are Given a Decimal String...\",4617,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1202\\\"\\u003eEducational Codeforces Round 70 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-29C\":[\"Mail Stamps\",5556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/29\\\"\\u003eCodeforces Beta Round 29 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1783C\":[\"Yet Another Tournament\",8847,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1783\\\"\\u003eEducational Codeforces Round 141 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-305B\":[\"Continued Fractions\",2275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/305\\\"\\u003eCodeforces Round 184 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1468F\":[\"Full Turn\",3703,\"\\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-559B\":[\"Equivalent Strings\",11914,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/559\\\"\\u003eCodeforces Round 313 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-656B\":[\"Scrambled\",1648,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/656\\\"\\u003eApril Fools Day Contest 2016\\u003c/a\\u003e\"],\"CodeForces-789B\":[\"Masha and geometric depression\",4703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/789\\\"\\u003eCodeforces Round 407 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-644B\":[\"Processing Queries\",2713,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/644\\\"\\u003eCROC 2016 - Qualification\\u003c/a\\u003e\"],\"CodeForces-632C\":[\"The Smallest String Concatenation\",8277,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/632\\\"\\u003eEducational Codeforces Round 9\\u003c/a\\u003e\"],\"CodeForces-765D\":[\"Artsem and Saunders\",2577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/765\\\"\\u003eCodeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-850A\":[\"Five Dimensional Points\",3134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/850\\\"\\u003eCodeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017)\\u003c/a\\u003e\"],\"CodeForces-983A\":[\"Finite or not?\",4602,\"\\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-4D\":[\"Mysterious Present\",10534,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/4\\\"\\u003eCodeforces Beta Round 4 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1019A\":[\"Elections\",4635,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1019\\\"\\u003eCodeforces Round 503 (by SIS, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1479A\":[\"Searching Local Minimum\",11216,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1479\\\"\\u003eCodeforces Round 700 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1561D1\":[\"Up the Strip (simplified version)\",5516,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1561\\\"\\u003eCodeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine))\\u003c/a\\u003e\"],\"CodeForces-1467B\":[\"Hills And Valleys\",10948,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1467\\\"\\u003eCodeforces Round 695 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1249E\":[\"By Elevator or Stairs?\",10003,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1249\\\"\\u003eCodeforces Round 595 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-14C\":[\"Four Segments\",3374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/14\\\"\\u003eCodeforces Beta Round 14 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1770C\":[\"Koxia and Number Theory\",8334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1770\\\"\\u003eGood Bye 2022: 2023 is NEAR\\u003c/a\\u003e\"],\"CodeForces-1310A\":[\"Recommendations\",5013,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1310\\\"\\u003eVK Cup 2019-2020 - Elimination Round (Engine)\\u003c/a\\u003e\"],\"CodeForces-219D\":[\"Choosing Capital for Treeland\",9988,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/219\\\"\\u003eCodeforces Round 135 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1346E\":[\"Magic Tricks\",369,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1346\\\"\\u003eKotlin Heroes: Episode 4\\u003c/a\\u003e\"],\"CodeForces-1661C\":[\"Water the Trees\",9107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1661\\\"\\u003eEducational Codeforces Round 126 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-449A\":[\"Jzzhu and Chocolate\",4054,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/449\\\"\\u003eCodeforces Round 257 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1660F1\":[\"Promising String (easy version)\",7088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1660\\\"\\u003eCodeforces Round 780 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1462E2\":[\"Close Tuples (hard version)\",9518,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1462\\\"\\u003eCodeforces Round 690 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-546D\":[\"Soldier and Number Game\",12254,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/546\\\"\\u003eCodeforces Round 304 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-631C\":[\"Report\",4413,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/631\\\"\\u003eCodeforces Round 344 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1478C\":[\"Nezzar and Symmetric Array\",9678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1478\\\"\\u003eCodeforces Round 698 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1006D\":[\"Two Strings Swaps\",6351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1006\\\"\\u003eCodeforces Round 498 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-630Q\":[\"Pyramids\",1373,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-1430D\":[\"String Deletion\",8881,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1430\\\"\\u003eEducational Codeforces Round 96 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1672D\":[\"Cyclic Rotation\",6059,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1672\\\"\\u003eCodeforces Global Round 20\\u003c/a\\u003e\"],\"CodeForces-303B\":[\"Rectangle Puzzle II\",1401,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/303\\\"\\u003eCodeforces Round 183 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-327C\":[\"Magic Five\",3709,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/327\\\"\\u003eCodeforces Round 191 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-339D\":[\"Xenia and Bit Operations\",26506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/339\\\"\\u003eCodeforces Round 197 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-339C\":[\"Xenia and Weights\",8818,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/339\\\"\\u003eCodeforces Round 197 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1333C\":[\"Eugene and an array\",12560,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1333\\\"\\u003eCodeforces Round 632 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1684D\":[\"Traps\",9407,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1684\\\"\\u003eCodeforces Round 792 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1497E1\":[\"Square-Free Division (easy version)\",8148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1497\\\"\\u003eCodeforces Round 708 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-678D\":[\"Iterated Linear Function\",4994,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/678\\\"\\u003eEducational Codeforces Round 13\\u003c/a\\u003e\"],\"CodeForces-896A\":[\"Nephren gives a riddle\",3442,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/896\\\"\\u003eCodeforces Round 449 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-533C\":[\"Board Game\",2260,\"\\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-630I\":[\"Parking Lot\",6563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-1219C\":[\"Periodic integer number\",2173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1219\\\"\\u003eBubble Cup 12 - Finals [Online Mirror, unrated, Div. 2]\\u003c/a\\u003e\"],\"CodeForces-1413D\":[\"Shurikens\",6430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1413\\\"\\u003eTechnocup 2021 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1873H\":[\"Mad City\",6596,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1873\\\"\\u003eCodeforces Round 898 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1776F\":[\"Train Splitting\",3249,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1776\\\"\\u003eSWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-625A\":[\"Guest From the Past\",5763,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/625\\\"\\u003eCodeforces Round 342 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-758C\":[\"Unfair Poll\",4170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/758\\\"\\u003eCodeforces Round 392 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-831C\":[\"Jury Marks\",4728,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/831\\\"\\u003eCodeforces Round 424 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-734D\":[\"Anton and Chess\",3937,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/734\\\"\\u003eCodeforces Round 379 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1557C\":[\"Moamen and XOR\",8769,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1557\\\"\\u003eCodeforces Round 737 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1400B\":[\"RPG Protagonist\",11068,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1400\\\"\\u003eEducational Codeforces Round 94 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1799C\":[\"Double Lexicographically Minimum\",5494,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1799\\\"\\u003eCodeforces Round 854 by cybercats (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1884C\":[\"Medium Design\",5406,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1884\\\"\\u003eCodeforces Round 904 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1896D\":[\"Ones and Twos\",5190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1896\\\"\\u003eCodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-769C\":[\"Cycle In Maze\",2284,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/769\\\"\\u003eVK Cup 2017 - Qualification 1\\u003c/a\\u003e\"],\"CodeForces-769D\":[\"k-Interesting Pairs Of Integers\",2303,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/769\\\"\\u003eVK Cup 2017 - Qualification 1\\u003c/a\\u003e\"],\"CodeForces-191B\":[\"Demonstration\",1078,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/191\\\"\\u003eCodeforces Round 121 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1677B\":[\"Tokitsukaze and Meeting\",4044,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1677\\\"\\u003eCodeforces Round 789 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1798C\":[\"Candy Store\",7812,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1798\\\"\\u003eCodeforces Round 860 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1217C\":[\"The Number Of Good Substrings\",7453,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1217\\\"\\u003eEducational Codeforces Round 72 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-405D\":[\"Toy Sum\",3217,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/405\\\"\\u003eCodeforces Round 238 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1411C\":[\"Peaceful Rooks\",7967,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1411\\\"\\u003eTechnocup 2021 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1883E\":[\"Look Back\",7019,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1883\\\"\\u003eCodeforces Round 905 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-18B\":[\"Platforms\",2312,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/18\\\"\\u003eCodeforces Beta Round 18 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-756A\":[\"Pavel and barbecue\",3029,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/756\\\"\\u003e8VC Venture Cup 2017 - Final Round\\u003c/a\\u003e\"],\"CodeForces-732D\":[\"Exams\",6104,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/732\\\"\\u003eCodeforces Round 377 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1313B\":[\"Different Rules\",6748,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1313\\\"\\u003eCodeforces Round 622 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1325D\":[\"Ehab the Xorcist\",11868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1325\\\"\\u003eCodeforces Round 628 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1688C\":[\"Manipulating History\",7991,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1688\\\"\\u003eCodeforces Round 796 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1204C\":[\"Anna, Svyatoslav and Maps\",6738,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1204\\\"\\u003eCodeforces Round 581 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1216C\":[\"White Sheet\",9210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1216\\\"\\u003eCodeforces Round 587 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1228C\":[\"Primes and Multiplication\",8976,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1228\\\"\\u003eCodeforces Round 589 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1301C\":[\"Ayoub\\u0027s function\",9422,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1301\\\"\\u003eCodeforces Round 619 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1422C\":[\"Bargain\",8317,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1422\\\"\\u003eCodeforces Round 675 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1579F\":[\"Array Stabilization (AND version)\",4609,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1579\\\"\\u003eCodeforces Round 744 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-622C\":[\"Not Equal on a Segment\",6775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/622\\\"\\u003eEducational Codeforces Round 7\\u003c/a\\u003e\"],\"CodeForces-852G\":[\"Bathroom terminal\",1365,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/852\\\"\\u003eBubble Cup X - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-1868B1\":[\"Candy Party (Easy Version)\",6556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1868\\\"\\u003eCodeforces Round 896 (Div. 1)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1711956086000,"title":"CodeForces rating 1700 题目集","dislikeCnt":0,"content":"[problem:CodeForces-466C] Number of ways二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-474D] Flowers动态规划(dp \n[problem:CodeForces-339D] Xenia and bit operations数据结构(data structures) 树形结构(trees\n[problem:CodeForces-126B] Password二分搜索(binary search) 动态规划(dp), 哈希表(hashing), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-977F] Consecutive subsequence动态规划(dp \n[problem:CodeForces-118D] Caesar\u0027s legions动态规划(dp \n[problem:CodeForces-1365D] Solve the maze构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-467C] George and job动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1037D] Valid bfs?深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-349B] Color the fence数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1359C] Mixing water二分搜索(binary search) 数学(math\n[problem:CodeForces-1538D] Another problem about dividing numbers构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-295B] Greg and graph动态规划(dp) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-276D] Little girl and maximum xor位掩码(bitmasks) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-427C] Checkposts深度优先搜索及其变种(dfs and similar) 图论(graphs), 双指针算法(two pointers\n[problem:CodeForces-1381A2] Prefix flip (hard version)构造算法(constructive algorithms) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1554B] Cobb位掩码(bitmasks) 暴力枚举(brute force), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1324E] Sleeping schedule动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1343D] Constant palindrome sum暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1474C] Array destruction暴力枚举(brute force) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1333C] Eugene and an array二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1537D] Deleting divisors博弈论(games) 数学(math), 数论(number theory\n[problem:CodeForces-1360F] Spy-string位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 动态规划(dp), 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1325D] Ehab the xorcist位掩码(bitmasks) 构造算法(constructive algorithms), 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-486C] Palindrome transformation暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1516C] Baby ehab partitions again位掩码(bitmasks) 构造算法(constructive algorithms), 动态规划(dp), 数学(math\n[problem:CodeForces-1368D] And Or and square sum位掩码(bitmasks), 贪心策略(greedy), 数学(math\n[problem:CodeForces-546D] Soldier and number game构造算法(constructive algorithms) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1628B] Peculiar movie preferences贪心策略(greedy) 字符串处理(strings\n[problem:CodeForces-1479A] Searching local minimum二分搜索(binary search) 交互性问题(interactive), 三分搜索(ternary search\n[problem:CodeForces-778A] String game二分搜索(binary search) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1336B] Xenia and colorful gems二分搜索(binary search) 贪心策略(greedy), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1400B] Rpg protagonist暴力枚举(brute force) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1467B] Hills and valleys暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-484A] Bits位掩码(bitmasks) 构造算法(constructive algorithms\n[problem:CodeForces-1626C] Monsters and spells二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1144F] Graph without long directed paths深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1700C] Helping the nature构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1335E1] Three blocks palindrome (easy version)二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-559B] Equivalent strings分治算法(divide and conquer) 哈希表(hashing), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-1176E] Cover it!深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1695C] Zero path暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-598D] Igor in the museum深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1393C] Pinkie pie eats patty-cakes构造算法(constructive algorithms) 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1383A] String transformation 1并查集(dsu) 图论(graphs), 贪心策略(greedy), 排序算法(sortings), 字符串处理(strings), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1625C] Road optimization动态规划(dp \n[problem:CodeForces-1550C] Manhattan subarrays暴力枚举(brute force) 计算几何(geometry), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1406C] Link cut centroids构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-4D] Mysterious present动态规划(dp) 排序算法(sortings\n[problem:CodeForces-1485C] Floor and mod二分搜索(binary search) 暴力枚举(brute force), 数学(math), 数论(number theory\n[problem:CodeForces-493D] Vasya and chess构造算法(constructive algorithms) 博弈论(games), 数学(math\n[problem:CodeForces-1478C] Nezzar and symmetric array实现问题,编程技巧,模拟(implementation) 数学(math), 排序算法(sortings\n[problem:CodeForces-1814B] Long legs暴力枚举(brute force) 数学(math\n[problem:CodeForces-385C] Bear and prime numbers二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1699C] The third problem组合数学(combinatorics) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-1473D] Program数据结构(data structures) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-567C] Geometric progression二分搜索(binary search) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-1684D] Traps构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1451D] Circle game博弈论(games) 计算几何(geometry), 数学(math\n[problem:CodeForces-919D] Substring深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs\n[problem:CodeForces-1681D] Required length暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 哈希表(hashing), 最短路算法(shortest paths\n[problem:CodeForces-1249E] By elevator or stairs?动态规划(dp) 最短路算法(shortest paths\n[problem:CodeForces-1462E2] Close tuples (hard version)二分搜索(binary search) 组合数学(combinatorics), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1469D] Ceil divisions暴力枚举(brute force) 构造算法(constructive algorithms), 数学(math), 数论(number theory\n[problem:CodeForces-1658C] Shinju and the lost permutation构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1295B] Infinite prefixes数学(math) 字符串处理(strings\n[problem:CodeForces-1301C] Ayoub\u0027s function二分搜索(binary search) 组合数学(combinatorics), 贪心策略(greedy), 数学(math), 字符串处理(strings\n[problem:CodeForces-1661C] Water the trees二分搜索(binary search) 贪心策略(greedy), 数学(math\n[problem:CodeForces-490C] Hacking cypher暴力枚举(brute force) 数学(math), 数论(number theory), 字符串处理(strings\n[problem:CodeForces-1312D] Count the arrays组合数学(combinatorics) 数学(math\n[problem:CodeForces-1731C] Even subarrays位掩码(bitmasks) 暴力枚举(brute force), 哈希表(hashing), 数学(math), 数论(number theory\n[problem:CodeForces-1253D] Harmonious graph构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1209D] Cow and snacks深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-287B] Pipeline二分搜索(binary search) 数学(math\n[problem:CodeForces-1216C] White sheet计算几何(geometry) 数学(math\n[problem:CodeForces-225C] Barcode动态规划(dp) 矩阵(matrices\n[problem:CodeForces-1783C] Yet another tournament二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1228C] Primes and multiplication数学(math) 数论(number theory\n[problem:CodeForces-1430D] String deletion二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1619E] Mex and increments构造算法(constructive algorithms) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-219D] Choosing capital for treeland深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1528B] Kavi on pairing duty组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1392D] Omkar and bed wars动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1476D] Journey深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1598D] Training session组合数学(combinatorics) 数据结构(data structures), 计算几何(geometry), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1093D] Beautiful graph深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1826D] Running miles暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1557C] Moamen and xor位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 数学(math), 矩阵(matrices\n[problem:CodeForces-1715C] Monoblock组合数学(combinatorics) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1061C] Multiplicity数据结构(data structures) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1268A] Long beautiful integer构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1770C] Koxia and number theory暴力枚举(brute force) 中国剩余定理(chinese remainder theorem), 数学(math), 数论(number theory\n[problem:CodeForces-382C] Arithmetic progression实现问题,编程技巧,模拟(implementation) 排序算法(sortings\n[problem:CodeForces-1361A] Johnny and contribution构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-339C] Xenia and weights构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1422C] Bargain组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-279C] Ladder动态规划(dp) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1709D] Rorororobot二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1693B] Fake plastic trees深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1157E] Minimum array二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1497E1] Square-free division (easy version)数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 数学(math), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-1893B] Neutral tonality构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1688C] Manipulating history构造算法(constructive algorithms) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1260C] Infinite fence贪心策略(greedy) 数学(math), 数论(number theory\n[problem:CodeForces-1702F] Equate multisets构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-1332D] Walk on matrix位掩码(bitmasks) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-1411C] Peaceful rooks深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1916D] Mathematical problem暴力枚举(brute force) 构造算法(constructive algorithms), 计算几何(geometry), 数学(math\n[problem:CodeForces-711C] Coloring trees动态规划(dp \n[problem:CodeForces-1512G] Short task暴力枚举(brute force) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1491C] Pekora and trampoline暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1798C] Candy store贪心策略(greedy) 数学(math), 数论(number theory\n[problem:CodeForces-1472E] Correct placement二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1157C2] Increasing subsequence (hard version)贪心策略(greedy \n[problem:CodeForces-1849D] Array painting构造算法(constructive algorithms) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1340B] Nastya and scoreboard位掩码(bitmasks) 动态规划(dp), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1777C] Quiz master二分搜索(binary search) 数学(math), 数论(number theory), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-739A] Alyona and mex构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1278C] Berry jam数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-582A] Gcd table构造算法(constructive algorithms) 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-1592C] Bakry and partitioning位掩码(bitmasks) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1543D1] Rpd and rap sheet (easy version)位掩码(bitmasks) 构造算法(constructive algorithms), 交互性问题(interactive), 数学(math\n[problem:CodeForces-1779D] Boris and his amazing haircut构造算法(constructive algorithms) 数据结构(data structures), 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1850H] The third letter深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1835A] K-th equality暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1743D] Problem with random tests暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 概率论(probabilities\n[problem:CodeForces-1257D] Yet another monster killing problem二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1114C] Trailing loves (or l\u0027oeufs?)暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1185C2] Exam in bersu (hard version)暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1153C] Serval and parenthesis sequence贪心策略(greedy) 字符串处理(strings\n[problem:CodeForces-1948D] Tandem repeats?暴力枚举(brute force) 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-632C] The smallest string concatenation排序算法(sortings) 字符串处理(strings\n[problem:CodeForces-1239A] Ivan the fool and the probability theory组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1217C] The number of good substrings二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force\n[problem:CodeForces-1051D] Bicolorings位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-1594D] The number of imposters构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1714G] Path prefixes二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1203D2] Remove the substring (hard version)二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1810D] Climbing the tree二分搜索(binary search) 数学(math\n[problem:CodeForces-1027D] Mouse hunt深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1692H] Gambling数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1644D] Cross coloring数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1660F1] Promising string (easy version)暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math), 字符串处理(strings\n[problem:CodeForces-1618E] Singers\u0027 tour构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1829H] Don\u0027t blame me位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-915C] Permute digits动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1611E1] Escape the maze (easy version)深度优先搜索及其变种(dfs and similar) 贪心策略(greedy), 最短路算法(shortest paths), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1503B] 3-coloring构造算法(constructive algorithms) 博弈论(games), 交互性问题(interactive\n[problem:CodeForces-1551D1] Domino (easy version)构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1583C] Omkar and determination数据结构(data structures) 动态规划(dp\n[problem:CodeForces-1760G] Slavicg\u0027s favorite problem位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-1621C] Hidden permutations深度优先搜索及其变种(dfs and similar) 交互性问题(interactive), 数学(math\n[problem:CodeForces-1883E] Look back位掩码(bitmasks) 贪心策略(greedy\n[problem:CodeForces-1690F] Shifting string图论(graphs) 数学(math), 数论(number theory), 字符串处理(strings\n[problem:CodeForces-518D] Ilya and escalator组合数学(combinatorics) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-1256C] Platforms jumping贪心策略(greedy \n[problem:CodeForces-1706D1] Chopping carrots (easy version)二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-1731D] Valiant\u0027s new map二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-1931F] Chat screenshots组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-1091D] New year and the permutation concatenation组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1889B] Doremy\u0027s connecting plan构造算法(constructive algorithms) 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-489D] Unbearable controversy of being暴力枚举(brute force) 组合数学(combinatorics), 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-1833F] Ira and flamenco组合数学(combinatorics) 构造算法(constructive algorithms), 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1722F] L-shapes深度优先搜索及其变种(dfs and similar) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1141E] Superhero battle数学(math \n[problem:CodeForces-1204C] Anna Svyatoslav and maps动态规划(dp), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1185D] Extra element实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-1313B] Different rules构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1000C] Covered points count数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1879D] Sum of xor functions位掩码(bitmasks) 组合数学(combinatorics), 分治算法(divide and conquer), 动态规划(dp), 数学(math\n[problem:CodeForces-1873H] Mad city深度优先搜索及其变种(dfs and similar) 并查集(dsu), 博弈论(games), 图论(graphs), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1608C] Game master数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1329B] Dreamoon likes sequences位掩码(bitmasks) 组合数学(combinatorics), 数学(math\n[problem:CodeForces-498A] Crazy town计算几何(geometry \n[problem:CodeForces-1822G1] Magic triples (easy version)暴力枚举(brute force) 数据结构(data structures), 数学(math), 数论(number theory\n[problem:CodeForces-1868B1] Candy party (easy version)位掩码(bitmasks) 构造算法(constructive algorithms), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1413D] Shurikens数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1073D] Berland fair二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1579E2] Array optimization by deque数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-1772E] Permutation game博弈论(games \n[problem:CodeForces-1168A] Increasing by modulo二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-1864D] Matrix cascade暴力枚举(brute force) 构造算法(constructive algorithms), 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-630I] Parking lot组合数学(combinatorics) 数学(math\n[problem:CodeForces-797C] Minimal string数据结构(data structures) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1936A] Bitwise operation wizard位掩码(bitmasks) 构造算法(constructive algorithms), 贪心策略(greedy), 交互性问题(interactive), 数学(math\n[problem:CodeForces-1194D] 1-2-k game博弈论(games) 数学(math\n[problem:CodeForces-1562D1] Two hundred twenty one (easy version)数据结构(data structures) 动态规划(dp), 数学(math\n[problem:CodeForces-622C] Not equal on a segment数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1131F] Asya and kittens构造算法(constructive algorithms) 并查集(dsu\n[problem:CodeForces-1930C] Lexicographically largest二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1009D] Relatively prime graph暴力枚举(brute force) 构造算法(constructive algorithms), 图论(graphs), 贪心策略(greedy), 数学(math\n[problem:CodeForces-269B] Greenhouse effect动态规划(dp \n[problem:CodeForces-1111C] Creative snap二分搜索(binary search) 暴力枚举(brute force), 分治算法(divide and conquer), 数学(math\n[problem:CodeForces-584C] Marina and vasya构造算法(constructive algorithms) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1111B] Average superhero gang power暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-216B] Forming teams深度优先搜索及其变种(dfs and similar) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-460C] Present二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-833A] The meaningless game数学(math) 数论(number theory\n[problem:CodeForces-1453C] Triangles贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1215D] Ticket game博弈论(games) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1066E] Binary numbers and sum数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1292B] Aroma\u0027s search暴力枚举(brute force) 构造算法(constructive algorithms), 计算几何(geometry), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1672D] Cyclic rotation构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1901D] Yet another monster fight二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-20A] Beros file system实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1945E] Binary search二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-1118D2] Coffee and coursework (hard version)二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-1237C1] Balanced removals (easier)构造算法(constructive algorithms) 计算几何(geometry), 贪心策略(greedy\n[problem:CodeForces-1279D] Santa\u0027s bot组合数学(combinatorics) 数学(math), 概率论(probabilities\n[problem:CodeForces-1006D] Two strings swaps实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-464A] No to palindromes!贪心策略(greedy) 字符串处理(strings\n[problem:CodeForces-1792D] Fixed prefix permutations二分搜索(binary search) 位掩码(bitmasks), 数据结构(data structures), 哈希表(hashing), 数学(math), 排序算法(sortings\n[problem:CodeForces-1807F] Bouncy ball暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1041D] Glider二分搜索(binary search) 数据结构(data structures), 双指针算法(two pointers\n[problem:CodeForces-1320B] Navigation system深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1881F] Minimum maximum distance深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1934C] Find a mine二分搜索(binary search) 构造算法(constructive algorithms), 计算几何(geometry), 贪心策略(greedy), 交互性问题(interactive), 数学(math\n[problem:CodeForces-439D] Devu and his brother二分搜索(binary search) 排序算法(sortings), 三分搜索(ternary search), 双指针算法(two pointers\n[problem:CodeForces-106C] Buns动态规划(dp \n[problem:CodeForces-1210B] Marcin and training camp暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-813C] The tag game深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1092C] Prefixes and suffixes字符串处理(strings \n[problem:CodeForces-698B] Fix a tree构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-815A] Karen and game暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-798C] Mike and gcd problem动态规划(dp) 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-1102E] Monotonic renumeration组合数学(combinatorics) 排序算法(sortings\n[problem:CodeForces-1118C] Palindromic matrix构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1822F] Gardening friends暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1015E1] Stars drawing (easy edition)暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-732D] Exams二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1799C] Double lexicographically minimum贪心策略(greedy) 字符串处理(strings\n[problem:CodeForces-625A] Guest from the past实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-1561D1] Up the strip (simplified version)暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1118D1] Coffee and coursework (easy version)暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-1085D] Minimum diameter tree构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-621C] Wet shark and flowers组合数学(combinatorics) 数学(math), 数论(number theory), 概率论(probabilities\n[problem:CodeForces-1227C] Messy构造算法(constructive algorithms \n[problem:CodeForces-1884C] Medium design暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1735D] Meta-set暴力枚举(brute force) 组合数学(combinatorics), 数据结构(data structures), 哈希表(hashing), 数学(math\n[problem:CodeForces-691D] Swaps in permutation深度优先搜索及其变种(dfs and similar) 并查集(dsu), 数学(math\n[problem:CodeForces-1009C] Annoying present贪心策略(greedy) 数学(math\n[problem:CodeForces-1132C] Painting the fence暴力枚举(brute force \n[problem:CodeForces-1280A] Cut and paste实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-578B] \"or\" game暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-1210A] Anadi and domino暴力枚举(brute force) 图论(graphs\n[problem:CodeForces-1148C] Crazy diamond构造算法(constructive algorithms) 排序算法(sortings\n[problem:CodeForces-1896D] Ones and twos二分搜索(binary search) 数据结构(data structures), 分治算法(divide and conquer), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1254A] Feeding chicken构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-923A] Primal sport数学(math) 数论(number theory\n[problem:CodeForces-1670D] Very suspicious二分搜索(binary search) 暴力枚举(brute force), 计算几何(geometry), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1903D1] Maximum and queries (easy version)二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 贪心策略(greedy\n[problem:CodeForces-1310A] Recommendations数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-689C] Mike and chocolate thieves二分搜索(binary search) 组合数学(combinatorics), 数学(math\n[problem:CodeForces-1898C] Colorful grid构造算法(constructive algorithms \n[problem:CodeForces-479D] Long jumps二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-578A] A problem about polyline计算几何(geometry) 数学(math\n[problem:CodeForces-1042C] Array product构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-567D] One-dimensional battle ships二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-540B] School marks贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1579F] Array stabilization (and version)暴力枚举(brute force) 图论(graphs), 数学(math), 数论(number theory), 最短路算法(shortest paths\n[problem:CodeForces-1019A] Elections暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-29C] Mail stamps数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-983A] Finite or not?实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-229B] Planets二分搜索(binary search) 数据结构(data structures), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1468D] Firecrackers二分搜索(binary search) 排序算法(sortings\n[problem:CodeForces-900C] Remove extra one暴力枚举(brute force) 数据结构(data structures), 数学(math\n[problem:CodeForces-1182C] Beautiful lyrics数据结构(data structures) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1043D] Mysterious crime暴力枚举(brute force) 组合数学(combinatorics), 数学(math), Meet-in-the-middle算法(meet-in-the-middle), 双指针算法(two pointers\n[problem:CodeForces-773A] Success rate二分搜索(binary search) 数学(math\n[problem:CodeForces-831C] Jury marks暴力枚举(brute force) 构造算法(constructive algorithms\n[problem:CodeForces-1202B] You are given a decimal string...暴力枚举(brute force) 动态规划(dp), 最短路算法(shortest paths\n[problem:CodeForces-789B] Masha and geometric depression暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-294B] Shaass and bookshelf动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-718A] Efim and strange grade动态规划(dp) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-936A] Save energy!二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-766C] Mahmoud and a message暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-507C] Guess your way out!实现问题,编程技巧,模拟(implementation) 数学(math), 树形结构(trees\n[problem:CodeForces-678D] Iterated linear function数学(math) 数论(number theory\n[problem:CodeForces-978G] Petya\u0027s exams贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-685A] Robbers\u0027 watch暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-617D] Polyline构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-140A] New year table计算几何(geometry) 数学(math\n[problem:CodeForces-1677B] Tokitsukaze and meeting数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1023D] Array restoration构造算法(constructive algorithms) 数据结构(data structures\n[problem:CodeForces-761D] Dasha and very difficult problem二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-627A] Xor equation动态规划(dp) 数学(math\n[problem:CodeForces-827A] String reconstruction数据结构(data structures) 贪心策略(greedy), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-590A] Median smoothing实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1118E] Yet another ball problem构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1032C] Playing piano构造算法(constructive algorithms) 动态规划(dp\n[problem:CodeForces-449A] Jzzhu and chocolate贪心策略(greedy) 数学(math\n[problem:CodeForces-1765D] Watch the videos二分搜索(binary search) 构造算法(constructive algorithms), 双指针算法(two pointers\n[problem:CodeForces-729C] Road to cinema二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-758C] Unfair poll二分搜索(binary search) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-960C] Subsequence counting位掩码(bitmasks) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-439C] Devu and partitioning of the array暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 数论(number theory\n[problem:CodeForces-1129A1] Toy train (simplified)暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-990D] Graph and its complement构造算法(constructive algorithms) 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-193A] Cutting figure构造算法(constructive algorithms) 图论(graphs), 树形结构(trees\n[problem:CodeForces-980C] Posterized博弈论(games) 贪心策略(greedy\n[problem:CodeForces-734D] Anton and chess实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-954C] Matrix walk实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-631C] Report数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-924C] Riverside curio数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-949B] A leapfrog in the array构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-729D] Sea battle构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-283B] Cow program深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs\n[problem:CodeForces-297A] Parity game构造算法(constructive algorithms \n[problem:CodeForces-321A] Ciel and robot二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1468F] Full turn计算几何(geometry) 哈希表(hashing), 数论(number theory\n[problem:CodeForces-471C] Muh and house of cards二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1580A] Portal暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-585B] Phillip and trains深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-917B] Madmax深度优先搜索及其变种(dfs and similar) 动态规划(dp), 博弈论(games), 图论(graphs\n[problem:CodeForces-1687B] Railway system构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy), 交互性问题(interactive), 排序算法(sortings\n[problem:CodeForces-895B] Xk segments二分搜索(binary search) 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-581D] Three logos位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 计算几何(geometry), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-605B] Lazy student构造算法(constructive algorithms) 数据结构(data structures), 图论(graphs\n[problem:CodeForces-818D] Multicolored cars数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-696B] Puzzles深度优先搜索及其变种(dfs and similar) 数学(math), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-160C] Find pair实现问题,编程技巧,模拟(implementation) 数学(math), 排序算法(sortings\n[problem:CodeForces-1146C] Tree diameter位掩码(bitmasks) 图论(graphs), 交互性问题(interactive\n[problem:CodeForces-896A] Nephren gives a riddle二分搜索(binary search) 深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-451C] Predict outcome of the game暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-931C] Laboratory work实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-938C] Constructing tests二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms\n[problem:CodeForces-1142A] The beatles暴力枚举(brute force) 数学(math\n[problem:CodeForces-1776F] Train splitting构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-670E] Correct bracket sequence editor数据结构(data structures) 并查集(dsu), 字符串处理(strings\n[problem:CodeForces-1068C] Colored rooks构造算法(constructive algorithms) 图论(graphs\n[problem:CodeForces-35D] Animals动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-327C] Magic five组合数学(combinatorics) 数学(math\n[problem:CodeForces-198A] About bacteria实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-784A] Numbers joke \n[problem:CodeForces-405D] Toy sum贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-148C] Terse princess构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-66D] Petya and his friends构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-14C] Four segments暴力枚举(brute force) 构造算法(constructive algorithms), 计算几何(geometry), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-850A] Five dimensional points暴力枚举(brute force) 计算几何(geometry), 数学(math\n[problem:CodeForces-156A] Message暴力枚举(brute force \n[problem:CodeForces-1267E] Elections贪心策略(greedy \n[problem:CodeForces-756A] Pavel and barbecue构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-201A] Clear symmetry构造算法(constructive algorithms) 动态规划(dp), 数学(math\n[problem:CodeForces-281B] Nearest fraction暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-260C] Balls and boxes构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-22C] System administrator图论(graphs \n[problem:CodeForces-1044A] The tower is going home二分搜索(binary search) 双指针算法(two pointers\n[problem:CodeForces-275B] Convex shape构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-627B] Factory repairs数据结构(data structures \n[problem:CodeForces-163A] Substring and subsequence动态规划(dp \n[problem:CodeForces-644B] Processing queries m 构造算法(constructive algorithms), 数据结构(data structures), 双指针算法(two pointers\n[problem:CodeForces-223A] Bracket sequence数据结构(data structures) 表达式解析(expression parsing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-101B] Buses二分搜索(binary search) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-765D] Artsem and saunders构造算法(constructive algorithms) 并查集(dsu), 数学(math\n[problem:CodeForces-409A] The great game \n[problem:CodeForces-1056C] Pick heroes贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive), 排序算法(sortings\n[problem:CodeForces-596C] Wilbur and points组合数学(combinatorics) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-288C] Polo the penguin and xor operation实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-1906M] Triangle construction贪心策略(greedy) 数学(math\n[problem:CodeForces-769D] K-interesting pairs of integers m 位掩码(bitmasks), 暴力枚举(brute force), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-925B] Resource distribution二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-387C] George and number贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-533C] Board game博弈论(games) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-442A] Borya and hanabi位掩码(bitmasks) 暴力枚举(brute force), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-769C] Cycle in maze m 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-18B] Platforms暴力枚举(brute force) 数学(math\n[problem:CodeForces-32C] Flea数学(math \n[problem:CodeForces-305B] Continued fractions暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-360A] Levko and array recovery贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-82B] Sets构造算法(constructive algorithms) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-76D] Plus and xor动态规划(dp) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1089E] Easy chess构造算法(constructive algorithms \n[problem:CodeForces-1578H] Higher order functions实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-747E] Comments深度优先搜索及其变种(dfs and similar) 表达式解析(expression parsing), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-161B] Discounts构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-93A] Frames实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-409C] Magnum opus \n[problem:CodeForces-81B] Sequence formatting实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-926C] Is this a zebra?实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-575D] Tablecity构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-131E] Yet another task with queens排序算法(sortings \n[problem:CodeForces-105A] Transmigration实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1219C] Periodic integer number实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-910C] Minimum sum构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-31C] Schedule实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-176B] Word cut动态规划(dp \n[problem:CodeForces-213A] Game深度优先搜索及其变种(dfs and similar) 贪心策略(greedy\n[problem:CodeForces-44H] Phone number动态规划(dp \n[problem:CodeForces-409D] Big data \n[problem:CodeForces-76E] Points实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-49C] Disposition构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-656B] Scrambled m 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-81C] Average score贪心策略(greedy) 数学(math), 排序算法(sortings\n[problem:CodeForces-63C] Bulls and cows暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-84C] Biathlon二分搜索(binary search) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-290C] Wtf? m 图匹配(graph matchings), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-245C] Game with coins贪心策略(greedy \n[problem:CodeForces-524B] Фото на память - 2 (round version)动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-203D] Hit ball计算几何(geometry) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-53B] Blog photo二分搜索(binary search) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-409B] Mysterious language \n[problem:CodeForces-303B] Rectangle puzzle ii实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-216D] Spider\u0027s web二分搜索(binary search) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-65B] Harry potter and the history of magic暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-106D] Treasure island暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-852G] Bathroom terminal实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-457A] Golden system数学(math) Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-630Q] Pyramids计算几何(geometry) 数学(math\n[problem:CodeForces-168B] Wizards and minimal spell实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-98A] Help victoria the wise暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-929C] Красивая команда m 组合数学(combinatorics), 数学(math\n[problem:CodeForces-30B] Codeforces world finals实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-56C] Corporation mail数据结构(data structures) 表达式解析(expression parsing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-411C] Kicker实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-191B] Demonstration贪心策略(greedy \n[problem:CodeForces-159E] Zebra tower m 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-35B] Warehouse实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-164A] Variable Or there and back again深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-316G1] Good substrings哈希表(hashing) 字符串处理(strings\n[problem:CodeForces-690B1] Recover polygon (easy \n[problem:CodeForces-42B] Game of chess unfinished实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-51B] Bhtml tables analisys表达式解析(expression parsing \n[problem:CodeForces-202B] Brand new easy problem暴力枚举(brute force \n[problem:CodeForces-331B1] Shave beaver!实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-183B] Zoo暴力枚举(brute force) 计算几何(geometry\n[problem:CodeForces-926I] A vital proble \n[problem:CodeForces-177E1] Space voyage二分搜索(binary search \n[problem:CodeForces-183A] Headquarters构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1211C] Ice cream m 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1001I] Deutsch-jozsa algorithm \n[problem:CodeForces-1346E] Magic tricks m 动态规划(dp), 图论(graphs\n[problem:CodeForces-1571E] Fix the string m 位掩码(bitmasks), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1002B4] Distinguish four 2-qubit states - \n[problem:CodeForces-530E] Sum and product \n[problem:CodeForces-1002C1] Distinguish zero state and plus state with minimum erro \n[problem:CodeForces-130G] Caps lock on \n[problem:CodeForces-171H] A polyline m 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1115U3] Block unitary \n[problem:CodeForces-207B3] Military 训 \n","threadId":188467,"likeCnt":1,"createTime":1711956086000,"isWorkbook":true,"viewCnt":249,"openness":2,"fav":false,"id":4789,"trustable":false}