Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-207D4\":[\"The Beaver\\u0027s Problem - 3\",147,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-207D6\":[\"The Beaver\\u0027s Problem - 3\",75,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-1906J\":[\"Count BFS Graph\",625,\"\\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-56D\":[\"Changing a String\",1958,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/56\\\"\\u003eCodeforces Beta Round 52 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1906F\":[\"Maximize The Value\",929,\"\\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-1025D\":[\"Recovering BST\",3558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1025\\\"\\u003eCodeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)\\u003c/a\\u003e\"],\"CodeForces-1364D\":[\"Ehab\\u0027s Last Corollary\",4282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1364\\\"\\u003eCodeforces Round 649 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1146D\":[\"Frog Jumping\",1082,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1146\\\"\\u003eForethought Future Cup - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1158C\":[\"Permutation recovery\",1730,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1158\\\"\\u003eCodeforces Round 559 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-859E\":[\"Desk Disorder\",1752,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/859\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1203F1\":[\"Complete the Projects (easy version)\",3472,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1203\\\"\\u003eCodeforces Round 579 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-859D\":[\"Third Month Insanity\",921,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/859\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-847F\":[\"Berland Elections\",917,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1267K\":[\"Key Storage\",1821,\"\\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-920E\":[\"Connected Components?\",6210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-702E\":[\"Analysis of Pathes in Functional Graph\",2565,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/702\\\"\\u003eEducational Codeforces Round 15\\u003c/a\\u003e\"],\"CodeForces-811D\":[\"Vladik and Favorite Game\",1656,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/811\\\"\\u003eCodeforces Round 416 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1919D\":[\"01 Tree\",3585,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1919\\\"\\u003eHello 2024\\u003c/a\\u003e\"],\"CodeForces-1420C2\":[\"Pokémon Army (hard version)\",4674,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1420\\\"\\u003eCodeforces Round 672 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-45H\":[\"Road Problem\",191,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/45\\\"\\u003eSchool Team Contest 3 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-1278D\":[\"Segment Tree\",3856,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1278\\\"\\u003eEducational Codeforces Round 78 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1363D\":[\"Guess The Maximums\",3898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1363\\\"\\u003eCodeforces Round 646 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1000E\":[\"We Need More Bosses\",4250,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1000\\\"\\u003eEducational Codeforces Round 46 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1387A\":[\"Graph\",684,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1387\\\"\\u003eBaltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated)\\u003c/a\\u003e\"],\"CodeForces-1266E\":[\"Spaceship Solitaire\",2116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1266\\\"\\u003eCodeforces Global Round 6\\u003c/a\\u003e\"],\"CodeForces-519E\":[\"A and B and Lecture Rooms\",7103,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/519\\\"\\u003eCodeforces Round 294 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-955C\":[\"Sad powers\",2622,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/955\\\"\\u003eCodeforces Round 471 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-507E\":[\"Breaking Good\",2811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/507\\\"\\u003eCodeforces Round 287 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-207D10\":[\"The Beaver\\u0027s Problem - 3\",78,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-1472F\":[\"New Year\\u0027s Puzzle\",3013,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1472\\\"\\u003eCodeforces Round 693 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1472G\":[\"Moving to the Capital\",4493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1472\\\"\\u003eCodeforces Round 693 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1593F\":[\"Red-Black Number\",2373,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1593\\\"\\u003eCodeforces Round 748 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-207C1\":[\"Game with Two Trees\",103,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-54D\":[\"Writing a Song\",575,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/54\\\"\\u003eCodeforces Beta Round 50\\u003c/a\\u003e\"],\"CodeForces-1120C\":[\"Compress String\",1933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1120\\\"\\u003eCodeforces Round 543 (Div. 1, based on Technocup 2019 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1265E\":[\"Beautiful Mirrors\",3551,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1265\\\"\\u003eCodeforces Round 604 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1023E\":[\"Down or Right\",2022,\"\\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-748D\":[\"Santa Claus and a Palindrome\",1864,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/748\\\"\\u003eTechnocup 2017 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-615E\":[\"Hexagons\",1091,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/615\\\"\\u003eCodeforces Round 338 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-748E\":[\"Santa Claus and Tangerines\",1505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/748\\\"\\u003eTechnocup 2017 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-954F\":[\"Runner\\u0027s Problem\",1031,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-821E\":[\"Okabe and El Psy Kongroo\",1601,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/821\\\"\\u003eCodeforces Round 420 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1808D\":[\"Petya, Petya, Petr, and Palindromes\",2164,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1808\\\"\\u003eCodeforces Round 861 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1167E\":[\"Range Deleting\",2596,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1167\\\"\\u003eEducational Codeforces Round 65 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1252G\":[\"Performance Review\",1430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1252\\\"\\u003e2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1482E\":[\"Skyline Photo\",2955,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1482\\\"\\u003eТехнокубок 2021 - Финал\\u003c/a\\u003e\"],\"CodeForces-1252K\":[\"Addition Robot\",1898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1252\\\"\\u003e2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-12E\":[\"Start of the session\",1275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/12\\\"\\u003eCodeforces Beta Round 12 (Div 2 Only)\\u003c/a\\u003e\"],\"CodeForces-48E\":[\"Ivan the Fool VS Gorynych the Dragon\",626,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/48\\\"\\u003eSchool Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1029E\":[\"Tree with Small Distances\",3038,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1029\\\"\\u003eCodeforces Round 506 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1005F\":[\"Berland and the Shortest Paths\",1732,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1005\\\"\\u003eCodeforces Round 496 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1223E\":[\"Paint the Tree\",2604,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1223\\\"\\u003eTechnocup 2020 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1332E\":[\"Height All the Same\",3709,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1332\\\"\\u003eCodeforces Round 630 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1671E\":[\"Preorder\",2694,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1671\\\"\\u003eEducational Codeforces Round 127 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1598E\":[\"Staircases\",2318,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1598\\\"\\u003eEducational Codeforces Round 115 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-912D\":[\"Fishes\",2117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/912\\\"\\u003eCodeforces Round 456 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-900E\":[\"Maximum Questions\",1061,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/900\\\"\\u003eCodeforces Round 450 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1C\":[\"Ancient Berland Circus\",5699,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1\\\"\\u003eCodeforces Beta Round 1\\u003c/a\\u003e\"],\"CodeForces-491B\":[\"New York Hotel\",707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/491\\\"\\u003eTesting Round 11\\u003c/a\\u003e\"],\"CodeForces-370D\":[\"Broken Monitor\",628,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/370\\\"\\u003eCodeforces Round 217 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-163C\":[\"Conveyor\",548,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/163\\\"\\u003eVK Cup 2012 Round 2\\u003c/a\\u003e\"],\"CodeForces-1028D\":[\"Order book\",1777,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1028\\\"\\u003eAIM Tech Round 5 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1343E\":[\"Weights Distributing\",4942,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1343\\\"\\u003eCodeforces Round 636 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-936B\":[\"Sleepy Game\",3149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/936\\\"\\u003eCodeforces Round 467 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-609E\":[\"Minimum spanning tree for each edge\",7856,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/609\\\"\\u003eEducational Codeforces Round 3\\u003c/a\\u003e\"],\"CodeForces-827C\":[\"DNA Evolution\",1755,\"\\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-1355E\":[\"Restorer Distance\",5136,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1355\\\"\\u003eCodeforces Round 643 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-802D\":[\"Marmots (easy)\",453,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1914G1\":[\"Light Bulbs (Easy Version)\",1669,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1914\\\"\\u003eCodeforces Round 916 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-802K\":[\"Send the Fool Further! (medium)\",632,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-260D\":[\"Black and White Tree\",1480,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/260\\\"\\u003eCodeforces Round 158 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-283C\":[\"Coin Troubles\",1422,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/283\\\"\\u003eCodeforces Round 174 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-295C\":[\"Greg and Friends\",1837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/295\\\"\\u003eCodeforces Round 179 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1039B\":[\"Subway Pursuit\",2330,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1039\\\"\\u003eCodeforces Round 507 (Div. 1, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-1354E\":[\"Graph Coloring\",3204,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1354\\\"\\u003eEducational Codeforces Round 87 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1003E\":[\"Tree Constructing\",2573,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1003\\\"\\u003eCodeforces Round 494 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1027E\":[\"Inverse Coloring\",1957,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1027\\\"\\u003eEducational Codeforces Round 49 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-838B\":[\"Diverging Directions\",759,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/838\\\"\\u003eIndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)\\u003c/a\\u003e\"],\"CodeForces-1499D\":[\"The Number of Pairs\",5623,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1499\\\"\\u003eEducational Codeforces Round 106 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1366E\":[\"Two Arrays\",4088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1366\\\"\\u003eEducational Codeforces Round 89 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-837E\":[\"Vasya\\u0027s Function\",1622,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"CodeForces-837D\":[\"Round Subset\",5188,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"CodeForces-1790F\":[\"Timofey and Black-White Tree\",3202,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1790\\\"\\u003eCodeforces Round 847 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1551D2\":[\"Domino (hard version)\",2680,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1551\\\"\\u003eCodeforces Round 734 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-35E\":[\"Parade\",818,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/35\\\"\\u003eCodeforces Beta Round 35 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1365F\":[\"Swaps Again\",4397,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1365\\\"\\u003eCodeforces Round 648 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1389D\":[\"Segment Intersections\",4084,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1389\\\"\\u003eEducational Codeforces Round 92 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1367F1\":[\"Flying Sort (Easy Version)\",3066,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1367\\\"\\u003eCodeforces Round 650 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1486D\":[\"Max Median\",6989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1486\\\"\\u003eCodeforces Round 703 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-703C\":[\"Chris and Road\",1839,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/703\\\"\\u003eCodeforces Round 365 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-703D\":[\"Mishka and Interesting sum\",3614,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/703\\\"\\u003eCodeforces Round 365 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-282D\":[\"Yet Another Number Game\",1499,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/282\\\"\\u003eCodeforces Round 173 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1910E\":[\"Maximum Sum Subarrays\",167,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1910\\\"\\u003eKotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!)\\u003c/a\\u003e\"],\"CodeForces-132D\":[\"Constants in the language of Shakespeare\",649,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/132\\\"\\u003eCodeforces Beta Round 96 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-362D\":[\"Fools and Foolproof Roads\",972,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/362\\\"\\u003eCodeforces Round 212 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1801D\":[\"The way home\",2077,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1801\\\"\\u003eCodeforces Round 857 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-132B\":[\"Piet\",475,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/132\\\"\\u003eCodeforces Beta Round 96 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-386D\":[\"Game with Points\",452,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/386\\\"\\u003eTesting Round 9\\u003c/a\\u003e\"],\"CodeForces-1271E\":[\"Common Number\",3176,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1271\\\"\\u003eCodeforces Round 608 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1271D\":[\"Portals\",2852,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1271\\\"\\u003eCodeforces Round 608 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1185G1\":[\"Playlist for Polycarp (easy version)\",2884,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1185\\\"\\u003eCodeforces Round 568 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1392E\":[\"Omkar and Duck\",3344,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1392\\\"\\u003eCodeforces Global Round 10\\u003c/a\\u003e\"],\"CodeForces-60C\":[\"Mushroom Strife\",628,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/60\\\"\\u003eCodeforces Beta Round 56\\u003c/a\\u003e\"],\"CodeForces-1933F\":[\"Turtle Mission: Robot and the Earthquake\",2174,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1933\\\"\\u003eCodeforces Round 929 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-276E\":[\"Little Girl and Problem on Trees\",1752,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/276\\\"\\u003eCodeforces Round 169 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1108E2\":[\"Array and Segments (Hard version)\",2185,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1108\\\"\\u003eCodeforces Round 535 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1606E\":[\"Arena\",3470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1606\\\"\\u003eEducational Codeforces Round 116 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-690D3\":[\"The Wall (hard)\",514,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/690\\\"\\u003eHelvetic Coding Contest 2016 online mirror (teams, unrated)\\u003c/a\\u003e\"],\"CodeForces-1184E2\":[\"Daleks\\u0027 Invasion (medium)\",923,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1184\\\"\\u003eHelvetic Coding Contest 2019 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-178D3\":[\"Magic Squares\",237,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-1185F\":[\"Two Pizzas\",1861,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1185\\\"\\u003eCodeforces Round 568 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1920E\":[\"Counting Binary Strings\",2352,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1920\\\"\\u003eCodeforces Round 919 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1811F\":[\"Is It Flower?\",1794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1811\\\"\\u003eCodeforces Round 863 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-372C\":[\"Watching Fireworks is Fun\",4226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/372\\\"\\u003eCodeforces Round 219 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-166B\":[\"Polygons\",2540,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/166\\\"\\u003eCodeforces Round 113 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1605D\":[\"Treelabeling\",2908,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1605\\\"\\u003eCodeforces Round 754 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1799D2\":[\"Hot Start Up (hard version)\",2289,\"\\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-818F\":[\"Level Generation\",1366,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"CodeForces-926J\":[\"Segments\",373,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/926\\\"\\u003eVK Cup 2018 - Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-590B\":[\"Chip \\u0027n Dale Rescue Rangers\",1757,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/590\\\"\\u003eCodeforces Round 327 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-153E\":[\"Euclidean Distance\",72,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/153\\\"\\u003eSurprise Language Round 5\\u003c/a\\u003e\"],\"CodeForces-1810E\":[\"Monsters\",3001,\"\\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-165D\":[\"Beard Graph\",1735,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/165\\\"\\u003eCodeforces Round 112 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1725F\":[\"Field Photography\",951,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1725\\\"\\u003eCOMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-286C\":[\"Main Sequence\",1474,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/286\\\"\\u003eCodeforces Round 176 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1098B\":[\"Nice table\",1520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1098\\\"\\u003eCodeforces Round 530 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1183F\":[\"Topforces Strikes Back\",1911,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1183\\\"\\u003eCodeforces Round 570 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1195E\":[\"OpenStreetMap\",3068,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1195\\\"\\u003eCodeforces Round 574 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-100H\":[\"Battleship\",74,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/100\\\"\\u003eUnknown Language Round 3\\u003c/a\\u003e\"],\"CodeForces-1938J\":[\"There and Back Again\",1104,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1938\\\"\\u003e2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-463E\":[\"Caisa and Tree\",1453,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/463\\\"\\u003eCodeforces Round 264 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-342D\":[\"Xenia and Dominoes\",561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/342\\\"\\u003eCodeforces Round 199 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-76B\":[\"Mice\",517,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/76\\\"\\u003eAll-Ukrainian School Olympiad in Informatics\\u003c/a\\u003e\"],\"CodeForces-354C\":[\"Vasya and Beautiful Arrays\",3112,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/354\\\"\\u003eCodeforces Round 206 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-909D\":[\"Colorful Points\",1825,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-269C\":[\"Flawed Flow\",1737,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/269\\\"\\u003eCodeforces Round 165 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1299C\":[\"Water Balance\",3737,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1299\\\"\\u003eCodeforces Round 618 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1372D\":[\"Omkar and Circle\",5436,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1372\\\"\\u003eCodeforces Round 655 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1493D\":[\"GCD of an Array\",4859,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1493\\\"\\u003eCodeforces Round 705 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1154F\":[\"Shovels Shop\",2751,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1154\\\"\\u003eCodeforces Round 552 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1263E\":[\"Editor\",2701,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1263\\\"\\u003eCodeforces Round 603 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1166E\":[\"The LCMs Must be Large\",2851,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1166\\\"\\u003eCodeforces Round 561 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1360H\":[\"Binary Median\",4416,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1360\\\"\\u003eCodeforces Round 644 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-475C\":[\"Kamal-ol-molk\\u0027s Painting\",817,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/475\\\"\\u003eBayan 2015 Contest Warm Up\\u003c/a\\u003e\"],\"CodeForces-1479B2\":[\"Painting the Array II\",3952,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1479\\\"\\u003eCodeforces Round 700 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1204D2\":[\"Kirk and a Binary String (hard version)\",3078,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1204\\\"\\u003eCodeforces Round 581 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-65C\":[\"Harry Potter and the Golden Snitch\",836,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/65\\\"\\u003eCodeforces Beta Round 60\\u003c/a\\u003e\"],\"CodeForces-111C\":[\"Petya and Spiders\",1436,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/111\\\"\\u003eCodeforces Beta Round 85 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-220C\":[\"Little Elephant and Shifts\",998,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/220\\\"\\u003eCodeforces Round 136 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1913D\":[\"Array Collapse\",2718,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1913\\\"\\u003eEducational Codeforces Round 160 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-77C\":[\"Beavermuncher-0xFF\",1058,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/77\\\"\\u003eCodeforces Beta Round 69 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-268E\":[\"Playlist\",1094,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/268\\\"\\u003eCodeforces Round 164 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1250C\":[\"Trip to Saint Petersburg\",1413,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1250\\\"\\u003e2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1032E\":[\"The Unbearable Lightness of Weights\",1541,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1032\\\"\\u003eTechnocup 2019 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1044C\":[\"Optimal Polygon Perimeter\",1230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1044\\\"\\u003eLyft Level 5 Challenge 2018 - Final Round\\u003c/a\\u003e\"],\"CodeForces-1056E\":[\"Check Transcription\",2157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1056\\\"\\u003eMail.Ru Cup 2018 Round 3\\u003c/a\\u003e\"],\"CodeForces-498C\":[\"Array and Operations\",3668,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/498\\\"\\u003eCodeforces Round 284 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-486D\":[\"Valid Sets\",4187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/486\\\"\\u003eCodeforces Round 277 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-571A\":[\"Lengthening Sticks\",2183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/571\\\"\\u003eCodeforces Round 317 [AimFund Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-474F\":[\"Ant colony\",8652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/474\\\"\\u003eCodeforces Round 271 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-231E\":[\"Cactus\",1715,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/231\\\"\\u003eCodeforces Round 143 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1900E\":[\"Transitive Graph\",1837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1900\\\"\\u003eCodeforces Round 911 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-74C\":[\"Chessboard Billiard\",1053,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/74\\\"\\u003eCodeforces Beta Round 68\\u003c/a\\u003e\"],\"CodeForces-340B\":[\"Maximal Area Quadrilateral\",2259,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/340\\\"\\u003eCodeforces Round 198 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1912B\":[\"Blueprint for Seating\",910,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1912\\\"\\u003e2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1948E\":[\"Clique Partition\",2547,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1948\\\"\\u003eEducational Codeforces Round 163 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1924B\":[\"Space Harbour\",2269,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1924\\\"\\u003eCodeforces Round 921 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1152D\":[\"Neko and Aki\\u0027s Prank\",2419,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1152\\\"\\u003eCodeforces Round 554 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1176F\":[\"Destroy it!\",1827,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1176\\\"\\u003eCodeforces Round 565 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-919E\":[\"Congruence Equation\",2012,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/919\\\"\\u003eCodeforces Round 460 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1370E\":[\"Binary Subsequence Rotation\",4683,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1370\\\"\\u003eCodeforces Round 651 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-50D\":[\"Bombing\",708,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/50\\\"\\u003eCodeforces Beta Round 47\\u003c/a\\u003e\"],\"CodeForces-242D\":[\"Dispute\",1976,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/242\\\"\\u003eCodeforces Round 149 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-254E\":[\"Dormitory\",550,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/254\\\"\\u003eCodeforces Round 155 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1729G\":[\"Cut Substrings\",2098,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1729\\\"\\u003eCodeforces Round 820 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-266C\":[\"Below the Diagonal\",1457,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/266\\\"\\u003eCodeforces Round 163 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1838D\":[\"Bracket Walk\",3101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1838\\\"\\u003eCodeforces Round 877 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-145C\":[\"Lucky Subsequence\",2024,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/145\\\"\\u003eCodeforces Round 104 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1066F\":[\"Yet another 2D Walking\",1927,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1066\\\"\\u003eCodeforces Round 515 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1163D\":[\"Mysterious Code\",1298,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1163\\\"\\u003eCodeforces Round 558 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1284D\":[\"New Year and Conference\",3033,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1284\\\"\\u003eHello 2020\\u003c/a\\u003e\"],\"CodeForces-1187E\":[\"Tree Painting\",7891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1151E\":[\"Number of Components\",3175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1151\\\"\\u003eCodeforces Round 553 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1296F\":[\"Berland Beauty\",2754,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1296\\\"\\u003eCodeforces Round 617 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1393D\":[\"Rarity and New Dress\",3864,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1393\\\"\\u003eCodeforces Round 662 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1839D\":[\"Ball Sorting\",2192,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1839\\\"\\u003eCodeforces Round 876 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-484B\":[\"Maximum Value\",7218,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/484\\\"\\u003eCodeforces Round 276 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-496E\":[\"Distributing Parts\",1761,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/496\\\"\\u003eCodeforces Round 283 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1538E\":[\"Funny Substrings\",2828,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1538\\\"\\u003eCodeforces Round 725 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1538G\":[\"Gift Set\",4437,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1538\\\"\\u003eCodeforces Round 725 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-431D\":[\"Random Task\",2348,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/431\\\"\\u003eCodeforces Round 247 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-225E\":[\"Unsolvable\",868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/225\\\"\\u003eCodeforces Round 139 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-455C\":[\"Civilization\",5548,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/455\\\"\\u003eCodeforces Round 260 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-128B\":[\"String\",2644,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/128\\\"\\u003eCodeforces Beta Round 94 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-576B\":[\"Invariance of Tree\",1620,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/576\\\"\\u003eCodeforces Round 319 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-576C\":[\"Points on Plane\",3693,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/576\\\"\\u003eCodeforces Round 319 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-552E\":[\"Vanya and Brackets\",1508,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/552\\\"\\u003eCodeforces Round 308 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-661D\":[\"Maximal Difference\",124,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/661\\\"\\u003eVK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror)\\u003c/a\\u003e\"],\"CodeForces-540E\":[\"Infinite Inversions\",2293,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/540\\\"\\u003eCodeforces Round 301 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1767C\":[\"Count Binary Strings\",2515,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1767\\\"\\u003eEducational Codeforces Round 140 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1525E\":[\"Assimilation IV\",2006,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1525\\\"\\u003eEducational Codeforces Round 109 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1876C\":[\"Autosynthesis\",2134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1876\\\"\\u003eCodeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round)\\u003c/a\\u003e\"],\"CodeForces-103D\":[\"Time to Raid Cowavans\",2215,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/103\\\"\\u003eCodeforces Beta Round 80 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-321C\":[\"Ciel the Commander\",7586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/321\\\"\\u003eCodeforces Round 190 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-333D\":[\"Characteristics of Rectangles\",1933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/333\\\"\\u003eCodeforces Round 194 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-212C\":[\"Cowboys\",439,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/212\\\"\\u003eVK Cup 2012 Finals (unofficial online-version)\\u003c/a\\u003e\"],\"CodeForces-345B\":[\"Triskaidekaphobia\",122,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/345\\\"\\u003eFriday the 13th, Programmers Day\\u003c/a\\u003e\"],\"CodeForces-1864E\":[\"Guess Game\",2493,\"\\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-587B\":[\"Duff in Beach\",1432,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/587\\\"\\u003eCodeforces Round 326 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-466D\":[\"Increase Sequence\",3143,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/466\\\"\\u003eCodeforces Round 266 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-466E\":[\"Information Graph\",2296,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/466\\\"\\u003eCodeforces Round 266 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-793D\":[\"Presents in Bankopolis\",1618,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/793\\\"\\u003eTinkoff Challenge - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-551D\":[\"GukiZ and Binary Operations\",1888,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/551\\\"\\u003eCodeforces Round 307 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-575F\":[\"Bulbo\",1034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/575\\\"\\u003eBubble Cup 8 - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-1778D\":[\"Flexible String Revisit\",2612,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1778\\\"\\u003eCodeforces Round 848 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-441D\":[\"Valera and Swaps\",1132,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/441\\\"\\u003eCodeforces Round 252 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1832D1\":[\"Red-Blue Operations (Easy Version)\",2796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1832\\\"\\u003eEducational Codeforces Round 148 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-356C\":[\"Compartments\",1370,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/356\\\"\\u003eCodeforces Round 207 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1621D\":[\"The Winter Hike\",4001,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1621\\\"\\u003eHello 2022\\u003c/a\\u003e\"],\"CodeForces-1863E\":[\"Speedrun\",2631,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1863\\\"\\u003ePinely Round 2 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1930D2\":[\"Sum over all Substrings (Hard Version)\",2349,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1930\\\"\\u003ethink-cell Round 1\\u003c/a\\u003e\"],\"CodeForces-489F\":[\"Special Matrices\",1799,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/489\\\"\\u003eCodeforces Round 277.5 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-780E\":[\"Underground Lab\",2321,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/780\\\"\\u003eТехнокубок 2017 - Финал (только для онсайт-финалистов)\\u003c/a\\u003e\"],\"CodeForces-1886D\":[\"Monocarp and the Set\",3327,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1886\\\"\\u003eEducational Codeforces Round 156 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-343D\":[\"Water Tree\",6431,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/343\\\"\\u003eCodeforces Round 200 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-452C\":[\"Magic Trick\",1486,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/452\\\"\\u003eMemSQL Start[c]UP 2.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1811G1\":[\"Vlad and the Nice Paths (easy version)\",1936,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1811\\\"\\u003eCodeforces Round 863 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1511E\":[\"Colorings and Dominoes\",2501,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1511\\\"\\u003eEducational Codeforces Round 107 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1547G\":[\"How Many Paths?\",2957,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1547\\\"\\u003eCodeforces Round 731 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-464C\":[\"Substitutes in Number\",1696,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/464\\\"\\u003eCodeforces Round 265 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1821E\":[\"Rearrange Brackets\",2258,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1821\\\"\\u003eEducational Codeforces Round 147 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1748D\":[\"ConstructOR\",2701,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1748\\\"\\u003eCodeforces Round 833 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1409F\":[\"Subsequences of Length Two\",4445,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1409\\\"\\u003eCodeforces Round 667 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-229D\":[\"Towers\",2316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/229\\\"\\u003eCodeforces Round 142 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-217B\":[\"Blackboard Fibonacci\",900,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/217\\\"\\u003eCodeforces Round 134 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-774A\":[\"Amusement Park\",299,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/774\\\"\\u003eVK Cup 2017 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-689D\":[\"Friends and Subsequences\",3613,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/689\\\"\\u003eCodeforces Round 361 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-774B\":[\"Significant Cups\",223,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/774\\\"\\u003eVK Cup 2017 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-665E\":[\"Beautiful Subarrays\",3299,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/665\\\"\\u003eEducational Codeforces Round 12\\u003c/a\\u003e\"],\"CodeForces-992D\":[\"Nastya and a Game\",1667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/992\\\"\\u003eCodeforces Round 489 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-520D\":[\"Cubes\",1577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/520\\\"\\u003eCodeforces Round 295 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-762C\":[\"Two strings\",2531,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"CodeForces-895D\":[\"String Mark\",1128,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-980D\":[\"Perfect Groups\",2592,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/980\\\"\\u003eCodeforces Round 480 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1856D\":[\"More Wrong\",3144,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1856\\\"\\u003eCodeforces Round 890 (Div. 2) supported by Constructor Institute\\u003c/a\\u003e\"],\"CodeForces-1626D\":[\"Martial Arts Tournament\",3837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1626\\\"\\u003eEducational Codeforces Round 121 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-313D\":[\"Ilya and Roads\",1617,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/313\\\"\\u003eCodeforces Round 186 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-301B\":[\"Yaroslav and Time\",2264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/301\\\"\\u003eCodeforces Round 182 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1184A2\":[\"Heidi Learns Hashing (Medium)\",949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1184\\\"\\u003eHelvetic Coding Contest 2019 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-228D\":[\"Zigzag\",395,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/228\\\"\\u003eCodeforces Round 141 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-543B\":[\"Destroying Roads\",4092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/543\\\"\\u003eCodeforces Round 302 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-797D\":[\"Broken BST\",1810,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"CodeForces-894E\":[\"Ralph and Mushrooms\",2342,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/894\\\"\\u003eCodeforces Round 447 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-81D\":[\"Polycarp\\u0027s Picture Gallery\",692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/81\\\"\\u003eYandex.Algorithm Open 2011: Qualification 1\\u003c/a\\u003e\"],\"CodeForces-1734E\":[\"Rectangular Congruence\",2822,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1734\\\"\\u003eCodeforces Round 822 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1637E\":[\"Best Pair\",3220,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1637\\\"\\u003eCodeforces Global Round 19\\u003c/a\\u003e\"],\"CodeForces-1710B\":[\"Rain\",2380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1710\\\"\\u003eCodeforces Round 810 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1419E\":[\"Decryption\",3177,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1419\\\"\\u003eCodeforces Round 671 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1516D\":[\"Cut\",4238,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1516\\\"\\u003eCodeforces Round 717 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-106E\":[\"Space Rescuers\",895,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/106\\\"\\u003eCodeforces Beta Round 82 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-215E\":[\"Periodical Numbers\",650,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/215\\\"\\u003eCodeforces Round 132 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-336D\":[\"Vasily the Bear and Beautiful Strings\",1019,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/336\\\"\\u003eCodeforces Round 195 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-215C\":[\"Crosses\",524,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/215\\\"\\u003eCodeforces Round 132 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-457C\":[\"Elections\",992,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/457\\\"\\u003eMemSQL Start[c]UP 2.0 - Round 2\\u003c/a\\u003e\"],\"CodeForces-348B\":[\"Apple Tree\",2136,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/348\\\"\\u003eCodeforces Round 202 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1732C2\":[\"Sheikh (Hard Version)\",2470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1732\\\"\\u003eCodeforces Round 830 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-675C\":[\"Money Transfers\",3813,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/675\\\"\\u003eCodeforces Round 353 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-796D\":[\"Police Stations\",5670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/796\\\"\\u003eCodeforces Round 408 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-542F\":[\"Quest\",802,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/542\\\"\\u003eVK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)\\u003c/a\\u003e\"],\"CodeForces-530F\":[\"Jumping frogs\",97,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/530\\\"\\u003eVK Cup 2015 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-530G\":[\"Levenshtein distance\",146,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/530\\\"\\u003eVK Cup 2015 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-530H\":[\"Points in triangle\",119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/530\\\"\\u003eVK Cup 2015 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-990E\":[\"Post Lamps\",2186,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/990\\\"\\u003eEducational Codeforces Round 45 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1418D\":[\"Trash Problem\",4241,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1418\\\"\\u003eEducational Codeforces Round 95 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-226D\":[\"The table\",1152,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/226\\\"\\u003eCodeforces Round 140 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-335C\":[\"More Reclamation\",527,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/335\\\"\\u003eMemSQL start[c]up Round 2 - online version\\u003c/a\\u003e\"],\"CodeForces-238C\":[\"World Eater Brothers\",1091,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/238\\\"\\u003eCodeforces Round 148 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1866G\":[\"Grouped Carriages\",1511,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1866\\\"\\u003eCOMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1866H\":[\"Happy Sets\",1537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1866\\\"\\u003eCOMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1070E\":[\"Getting Deals Done\",1235,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1070\\\"\\u003e2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-771C\":[\"Bear and Tree Jumps\",2866,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/771\\\"\\u003eVK Cup 2017 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1628D1\":[\"Game on Sum (Easy Version)\",3113,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1628\\\"\\u003eCodeforces Round 767 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1106E\":[\"Lunar New Year and Red Envelopes\",2448,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1106\\\"\\u003eCodeforces Round 536 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1433G\":[\"Reducing Delivery Cost\",4395,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1433\\\"\\u003eCodeforces Round 677 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1530E\":[\"Minimax\",2939,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1530\\\"\\u003eCodeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine))\\u003c/a\\u003e\"],\"CodeForces-439E\":[\"Devu and Birthday Celebration\",1609,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/439\\\"\\u003eCodeforces Round 251 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-306C\":[\"White, Black and White Again\",484,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/306\\\"\\u003eTesting Round 6\\u003c/a\\u003e\"],\"CodeForces-306B\":[\"Optimizer\",496,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/306\\\"\\u003eTesting Round 6\\u003c/a\\u003e\"],\"CodeForces-1312E\":[\"Array Shrinking\",6013,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1312\\\"\\u003eEducational Codeforces Round 83 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1433F\":[\"Zero Remainder Sum\",6179,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1433\\\"\\u003eCodeforces Round 677 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-5D\":[\"Follow Traffic Rules\",1656,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/5\\\"\\u003eCodeforces Beta Round 5\\u003c/a\\u003e\"],\"CodeForces-875C\":[\"National Property\",2001,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/875\\\"\\u003eCodeforces Round 441 (Div. 1, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-524D\":[\"Social Network\",953,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/524\\\"\\u003eVK Cup 2015 - Round 1\\u003c/a\\u003e\"],\"CodeForces-730C\":[\"Bulmart\",1046,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/730\\\"\\u003e2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-754D\":[\"Fedor and coupons\",2305,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/754\\\"\\u003eCodeforces Round 390 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-766E\":[\"Mahmoud and a xor trip\",3024,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/766\\\"\\u003eCodeforces Round 396 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-899F\":[\"Letters Removing\",1659,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-960F\":[\"Pathwalks\",2850,\"\\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-960D\":[\"Full Binary Tree Queries\",1778,\"\\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-1387B1\":[\"Village (Minimum)\",1360,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1387\\\"\\u003eBaltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated)\\u003c/a\\u003e\"],\"CodeForces-1117D\":[\"Magic Gems\",4548,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1117\\\"\\u003eEducational Codeforces Round 60 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1650G\":[\"Counting Shortcuts\",2423,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1650\\\"\\u003eCodeforces Round 776 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1771D\":[\"Hossam and (sub-)palindromic tree\",2678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1771\\\"\\u003eCodeforces Round 837 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-414C\":[\"Mashmokh and Reverse Operation\",2260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/414\\\"\\u003eCodeforces Round 240 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1202C\":[\"You Are Given a WASD-string...\",2493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1202\\\"\\u003eEducational Codeforces Round 70 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-208E\":[\"Blood Cousins\",6792,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/208\\\"\\u003eCodeforces Round 130 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1553E\":[\"Permutation Shift\",3258,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1553\\\"\\u003eHarbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-209B\":[\"Pixels\",446,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/209\\\"\\u003eVK Cup 2012 Finals, Practice Session\\u003c/a\\u003e\"],\"CodeForces-1254B2\":[\"Send Boxes to Alice (Hard Version)\",2978,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1254\\\"\\u003eCodeforces Round 601 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-644C\":[\"Hostname Aliases\",913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/644\\\"\\u003eCROC 2016 - Qualification\\u003c/a\\u003e\"],\"CodeForces-656D\":[\"Rosetta Problem\",949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/656\\\"\\u003eApril Fools Day Contest 2016\\u003c/a\\u003e\"],\"CodeForces-850B\":[\"Arpa and a list of numbers\",2069,\"\\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-995A\":[\"Tesla\",1567,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/995\\\"\\u003eCodeforces Round 492 (Div. 1) [Thanks, uDebug!]\\u003c/a\\u003e\"],\"CodeForces-632D\":[\"Longest Subsequence\",3661,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/632\\\"\\u003eEducational Codeforces Round 9\\u003c/a\\u003e\"],\"CodeForces-862E\":[\"Mahmoud and Ehab and the function\",1459,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/862\\\"\\u003eCodeforces Round 435 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-620E\":[\"New Year Tree\",5835,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/620\\\"\\u003eEducational Codeforces Round 6\\u003c/a\\u003e\"],\"CodeForces-38F\":[\"Smart Boy\",389,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/38\\\"\\u003eSchool Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1213F\":[\"Unstable String Sort\",2443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1201D\":[\"Treasure Hunting\",2238,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1201\\\"\\u003eCodeforces Round 577 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1431F\":[\"Neural Network Problem\",153,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1431\\\"\\u003eKotlin Heroes 5: ICPC Round\\u003c/a\\u003e\"],\"CodeForces-1431G\":[\"Number Deletion Game\",137,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1431\\\"\\u003eKotlin Heroes 5: ICPC Round\\u003c/a\\u003e\"],\"CodeForces-1322B\":[\"Present\",3949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1322\\\"\\u003eCodeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"CodeForces-1660F2\":[\"Promising String (hard version)\",2643,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1660\\\"\\u003eCodeforces Round 780 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-788B\":[\"Weird journey\",2361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/788\\\"\\u003eCodeforces Round 407 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1934D1\":[\"XOR Break --- Solo Version\",3023,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1934\\\"\\u003eCodeforces Round 931 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-522C\":[\"Chicken or Fish?\",714,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/522\\\"\\u003eVK Cup 2015 - Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-546E\":[\"Soldier and Traveling\",3901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/546\\\"\\u003eCodeforces Round 304 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-776E\":[\"The Holmes Children\",2412,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/776\\\"\\u003eICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-631D\":[\"Messenger\",2219,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/631\\\"\\u003eCodeforces Round 344 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1077F2\":[\"Pictures with Kittens (hard version)\",3080,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1077\\\"\\u003eCodeforces Round 521 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-630P\":[\"Area of a Star\",1208,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-400E\":[\"Inna and Binary Logic\",982,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/400\\\"\\u003eCodeforces Round 234 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-39C\":[\"Moon Craters\",620,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/39\\\"\\u003eSchool Team Contest 1 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-1454F\":[\"Array Partition\",3968,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1454\\\"\\u003eCodeforces Round 686 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1599H\":[\"Hidden Fortress\",1016,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1599\\\"\\u003eBubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1684E\":[\"MEX vs DIFF\",3095,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1684\\\"\\u003eCodeforces Round 792 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1006F\":[\"Xor-Paths\",5214,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1006\\\"\\u003eCodeforces Round 498 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1333D\":[\"Challenges in school №41\",3706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1333\\\"\\u003eCodeforces Round 632 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1466F\":[\"Euclid\\u0027s nightmare\",2810,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1466\\\"\\u003eGood Bye 2020\\u003c/a\\u003e\"],\"CodeForces-1450C1\":[\"Errich-Tac-Toe (Easy Version)\",5399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1450\\\"\\u003eCodeforces Global Round 12\\u003c/a\\u003e\"],\"CodeForces-799D\":[\"Field expansion\",2086,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/799\\\"\\u003ePlayrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-763B\":[\"Timofey and rectangles\",2725,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/763\\\"\\u003eCodeforces Round 395 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1575L\":[\"Longest Array Deconstruction\",1288,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1575\\\"\\u003eCOMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-993C\":[\"Careful Maneuvering\",1558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/993\\\"\\u003eCodeforces Round 488 by NEAR (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1667B\":[\"Optimal Partition\",3533,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1667\\\"\\u003eCodeforces Round 783 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1207F\":[\"Remainder Problem\",5090,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1207\\\"\\u003eEducational Codeforces Round 71 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1510G\":[\"Guide\",1260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1510\\\"\\u003e2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1413E\":[\"Solo mid Oracle\",1921,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1413\\\"\\u003eTechnocup 2021 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1510D\":[\"Digits\",1832,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1510\\\"\\u003e2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1776G\":[\"Another Wine Tasting Event\",1957,\"\\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-649E\":[\"Автобус\",104,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/649\\\"\\u003eТехнокубок 2016 - Отборочный Раунд 2\\u003c/a\\u003e\"],\"CodeForces-601B\":[\"Lipshitz Sequence\",2103,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/601\\\"\\u003eCodeforces Round 333 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-734E\":[\"Anton and Tree\",4380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/734\\\"\\u003eCodeforces Round 379 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-988E\":[\"Divisibility by 25\",4002,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/988\\\"\\u003eCodeforces Round 486 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-746G\":[\"New Roads\",1428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/746\\\"\\u003eCodeforces Round 386 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-976E\":[\"Well played!\",2340,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/976\\\"\\u003eEducational Codeforces Round 43 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-988F\":[\"Rain and Umbrellas\",2378,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/988\\\"\\u003eCodeforces Round 486 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1666J\":[\"Job Lookup\",1327,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1666\\\"\\u003e2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1218I\":[\"The Light Square\",614,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1218\\\"\\u003eBubble Cup 12 - Finals [Online Mirror, unrated, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-1654D\":[\"Potion Brewing Class\",2805,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1654\\\"\\u003eCodeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1787E\":[\"The Harmonization of XOR\",2215,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1787\\\"\\u003eTypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1775E\":[\"The Human Equation\",3087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1775\\\"\\u003eCodeforces Round 843 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1884D\":[\"Counting Rhyme\",2795,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1884\\\"\\u003eCodeforces Round 904 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1896E\":[\"Permutation Sorting\",2011,\"\\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-1614D1\":[\"Divan and Kostomuksha (easy version)\",3704,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1614\\\"\\u003eCodeforces Round 757 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1108F\":[\"MST Unification\",2817,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1108\\\"\\u003eCodeforces Round 535 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1217D\":[\"Coloring Edges\",5429,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1217\\\"\\u003eEducational Codeforces Round 72 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1560F2\":[\"Nearest Beautiful Number (hard version)\",4278,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1560\\\"\\u003eCodeforces Round 739 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1762D\":[\"GCD Queries\",3337,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1762\\\"\\u003eCodeforces Round 838 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1411D\":[\"Grime Zoo\",2461,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1411\\\"\\u003eTechnocup 2021 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-309B\":[\"Context Advertising\",538,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/309\\\"\\u003eCroc Champ 2013 - Finals (online version, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-853C\":[\"Boredom\",1467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/853\\\"\\u003eCodeforces Round 433 (Div. 1, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-768E\":[\"Game of Stones\",3116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/768\\\"\\u003eDivide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-877D\":[\"Olya and Energy Drinks\",4444,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-732E\":[\"Sockets\",1670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/732\\\"\\u003eCodeforces Round 377 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-190E\":[\"Counter Attack\",1546,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/190\\\"\\u003eCodeforces Round 120 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1446C\":[\"Xor Tree\",3503,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1446\\\"\\u003eCodeforces Round 683 (Div. 1, by Meet IT)\\u003c/a\\u003e\"],\"CodeForces-1216F\":[\"Wi-Fi\",2668,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1216\\\"\\u003eCodeforces Round 587 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1555E\":[\"Boring Segments\",3908,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1555\\\"\\u003eEducational Codeforces Round 112 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1761D\":[\"Carry Bit\",2356,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1761\\\"\\u003ePinely Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-319C\":[\"Kalila and Dimna in the Logging Industry\",5164,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/319\\\"\\u003eCodeforces Round 189 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-767B\":[\"The Queue\",2276,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/767\\\"\\u003eCodeforces Round 398 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-985D\":[\"Sand Fortress\",2491,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/985\\\"\\u003eEducational Codeforces Round 44 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-525E\":[\"Anya and Cubes\",3078,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/525\\\"\\u003eCodeforces Round 297 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-767D\":[\"Cartons of milk\",2374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/767\\\"\\u003eCodeforces Round 398 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-985E\":[\"Pencils and Boxes\",3412,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/985\\\"\\u003eEducational Codeforces Round 44 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-549H\":[\"Degenerate Matrix\",1939,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/549\\\"\\u003eLooksery Cup 2015\\u003c/a\\u003e\"],\"CodeForces-852D\":[\"Exploration plan\",1017,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/852\\\"\\u003eBubble Cup X - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-840B\":[\"Leha and another game about graph\",2293,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/840\\\"\\u003eCodeforces Round 429 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-852C\":[\"Property\",387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/852\\\"\\u003eBubble Cup X - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-852E\":[\"Casinos and travel\",864,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/852\\\"\\u003eBubble Cup X - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-1868B2\":[\"Candy Party (Hard Version)\",2277,\"\\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":1711958695000,"title":"CodeForces rating 2100 题目集","dislikeCnt":0,"content":"[problem:CodeForces-474F] Ant colony数据结构(data structures) 数学(math), 数论(number theory\n[problem:CodeForces-1187E] Tree painting深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-609E] Minimum spanning tree for each edge数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-484B] Maximum value二分搜索(binary search) 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-321C] Ciel the commander构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1486D] Max median二分搜索(binary search) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-519E] A and b and lecture rooms二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-208E] Blood cousins二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1433F] Zero remainder sum动态规划(dp \n[problem:CodeForces-920E] Connected components?数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1312E] Array shrinking动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1499D] The number of pairs动态规划(dp) 数学(math), 数论(number theory\n[problem:CodeForces-343D] Water tree数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1C] Ancient berland circus计算几何(geometry) 数学(math\n[problem:CodeForces-1450C1] Errich-tac-toe (easy version)构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1372D] Omkar and circle暴力枚举(brute force) 动态规划(dp), 博弈论(games), 贪心策略(greedy\n[problem:CodeForces-455C] Civilization深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu), 三分搜索(ternary search), 树形结构(trees\n[problem:CodeForces-620E] New year tree位掩码(bitmasks) 数据结构(data structures), 树形结构(trees\n[problem:CodeForces-796D] Police stations构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1217D] Coloring edges构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-1343E] Weights distributing暴力枚举(brute force) 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-837D] Round subset动态规划(dp) 数学(math\n[problem:CodeForces-1493D] Gcd of an array暴力枚举(brute force) 数据结构(data structures), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1355E] Restorer distance二分搜索(binary search) 贪心策略(greedy), 数学(math), 排序算法(sortings), 三分搜索(ternary search\n[problem:CodeForces-319C] Kalila and dimna in the logging industry动态规划(dp) 计算几何(geometry\n[problem:CodeForces-1207F] Remainder problem暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1370E] Binary subsequence rotation二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1006F] Xor-paths位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-1420C2] Pokémon army (hard version)数据结构(data structures) 分治算法(divide and conquer), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1472G] Moving to the capital深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1538G] Gift set二分搜索(binary search) 贪心策略(greedy), 数学(math), 三分搜索(ternary search\n[problem:CodeForces-1365F] Swaps again构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1360H] Binary median二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 构造算法(constructive algorithms\n[problem:CodeForces-1409F] Subsequences of length two动态规划(dp) 字符串处理(strings\n[problem:CodeForces-1560F2] Nearest beautiful number (hard version)位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1418D] Trash problem数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1433G] Reducing delivery cost暴力枚举(brute force) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1516D] Cut二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 图论(graphs), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-1389D] Segment intersections暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1364D] Ehab\u0027s last corollary构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1117D] Magic gems动态规划(dp) 数学(math), 矩阵(matrices\n[problem:CodeForces-1621D] The winter hike构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1366E] Two arrays二分搜索(binary search) 暴力枚举(brute force), 组合数学(combinatorics), 构造算法(constructive algorithms), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-877D] Olya and energy drinks数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1479B2] Painting the array ii构造算法(constructive algorithms) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1322B] Present二分搜索(binary search) 位掩码(bitmasks), 构造算法(constructive algorithms), 数据结构(data structures), 数学(math), 排序算法(sortings\n[problem:CodeForces-486D] Valid sets深度优先搜索及其变种(dfs and similar) 动态规划(dp), 数学(math), 树形结构(trees\n[problem:CodeForces-1555E] Boring segments数据结构(data structures) 排序算法(sortings), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1000E] We need more bosses深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-543B] Destroying roads构造算法(constructive algorithms) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1363D] Guess the maximums二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive), 数学(math\n[problem:CodeForces-1454F] Array partition二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1626D] Martial arts tournament二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1393D] Rarity and new dress深度优先搜索及其变种(dfs and similar) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-734E] Anton and tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1278D] Segment tree数据结构(data structures) 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1333D] Challenges in school №41暴力枚举(brute force) 构造算法(constructive algorithms), 博弈论(games), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1614D1] Divan and kostomuksha (easy version)动态规划(dp) 数论(number theory\n[problem:CodeForces-988E] Divisibility by 25暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-372C] Watching fireworks is fun数据结构(data structures) 动态规划(dp), 数学(math\n[problem:CodeForces-1299C] Water balance数据结构(data structures) 计算几何(geometry), 贪心策略(greedy\n[problem:CodeForces-1332E] Height all the same组合数学(combinatorics) 构造算法(constructive algorithms), 数学(math), 矩阵(matrices\n[problem:CodeForces-1919D] 01 tree构造算法(constructive algorithms) 数据结构(data structures), 并查集(dsu), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1667B] Optimal partition数据结构(data structures) 动态规划(dp\n[problem:CodeForces-546E] Soldier and traveling流(flows) 图论(graphs), 数学(math\n[problem:CodeForces-675C] Money transfers构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1446C] Xor tree二分搜索(binary search) 位掩码(bitmasks), 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-632D] Longest subsequence暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-1606E] Arena组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-703D] Mishka and interesting sum数据结构(data structures \n[problem:CodeForces-1025D] Recovering bst暴力枚举(brute force) 动态规划(dp), 数学(math), 数论(number theory), 树形结构(trees\n[problem:CodeForces-1265E] Beautiful mirrors数据结构(data structures) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-498C] Array and operations流(flows) 图匹配(graph matchings), 数论(number theory\n[problem:CodeForces-1762D] Gcd queries构造算法(constructive algorithms) 交互性问题(interactive), 数论(number theory\n[problem:CodeForces-1886D] Monocarp and the set组合数学(combinatorics) 数据结构(data structures), 数学(math\n[problem:CodeForces-1553E] Permutation shift暴力枚举(brute force) 组合数学(combinatorics), 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 数学(math\n[problem:CodeForces-1203F1] Complete the projects (easy version)贪心策略(greedy \n[problem:CodeForces-1392E] Omkar and duck位掩码(bitmasks) 构造算法(constructive algorithms), 交互性问题(interactive), 数学(math\n[problem:CodeForces-985E] Pencils and boxes二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-576C] Points on plane构造算法(constructive algorithms) 分治算法(divide and conquer), 计算几何(geometry), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1637E] Best pair二分搜索(binary search) 暴力枚举(brute force), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1419E] Decryption构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1271E] Common number二分搜索(binary search) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-1790F] Timofey and black-white tree暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 图论(graphs), 贪心策略(greedy), 数学(math), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1354E] Graph coloring深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs\n[problem:CodeForces-689D] Friends and subsequences二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-1856D] More wrong分治算法(divide and conquer) 交互性问题(interactive\n[problem:CodeForces-1838D] Bracket walk数据结构(data structures) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-936B] Sleepy game深度优先搜索及其变种(dfs and similar) 动态规划(dp), 博弈论(games), 图论(graphs\n[problem:CodeForces-1684E] Mex vs diff二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1151E] Number of components组合数学(combinatorics) 数据结构(data structures), 动态规划(dp), 数学(math\n[problem:CodeForces-1775E] The human equation贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1628D1] Game on sum (easy version)组合数学(combinatorics) 动态规划(dp), 博弈论(games), 数学(math\n[problem:CodeForces-1367F1] Flying sort (easy version)动态规划(dp) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1204D2] Kirk and a binary string (hard version)数据结构(data structures) 贪心策略(greedy), 数学(math), 字符串处理(strings\n[problem:CodeForces-354C] Vasya and beautiful arrays暴力枚举(brute force) 动态规划(dp), 数论(number theory\n[problem:CodeForces-1810E] Monsters暴力枚举(brute force) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1472F] New year\u0027s puzzle暴力枚举(brute force) 动态规划(dp), 图匹配(graph matchings), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1254B2] Send boxes to alice (hard version)构造算法(constructive algorithms) 贪心策略(greedy), 数学(math), 数论(number theory), 三分搜索(ternary search), 双指针算法(two pointers\n[problem:CodeForces-1482E] Skyline photo数据结构(data structures) 分治算法(divide and conquer), 动态规划(dp\n[problem:CodeForces-1530E] Minimax构造算法(constructive algorithms) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1284D] New year and conference二分搜索(binary search) 数据结构(data structures), 哈希表(hashing), 排序算法(sortings\n[problem:CodeForces-1934D1] Xor break --- solo version位掩码(bitmasks) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-665E] Beautiful subarrays数据结构(data structures) 分治算法(divide and conquer), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1605D] Treelabeling位掩码(bitmasks) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 博弈论(games), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1077F2] Pictures with kittens (hard version)数据结构(data structures) 动态规划(dp\n[problem:CodeForces-466D] Increase sequence组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-1195E] Openstreetmap数据结构(data structures) 双指针算法(two pointers\n[problem:CodeForces-1466F] Euclid\u0027s nightmare位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1538E] Funny substrings数据结构(data structures) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 矩阵(matrices), 字符串处理(strings\n[problem:CodeForces-771C] Bear and tree jumps深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-766E] Mahmoud and a xor trip位掩码(bitmasks) 构造算法(constructive algorithms), 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 数学(math), 树形结构(trees\n[problem:CodeForces-1654D] Potion brewing class深度优先搜索及其变种(dfs and similar) 数学(math), 数论(number theory), 树形结构(trees\n[problem:CodeForces-1832D1] Red-blue operations (easy version)二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1029E] Tree with small distances动态规划(dp) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1547G] How many paths?深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1734E] Rectangular congruence构造算法(constructive algorithms) 数论(number theory\n[problem:CodeForces-1271D] Portals数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1884D] Counting rhyme动态规划(dp) 数学(math), 数论(number theory\n[problem:CodeForces-525E] Anya and cubes二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 动态规划(dp), 数学(math), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-960F] Pathwalks数据结构(data structures) 动态规划(dp), 图论(graphs\n[problem:CodeForces-1551D2] Domino (hard version)构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1166E] The lcms must be large位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 数学(math), 数论(number theory\n[problem:CodeForces-1748D] Constructor位掩码(bitmasks) 中国剩余定理(chinese remainder theorem), 组合数学(combinatorics), 构造算法(constructive algorithms), 数学(math), 数论(number theory\n[problem:CodeForces-1671E] Preorder组合数学(combinatorics) 分治算法(divide and conquer), 动态规划(dp), 并查集(dsu), 哈希表(hashing), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-768E] Game of stones位掩码(bitmasks) 动态规划(dp), 博弈论(games\n[problem:CodeForces-1296F] Berland beauty构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1913D] Array collapse数据结构(data structures) 分治算法(divide and conquer), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-507E] Breaking good深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1660F2] Promising string (hard version)数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 数学(math), 字符串处理(strings\n[problem:CodeForces-763B] Timofey and rectangles构造算法(constructive algorithms) 计算几何(geometry\n[problem:CodeForces-1863E] Speedrun暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1771D] Hossam and (sub-)palindromic tree暴力枚举(brute force) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1263E] Editor数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1108F] Mst unification二分搜索(binary search) 并查集(dsu), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1185G1] Playlist for polycarp (easy version)位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp\n[problem:CodeForces-1154F] Shovels shop动态规划(dp) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1223E] Paint the tree动态规划(dp) 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1778D] Flexible string revisit组合数学(combinatorics) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-1767C] Count binary strings数据结构(data structures) 动态规划(dp\n[problem:CodeForces-955C] Sad powers二分搜索(binary search) 数学(math), 数论(number theory\n[problem:CodeForces-1864E] Guess game位掩码(bitmasks) 数据结构(data structures), 博弈论(games), 数学(math), 概率论(probabilities), 排序算法(sortings), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-128B] String暴力枚举(brute force) 构造算法(constructive algorithms), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-1511E] Colorings and dominoes组合数学(combinatorics) 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1411D] Grime zoo暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1732C2] Sheikh (hard version)二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1003E] Tree constructing构造算法(constructive algorithms) 图论(graphs\n[problem:CodeForces-980D] Perfect groups动态规划(dp) 数学(math), 数论(number theory\n[problem:CodeForces-1167E] Range deleting二分搜索(binary search) 组合数学(combinatorics), 数据结构(data structures), 双指针算法(two pointers\n[problem:CodeForces-762C] Two strings二分搜索(binary search) 哈希表(hashing), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1710B] Rain二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 计算几何(geometry), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1202C] You are given a wasd-string...暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 字符串处理(strings\n[problem:CodeForces-1216F] Wi-fi数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1593F] Red-black number深度优先搜索及其变种(dfs and similar) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-1650G] Counting shortcuts数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1106E] Lunar new year and red envelopes数据结构(data structures) 动态规划(dp\n[problem:CodeForces-1761D] Carry bit组合数学(combinatorics) 数学(math\n[problem:CodeForces-1213F] Unstable string sort数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-780E] Underground lab构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-788B] Weird journey组合数学(combinatorics) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1039B] Subway pursuit二分搜索(binary search) 交互性问题(interactive), 概率论(probabilities\n[problem:CodeForces-1930D2] Sum over all substrings (hard version)位掩码(bitmasks) 分治算法(divide and conquer), 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1920E] Counting binary strings组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1868B2] Candy party (hard version)位掩码(bitmasks) 构造算法(constructive algorithms), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-702E] Analysis of pathes in functional graph数据结构(data structures) 图论(graphs\n[problem:CodeForces-1152D] Neko and aki\u0027s prank动态规划(dp) 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1799D2] Hot start up (hard version)数据结构(data structures) 动态规划(dp\n[problem:CodeForces-840B] Leha and another game about graph构造算法(constructive algorithms) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs\n[problem:CodeForces-1948E] Clique partition暴力枚举(brute force) 构造算法(constructive algorithms), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-985D] Sand fortress二分搜索(binary search) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-1598E] Staircases暴力枚举(brute force) 组合数学(combinatorics), 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1924B] Space harbour数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-767D] Cartons of milk二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1821E] Rearrange brackets暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-988F] Rain and umbrellas动态规划(dp \n[problem:CodeForces-414C] Mashmokh and reverse operation组合数学(combinatorics) 分治算法(divide and conquer\n[problem:CodeForces-976E] Well played!贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-1839D] Ball sorting数据结构(data structures) 动态规划(dp), 排序算法(sortings\n[problem:CodeForces-1787E] The harmonization of xor位掩码(bitmasks) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-754D] Fedor and coupons二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1201D] Treasure hunting二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-894E] Ralph and mushrooms动态规划(dp) 图论(graphs\n[problem:CodeForces-1808D] Petya Petya, Petr, And palindromes二分搜索(binary search), 暴力枚举(brute force), 数据结构(data structures), 双指针算法(two pointers\n[problem:CodeForces-1108E2] Array and segments (hard version)数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-767B] The queue暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-301B] Yaroslav and time二分搜索(binary search) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-431D] Random task二分搜索(binary search) 位掩码(bitmasks), 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-1876C] Autosynthesis构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-776E] The holmes children数学(math) 数论(number theory\n[problem:CodeForces-229D] Towers动态规划(dp) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-466E] Information graph深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-166B] Polygons计算几何(geometry) 排序算法(sortings\n[problem:CodeForces-1729G] Cut substrings组合数学(combinatorics) 动态规划(dp), 哈希表(hashing), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-348B] Apple tree深度优先搜索及其变种(dfs and similar) 数论(number theory), 树形结构(trees\n[problem:CodeForces-1266E] Spaceship solitaire数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1933F] Turtle mission: robot and the earthquake深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-340B] Maximal area quadrilateral暴力枚举(brute force) 计算几何(geometry\n[problem:CodeForces-601B] Lipshitz sequence数据结构(data structures) 数学(math\n[problem:CodeForces-1801D] The way home二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-571A] Lengthening sticks组合数学(combinatorics) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-540E] Infinite inversions二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-990E] Post lamps暴力枚举(brute force) 贪心策略(greedy\n[problem:CodeForces-850B] Arpa and a list of numbers实现问题,编程技巧,模拟(implementation) 数论(number theory\n[problem:CodeForces-799D] Field expansion暴力枚举(brute force) 动态规划(dp), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-631D] Messenger数据结构(data structures) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-103D] Time to raid cowavans暴力枚举(brute force) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-1896E] Permutation sorting数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-1056E] Check transcription暴力枚举(brute force) 数据结构(data structures), 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1023E] Down or right构造算法(constructive algorithms) 交互性问题(interactive), 矩阵(matrices\n[problem:CodeForces-912D] Fishes数据结构(data structures) 图论(graphs), 贪心策略(greedy), 概率论(probabilities), 最短路算法(shortest paths\n[problem:CodeForces-1776G] Another wine tasting event组合数学(combinatorics) 构造算法(constructive algorithms), 数学(math), 字符串处理(strings\n[problem:CodeForces-1525E] Assimilation iv组合数学(combinatorics) 动态规划(dp), 数学(math), 概率论(probabilities), 双指针算法(two pointers\n[problem:CodeForces-1413E] Solo mid oracle贪心策略(greedy) 数学(math), 三分搜索(ternary search\n[problem:CodeForces-875C] National property二分图可满足性问题(2-sat) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1811G1] Vlad and the nice paths (easy version)组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-145C] Lucky subsequence组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1120C] Compress string动态规划(dp) 字符串处理(strings\n[problem:CodeForces-1027E] Inverse coloring组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-333D] Characteristics of rectangles二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-919E] Congruence equation中国剩余定理(chinese remainder theorem) 数学(math), 数论(number theory\n[problem:CodeForces-748D] Santa claus and a palindrome构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-242D] Dispute深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1185F] Two pizzas位掩码(bitmasks) 暴力枚举(brute force\n[problem:CodeForces-549H] Degenerate matrix二分搜索(binary search) 数学(math\n[problem:CodeForces-1510D] Digits动态规划(dp) 数学(math), 数论(number theory\n[problem:CodeForces-1252K] Addition robot数据结构(data structures) 数学(math), 矩阵(matrices\n[problem:CodeForces-1183F] Topforces strikes back暴力枚举(brute force) 数学(math), 排序算法(sortings\n[problem:CodeForces-797D] Broken bst数据结构(data structures) 深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-1066F] Yet another 2d walking动态规划(dp \n[problem:CodeForces-1267K] Key storage组合数学(combinatorics) 数学(math\n[problem:CodeForces-1176F] Destroy it!动态规划(dp) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1900E] Transitive graph深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-551D] Gukiz and binary operations组合数学(combinatorics) 实现问题,编程技巧,模拟(implementation), 数学(math), 矩阵(matrices), 数论(number theory\n[problem:CodeForces-1028D] Order book组合数学(combinatorics) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1811F] Is it flower?深度优先搜索及其变种(dfs and similar) 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-590B] Chip \u0027n dale rescue rangers二分搜索(binary search) 计算几何(geometry), 数学(math\n[problem:CodeForces-960D] Full binary tree queries暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1158C] Permutation recovery构造算法(constructive algorithms) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-909D] Colorful points数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-295C] Greg and friends组合数学(combinatorics) 动态规划(dp), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-464C] Substitutes in number动态规划(dp \n[problem:CodeForces-859E] Desk disorder组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-496E] Distributing parts贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-827C] Dna evolution数据结构(data structures) 字符串处理(strings\n[problem:CodeForces-1914G1] Light bulbs (easy version)暴力枚举(brute force) 组合数学(combinatorics), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 并查集(dsu), 图论(graphs), 数学(math), 树形结构(trees\n[problem:CodeForces-489F] Special matrices组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-269C] Flawed flow构造算法(constructive algorithms) 流(flows), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1005F] Berland and the shortest paths暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-992D] Nastya and a game暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-732E] Sockets贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-703C] Chris and road计算几何(geometry) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-576B] Invariance of tree构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-793D] Presents in bankopolis动态规划(dp) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-899F] Letters removing数据结构(data structures) 字符串处理(strings\n[problem:CodeForces-165D] Beard graph数据结构(data structures) 并查集(dsu), 树形结构(trees\n[problem:CodeForces-276E] Little girl and problem on trees数据结构(data structures) 图论(graphs), 树形结构(trees\n[problem:CodeForces-520D] Cubes博弈论(games) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-811D] Vladik and favorite game构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 交互性问题(interactive\n[problem:CodeForces-231E] Cactus数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1866H] Happy sets组合数学(combinatorics \n[problem:CodeForces-995A] Tesla构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-56D] Changing a string动态规划(dp \n[problem:CodeForces-837E] Vasya\u0027s function二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-993C] Careful maneuvering位掩码(bitmasks) 暴力枚举(brute force), 计算几何(geometry\n[problem:CodeForces-439E] Devu and birthday celebration组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1032E] The unbearable lightness of weights动态规划(dp) 数学(math\n[problem:CodeForces-1866G] Grouped carriages二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 流(flows), 贪心策略(greedy\n[problem:CodeForces-1098B] Nice table暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-5D] Follow traffic rules实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-748E] Santa claus and tangerines二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-190E] Counter attack数据结构(data structures) 并查集(dsu), 图论(graphs), 哈希表(hashing), 排序算法(sortings\n[problem:CodeForces-313D] Ilya and roads动态规划(dp \n[problem:CodeForces-821E] Okabe and el psy kongroo动态规划(dp) 矩阵(matrices\n[problem:CodeForces-552E] Vanya and brackets暴力枚举(brute force) 动态规划(dp), 表达式解析(expression parsing), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-452C] Magic trick组合数学(combinatorics) 数学(math), 概率论(probabilities\n[problem:CodeForces-862E] Mahmoud and ehab and the function二分搜索(binary search) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-853C] Boredom数据结构(data structures \n[problem:CodeForces-463E] Caisa and tree暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 数学(math), 数论(number theory), 树形结构(trees\n[problem:CodeForces-587B] Duff in beach动态规划(dp \n[problem:CodeForces-282D] Yet another number game动态规划(dp) 博弈论(games\n[problem:CodeForces-1252G] Performance review数据结构(data structures \n[problem:CodeForces-266C] Below the diagonal构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-260D] Black and white tree构造算法(constructive algorithms) 并查集(dsu), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-746G] New roads构造算法(constructive algorithms) 图论(graphs), 树形结构(trees\n[problem:CodeForces-1387B1] Village (minimum) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1250C] Trip to saint petersburg数据结构(data structures \n[problem:CodeForces-286C] Main sequence贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1666J] Job lookup构造算法(constructive algorithms) 动态规划(dp), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-818F] Level generation二分搜索(binary search) 数学(math), 三分搜索(ternary search\n[problem:CodeForces-1510G] Guid \n[problem:CodeForces-111C] Petya and spiders位掩码(bitmasks) 动态规划(dp), 并查集(dsu\n[problem:CodeForces-356C] Compartments组合数学(combinatorics) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-283C] Coin troubles动态规划(dp \n[problem:CodeForces-1575L] Longest array deconstruction数据结构(data structures) 分治算法(divide and conquer), 动态规划(dp), 排序算法(sortings\n[problem:CodeForces-1163D] Mysterious code动态规划(dp) 字符串处理(strings\n[problem:CodeForces-1044C] Optimal polygon perimeter动态规划(dp) 计算几何(geometry\n[problem:CodeForces-1070E] Getting deals done二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-12E] Start of the session构造算法(constructive algorithms \n[problem:CodeForces-895D] String mark组合数学(combinatorics) 数学(math), 字符串处理(strings\n[problem:CodeForces-1146D] Frog jumping深度优先搜索及其变种(dfs and similar) 数学(math), 数论(number theory\n[problem:CodeForces-441D] Valera and swaps构造算法(constructive algorithms) 并查集(dsu), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 数学(math), 字符串后缀结构(string suffix structures\n[problem:CodeForces-630P] Area of a star计算几何(geometry \n[problem:CodeForces-1938J] There and back agai \n[problem:CodeForces-900E] Maximum questions数据结构(data structures) 动态规划(dp), 字符串处理(strings\n[problem:CodeForces-238C] World eater brothers深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-730C] Bulmart二分搜索(binary search) 深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-1599H] Hidden fortress交互性问题(interactive) 数学(math\n[problem:CodeForces-575F] Bulbo动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-77C] Beavermuncher-0xff深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-268E] Playlist数学(math) 概率论(probabilities), 排序算法(sortings\n[problem:CodeForces-954F] Runner\u0027s problem动态规划(dp) 矩阵(matrices), 排序算法(sortings\n[problem:CodeForces-615E] Hexagons二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-74C] Chessboard billiard深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 数论(number theory\n[problem:CodeForces-226D] The table构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-524D] Social network贪心策略(greedy) 双指针算法(two pointers\n[problem:CodeForces-656D] Rosetta problem \n[problem:CodeForces-1725F] Field photography位掩码(bitmasks) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-400E] Inna and binary logic二分搜索(binary search) 位掩码(bitmasks), 数据结构(data structures\n[problem:CodeForces-336D] Vasily the bear and beautiful strings组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-1184A2] Heidi learns hashing (medium)暴力枚举(brute force) 数论(number theory\n[problem:CodeForces-220C] Little elephant and shifts数据结构(data structures \n[problem:CodeForces-852D] Exploration plan二分搜索(binary search) 流(flows), 图匹配(graph matchings), 最短路算法(shortest paths\n[problem:CodeForces-644C] Hostname aliases 二分搜索(binary search), 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-362D] Fools and foolproof roads数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1184E2] Daleks\u0027 invasion (medium)深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1906F] Maximize the value数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-457C] Elections暴力枚举(brute force \n[problem:CodeForces-1912B] Blueprint for seating组合数学(combinatorics) 分治算法(divide and conquer), 数学(math\n[problem:CodeForces-217B] Blackboard fibonacci暴力枚举(brute force) 数学(math\n[problem:CodeForces-859D] Third month insanity动态规划(dp) 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-847F] Berland elections贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-106E] Space rescuers计算几何(geometry) 三分搜索(ternary search\n[problem:CodeForces-852E] Casinos and travel动态规划(dp \n[problem:CodeForces-475C] Kamal-ol-molk\u0027s painting暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-225E] Unsolvable数学(math) 数论(number theory\n[problem:CodeForces-65C] Harry potter and the golden snitch二分搜索(binary search) 计算几何(geometry\n[problem:CodeForces-542F] Quest动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-522C] Chicken or fish?贪心策略(greedy \n[problem:CodeForces-35E] Parade数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-838B] Diverging directions数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1387A] Graph 二分搜索(binary search), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 数学(math), 三分搜索(ternary search\n[problem:CodeForces-81D] Polycarp\u0027s picture gallery构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-370D] Broken monitor暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1906J] Count bfs graph组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-132D] Constants in the language of shakespeare构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-50D] Bombing二分搜索(binary search) 动态规划(dp), 概率论(probabilities\n[problem:CodeForces-802K] Send the fool further! (medium)动态规划(dp) 树形结构(trees\n[problem:CodeForces-1218I] The light square二分图可满足性问题(2-sat) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy\n[problem:CodeForces-39C] Moon craters动态规划(dp) 排序算法(sortings\n[problem:CodeForces-48E] Ivan the fool vs gorynych the dragon动态规划(dp) 博弈论(games), 图论(graphs\n[problem:CodeForces-60C] Mushroom strife暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-163C] Conveyor排序算法(sortings) 双指针算法(two pointers\n[problem:CodeForces-491B] New york hotel贪心策略(greedy) 数学(math\n[problem:CodeForces-215E] Periodical numbers组合数学(combinatorics) 动态规划(dp), 数论(number theory\n[problem:CodeForces-335C] More reclamation博弈论(games \n[problem:CodeForces-54D] Writing a song暴力枚举(brute force) 动态规划(dp), 字符串处理(strings\n[problem:CodeForces-309B] Context advertising动态规划(dp) 双指针算法(two pointers\n[problem:CodeForces-76B] Mice贪心策略(greedy) 双指针算法(two pointers\n[problem:CodeForces-690D3] The wall (hard)动态规划(dp \n[problem:CodeForces-342D] Xenia and dominoes位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 动态规划(dp\n[problem:CodeForces-215C] Crosses暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-254E] Dormitory动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-132B] Piet实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-306B] Optimizer数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-306C] White Black and white again组合数学(combinatorics), 数论(number theory\n[problem:CodeForces-802D] Marmots (easy)数学(math \n[problem:CodeForces-386D] Game with points动态规划(dp) 图论(graphs), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-852C] Property贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-228D] Zigzag数据结构(data structures \n[problem:CodeForces-212C] Cowboys组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-38F] Smart boy动态规划(dp) 博弈论(games), 字符串处理(strings\n[problem:CodeForces-926J] Segments数据结构(data structures \n[problem:CodeForces-209B] Pixels构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-774A] Amusement park 三分搜索(ternary search\n[problem:CodeForces-178D3] Magic square \n[problem:CodeForces-774B] Significant cups 二分搜索(binary search), 数据结构(data structures), 双指针算法(two pointers\n[problem:CodeForces-45H] Road problem图论(graphs \n[problem:CodeForces-1910E] Maximum sum subarrays 动态规划(dp\n[problem:CodeForces-1431F] Neural network problem 二分搜索(binary search), 贪心策略(greedy\n[problem:CodeForces-530G] Levenshtein distance \n[problem:CodeForces-207D4] The beaver\u0027s problem - \n[problem:CodeForces-1431G] Number deletion game 动态规划(dp), 博弈论(games), 贪心策略(greedy\n[problem:CodeForces-661D] Maximal difference \n[problem:CodeForces-345B] Triskaidekaphobia \n[problem:CodeForces-530H] Points in triangle 计算几何(geometry\n[problem:CodeForces-649E] Автобус二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-207C1] Game with two tree \n[problem:CodeForces-530F] Jumping frogs \n[problem:CodeForces-207D10] The beaver\u0027s problem - \n[problem:CodeForces-207D6] The beaver\u0027s problem - \n[problem:CodeForces-100H] Battleship 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-153E] Euclidean distance \n","threadId":188471,"likeCnt":1,"createTime":1711958695000,"isWorkbook":true,"viewCnt":116,"openness":2,"fav":false,"id":4793,"trustable":false}