Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-1623D\":[\"Robot Cleaner Revisit\",1363,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1623\\\"\\u003eCodeforces Round 763 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1768E\":[\"Partial Sorting\",1786,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1768\\\"\\u003eCodeforces Round 842 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-207D8\":[\"The Beaver\\u0027s Problem - 3\",81,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-213D\":[\"Stars\",354,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/213\\\"\\u003eCodeforces Round 131 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-358E\":[\"Dima and Kicks\",407,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/358\\\"\\u003eCodeforces Round 208 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-715B\":[\"Complete The Graph\",2983,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/715\\\"\\u003eCodeforces Round 372 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-316C2\":[\"Tidying Up\",652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-629E\":[\"Famil Door and Roads\",1034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/629\\\"\\u003eCodeforces Round 343 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1093G\":[\"Multidimensional Queries\",1899,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1093\\\"\\u003eEducational Codeforces Round 56 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1691E\":[\"Number of Groups\",1775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1691\\\"\\u003eCodeCraft-22 and Codeforces Round 795 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1190C\":[\"Tokitsukaze and Duel\",1834,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1190\\\"\\u003eCodeforces Round 573 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-467E\":[\"Alex and Complicated Task\",792,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/467\\\"\\u003eCodeforces Round 267 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-891C\":[\"Envy\",2415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/891\\\"\\u003eCodeforces Round 446 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-44I\":[\"Toys\",193,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/44\\\"\\u003eSchool Team Contest 2 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-160D\":[\"Edges in MST\",2691,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/160\\\"\\u003eCodeforces Round 111 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1203F2\":[\"Complete the Projects (hard version)\",2771,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1203\\\"\\u003eCodeforces Round 579 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1404C\":[\"Fixed Point Removal\",2515,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1404\\\"\\u003eCodeforces Round 668 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1513E\":[\"Cost Equilibrium\",1417,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1513\\\"\\u003eDivide by Zero 2021 and Codeforces Round 714 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-212B\":[\"Polycarpus is Looking for Good Substrings\",331,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/212\\\"\\u003eVK Cup 2012 Finals (unofficial online-version)\\u003c/a\\u003e\"],\"CodeForces-1254C\":[\"Point Ordering\",1298,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1254\\\"\\u003eCodeforces Round 601 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1399F\":[\"Yet Another Segments Subset\",1585,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1399\\\"\\u003eCodeforces Round 661 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-248D\":[\"Sweets for Everyone!\",509,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/248\\\"\\u003eCodeforces Round 152 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1610E\":[\"AmShZ and G.O.A.T.\",1639,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1610\\\"\\u003eCodeforces Global Round 17\\u003c/a\\u003e\"],\"CodeForces-1743F\":[\"Intersection and Union\",1437,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1743\\\"\\u003eEducational Codeforces Round 137 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1864F\":[\"Exotic Queries\",1335,\"\\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-628E\":[\"Zbazi in Zeydabad\",882,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/628\\\"\\u003eEducational Codeforces Round 8\\u003c/a\\u003e\"],\"CodeForces-846E\":[\"Chemistry in Berland\",901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"CodeForces-858F\":[\"Wizard\\u0027s Tour\",1530,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/858\\\"\\u003eТехнокубок 2018 - Отборочный Раунд 1\\u003c/a\\u003e\"],\"CodeForces-713C\":[\"Sonya and Problem Wihtout a Legend\",5208,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/713\\\"\\u003eCodeforces Round 371 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-793C\":[\"Mice problem\",1312,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/793\\\"\\u003eTinkoff Challenge - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-660E\":[\"Different Subsets For All Tuples\",1277,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/660\\\"\\u003eEducational Codeforces Round 11\\u003c/a\\u003e\"],\"CodeForces-1658D2\":[\"388535 (Hard Version)\",2555,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1658\\\"\\u003eCodeforces Round 779 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1403B\":[\"Spring cleaning\",363,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1403\\\"\\u003eCentral-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated)\\u003c/a\\u003e\"],\"CodeForces-78E\":[\"Evacuation\",629,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/78\\\"\\u003eCodeforces Beta Round 70 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1766E\":[\"Decomposition\",1128,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1766\\\"\\u003eEducational Codeforces Round 139 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-42D\":[\"Strange town\",404,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/42\\\"\\u003eCodeforces Beta Round 41\\u003c/a\\u003e\"],\"CodeForces-1536E\":[\"Omkar and Forest\",2374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1536\\\"\\u003eCodeforces Round 724 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-78D\":[\"Archer\\u0027s Shot\",385,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/78\\\"\\u003eCodeforces Beta Round 70 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1916E\":[\"Happy Life in University\",2097,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1916\\\"\\u003eGood Bye 2023\\u003c/a\\u003e\"],\"CodeForces-1495C\":[\"Garden of the Sun\",2543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1495\\\"\\u003eCodeforces Round 706 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-126D\":[\"Fibonacci Sums\",871,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/126\\\"\\u003eCodeforces Beta Round 93 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1592D\":[\"Hemose in ICPC ?\",2202,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1592\\\"\\u003eCodeforces Round 746 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1621E\":[\"New School\",1734,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1621\\\"\\u003eHello 2022\\u003c/a\\u003e\"],\"CodeForces-1132E\":[\"Knapsack\",1530,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1132\\\"\\u003eEducational Codeforces Round 61 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1132D\":[\"Stressful Training\",1967,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1132\\\"\\u003eEducational Codeforces Round 61 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1156F\":[\"Card Bag\",1430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-518F\":[\"Pasha and Pipe\",367,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/518\\\"\\u003eCodeforces Round 293 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-748F\":[\"Santa Clauses and a Soccer Championship\",661,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/748\\\"\\u003eTechnocup 2017 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1712E1\":[\"LCM Sum (easy version)\",2039,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1712\\\"\\u003eCodeforces Round 813 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-598C\":[\"Nearest vectors\",4430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/598\\\"\\u003eEducational Codeforces Round 1\\u003c/a\\u003e\"],\"CodeForces-845G\":[\"Shortest Path Problem?\",1577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"CodeForces-489E\":[\"Hiking\",1140,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/489\\\"\\u003eCodeforces Round 277.5 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1251E1\":[\"Voting (Easy Version)\",2206,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1251\\\"\\u003eEducational Codeforces Round 75 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1929F\":[\"Sasha and the Wedding Binary Search Tree\",1627,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1929\\\"\\u003eCodeforces Round 926 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1917D\":[\"Yet Another Inversions Problem\",1649,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1917\\\"\\u003eCodeforces Round 917 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1929E\":[\"Sasha and the Happy Tree Cutting\",1499,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1929\\\"\\u003eCodeforces Round 926 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1874C\":[\"Jellyfish and EVA\",1497,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1874\\\"\\u003eCodeforces Round 901 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-43E\":[\"Race\",397,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/43\\\"\\u003eCodeforces Beta Round 42 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-101D\":[\"Castle\",734,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/101\\\"\\u003eCodeforces Beta Round 79 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1927G\":[\"Paint Charges\",1493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1927\\\"\\u003eCodeforces Round 923 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1276C\":[\"Beautiful Rectangle\",1521,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1276\\\"\\u003eCodeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-149E\":[\"Martian Strings\",2233,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1494D\":[\"Dogeforces\",2537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1494\\\"\\u003eEducational Codeforces Round 105 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1385F\":[\"Removing Leaves\",2343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1385\\\"\\u003eCodeforces Round 656 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1131E\":[\"String Multiplication\",1187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1131\\\"\\u003eCodeforces Round 541 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1167F\":[\"Scalar Queries\",1493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1167\\\"\\u003eEducational Codeforces Round 65 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1252B\":[\"Cleaning Robots\",534,\"\\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-856B\":[\"Similar Words\",501,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/856\\\"\\u003eRussian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]\\u003c/a\\u003e\"],\"CodeForces-1769D3\":[\"Игра в Девятку III\",114,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1769\\\"\\u003eVK Cup 2022 - Квалификация (Engine)\\u003c/a\\u003e\"],\"CodeForces-1046I\":[\"Say Hello\",318,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1046\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 2]\\u003c/a\\u003e\"],\"CodeForces-1385G\":[\"Columns Swaps\",1346,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1385\\\"\\u003eCodeforces Round 656 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1090E\":[\"Horseback Riding\",577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1090\\\"\\u003e2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1252L\":[\"Road Construction\",599,\"\\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-711E\":[\"ZS and The Birthday Paradox\",1319,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/711\\\"\\u003eCodeforces Round 369 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-723F\":[\"st-Spanning Tree\",1535,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/723\\\"\\u003eCodeforces Round 375 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1252J\":[\"Tiling Terrace\",730,\"\\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-1928E\":[\"Modular Sequence\",1514,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1928\\\"\\u003eCodeforces Round 924 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-573C\":[\"Bear and Drawing\",1003,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/573\\\"\\u003eCodeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-585D\":[\"Lizard Era: Beginning\",1755,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/585\\\"\\u003eCodeforces Round 325 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-670F\":[\"Restore a Number\",875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/670\\\"\\u003eCodeforces Round 350 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-36D\":[\"New Game with a Chess Piece\",694,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/36\\\"\\u003eCodeforces Beta Round 36\\u003c/a\\u003e\"],\"CodeForces-1748E\":[\"Yet Another Array Counting Problem\",1764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1748\\\"\\u003eCodeforces Round 833 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-24E\":[\"Berland collider\",941,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/24\\\"\\u003eCodeforces Beta Round 24\\u003c/a\\u003e\"],\"CodeForces-1603C\":[\"Extreme Extension\",1996,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1603\\\"\\u003eCodeforces Round 752 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1453E\":[\"Dog Snacks\",2016,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1453\\\"\\u003eCodeforces Round 688 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1550D\":[\"Excellent Arrays\",1809,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1550\\\"\\u003eEducational Codeforces Round 111 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-949D\":[\"Curfew\",835,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/949\\\"\\u003eCodeforces Round 469 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1211F\":[\"kotlinkotlinkotlinkotlin...\",119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1211\\\"\\u003eKotlin Heroes: Episode 2\\u003c/a\\u003e\"],\"CodeForces-1182E\":[\"Product Oriented Recurrence\",2791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1182\\\"\\u003eCodeforces Round 566 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1073E\":[\"Segment Sum\",2563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1073\\\"\\u003eEducational Codeforces Round 53 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1085E\":[\"Vasya and Templates\",874,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1085\\\"\\u003eTechnocup 2019 - Elimination Round 4\\u003c/a\\u003e\"],\"CodeForces-786B\":[\"Legacy\",5892,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-803G\":[\"Periodic RMQ Problem\",1341,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-677D\":[\"Vanya and Treasure\",1668,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/677\\\"\\u003eCodeforces Round 355 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1780F\":[\"Three Chairs\",1393,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1780\\\"\\u003eCodeforces Round 846 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-677E\":[\"Vanya and Balloons\",611,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/677\\\"\\u003eCodeforces Round 355 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-762D\":[\"Maximum path\",1398,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"CodeForces-774E\":[\"Big Number and Remainder\",207,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/774\\\"\\u003eVK Cup 2017 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-895E\":[\"Eyes Closed\",976,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-883C\":[\"Downloading B++\",638,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/883\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-641G\":[\"Little Artem and Graph\",88,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/641\\\"\\u003eVK Cup 2016 - Round 2\\u003c/a\\u003e\"],\"CodeForces-774I\":[\"Composing Of String\",99,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/774\\\"\\u003eVK Cup 2017 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-491C\":[\"Deciphering\",417,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/491\\\"\\u003eTesting Round 11\\u003c/a\\u003e\"],\"CodeForces-37D\":[\"Lesson Timetable\",441,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/37\\\"\\u003eCodeforces Beta Round 37\\u003c/a\\u003e\"],\"CodeForces-49E\":[\"Common ancestor\",733,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/49\\\"\\u003eCodeforces Beta Round 46 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-313E\":[\"Ilya and Two Numbers\",592,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/313\\\"\\u003eCodeforces Round 186 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1408F\":[\"Two Different\",2323,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1408\\\"\\u003eGrakn Forces 2020\\u003c/a\\u003e\"],\"CodeForces-1371E2\":[\"Asterism (Hard Version)\",2312,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1371\\\"\\u003eCodeforces Round 654 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1004D\":[\"Sonya and Matrix\",1495,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1004\\\"\\u003eCodeforces Round 495 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-718C\":[\"Sasha and Array\",3771,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/718\\\"\\u003eCodeforces Round 373 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1379D\":[\"New Passenger Trams\",1067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1379\\\"\\u003eCodeforces Round 657 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-936C\":[\"Lock Puzzle\",1207,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/936\\\"\\u003eCodeforces Round 467 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1101G\":[\"(Zero XOR Subset)-less\",1802,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1101\\\"\\u003eEducational Codeforces Round 58 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1476E\":[\"Pattern Matching\",2285,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1476\\\"\\u003eEducational Codeforces Round 103 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1488F\":[\"Dogecoin\",168,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1488\\\"\\u003eKotlin Heroes: Episode 6\\u003c/a\\u003e\"],\"CodeForces-935E\":[\"Fafa and Ancient Mathematics\",925,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/935\\\"\\u003eCodeforces Round 465 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-838E\":[\"Convex Countour\",349,\"\\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-1096F\":[\"Inversion Expectation\",1602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1096\\\"\\u003eEducational Codeforces Round 57 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-316F2\":[\"Suns and Rays\",139,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-1914G2\":[\"Light Bulbs (Hard Version)\",1221,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1914\\\"\\u003eCodeforces Round 916 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-802I\":[\"Fake News (hard)\",1492,\"\\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-543D\":[\"Road Improvement\",2689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/543\\\"\\u003eCodeforces Round 302 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-785D\":[\"Anton and School - 2\",2928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/785\\\"\\u003eCodeforces Round 404 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-652E\":[\"Pursuit For Artifacts\",2107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/652\\\"\\u003eEducational Codeforces Round 10\\u003c/a\\u003e\"],\"CodeForces-870E\":[\"Points, Lines and Ready-made Titles\",989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/870\\\"\\u003eTechnocup 2018 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-22E\":[\"Scheme\",1745,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/22\\\"\\u003eCodeforces Beta Round 22 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1601C\":[\"Optimal Insertion\",1940,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1601\\\"\\u003eCodeforces Round 751 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-46F\":[\"Hercule Poirot Problem\",334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/46\\\"\\u003eSchool Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1625D\":[\"Binary Spiders\",2002,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1625\\\"\\u003eCodeforces Round 765 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1528C\":[\"Trees of Tranquillity\",2586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1528\\\"\\u003eCodeforces Round 722 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-300E\":[\"Empire Strikes Back\",1096,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/300\\\"\\u003eCodeforces Round 181 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-300D\":[\"Painting Square\",870,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/300\\\"\\u003eCodeforces Round 181 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1039A\":[\"Timetable\",782,\"\\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-203E\":[\"Transportation\",290,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/203\\\"\\u003eCodeforces Round 128 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1245E\":[\"Hyakugoku and Ladders\",1144,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1245\\\"\\u003eCodeforces Round 597 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1584E\":[\"Game with Stones\",1223,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1584\\\"\\u003eTechnocup 2022 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1015F\":[\"Bracket Substring\",1148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1015\\\"\\u003eCodeforces Round 501 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1342E\":[\"Placing Rooks\",2945,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1342\\\"\\u003eEducational Codeforces Round 86 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1693C\":[\"Keshi in Search of AmShZ\",2484,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1693\\\"\\u003eCodeforces Round 800 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1148E\":[\"Earth Wind and Fire\",1715,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1148\\\"\\u003eCodeforces Global Round 3\\u003c/a\\u003e\"],\"CodeForces-1548D1\":[\"Gregor and the Odd Cows (Easy)\",1441,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1548\\\"\\u003eCodeforces Round 736 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1245F\":[\"Daniel and Spring Cleaning\",1812,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1245\\\"\\u003eCodeforces Round 597 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-316E3\":[\"Summer Homework\",567,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-316E2\":[\"Summer Homework\",391,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-825E\":[\"Minimal Labels\",3317,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-566A\":[\"Matching Names\",944,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/566\\\"\\u003eVK Cup 2015 - Finals, online mirror\\u003c/a\\u003e\"],\"CodeForces-1790G\":[\"Tokens on Graph\",1053,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1790\\\"\\u003eCodeforces Round 847 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1681F\":[\"Unique Occurrences\",1553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1681\\\"\\u003eEducational Codeforces Round 129 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-772C\":[\"Vulnerable Kerbals\",1211,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/772\\\"\\u003eVK Cup 2017 - Round 2\\u003c/a\\u003e\"],\"CodeForces-675E\":[\"Trains and Statistic\",2801,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/675\\\"\\u003eCodeforces Round 353 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-893F\":[\"Subtree Minimum Query\",1756,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1878G\":[\"wxhtzdy ORO Tree\",1104,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1878\\\"\\u003eCodeforces Round 900 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1866D\":[\"Digital Wallet\",1196,\"\\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-311E\":[\"Biologist\",1106,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/311\\\"\\u003eCodeforces Round 185 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-432E\":[\"Square Tiling\",717,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/432\\\"\\u003eCodeforces Round 246 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1843F2\":[\"Omsk Metro (hard version)\",1502,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1843\\\"\\u003eCodeforces Round 881 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-444B\":[\"DZY Loves FFT\",1073,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/444\\\"\\u003eCodeforces Round 254 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1268C\":[\"K Integers\",1692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1268\\\"\\u003eCodeforces Round 609 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1600F\":[\"Party Organization\",436,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1600\\\"\\u003eBubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1866I\":[\"Imagination Castle\",671,\"\\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-1244F\":[\"Chips\",1418,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1244\\\"\\u003eCodeforces Round 592 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1842E\":[\"Tenzing and Triangle\",1558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1842\\\"\\u003eCodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-509F\":[\"Progress Monitoring\",915,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/509\\\"\\u003eCodeforces Round 289 (Div. 2, ACM ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-727E\":[\"Games on a CD\",1274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/727\\\"\\u003eTechnocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-316D2\":[\"PE Lesson\",426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-316D1\":[\"PE Lesson\",532,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-727F\":[\"Polycarp\\u0027s problems\",809,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/727\\\"\\u003eTechnocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1070G\":[\"Monsters and Potions\",846,\"\\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-1695D2\":[\"Tree Queries (Hard Version)\",1946,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1695\\\"\\u003eCodeforces Round 801 (Div. 2) and EPIC Institute of Technology Round\\u003c/a\\u003e\"],\"CodeForces-812E\":[\"Sagheer and Apple Tree\",1109,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/812\\\"\\u003eCodeforces Round 417 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-553D\":[\"Nudist Beach\",1019,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/553\\\"\\u003eCodeforces Round 309 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1070J\":[\"Streets and Avenues in Berhattan\",701,\"\\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-91C\":[\"Ski Base\",890,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/91\\\"\\u003eCodeforces Beta Round 75 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-294E\":[\"Shaass the Great\",1022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/294\\\"\\u003eCodeforces Round 178 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-241F\":[\"Race\",264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/241\\\"\\u003eBayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)\\u003c/a\\u003e\"],\"CodeForces-362E\":[\"Petya and Pipes\",897,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/362\\\"\\u003eCodeforces Round 212 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1699D\":[\"Almost Triple Deletions\",3078,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1699\\\"\\u003eCodeforces Round 804 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1009F\":[\"Dominant Indices\",5517,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1009\\\"\\u003eEducational Codeforces Round 47 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-277B\":[\"Set of Points\",825,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/277\\\"\\u003eCodeforces Round 170 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1239C\":[\"Queue in the Train\",1323,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1239\\\"\\u003eCodeforces Round 594 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1607F\":[\"Robot on the Board 2\",1907,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1607\\\"\\u003eCodeforces Round 753 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1728E\":[\"Red-Black Pepper\",1659,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1728\\\"\\u003eEducational Codeforces Round 135 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1849E\":[\"Max to the Right of Min\",1510,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1849\\\"\\u003eEducational Codeforces Round 152 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1675G\":[\"Sorting Pancakes\",1656,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1675\\\"\\u003eCodeforces Round 787 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1919F1\":[\"Wine Factory (Easy Version)\",2040,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1919\\\"\\u003eHello 2024\\u003c/a\\u003e\"],\"CodeForces-403D\":[\"Beautiful Pairs of Numbers\",1197,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/403\\\"\\u003eCodeforces Round 236 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-306D\":[\"Polygon\",276,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/306\\\"\\u003eTesting Round 6\\u003c/a\\u003e\"],\"CodeForces-808E\":[\"Selling Souvenirs\",1922,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"CodeForces-1065E\":[\"Side Transmutations\",1055,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1065\\\"\\u003eEducational Codeforces Round 52 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1172C1\":[\"Nauuo and Pictures (easy version)\",994,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1172\\\"\\u003eCodeforces Round 564 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-178E3\":[\"The Beaver\\u0027s Problem - 2\",204,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-808G\":[\"Anthem of Berland\",2720,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"CodeForces-1198D\":[\"Rectangle Painting 1\",3188,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1198\\\"\\u003eCodeforces Round 576 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1380E\":[\"Merging Towers\",1976,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1380\\\"\\u003eEducational Codeforces Round 91 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-500E\":[\"New Year Domino\",1518,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/500\\\"\\u003eGood Bye 2014\\u003c/a\\u003e\"],\"CodeForces-960E\":[\"Alternating Tree\",1962,\"\\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-72D\":[\"Perse-script\",72,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/72\\\"\\u003eUnknown Language Round 2\\u003c/a\\u003e\"],\"CodeForces-1933G\":[\"Turtle Magic: Royal Turtle Shell Pattern\",856,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1933\\\"\\u003eCodeforces Round 929 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-470F\":[\"Pairwise Sums\",95,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/470\\\"\\u003eSurprise Language Round 7\\u003c/a\\u003e\"],\"CodeForces-85D\":[\"Sum of Medians\",2315,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/85\\\"\\u003eYandex.Algorithm 2011: Round 1\\u003c/a\\u003e\"],\"CodeForces-97B\":[\"Superset\",1034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/97\\\"\\u003eYandex.Algorithm 2011: Finals\\u003c/a\\u003e\"],\"CodeForces-385E\":[\"Bear in the Field\",765,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/385\\\"\\u003eCodeforces Round 226 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-470G\":[\"Hamming Distance\",90,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/470\\\"\\u003eSurprise Language Round 7\\u003c/a\\u003e\"],\"CodeForces-470H\":[\"Array Sorting\",183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/470\\\"\\u003eSurprise Language Round 7\\u003c/a\\u003e\"],\"CodeForces-167C\":[\"Wizards and Numbers\",716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/167\\\"\\u003eCodeforces Round 114 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1553F\":[\"Pairwise Modulo\",2142,\"\\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-305E\":[\"Playing with String\",631,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/305\\\"\\u003eCodeforces Round 184 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-414D\":[\"Mashmokh and Water Tanks\",692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/414\\\"\\u003eCodeforces Round 240 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1783E\":[\"Game of the Year\",2035,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1783\\\"\\u003eEducational Codeforces Round 141 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-317D\":[\"Game with Powers\",1107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/317\\\"\\u003eCodeforces Round 188 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-438D\":[\"The Child and Sequence\",9316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/438\\\"\\u003eCodeforces Round 250 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1197E\":[\"Culture Code\",1485,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1197\\\"\\u003eEducational Codeforces Round 69 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1698E\":[\"PermutationForces II\",1577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1698\\\"\\u003eCodeforces Round 803 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-915G\":[\"Coprime Arrays\",1174,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1270E\":[\"Divide Points\",2313,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1270\\\"\\u003eGood Bye 2019\\u003c/a\\u003e\"],\"CodeForces-915E\":[\"Physical Education Lessons\",4334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1282D\":[\"Enchanted Artifact\",2127,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1282\\\"\\u003eCodeforces Round 610 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-547C\":[\"Mike and Foam\",2866,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/547\\\"\\u003eCodeforces Round 305 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-995C\":[\"Leaving the Bar\",1747,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/995\\\"\\u003eCodeforces Round 492 (Div. 1) [Thanks, uDebug!]\\u003c/a\\u003e\"],\"CodeForces-1468M\":[\"Similar Sets\",932,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1468\\\"\\u003e2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-898F\":[\"Restoring the Expression\",1349,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-590D\":[\"Top Secret Task\",1269,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/590\\\"\\u003eCodeforces Round 327 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-142C\":[\"Help Caretaker\",943,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/142\\\"\\u003eCodeforces Round 102 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1738E\":[\"Balance Addicts\",1458,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1738\\\"\\u003eCodeforces Global Round 22\\u003c/a\\u003e\"],\"CodeForces-154C\":[\"Double Profiles\",2843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/154\\\"\\u003eCodeforces Round 109 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-38G\":[\"Queue\",736,\"\\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-1552E\":[\"Colors and Intervals\",1778,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1552\\\"\\u003eCodeforces Global Round 15\\u003c/a\\u003e\"],\"CodeForces-425D\":[\"Sereja and Squares\",1591,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/425\\\"\\u003eCodeforces Round 243 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-425C\":[\"Sereja and Two Sequences\",938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/425\\\"\\u003eCodeforces Round 243 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1322C\":[\"Instant Noodles\",2091,\"\\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-1310D\":[\"Tourism\",1342,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1310\\\"\\u003eVK Cup 2019-2020 - Elimination Round (Engine)\\u003c/a\\u003e\"],\"CodeForces-1346G\":[\"Two IP Cameras\",130,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1346\\\"\\u003eKotlin Heroes: Episode 4\\u003c/a\\u003e\"],\"CodeForces-1540B\":[\"Tree Array\",2572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1540\\\"\\u003eCodeforces Round 728 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1932G\":[\"Moving Platforms\",866,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1932\\\"\\u003eCodeforces Round 927 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-817F\":[\"MEX Queries\",2587,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"CodeForces-558D\":[\"Guess Your Way Out! II\",1169,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/558\\\"\\u003eCodeforces Round 312 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-558E\":[\"A Simple Task\",6145,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/558\\\"\\u003eCodeforces Round 312 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-788C\":[\"The Great Mixing\",2297,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/788\\\"\\u003eCodeforces Round 407 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-873E\":[\"Awards For Contestants\",527,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/873\\\"\\u003eEducational Codeforces Round 30\\u003c/a\\u003e\"],\"CodeForces-510E\":[\"Fox And Dinner\",2296,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/510\\\"\\u003eCodeforces Round 290 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-130I\":[\"Array sorting\",164,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/130\\\"\\u003eUnknown Language Round 4\\u003c/a\\u003e\"],\"CodeForces-141D\":[\"Take-off Ramps\",945,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/141\\\"\\u003eCodeforces Round 101 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-141E\":[\"Clearing Up\",914,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/141\\\"\\u003eCodeforces Round 101 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-383D\":[\"Antimatter\",3164,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/383\\\"\\u003eCodeforces Round 225 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1834E\":[\"MEX of LCM\",2108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1834\\\"\\u003eCodeforces Round 879 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1943C\":[\"Tree Compass\",1737,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1943\\\"\\u003eCodeforces Round 934 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1139D\":[\"Steps to One\",2090,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1139\\\"\\u003eCodeforces Round 548 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1628C\":[\"Grid Xor\",3140,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1628\\\"\\u003eCodeforces Round 767 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1781E\":[\"Rectangle Shrinking\",1269,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1781\\\"\\u003eVK Cup 2022 - Отборочный раунд (Engine)\\u003c/a\\u003e\"],\"CodeForces-424D\":[\"Biathlon Track\",588,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/424\\\"\\u003eCodeforces Round 242 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-327E\":[\"Axis Walking\",1473,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/327\\\"\\u003eCodeforces Round 191 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1575I\":[\"Illusions of the Desert\",871,\"\\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-1236D\":[\"Alice and the Doll\",1738,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1236\\\"\\u003eCodeforces Round 593 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1304F1\":[\"Animal Observation (easy version)\",1563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1304\\\"\\u003eCodeforces Round 620 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-708C\":[\"Centroids\",3172,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/708\\\"\\u003eAIM Tech Round 3 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-938E\":[\"Max History\",1332,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/938\\\"\\u003eEducational Codeforces Round 38 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1575B\":[\"Building an Amusement Park\",456,\"\\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-1200F\":[\"Graph Traveler\",943,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1200\\\"\\u003eCodeforces Round 578 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1450C2\":[\"Errich-Tac-Toe (Hard Version)\",3748,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1450\\\"\\u003eCodeforces Global Round 12\\u003c/a\\u003e\"],\"CodeForces-1062E\":[\"Company\",1798,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1062\\\"\\u003eCodeforces Round 520 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1451E2\":[\"Bitwise Queries (Hard Version)\",2913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1451\\\"\\u003eCodeforces Round 685 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1292C\":[\"Xenon\\u0027s Attack on the Gangs\",1890,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1292\\\"\\u003eCodeforces Round 614 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-901C\":[\"Bipartite Segments\",1192,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/901\\\"\\u003eCodeforces Round 453 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-557E\":[\"Ann and Half-Palindrome\",1113,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/557\\\"\\u003eCodeforces Round 311 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-993E\":[\"Nikita and Order Statistics\",1459,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/993\\\"\\u003eCodeforces Round 488 by NEAR (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-884D\":[\"Boxes And Balls\",2075,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/884\\\"\\u003eEducational Codeforces Round 31\\u003c/a\\u003e\"],\"CodeForces-1824B2\":[\"LuoTianyi and the Floating Islands (Hard Version)\",2485,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1824\\\"\\u003eCodeforces Round 872 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-76F\":[\"Tourist\",661,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/76\\\"\\u003eAll-Ukrainian School Olympiad in Informatics\\u003c/a\\u003e\"],\"CodeForces-40C\":[\"Berland Square\",268,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/40\\\"\\u003eCodeforces Beta Round 39\\u003c/a\\u003e\"],\"CodeForces-451E\":[\"Devu and Flowers\",3908,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/451\\\"\\u003eCodeforces Round 258 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1316E\":[\"Team Building\",3632,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1316\\\"\\u003eCodeCraft-20 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1425D\":[\"Danger of Mad Snakes\",872,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1425\\\"\\u003e2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1938G\":[\"Personality Test\",872,\"\\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-1805E\":[\"There Should Be a Lot of Maximums\",1561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1805\\\"\\u003eCodeforces Round 862 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1396C\":[\"Monster Invaders\",2444,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1396\\\"\\u003eCodeforces Round 666 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1045C\":[\"Hyperspace Highways\",636,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1045\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-690A2\":[\"Collective Mindsets (medium)\",708,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/690\\\"\\u003eHelvetic Coding Contest 2016 online mirror (teams, unrated)\\u003c/a\\u003e\"],\"CodeForces-1534E\":[\"Lost Array\",1857,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1534\\\"\\u003eCodeforces LATOKEN Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1861E\":[\"Non-Intersecting Subpermutations\",1631,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1861\\\"\\u003eEducational Codeforces Round 154 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-9E\":[\"Interestring graph and Apples\",1062,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/9\\\"\\u003eCodeforces Beta Round 9 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-601C\":[\"Kleofáš and the n-thlon\",1418,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/601\\\"\\u003eCodeforces Round 333 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-487C\":[\"Prefix Product Sequence\",2665,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/487\\\"\\u003eCodeforces Round 278 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-596D\":[\"Wilbur and Trees\",706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/596\\\"\\u003eCodeforces Round 331 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-584E\":[\"Anton and Ira\",1467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/584\\\"\\u003eCodeforces Round 324 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-180B\":[\"Divisibility Rules\",349,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/180\\\"\\u003eCodeforces Round 116 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-64H\":[\"Table Bowling\",110,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/64\\\"\\u003eUnknown Language Round 1\\u003c/a\\u003e\"],\"CodeForces-77D\":[\"Domino Carpet\",321,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/77\\\"\\u003eCodeforces Beta Round 69 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1799E\":[\"City Union\",1172,\"\\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-177F2\":[\"Script Generation\",200,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/177\\\"\\u003eABBYY Cup 2.0 - Easy\\u003c/a\\u003e\"],\"CodeForces-89B\":[\"Widget Library\",535,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/89\\\"\\u003eCodeforces Beta Round 74 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-123D\":[\"String\",1336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/123\\\"\\u003eCodeforces Beta Round 92 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-111D\":[\"Petya and Coloring\",811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/111\\\"\\u003eCodeforces Beta Round 85 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-89C\":[\"Chip Play\",678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/89\\\"\\u003eCodeforces Beta Round 74 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-123C\":[\"Brackets\",622,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/123\\\"\\u003eCodeforces Beta Round 92 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-268D\":[\"Wall Bars\",584,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/268\\\"\\u003eCodeforces Round 164 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1654E\":[\"Arithmetic Operations\",2009,\"\\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-878B\":[\"Teams Formation\",1050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/878\\\"\\u003eCodeforces Round 443 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1250G\":[\"Discarding Game\",778,\"\\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-1250E\":[\"The Coronation\",890,\"\\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-648E\":[\"Собери число\",83,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/648\\\"\\u003eТехнокубок 2016 - Отборочный Раунд 1\\u003c/a\\u003e\"],\"CodeForces-515E\":[\"Drazil and Park\",2183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/515\\\"\\u003eCodeforces Round 292 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-600E\":[\"Lomsat gelral\",14322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/600\\\"\\u003eEducational Codeforces Round 2\\u003c/a\\u003e\"],\"CodeForces-830C\":[\"Bamboo Partition\",1261,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/830\\\"\\u003eCodeforces Round 424 (Div. 1, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-1614D2\":[\"Divan and Kostomuksha (hard version)\",2222,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1614\\\"\\u003eCodeforces Round 757 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1594E2\":[\"Rubik\\u0027s Cube Coloring (hard version)\",1461,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1594\\\"\\u003eCodeforces Round 747 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-62C\":[\"Inquisition\",260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/62\\\"\\u003eCodeforces Beta Round 58\\u003c/a\\u003e\"],\"CodeForces-364C\":[\"Beautiful Set\",607,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/364\\\"\\u003eCodeforces Round 213 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1217E\":[\"Sum Queries?\",1696,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1217\\\"\\u003eEducational Codeforces Round 72 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1706E\":[\"Qpwoeirut and Vertices\",2470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1706\\\"\\u003eCodeforces Round 809 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1188B\":[\"Count Pairs\",4437,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1188\\\"\\u003eCodeforces Round 572 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1394B\":[\"Boboniu Walks on Graph\",1815,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1394\\\"\\u003eCodeforces Round 664 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-405E\":[\"Graph Cutting\",1383,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/405\\\"\\u003eCodeforces Round 238 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1285E\":[\"Delete a Segment\",1722,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1285\\\"\\u003eCodeforces Round 613 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1895E\":[\"Infinite Card Game\",1455,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1895\\\"\\u003eEducational Codeforces Round 157 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1411E\":[\"Poman Numbers\",1563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1411\\\"\\u003eTechnocup 2021 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1798E\":[\"Multitest Generator\",1503,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1798\\\"\\u003eCodeforces Round 860 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1912J\":[\"Joy of Pokémon Observation\",512,\"\\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-429C\":[\"Guess the Tree\",953,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/429\\\"\\u003eCodeforces Round 245 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-623B\":[\"Array GCD\",2175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/623\\\"\\u003eAIM Tech Round (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-768F\":[\"Barrels and boxes\",1054,\"\\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-659G\":[\"Fence Divercity\",1019,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/659\\\"\\u003eCodeforces Round 346 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-877F\":[\"Ann and Books\",1737,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-594A\":[\"Warrior and Archer\",1894,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/594\\\"\\u003eCodeforces Round 330 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-732F\":[\"Tourist Reform\",2396,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/732\\\"\\u003eCodeforces Round 377 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-594C\":[\"Edo and Magnets\",722,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/594\\\"\\u003eCodeforces Round 330 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-62D\":[\"Wormhouse\",390,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/62\\\"\\u003eCodeforces Beta Round 58\\u003c/a\\u003e\"],\"CodeForces-50E\":[\"Square Equation Roots\",400,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/50\\\"\\u003eCodeforces Beta Round 47\\u003c/a\\u003e\"],\"CodeForces-570E\":[\"Pig and Palindromes\",1977,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/570\\\"\\u003eCodeforces Round 316 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-87D\":[\"Beautiful Road\",920,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/87\\\"\\u003eCodeforces Beta Round 73 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-460D\":[\"Little Victor and Set\",1024,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/460\\\"\\u003eCodeforces Round 262 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-254D\":[\"Rats\",535,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/254\\\"\\u003eCodeforces Round 155 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1705E\":[\"Mark and Professor Koro\",2008,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1705\\\"\\u003eCodeforces Round 807 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1228E\":[\"Another Filling the Grid\",2691,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1228\\\"\\u003eCodeforces Round 589 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1814E\":[\"Chain Chips\",1284,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1814\\\"\\u003eEducational Codeforces Round 146 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1204E\":[\"Natasha, Sasha and the Prefix Sums\",1734,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1204\\\"\\u003eCodeforces Round 581 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1870E\":[\"Another MEX Problem\",2217,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1870\\\"\\u003eCodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1422D\":[\"Returning Home\",2684,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1422\\\"\\u003eCodeforces Round 675 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1797E\":[\"Li Hua and Array\",1215,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1797\\\"\\u003eCodeforces Round 864 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-549B\":[\"Looksery Party\",1590,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/549\\\"\\u003eLooksery Cup 2015\\u003c/a\\u003e\"],\"CodeForces-1151F\":[\"Sonya and Informatics\",1220,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1151\\\"\\u003eCodeforces Round 553 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1042E\":[\"Vasya and Magic Matrix\",1744,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1042\\\"\\u003eCodeforces Round 510 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-888G\":[\"Xor-MST\",4387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-610D\":[\"Vika and Segments\",1514,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/610\\\"\\u003eCodeforces Round 337 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-985F\":[\"Isomorphic Strings\",1933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/985\\\"\\u003eEducational Codeforces Round 44 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-852I\":[\"Dating\",589,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/852\\\"\\u003eBubble Cup X - Finals [Online Mirror]\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1711959163000,"title":"CodeForces rating 2300 题目集","dislikeCnt":0,"content":"[problem:CodeForces-600E] Lomsat gelral数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 树形结构(trees\n[problem:CodeForces-438D] The child and sequence数据结构(data structures) 数学(math\n[problem:CodeForces-558E] A simple task数据结构(data structures) 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-786B] Legacy数据结构(data structures) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1009F] Dominant indices数据结构(data structures) 并查集(dsu), 树形结构(trees\n[problem:CodeForces-713C] Sonya and problem wihtout a legend动态规划(dp) 排序算法(sortings\n[problem:CodeForces-1188B] Count pairs数学(math) 矩阵(matrices), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-915E] Physical education lessons数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-598C] Nearest vectors计算几何(geometry) 排序算法(sortings\n[problem:CodeForces-888G] Xor-mst位掩码(bitmasks) 构造算法(constructive algorithms), 数据结构(data structures\n[problem:CodeForces-1450C2] Errich-tac-toe (hard version)构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1316E] Team building位掩码(bitmasks) 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-718C] Sasha and array数据结构(data structures) 数学(math), 矩阵(matrices\n[problem:CodeForces-451E] Devu and flowers位掩码(bitmasks) 组合数学(combinatorics), 数论(number theory\n[problem:CodeForces-1628C] Grid xor构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive), 数学(math\n[problem:CodeForces-1699D] Almost triple deletions数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-825E] Minimal labels数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1198D] Rectangle painting 1动态规划(dp \n[problem:CodeForces-708C] Centroids数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-383D] Antimatter动态规划(dp \n[problem:CodeForces-1451E2] Bitwise queries (hard version)位掩码(bitmasks) 构造算法(constructive algorithms), 交互性问题(interactive), 数学(math\n[problem:CodeForces-1342E] Placing rooks组合数学(combinatorics) 快速傅里叶变换(fft), 数学(math\n[problem:CodeForces-547C] Mike and foam位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-154C] Double profiles图论(graphs) 哈希表(hashing), 排序算法(sortings\n[problem:CodeForces-715B] Complete the graph二分搜索(binary search) 构造算法(constructive algorithms), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-785D] Anton and school - 2组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-675E] Trains and statistic数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1422D] Returning home图论(graphs) 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-1203F2] Complete the projects (hard version)动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-543D] Road improvement动态规划(dp) 树形结构(trees\n[problem:CodeForces-1182E] Product oriented recurrence动态规划(dp) 数学(math), 矩阵(matrices), 数论(number theory\n[problem:CodeForces-487C] Prefix product sequence构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-1528C] Trees of tranquillity数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1495C] Garden of the sun构造算法(constructive algorithms) 图论(graphs\n[problem:CodeForces-1494D] Dogeforces构造算法(constructive algorithms) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 并查集(dsu), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1540B] Tree array暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 图论(graphs), 数学(math), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-1404C] Fixed point removal二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1824B2] Luotianyi and the floating islands (hard version)组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 数学(math), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-1228E] Another filling the grid组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1658D2] 388535 (hard version)位掩码(bitmasks) 暴力枚举(brute force), 数据结构(data structures), 数学(math\n[problem:CodeForces-1693C] Keshi in search of amshz图论(graphs) 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-817F] Mex queries二分搜索(binary search) 数据结构(data structures), 树形结构(trees\n[problem:CodeForces-1396C] Monster invaders动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1073E] Segment sum位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-808G] Anthem of berland动态规划(dp) 字符串处理(strings\n[problem:CodeForces-160D] Edges in mst深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 排序算法(sortings\n[problem:CodeForces-1536E] Omkar and forest组合数学(combinatorics) 图论(graphs), 数学(math), 最短路算法(shortest paths\n[problem:CodeForces-1706E] Qpwoeirut and vertices二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 并查集(dsu), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1371E2] Asterism (hard version)二分搜索(binary search) 组合数学(combinatorics), 动态规划(dp), 数学(math), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-1408F] Two different构造算法(constructive algorithms) 分治算法(divide and conquer\n[problem:CodeForces-1476E] Pattern matching位掩码(bitmasks) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 哈希表(hashing), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-1385F] Removing leaves数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-891C] Envy数据结构(data structures) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1870E] Another mex problem位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 最短路算法(shortest paths\n[problem:CodeForces-1614D2] Divan and kostomuksha (hard version)动态规划(dp) 数论(number theory\n[problem:CodeForces-1270E] Divide points构造算法(constructive algorithms) 计算几何(geometry), 数学(math\n[problem:CodeForces-732F] Tourist reform深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1592D] Hemose in icpc ?二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive), 数学(math), 数论(number theory), 树形结构(trees\n[problem:CodeForces-510E] Fox and dinner流(flows \n[problem:CodeForces-1553F] Pairwise modulo数据结构(data structures) 数学(math\n[problem:CodeForces-1251E1] Voting (easy version)数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1322C] Instant noodles图论(graphs) 哈希表(hashing), 数学(math), 数论(number theory\n[problem:CodeForces-1916E] Happy life in university数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-515E] Drazil and park数据结构(data structures \n[problem:CodeForces-1712E1] Lcm sum (easy version)二分搜索(binary search) 暴力枚举(brute force), 组合数学(combinatorics), 数学(math), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-623B] Array gcd动态规划(dp) 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-1282D] Enchanted artifact构造算法(constructive algorithms) 交互性问题(interactive), 字符串处理(strings\n[problem:CodeForces-1834E] Mex of lcm二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1783E] Game of the year暴力枚举(brute force) 数据结构(data structures), 数学(math), 数论(number theory\n[problem:CodeForces-1654E] Arithmetic operations暴力枚举(brute force) 数据结构(data structures), 图论(graphs), 数学(math\n[problem:CodeForces-1919F1] Wine factory (easy version)数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-1139D] Steps to one动态规划(dp) 数学(math), 数论(number theory), 概率论(probabilities\n[problem:CodeForces-788C] The great mixing深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1603C] Extreme extension动态规划(dp) 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-1705E] Mark and professor koro二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 组合数学(combinatorics), 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-149E] Martian strings字符串后缀结构(string suffix structures) 字符串处理(strings\n[problem:CodeForces-1453E] Dog snacks二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1625D] Binary spiders位掩码(bitmasks) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-652E] Pursuit for artifacts深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1601C] Optimal insertion数据结构(data structures) 分治算法(divide and conquer), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1695D2] Tree queries (hard version)构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-85D] Sum of medians二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1380E] Merging towers数据结构(data structures) 并查集(dsu), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1607F] Robot on the board 2暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-884D] Boxes and balls数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-1534E] Lost array图论(graphs) 贪心策略(greedy), 交互性问题(interactive), 最短路算法(shortest paths\n[problem:CodeForces-1292C] Xenon\u0027s attack on the gangs组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1132D] Stressful training二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-1093G] Multidimensional queries位掩码(bitmasks) 数据结构(data structures\n[problem:CodeForces-960E] Alternating tree组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 动态规划(dp), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-570E] Pig and palindromes组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-1190C] Tokitsukaze and duel暴力枚举(brute force) 博弈论(games), 贪心策略(greedy\n[problem:CodeForces-1394B] Boboniu walks on graph暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 哈希表(hashing\n[problem:CodeForces-1550D] Excellent arrays二分搜索(binary search) 组合数学(combinatorics), 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1552E] Colors and intervals构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1768E] Partial sorting组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-808E] Selling souvenirs二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 三分搜索(ternary search\n[problem:CodeForces-1691E] Number of groups数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1245F] Daniel and spring cleaning位掩码(bitmasks) 暴力枚举(brute force), 组合数学(combinatorics), 动态规划(dp\n[problem:CodeForces-1621E] New school二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1062E] Company二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-985F] Isomorphic strings哈希表(hashing) 字符串处理(strings\n[problem:CodeForces-594A] Warrior and archer博弈论(games \n[problem:CodeForces-1748E] Yet another array counting problem二分搜索(binary search) 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp), 流(flows), 数学(math), 树形结构(trees\n[problem:CodeForces-995C] Leaving the bar暴力枚举(brute force) 数据结构(data structures), 计算几何(geometry), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1042E] Vasya and magic matrix动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-1268C] K integers二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-1148E] Earth wind and fire构造算法(constructive algorithms) 贪心策略(greedy), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1236D] Alice and the doll暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1217E] Sum queries?数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1728E] Red-black pepper暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-893F] Subtree minimum query数据结构(data structures) 树形结构(trees\n[problem:CodeForces-1610E] Amshz and g.o.a.t.二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1917D] Yet another inversions problem组合数学(combinatorics) 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1285E] Delete a segment暴力枚举(brute force) 构造算法(constructive algorithms), 数据结构(data structures), 动态规划(dp), 图论(graphs), 排序算法(sortings), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1101G] (zero xor subset)-less数学(math) 矩阵(matrices\n[problem:CodeForces-1861E] Non-intersecting subpermutations组合数学(combinatorics) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-877F] Ann and books数据结构(data structures) 流(flows), 哈希表(hashing\n[problem:CodeForces-1675G] Sorting pancakes动态规划(dp \n[problem:CodeForces-1096F] Inversion expectation动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-1204E] Natasha Sasha and the prefix sums组合数学(combinatorics), 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1698E] Permutationforces ii暴力枚举(brute force) 组合数学(combinatorics), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1411E] Poman numbers位掩码(bitmasks) 贪心策略(greedy), 数学(math), 字符串处理(strings\n[problem:CodeForces-1929F] Sasha and the wedding binary search tree暴力枚举(brute force) 组合数学(combinatorics), 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 数学(math), 树形结构(trees\n[problem:CodeForces-585D] Lizard era: beginningmeet-in-the-middle算法(meet-in-the-middle \n[problem:CodeForces-1399F] Yet another segments subset数据结构(data structures) 动态规划(dp), 图论(graphs), 排序算法(sortings\n[problem:CodeForces-22E] Scheme深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-1304F1] Animal observation (easy version)数据结构(data structures) 动态规划(dp\n[problem:CodeForces-1681F] Unique occurrences数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 动态规划(dp), 并查集(dsu), 树形结构(trees\n[problem:CodeForces-677D] Vanya and treasure数据结构(data structures) 动态规划(dp), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1943C] Tree compass构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1842E] Tenzing and triangle数据结构(data structures) 动态规划(dp), 计算几何(geometry), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1805E] There should be a lot of maximums暴力枚举(brute force) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1874C] Jellyfish and eva动态规划(dp) 图论(graphs), 贪心策略(greedy), 数学(math), 概率论(probabilities\n[problem:CodeForces-845G] Shortest path problem?深度优先搜索及其变种(dfs and similar) 图论(graphs), 数学(math\n[problem:CodeForces-1798E] Multitest generator暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-549B] Looksery party构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1849E] Max to the right of min二分搜索(binary search) 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp), 并查集(dsu), 双指针算法(two pointers\n[problem:CodeForces-1197E] Culture code二分搜索(binary search) 组合数学(combinatorics), 数据结构(data structures), 动态规划(dp), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-1738E] Balance addicts组合数学(combinatorics) 动态规划(dp), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1594E2] Rubik\u0027s cube coloring (hard version)暴力枚举(brute force) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 树形结构(trees\n[problem:CodeForces-1928E] Modular sequence暴力枚举(brute force) 构造算法(constructive algorithms), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-858F] Wizard\u0027s tour构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-723F] St-spanning tree并查集(dsu) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1843F2] Omsk metro (hard version)数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 动态规划(dp), 数学(math), 树形结构(trees\n[problem:CodeForces-1895E] Infinite card game二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 并查集(dsu), 博弈论(games), 图论(graphs), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1167F] Scalar queries组合数学(combinatorics) 数据结构(data structures), 数学(math), 排序算法(sortings\n[problem:CodeForces-1548D1] Gregor and the odd cows (easy)位掩码(bitmasks) 计算几何(geometry), 数学(math), 数论(number theory\n[problem:CodeForces-610D] Vika and segments构造算法(constructive algorithms) 数据结构(data structures), 计算几何(geometry), 双指针算法(two pointers\n[problem:CodeForces-1929E] Sasha and the happy tree cutting位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 数学(math), 树形结构(trees\n[problem:CodeForces-1276C] Beautiful rectangle暴力枚举(brute force) 组合数学(combinatorics), 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1927G] Paint charges数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1513E] Cost equilibrium组合数学(combinatorics) 构造算法(constructive algorithms), 数学(math), 排序算法(sortings\n[problem:CodeForces-584E] Anton and ira构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1743F] Intersection and union数据结构(data structures) 动态规划(dp), 矩阵(matrices), 概率论(probabilities\n[problem:CodeForces-1132E] Knapsack深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-802I] Fake news (hard)字符串后缀结构(string suffix structures \n[problem:CodeForces-500E] New year domino数据结构(data structures) 动态规划(dp), 并查集(dsu\n[problem:CodeForces-425D] Sereja and squares二分搜索(binary search) 数据结构(data structures), 哈希表(hashing\n[problem:CodeForces-1004D] Sonya and matrix暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1780F] Three chairs位掩码(bitmasks) 暴力枚举(brute force), 组合数学(combinatorics), 数据结构(data structures), 动态规划(dp), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-1244F] Chips构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1623D] Robot cleaner revisit实现问题,编程技巧,模拟(implementation) 数学(math), 概率论(probabilities\n[problem:CodeForces-327E] Axis walking位掩码(bitmasks) 组合数学(combinatorics), 构造算法(constructive algorithms), 动态规划(dp), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-993E] Nikita and order statistics中国剩余定理(chinese remainder theorem) 快速傅里叶变换(fft), 数学(math\n[problem:CodeForces-405E] Graph cutting深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1156F] Card bag动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-1239C] Queue in the train数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1864F] Exotic queries数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-803G] Periodic rmq problem数据结构(data structures \n[problem:CodeForces-762D] Maximum path动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-601C] Kleofáš and the n-thlon动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-1385G] Columns swaps二分图可满足性问题(2-sat) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1310D] Tourism动态规划(dp) 图论(graphs), 概率论(probabilities\n[problem:CodeForces-1781E] Rectangle shrinking二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-711E] Zs and the birthday paradox数学(math) 数论(number theory), 概率论(probabilities\n[problem:CodeForces-793C] Mice problem计算几何(geometry) 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-938E] Max history组合数学(combinatorics) 数学(math\n[problem:CodeForces-660E] Different subsets for all tuples组合数学(combinatorics) 数学(math\n[problem:CodeForces-1584E] Game with stones二分搜索(binary search) 数据结构(data structures), 博弈论(games), 贪心策略(greedy\n[problem:CodeForces-1254C] Point ordering构造算法(constructive algorithms) 计算几何(geometry), 交互性问题(interactive), 数学(math\n[problem:CodeForces-1814E] Chain chips数据结构(data structures) 动态规划(dp), 矩阵(matrices\n[problem:CodeForces-830C] Bamboo partition暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-772C] Vulnerable kerbals构造算法(constructive algorithms) 动态规划(dp), 图论(graphs), 数学(math), 数论(number theory\n[problem:CodeForces-123D] String字符串后缀结构(string suffix structures \n[problem:CodeForces-1797E] Li hua and array暴力枚举(brute force) 数据结构(data structures), 并查集(dsu), 数学(math), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-1914G2] Light bulbs (hard version)组合数学(combinatorics) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 哈希表(hashing\n[problem:CodeForces-936C] Lock puzzle构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1866D] Digital wallet动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1799E] City union构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 计算几何(geometry), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-590D] Top secret task动态规划(dp \n[problem:CodeForces-901C] Bipartite segments二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 双指针算法(two pointers\n[problem:CodeForces-1151F] Sonya and informatics组合数学(combinatorics) 动态规划(dp), 矩阵(matrices), 概率论(probabilities\n[problem:CodeForces-1131E] String multiplication动态规划(dp) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-898F] Restoring the expression暴力枚举(brute force) 哈希表(hashing), 数学(math\n[problem:CodeForces-915G] Coprime arrays数学(math) 数论(number theory\n[problem:CodeForces-1766E] Decomposition二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-1245E] Hyakugoku and ladders动态规划(dp) 概率论(probabilities), 最短路算法(shortest paths\n[problem:CodeForces-727E] Games on a cd数据结构(data structures) 哈希表(hashing), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-558D] Guess your way out! ii数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1878G] Wxhtzdy oro tree二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1379D] New passenger trams二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-403D] Beautiful pairs of numbers组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-557E] Ann and half-palindrome数据结构(data structures) 动态规划(dp), 图论(graphs), 字符串后缀结构(string suffix structures), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1790G] Tokens on graph构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-311E] Biologist流(flows \n[problem:CodeForces-1015F] Bracket substring动态规划(dp) 字符串处理(strings\n[problem:CodeForces-878B] Teams formation数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-300E] Empire strikes back二分搜索(binary search) 数学(math), 数论(number theory\n[problem:CodeForces-1065E] Side transmutations组合数学(combinatorics) 字符串处理(strings\n[problem:CodeForces-444B] Dzy loves fft概率论(probabilities \n[problem:CodeForces-812E] Sagheer and apple tree博弈论(games) 树形结构(trees\n[problem:CodeForces-489E] Hiking二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-768F] Barrels and boxes暴力枚举(brute force) 组合数学(combinatorics), 数学(math), 数论(number theory), 概率论(probabilities\n[problem:CodeForces-9E] Interestring graph and apples深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1172C1] Nauuo and pictures (easy version)动态规划(dp) 概率论(probabilities\n[problem:CodeForces-870E] Points Lines and ready-made titles深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-553D] Nudist beach二分搜索(binary search) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-460D] Little victor and set暴力枚举(brute force) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-317D] Game with powers动态规划(dp) 博弈论(games\n[problem:CodeForces-629E] Famil door and roads组合数学(combinatorics) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-573C] Bear and drawing构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-659G] Fence divercity组合数学(combinatorics) 动态规划(dp), 数论(number theory\n[problem:CodeForces-895E] Eyes closed数据结构(data structures) 概率论(probabilities\n[problem:CodeForces-1200F] Graph traveler暴力枚举(brute force) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-429C] Guess the tree位掩码(bitmasks) 构造算法(constructive algorithms), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-142C] Help caretaker暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-294E] Shaass the great动态规划(dp) 树形结构(trees\n[problem:CodeForces-1468M] Similar sets数据结构(data structures) 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-425C] Sereja and two sequences数据结构(data structures) 动态规划(dp\n[problem:CodeForces-566A] Matching names深度优先搜索及其变种(dfs and similar) 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-935E] Fafa and ancient mathematics深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-141D] Take-off ramps图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-1085E] Vasya and templates贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-24E] Berland collider二分搜索(binary search \n[problem:CodeForces-509F] Progress monitoring动态规划(dp) 树形结构(trees\n[problem:CodeForces-846E] Chemistry in berland深度优先搜索及其变种(dfs and similar) 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-91C] Ski base组合数学(combinatorics) 并查集(dsu), 图论(graphs\n[problem:CodeForces-670F] Restore a number暴力枚举(brute force) 构造算法(constructive algorithms), 字符串处理(strings\n[problem:CodeForces-87D] Beautiful road深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1575I] Illusions of the desert数据结构(data structures) 树形结构(trees\n[problem:CodeForces-628E] Zbazi in zeydabad数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1070G] Monsters and potions暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-949D] Curfew二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1933G] Turtle magic: royal turtle shell pattern位掩码(bitmasks) 暴力枚举(brute force), 组合数学(combinatorics), 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 数学(math\n[problem:CodeForces-1932G] Moving platforms图论(graphs) 数学(math), 数论(number theory), 最短路算法(shortest paths\n[problem:CodeForces-1938G] Personality tes \n[problem:CodeForces-126D] Fibonacci sums动态规划(dp) 数学(math\n[problem:CodeForces-1250E] The coronation图论(graphs) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-97B] Superset构造算法(constructive algorithms) 分治算法(divide and conquer\n[problem:CodeForces-1425D] Danger of mad snakes组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-362E] Petya and pipes流(flows) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-277B] Set of points构造算法(constructive algorithms) 计算几何(geometry\n[problem:CodeForces-141E] Clearing up构造算法(constructive algorithms) 动态规划(dp), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1039A] Timetable构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-727F] Polycarp\u0027s problems二分搜索(binary search) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-467E] Alex and complicated task数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-300D] Painting square动态规划(dp) 快速傅里叶变换(fft\n[problem:CodeForces-1250G] Discarding game动态规划(dp) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-111D] Petya and coloring组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-690A2] Collective mindsets (medium \n[problem:CodeForces-1252J] Tiling terrace暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-1070J] Streets and avenues in berhattan动态规划(dp \n[problem:CodeForces-38G] Queue数据结构(data structures \n[problem:CodeForces-596D] Wilbur and trees动态规划(dp) 数学(math), 概率论(probabilities), 排序算法(sortings\n[problem:CodeForces-414D] Mashmokh and water tanks二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-594C] Edo and magnets暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-36D] New game with a chess piece博弈论(games \n[problem:CodeForces-101D] Castle动态规划(dp) 贪心策略(greedy), 概率论(probabilities), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1866I] Imagination castle动态规划(dp) 博弈论(games), 双指针算法(two pointers\n[problem:CodeForces-167C] Wizards and numbers博弈论(games) 数学(math\n[problem:CodeForces-432E] Square tiling构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-49E] Common ancestor动态规划(dp \n[problem:CodeForces-748F] Santa clauses and a soccer championship构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-883C] Downloading b++二分搜索(binary search) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1045C] Hyperspace highways深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-89C] Chip play暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-316C2] Tidying up流(flows) 图匹配(graph matchings\n[problem:CodeForces-305E] Playing with string博弈论(games \n[problem:CodeForces-123C] Brackets组合数学(combinatorics) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-76F] Tourist二分搜索(binary search) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-364C] Beautiful set暴力枚举(brute force) 数论(number theory\n[problem:CodeForces-677E] Vanya and balloons二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1090E] Horseback riding流(flows) 图论(graphs\n[problem:CodeForces-1252L] Road construction流(flows) 图论(graphs\n[problem:CodeForces-424D] Biathlon track二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-385E] Bear in the field数学(math) 矩阵(matrices\n[problem:CodeForces-852I] Dating暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-313E] Ilya and two numbers构造算法(constructive algorithms) 数据结构(data structures), 并查集(dsu), 贪心策略(greedy\n[problem:CodeForces-78E] Evacuation流(flows) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-89B] Widget library动态规划(dp) 表达式解析(expression parsing), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-316E3] Summer homework数据结构(data structures) 数学(math\n[problem:CodeForces-1252B] Cleaning robots动态规划(dp) 树形结构(trees\n[problem:CodeForces-268D] Wall bars动态规划(dp \n[problem:CodeForces-254D] Rats暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-1912J] Joy of pokémon observatio \n[problem:CodeForces-873E] Awards for contestants暴力枚举(brute force) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-316D1] Pe lesson暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-856B] Similar words动态规划(dp) 哈希表(hashing), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-248D] Sweets for everyone!二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1575B] Building an amusement park二分搜索(binary search) 计算几何(geometry\n[problem:CodeForces-1600F] Party organization暴力枚举(brute force) 数学(math), 概率论(probabilities\n[problem:CodeForces-316D2] Pe lesson动态规划(dp \n[problem:CodeForces-37D] Lesson timetable组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-42D] Strange town构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-491C] Deciphering流(flows) 图匹配(graph matchings\n[problem:CodeForces-358E] Dima and kicks暴力枚举(brute force) 并查集(dsu), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-316E2] Summer homework数据结构(data structures) 数学(math\n[problem:CodeForces-43E] Race暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1403B] Spring cleaning 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-62D] Wormhouse深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-518F] Pasha and pipe二分搜索(binary search) 暴力枚举(brute force), 组合数学(combinatorics), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-50E] Square equation roots数学(math \n[problem:CodeForces-213D] Stars构造算法(constructive algorithms) 计算几何(geometry\n[problem:CodeForces-180B] Divisibility rules数学(math) 数论(number theory\n[problem:CodeForces-838E] Convex countour动态规划(dp \n[problem:CodeForces-212B] Polycarpus is looking for good substrings位掩码(bitmasks) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-77D] Domino carpet动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-46F] Hercule poirot problem并查集(dsu) 图论(graphs\n[problem:CodeForces-1046I] Say hello计算几何(geometry \n[problem:CodeForces-78D] Archer\u0027s shot二分搜索(binary search) 计算几何(geometry), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-203E] Transportation贪心策略(greedy) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-306D] Polygon构造算法(constructive algorithms) 计算几何(geometry\n[problem:CodeForces-241F] Race暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-62C] Inquisition计算几何(geometry) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-40C] Berland square实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-774E] Big number and remainder 数学(math), 数论(number theory\n[problem:CodeForces-178E3] The beaver\u0027s problem - \n[problem:CodeForces-177F2] Script generatio \n[problem:CodeForces-470H] Array sorting \n[problem:CodeForces-44I] Toys暴力枚举(brute force) 组合数学(combinatorics\n[problem:CodeForces-1488F] Dogecoin , 二分搜索(binary search), 数据结构(data structures\n[problem:CodeForces-130I] Array sorting 排序算法(sortings\n[problem:CodeForces-316F2] Suns and ray \n[problem:CodeForces-1346G] Two ip cameras 数学(math), 数论(number theory\n[problem:CodeForces-1211F] Kotlinkotlinkotlinkotlin... 图论(graphs), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1769D3] Игра в девятку iii 暴力枚举(brute force\n[problem:CodeForces-64H] Table bowling 排序算法(sortings\n[problem:CodeForces-774I] Composing of string 动态规划(dp\n[problem:CodeForces-470F] Pairwise sums \n[problem:CodeForces-470G] Hamming distance \n[problem:CodeForces-641G] Little artem and grap \n[problem:CodeForces-648E] Собери число图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-207D8] The beaver\u0027s problem - \n[problem:CodeForces-72D] Perse-script 表达式解析(expression parsing\n","threadId":188473,"likeCnt":0,"createTime":1711959163000,"isWorkbook":true,"viewCnt":25,"openness":2,"fav":false,"id":4795,"trustable":false}