Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-1647E\":[\"Madoka and the Sixth-graders\",1003,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1647\\\"\\u003eCodeforces Round 777 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1906L\":[\"Palindromic Parentheses\",431,\"\\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-44G\":[\"Shooting Gallery\",387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/44\\\"\\u003eSchool Team Contest 2 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-1623E\":[\"Middle Duplication\",1089,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1623\\\"\\u003eCodeforces Round 763 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1906K\":[\"Deck-Building Game\",262,\"\\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-68D\":[\"Half-decay tree\",486,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/68\\\"\\u003eCodeforces Beta Round 62\\u003c/a\\u003e\"],\"CodeForces-1037F\":[\"Maximum Reduction\",969,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1037\\\"\\u003eManthan, Codefest 18 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1485E\":[\"Move and Swap\",1256,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1485\\\"\\u003eCodeforces Round 701 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-739C\":[\"Alyona and towers\",1519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/739\\\"\\u003eCodeforces Round 381 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1146F\":[\"Leaf Partition\",1121,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1146\\\"\\u003eForethought Future Cup - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1497D\":[\"Genius\",1513,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1497\\\"\\u003eCodeforces Round 708 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1611G\":[\"Robot and Candies\",618,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1611\\\"\\u003eCodeforces Round 756 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-605D\":[\"Board Game\",840,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/605\\\"\\u003eCodeforces Round 335 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1691F\":[\"K-Set Tree\",923,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1691\\\"\\u003eCodeCraft-22 and Codeforces Round 795 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-835F\":[\"Roads in the Kingdom\",1101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-45F\":[\"Goats and Wolves\",127,\"\\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-1307E\":[\"Cow and Treats\",1095,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1307\\\"\\u003eCodeforces Round 621 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1658E\":[\"Gojou and Matrix Game\",1027,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1658\\\"\\u003eCodeforces Round 779 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1767E\":[\"Algebra Flash\",852,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1767\\\"\\u003eEducational Codeforces Round 140 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1779F\":[\"Xorcerer\\u0027s Stones\",1224,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1779\\\"\\u003eHello 2023\\u003c/a\\u003e\"],\"CodeForces-1876D\":[\"Lexichromatography\",808,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1876\\\"\\u003eCodeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round)\\u003c/a\\u003e\"],\"CodeForces-333E\":[\"Summer Earnings\",1170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/333\\\"\\u003eCodeforces Round 194 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-212D\":[\"Cutting a Fence\",467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/212\\\"\\u003eVK Cup 2012 Finals (unofficial online-version)\\u003c/a\\u003e\"],\"CodeForces-442C\":[\"Artem and Array\",1827,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/442\\\"\\u003eCodeforces Round 253 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-57D\":[\"Journey\",342,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/57\\\"\\u003eCodeforces Beta Round 53\\u003c/a\\u003e\"],\"CodeForces-1917F\":[\"Construct Tree\",893,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1917\\\"\\u003eCodeforces Round 917 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1903D2\":[\"Maximum And Queries (hard version)\",716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1903\\\"\\u003eCodeforces Round 912 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1375E\":[\"Inversion SwapSort\",2985,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1375\\\"\\u003eCodeforces Global Round 9\\u003c/a\\u003e\"],\"CodeForces-1731F\":[\"Function Sum\",664,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1731\\\"\\u003eCodeforces Round 841 (Div. 2) and Divide by Zero 2022\\u003c/a\\u003e\"],\"CodeForces-1513F\":[\"Swapping Problem\",1220,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1513\\\"\\u003eDivide by Zero 2021 and Codeforces Round 714 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-508D\":[\"Tanya and Password\",3331,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/508\\\"\\u003eCodeforces Round 288 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-628F\":[\"Bear and Fair Set\",792,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/628\\\"\\u003eEducational Codeforces Round 8\\u003c/a\\u003e\"],\"CodeForces-822F\":[\"Madness\",297,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/822\\\"\\u003eCodeforces Round 422 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1809F\":[\"Traveling in Berland\",715,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1809\\\"\\u003eEducational Codeforces Round 145 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1918F\":[\"Caterpillar on a Tree\",781,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1918\\\"\\u003eCodeforces Round 922 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-696D\":[\"Legen...\",1339,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/696\\\"\\u003eCodeforces Round 362 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-551E\":[\"GukiZ and GukiZiana\",1825,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/551\\\"\\u003eCodeforces Round 307 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-660F\":[\"Bear and Bowling 4\",1669,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/660\\\"\\u003eEducational Codeforces Round 11\\u003c/a\\u003e\"],\"CodeForces-683I\":[\"Loader\",38,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/683\\\"\\u003eSurprise Language Round 8\\u003c/a\\u003e\"],\"CodeForces-1778E\":[\"The Tree Has Fallen!\",825,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1778\\\"\\u003eCodeforces Round 848 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1427E\":[\"Xum\",1273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1427\\\"\\u003eCodeforces Global Round 11\\u003c/a\\u003e\"],\"CodeForces-1548C\":[\"The Three Little Pigs\",1756,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1548\\\"\\u003eCodeforces Round 736 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1904E\":[\"Tree Queries\",806,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1904\\\"\\u003eCodeforces Round 914 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-138D\":[\"World of Darkraft\",563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/138\\\"\\u003eCodeforces Beta Round 99 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1398F\":[\"Controversial Rounds\",1093,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1398\\\"\\u003eEducational Codeforces Round 93 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1253F\":[\"Cheap Robot\",1710,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1253\\\"\\u003eCodeforces Round 600 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1120D\":[\"Power Tree\",1348,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1120\\\"\\u003eCodeforces Round 543 (Div. 1, based on Technocup 2019 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1712E2\":[\"LCM Sum (hard version)\",1199,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1712\\\"\\u003eCodeforces Round 813 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-712E\":[\"Memory and Casinos\",704,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/712\\\"\\u003eCodeforces Round 370 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-845F\":[\"Guards In The Storehouse\",454,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"CodeForces-930D\":[\"Game with Tokens\",410,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/930\\\"\\u003eCodeforces Round 468 (Div. 1, based on Technocup 2018 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1917E\":[\"Construct Matrix\",1267,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1917\\\"\\u003eCodeforces Round 917 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-954H\":[\"Path Counting\",577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-792E\":[\"Colored Balls\",1160,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/792\\\"\\u003eEducational Codeforces Round 18\\u003c/a\\u003e\"],\"CodeForces-55E\":[\"Very simple problem\",752,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"CodeForces-1789E\":[\"Serval and Music Game\",770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1789\\\"\\u003eCodeforces Round 853 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-67E\":[\"Save the City!\",322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/67\\\"\\u003eManthan 2011\\u003c/a\\u003e\"],\"CodeForces-55D\":[\"Beautiful numbers\",6034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"CodeForces-1438E\":[\"Yurii Can Do Everything\",1316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1438\\\"\\u003eCodeforces Round 682 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1305F\":[\"Kuroni and the Punishment\",2469,\"\\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-1903F\":[\"Babysitting\",562,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1903\\\"\\u003eCodeforces Round 912 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-101E\":[\"Candies and Stones\",516,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/101\\\"\\u003eCodeforces Beta Round 79 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-379E\":[\"New Year Tree Decorations\",384,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/379\\\"\\u003eGood Bye 2013\\u003c/a\\u003e\"],\"CodeForces-1361C\":[\"Johnny and Megan\\u0027s Necklace\",1419,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1361\\\"\\u003eCodeforces Round 647 (Div. 1) - Thanks, Algo Muse!\\u003c/a\\u003e\"],\"CodeForces-1470C\":[\"Strange Shuffle\",1327,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1470\\\"\\u003eCodeforces Round 694 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-989D\":[\"A Shade of Moonlight\",537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/989\\\"\\u003eCodeforces Round 487 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1746E1\":[\"Joking (Easy Version)\",1375,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1746\\\"\\u003eCodeforces Global Round 23\\u003c/a\\u003e\"],\"CodeForces-1920F1\":[\"Smooth Sailing (Easy Version)\",868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1920\\\"\\u003eCodeforces Round 919 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-735E\":[\"Ostap and Tree\",892,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/735\\\"\\u003eCodeforces Round 382 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-747F\":[\"Igor and Interesting Numbers\",449,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/747\\\"\\u003eCodeforces Round 387 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-832C\":[\"Strange Radiation\",458,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/832\\\"\\u003eCodeforces Round 425 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-868F\":[\"Yet Another Minimization Problem\",3768,\"\\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-1209E2\":[\"Rotate Columns (hard version)\",1979,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1209\\\"\\u003eCodeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1090G\":[\"Combostone\",104,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1090\\\"\\u003e2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-290E\":[\"HQ\",191,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/290\\\"\\u003eApril Fools Day Contest 2013\\u003c/a\\u003e\"],\"CodeForces-1625E1\":[\"Cats on the Upgrade (easy version)\",993,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1625\\\"\\u003eCodeforces Round 765 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-883L\":[\"Berland.Taxi\",234,\"\\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-152E\":[\"Garden\",520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/152\\\"\\u003eCodeforces Round 108 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-176D\":[\"Hyper String\",334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/176\\\"\\u003eCroc Champ 2012 - Round 2\\u003c/a\\u003e\"],\"CodeForces-297D\":[\"Color the Carpet\",502,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/297\\\"\\u003eCodeforces Round 180 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1845E\":[\"Boxes and Balls\",1298,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1845\\\"\\u003eEducational Codeforces Round 151 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-435E\":[\"Special Graph\",232,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/435\\\"\\u003eCodeforces Round 249 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1320D\":[\"Reachable Strings\",1236,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1320\\\"\\u003eCodeforces Round 625 (Div. 1, based on Technocup 2020 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1562E\":[\"Rescue Niwen!\",1361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1562\\\"\\u003eCodeforces Round 741 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-314D\":[\"Sereja and Straight Lines\",549,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/314\\\"\\u003eCodeforces Round 187 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1332F\":[\"Independent Set\",1000,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1332\\\"\\u003eCodeforces Round 630 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1574E\":[\"Coloring\",872,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1574\\\"\\u003eEducational Codeforces Round 114 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1017F\":[\"The Neutral Zone\",808,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1017\\\"\\u003eCodeforces Round 502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1550E\":[\"Stringforces\",1505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1550\\\"\\u003eEducational Codeforces Round 111 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1211G\":[\"King\\u0027s Path\",66,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1211\\\"\\u003eKotlin Heroes: Episode 2\\u003c/a\\u003e\"],\"CodeForces-1368E\":[\"Ski Accidents\",1988,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1368\\\"\\u003eCodeforces Global Round 8\\u003c/a\\u003e\"],\"CodeForces-1073F\":[\"Choosing Two Paths\",536,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1073\\\"\\u003eEducational Codeforces Round 53 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-706E\":[\"Working routine\",1270,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/706\\\"\\u003eCodeforces Round 367 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1085F\":[\"Rock-Paper-Scissors Champion\",579,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1085\\\"\\u003eTechnocup 2019 - Elimination Round 4\\u003c/a\\u003e\"],\"CodeForces-1097F\":[\"Alex and a TV Show\",1266,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1097\\\"\\u003eHello 2019\\u003c/a\\u003e\"],\"CodeForces-912C\":[\"Perun, Ult!\",522,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/912\\\"\\u003eCodeforces Round 456 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-924D\":[\"Contact ATC\",830,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/924\\\"\\u003eVK Cup 2018 - Round 2\\u003c/a\\u003e\"],\"CodeForces-883D\":[\"Packmen Strike Back\",358,\"\\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-992E\":[\"Nastya and King-Shamans\",1359,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/992\\\"\\u003eCodeforces Round 489 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-370E\":[\"Summer Reading\",238,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/370\\\"\\u003eCodeforces Round 217 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-958C3\":[\"Encryption (hard)\",525,\"\\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-1505H\":[\"L BREAK into program\",485,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1505\\\"\\u003eApril Fools Day Contest 2021\\u003c/a\\u003e\"],\"CodeForces-1137C\":[\"Museums Tour\",1234,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1137\\\"\\u003eCodeforces Round 545 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1517E\":[\"Group Photo\",962,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1517\\\"\\u003eContest 2050 and Codeforces Round 718 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-301C\":[\"Yaroslav and Algorithm\",472,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/301\\\"\\u003eCodeforces Round 182 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1488G\":[\"Painting Numbers\",116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1488\\\"\\u003eKotlin Heroes: Episode 6\\u003c/a\\u003e\"],\"CodeForces-1452E\":[\"Two Editorials\",1512,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1452\\\"\\u003eEducational Codeforces Round 98 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1585G\":[\"Poachers\",174,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1585\\\"\\u003eTechnocup 2022 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-119D\":[\"String Transformation\",517,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/119\\\"\\u003eCodeforces Beta Round 90\\u003c/a\\u003e\"],\"CodeForces-609F\":[\"Frogs and mosquitoes\",1279,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/609\\\"\\u003eEducational Codeforces Round 3\\u003c/a\\u003e\"],\"CodeForces-923D\":[\"Picking Strings\",1170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/923\\\"\\u003eVK Cup 2018 - Round 1\\u003c/a\\u003e\"],\"CodeForces-729F\":[\"Financiers Game\",972,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/729\\\"\\u003eTechnocup 2017 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1096E\":[\"The Top Scorer\",902,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1096\\\"\\u003eEducational Codeforces Round 57 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-911G\":[\"Mass Change Queries\",2715,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-543C\":[\"Remembering Strings\",1457,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/543\\\"\\u003eCodeforces Round 302 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-555D\":[\"Case of a Top Secret\",956,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/555\\\"\\u003eCodeforces Round 310 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-93D\":[\"Flags\",348,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/93\\\"\\u003eCodeforces Beta Round 76 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-260E\":[\"Dividing Kingdom\",487,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/260\\\"\\u003eCodeforces Round 158 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-93C\":[\"Azembler\",436,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/93\\\"\\u003eCodeforces Beta Round 76 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-295E\":[\"Yaroslav and Points\",721,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/295\\\"\\u003eCodeforces Round 179 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-46G\":[\"Emperor\\u0027s Problem\",108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/46\\\"\\u003eSchool Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1637F\":[\"Towers\",1786,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1637\\\"\\u003eCodeforces Global Round 19\\u003c/a\\u003e\"],\"CodeForces-1710C\":[\"XOR Triangle\",1299,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1710\\\"\\u003eCodeforces Round 810 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1516E\":[\"Baby Ehab Plays with Permutations\",823,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1516\\\"\\u003eCodeforces Round 717 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1734F\":[\"Zeros and Ones\",781,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1734\\\"\\u003eCodeforces Round 822 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1758E\":[\"Tick, Tock\",780,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1758\\\"\\u003eCodeforces Round 836 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-433E\":[\"Tachibana Kanade\\u0027s Tofu\",487,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/433\\\"\\u003eCodeforces Round 248 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1407E\":[\"Egor in the Republic of Dagestan\",1681,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1407\\\"\\u003eCodeforces Round 669 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1528D\":[\"It\\u0027s a bird! No, it\\u0027s a plane! No, it\\u0027s AaParsa!\",1411,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1528\\\"\\u003eCodeforces Round 722 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1354F\":[\"Summoning Minions\",1002,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1354\\\"\\u003eEducational Codeforces Round 87 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-348D\":[\"Turtles\",1689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/348\\\"\\u003eCodeforces Round 202 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-348C\":[\"Subset Sums\",2355,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/348\\\"\\u003eCodeforces Round 202 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1100F\":[\"Ivan and Burgers\",2241,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1100\\\"\\u003eCodeforces Round 532 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1221E\":[\"Game With String\",1050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1221\\\"\\u003eEducational Codeforces Round 73 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1572B\":[\"Xor of 3\",1758,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1572\\\"\\u003eCodeforces Round 743 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1100D\":[\"Dasha and Chess\",884,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1100\\\"\\u003eCodeforces Round 532 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-837G\":[\"Functions On The Segments\",689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"CodeForces-813F\":[\"Bipartite Checking\",1301,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"CodeForces-825G\":[\"Tree Queries\",1198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-946G\":[\"Almost Increasing Array\",683,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/946\\\"\\u003eEducational Codeforces Round 39 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-687D\":[\"Dividing Kingdom II\",898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/687\\\"\\u003eCodeforces Round 360 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-566G\":[\"Max and Min\",347,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/566\\\"\\u003eVK Cup 2015 - Finals, online mirror\\u003c/a\\u003e\"],\"CodeForces-380D\":[\"Sereja and Cinema\",428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/380\\\"\\u003eCodeforces Round 223 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-530I\":[\"Different variables\",43,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/530\\\"\\u003eVK Cup 2015 - Wild Card Round 1\\u003c/a\\u003e\"],\"CodeForces-294D\":[\"Shaass and Painter Robot\",348,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/294\\\"\\u003eCodeforces Round 178 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-23E\":[\"Tree\",660,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/23\\\"\\u003eCodeforces Beta Round 23\\u003c/a\\u003e\"],\"CodeForces-173D\":[\"Deputies\",262,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/173\\\"\\u003eCroc Champ 2012 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1418G\":[\"Three Occurrences\",1515,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1418\\\"\\u003eEducational Codeforces Round 95 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1527E\":[\"Partition Game\",2232,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1527\\\"\\u003eCodeforces Round 721 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-185C\":[\"Clever Fat Rat\",135,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/185\\\"\\u003eCodeforces Round 118 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1854C\":[\"Expected Destruction\",1415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1854\\\"\\u003eCodeforces Round 889 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1539E\":[\"Game with Cards\",955,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1539\\\"\\u003eCodeforces Round 727 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-23C\":[\"Oranges and Apples\",1558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/23\\\"\\u003eCodeforces Beta Round 23\\u003c/a\\u003e\"],\"CodeForces-311C\":[\"Fetch the Treasure\",489,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/311\\\"\\u003eCodeforces Round 185 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-444D\":[\"DZY Loves Strings\",781,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/444\\\"\\u003eCodeforces Round 254 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1498F\":[\"Christmas Game\",869,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1498\\\"\\u003eCodeCraft-21 and Codeforces Round 711 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-105E\":[\"Lift and Throw\",193,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/105\\\"\\u003eCodeforces Beta Round 81\\u003c/a\\u003e\"],\"CodeForces-331C3\":[\"The Great Julya Calendar\",492,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/331\\\"\\u003eABBYY Cup 3.0 - Finals (online version)\\u003c/a\\u003e\"],\"CodeForces-1474E\":[\"What Is It?\",1322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1474\\\"\\u003eCodeforces Round 696 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1583F\":[\"Defender of Childhood Dreams\",1223,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1583\\\"\\u003eTechnocup 2022 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1866K\":[\"Keen Tree Calculation\",405,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1866\\\"\\u003eCOMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-117D\":[\"Not Quick Transformation\",344,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/117\\\"\\u003eCodeforces Beta Round 88\\u003c/a\\u003e\"],\"CodeForces-1612G\":[\"Max Sum Array\",830,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1612\\\"\\u003eEducational Codeforces Round 117 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1559D2\":[\"Mocha and Diana (Hard Version)\",2560,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1559\\\"\\u003eCodeforces Round 738 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-607C\":[\"Marbles\",818,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/607\\\"\\u003eCodeforces Round 336 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-704B\":[\"Ant Man\",1700,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/704\\\"\\u003eCodeforces Round 366 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1111E\":[\"Tree\",903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1111\\\"\\u003eCodeCraft-19 and Codeforces Round 537 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1842F\":[\"Tenzing and Tree\",1280,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1842\\\"\\u003eCodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-618E\":[\"Robot Arm\",621,\"\\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-1571G\":[\"A Battle Against a Dragon\",71,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1571\\\"\\u003eKotlin Heroes: Episode 8\\u003c/a\\u003e\"],\"CodeForces-468C\":[\"Hack it!\",2449,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/468\\\"\\u003eCodeforces Round 268 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-771D\":[\"Bear and Company\",1157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/771\\\"\\u003eVK Cup 2017 - Round 1\\u003c/a\\u003e\"],\"CodeForces-91E\":[\"Igloo Skyscraper\",652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/91\\\"\\u003eCodeforces Beta Round 75 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-161E\":[\"Polycarpus the Safecracker\",475,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/161\\\"\\u003eVK Cup 2012 Round 1\\u003c/a\\u003e\"],\"CodeForces-580E\":[\"Kefa and Watch\",2150,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/580\\\"\\u003eCodeforces Round 321 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1239B\":[\"The World Is Just a Programming Task (Hard Version)\",990,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1239\\\"\\u003eCodeforces Round 594 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1922F\":[\"Replace on Segment\",1156,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1922\\\"\\u003eEducational Codeforces Round 161 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1687C\":[\"Sanae and Giant Robot\",1358,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1687\\\"\\u003eCodeforces Round 796 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1946F\":[\"Nobody is needed\",741,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1946\\\"\\u003eCodeforces Round 936 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-156D\":[\"Clues\",1553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/156\\\"\\u003eCodeforces Round 110 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1716E\":[\"Swap and Maximum Block\",1044,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1716\\\"\\u003eEducational Codeforces Round 133 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1716F\":[\"Bags with Balls\",1016,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1716\\\"\\u003eEducational Codeforces Round 133 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1089C\":[\"Cactus Search\",402,\"\\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-1840G2\":[\"In Search of Truth (Hard Version)\",899,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1840\\\"\\u003eCodeforces Round 878 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1186E\":[\"Vus the Cossack and a Field\",599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1186\\\"\\u003eCodeforces Round 571 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1796E\":[\"Colored Subgraphs\",691,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1796\\\"\\u003eEducational Codeforces Round 144 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1198E\":[\"Rectangle Painting 2\",1021,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1198\\\"\\u003eCodeforces Round 576 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1312F\":[\"Attack on Red Kingdom\",675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1312\\\"\\u003eEducational Codeforces Round 83 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1041F\":[\"Ray in the tube\",1477,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1041\\\"\\u003eCodeforces Round 509 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-778C\":[\"Peterson Polyglot\",900,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/778\\\"\\u003eCodeforces Round 402 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1065F\":[\"Up and Down the Tree\",1228,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1065\\\"\\u003eEducational Codeforces Round 52 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1174E\":[\"Ehab and the Expected GCD Problem\",1442,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1174\\\"\\u003eCodeforces Round 563 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-887F\":[\"Row of Models\",162,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/887\\\"\\u003eCodeforces Round 444 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-645F\":[\"Cowslip Collections\",830,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/645\\\"\\u003eCROC 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-875F\":[\"Royal Questions\",1421,\"\\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-60D\":[\"Savior\",454,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/60\\\"\\u003eCodeforces Beta Round 56\\u003c/a\\u003e\"],\"CodeForces-1387B2\":[\"Village (Maximum)\",819,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1387\\\"\\u003eBaltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated)\\u003c/a\\u003e\"],\"CodeForces-1945G\":[\"Cook and Porridge\",601,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1945\\\"\\u003eCodeforces Round 935 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-264D\":[\"Colorful Stones\",419,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/264\\\"\\u003eCodeforces Round 162 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1824C\":[\"LuoTianyi and XOR-Tree\",1256,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1824\\\"\\u003eCodeforces Round 872 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-17C\":[\"Balance\",905,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/17\\\"\\u003eCodeforces Beta Round 17\\u003c/a\\u003e\"],\"CodeForces-1420E\":[\"Battle Lemmings\",847,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1420\\\"\\u003eCodeforces Round 672 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1468I\":[\"Plane Tiling\",479,\"\\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-1771F\":[\"Hossam and Range Minimum Query\",980,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1771\\\"\\u003eCodeforces Round 837 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1117G\":[\"Recursive Queries\",667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1117\\\"\\u003eEducational Codeforces Round 60 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1534F1\":[\"Falling Sand (Easy Version)\",1214,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1534\\\"\\u003eCodeforces LATOKEN Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1117F\":[\"Crisp String\",554,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1117\\\"\\u003eEducational Codeforces Round 60 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1771E\":[\"Hossam and a Letter\",665,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1771\\\"\\u003eCodeforces Round 837 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1783F\":[\"Double Sort II\",920,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1783\\\"\\u003eEducational Codeforces Round 141 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1444C\":[\"Team-Building\",1481,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1444\\\"\\u003eCodeforces Round 680 (Div. 1, based on Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-317C\":[\"Balance\",502,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/317\\\"\\u003eCodeforces Round 188 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-329D\":[\"The Evil Temple and the Moving Rocks\",412,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/329\\\"\\u003eCodeforces Round 192 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1468G\":[\"Hobbits\",823,\"\\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-1076F\":[\"Summer Practice Report\",640,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1076\\\"\\u003eEducational Codeforces Round 54 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-995D\":[\"Game\",777,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/995\\\"\\u003eCodeforces Round 492 (Div. 1) [Thanks, uDebug!]\\u003c/a\\u003e\"],\"CodeForces-753C\":[\"Interactive Bulls and Cows (Hard)\",288,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/753\\\"\\u003eTesting Round 13\\u003c/a\\u003e\"],\"CodeForces-263E\":[\"Rhombus\",426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/263\\\"\\u003eCodeforces Round 161 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-360C\":[\"Levko and Strings\",1121,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/360\\\"\\u003eCodeforces Round 210 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1479C\":[\"Continuous City\",1280,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1479\\\"\\u003eCodeforces Round 700 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1847F\":[\"The Boss\\u0027s Identity\",853,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1847\\\"\\u003eCodeforces Round 882 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1823E\":[\"Removing Graph\",1204,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1823\\\"\\u003eCodeforces Round 868 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1859E\":[\"Maximum Monogonosity\",1674,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1859\\\"\\u003eCodeforces Round 892 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-166D\":[\"Shoe Store\",376,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/166\\\"\\u003eCodeforces Round 113 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-401E\":[\"Olympic Games\",172,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/401\\\"\\u003eCodeforces Round 235 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1835B\":[\"Lottery\",896,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1835\\\"\\u003eCodeforces Round 880 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1661E\":[\"Narrow Components\",938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1661\\\"\\u003eEducational Codeforces Round 126 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1891E\":[\"Brukhovich and Exams\",773,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1891\\\"\\u003eCodeforces Round 907 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-425E\":[\"Sereja and Sets\",630,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/425\\\"\\u003eCodeforces Round 243 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1225F\":[\"Tree Factory\",900,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1225\\\"\\u003eTechnocup 2020 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1673E\":[\"Power or XOR?\",680,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1673\\\"\\u003eCodeforces Round 785 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-437E\":[\"The Child and Polygon\",717,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/437\\\"\\u003eCodeforces Round 250 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-449C\":[\"Jzzhu and Apples\",2347,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/449\\\"\\u003eCodeforces Round 257 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1310B\":[\"Double Elimination\",490,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1310\\\"\\u003eVK Cup 2019-2020 - Elimination Round (Engine)\\u003c/a\\u003e\"],\"CodeForces-1467E\":[\"Distinctive Roots in a Tree\",1365,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1467\\\"\\u003eCodeforces Round 695 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1334F\":[\"Strange Function\",1140,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1334\\\"\\u003eEducational Codeforces Round 85 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1701E\":[\"Text Editor\",1089,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1701\\\"\\u003eEducational Codeforces Round 131 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1834F\":[\"Typewriter\",492,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1834\\\"\\u003eCodeforces Round 879 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1701F\":[\"Points\",922,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1701\\\"\\u003eEducational Codeforces Round 131 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1725E\":[\"Electrical Efficiency\",438,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1725\\\"\\u003eCOMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-383B\":[\"Volcanoes\",698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/383\\\"\\u003eCodeforces Round 225 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-15D\":[\"Map\",783,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/15\\\"\\u003eCodeforces Beta Round 15\\u003c/a\\u003e\"],\"CodeForces-1737E\":[\"Ela Goes Hiking\",908,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1737\\\"\\u003eDytechlab Cup 2022\\u003c/a\\u003e\"],\"CodeForces-39I\":[\"Tram\",122,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/39\\\"\\u003eSchool Team Contest 1 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-424E\":[\"Colored Jenga\",129,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/424\\\"\\u003eCodeforces Round 242 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1236E\":[\"Alice and the Unfair Game\",658,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1236\\\"\\u003eCodeforces Round 593 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1139F\":[\"Dish Shopping\",384,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1139\\\"\\u003eCodeforces Round 548 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1725K\":[\"Kingdom of Criticism\",602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1725\\\"\\u003eCOMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1909F2\":[\"Small Permutation Problem (Hard Version)\",821,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1909\\\"\\u003ePinely Round 3 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1725J\":[\"Journey\",371,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1725\\\"\\u003eCOMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1280D\":[\"Miss Punyverse\",968,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1280\\\"\\u003eCodeforces Round 607 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-804D\":[\"Expected diameter of a tree\",1299,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/804\\\"\\u003eCodeforces Round 411 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1195F\":[\"Geometers Anonymous Club\",760,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1195\\\"\\u003eCodeforces Round 574 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1497E2\":[\"Square-free division (hard version)\",1588,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1497\\\"\\u003eCodeforces Round 708 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-666C\":[\"Codeword\",804,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/666\\\"\\u003eCodeforces Round 349 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-678F\":[\"Lena and Queries\",898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/678\\\"\\u003eEducational Codeforces Round 13\\u003c/a\\u003e\"],\"CodeForces-799E\":[\"Aquarium decoration\",958,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/799\\\"\\u003ePlayrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-884E\":[\"Binary Matrix\",701,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/884\\\"\\u003eEducational Codeforces Round 31\\u003c/a\\u003e\"],\"CodeForces-1508C\":[\"Complete the MST\",1503,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1508\\\"\\u003eCodeforces Round 715 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-884F\":[\"Anti-Palindromize\",1022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/884\\\"\\u003eEducational Codeforces Round 31\\u003c/a\\u003e\"],\"CodeForces-993D\":[\"Compute Power\",597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/993\\\"\\u003eCodeforces Round 488 by NEAR (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-95D\":[\"Horse Races\",521,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/95\\\"\\u003eCodeforces Beta Round 77 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-981F\":[\"Round Marriage\",732,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/981\\\"\\u003eAvito Code Challenge 2018\\u003c/a\\u003e\"],\"CodeForces-95E\":[\"Lucky Country\",1699,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/95\\\"\\u003eCodeforces Beta Round 77 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-981G\":[\"Magic multisets\",649,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/981\\\"\\u003eAvito Code Challenge 2018\\u003c/a\\u003e\"],\"CodeForces-1776C\":[\"Library game\",836,\"\\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-1776I\":[\"Spinach Pizza\",652,\"\\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-1045A\":[\"Last chance\",351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1045\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-1776J\":[\"Italian Data Centers\",612,\"\\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-1764F\":[\"Doremy\\u0027s Experimental Tree\",892,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1764\\\"\\u003eCodeforces Global Round 24\\u003c/a\\u003e\"],\"CodeForces-909F\":[\"AND-permutations\",555,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1788F\":[\"XOR, Tree, and Queries\",801,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1788\\\"\\u003eCodeforces Round 851 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-407C\":[\"Curious Array\",1028,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/407\\\"\\u003eCodeforces Round 239 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-528D\":[\"Fuzzy Search\",2262,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/528\\\"\\u003eCodeforces Round 296 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1251F\":[\"Red-White Fence\",829,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1251\\\"\\u003eEducational Codeforces Round 75 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-613C\":[\"Necklace\",1038,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/613\\\"\\u003eCodeforces Round 339 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-976F\":[\"Minimal k-covering\",586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/976\\\"\\u003eEducational Codeforces Round 43 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-855D\":[\"Rowena Ravenclaw\\u0027s Diadem\",497,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-1481E\":[\"Sorting Books\",2071,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1481\\\"\\u003eCodeforces Round 699 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-976D\":[\"Degree Set\",706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/976\\\"\\u003eEducational Codeforces Round 43 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-710D\":[\"Two Arithmetic Progressions\",1343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/710\\\"\\u003eEducational Codeforces Round 16\\u003c/a\\u003e\"],\"CodeForces-734F\":[\"Anton and School\",1391,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/734\\\"\\u003eCodeforces Round 379 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1709F\":[\"Multiset of Strings\",556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1709\\\"\\u003eEducational Codeforces Round 132 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1806D\":[\"DSU Master\",861,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1806\\\"\\u003eCodeforces Round 858 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-596E\":[\"Wilbur and Strings\",413,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/596\\\"\\u003eCodeforces Round 331 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-40E\":[\"Number Table\",726,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/40\\\"\\u003eCodeforces Beta Round 39\\u003c/a\\u003e\"],\"CodeForces-681E\":[\"Runaway to a Shadow\",496,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/681\\\"\\u003eCodeforces Round 357 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-53E\":[\"Dead Ends\",1015,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/53\\\"\\u003eCodeforces Beta Round 49 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-220D\":[\"Little Elephant and Triangle\",286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/220\\\"\\u003eCodeforces Round 136 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-341D\":[\"Iahub and Xors\",1256,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/341\\\"\\u003eCodeforces Round 198 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1327F\":[\"AND Segments\",1703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1327\\\"\\u003eEducational Codeforces Round 84 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-123E\":[\"Maze\",791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/123\\\"\\u003eCodeforces Beta Round 92 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1188A2\":[\"Add on a Tree: Revolution\",1097,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1188\\\"\\u003eCodeforces Round 572 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-89D\":[\"Space mines\",237,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/89\\\"\\u003eCodeforces Beta Round 74 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1218E\":[\"Product Tuples\",376,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1218\\\"\\u003eBubble Cup 12 - Finals [Online Mirror, unrated, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-135D\":[\"Cycle\",304,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/135\\\"\\u003eCodeforces Beta Round 97 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-147B\":[\"Smile House\",830,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/147\\\"\\u003eCodeforces Testing Round 4\\u003c/a\\u003e\"],\"CodeForces-1521D\":[\"Nastia Plays with a Tree\",1873,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1521\\\"\\u003eCodeforces Round 720 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1775F\":[\"Laboratory on Pluto\",771,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1775\\\"\\u003eCodeforces Round 843 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1056F\":[\"Write The Contest\",484,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1056\\\"\\u003eMail.Ru Cup 2018 Round 3\\u003c/a\\u003e\"],\"CodeForces-1666E\":[\"Even Split\",690,\"\\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-908E\":[\"New Year and Entity Enumeration\",744,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"CodeForces-1787F\":[\"Inverse Transformation\",637,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1787\\\"\\u003eTypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-963D\":[\"Frequency of String\",1990,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/963\\\"\\u003eTinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-757E\":[\"Bash Plays with Functions\",1370,\"\\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-1492E\":[\"Almost Fault-Tolerant Database\",1184,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1492\\\"\\u003eCodeforces Round 704 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1250M\":[\"SmartGarden\",373,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1250\\\"\\u003e2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-571C\":[\"CNF 2\",632,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/571\\\"\\u003eCodeforces Round 317 [AimFund Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-86C\":[\"Genetic engineering\",817,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"CodeForces-98C\":[\"Help Greg the Dwarf\",310,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/98\\\"\\u003eCodeforces Beta Round 78 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1677D\":[\"Tokitsukaze and Permutations\",1210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1677\\\"\\u003eCodeforces Round 789 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1689E\":[\"ANDfinity\",1198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1689\\\"\\u003eCodeforces Round 798 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-98D\":[\"Help Monks\",198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/98\\\"\\u003eCodeforces Beta Round 78 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1948F\":[\"Rare Coins\",1073,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1948\\\"\\u003eEducational Codeforces Round 163 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1188C\":[\"Array Beauty\",1796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1188\\\"\\u003eCodeforces Round 572 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1423H\":[\"Virus\",524,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1423\\\"\\u003eBubble Cup 13 - Finals [Online Mirror, unrated, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-1556F\":[\"Sports Betting\",1175,\"\\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-1665E\":[\"MinimizOR\",1446,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1665\\\"\\u003eCodeforces Round 781 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1055E\":[\"Segments on the Line\",730,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1055\\\"\\u003eMail.Ru Cup 2018 Round 2\\u003c/a\\u003e\"],\"CodeForces-1798F\":[\"Gifts from Grandfather Ahmed\",473,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1798\\\"\\u003eCodeforces Round 860 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1181E1\":[\"A Story of One Country (Easy)\",489,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1181\\\"\\u003eCodeforces Round 567 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1043F\":[\"Make It One\",2316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1043\\\"\\u003eCodeforces Round 519 by Botan Investments\\u003c/a\\u003e\"],\"CodeForces-986C\":[\"AND Graph\",2334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/986\\\"\\u003eCodeforces Round 485 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-611F\":[\"New Year and Cleaning\",467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/611\\\"\\u003eGood Bye 2015\\u003c/a\\u003e\"],\"CodeForces-594B\":[\"Max and Bike\",487,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/594\\\"\\u003eCodeforces Round 330 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-594D\":[\"REQ\",1623,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/594\\\"\\u003eCodeforces Round 330 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1808E2\":[\"Minibuses on Venus (medium version)\",657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1808\\\"\\u003eCodeforces Round 861 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1858E1\":[\"Rollbacks (Easy Version)\",1248,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1858\\\"\\u003eCodeforces Round 893 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-178F3\":[\"Representative Sampling\",417,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-121D\":[\"Lucky Segments\",275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/121\\\"\\u003eCodeforces Beta Round 91 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-363E\":[\"Two Circles\",204,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/363\\\"\\u003eCodeforces Round 211 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-351C\":[\"Jeff and Brackets\",557,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/351\\\"\\u003eCodeforces Round 204 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-266E\":[\"More Queries to Array...\",794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/266\\\"\\u003eCodeforces Round 163 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1228F\":[\"One Node is Gone\",426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1228\\\"\\u003eCodeforces Round 589 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1717F\":[\"Madoka and The First Session\",535,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1717\\\"\\u003eCodeforces Round 818 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1814D\":[\"Balancing Weapons\",839,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1814\\\"\\u003eEducational Codeforces Round 146 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1838E\":[\"Count Supersequences\",1399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1838\\\"\\u003eCodeforces Round 877 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1773I\":[\"Interactive Factorial Guessing\",465,\"\\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-416E\":[\"President\\u0027s Path\",1693,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/416\\\"\\u003eCodeforces Round 241 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1187F\":[\"Expected Square Beauty\",924,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1313D\":[\"Happy New Year\",1144,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1313\\\"\\u003eCodeforces Round 622 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1374E2\":[\"Reading Books (hard version)\",912,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1374\\\"\\u003eCodeforces Round 653 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1325F\":[\"Ehab\\u0027s Last Theorem\",1785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1325\\\"\\u003eCodeforces Round 628 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1301E\":[\"Nanosoft\",1242,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1301\\\"\\u003eCodeforces Round 619 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1030F\":[\"Putting Boxes Together\",804,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1030\\\"\\u003eTechnocup 2019 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1175F\":[\"The Number of Subpermutations\",1711,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1175\\\"\\u003eEducational Codeforces Round 66 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1187G\":[\"Gang Up\",519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1284E\":[\"New Year and Castle Construction\",1130,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1284\\\"\\u003eHello 2020\\u003c/a\\u003e\"],\"CodeForces-1381C\":[\"Mastermind\",1396,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1381\\\"\\u003eCodeforces Round 658 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-852A\":[\"Digits\",390,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/852\\\"\\u003eBubble Cup X - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-840C\":[\"On the Bench\",1856,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/840\\\"\\u003eCodeforces Round 429 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-997C\":[\"Sky Full of Stars\",1836,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/997\\\"\\u003eCodeforces Round 493 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-501E\":[\"Misha and Palindrome Degree\",775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/501\\\"\\u003eCodeforces Round 285 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-888F\":[\"Connecting Vertices\",846,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-610E\":[\"Alphabet Permutations\",841,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/610\\\"\\u003eCodeforces Round 337 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-840D\":[\"Destiny\",3058,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/840\\\"\\u003eCodeforces Round 429 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-484E\":[\"Sign on Fence\",2394,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/484\\\"\\u003eCodeforces Round 276 (Div. 1)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1711959591000,"title":"CodeForces rating 2500 题目集","dislikeCnt":0,"content":"[problem:CodeForces-55D] Beautiful numbers动态规划(dp) 数论(number theory\n[problem:CodeForces-868F] Yet another minimization problem分治算法(divide and conquer) 动态规划(dp\n[problem:CodeForces-508D] Tanya and password深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1375E] Inversion swapsort构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-840D] Destiny数据结构(data structures) 概率论(probabilities\n[problem:CodeForces-911G] Mass change queries数据结构(data structures \n[problem:CodeForces-1559D2] Mocha and diana (hard version)暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1305F] Kuroni and the punishment数学(math) 数论(number theory), 概率论(probabilities\n[problem:CodeForces-468C] Hack it!二分搜索(binary search) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-449C] Jzzhu and apples构造算法(constructive algorithms) 数论(number theory\n[problem:CodeForces-986C] And graph位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1043F] Make it one位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 数学(math), 数论(number theory), 最短路算法(shortest paths\n[problem:CodeForces-484E] Sign on fence二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures\n[problem:CodeForces-1527E] Partition game二分搜索(binary search) 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp\n[problem:CodeForces-1100F] Ivan and burgers数据结构(data structures) 分治算法(divide and conquer), 贪心策略(greedy), 数学(math\n[problem:CodeForces-528D] Fuzzy search位掩码(bitmasks) 暴力枚举(brute force), 快速傅里叶变换(fft\n[problem:CodeForces-348C] Subset sums暴力枚举(brute force) 数据结构(data structures\n[problem:CodeForces-1481E] Sorting books数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1368E] Ski accidents构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-580E] Kefa and watch数据结构(data structures) 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1209E2] Rotate columns (hard version)位掩码(bitmasks) 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-963D] Frequency of string哈希表(hashing) 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-1521D] Nastia plays with a tree构造算法(constructive algorithms) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1572B] Xor of 3暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1548C] The three little pigs组合数学(combinatorics) 动态规划(dp), 快速傅里叶变换(fft), 数学(math\n[problem:CodeForces-1188C] Array beauty动态规划(dp \n[problem:CodeForces-1637F] Towers构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1325F] Ehab\u0027s last theorem构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-551E] Gukiz and gukiziana二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1859E] Maximum monogonosity暴力枚举(brute force) 动态规划(dp), 数学(math\n[problem:CodeForces-840C] On the bench组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-442C] Artem and array数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-997C] Sky full of stars组合数学(combinatorics) 数学(math\n[problem:CodeForces-1327F] And segments位掩码(bitmasks) 组合数学(combinatorics), 数据结构(data structures), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-1407E] Egor in the republic of dagestan构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1253F] Cheap robot二分搜索(binary search) 并查集(dsu), 图论(graphs), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-704B] Ant man动态规划(dp) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1497E2] Square-free division (hard version)数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 数学(math), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-348D] Turtles动态规划(dp) 矩阵(matrices\n[problem:CodeForces-1175F] The number of subpermutations暴力枚举(brute force) 数据结构(data structures), 分治算法(divide and conquer), 哈希表(hashing), 数学(math\n[problem:CodeForces-594D] Req数据结构(data structures) 数论(number theory\n[problem:CodeForces-660F] Bear and bowling 4二分搜索(binary search) 数据结构(data structures), 分治算法(divide and conquer), 计算几何(geometry), 三分搜索(ternary search\n[problem:CodeForces-1452E] Two editorials暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1497D] Genius位掩码(bitmasks) 动态规划(dp), 图论(graphs), 数论(number theory\n[problem:CodeForces-156D] Clues组合数学(combinatorics) 图论(graphs\n[problem:CodeForces-1041F] Ray in the tube数据结构(data structures) 分治算法(divide and conquer), 动态规划(dp), 数学(math\n[problem:CodeForces-1444C] Team-building数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1550E] Stringforces二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 动态规划(dp), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1418G] Three occurrences数据结构(data structures) 分治算法(divide and conquer), 哈希表(hashing), 双指针算法(two pointers\n[problem:CodeForces-1508C] Complete the mst位掩码(bitmasks) 暴力枚举(brute force), 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1665E] Minimizor位掩码(bitmasks) 暴力枚举(brute force), 数据结构(data structures), 分治算法(divide and conquer), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1381C] Mastermind构造算法(constructive algorithms) 图匹配(graph matchings), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-416E] President\u0027s path动态规划(dp) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-739C] Alyona and towers数据结构(data structures \n[problem:CodeForces-1854C] Expected destruction组合数学(combinatorics) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-95E] Lucky country动态规划(dp) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1361C] Johnny and megan\u0027s necklace二分搜索(binary search) 位掩码(bitmasks), 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1528D] It\u0027s a bird! no It\u0027s a plane! no, It\u0027s aaparsa!构造算法(constructive algorithms), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-23C] Oranges and apples构造算法(constructive algorithms) 排序算法(sortings\n[problem:CodeForces-543C] Remembering strings位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-1174E] Ehab and the expected gcd problem组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1838E] Count supersequences组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1746E1] Joking (easy version)二分搜索(binary search) 构造算法(constructive algorithms), 交互性问题(interactive), 三分搜索(ternary search\n[problem:CodeForces-1687C] Sanae and giant robot二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 并查集(dsu), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1467E] Distinctive roots in a tree数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1562E] Rescue niwen!动态规划(dp) 贪心策略(greedy), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-1470C] Strange shuffle二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 交互性问题(interactive\n[problem:CodeForces-1474E] What is it?构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1438E] Yurii can do everything二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 构造算法(constructive algorithms), 分治算法(divide and conquer), 双指针算法(two pointers\n[problem:CodeForces-734F] Anton and school位掩码(bitmasks) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1710C] Xor triangle位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-992E] Nastya and king-shamans二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-757E] Bash plays with functions暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 数论(number theory\n[problem:CodeForces-1427E] Xum位掩码(bitmasks) 构造算法(constructive algorithms), 数学(math), 矩阵(matrices), 数论(number theory\n[problem:CodeForces-804D] Expected diameter of a tree二分搜索(binary search) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1845E] Boxes and balls动态规划(dp) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1120D] Power tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1479C] Continuous city位掩码(bitmasks) 构造算法(constructive algorithms\n[problem:CodeForces-875F] Royal questions并查集(dsu) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1858E1] Rollbacks (easy version)暴力枚举(brute force) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1917E] Construct matrix构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1842F] Tenzing and tree深度优先搜索及其变种(dfs and similar) 贪心策略(greedy), 最短路算法(shortest paths), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1824C] Luotianyi and xor-tree数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 并查集(dsu), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1583F] Defender of childhood dreams位掩码(bitmasks) 构造算法(constructive algorithms), 分治算法(divide and conquer\n[problem:CodeForces-1485E] Move and swap深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1779F] Xorcerer\u0027s stones位掩码(bitmasks) 构造算法(constructive algorithms), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-696D] Legen...数据结构(data structures) 动态规划(dp), 矩阵(matrices), 字符串处理(strings\n[problem:CodeForces-1097F] Alex and a tv show位掩码(bitmasks) 组合数学(combinatorics), 数论(number theory\n[problem:CodeForces-813F] Bipartite checking数据结构(data structures) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1301E] Nanosoft二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1677D] Tokitsukaze and permutations动态规划(dp) 数学(math\n[problem:CodeForces-1513F] Swapping problem暴力枚举(brute force) 构造算法(constructive algorithms), 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-1823E] Removing graph暴力枚举(brute force) 动态规划(dp), 博弈论(games), 图论(graphs), 数学(math\n[problem:CodeForces-1320D] Reachable strings数据结构(data structures) 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1712E2] Lcm sum (hard version)暴力枚举(brute force) 数据结构(data structures), 数学(math), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-1534F1] Falling sand (easy version)深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-609F] Frogs and mosquitoes数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-1492E] Almost fault-tolerant database暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1556F] Sports betting位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 图论(graphs), 数学(math), 概率论(probabilities\n[problem:CodeForces-923D] Picking strings构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-710D] Two arithmetic progressions数学(math) 数论(number theory\n[problem:CodeForces-1137C] Museums tour动态规划(dp) 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-341D] Iahub and xors数据结构(data structures \n[problem:CodeForces-1689E] Andfinity位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-825G] Tree queries深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-1065F] Up and down the tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-706E] Working routine数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1922F] Replace on segment动态规划(dp) 图匹配(graph matchings\n[problem:CodeForces-771D] Bear and company动态规划(dp \n[problem:CodeForces-1313D] Happy new year位掩码(bitmasks) 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1146F] Leaf partition动态规划(dp) 树形结构(trees\n[problem:CodeForces-1623E] Middle duplication数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1307E] Cow and treats二分搜索(binary search) 组合数学(combinatorics), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1188A2] Add on a tree: revolution构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-333E] Summer earnings二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 计算几何(geometry), 排序算法(sortings\n[problem:CodeForces-1398F] Controversial rounds二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1334F] Strange function二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-360C] Levko and strings组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-1701E] Text editor暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1284E] New year and castle construction组合数学(combinatorics) 计算几何(geometry), 数学(math), 排序算法(sortings\n[problem:CodeForces-792E] Colored balls贪心策略(greedy) 数学(math), 数论(number theory\n[problem:CodeForces-1221E] Game with string博弈论(games \n[problem:CodeForces-1716E] Swap and maximum block位掩码(bitmasks) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 动态规划(dp\n[problem:CodeForces-1658E] Gojou and matrix game数据结构(data structures) 动态规划(dp), 博弈论(games), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-1716F] Bags with balls组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-835F] Roads in the kingdom深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1332F] Independent set深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1354F] Summoning minions构造算法(constructive algorithms) 动态规划(dp), 流(flows), 图匹配(graph matchings), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-613C] Necklace构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1625E1] Cats on the upgrade (easy version)暴力枚举(brute force) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1239B] The world is just a programming task (hard version)实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-1647E] Madoka and the sixth-graders数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy\n[problem:CodeForces-407C] Curious array暴力枚举(brute force) 组合数学(combinatorics), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1198E] Rectangle painting 2流(flows) 图匹配(graph matchings), 图论(graphs\n[problem:CodeForces-1517E] Group photo二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1771F] Hossam and range minimum query二分搜索(binary search) 位掩码(bitmasks), 数据结构(data structures), 哈希表(hashing), 概率论(probabilities), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1037F] Maximum reduction组合数学(combinatorics) 数据结构(data structures), 数学(math\n[problem:CodeForces-884F] Anti-palindromize流(flows) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1280D] Miss punyverse动态规划(dp) 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1948F] Rare coins组合数学(combinatorics) 数学(math), 概率论(probabilities\n[problem:CodeForces-799E] Aquarium decoration数据结构(data structures) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1539E] Game with cards二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1661E] Narrow components暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 并查集(dsu), 数学(math), 树形结构(trees\n[problem:CodeForces-729F] Financiers game动态规划(dp \n[problem:CodeForces-1691F] K-set tree组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 数学(math), 树形结构(trees\n[problem:CodeForces-53E] Dead ends位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-1374E2] Reading books (hard version)数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 三分搜索(ternary search), 双指针算法(two pointers\n[problem:CodeForces-1835B] Lottery二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1737E] Ela goes hiking组合数学(combinatorics) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-1840G2] In search of truth (hard version)构造算法(constructive algorithms) 交互性问题(interactive), 数学(math), Meet-in-the-middle算法(meet-in-the-middle), 概率论(probabilities\n[problem:CodeForces-1701F] Points组合数学(combinatorics) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math), 矩阵(matrices\n[problem:CodeForces-1783F] Double sort ii深度优先搜索及其变种(dfs and similar) 流(flows), 图匹配(graph matchings), 图论(graphs\n[problem:CodeForces-1917F] Construct tree位掩码(bitmasks) 构造算法(constructive algorithms), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1764F] Doremy\u0027s experimental tree暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1225F] Tree factory构造算法(constructive algorithms) 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1096E] The top scorer组合数学(combinatorics) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-555D] Case of a top secret二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1574E] Coloring组合数学(combinatorics) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-687D] Dividing kingdom ii暴力枚举(brute force) 数据结构(data structures), 并查集(dsu), 图论(graphs), 排序算法(sortings\n[problem:CodeForces-1920F1] Smooth sailing (easy version)二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-778C] Peterson polyglot暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 哈希表(hashing), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1847F] The boss\u0027s identity二分搜索(binary search) 位掩码(bitmasks), 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-735E] Ostap and tree动态规划(dp) 树形结构(trees\n[problem:CodeForces-1420E] Battle lemmings动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1806D] Dsu master组合数学(combinatorics) 动态规划(dp), 并查集(dsu), 数学(math\n[problem:CodeForces-1187F] Expected square beauty动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-1111E] Tree数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1100D] Dasha and chess构造算法(constructive algorithms) 博弈论(games), 交互性问题(interactive\n[problem:CodeForces-678F] Lena and queries数据结构(data structures) 分治算法(divide and conquer), 计算几何(geometry\n[problem:CodeForces-1767E] Algebra flash位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 图论(graphs), 数学(math), Meet-in-the-middle算法(meet-in-the-middle), 树形结构(trees\n[problem:CodeForces-1814D] Balancing weapons二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-17C] Balance动态规划(dp \n[problem:CodeForces-1612G] Max sum array组合数学(combinatorics) 构造算法(constructive algorithms), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-924D] Contact at \n[problem:CodeForces-1516E] Baby ehab plays with permutations组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1909F2] Small permutation problem (hard version)组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1251F] Red-white fence组合数学(combinatorics) 快速傅里叶变换(fft\n[problem:CodeForces-1017F] The neutral zone暴力枚举(brute force) 数学(math\n[problem:CodeForces-1876D] Lexichromatography组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 双指针算法(two pointers\n[problem:CodeForces-1468G] Hobbits二分搜索(binary search) 计算几何(geometry\n[problem:CodeForces-1778E] The tree has fallen!位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 数学(math), 树形结构(trees\n[problem:CodeForces-1498F] Christmas game位掩码(bitmasks) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 博弈论(games), 数学(math), 树形结构(trees\n[problem:CodeForces-1387B2] Village (maximum) special problem 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1030F] Putting boxes together数据结构(data structures \n[problem:CodeForces-605D] Board game数据结构(data structures) 深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-1904E] Tree queries数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-607C] Marbles哈希表(hashing) 字符串处理(strings\n[problem:CodeForces-610E] Alphabet permutations数据结构(data structures) 字符串处理(strings\n[problem:CodeForces-1758E] Tick Tock组合数学(combinatorics), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1891E] Brukhovich and exams暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-1734F] Zeros and ones位掩码(bitmasks) 分治算法(divide and conquer), 动态规划(dp), 数学(math\n[problem:CodeForces-666C] Codeword组合数学(combinatorics) 字符串处理(strings\n[problem:CodeForces-1788F] Xor Tree, And queries位掩码(bitmasks), 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-645F] Cowslip collections组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-1789E] Serval and music game暴力枚举(brute force) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1776C] Library game博弈论(games) 贪心策略(greedy), 交互性问题(interactive), 排序算法(sortings\n[problem:CodeForces-444D] Dzy loves strings二分搜索(binary search) 哈希表(hashing), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-995D] Game数学(math \n[problem:CodeForces-888F] Connecting vertices动态规划(dp) 图论(graphs\n[problem:CodeForces-147B] Smile house二分搜索(binary search) 图论(graphs), 矩阵(matrices\n[problem:CodeForces-908E] New year and entity enumeration位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-1775F] Laboratory on pluto构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-628F] Bear and fair set流(flows) 图论(graphs\n[problem:CodeForces-1918F] Caterpillar on a tree深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-501E] Misha and palindrome degree二分搜索(binary search) 组合数学(combinatorics), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-266E] More queries to array...数据结构(data structures) 数学(math\n[problem:CodeForces-1055E] Segments on the line二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-15D] Map数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1809F] Traveling in berland二分搜索(binary search) 数据结构(data structures), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-123E] Maze深度优先搜索及其变种(dfs and similar) 动态规划(dp), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-437E] The child and polygon动态规划(dp) 计算几何(geometry\n[problem:CodeForces-1903D2] Maximum and queries (hard version)位掩码(bitmasks) 分治算法(divide and conquer), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1796E] Colored subgraphs深度优先搜索及其变种(dfs and similar) 动态规划(dp), 博弈论(games), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-86C] Genetic engineering动态规划(dp) 字符串后缀结构(string suffix structures), 树形结构(trees\n[problem:CodeForces-55E] Very simple problem计算几何(geometry) 双指针算法(two pointers\n[problem:CodeForces-1195F] Geometers anonymous club数据结构(data structures) 计算几何(geometry), 数学(math), 排序算法(sortings\n[problem:CodeForces-981F] Round marriage二分搜索(binary search) 图匹配(graph matchings), 贪心策略(greedy\n[problem:CodeForces-1666E] Even split二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-976D] Degree set构造算法(constructive algorithms) 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1312F] Attack on red kingdom博弈论(games) 双指针算法(two pointers\n[problem:CodeForces-1771E] Hossam and a letter暴力枚举(brute force) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-383B] Volcanoes二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1731F] Function sum暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 快速傅里叶变换(fft), 数学(math\n[problem:CodeForces-1673E] Power or xor?位掩码(bitmasks) 组合数学(combinatorics), 数学(math), 数论(number theory\n[problem:CodeForces-40E] Number table组合数学(combinatorics \n[problem:CodeForces-837G] Functions on the segments数据结构(data structures \n[problem:CodeForces-295E] Yaroslav and points数据结构(data structures \n[problem:CodeForces-884E] Binary matrix并查集(dsu \n[problem:CodeForces-1776I] Spinach pizza博弈论(games) 计算几何(geometry), 贪心策略(greedy), 交互性问题(interactive\n[problem:CodeForces-1808E2] Minibuses on venus (medium version)组合数学(combinatorics) 分治算法(divide and conquer), 动态规划(dp), 矩阵(matrices\n[problem:CodeForces-1236E] Alice and the unfair game二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 并查集(dsu\n[problem:CodeForces-1117G] Recursive queries数据结构(data structures \n[problem:CodeForces-981G] Magic multisets数据结构(data structures \n[problem:CodeForces-1787F] Inverse transformation构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-946G] Almost increasing array数据结构(data structures) 动态规划(dp\n[problem:CodeForces-1076F] Summer practice report动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-571C] Cnf 2构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1776J] Italian data centers图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-1611G] Robot and candies数据结构(data structures) 图匹配(graph matchings), 贪心策略(greedy\n[problem:CodeForces-712E] Memory and casinos数据结构(data structures) 数学(math), 概率论(probabilities\n[problem:CodeForces-993D] Compute power二分搜索(binary search) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-618E] Robot arm数据结构(data structures) 计算几何(geometry\n[problem:CodeForces-91E] Igloo skyscraper数据结构(data structures) 计算几何(geometry\n[problem:CodeForces-23E] Tree动态规划(dp \n[problem:CodeForces-1085F] Rock-paper-scissors champio \n[problem:CodeForces-1725K] Kingdom of criticism数据结构(data structures) 并查集(dsu\n[problem:CodeForces-1946F] Nobody is needed二分图可满足性问题(2-sat) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp\n[problem:CodeForces-1186E] Vus the cossack and a field分治算法(divide and conquer) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-954H] Path counting组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-976F] Minimal k-covering流(flows) 图论(graphs\n[problem:CodeForces-425E] Sereja and sets动态规划(dp \n[problem:CodeForces-351C] Jeff and brackets动态规划(dp) 矩阵(matrices\n[problem:CodeForces-1709F] Multiset of strings位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 快速傅里叶变换(fft), 流(flows), 图论(graphs), 数学(math), Meet-in-the-middle算法(meet-in-the-middle), 树形结构(trees\n[problem:CodeForces-1903F] Babysitting二分图可满足性问题(2-sat) 二分搜索(binary search), 数据结构(data structures), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1073F] Choosing two paths深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-314D] Sereja and straight lines二分搜索(binary search) 数据结构(data structures), 计算几何(geometry), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-909F] And-permutations构造算法(constructive algorithms \n[problem:CodeForces-1945G] Cook and porridge二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1117F] Crisp string位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-912C] Perun Ult!暴力枚举(brute force), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-989D] A shade of moonlight二分搜索(binary search) 计算几何(geometry), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1423H] Virus数据结构(data structures) 分治算法(divide and conquer), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1717F] Madoka and the first session构造算法(constructive algorithms) 流(flows), 图匹配(graph matchings), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-297D] Color the carpet构造算法(constructive algorithms \n[problem:CodeForces-1310B] Double elimination动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-317C] Balance构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1187G] Gang up流(flows) 图论(graphs\n[problem:CodeForces-958C3] Encryption (hard)数据结构(data structures) 动态规划(dp\n[problem:CodeForces-1505H] L break into program special proble \n[problem:CodeForces-1834F] Typewriter暴力枚举(brute force) 数学(math\n[problem:CodeForces-101E] Candies and stones分治算法(divide and conquer) 动态规划(dp\n[problem:CodeForces-594B] Max and bike二分搜索(binary search) 计算几何(geometry\n[problem:CodeForces-311C] Fetch the treasure暴力枚举(brute force) 数据结构(data structures), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-855D] Rowena ravenclaw\u0027s diadem树形结构(trees \n[problem:CodeForces-433E] Tachibana kanade\u0027s tofu动态规划(dp \n[problem:CodeForces-119D] String transformation哈希表(hashing) 字符串处理(strings\n[problem:CodeForces-1468I] Plane tiling计算几何(geometry) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-138D] World of darkraft动态规划(dp) 博弈论(games\n[problem:CodeForces-1798F] Gifts from grandfather ahmed动态规划(dp) 数学(math), 数论(number theory\n[problem:CodeForces-161E] Polycarpus the safecracker暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-1056F] Write the contest二分搜索(binary search) 动态规划(dp), 数学(math\n[problem:CodeForces-331C3] The great julya calendar动态规划(dp \n[problem:CodeForces-301C] Yaroslav and algorithm构造算法(constructive algorithms \n[problem:CodeForces-611F] New year and cleaning二分搜索(binary search) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-212D] Cutting a fence二分搜索(binary search) 数据结构(data structures), 并查集(dsu\n[problem:CodeForces-1181E1] A story of one country (easy)暴力枚举(brute force) 分治算法(divide and conquer), 排序算法(sortings\n[problem:CodeForces-681E] Runaway to a shadow计算几何(geometry) 排序算法(sortings\n[problem:CodeForces-152E] Garden位掩码(bitmasks) 动态规划(dp), 图论(graphs), 树形结构(trees\n[problem:CodeForces-68D] Half-decay tree数据结构(data structures) 分治算法(divide and conquer), 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-1773I] Interactive factorial guessing暴力枚举(brute force) 博弈论(games), 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive\n[problem:CodeForces-1725E] Electrical efficiency组合数学(combinatorics) 数据结构(data structures), 动态规划(dp), 数学(math), 数论(number theory), 树形结构(trees\n[problem:CodeForces-832C] Strange radiation二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1906L] Palindromic parentheses构造算法(constructive algorithms \n[problem:CodeForces-1228F] One node is gone构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-845F] Guards in the storehouse位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-95D] Horse races动态规划(dp) 数学(math\n[problem:CodeForces-747F] Igor and interesting numbers暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-380D] Sereja and cinema组合数学(combinatorics) 数学(math\n[problem:CodeForces-260E] Dividing kingdom二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures\n[problem:CodeForces-264D] Colorful stones动态规划(dp) 双指针算法(two pointers\n[problem:CodeForces-93C] Azembler暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1089C] Cactus search交互性问题(interactive \n[problem:CodeForces-1866K] Keen tree calculation二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 计算几何(geometry), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-60D] Savior暴力枚举(brute force) 并查集(dsu), 数学(math\n[problem:CodeForces-263E] Rhombus暴力枚举(brute force) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-178F3] Representative samplin \n[problem:CodeForces-329D] The evil temple and the moving rocks构造算法(constructive algorithms \n[problem:CodeForces-930D] Game with tokens数据结构(data structures) 博弈论(games), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-596E] Wilbur and strings深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 字符串处理(strings\n[problem:CodeForces-852A] Digits暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1139F] Dish shopping数据结构(data structures) 分治算法(divide and conquer\n[problem:CodeForces-1725J] Journey动态规划(dp) 树形结构(trees\n[problem:CodeForces-1218E] Product tuples分治算法(divide and conquer) 快速傅里叶变换(fft\n[problem:CodeForces-44G] Shooting gallery数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1250M] Smartgarden构造算法(constructive algorithms) 分治算法(divide and conquer\n[problem:CodeForces-883D] Packmen strike back二分搜索(binary search) 动态规划(dp), 数学(math\n[problem:CodeForces-166D] Shoe store动态规划(dp) 图匹配(graph matchings), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-379E] New year tree decorations计算几何(geometry) 调度算法(schedules), 排序算法(sortings\n[problem:CodeForces-566G] Max and min计算几何(geometry \n[problem:CodeForces-117D] Not quick transformation分治算法(divide and conquer) 数学(math\n[problem:CodeForces-93D] Flags动态规划(dp) 数学(math), 矩阵(matrices\n[problem:CodeForces-57D] Journey动态规划(dp) 数学(math\n[problem:CodeForces-1045A] Last chance数据结构(data structures) 流(flows), 图匹配(graph matchings), 图论(graphs), 树形结构(trees\n[problem:CodeForces-67E] Save the city!计算几何(geometry \n[problem:CodeForces-98C] Help greg the dwarf计算几何(geometry) 三分搜索(ternary search\n[problem:CodeForces-176D] Hyper string动态规划(dp \n[problem:CodeForces-294D] Shaass and painter robot暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation), 数论(number theory\n[problem:CodeForces-135D] Cycle暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-822F] Madness构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-753C] Interactive bulls and cows (hard)暴力枚举(brute force) 构造算法(constructive algorithms), 交互性问题(interactive\n[problem:CodeForces-220D] Little elephant and triangle计算几何(geometry) 数学(math\n[problem:CodeForces-121D] Lucky segments二分搜索(binary search) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1906K] Deck-building game分治算法(divide and conquer) 数学(math\n[problem:CodeForces-173D] Deputies构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-370E] Summer reading动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-883L] Berland.taxi数据结构(data structures \n[problem:CodeForces-89D] Space mines计算几何(geometry \n[problem:CodeForces-435E] Special grap \n[problem:CodeForces-363E] Two circles暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-290E] Hq special problem 构造算法(constructive algorithms\n[problem:CodeForces-98D] Help monks构造算法(constructive algorithms \n[problem:CodeForces-105E] Lift and throw暴力枚举(brute force \n[problem:CodeForces-401E] Olympic games数学(math \n[problem:CodeForces-1585G] Poachers动态规划(dp) 博弈论(games), 图论(graphs), 树形结构(trees\n[problem:CodeForces-887F] Row of models贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-185C] Clever fat rat动态规划(dp \n[problem:CodeForces-424E] Colored jenga深度优先搜索及其变种(dfs and similar) 动态规划(dp), 概率论(probabilities\n[problem:CodeForces-45F] Goats and wolves贪心策略(greedy \n[problem:CodeForces-39I] Tra \n[problem:CodeForces-1488G] Painting numbers special problem 数据结构(data structures), 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-46G] Emperor\u0027s problem计算几何(geometry \n[problem:CodeForces-1090G] Combostone博弈论(games) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1571G] A battle against a dragon special problem 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-1211G] King\u0027s path special problem 数学(math), 树形结构(trees\n[problem:CodeForces-530I] Different variables special proble \n[problem:CodeForces-683I] Loader special problem 图论(graphs\n","threadId":188475,"likeCnt":0,"createTime":1711959591000,"isWorkbook":true,"viewCnt":50,"openness":2,"fav":false,"id":4797,"trustable":false}