Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-56E\":[\"Domino Principle\",2549,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/56\\\"\\u003eCodeforces Beta Round 52 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-196C\":[\"Paint Tree\",807,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/196\\\"\\u003eCodeforces Round 124 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-68C\":[\"Synchrophasotron\",326,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/68\\\"\\u003eCodeforces Beta Round 62\\u003c/a\\u003e\"],\"CodeForces-1158B\":[\"The minimal unique substring\",2111,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1158\\\"\\u003eCodeforces Round 559 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1906H\":[\"Twin Friends\",610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1037E\":[\"Trips\",2800,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1037\\\"\\u003eManthan, Codefest 18 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1485D\":[\"Multiples and Power Differences\",5093,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1485\\\"\\u003eCodeforces Round 701 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1461E\":[\"Water Level\",2120,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1461\\\"\\u003eCodeforces Round 689 (Div. 2, based on Zed Code Competition)\\u003c/a\\u003e\"],\"CodeForces-1110E\":[\"Magic Stones\",4100,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1110\\\"\\u003eCodeforces Global Round 1\\u003c/a\\u003e\"],\"CodeForces-1231E\":[\"Middle-Out\",707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1231\\\"\\u003eDasha Code Championship - Novosibirsk Finals Round (only for onsite-finalists)\\u003c/a\\u003e\"],\"CodeForces-509D\":[\"Restoring Numbers\",756,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/509\\\"\\u003eCodeforces Round 289 (Div. 2, ACM ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1110D\":[\"Jongmah\",3603,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1110\\\"\\u003eCodeforces Global Round 1\\u003c/a\\u003e\"],\"CodeForces-618D\":[\"Hamiltonian Spanning Tree\",1870,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/618\\\"\\u003eWunder Fund Round 2016 (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-508E\":[\"Arthur and Brackets\",1714,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/508\\\"\\u003eCodeforces Round 288 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-847D\":[\"Dog Show\",1103,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-316C1\":[\"Tidying Up\",560,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-617E\":[\"XOR and Favorite Number\",9032,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/617\\\"\\u003eCodeforces Round 340 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-932D\":[\"Tree\",1829,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/932\\\"\\u003eICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-920G\":[\"List Of Integers\",1764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-172E\":[\"BHTML+BCSS\",276,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/172\\\"\\u003eCroc Champ 2012 - Qualification Round\\u003c/a\\u003e\"],\"CodeForces-183C\":[\"Cyclic Coloring\",656,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/183\\\"\\u003eCroc Champ 2012 - Final\\u003c/a\\u003e\"],\"CodeForces-207C2\":[\"Game with Two Trees\",75,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-45G\":[\"Prime Problem\",1074,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/45\\\"\\u003eSchool Team Contest 3 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-45B\":[\"School\",284,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/45\\\"\\u003eSchool Team Contest 3 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-1278E\":[\"Tests for problem D\",1785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1278\\\"\\u003eEducational Codeforces Round 78 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1157G\":[\"Inverse of Rows and Columns\",945,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1157\\\"\\u003eCodeforces Round 555 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-507D\":[\"The Maths Lecture\",1832,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/507\\\"\\u003eCodeforces Round 287 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-628D\":[\"Magic Numbers\",6170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/628\\\"\\u003eEducational Codeforces Round 8\\u003c/a\\u003e\"],\"CodeForces-713B\":[\"Searching Rectangles\",1481,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/713\\\"\\u003eCodeforces Round 371 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-616E\":[\"Sum of Remainders\",2966,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/616\\\"\\u003eEducational Codeforces Round 5\\u003c/a\\u003e\"],\"CodeForces-858E\":[\"Tests Renumeration\",499,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/858\\\"\\u003eТехнокубок 2018 - Отборочный Раунд 1\\u003c/a\\u003e\"],\"CodeForces-979D\":[\"Kuro and GCD and XOR and SUM\",1783,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/979\\\"\\u003eCodeforces Round 482 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1593G\":[\"Changing Brackets\",1650,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1593\\\"\\u003eCodeforces Round 748 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1918E\":[\"ace5 and Task Order\",1554,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1918\\\"\\u003eCodeforces Round 922 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-280C\":[\"Game on Tree\",3963,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/280\\\"\\u003eCodeforces Round 172 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-42C\":[\"Safe cracking\",494,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/42\\\"\\u003eCodeforces Beta Round 41\\u003c/a\\u003e\"],\"CodeForces-182A\":[\"Battlefield\",297,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/182\\\"\\u003eCodeforces Round 117 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1520F2\":[\"Guess the K-th Zero (Hard version)\",2919,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1520\\\"\\u003eCodeforces Round 719 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1156D\":[\"0-1-Tree\",3963,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1398E\":[\"Two Types of Spells\",2197,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1398\\\"\\u003eEducational Codeforces Round 93 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1059D\":[\"Nature Reserve\",2783,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1059\\\"\\u003eCodeforces Round 514 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1168C\":[\"And Reachability\",2411,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1168\\\"\\u003eCodeforces Round 562 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1580C\":[\"Train Maintenance\",1687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1580\\\"\\u003eCodeforces Round 745 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-409G\":[\"On a plane\",509,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/409\\\"\\u003eApril Fools Day Contest 2014\\u003c/a\\u003e\"],\"CodeForces-1253E\":[\"Antenna Coverage\",2712,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1253\\\"\\u003eCodeforces Round 600 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1156E\":[\"Special Segments of Permutation\",2956,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-627C\":[\"Package Delivery\",1195,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/627\\\"\\u003e8VC Venture Cup 2016 - Final Round\\u003c/a\\u003e\"],\"CodeForces-518E\":[\"Arthur and Questions\",945,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/518\\\"\\u003eCodeforces Round 293 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-603C\":[\"Lieges of Legendre\",2067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/603\\\"\\u003eCodeforces Round 334 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-833B\":[\"The Bakery\",4791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/833\\\"\\u003eCodeforces Round 426 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-821D\":[\"Okabe and City\",1578,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/821\\\"\\u003eCodeforces Round 420 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-712D\":[\"Memory and Scores\",1881,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/712\\\"\\u003eCodeforces Round 370 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-954I\":[\"Yet Another String Matching Problem\",1046,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1806E\":[\"Tree Master\",2785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1806\\\"\\u003eCodeforces Round 858 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1034B\":[\"Little C Loves 3 II\",2142,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1034\\\"\\u003eCodeforces Round 511 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1179C\":[\"Serge and Dining Room\",2011,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1179\\\"\\u003eCodeforces Round 569 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1373E\":[\"Sum of Digits\",2746,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1373\\\"\\u003eEducational Codeforces Round 90 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1252E\":[\"Songwriter\",1300,\"\\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-1155E\":[\"Guess the Root\",1480,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1155\\\"\\u003eEducational Codeforces Round 63 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-639C\":[\"Bear and Polynomials\",1215,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/639\\\"\\u003eVK Cup 2016 - Round 1\\u003c/a\\u003e\"],\"CodeForces-505D\":[\"Mr. Kitayuta\\u0027s Technology\",2602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/505\\\"\\u003eCodeforces Round 286 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-868D\":[\"Huge Strings\",927,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/868\\\"\\u003eCodeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-723E\":[\"One-Way Reform\",2072,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/723\\\"\\u003eCodeforces Round 375 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1470D\":[\"Strange Housing\",3754,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1470\\\"\\u003eCodeforces Round 694 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-965E\":[\"Short Code\",1529,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/965\\\"\\u003eCodeforces Round 476 (Div. 2) [Thanks, Telegram!]\\u003c/a\\u003e\"],\"CodeForces-382D\":[\"Ksenia and Pawns\",671,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/382\\\"\\u003eCodeforces Round 224 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1562D2\":[\"Two Hundred Twenty One (hard version)\",2105,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1562\\\"\\u003eCodeforces Round 741 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-36C\":[\"Bowls\",301,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/36\\\"\\u003eCodeforces Beta Round 36\\u003c/a\\u003e\"],\"CodeForces-1114E\":[\"Arithmetic Progression\",2854,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1114\\\"\\u003eCodeforces Round 538 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1477C\":[\"Nezzar and Nice Beatmap\",2274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1477\\\"\\u003eCodeforces Round 698 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-925C\":[\"Big Secret\",1379,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/925\\\"\\u003eVK Cup 2018 - Round 3\\u003c/a\\u003e\"],\"CodeForces-804C\":[\"Ice cream coloring\",1647,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/804\\\"\\u003eCodeforces Round 411 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-707D\":[\"Persistent Bookcase\",2875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/707\\\"\\u003eCodeforces Round 368 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-316G2\":[\"Good Substrings\",469,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-490F\":[\"Treeland Tour\",1723,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/490\\\"\\u003eCodeforces Round 279 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-13C\":[\"Sequence\",4393,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/13\\\"\\u003eCodeforces Beta Round 13\\u003c/a\\u003e\"],\"CodeForces-1149B\":[\"Three Religions\",1881,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1149\\\"\\u003eCodeforces Round 556 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-25E\":[\"Test\",2638,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/25\\\"\\u003eCodeforces Beta Round 25 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1670E\":[\"Hemose on the Tree\",1676,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1670\\\"\\u003eCodeforces Round 788 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1488E\":[\"Palindromic Doubles\",194,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1488\\\"\\u003eKotlin Heroes: Episode 6\\u003c/a\\u003e\"],\"CodeForces-815B\":[\"Karen and Test\",1438,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/815\\\"\\u003eCodeforces Round 419 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-839D\":[\"Winter is here\",3042,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/839\\\"\\u003eCodeforces Round 428 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1234F\":[\"Yet Another Substring Reverse\",2605,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1234\\\"\\u003eCodeforces Round 590 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-316F3\":[\"Suns and Rays\",166,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-802E\":[\"Marmots (medium)\",241,\"\\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-316F1\":[\"Suns and Rays\",154,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-802H\":[\"Fake News (medium)\",451,\"\\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-272E\":[\"Dima and Horses\",1286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/272\\\"\\u003eCodeforces Round 167 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-150C\":[\"Smart Cheater\",663,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/150\\\"\\u003eCodeforces Round 107 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1039C\":[\"Network Safety\",1378,\"\\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-1136E\":[\"Nastya Hasn\\u0027t Written a Legend\",1110,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1136\\\"\\u003eCodeforces Round 546 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1003F\":[\"Abbreviation\",1179,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1003\\\"\\u003eCodeforces Round 494 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1100E\":[\"Andrew and Taxi\",2495,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1100\\\"\\u003eCodeforces Round 532 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-946E\":[\"Largest Beautiful Number\",1123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/946\\\"\\u003eEducational Codeforces Round 39 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-813E\":[\"Army Creation\",2667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"CodeForces-922E\":[\"Birds\",2409,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-271E\":[\"Three Horses\",517,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/271\\\"\\u003eCodeforces Round 166 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-11D\":[\"A Simple Task\",5079,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/11\\\"\\u003eCodeforces Beta Round 11\\u003c/a\\u003e\"],\"CodeForces-47D\":[\"Safe\",887,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/47\\\"\\u003eCodeforces Beta Round 44 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-11C\":[\"How Many Squares?\",631,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/11\\\"\\u003eCodeforces Beta Round 11\\u003c/a\\u003e\"],\"CodeForces-47E\":[\"Cannon\",429,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/47\\\"\\u003eCodeforces Beta Round 44 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1907G\":[\"Lights\",1743,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1907\\\"\\u003eCodeforces Round 913 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1474D\":[\"Cleaning\",3978,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1474\\\"\\u003eCodeforces Round 696 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1486E\":[\"Paired Payment\",2858,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1486\\\"\\u003eCodeforces Round 703 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1353F\":[\"Decreasing Heights\",3173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1353\\\"\\u003eCodeforces Round 642 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1583E\":[\"Moment of Bloom\",2189,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1583\\\"\\u003eTechnocup 2022 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1220E\":[\"Tourism\",2653,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1220\\\"\\u003eCodeforces Round 586 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1389E\":[\"Calendar Ambiguity\",3166,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1389\\\"\\u003eEducational Codeforces Round 92 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1498D\":[\"Bananas in a Microwave\",2265,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1498\\\"\\u003eCodeCraft-21 and Codeforces Round 711 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1498E\":[\"Two Houses\",1861,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1498\\\"\\u003eCodeCraft-21 and Codeforces Round 711 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1695D1\":[\"Tree Queries (Easy Version)\",2092,\"\\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-282E\":[\"Sausage Maximization\",3708,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/282\\\"\\u003eCodeforces Round 173 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-350E\":[\"Wrong Floyd\",800,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/350\\\"\\u003eCodeforces Round 203 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1607H\":[\"Banquet Preparations 2\",1211,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1607\\\"\\u003eCodeforces Round 753 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-72B\":[\"INI-file\",75,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/72\\\"\\u003eUnknown Language Round 2\\u003c/a\\u003e\"],\"CodeForces-144E\":[\"Competition\",602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/144\\\"\\u003eCodeforces Round 103 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-253E\":[\"Printer\",562,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/253\\\"\\u003eCodeforces Round 154 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1837E\":[\"Playoff Fixing\",2107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1837\\\"\\u003eEducational Codeforces Round 149 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1946E\":[\"Girl Permutation\",2022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1946\\\"\\u003eCodeforces Round 936 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1704E\":[\"Count Seconds\",2232,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1704\\\"\\u003eCodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1607G\":[\"Banquet Preparations 1\",1519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1607\\\"\\u003eCodeforces Round 753 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1840G1\":[\"In Search of Truth (Easy Version)\",2243,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1840\\\"\\u003eCodeforces Round 878 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1089A\":[\"Alice the Fan\",1138,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1089\\\"\\u003e2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1065D\":[\"Three Pieces\",1290,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1065\\\"\\u003eEducational Codeforces Round 52 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1283F\":[\"DIY Garland\",1726,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1283\\\"\\u003eCodeforces Round 611 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1295E\":[\"Permutation Separation\",2475,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1295\\\"\\u003eEducational Codeforces Round 81 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-120I\":[\"Luck is in Numbers\",314,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-592D\":[\"Super M\",2556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/592\\\"\\u003eCodeforces Round 328 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-97E\":[\"Leaders\",428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/97\\\"\\u003eYandex.Algorithm 2011: Finals\\u003c/a\\u003e\"],\"CodeForces-85C\":[\"Petya and Tree\",550,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/85\\\"\\u003eYandex.Algorithm 2011: Round 1\\u003c/a\\u003e\"],\"CodeForces-385D\":[\"Bear and Floodlight\",875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/385\\\"\\u003eCodeforces Round 226 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1618G\":[\"Trader Problem\",1545,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1618\\\"\\u003eCodeforces Round 760 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1848D\":[\"Vika and Bonuses\",2524,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1848\\\"\\u003eCodeforces Round 885 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-819A\":[\"Mister B and Boring Game\",297,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/819\\\"\\u003eCodeforces Round 421 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-916D\":[\"Jamie and To-do List\",544,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/916\\\"\\u003eCodeforces Round 457 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1800G\":[\"Symmetree\",1979,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1800\\\"\\u003eCodeforces Round 855 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1921G\":[\"Mischievous Shooter\",1122,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1921\\\"\\u003eCodeforces Round 920 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-903F\":[\"Clear The Matrix\",701,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-903D\":[\"Almost Difference\",4009,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-903E\":[\"Swapping Characters\",1336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-73D\":[\"FreeDiv\",678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/73\\\"\\u003eCodeforces Beta Round 66\\u003c/a\\u003e\"],\"CodeForces-915D\":[\"Almost Acyclic Graph\",3664,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-926H\":[\"Endless Roses Most Beautiful\",205,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/926\\\"\\u003eVK Cup 2018 - Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-1196F\":[\"K-th Path\",2524,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1196\\\"\\u003eCodeforces Round 575 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-70C\":[\"Lucky Tickets\",622,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/70\\\"\\u003eCodeforces Beta Round 64\\u003c/a\\u003e\"],\"CodeForces-590C\":[\"Three States\",2885,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/590\\\"\\u003eCodeforces Round 327 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-274D\":[\"Lovely Matrix\",1157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/274\\\"\\u003eCodeforces Round 168 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-153C\":[\"Caesar Cipher\",358,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/153\\\"\\u003eSurprise Language Round 5\\u003c/a\\u003e\"],\"CodeForces-165E\":[\"Compatible Numbers\",6999,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/165\\\"\\u003eCodeforces Round 112 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1737D\":[\"Ela and the Wiring Wizard\",1860,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1737\\\"\\u003eDytechlab Cup 2022\\u003c/a\\u003e\"],\"CodeForces-1858D\":[\"Trees and Segments\",2718,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1858\\\"\\u003eCodeforces Round 893 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-286B\":[\"Shifting\",1161,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/286\\\"\\u003eCodeforces Round 176 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1616E\":[\"Lexicographically Small Enough\",2404,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1616\\\"\\u003eGood Bye 2021: 2022 is NEAR\\u003c/a\\u003e\"],\"CodeForces-1909F1\":[\"Small Permutation Problem (Easy Version)\",1613,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1909\\\"\\u003ePinely Round 3 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-901B\":[\"GCD of Polynomials\",1405,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/901\\\"\\u003eCodeforces Round 453 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-71E\":[\"Nuclear Fusion\",732,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/71\\\"\\u003eCodeforces Beta Round 65 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-71D\":[\"Solitaire\",667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/71\\\"\\u003eCodeforces Beta Round 65 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-52C\":[\"Circular RMQ\",9601,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/52\\\"\\u003eCodeforces Testing Round 1\\u003c/a\\u003e\"],\"CodeForces-245G\":[\"Suggested Friends\",512,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/245\\\"\\u003eCROC-MBTU 2012, Elimination Round (ACM-ICPC)\\u003c/a\\u003e\"],\"CodeForces-354E\":[\"Lucky Number Representation\",907,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/354\\\"\\u003eCodeforces Round 206 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-366E\":[\"Dima and Magic Guitar\",813,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/366\\\"\\u003eCodeforces Round 214 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1926F\":[\"Vlad and Avoiding X\",1460,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1926\\\"\\u003eCodeforces Round 928 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-257E\":[\"Greedy Elevator\",295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/257\\\"\\u003eCodeforces Round 159 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-76A\":[\"Gift\",1735,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/76\\\"\\u003eAll-Ukrainian School Olympiad in Informatics\\u003c/a\\u003e\"],\"CodeForces-1938E\":[\"Duplicates\",849,\"\\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-1543D2\":[\"RPD and Rap Sheet (Hard Version)\",1955,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1543\\\"\\u003eCodeforces Round 730 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1045G\":[\"AI robots\",1607,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1045\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-1045D\":[\"Interstellar battle\",682,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1045\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-1166D\":[\"Cute Sequences\",2052,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1166\\\"\\u003eCodeforces Round 561 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1154G\":[\"Minimum Possible LCM\",2813,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1154\\\"\\u003eCodeforces Round 552 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-64G\":[\"Path Canonization\",116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/64\\\"\\u003eUnknown Language Round 1\\u003c/a\\u003e\"],\"CodeForces-1216E2\":[\"Numerical Sequence (hard version)\",1565,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1216\\\"\\u003eCodeforces Round 587 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-65D\":[\"Harry Potter and the Sorting Hat\",451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/65\\\"\\u003eCodeforces Beta Round 60\\u003c/a\\u003e\"],\"CodeForces-1092D2\":[\"Great Vova Wall (Version 2)\",3015,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1092\\\"\\u003eCodeforces Round 527 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1092D1\":[\"Great Vova Wall (Version 1)\",4846,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1092\\\"\\u003eCodeforces Round 527 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-353E\":[\"Antichain\",670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/353\\\"\\u003eCodeforces Round 205 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1901E\":[\"Compressed Tree\",1362,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1901\\\"\\u003eEducational Codeforces Round 158 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-377C\":[\"Captains Mode\",1206,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/377\\\"\\u003eCodeforces Round 222 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-908D\":[\"New Year and Arbitrary Arrangement\",2432,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"CodeForces-1153E\":[\"Serval and Snake\",1504,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1153\\\"\\u003eCodeforces Round 551 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-486E\":[\"LIS of Sequence\",2254,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/486\\\"\\u003eCodeforces Round 277 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-691F\":[\"Couple Cover\",1371,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/691\\\"\\u003eEducational Codeforces Round 14\\u003c/a\\u003e\"],\"CodeForces-86B\":[\"Tetris revisited\",417,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"CodeForces-86D\":[\"Powerful array\",14626,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"CodeForces-461C\":[\"Appleman and a Sheet of Paper\",1383,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/461\\\"\\u003eCodeforces Round 263 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1912E\":[\"Evaluate It and Back Again\",770,\"\\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-255E\":[\"Furlo and Rublo and Game\",878,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/255\\\"\\u003eCodeforces Round 156 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-98B\":[\"Help King\",117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/98\\\"\\u003eCodeforces Beta Round 78 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-243C\":[\"Colorado Potato Beetle\",552,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/243\\\"\\u003eCodeforces Round 150 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-364B\":[\"Free Market\",1280,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/364\\\"\\u003eCodeforces Round 213 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1815C\":[\"Between\",1864,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1815\\\"\\u003eCodeforces Round 865 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-134C\":[\"Swaps\",563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/134\\\"\\u003eCodeforces Testing Round 3\\u003c/a\\u003e\"],\"CodeForces-279D\":[\"The Minimum Number of Variables\",751,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/279\\\"\\u003eCodeforces Round 171 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-690C3\":[\"Brain Network (hard)\",934,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/690\\\"\\u003eHelvetic Coding Contest 2016 online mirror (teams, unrated)\\u003c/a\\u003e\"],\"CodeForces-1227F1\":[\"Wrong Answer on test 233 (Easy Version)\",1791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1227\\\"\\u003eTechnocup 2020 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1140E\":[\"Palindrome-less Arrays\",1986,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1140\\\"\\u003eEducational Codeforces Round 62 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1808E1\":[\"Minibuses on Venus (easy version)\",1262,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1808\\\"\\u003eCodeforces Round 861 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-570D\":[\"Tree Requests\",7493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/570\\\"\\u003eCodeforces Round 316 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-178F2\":[\"Representative Sampling\",326,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-351E\":[\"Jeff and Permutation\",1679,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/351\\\"\\u003eCodeforces Round 204 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-387E\":[\"George and Cards\",904,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/387\\\"\\u003eCodeforces Round 227 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-387D\":[\"George and Interesting Graph\",1047,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/387\\\"\\u003eCodeforces Round 227 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1717E\":[\"Madoka and The Best University\",2508,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1717\\\"\\u003eCodeforces Round 818 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-809B\":[\"Glad to see you!\",1477,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/809\\\"\\u003eCodeforces Round 415 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-906B\":[\"Seating of Students\",1234,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/906\\\"\\u003eCodeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-1175E\":[\"Minimal Segment Cover\",3597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1175\\\"\\u003eEducational Codeforces Round 66 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1272F\":[\"Two Bracket Sequences\",1855,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1272\\\"\\u003eCodeforces Round 605 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-593C\":[\"Beautiful Function\",306,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/593\\\"\\u003eCodeforces Round 329 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-51D\":[\"Geometrical problem\",490,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/51\\\"\\u003eCodeforces Beta Round 48\\u003c/a\\u003e\"],\"CodeForces-1526D\":[\"Kill Anton\",2391,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1526\\\"\\u003eCodeforces Round 723 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1659E\":[\"AND-MEX Walk\",1483,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1659\\\"\\u003eCodeforces Round 782 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1635E\":[\"Cars\",2252,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1635\\\"\\u003eCodeforces Round 772 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-431E\":[\"Chemistry Experiment\",935,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/431\\\"\\u003eCodeforces Round 247 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-225D\":[\"Snake\",1022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/225\\\"\\u003eCodeforces Round 139 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-346C\":[\"Number Transformation II\",1466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/346\\\"\\u003eCodeforces Round 201 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1841E\":[\"Fill the Matrix\",1930,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1841\\\"\\u003eEducational Codeforces Round 150 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-661G\":[\"Hungarian Notation\",50,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/661\\\"\\u003eVK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror)\\u003c/a\\u003e\"],\"CodeForces-1428E\":[\"Carrots for Rabbits\",3576,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1428\\\"\\u003eCodeforces Raif Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1537F\":[\"Figure Fixing\",2392,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1537\\\"\\u003eCodeforces Round 726 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1646E\":[\"Power Board\",2361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1646\\\"\\u003eCodeforces Round 774 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-345G\":[\"Suffix Subgroup\",51,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/345\\\"\\u003eFriday the 13th, Programmers Day\\u003c/a\\u003e\"],\"CodeForces-345D\":[\"Chain Letter\",76,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/345\\\"\\u003eFriday the 13th, Programmers Day\\u003c/a\\u003e\"],\"CodeForces-115C\":[\"Plumber\",619,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/115\\\"\\u003eCodeforces Beta Round 87 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-369E\":[\"Valera and Queries\",2260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/369\\\"\\u003eCodeforces Round 216 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-369D\":[\"Valera and Fools\",1201,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/369\\\"\\u003eCodeforces Round 216 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1622E\":[\"Math Test\",1877,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1622\\\"\\u003eEducational Codeforces Round 120 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1840F\":[\"Railguns\",1723,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1840\\\"\\u003eCodeforces Round 878 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-575B\":[\"Bribes\",1077,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/575\\\"\\u003eBubble Cup 8 - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-587C\":[\"Duff in the Army\",4063,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/587\\\"\\u003eCodeforces Round 326 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-551C\":[\"GukiZ hates Boxes\",3990,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/551\\\"\\u003eCodeforces Round 307 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-575G\":[\"Run for beer\",945,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/575\\\"\\u003eBubble Cup 8 - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-1415E\":[\"New Game Plus!\",2629,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1415\\\"\\u003eTechnocup 2021 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1500B\":[\"Two chandeliers\",2023,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1500\\\"\\u003eCodeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"CodeForces-1657E\":[\"Star MST\",2009,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1657\\\"\\u003eEducational Codeforces Round 125 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1867E2\":[\"Salyg1n and Array (hard version)\",3007,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1867\\\"\\u003eCodeforces Round 897 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-332C\":[\"Students\\u0027 Revenge\",1026,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/332\\\"\\u003eCodeforces Round 193 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-453C\":[\"Little Pony and Summer Sun Celebration\",1679,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/453\\\"\\u003eCodeforces Round 259 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1822G2\":[\"Magic Triples (Hard Version)\",2324,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1822\\\"\\u003eCodeforces Round 867 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-138C\":[\"Mushroom Gnomes - 2\",906,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/138\\\"\\u003eCodeforces Beta Round 99 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1730D\":[\"Prefixes and Suffixes\",2632,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1730\\\"\\u003eCodeforces Round 823 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-550E\":[\"Brackets in Implications\",1505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/550\\\"\\u003eCodeforces Round 306 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1438D\":[\"Powerful Ksenia\",4182,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1438\\\"\\u003eCodeforces Round 682 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1559E\":[\"Mocha and Stars\",2253,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1559\\\"\\u003eCodeforces Round 738 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1777E\":[\"Edge Reverse\",1714,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1777\\\"\\u003eCodeforces Round 845 (Div. 2) and ByteRace 2023\\u003c/a\\u003e\"],\"CodeForces-1898E\":[\"Sofia and Strings\",2040,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1898\\\"\\u003eCodeforces Round 910 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1305E\":[\"Kuroni and the Score Distribution\",2971,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1305\\\"\\u003eOzon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!)\\u003c/a\\u003e\"],\"CodeForces-1535E\":[\"Gold Transfer\",2672,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1535\\\"\\u003eEducational Codeforces Round 110 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1656E\":[\"Equal Tree Sums\",3323,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1656\\\"\\u003eCodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-440D\":[\"Berland Federalization\",725,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/440\\\"\\u003eTesting Round 10\\u003c/a\\u003e\"],\"CodeForces-1789D\":[\"Serval and Shift-Shift-Shift\",1577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1789\\\"\\u003eCodeforces Round 853 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-113C\":[\"Double Happiness\",1315,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/113\\\"\\u003eCodeforces Beta Round 86 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-125D\":[\"Two progressions\",443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/125\\\"\\u003eCodeforces Testing Round 2\\u003c/a\\u003e\"],\"CodeForces-1811G2\":[\"Vlad and the Nice Paths (hard version)\",1657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1811\\\"\\u003eCodeforces Round 863 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-958E2\":[\"Guard Duty (medium)\",958,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/958\\\"\\u003eHelvetic Coding Contest 2018 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1208E\":[\"Let Them Slide\",2067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1208\\\"\\u003eManthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1741G\":[\"Kirill and Company\",1462,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1741\\\"\\u003eCodeforces Round 826 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1765H\":[\"Hospital Queue\",1188,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"CodeForces-1765F\":[\"Chemistry Lab\",588,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"CodeForces-1769D2\":[\"Игра в Девятку II\",185,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1769\\\"\\u003eVK Cup 2022 - Квалификация (Engine)\\u003c/a\\u003e\"],\"CodeForces-476E\":[\"Dreamoon and Strings\",1820,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/476\\\"\\u003eCodeforces Round 272 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-958B2\":[\"Maximum Control (medium)\",646,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/958\\\"\\u003eHelvetic Coding Contest 2018 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1736D\":[\"Equal Binary Subsequences\",2405,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1736\\\"\\u003eCodeforces Round 825 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1615D\":[\"X(or)-mas Tree\",1884,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1615\\\"\\u003eCodeforces Global Round 18\\u003c/a\\u003e\"],\"CodeForces-1627E\":[\"Not Escaping\",2285,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1627\\\"\\u003eCodeforces Round 766 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1097D\":[\"Makoto and a Blackboard\",2716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1097\\\"\\u003eHello 2019\\u003c/a\\u003e\"],\"CodeForces-1194E\":[\"Count The Rectangles\",1837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1194\\\"\\u003eEducational Codeforces Round 68 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-883A\":[\"Automatic Door\",599,\"\\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-653D\":[\"Delivery Bears\",2836,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/653\\\"\\u003eIndiaHacks 2016 - Online Edition (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-520E\":[\"Pluses everywhere\",1946,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/520\\\"\\u003eCodeforces Round 295 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-762E\":[\"Radio stations\",1397,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"CodeForces-774H\":[\"Repairing Of String\",259,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/774\\\"\\u003eVK Cup 2017 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-980E\":[\"The Number Games\",2052,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/980\\\"\\u003eCodeforces Round 480 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1505F\":[\"Math\",1484,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1505\\\"\\u003eApril Fools Day Contest 2021\\u003c/a\\u003e\"],\"CodeForces-1832E\":[\"Combinatorics Problem\",2076,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1832\\\"\\u003eEducational Codeforces Round 148 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-301D\":[\"Yaroslav and Divisors\",2487,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/301\\\"\\u003eCodeforces Round 182 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-337E\":[\"Divisor Tree\",1098,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/337\\\"\\u003eCodeforces Round 196 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1505I\":[\"Mysterious language again, seriously?\",539,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1505\\\"\\u003eApril Fools Day Contest 2021\\u003c/a\\u003e\"],\"CodeForces-1181D\":[\"Irrigation\",2122,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1181\\\"\\u003eCodeforces Round 567 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-555C\":[\"Case of Chocolate\",2071,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/555\\\"\\u003eCodeforces Round 310 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-567E\":[\"President and Roads\",1856,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/567\\\"\\u003eCodeforces Round #Pi (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-785E\":[\"Anton and Permutation\",1977,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/785\\\"\\u003eCodeforces Round 404 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-894D\":[\"Ralph And His Tour in Binary Country\",1163,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/894\\\"\\u003eCodeforces Round 447 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-773C\":[\"Prairie Partition\",950,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/773\\\"\\u003eVK Cup 2017 - Round 3\\u003c/a\\u003e\"],\"CodeForces-1407D\":[\"Discrete Centrifugal Jumps\",4756,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1407\\\"\\u003eCodeforces Round 669 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1184B2\":[\"The Doctor Meets Vader (Medium)\",560,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1184\\\"\\u003eHelvetic Coding Contest 2019 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1537E2\":[\"Erase and Extend (Hard Version)\",5091,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1537\\\"\\u003eCodeforces Round 726 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1515E\":[\"Phoenix and Computers\",3414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1515\\\"\\u003eCodeforces Global Round 14\\u003c/a\\u003e\"],\"CodeForces-1503C\":[\"Travelling Salesman Problem\",3233,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1503\\\"\\u003eCodeforces Round 712 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1854B\":[\"Earn or Unlock\",3321,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1854\\\"\\u003eCodeforces Round 889 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-420D\":[\"Cup Trick\",790,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/420\\\"\\u003eCoder-Strike 2014 - Finals (online edition, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1406D\":[\"Three Sequences\",3485,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1406\\\"\\u003eCodeforces Round 670 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-323B\":[\"Tournament-graph\",383,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/323\\\"\\u003eTesting Round 7\\u003c/a\\u003e\"],\"CodeForces-105C\":[\"Item World\",274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/105\\\"\\u003eCodeforces Beta Round 81\\u003c/a\\u003e\"],\"CodeForces-1721E\":[\"Prefix Function Queries\",1868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1721\\\"\\u003eEducational Codeforces Round 134 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1184C2\":[\"Heidi and the Turing Test (Medium)\",630,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1184\\\"\\u003eHelvetic Coding Contest 2019 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1070A\":[\"Find a Number\",2456,\"\\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-553C\":[\"Love Triangles\",1848,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/553\\\"\\u003eCodeforces Round 309 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-662B\":[\"Graph Coloring\",1479,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/662\\\"\\u003eCROC 2016 - Final Round [Private, For Onsite Finalists Only]\\u003c/a\\u003e\"],\"CodeForces-650C\":[\"Table Compression\",2041,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/650\\\"\\u003eCodeforces Round 345 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1336C\":[\"Kaavi and Magic Spell\",3478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1336\\\"\\u003eCodeforces Round 635 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1227E\":[\"Arson In Berland Forest\",1450,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1227\\\"\\u003eTechnocup 2020 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-28C\":[\"Bath Queue\",1154,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/28\\\"\\u003eCodeforces Beta Round 28 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1772G\":[\"Gaining Rating\",1284,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1772\\\"\\u003eCodeforces Round 839 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1215E\":[\"Marbles\",3076,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1215\\\"\\u003eCodeforces Round 585 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-427D\":[\"Match \\u0026 Catch\",2309,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/427\\\"\\u003eCodeforces Round 244 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1542D\":[\"Priority Queue\",2597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1542\\\"\\u003eCodeforces Round 729 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1784C\":[\"Monsters (hard version)\",1514,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1784\\\"\\u003eVK Cup 2022 - Финальный раунд (Engine)\\u003c/a\\u003e\"],\"CodeForces-754C\":[\"Vladik and chat\",977,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/754\\\"\\u003eCodeforces Round 390 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-645E\":[\"Intellectual Inquiry\",1283,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/645\\\"\\u003eCROC 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-875D\":[\"High Cry\",2058,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/875\\\"\\u003eCodeforces Round 441 (Div. 1, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-730E\":[\"Award Ceremony\",746,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/730\\\"\\u003e2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-863F\":[\"Almost Permutation\",1307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"CodeForces-730D\":[\"Running Over The Bridges\",711,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/730\\\"\\u003e2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1468A\":[\"LaIS\",1635,\"\\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-1117E\":[\"Decypher the String\",1484,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1117\\\"\\u003eEducational Codeforces Round 60 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1238E\":[\"Keyboard Purchase\",3117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1238\\\"\\u003eEducational Codeforces Round 74 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-402E\":[\"Strictly Positive Matrix\",2256,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/402\\\"\\u003eCodeforces Round 236 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-305D\":[\"Olya and Graph\",473,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/305\\\"\\u003eCodeforces Round 184 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1105E\":[\"Helping Hiasat\",1667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1105\\\"\\u003eCodeforces Round 533 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1238F\":[\"The Maximum Subtree\",1764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1238\\\"\\u003eEducational Codeforces Round 74 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1650F\":[\"Vitaly and Advanced Useless Algorithms\",1427,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1650\\\"\\u003eCodeforces Round 776 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1795E\":[\"Explosions?\",1946,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1795\\\"\\u003eEducational Codeforces Round 143 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1335F\":[\"Robots on a Grid\",2025,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1335\\\"\\u003eCodeforces Round 634 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1311E\":[\"Construct the Binary Tree\",2263,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1311\\\"\\u003eCodeforces Round 624 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1468H\":[\"K and Medians\",1760,\"\\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-547A\":[\"Mike and Frog\",2391,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/547\\\"\\u003eCodeforces Round 305 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-559C\":[\"Gerald and Giant Chess\",6870,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/559\\\"\\u003eCodeforces Round 313 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-765E\":[\"Tree Folding\",1322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/765\\\"\\u003eCodeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-620D\":[\"Professor GukiZ and Two Arrays\",1793,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/620\\\"\\u003eEducational Codeforces Round 6\\u003c/a\\u003e\"],\"CodeForces-850C\":[\"Arpa and a game with Mojtaba\",1541,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/850\\\"\\u003eCodeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017)\\u003c/a\\u003e\"],\"CodeForces-413E\":[\"Maze 2D\",726,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/413\\\"\\u003eCoder-Strike 2014 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1552F\":[\"Telepanting\",2820,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1552\\\"\\u003eCodeforces Global Round 15\\u003c/a\\u003e\"],\"CodeForces-1225E\":[\"Rock Is Push\",1845,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1225\\\"\\u003eTechnocup 2020 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1249F\":[\"Maximum Weight Subset\",2216,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1249\\\"\\u003eCodeforces Round 595 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-219E\":[\"Parking Lot\",628,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/219\\\"\\u003eCodeforces Round 135 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-425B\":[\"Sereja and Table\",1375,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/425\\\"\\u003eCodeforces Round 243 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1467D\":[\"Sum of Paths\",3635,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1467\\\"\\u003eCodeforces Round 695 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1334E\":[\"Divisor Paths\",2649,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1334\\\"\\u003eEducational Codeforces Round 85 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-7D\":[\"Palindrome Degree\",4048,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/7\\\"\\u003eCodeforces Beta Round 7\\u003c/a\\u003e\"],\"CodeForces-679B\":[\"Bear and Tower of Cubes\",2238,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/679\\\"\\u003eCodeforces Round 356 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1333F\":[\"Kate and imperfection\",4023,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1333\\\"\\u003eCodeforces Round 632 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1575G\":[\"GCD Festival\",658,\"\\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-1672E\":[\"notepad.exe\",2099,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1672\\\"\\u003eCodeforces Global Round 20\\u003c/a\\u003e\"],\"CodeForces-27D\":[\"Ring Road 2\",2586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/27\\\"\\u003eCodeforces Beta Round 27 (Codeforces format, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-448E\":[\"Divisors\",1567,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/448\\\"\\u003eCodeforces Round 256 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1551F\":[\"Equidistant Vertices\",1795,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1551\\\"\\u003eCodeforces Round 734 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1575H\":[\"Holiday Wall Ornaments\",575,\"\\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-1399E2\":[\"Weights Division (hard version)\",2242,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1399\\\"\\u003eCodeforces Round 661 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1575K\":[\"Knitting Batik\",640,\"\\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-678E\":[\"Another Sith Tournament\",2057,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/678\\\"\\u003eEducational Codeforces Round 13\\u003c/a\\u003e\"],\"CodeForces-981E\":[\"Addition on Segments\",2114,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/981\\\"\\u003eAvito Code Challenge 2018\\u003c/a\\u003e\"],\"CodeForces-1788E\":[\"Sum Over Zero\",2506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1788\\\"\\u003eCodeforces Round 851 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1328F\":[\"Make k Equal\",3080,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1328\\\"\\u003eCodeforces Round 629 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1437E\":[\"Make It Increasing\",3506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1437\\\"\\u003eEducational Codeforces Round 97 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1425E\":[\"Excitation of Atoms\",940,\"\\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-1776B\":[\"Vittorio Plays with LEGO Bricks\",1247,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1776\\\"\\u003eSWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-746F\":[\"Music in Car\",833,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/746\\\"\\u003eCodeforces Round 386 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-855E\":[\"Salazar Slytherin\\u0027s Locket\",1773,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-952G\":[\"Puzzling Language\",225,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/952\\\"\\u003eApril Fools Contest 2018\\u003c/a\\u003e\"],\"CodeForces-1327D\":[\"Infinite Path\",3094,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1327\\\"\\u003eEducational Codeforces Round 84 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1557D\":[\"Ezzat and Grid\",2496,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1557\\\"\\u003eCodeforces Round 737 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1666I\":[\"Interactive Treasure Hunt\",1441,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1666\\\"\\u003e2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1303E\":[\"Erase Subsequences\",2644,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1303\\\"\\u003eEducational Codeforces Round 82 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1630C\":[\"Paint the Middle\",2868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1630\\\"\\u003eCodeforces Round 768 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1666F\":[\"Fancy Stack\",1123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1666\\\"\\u003e2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1763E\":[\"Node Pairs\",1718,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1763\\\"\\u003eCodeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT\\u003c/a\\u003e\"],\"CodeForces-406D\":[\"Hill Climbing\",1217,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/406\\\"\\u003eCodeforces Round 238 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1860D\":[\"Balanced String\",2799,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1860\\\"\\u003eEducational Codeforces Round 153 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1400E\":[\"Clear the Multiset\",5394,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1400\\\"\\u003eEducational Codeforces Round 94 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1763D\":[\"Valid Bitonic Permutations\",2005,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1763\\\"\\u003eCodeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT\\u003c/a\\u003e\"],\"CodeForces-757D\":[\"Felicity\\u0027s Big Secret Revealed\",1399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/757\\\"\\u003eCodecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1424M\":[\"Ancient Language\",541,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1424\\\"\\u003eBubble Cup 13 - Finals [Online Mirror, unrated, Div. 2]\\u003c/a\\u003e\"],\"CodeForces-612E\":[\"Square Root of Permutation\",1718,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/612\\\"\\u003eEducational Codeforces Round 4\\u003c/a\\u003e\"],\"CodeForces-733F\":[\"Drivers Dissatisfaction\",1252,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/733\\\"\\u003eCodeforces Round 378 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-191E\":[\"Thwarting Demonstrations\",903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/191\\\"\\u003eCodeforces Round 121 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1338C\":[\"Perfect Triples\",2985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1338\\\"\\u003eCodeforces Round 633 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1520G\":[\"To Go Or Not To Go?\",3657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1520\\\"\\u003eCodeforces Round 719 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1641C\":[\"Anonymity Is Important\",2343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1641\\\"\\u003eCodeforces Round 773 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1556E\":[\"Equilibrium\",2543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1556\\\"\\u003eDeltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-429D\":[\"Tricky Function\",2867,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/429\\\"\\u003eCodeforces Round 245 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-756C\":[\"Nikita and stack\",1326,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/756\\\"\\u003e8VC Venture Cup 2017 - Final Round\\u003c/a\\u003e\"],\"CodeForces-768D\":[\"Jon and Orbs\",3000,\"\\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-526D\":[\"Om Nom and Necklace\",2289,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/526\\\"\\u003eZeptoLab Code Rush 2015\\u003c/a\\u003e\"],\"CodeForces-538E\":[\"Demiurges Play Again\",1554,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/538\\\"\\u003eCodeforces Round 300\\u003c/a\\u003e\"],\"CodeForces-538F\":[\"A Heap of Heaps\",1653,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/538\\\"\\u003eCodeforces Round 300\\u003c/a\\u003e\"],\"CodeForces-514E\":[\"Darth Vader and Tree\",1490,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/514\\\"\\u003eCodeforces Round 291 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-962E\":[\"Byteland, Berland and Disputed Cities\",1071,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/962\\\"\\u003eEducational Codeforces Round 42 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1178F1\":[\"Short Colorful Strip\",2092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1178\\\"\\u003eCodeforces Global Round 4\\u003c/a\\u003e\"],\"CodeForces-404E\":[\"Maze 1D\",619,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/404\\\"\\u003eCodeforces Round 237 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1579G\":[\"Minimal Coverage\",2424,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1579\\\"\\u003eCodeforces Round 744 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1567E\":[\"Non-Decreasing Dilemma\",3675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1567\\\"\\u003eCodeforces Round 742 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-19C\":[\"Deletion of Repeats\",1177,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/19\\\"\\u003eCodeforces Beta Round 19\\u003c/a\\u003e\"],\"CodeForces-1384B2\":[\"Koa and the Beach (Hard Version)\",2509,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1384\\\"\\u003eCodeforces Round 659 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1773B\":[\"BinCoin\",728,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1773\\\"\\u003e2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-549C\":[\"The Game Of Parity\",1916,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/549\\\"\\u003eLooksery Cup 2015\\u003c/a\\u003e\"],\"CodeForces-549G\":[\"Happy Line\",2754,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/549\\\"\\u003eLooksery Cup 2015\\u003c/a\\u003e\"],\"CodeForces-731D\":[\"80-th Level Archeology\",1221,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/731\\\"\\u003eCodeforces Round 376 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-743E\":[\"Vladik and cards\",1646,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/743\\\"\\u003eCodeforces Round 384 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-622E\":[\"Ants in Leaves\",2089,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/622\\\"\\u003eEducational Codeforces Round 7\\u003c/a\\u003e\"],\"CodeForces-852F\":[\"Product transformation\",552,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/852\\\"\\u003eBubble Cup X - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-731E\":[\"Funny Game\",1493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/731\\\"\\u003eCodeforces Round 376 (Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1711958995000,"title":"CodeForces rating 2200 题目集","dislikeCnt":0,"content":"[problem:CodeForces-86D] Powerful array数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-52C] Circular rmq数据结构(data structures \n[problem:CodeForces-617E] Xor and favorite number数据结构(data structures \n[problem:CodeForces-570D] Tree requests二分搜索(binary search) 位掩码(bitmasks), 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-559C] Gerald and giant chess组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-165E] Compatible numbers位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 动态规划(dp\n[problem:CodeForces-628D] Magic numbers动态规划(dp \n[problem:CodeForces-1400E] Clear the multiset数据结构(data structures) 分治算法(divide and conquer), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1537E2] Erase and extend (hard version)二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 哈希表(hashing), 字符串后缀结构(string suffix structures), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1485D] Multiples and power differences构造算法(constructive algorithms) 图论(graphs), 数学(math), 数论(number theory\n[problem:CodeForces-1407D] Discrete centrifugal jumps数据结构(data structures) 动态规划(dp), 图论(graphs\n[problem:CodeForces-833B] The bakery二分搜索(binary search) 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-1092D1] Great vova wall (version 1)贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-11D] A simple task位掩码(bitmasks) 动态规划(dp), 图论(graphs\n[problem:CodeForces-1438D] Powerful ksenia位掩码(bitmasks) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-13C] Sequence动态规划(dp) 排序算法(sortings\n[problem:CodeForces-1333F] Kate and imperfection贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1474D] Cleaning数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1110E] Magic stones构造算法(constructive algorithms) 数学(math), 排序算法(sortings\n[problem:CodeForces-903D] Almost difference数据结构(data structures) 数学(math\n[problem:CodeForces-587C] Duff in the army数据结构(data structures) 树形结构(trees\n[problem:CodeForces-1470D] Strange housing构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图匹配(graph matchings), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1467D] Sum of paths组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1156D] 0-1-tree深度优先搜索及其变种(dfs and similar) 分治算法(divide and conquer), 动态规划(dp), 并查集(dsu), 树形结构(trees\n[problem:CodeForces-1567E] Non-decreasing dilemma数据结构(data structures) 分治算法(divide and conquer), 数学(math\n[problem:CodeForces-1428E] Carrots for rabbits二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-7D] Palindrome degree哈希表(hashing) 字符串处理(strings\n[problem:CodeForces-1520G] To go or not to go?暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-280C] Game on tree实现问题,编程技巧,模拟(implementation) 数学(math), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-551C] Gukiz hates boxes二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-1406D] Three sequences构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1515E] Phoenix and computers组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-282E] Sausage maximization位掩码(bitmasks) 数据结构(data structures), 树形结构(trees\n[problem:CodeForces-1437E] Make it increasing二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1336C] Kaavi and magic spell动态规划(dp) 字符串处理(strings\n[problem:CodeForces-1656E] Equal tree sums构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 数学(math), 树形结构(trees\n[problem:CodeForces-1854B] Earn or unlock位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp\n[problem:CodeForces-915D] Almost acyclic graph深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1110D] Jongmah动态规划(dp \n[problem:CodeForces-1503C] Travelling salesman problem二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 最短路算法(shortest paths), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1175E] Minimal segment cover数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1389E] Calendar ambiguity数学(math) 数论(number theory\n[problem:CodeForces-1353F] Decreasing heights暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-1327D] Infinite path暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 数学(math), 数论(number theory\n[problem:CodeForces-1338C] Perfect triples位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 分治算法(divide and conquer), 数学(math\n[problem:CodeForces-1328F] Make k equal贪心策略(greedy \n[problem:CodeForces-1867E2] Salyg1n and array (hard version)构造算法(constructive algorithms) 交互性问题(interactive\n[problem:CodeForces-1215E] Marbles位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-1520F2] Guess the k-th zero (hard version)二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 交互性问题(interactive\n[problem:CodeForces-1305E] Kuroni and the score distribution构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1630C] Paint the middle动态规划(dp) 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1092D2] Great vova wall (version 2)数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1486E] Paired payment二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 动态规划(dp), 流(flows), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1552F] Telepanting二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 排序算法(sortings\n[problem:CodeForces-1114E] Arithmetic progression二分搜索(binary search) 交互性问题(interactive), 数论(number theory), 概率论(probabilities\n[problem:CodeForces-1156E] Special segments of permutation数据结构(data structures) 分治算法(divide and conquer), 并查集(dsu), 双指针算法(two pointers\n[problem:CodeForces-1860D] Balanced string动态规划(dp \n[problem:CodeForces-768D] Jon and orbs动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-1238E] Keyboard purchase位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-1373E] Sum of digits暴力枚举(brute force) 构造算法(constructive algorithms), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-839D] Winter is here组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1806E] Tree master暴力枚举(brute force) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1858D] Trees and segments暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1037E] Trips图论(graphs \n[problem:CodeForces-616E] Sum of remainders实现问题,编程技巧,模拟(implementation) 数学(math), 数论(number theory\n[problem:CodeForces-1535E] Gold transfer二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 交互性问题(interactive), 树形结构(trees\n[problem:CodeForces-1253E] Antenna coverage数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1154G] Minimum possible lcm暴力枚举(brute force) 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-590C] Three states深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1334E] Divisor paths组合数学(combinatorics) 图论(graphs), 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-1730D] Prefixes and suffixes构造算法(constructive algorithms) 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1415E] New game plus!构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-429D] Tricky function数据结构(data structures) 分治算法(divide and conquer), 计算几何(geometry\n[problem:CodeForces-707D] Persistent bookcase位掩码(bitmasks) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1097D] Makoto and a blackboard动态规划(dp) 数学(math), 数论(number theory), 概率论(probabilities\n[problem:CodeForces-1220E] Tourism深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1059D] Nature reserve二分搜索(binary search) 计算几何(geometry), 三分搜索(ternary search\n[problem:CodeForces-1542D] Priority queue组合数学(combinatorics) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 三分搜索(ternary search\n[problem:CodeForces-1303E] Erase subsequences动态规划(dp) 字符串处理(strings\n[problem:CodeForces-1556E] Equilibrium数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1848D] Vika and bonuses二分搜索(binary search) 暴力枚举(brute force), 数学(math), 三分搜索(ternary search\n[problem:CodeForces-1557D] Ezzat and grid数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1717E] Madoka and the best university数学(math) 数论(number theory\n[problem:CodeForces-1384B2] Koa and the beach (hard version)构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1788E] Sum over zero数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp\n[problem:CodeForces-505D] Mr. kitayuta\u0027s technology深度优先搜索及其变种(dfs and similar \n[problem:CodeForces-549G] Happy line构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1736D] Equal binary subsequences构造算法(constructive algorithms) 计算几何(geometry), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1616E] Lexicographically small enough暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-27D] Ring road 2二分图可满足性问题(2-sat) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1537F] Figure fixing构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1526D] Kill anton暴力枚举(brute force) 构造算法(constructive algorithms), 数据结构(data structures), 数学(math), 字符串处理(strings\n[problem:CodeForces-1234F] Yet another substring reverse位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-592D] Super m深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1168C] And reachability位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-547A] Mike and frog暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-653D] Delivery bears二分搜索(binary search) 流(flows), 图论(graphs\n[problem:CodeForces-1641C] Anonymity is important二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 并查集(dsu), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1196F] K-th path暴力枚举(brute force) 构造算法(constructive algorithms), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-1295E] Permutation separation数据结构(data structures) 分治算法(divide and conquer\n[problem:CodeForces-1646E] Power board暴力枚举(brute force) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1100E] Andrew and taxi二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-813E] Army creation二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-1070A] Find a number动态规划(dp) 图论(graphs), 数论(number theory), 最短路算法(shortest paths\n[problem:CodeForces-1579G] Minimal coverage动态规划(dp \n[problem:CodeForces-1498D] Bananas in a microwave深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-908D] New year and arbitrary arrangement动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-1822G2] Magic triples (hard version)暴力枚举(brute force) 数据结构(data structures), 数学(math), 数论(number theory\n[problem:CodeForces-1559E] Mocha and stars组合数学(combinatorics) 动态规划(dp), 快速傅里叶变换(fft), 数学(math), 数论(number theory\n[problem:CodeForces-1627E] Not escaping数据结构(data structures) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths), 双指针算法(two pointers\n[problem:CodeForces-56E] Domino principle二分搜索(binary search) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-1704E] Count seconds暴力枚举(brute force) 构造算法(constructive algorithms), 动态规划(dp), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1399E2] Weights division (hard version)二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1477C] Nezzar and nice beatmap构造算法(constructive algorithms) 计算几何(geometry), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1840G1] In search of truth (easy version)构造算法(constructive algorithms) 交互性问题(interactive), 数学(math), Meet-in-the-middle算法(meet-in-the-middle), 概率论(probabilities\n[problem:CodeForces-301D] Yaroslav and divisors数据结构(data structures \n[problem:CodeForces-1398E] Two types of spells二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-1583E] Moment of bloom构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图匹配(graph matchings), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1635E] Cars二分图可满足性问题(2-sat) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-25E] Test哈希表(hashing) 字符串处理(strings\n[problem:CodeForces-679B] Bear and tower of cubes二分搜索(binary search) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1311E] Construct the binary tree暴力枚举(brute force) 构造算法(constructive algorithms), 树形结构(trees\n[problem:CodeForces-526D] Om nom and necklace哈希表(hashing) 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-427D] Match \u0026 catch动态规划(dp) 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-402E] Strictly positive matrix图论(graphs) 数学(math\n[problem:CodeForces-1034B] Little c loves 3 ii暴力枚举(brute force) 构造算法(constructive algorithms), 流(flows), 图匹配(graph matchings\n[problem:CodeForces-1562D2] Two hundred twenty one (hard version)数据结构(data structures) 数学(math\n[problem:CodeForces-1249F] Maximum weight subset动态规划(dp) 树形结构(trees\n[problem:CodeForces-1695D1] Tree queries (easy version)暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1672E] Notepad.exe二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 交互性问题(interactive\n[problem:CodeForces-1837E] Playoff fixing组合数学(combinatorics) 树形结构(trees\n[problem:CodeForces-1461E] Water level暴力枚举(brute force) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1158B] The minimal unique substring构造算法(constructive algorithms) 数学(math), 字符串处理(strings\n[problem:CodeForces-1832E] Combinatorics problem暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp\n[problem:CodeForces-486E] Lis of sequence数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 哈希表(hashing), 数学(math\n[problem:CodeForces-369E] Valera and queries二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-922E] Birds动态规划(dp \n[problem:CodeForces-1181D] Irrigation二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1166D] Cute sequences二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1898E] Sofia and strings数据结构(data structures) 贪心策略(greedy), 排序算法(sortings), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1500B] Two chandeliers二分搜索(binary search) 暴力枚举(brute force), 中国剩余定理(chinese remainder theorem), 数学(math), 数论(number theory\n[problem:CodeForces-981E] Addition on segments位掩码(bitmasks) 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp\n[problem:CodeForces-622E] Ants in leaves深度优先搜索及其变种(dfs and similar) 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-875D] High cry二分搜索(binary search) 位掩码(bitmasks), 组合数学(combinatorics), 数据结构(data structures), 分治算法(divide and conquer\n[problem:CodeForces-1657E] Star mst组合数学(combinatorics) 动态规划(dp), 图匹配(graph matchings), 数学(math\n[problem:CodeForces-1208E] Let them slide数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1335F] Robots on a grid数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 矩阵(matrices\n[problem:CodeForces-555C] Case of chocolate数据结构(data structures \n[problem:CodeForces-650C] Table compression深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1179C] Serge and dining room二分搜索(binary search) 数据结构(data structures), 图匹配(graph matchings), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 树形结构(trees\n[problem:CodeForces-1763D] Valid bitonic permutations组合数学(combinatorics) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1543D2] Rpd and rap sheet (hard version)暴力枚举(brute force) 构造算法(constructive algorithms), 交互性问题(interactive), 数学(math\n[problem:CodeForces-678E] Another sith tournament位掩码(bitmasks) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-1800G] Symmetree深度优先搜索及其变种(dfs and similar) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1178F1] Short colorful strip组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 动态规划(dp\n[problem:CodeForces-1795E] Explosions?二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1140E] Palindrome-less arrays组合数学(combinatorics) 分治算法(divide and conquer), 动态规划(dp\n[problem:CodeForces-723E] One-way reform构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 流(flows), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1149B] Three religions动态规划(dp) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1841E] Fill the matrix数据结构(data structures) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1498E] Two houses暴力枚举(brute force) 图论(graphs), 贪心策略(greedy), 交互性问题(interactive), 排序算法(sortings\n[problem:CodeForces-1622E] Math test位掩码(bitmasks) 暴力枚举(brute force), 贪心策略(greedy\n[problem:CodeForces-1815C] Between构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-603C] Lieges of legendre博弈论(games) 数学(math\n[problem:CodeForces-1615D] X(or)-mas tree位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1737D] Ela and the wiring wizard暴力枚举(brute force) 动态规划(dp), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-1721E] Prefix function queries深度优先搜索及其变种(dfs and similar) 动态规划(dp), 哈希表(hashing), 字符串后缀结构(string suffix structures), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-520E] Pluses everywhere组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1225E] Rock is push二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-980E] The number games数据结构(data structures) 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-785E] Anton and permutation暴力枚举(brute force) 数据结构(data structures\n[problem:CodeForces-476E] Dreamoon and strings动态规划(dp) 字符串处理(strings\n[problem:CodeForces-1227F1] Wrong answer on test 233 (easy version)动态规划(dp \n[problem:CodeForces-553C] Love triangles深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1551F] Equidistant vertices暴力枚举(brute force) 组合数学(combinatorics), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1194E] Count the rectangles位掩码(bitmasks) 暴力枚举(brute force), 数据结构(data structures), 计算几何(geometry), 排序算法(sortings\n[problem:CodeForces-549C] The game of parity博弈论(games \n[problem:CodeForces-1272F] Two bracket sequences动态规划(dp) 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1468H] K and medians构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1907G] Lights暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1278E] Tests for problem d构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 树形结构(trees\n[problem:CodeForces-618D] Hamiltonian spanning tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图匹配(graph matchings), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1238F] The maximum subtree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-979D] Kuro and gcd and xor and sum二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 数学(math), 数论(number theory), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1763E] Node pairs动态规划(dp) 图论(graphs), 数学(math), 数论(number theory\n[problem:CodeForces-507D] The maths lecture动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1946E] Girl permutation组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1840F] Railguns暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs\n[problem:CodeForces-920G] List of integers二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 组合数学(combinatorics), 数学(math), 数论(number theory\n[problem:CodeForces-1670E] Hemose on the tree位掩码(bitmasks) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1777E] Edge reverse二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1580C] Train maintenance暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-932D] Tree二分搜索(binary search) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-620D] Professor gukiz and two arrays二分搜索(binary search) 双指针算法(two pointers\n[problem:CodeForces-804C] Ice cream coloring构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy\n[problem:CodeForces-1593G] Changing brackets构造算法(constructive algorithms) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-567E] President and roads深度优先搜索及其变种(dfs and similar) 图论(graphs), 哈希表(hashing), 最短路算法(shortest paths\n[problem:CodeForces-855E] Salazar slytherin\u0027s locket位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-712D] Memory and scores组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1909F1] Small permutation problem (easy version)暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-1811G2] Vlad and the nice paths (hard version)二分搜索(binary search) 组合数学(combinatorics), 数据结构(data structures), 动态规划(dp), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-612E] Square root of permutation组合数学(combinatorics) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 数学(math\n[problem:CodeForces-453C] Little pony and summer sun celebration构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-1283F] Diy garland构造算法(constructive algorithms) 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1468A] Lais数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1105E] Helping hiasat位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-1789D] Serval and shift-shift-shift位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-490F] Treeland tour数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-508E] Arthur and brackets动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1784C] Monsters (hard version)数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-1045G] Ai robots数据结构(data structures \n[problem:CodeForces-1607G] Banquet preparations 1贪心策略(greedy \n[problem:CodeForces-351E] Jeff and permutation贪心策略(greedy \n[problem:CodeForces-538F] A heap of heaps暴力枚举(brute force) 数据结构(data structures), 数学(math), 排序算法(sortings\n[problem:CodeForces-538E] Demiurges play again深度优先搜索及其变种(dfs and similar) 动态规划(dp), 数学(math), 树形结构(trees\n[problem:CodeForces-1918E] Ace5 and task order构造算法(constructive algorithms) 分治算法(divide and conquer), 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive), 概率论(probabilities), 排序算法(sortings\n[problem:CodeForces-1505F] Math 数学(math\n[problem:CodeForces-743E] Vladik and cards二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 动态规划(dp\n[problem:CodeForces-1618G] Trader problem数据结构(data structures) 并查集(dsu), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-448E] Divisors暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation), 数论(number theory\n[problem:CodeForces-1153E] Serval and snake二分搜索(binary search) 暴力枚举(brute force), 交互性问题(interactive\n[problem:CodeForces-1117E] Decypher the string位掩码(bitmasks) 中国剩余定理(chinese remainder theorem), 构造算法(constructive algorithms), 交互性问题(interactive), 数学(math\n[problem:CodeForces-809B] Glad to see you!二分搜索(binary search) 交互性问题(interactive\n[problem:CodeForces-1227E] Arson in berland forest二分搜索(binary search) 图论(graphs), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1659E] And-mex walk位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-713B] Searching rectangles二分搜索(binary search) 构造算法(constructive algorithms), 交互性问题(interactive\n[problem:CodeForces-662B] Graph coloring深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1216E2] Numerical sequence (hard version)二分搜索(binary search) 数学(math\n[problem:CodeForces-346C] Number transformation ii贪心策略(greedy) 数学(math\n[problem:CodeForces-76A] Gift并查集(dsu) 图论(graphs), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1741G] Kirill and company位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 流(flows), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1155E] Guess the root暴力枚举(brute force) 交互性问题(interactive), 数学(math\n[problem:CodeForces-731E] Funny game动态规划(dp) 博弈论(games\n[problem:CodeForces-550E] Brackets in implications构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-901B] Gcd of polynomials构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1926F] Vlad and avoiding x位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1666I] Interactive treasure hunt暴力枚举(brute force) 构造算法(constructive algorithms), 计算几何(geometry), 交互性问题(interactive), 数学(math\n[problem:CodeForces-815B] Karen and test暴力枚举(brute force) 组合数学(combinatorics), 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-514E] Darth vader and tree动态规划(dp) 矩阵(matrices\n[problem:CodeForces-1650F] Vitaly and advanced useless algorithms动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-821D] Okabe and city深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-850C] Arpa and a game with mojtaba位掩码(bitmasks) 动态规划(dp), 博弈论(games\n[problem:CodeForces-1901E] Compressed tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-965E] Short code数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1039C] Network safety深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 数学(math), 排序算法(sortings\n[problem:CodeForces-461C] Appleman and a sheet of paper数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-425B] Sereja and table位掩码(bitmasks) 贪心策略(greedy\n[problem:CodeForces-925C] Big secret构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-756C] Nikita and stack数据结构(data structures \n[problem:CodeForces-1065D] Three pieces深度优先搜索及其变种(dfs and similar) 动态规划(dp), 最短路算法(shortest paths\n[problem:CodeForces-762E] Radio stations二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-757D] Felicity\u0027s big secret revealed位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-1772G] Gaining rating二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-903E] Swapping characters暴力枚举(brute force) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-765E] Tree folding深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-691F] Couple cover暴力枚举(brute force) 动态规划(dp), 数论(number theory\n[problem:CodeForces-1776B] Vittorio plays with lego bricks动态规划(dp) 计算几何(geometry\n[problem:CodeForces-1808E1] Minibuses on venus (easy version)组合数学(combinatorics) 分治算法(divide and conquer), 动态规划(dp\n[problem:CodeForces-645E] Intellectual inquiry动态规划(dp) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1252E] Songwriter贪心策略(greedy) 双指针算法(two pointers\n[problem:CodeForces-113C] Double happiness暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-639C] Bear and polynomials哈希表(hashing) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1607H] Banquet preparations 2贪心策略(greedy) 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1765H] Hospital queue二分搜索(binary search) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-272E] Dima and horses组合数学(combinatorics) 构造算法(constructive algorithms), 图论(graphs\n[problem:CodeForces-863F] Almost permutation流(flows \n[problem:CodeForces-364B] Free market动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-627C] Package delivery数据结构(data structures) 分治算法(divide and conquer), 贪心策略(greedy\n[problem:CodeForces-731D] 80-th level archeology暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-906B] Seating of students暴力枚举(brute force) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-406D] Hill climbing深度优先搜索及其变种(dfs and similar) 计算几何(geometry), 树形结构(trees\n[problem:CodeForces-1089A] Alice the fan动态规划(dp \n[problem:CodeForces-377C] Captains mode位掩码(bitmasks) 动态规划(dp), 博弈论(games\n[problem:CodeForces-286B] Shifting实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-894D] Ralph and his tour in binary country暴力枚举(brute force) 数据结构(data structures), 树形结构(trees\n[problem:CodeForces-733F] Drivers dissatisfaction数据结构(data structures) 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-369D] Valera and fools深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1666F] Fancy stack组合数学(combinatorics) 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1003F] Abbreviation动态规划(dp) 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1921G] Mischievous shooter暴力枚举(brute force) 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-962E] Byteland Berland and disputed cities构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-946E] Largest beautiful number贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-575B] Bribes深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-1136E] Nastya hasn\u0027t written a legend二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-19C] Deletion of repeats贪心策略(greedy) 哈希表(hashing), 字符串后缀结构(string suffix structures\n[problem:CodeForces-847D] Dog show构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-274D] Lovely matrix深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-337E] Divisor tree暴力枚举(brute force) 数论(number theory), 树形结构(trees\n[problem:CodeForces-45G] Prime problem数论(number theory \n[problem:CodeForces-28C] Bath queue组合数学(combinatorics) 动态规划(dp), 概率论(probabilities\n[problem:CodeForces-954I] Yet another string matching problem快速傅里叶变换(fft) 数学(math\n[problem:CodeForces-387D] George and interesting graph图匹配(graph matchings \n[problem:CodeForces-773C] Prairie partition二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-225D] Snake位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1425E] Excitation of atoms贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-518E] Arthur and questions贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math), 三分搜索(ternary search\n[problem:CodeForces-754C] Vladik and chat暴力枚举(brute force) 构造算法(constructive algorithms), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-431E] Chemistry experiment二分搜索(binary search) 数据结构(data structures), 三分搜索(ternary search\n[problem:CodeForces-868D] Huge strings位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-958E2] Guard duty (medium)二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-690C3] Brain network (hard)树形结构(trees \n[problem:CodeForces-332C] Students\u0027 revenge数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-354E] Lucky number representation构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp\n[problem:CodeForces-1157G] Inverse of rows and columns暴力枚举(brute force) 构造算法(constructive algorithms\n[problem:CodeForces-575G] Run for beer深度优先搜索及其变种(dfs and similar) 最短路算法(shortest paths\n[problem:CodeForces-387E] George and cards二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-138C] Mushroom gnomes - 2二分搜索(binary search) 数据结构(data structures), 概率论(probabilities), 排序算法(sortings\n[problem:CodeForces-255E] Furlo and rublo and game博弈论(games) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-191E] Thwarting demonstrations二分搜索(binary search) 数据结构(data structures), 树形结构(trees\n[problem:CodeForces-385D] Bear and floodlight位掩码(bitmasks) 动态规划(dp), 计算几何(geometry\n[problem:CodeForces-1938E] Duplicate \n[problem:CodeForces-420D] Cup trick数据结构(data structures \n[problem:CodeForces-47D] Safe暴力枚举(brute force \n[problem:CodeForces-350E] Wrong floyd暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-196C] Paint tree构造算法(constructive algorithms) 分治算法(divide and conquer), 计算几何(geometry), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-366E] Dima and magic guitar暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-509D] Restoring numbers构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1912E] Evaluate it and back again构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-746F] Music in car数据结构(data structures) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1773B] Bincoin二分搜索(binary search) 分治算法(divide and conquer), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-730E] Award ceremony贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-730D] Running over the bridges贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-279D] The minimum number of variables位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-1231E] Middle-out构造算法(constructive algorithms) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-71E] Nuclear fusion位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-413E] Maze 2d数据结构(data structures) 分治算法(divide and conquer\n[problem:CodeForces-382D] Ksenia and pawns深度优先搜索及其变种(dfs and similar) 图论(graphs), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1575G] Gcd festival数学(math) 数论(number theory\n[problem:CodeForces-1045D] Interstellar battle数学(math) 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-150C] Smart cheater数据结构(data structures) 数学(math), 概率论(probabilities\n[problem:CodeForces-903F] Clear the matrix位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-1575K] Knitting batik实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-440D] Berland federalization动态规划(dp) 树形结构(trees\n[problem:CodeForces-73D] Freediv深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-958B2] Maximum control (medium)数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-219E] Parking lot数据结构(data structures \n[problem:CodeForces-1184C2] Heidi and the turing test (medium)数据结构(data structures \n[problem:CodeForces-183C] Cyclic coloring深度优先搜索及其变种(dfs and similar \n[problem:CodeForces-115C] Plumber数学(math \n[problem:CodeForces-1765F] Chemistry lab动态规划(dp) 计算几何(geometry), 概率论(probabilities\n[problem:CodeForces-11C] How many squares?实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-71D] Solitaire暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1906H] Twin friends组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-883A] Automatic door实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1575H] Holiday wall ornaments动态规划(dp) 字符串处理(strings\n[problem:CodeForces-353E] Antichain动态规划(dp) 图匹配(graph matchings), 贪心策略(greedy\n[problem:CodeForces-144E] Competition数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-70C] Lucky tickets二分搜索(binary search) 数据结构(data structures), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-404E] Maze 1d二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-316C1] Tidying up流(flows \n[problem:CodeForces-852F] Product transformation组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-1184B2] The doctor meets vader (medium)流(flows) 图匹配(graph matchings), 图论(graphs), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-1505I] Mysterious language again Seriously? \n[problem:CodeForces-85C] Petya and tree二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 概率论(probabilities), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-243C] Colorado potato beetle深度优先搜索及其变种(dfs and similar) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1424M] Ancient language图论(graphs) 排序算法(sortings\n[problem:CodeForces-253E] Printer二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-858E] Tests renumeration贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-409G] On a plane 计算几何(geometry\n[problem:CodeForces-916D] Jamie and to-do list数据结构(data structures) 交互性问题(interactive), 树形结构(trees\n[problem:CodeForces-271E] Three horses构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-316G2] Good substrings字符串后缀结构(string suffix structures \n[problem:CodeForces-134C] Swaps构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-305D] Olya and graph组合数学(combinatorics) 数学(math\n[problem:CodeForces-42C] Safe cracking暴力枚举(brute force) 构造算法(constructive algorithms\n[problem:CodeForces-245G] Suggested friends暴力枚举(brute force) 图论(graphs\n[problem:CodeForces-802H] Fake news (medium)构造算法(constructive algorithms) 字符串处理(strings\n[problem:CodeForces-65D] Harry potter and the sorting hat暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 哈希表(hashing\n[problem:CodeForces-51D] Geometrical problem实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-86B] Tetris revisited构造算法(constructive algorithms) 图匹配(graph matchings), 贪心策略(greedy), 数学(math\n[problem:CodeForces-125D] Two progressions构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-97E] Leaders深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-323B] Tournament-graph构造算法(constructive algorithms) 图论(graphs\n[problem:CodeForces-153C] Caesar cipher \n[problem:CodeForces-47E] Cannon数据结构(data structures) 计算几何(geometry), 排序算法(sortings\n[problem:CodeForces-178F2] Representative sampling动态规划(dp) 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-120I] Luck is in numbers贪心策略(greedy \n[problem:CodeForces-68C] Synchrophasotron暴力枚举(brute force \n[problem:CodeForces-819A] Mister b and boring game博弈论(games) 贪心策略(greedy\n[problem:CodeForces-36C] Bowls计算几何(geometry) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-593C] Beautiful function构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-257E] Greedy elevator数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-182A] Battlefield计算几何(geometry) 图论(graphs), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-105C] Item world暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-45B] School动态规划(dp) 并查集(dsu\n[problem:CodeForces-172E] Bhtml+bcss 深度优先搜索及其变种(dfs and similar), 表达式解析(expression parsing\n[problem:CodeForces-774H] Repairing of string 构造算法(constructive algorithms\n[problem:CodeForces-802E] Marmots (medium)数学(math \n[problem:CodeForces-952G] Puzzling language构造算法(constructive algorithms \n[problem:CodeForces-926H] Endless roses most beautifu \n[problem:CodeForces-1488E] Palindromic doubles 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-1769D2] Игра в девятку ii 暴力枚举(brute force\n[problem:CodeForces-316F1] Suns and rays深度优先搜索及其变种(dfs and similar) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-316F3] Suns and rays构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-64G] Path canonization \n[problem:CodeForces-98B] Help king实现问题,编程技巧,模拟(implementation) 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-345D] Chain letter 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-207C2] Game with two tree \n[problem:CodeForces-72B] Ini-file 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-345G] Suffix subgroup 字符串处理(strings\n[problem:CodeForces-661G] Hungarian notation \n","threadId":188472,"likeCnt":0,"createTime":1711958981000,"isWorkbook":true,"viewCnt":106,"openness":2,"fav":false,"id":4794,"trustable":false}