Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-293C\":[\"Cube Problem\",567,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/293\\\"\\u003eCroc Champ 2013 - Round 2\\u003c/a\\u003e\"],\"CodeForces-32E\":[\"Hide-and-Seek\",333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/32\\\"\\u003eCodeforces Beta Round 32 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1267A\":[\"Apprentice Learning Trajectory\",812,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1267\\\"\\u003e2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1146E\":[\"Hot is Cold\",885,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1146\\\"\\u003eForethought Future Cup - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1340C\":[\"Nastya and Unexpected Guest\",2093,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1340\\\"\\u003eCodeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov!\\u003c/a\\u003e\"],\"CodeForces-1473E\":[\"Minimum Path\",3431,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1473\\\"\\u003eEducational Codeforces Round 102 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1485F\":[\"Copy or Prefix Sum\",1965,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1485\\\"\\u003eCodeforces Round 701 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1594F\":[\"Ideal Farm\",1278,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1594\\\"\\u003eCodeforces Round 747 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-605C\":[\"Freelancer\\u0027s Dreams\",1139,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/605\\\"\\u003eCodeforces Round 335 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-835E\":[\"The penguin\\u0027s game\",1196,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-847J\":[\"Students Initiation\",686,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-920D\":[\"Tanks\",716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-932E\":[\"Team Work\",3032,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/932\\\"\\u003eICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-847L\":[\"Berland SU Computer Network\",327,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-160E\":[\"Buses and People\",706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/160\\\"\\u003eCodeforces Round 111 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-21D\":[\"Traveling Graph\",888,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/21\\\"\\u003eCodeforces Alpha Round 21 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1905E\":[\"One-X\",838,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1905\\\"\\u003eCodeforces Round 915 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1036E\":[\"Covered Points\",1510,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1036\\\"\\u003eEducational Codeforces Round 50 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1000F\":[\"One Occurrence\",3898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1000\\\"\\u003eEducational Codeforces Round 46 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1036F\":[\"Relatively Prime Powers\",1464,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1036\\\"\\u003eEducational Codeforces Round 50 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1242C\":[\"Sum Balance\",1501,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1242\\\"\\u003eCodeforces Round 599 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-749E\":[\"Inversions After Shuffle\",1117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/749\\\"\\u003eCodeforces Round 388 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-979E\":[\"Kuro and Topological Parity\",634,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/979\\\"\\u003eCodeforces Round 482 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-513G2\":[\"Inversions problem\",637,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/513\\\"\\u003eRockethon 2015\\u003c/a\\u003e\"],\"CodeForces-822E\":[\"Liar\",788,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/822\\\"\\u003eCodeforces Round 422 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1827B2\":[\"Range Sorting (Hard Version)\",1766,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1827\\\"\\u003eCodeforces Round 873 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1809E\":[\"Two Tanks\",802,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1809\\\"\\u003eEducational Codeforces Round 145 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1059E\":[\"Split the Tree\",1419,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1059\\\"\\u003eCodeforces Round 514 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1882E1\":[\"Two Permutations (Easy Version)\",952,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1882\\\"\\u003eCodeforces Round 899 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-409I\":[\"Feed the Golorp\",118,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/409\\\"\\u003eApril Fools Day Contest 2014\\u003c/a\\u003e\"],\"CodeForces-1374F\":[\"Cyclic Shifts Sorting\",1281,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1374\\\"\\u003eCodeforces Round 653 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1144G\":[\"Two Merged Sequences\",1875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1144\\\"\\u003eCodeforces Round 550 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-639D\":[\"Bear and Contribution\",805,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/639\\\"\\u003eVK Cup 2016 - Round 1\\u003c/a\\u003e\"],\"CodeForces-506D\":[\"Mr. Kitayuta\\u0027s Colorful Graph\",2250,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/506\\\"\\u003eCodeforces Round 286 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-869E\":[\"The Untended Antiquity\",1681,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/869\\\"\\u003eCodeforces Round 439 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1132G\":[\"Greedy Subsequences\",1004,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1132\\\"\\u003eEducational Codeforces Round 61 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-845E\":[\"Fire in the City\",621,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"CodeForces-1592E\":[\"Bored Bakry\",1564,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1592\\\"\\u003eCodeforces Round 746 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-31E\":[\"TV Game\",1144,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/31\\\"\\u003eCodeforces Beta Round 31 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1542E1\":[\"Abnormal Permutation Pairs (easy version)\",1181,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1542\\\"\\u003eCodeforces Round 729 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1494E\":[\"A-Z Graph\",1687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1494\\\"\\u003eEducational Codeforces Round 105 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1264C\":[\"Beautiful Mirrors with queries\",1136,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1264\\\"\\u003eCodeforces Round 604 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-856D\":[\"Masha and Cactus\",400,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/856\\\"\\u003eRussian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]\\u003c/a\\u003e\"],\"CodeForces-626E\":[\"Simple Skewness\",1470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/626\\\"\\u003e8VC Venture Cup 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-856C\":[\"Eleventh Birthday\",543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/856\\\"\\u003eRussian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]\\u003c/a\\u003e\"],\"CodeForces-1252F\":[\"Regular Forestation\",938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1252\\\"\\u003e2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-626F\":[\"Group Projects\",2971,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/626\\\"\\u003e8VC Venture Cup 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1373F\":[\"Network Coverage\",1684,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1373\\\"\\u003eEducational Codeforces Round 90 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1482F\":[\"Useful Edges\",1477,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1482\\\"\\u003eТехнокубок 2021 - Финал\\u003c/a\\u003e\"],\"CodeForces-1819C\":[\"The Fox and the Complete Tree Traversal\",1404,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1819\\\"\\u003eCodeforces Round 866 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-193C\":[\"Hamming Distance\",515,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/193\\\"\\u003eCodeforces Round 122 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-273D\":[\"Dima and Figure\",417,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/273\\\"\\u003eCodeforces Round 167 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-164C\":[\"Machine Programming\",1001,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/164\\\"\\u003eVK Cup 2012 Round 3\\u003c/a\\u003e\"],\"CodeForces-297C\":[\"Splitting the Uniqueness\",984,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/297\\\"\\u003eCodeforces Round 180 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-12D\":[\"Ball\",2257,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/12\\\"\\u003eCodeforces Beta Round 12 (Div 2 Only)\\u003c/a\\u003e\"],\"CodeForces-24D\":[\"Broken robot\",2115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/24\\\"\\u003eCodeforces Beta Round 24\\u003c/a\\u003e\"],\"CodeForces-1114F\":[\"Please, another Queries on Array?\",1936,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1114\\\"\\u003eCodeforces Round 538 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1792E\":[\"Divisors and Table\",1360,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1792\\\"\\u003eEducational Codeforces Round 142 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1780E\":[\"Josuke and Complete Graph\",1312,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1780\\\"\\u003eCodeforces Round 846 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1017E\":[\"The Supersonic Rocket\",828,\"\\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-707E\":[\"Garlands\",1052,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/707\\\"\\u003eCodeforces Round 368 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1598F\":[\"RBS\",1372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1598\\\"\\u003eEducational Codeforces Round 115 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-912E\":[\"Prime Gift\",1605,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/912\\\"\\u003eCodeforces Round 456 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-316G3\":[\"Good Substrings\",529,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-1780G\":[\"Delicious Dessert\",681,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1780\\\"\\u003eCodeforces Round 846 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-175D\":[\"Plane of Tanks: Duel\",300,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/175\\\"\\u003eCodeforces Round 115\\u003c/a\\u003e\"],\"CodeForces-1004E\":[\"Sonya and Ice Cream\",1056,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1004\\\"\\u003eCodeforces Round 495 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1585F\":[\"Non-equal Neighbours\",1186,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1585\\\"\\u003eTechnocup 2022 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1343F\":[\"Restore the Permutation by Sorted Segments\",1265,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1343\\\"\\u003eCodeforces Round 636 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1585E\":[\"Frequency Queries\",1008,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1585\\\"\\u003eTechnocup 2022 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1028E\":[\"Restore Array\",1164,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1028\\\"\\u003eAIM Tech Round 5 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1016E\":[\"Rest In The Shades\",962,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1016\\\"\\u003eEducational Codeforces Round 48 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1137D\":[\"Cooperative Game\",1486,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1137\\\"\\u003eCodeforces Round 545 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-815C\":[\"Karen and Supermarket\",2739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/815\\\"\\u003eCodeforces Round 419 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1101F\":[\"Trucks and Cities\",1341,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1101\\\"\\u003eEducational Codeforces Round 58 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1210D\":[\"Konrad and Company Evaluation\",1430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1210\\\"\\u003eDasha Code Championship - SPb Finals Round (only for onsite-finalists)\\u003c/a\\u003e\"],\"CodeForces-717H\":[\"Pokermon League challenge\",422,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/717\\\"\\u003eBubble Cup 9 - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-717G\":[\"Underfail\",657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/717\\\"\\u003eBubble Cup 9 - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-959F\":[\"Mahmoud and Ehab and yet another xor task\",2096,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/959\\\"\\u003eCodeforces Round 473 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1670F\":[\"Jee, You See?\",933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1670\\\"\\u003eCodeforces Round 788 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-911F\":[\"Tree Destruction\",1640,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-802L\":[\"Send the Fool Further! (hard)\",286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-802N\":[\"April Fools\\u0027 Problem (medium)\",1137,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-283D\":[\"Cows and Cool Sequences\",571,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/283\\\"\\u003eCodeforces Round 174 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-380B\":[\"Sereja and Tree\",538,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/380\\\"\\u003eCodeforces Round 223 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-295D\":[\"Greg and Caves\",698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/295\\\"\\u003eCodeforces Round 179 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-198E\":[\"Gripping Story\",429,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/198\\\"\\u003eCodeforces Round 125 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-198C\":[\"Delivering Carcinogen\",387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/198\\\"\\u003eCodeforces Round 125 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-58E\":[\"Expression\",388,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/58\\\"\\u003eCodeforces Beta Round 54 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1027F\":[\"Session in BSU\",1648,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1027\\\"\\u003eEducational Codeforces Round 49 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1257F\":[\"Make Them Similar\",2107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1257\\\"\\u003eEducational Codeforces Round 76 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1463E\":[\"Plan of Lectures\",1463,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1463\\\"\\u003eEducational Codeforces Round 100 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1221F\":[\"Choose a Square\",1065,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1221\\\"\\u003eEducational Codeforces Round 73 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1499E\":[\"Chaotic Merge\",1434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1499\\\"\\u003eEducational Codeforces Round 106 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1499F\":[\"Diameter Cuts\",1293,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1499\\\"\\u003eEducational Codeforces Round 106 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1706D2\":[\"Chopping Carrots (Hard Version)\",1660,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1706\\\"\\u003eCodeforces Round 809 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-946F\":[\"Fibonacci String Subsequences\",571,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/946\\\"\\u003eEducational Codeforces Round 39 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-825F\":[\"String Compression\",1488,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-837F\":[\"Prefix Sums\",763,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"CodeForces-513D1\":[\"Constrained Tree\",427,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/513\\\"\\u003eRockethon 2015\\u003c/a\\u003e\"],\"CodeForces-922F\":[\"Divisibility\",643,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1909E\":[\"Multiple Lamps\",1234,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1909\\\"\\u003ePinely Round 3 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-161C\":[\"Abracadabra\",682,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/161\\\"\\u003eVK Cup 2012 Round 1\\u003c/a\\u003e\"],\"CodeForces-1147D\":[\"Palindrome XOR\",735,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1147\\\"\\u003eForethought Future Cup - Final Round (Onsite Finalists Only)\\u003c/a\\u003e\"],\"CodeForces-1680D\":[\"Dog Walking\",1115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1680\\\"\\u003eEducational Codeforces Round 128 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1038E\":[\"Maximum Matching\",1000,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1038\\\"\\u003eCodeforces Round 508 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1244G\":[\"Running in Pairs\",1341,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1244\\\"\\u003eCodeforces Round 592 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1367F2\":[\"Flying Sort (Hard Version)\",1500,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1367\\\"\\u003eCodeforces Round 650 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-316D3\":[\"PE Lesson\",542,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/316\\\"\\u003eABBYY Cup 3.0\\u003c/a\\u003e\"],\"CodeForces-1450F\":[\"The Struggling Contestant\",1283,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1450\\\"\\u003eCodeforces Global Round 12\\u003c/a\\u003e\"],\"CodeForces-350D\":[\"Looking for Owls\",286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/350\\\"\\u003eCodeforces Round 203 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-277E\":[\"Binary Tree on Plane\",1334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/277\\\"\\u003eCodeforces Round 170 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1837F\":[\"Editorial for Two\",2105,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1837\\\"\\u003eEducational Codeforces Round 149 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-277C\":[\"Game\",457,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/277\\\"\\u003eCodeforces Round 170 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1619H\":[\"Permutation and Queries\",1104,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1619\\\"\\u003eCodeforces Round 762 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-929D\":[\"Пограничные врата\",148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/929\\\"\\u003eVK Cup 2018 - Квалификация 2\\u003c/a\\u003e\"],\"CodeForces-1910H\":[\"Sum of Digits of Sums\",77,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1910\\\"\\u003eKotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!)\\u003c/a\\u003e\"],\"CodeForces-808F\":[\"Card Game\",1198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"CodeForces-1089K\":[\"King Kog\\u0027s Reception\",1111,\"\\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-1174F\":[\"Ehab and the Big Finale\",1513,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1174\\\"\\u003eCodeforces Round 563 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1186F\":[\"Vus the Cossack and a Graph\",780,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1186\\\"\\u003eCodeforces Round 571 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1089M\":[\"Minegraphed\",585,\"\\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-1392F\":[\"Omkar and Landslide\",1967,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1392\\\"\\u003eCodeforces Global Round 10\\u003c/a\\u003e\"],\"CodeForces-1632E1\":[\"Distance Tree (easy version)\",1130,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1632\\\"\\u003eCodeforces Round 769 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1608D\":[\"Dominoes\",1368,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1608\\\"\\u003eCodeforces Round 758 (Div.1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-97C\":[\"Winning Strategy\",301,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/97\\\"\\u003eYandex.Algorithm 2011: Finals\\u003c/a\\u003e\"],\"CodeForces-1606D\":[\"Red-Blue Matrix\",1431,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1606\\\"\\u003eEducational Codeforces Round 116 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-97A\":[\"Domino\",256,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/97\\\"\\u003eYandex.Algorithm 2011: Finals\\u003c/a\\u003e\"],\"CodeForces-288D\":[\"Polo the Penguin and Trees\",705,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/288\\\"\\u003eCodeforces Round 177 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1715E\":[\"Long Way Home\",1687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1715\\\"\\u003eCodeforces Round 816 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1848F\":[\"Vika and Wiki\",1501,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1848\\\"\\u003eCodeforces Round 885 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1739E\":[\"Cleaning Robot\",1203,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1739\\\"\\u003eEducational Codeforces Round 136 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-916E\":[\"Jamie and Tree\",1653,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/916\\\"\\u003eCodeforces Round 457 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1088E\":[\"Ehab and a component choosing problem\",1458,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1088\\\"\\u003eCodeforces Round 525 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1184E3\":[\"Daleks\\u0027 Invasion (hard)\",526,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1184\\\"\\u003eHelvetic Coding Contest 2019 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-1282E\":[\"The Cake Is a Lie\",1017,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1282\\\"\\u003eCodeforces Round 610 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-915F\":[\"Imbalance Value of a Tree\",2450,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-73E\":[\"Morrowindows\",324,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/73\\\"\\u003eCodeforces Beta Round 66\\u003c/a\\u003e\"],\"CodeForces-154D\":[\"Flatland Fencing\",441,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/154\\\"\\u003eCodeforces Round 109 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1726E\":[\"Almost Perfect\",1376,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1726\\\"\\u003eCodeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022\\u003c/a\\u003e\"],\"CodeForces-1738F\":[\"Connectivity Addicts\",1180,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1738\\\"\\u003eCodeforces Global Round 22\\u003c/a\\u003e\"],\"CodeForces-1605E\":[\"Array Equalizer\",1025,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1605\\\"\\u003eCodeforces Round 754 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1099F\":[\"Cookies\",950,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1099\\\"\\u003eCodeforces Round 530 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-939F\":[\"Cutlet\",975,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/939\\\"\\u003eCodeforces Round 464 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1051F\":[\"The Shortest Statement\",2873,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1051\\\"\\u003eEducational Codeforces Round 51 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-914E\":[\"Palindromes in a Tree\",1540,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1713E\":[\"Cross Swapping\",1538,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1713\\\"\\u003eCodeforces Round 812 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1749E\":[\"Cactus Wall\",1650,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1749\\\"\\u003eEducational Codeforces Round 138 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1725L\":[\"Lemper Cooking Competition\",905,\"\\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-1098C\":[\"Construct a tree\",926,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1098\\\"\\u003eCodeforces Round 530 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1304F2\":[\"Animal Observation (hard version)\",1357,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1304\\\"\\u003eCodeforces Round 620 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-913E\":[\"Logical Expression\",767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/913\\\"\\u003eHello 2018\\u003c/a\\u003e\"],\"CodeForces-83D\":[\"Numbers\",892,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/83\\\"\\u003eCodeforces Beta Round 72 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-83C\":[\"Track\",411,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/83\\\"\\u003eCodeforces Beta Round 72 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1938K\":[\"Tree Quiz\",524,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1938\\\"\\u003e2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-342E\":[\"Xenia and Tree\",8365,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/342\\\"\\u003eCodeforces Round 199 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1902F\":[\"Trees and XOR Queries Again\",910,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1902\\\"\\u003eEducational Codeforces Round 159 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-177G1\":[\"Fibonacci Strings\",165,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/177\\\"\\u003eABBYY Cup 2.0 - Easy\\u003c/a\\u003e\"],\"CodeForces-1774F1\":[\"Magician and Pigs (Easy Version)\",1022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1774\\\"\\u003ePolynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1938F\":[\"Forming Groups\",639,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1938\\\"\\u003e2024 ICPC Asia Pacific Championship - Online Mirror (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-354B\":[\"Game with Strings\",465,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/354\\\"\\u003eCodeforces Round 206 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1045B\":[\"Space Isaac\",520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1045\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-690A3\":[\"Collective Mindsets (hard)\",523,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/690\\\"\\u003eHelvetic Coding Contest 2016 online mirror (teams, unrated)\\u003c/a\\u003e\"],\"CodeForces-1166F\":[\"Vicky\\u0027s Delivery Service\",723,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1166\\\"\\u003eCodeforces Round 561 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1142C\":[\"U2\",1196,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1142\\\"\\u003eCodeforces Round 549 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1005E2\":[\"Median on Segments (General Case Edition)\",1249,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1005\\\"\\u003eCodeforces Round 496 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1045H\":[\"Self-exploration\",381,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1045\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 1]\\u003c/a\\u003e\"],\"CodeForces-1263F\":[\"Economic Difficulties\",853,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1263\\\"\\u003eCodeforces Round 603 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1709E\":[\"XOR Tree\",2491,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1709\\\"\\u003eEducational Codeforces Round 132 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-64I\":[\"Sort the Table\",84,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/64\\\"\\u003eUnknown Language Round 1\\u003c/a\\u003e\"],\"CodeForces-100J\":[\"Interval Coloring\",60,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/100\\\"\\u003eUnknown Language Round 3\\u003c/a\\u003e\"],\"CodeForces-220E\":[\"Little Elephant and Inversions\",1496,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/220\\\"\\u003eCodeforces Round 136 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1804E\":[\"Routing\",1383,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1804\\\"\\u003eNebius Welcome Round (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1913E\":[\"Matrix Problem\",906,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1913\\\"\\u003eEducational Codeforces Round 160 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-256E\":[\"Lucky Arrays\",707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/256\\\"\\u003eCodeforces Round 156 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-377D\":[\"Developing Game\",1201,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/377\\\"\\u003eCodeforces Round 222 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-908F\":[\"New Year and Rainbow Roads\",1453,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"CodeForces-1044D\":[\"Deduction Queries\",1018,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1044\\\"\\u003eLyft Level 5 Challenge 2018 - Final Round\\u003c/a\\u003e\"],\"CodeForces-1032F\":[\"Vasya and Maximum Matching\",928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1032\\\"\\u003eTechnocup 2019 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-498B\":[\"Name That Tune\",1226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/498\\\"\\u003eCodeforces Round 284 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1817C\":[\"Similar Polynomials\",928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1817\\\"\\u003eCodeforces Round 869 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-498D\":[\"Traffic Jams in the Land\",1187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/498\\\"\\u003eCodeforces Round 284 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1912H\":[\"Hypercatapult Commute\",370,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1912\\\"\\u003e2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1912G\":[\"Great City Saint Petersburg\",415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1912\\\"\\u003e2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-74D\":[\"Hanger\",407,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/74\\\"\\u003eCodeforces Beta Round 68\\u003c/a\\u003e\"],\"CodeForces-1839E\":[\"Decreasing Game\",1168,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1839\\\"\\u003eCodeforces Round 876 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1924C\":[\"Fractal Origami\",1044,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1924\\\"\\u003eCodeforces Round 921 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1936C\":[\"Pokémon Arena\",1059,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1936\\\"\\u003eCodeforces Round 930 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1055D\":[\"Refactoring\",634,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1055\\\"\\u003eMail.Ru Cup 2018 Round 2\\u003c/a\\u003e\"],\"CodeForces-1227F2\":[\"Wrong Answer on test 233 (Hard Version)\",1498,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1227\\\"\\u003eTechnocup 2020 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1152E\":[\"Neko and Flashback\",962,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1152\\\"\\u003eCodeforces Round 554 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1491E\":[\"Fib-tree\",2079,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1491\\\"\\u003eCodeforces Global Round 13\\u003c/a\\u003e\"],\"CodeForces-1707C\":[\"DFS Trees\",1407,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1707\\\"\\u003eCodeforces Round 808 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-582C\":[\"Superior Periodic Subarrays\",751,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/582\\\"\\u003eCodeforces Round 323 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-581F\":[\"Zublicanes and Mumocrates\",901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/581\\\"\\u003eCodeforces Round 322 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-75E\":[\"Ship\\u0027s Shortest Path\",290,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/75\\\"\\u003eCodeforces Beta Round 67 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-121E\":[\"Lucky Array\",1964,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/121\\\"\\u003eCodeforces Beta Round 91 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-375D\":[\"Tree and Queries\",7116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/375\\\"\\u003eCodeforces Round 221 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1826E\":[\"Walk the Runway\",1535,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1826\\\"\\u003eCodeforces Round 870 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1935E\":[\"Distance Learning Courses in MAC\",1156,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1935\\\"\\u003eCodeforces Round 932 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-145E\":[\"Lucky Queries\",3239,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/145\\\"\\u003eCodeforces Round 104 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-266D\":[\"BerDonalds\",770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/266\\\"\\u003eCodeforces Round 163 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1054E\":[\"Chips Puzzle\",495,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1054\\\"\\u003eMail.Ru Cup 2018 Round 1\\u003c/a\\u003e\"],\"CodeForces-906C\":[\"Party\",1333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/906\\\"\\u003eCodeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-1187D\":[\"Subarray Sorting\",2557,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1260E\":[\"Tournament\",1671,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1260\\\"\\u003eEducational Codeforces Round 77 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1042F\":[\"Leaf Sets\",1295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1042\\\"\\u003eCodeforces Round 510 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1163E\":[\"Magical Permutation\",666,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1163\\\"\\u003eCodeforces Round 558 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1718C\":[\"Tonya and Burenka-179\",1546,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1718\\\"\\u003eCodeforces Round 814 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1609E\":[\"William The Oblivious\",1893,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1609\\\"\\u003eDeltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-51E\":[\"Pentagon\",399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/51\\\"\\u003eCodeforces Beta Round 48\\u003c/a\\u003e\"],\"CodeForces-484D\":[\"Kindergarten\",2642,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/484\\\"\\u003eCodeforces Round 276 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-593D\":[\"Happy Tree Party\",1377,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/593\\\"\\u003eCodeforces Round 329 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-593E\":[\"Strange Calculation and Cats\",432,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/593\\\"\\u003eCodeforces Round 329 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1526E\":[\"Oolimry and Suffix Array\",1050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1526\\\"\\u003eCodeforces Round 723 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-331D1\":[\"Escaping on Beaveractor\",198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/331\\\"\\u003eABBYY Cup 3.0 - Finals (online version)\\u003c/a\\u003e\"],\"CodeForces-1093F\":[\"Vasya and Array\",1000,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1093\\\"\\u003eEducational Codeforces Round 56 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-467D\":[\"Fedor and Essay\",1943,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/467\\\"\\u003eCodeforces Round 267 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1093E\":[\"Intersection of Permutations\",1541,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1093\\\"\\u003eEducational Codeforces Round 56 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-794D\":[\"Labelling Cities\",773,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/794\\\"\\u003eTinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-661H\":[\"Rotate Matrix\",63,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/661\\\"\\u003eVK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror)\\u003c/a\\u003e\"],\"CodeForces-1428F\":[\"Fruit Sequences\",2189,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1428\\\"\\u003eCodeforces Raif Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1852C\":[\"Ina of the Mountain\",1474,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1852\\\"\\u003eCodeforces Round 887 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1634E\":[\"Fair Share\",1685,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1634\\\"\\u003eCodeforces Round 770 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1779E\":[\"Anya\\u0027s Simultaneous Exhibition\",1718,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1779\\\"\\u003eHello 2023\\u003c/a\\u003e\"],\"CodeForces-200E\":[\"Tractor College\",363,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/200\\\"\\u003eCodeforces Round 126 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-115E\":[\"Linear Kingdom Races\",1511,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/115\\\"\\u003eCodeforces Beta Round 87 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-200A\":[\"Cinema\",723,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/200\\\"\\u003eCodeforces Round 126 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1743E\":[\"FTL\",1484,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1743\\\"\\u003eEducational Codeforces Round 137 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1080F\":[\"Katya and Segments Sets\",777,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1080\\\"\\u003eCodeforces Round 524 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1080E\":[\"Sonya and Matrix Beauty\",973,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1080\\\"\\u003eCodeforces Round 524 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1832D2\":[\"Red-Blue Operations (Hard Version)\",1808,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1832\\\"\\u003eEducational Codeforces Round 148 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-441E\":[\"Valera and Number\",798,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/441\\\"\\u003eCodeforces Round 252 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1887C\":[\"Minimum Array\",1579,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1887\\\"\\u003eCodeforces Round 905 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-332E\":[\"Binary Key\",320,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/332\\\"\\u003eCodeforces Round 193 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-332D\":[\"Theft of Blueprints\",414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/332\\\"\\u003eCodeforces Round 193 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1403A\":[\"The Potion of Great Power\",290,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1403\\\"\\u003eCentral-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated)\\u003c/a\\u003e\"],\"CodeForces-1633E\":[\"Spanning Tree Queries\",1508,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1633\\\"\\u003eEducational Codeforces Round 122 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1091E\":[\"New Year and the Acquaintance Estimation\",1020,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1091\\\"\\u003eGood Bye 2018\\u003c/a\\u003e\"],\"CodeForces-1251E2\":[\"Voting (Hard Version)\",2535,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1251\\\"\\u003eEducational Codeforces Round 75 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-780F\":[\"Axel and Marston in Bitland\",1026,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/780\\\"\\u003eТехнокубок 2017 - Финал (только для онсайт-финалистов)\\u003c/a\\u003e\"],\"CodeForces-1874B\":[\"Jellyfish and Math\",1049,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1874\\\"\\u003eCodeforces Round 901 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1523D\":[\"Love-Hate\",2121,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1523\\\"\\u003eDeltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1765A\":[\"Access Levels\",670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"CodeForces-452E\":[\"Three strings\",1126,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/452\\\"\\u003eMemSQL Start[c]UP 2.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-246E\":[\"Blood Cousins Return\",3354,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/246\\\"\\u003eCodeforces Round 151 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-379F\":[\"New Year Tree\",2375,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/379\\\"\\u003eGood Bye 2013\\u003c/a\\u003e\"],\"CodeForces-1329C\":[\"Drazil Likes Heap\",1524,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1329\\\"\\u003eCodeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov!\\u003c/a\\u003e\"],\"CodeForces-125E\":[\"MST Company\",1141,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/125\\\"\\u003eCodeforces Testing Round 2\\u003c/a\\u003e\"],\"CodeForces-258E\":[\"Little Elephant and Tree\",1089,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/258\\\"\\u003eCodeforces Round 157 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-367D\":[\"Sereja and Sets\",683,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/367\\\"\\u003eCodeforces Round 215 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1620G\":[\"Subsequences Galore\",879,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1620\\\"\\u003eEducational Codeforces Round 119 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1765L\":[\"Project Manager\",574,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1765\\\"\\u003e2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams)\\u003c/a\\u003e\"],\"CodeForces-1753D\":[\"The Beach\",1679,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1753\\\"\\u003eCodeforces Round 829 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1777F\":[\"Comfortably Numb\",833,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1777\\\"\\u003eCodeforces Round 845 (Div. 2) and ByteRace 2023\\u003c/a\\u003e\"],\"CodeForces-1886E\":[\"I Wanna be the Team Leader\",1332,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1886\\\"\\u003eEducational Codeforces Round 156 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1090C\":[\"New Year Presents\",494,\"\\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-585C\":[\"Alice, Bob, Oranges and Apples\",1007,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/585\\\"\\u003eCodeforces Round 325 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1615E\":[\"Purple Crayon\",1408,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1615\\\"\\u003eCodeforces Global Round 18\\u003c/a\\u003e\"],\"CodeForces-1930E\":[\"2..3...4.... Wonderful! Wonderful!\",976,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1930\\\"\\u003ethink-cell Round 1\\u003c/a\\u003e\"],\"CodeForces-1194F\":[\"Crossword Expert\",1062,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1194\\\"\\u003eEducational Codeforces Round 68 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1182D\":[\"Complete Mirror\",860,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1182\\\"\\u003eCodeforces Round 566 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1720D2\":[\"Xor-Subsequence (hard version)\",1750,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1720\\\"\\u003eCodeforces Round 815 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-798D\":[\"Mike and distribution\",2219,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/798\\\"\\u003eCodeforces Round 410 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-786C\":[\"Till I Collapse\",2740,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1061F\":[\"Lost Root\",761,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1061\\\"\\u003eCodeforces Round 523 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-653E\":[\"Bear and Forgotten Tree 2\",1463,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/653\\\"\\u003eIndiaHacks 2016 - Online Edition (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-665F\":[\"Four Divisors\",633,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/665\\\"\\u003eEducational Codeforces Round 12\\u003c/a\\u003e\"],\"CodeForces-641D\":[\"Little Artem and Random Variable\",1050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/641\\\"\\u003eVK Cup 2016 - Round 2\\u003c/a\\u003e\"],\"CodeForces-883J\":[\"Renovation\",597,\"\\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-1844E\":[\"Great Grids\",1694,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1844\\\"\\u003eCodeforces Round 884 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1626E\":[\"Black and White Tree\",1530,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1626\\\"\\u003eEducational Codeforces Round 121 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1735E\":[\"House Planning\",1036,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1735\\\"\\u003eCodeforces Round 824 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1868C\":[\"Travel Plan\",1101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1868\\\"\\u003eCodeforces Round 896 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1408E\":[\"Avoid Rainbow Cycles\",1920,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1408\\\"\\u003eGrakn Forces 2020\\u003c/a\\u003e\"],\"CodeForces-1638E\":[\"Colorful Operations\",1850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1638\\\"\\u003eCodeforces Round 771 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-204D\":[\"Little Elephant and Retro Strings\",431,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/204\\\"\\u003eCodeforces Round 129 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-107D\":[\"Crime Management\",462,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/107\\\"\\u003eCodeforces Beta Round 83 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-119E\":[\"Alternative Reality\",93,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/119\\\"\\u003eCodeforces Beta Round 90\\u003c/a\\u003e\"],\"CodeForces-446C\":[\"DZY Loves Fibonacci Numbers\",3527,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/446\\\"\\u003eCodeforces Round #FF (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-107C\":[\"Arrangement\",392,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/107\\\"\\u003eCodeforces Beta Round 83 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1096G\":[\"Lucky Tickets\",1483,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1096\\\"\\u003eEducational Codeforces Round 57 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1290C\":[\"Prefix Enlightenment\",1569,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1290\\\"\\u003eCodeforces Round 616 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-567F\":[\"Mausoleum\",601,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/567\\\"\\u003eCodeforces Round #Pi (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-676E\":[\"The Last Fight Between Human and AI\",897,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/676\\\"\\u003eCodeforces Round 354 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1879E\":[\"Interactive Game with Coloring\",1187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1879\\\"\\u003eEducational Codeforces Round 155 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1710E\":[\"Two Arrays\",467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1710\\\"\\u003eCodeforces Round 810 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1083E\":[\"The Fair Nut and Rectangles\",4188,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1083\\\"\\u003eCodeforces Round 526 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-542A\":[\"Place Your Ad Here\",553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/542\\\"\\u003eVK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)\\u003c/a\\u003e\"],\"CodeForces-796E\":[\"Exam Cheating\",653,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/796\\\"\\u003eCodeforces Round 408 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-990F\":[\"Flow Control\",914,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/990\\\"\\u003eEducational Codeforces Round 45 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-990G\":[\"GCD Counting\",1933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/990\\\"\\u003eEducational Codeforces Round 45 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1830C\":[\"Hyperregular Bracket Strings\",1525,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1830\\\"\\u003eCodeforces Round 875 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1527D\":[\"MEX Tree\",1867,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1527\\\"\\u003eCodeforces Round 721 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1418E\":[\"Expected Damage\",1772,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1418\\\"\\u003eEducational Codeforces Round 95 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-311B\":[\"Cats Transport\",3496,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/311\\\"\\u003eCodeforces Round 185 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-331C2\":[\"The Great Julya Calendar\",366,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/331\\\"\\u003eABBYY Cup 3.0 - Finals (online version)\\u003c/a\\u003e\"],\"CodeForces-323C\":[\"Two permutations\",631,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/323\\\"\\u003eTesting Round 7\\u003c/a\\u003e\"],\"CodeForces-335D\":[\"Rectangles and Square\",309,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/335\\\"\\u003eMemSQL start[c]up Round 2 - online version\\u003c/a\\u003e\"],\"CodeForces-444C\":[\"DZY Loves Colors\",3070,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/444\\\"\\u003eCodeforces Round 254 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1866M\":[\"Mighty Rock Tower\",698,\"\\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-359E\":[\"Neatness\",478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/359\\\"\\u003eCodeforces Round 209 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-226C\":[\"Anniversary\",913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/226\\\"\\u003eCodeforces Round 140 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1866L\":[\"Lihmuf Balling\",663,\"\\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-1070B\":[\"Berkomnadzor\",478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1070\\\"\\u003e2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1732D2\":[\"Balance (Hard version)\",1372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1732\\\"\\u003eCodeforces Round 830 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1082G\":[\"Petya and Graph\",2147,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1082\\\"\\u003eEducational Codeforces Round 55 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-698C\":[\"LRU\",1412,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/698\\\"\\u003eCodeforces Round 363 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1370F1\":[\"The Hidden Pair (Easy Version)\",1392,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1370\\\"\\u003eCodeforces Round 651 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-662A\":[\"Gambling Nim\",548,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/662\\\"\\u003eCROC 2016 - Final Round [Private, For Onsite Finalists Only]\\u003c/a\\u003e\"],\"CodeForces-1070I\":[\"Privatization of Roads in Berland\",568,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1070\\\"\\u003e2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1628D2\":[\"Game on Sum (Hard Version)\",2059,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1628\\\"\\u003eCodeforces Round 767 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1348E\":[\"Phoenix and Berries\",2039,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1348\\\"\\u003eCodeforces Round 638 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1469E\":[\"A Bit Similar\",1884,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1469\\\"\\u003eEducational Codeforces Round 101 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1009G\":[\"Allowed Letters\",845,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1009\\\"\\u003eEducational Codeforces Round 47 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1239D\":[\"Catowice City\",2067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1239\\\"\\u003eCodeforces Round 594 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1578L\":[\"Labyrinth\",1107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1578\\\"\\u003eICPC WF Moscow Invitational Contest - Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-28D\":[\"Don\\u0027t fear, DravDe is kind\",624,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/28\\\"\\u003eCodeforces Beta Round 28 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1106F\":[\"Lunar New Year and a Recursive Sequence\",1007,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1106\\\"\\u003eCodeforces Round 536 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1784D\":[\"Wooden Spoon\",957,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1784\\\"\\u003eVK Cup 2022 - Финальный раунд (Engine)\\u003c/a\\u003e\"],\"CodeForces-209C\":[\"Trails and Glades\",801,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/209\\\"\\u003eVK Cup 2012 Finals, Practice Session\\u003c/a\\u003e\"],\"CodeForces-887D\":[\"Ratings and Reality Shows\",495,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/887\\\"\\u003eCodeforces Round 444 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-524E\":[\"Rooks and Rectangles\",1178,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/524\\\"\\u003eVK Cup 2015 - Round 1\\u003c/a\\u003e\"],\"CodeForces-621D\":[\"Rat Kwesh and Cheese\",1062,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/621\\\"\\u003eCodeforces Round 341 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-633E\":[\"Startup Funding\",579,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/633\\\"\\u003eManthan, Codefest 16\\u003c/a\\u003e\"],\"CodeForces-5E\":[\"Bindian Signalizing\",2096,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/5\\\"\\u003eCodeforces Beta Round 5\\u003c/a\\u003e\"],\"CodeForces-1129C\":[\"Morse Code\",926,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1129\\\"\\u003eCodeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1202E\":[\"You Are Given Some Strings...\",1880,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1202\\\"\\u003eEducational Codeforces Round 70 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1795F\":[\"Blocking Chips\",1058,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1795\\\"\\u003eEducational Codeforces Round 143 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-29E\":[\"Quarrel\",964,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/29\\\"\\u003eCodeforces Beta Round 29 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-17D\":[\"Notepad\",1174,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/17\\\"\\u003eCodeforces Beta Round 17\\u003c/a\\u003e\"],\"CodeForces-329C\":[\"Graph Reconstruction\",938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/329\\\"\\u003eCodeforces Round 192 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-983C\":[\"Elevator\",811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/983\\\"\\u003eCodeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!]\\u003c/a\\u003e\"],\"CodeForces-886E\":[\"Maximum Element\",1027,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/886\\\"\\u003eТехнокубок 2018 - Отборочный Раунд 3\\u003c/a\\u003e\"],\"CodeForces-632E\":[\"Thief in a Shop\",2968,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/632\\\"\\u003eEducational Codeforces Round 9\\u003c/a\\u003e\"],\"CodeForces-632F\":[\"Magic Matrix\",1163,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/632\\\"\\u003eEducational Codeforces Round 9\\u003c/a\\u003e\"],\"CodeForces-26E\":[\"Multithreading\",372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/26\\\"\\u003eCodeforces Beta Round 26 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-26D\":[\"Tickets\",850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/26\\\"\\u003eCodeforces Beta Round 26 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-38H\":[\"The Great Marathon\",283,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/38\\\"\\u003eSchool Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1007B\":[\"Pave the Parallelepiped\",939,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1007\\\"\\u003eCodeforces Round 497 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1673F\":[\"Anti-Theft Road Planning\",794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1673\\\"\\u003eCodeforces Round 785 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1770E\":[\"Koxia and Tree\",1322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1770\\\"\\u003eGood Bye 2022: 2023 is NEAR\\u003c/a\\u003e\"],\"CodeForces-1794E\":[\"Labeling the Tree with Distances\",1040,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1794\\\"\\u003eCodeforces Round 856 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1237E\":[\"Balanced Binary Search Trees\",1277,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1237\\\"\\u003eCodeforces Global Round 5\\u003c/a\\u003e\"],\"CodeForces-449D\":[\"Jzzhu and Numbers\",4376,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/449\\\"\\u003eCodeforces Round 257 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1358E\":[\"Are You Fired?\",2157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1358\\\"\\u003eCodeforces Round 645 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1455E\":[\"Four Points\",1462,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1455\\\"\\u003eEducational Codeforces Round 99 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1443E\":[\"Long Permutation\",1275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1443\\\"\\u003eCodeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final)\\u003c/a\\u003e\"],\"CodeForces-1697E\":[\"Coloring\",1155,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1697\\\"\\u003eEducational Codeforces Round 130 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-679C\":[\"Bear and Square Grid\",1193,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/679\\\"\\u003eCodeforces Round 356 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1934D2\":[\"XOR Break --- Game Version\",1171,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1934\\\"\\u003eCodeforces Round 931 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-643C\":[\"Levels and Regions\",1338,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/643\\\"\\u003eVK Cup 2016 - Round 3\\u003c/a\\u003e\"],\"CodeForces-534E\":[\"Berland Local Positioning System\",350,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/534\\\"\\u003eCodeforces Round 298 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-534F\":[\"Simplified Nonogram\",482,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/534\\\"\\u003eCodeforces Round 298 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-873F\":[\"Forbidden Indices\",1421,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/873\\\"\\u003eEducational Codeforces Round 30\\u003c/a\\u003e\"],\"CodeForces-1617D2\":[\"Too Many Impostors (hard version)\",1751,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1617\\\"\\u003eCodeforces Round 761 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-39G\":[\"Inverse Function\",124,\"\\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-1139E\":[\"Maximize Mex\",1807,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1139\\\"\\u003eCodeforces Round 548 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-303C\":[\"Minimum Modular\",938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/303\\\"\\u003eCodeforces Round 183 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1369E\":[\"DeadLee\",2067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1369\\\"\\u003eCodeforces Round 652 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1442C\":[\"Graph Transpositions\",1593,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1442\\\"\\u003eCodeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final)\\u003c/a\\u003e\"],\"CodeForces-1333E\":[\"Road to 1600\",1506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1333\\\"\\u003eCodeforces Round 632 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1575M\":[\"Managing Telephone Poles\",240,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1575\\\"\\u003eCOMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-533F\":[\"Encoding\",923,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/533\\\"\\u003eVK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)\\u003c/a\\u003e\"],\"CodeForces-1667C\":[\"Half Queen Cover\",1537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1667\\\"\\u003eCodeforces Round 783 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1679E\":[\"Typical Party in Dorm\",1108,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1679\\\"\\u003eCodeforces Round 791 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1582F2\":[\"Korney Korneevich and XOR (hard version)\",1739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1582\\\"\\u003eCodeforces Round 750 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1401E\":[\"Divide Square\",2241,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1401\\\"\\u003eCodeforces Round 665 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1401F\":[\"Reverse and Swap\",1573,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1401\\\"\\u003eCodeforces Round 665 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1764E\":[\"Doremy\\u0027s Number Line\",1199,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1764\\\"\\u003eCodeforces Global Round 24\\u003c/a\\u003e\"],\"CodeForces-625D\":[\"Finals in arithmetic\",654,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/625\\\"\\u003eCodeforces Round 342 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-601D\":[\"Acyclic Organic Compounds\",1167,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/601\\\"\\u003eCodeforces Round 333 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-758F\":[\"Geometrical Progression\",646,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/758\\\"\\u003eCodeforces Round 392 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-710F\":[\"String Set Queries\",1821,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/710\\\"\\u003eEducational Codeforces Round 16\\u003c/a\\u003e\"],\"CodeForces-952F\":[\"2 + 2 !\\u003d 4\",372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/952\\\"\\u003eApril Fools Contest 2018\\u003c/a\\u003e\"],\"CodeForces-1109D\":[\"Sasha and Interesting Fact from Graph Theory\",1302,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1109\\\"\\u003eCodeforces Round 539 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1436E\":[\"Complicated Computations\",2189,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1436\\\"\\u003eCodeforces Round 678 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1218D\":[\"Xor Spanning Tree\",323,\"\\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-1860E\":[\"Fast Travel Text Editor\",1308,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1860\\\"\\u003eEducational Codeforces Round 153 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1630D\":[\"Flipping Range\",1530,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1630\\\"\\u003eCodeforces Round 768 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-733E\":[\"Sleep in Class\",901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/733\\\"\\u003eCodeforces Round 378 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1943D1\":[\"Counting Is Fun (Easy Version)\",1197,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1943\\\"\\u003eCodeforces Round 934 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1326E\":[\"Bombs\",2010,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1326\\\"\\u003eCodeforces Global Round 7\\u003c/a\\u003e\"],\"CodeForces-1205C\":[\"Palindromic Paths\",1123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1205\\\"\\u003eCodeforces Round 580 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1423J\":[\"Bubble Cup hypothesis\",730,\"\\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-1750E\":[\"Bracket Cost\",1386,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1750\\\"\\u003eCodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-417E\":[\"Square Table\",823,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/417\\\"\\u003eRCC 2014 Warmup (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1736C2\":[\"Good Subarrays (Hard Version)\",1246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1736\\\"\\u003eCodeforces Round 825 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-526E\":[\"Transmitting Levels\",1133,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/526\\\"\\u003eZeptoLab Code Rush 2015\\u003c/a\\u003e\"],\"CodeForces-720B\":[\"Cactusophobia\",421,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/720\\\"\\u003eRussian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]\\u003c/a\\u003e\"],\"CodeForces-865D\":[\"Buy Low Sell High\",5029,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/865\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 2 (onsite finalists)\\u003c/a\\u003e\"],\"CodeForces-744C\":[\"Hongcow Buys a Deck of Cards\",1073,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/744\\\"\\u003eCodeforces Round 385 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-756D\":[\"Bacterial Melee\",987,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/756\\\"\\u003e8VC Venture Cup 2017 - Final Round\\u003c/a\\u003e\"],\"CodeForces-865C\":[\"Gotta Go Fast\",883,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/865\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 2 (onsite finalists)\\u003c/a\\u003e\"],\"CodeForces-611E\":[\"New Year and Three Musketeers\",879,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/611\\\"\\u003eGood Bye 2015\\u003c/a\\u003e\"],\"CodeForces-853D\":[\"Michael and Charging Stations\",725,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/853\\\"\\u003eCodeforces Round 433 (Div. 1, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-962F\":[\"Simple Cycles Edges\",1372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/962\\\"\\u003eEducational Codeforces Round 42 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1107E\":[\"Vasya and Binary String\",2264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1107\\\"\\u003eEducational Codeforces Round 59 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1761E\":[\"Make It Connected\",1759,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1761\\\"\\u003ePinely Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1107G\":[\"Vasya and Maximum Profit\",1035,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1107\\\"\\u003eEducational Codeforces Round 59 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-416D\":[\"Population Size\",1022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/416\\\"\\u003eCodeforces Round 241 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-525D\":[\"Arthur and Walls\",1834,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/525\\\"\\u003eCodeforces Round 297 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-767E\":[\"Change-free\",1061,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/767\\\"\\u003eCodeforces Round 398 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-755E\":[\"PolandBall and White-Red graph\",836,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/755\\\"\\u003e8VC Venture Cup 2017 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1286C1\":[\"Madhouse (Easy version)\",1267,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1286\\\"\\u003eCodeforces Round 612 (Div. 1)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1711959387000,"title":"CodeForces rating 2400 题目集","dislikeCnt":0,"content":"[problem:CodeForces-342E] Xenia and tree数据结构(data structures) 分治算法(divide and conquer), 树形结构(trees\n[problem:CodeForces-375D] Tree and queries数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-865D] Buy low sell high构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-449D] Jzzhu and numbers位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp\n[problem:CodeForces-1083E] The fair nut and rectangles数据结构(data structures) 动态规划(dp), 计算几何(geometry\n[problem:CodeForces-1000F] One occurrence数据结构(data structures) 分治算法(divide and conquer\n[problem:CodeForces-1473E] Minimum path图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-446C] Dzy loves fibonacci numbers数据结构(data structures) 数学(math), 数论(number theory\n[problem:CodeForces-311B] Cats transport数据结构(data structures) 动态规划(dp\n[problem:CodeForces-246E] Blood cousins return二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 排序算法(sortings\n[problem:CodeForces-145E] Lucky queries数据结构(data structures \n[problem:CodeForces-444C] Dzy loves colors数据结构(data structures \n[problem:CodeForces-626F] Group projects动态规划(dp \n[problem:CodeForces-932E] Team work组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1051F] The shortest statement图论(graphs) 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-632E] Thief in a shop分治算法(divide and conquer) 动态规划(dp), 快速傅里叶变换(fft), 数学(math\n[problem:CodeForces-786C] Till i collapse数据结构(data structures) 分治算法(divide and conquer\n[problem:CodeForces-1187D] Subarray sorting数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-815C] Karen and supermarket暴力枚举(brute force) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-484D] Kindergarten数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1709E] Xor tree位掩码(bitmasks) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1251E2] Voting (hard version)二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-915F] Imbalance value of a tree数据结构(data structures) 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1428F] Fruit sequences二分搜索(binary search) 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-1401E] Divide square数据结构(data structures) 计算几何(geometry), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1107E] Vasya and binary string动态规划(dp \n[problem:CodeForces-1436E] Complicated computations二分搜索(binary search) 数据结构(data structures), 双指针算法(two pointers\n[problem:CodeForces-379F] New year tree数据结构(data structures) 分治算法(divide and conquer), 树形结构(trees\n[problem:CodeForces-1358E] Are you fired?构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1523D] Love-hate位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 概率论(probabilities\n[problem:CodeForces-1837F] Editorial for two二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1369E] Deadlee数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1491E] Fib-tree暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 数论(number theory), 树形结构(trees\n[problem:CodeForces-1340C] Nastya and unexpected guest深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-506D] Mr. kitayuta\u0027s colorful graph暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-5E] Bindian signalizing数据结构(data structures \n[problem:CodeForces-1348E] Phoenix and berries暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1628D2] Game on sum (hard version)组合数学(combinatorics) 动态规划(dp), 博弈论(games), 数学(math\n[problem:CodeForces-1326E] Bombs数据结构(data structures) 双指针算法(two pointers\n[problem:CodeForces-12D] Ball数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-1392F] Omkar and landslide二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1257F] Make them similar位掩码(bitmasks) 暴力枚举(brute force), 哈希表(hashing), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-959F] Mahmoud and ehab and yet another xor task位掩码(bitmasks) 动态规划(dp), 数学(math), 矩阵(matrices\n[problem:CodeForces-1082G] Petya and graph流(flows) 图论(graphs\n[problem:CodeForces-1408E] Avoid rainbow cycles数据结构(data structures) 并查集(dsu), 图论(graphs), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1239D] Catowice city二分图可满足性问题(2-sat) 深度优先搜索及其变种(dfs and similar), 图匹配(graph matchings), 图论(graphs\n[problem:CodeForces-1469E] A bit similar位掩码(bitmasks) 暴力枚举(brute force), 哈希表(hashing), 字符串后缀结构(string suffix structures), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1485F] Copy or prefix sum组合数学(combinatorics) 数据结构(data structures), 动态规划(dp), 排序算法(sortings\n[problem:CodeForces-798D] Mike and distribution构造算法(constructive algorithms) 排序算法(sortings\n[problem:CodeForces-1609E] William the oblivious位掩码(bitmasks) 数据结构(data structures), 动态规划(dp), 矩阵(matrices\n[problem:CodeForces-1527D] Mex tree组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation), 数学(math), 树形结构(trees\n[problem:CodeForces-1114F] Please Another queries on array?位掩码(bitmasks), 数据结构(data structures), 分治算法(divide and conquer), 数学(math), 数论(number theory\n[problem:CodeForces-24D] Broken robot动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-1638E] Colorful operations暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1832D2] Red-blue operations (hard version)二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1202E] You are given some strings...暴力枚举(brute force) 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-467D] Fedor and essay深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1827B2] Range sorting (hard version)二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1144G] Two merged sequences动态规划(dp) 贪心策略(greedy\n[problem:CodeForces-1720D2] Xor-subsequence (hard version)位掩码(bitmasks) 数据结构(data structures), 动态规划(dp), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1418E] Expected damage二分搜索(binary search) 组合数学(combinatorics), 概率论(probabilities\n[problem:CodeForces-1761E] Make it connected二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 矩阵(matrices), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1582F2] Korney korneevich and xor (hard version)二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1617D2] Too many impostors (hard version)构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive), 数学(math\n[problem:CodeForces-990G] Gcd counting分治算法(divide and conquer) 动态规划(dp), 并查集(dsu), 数论(number theory), 树形结构(trees\n[problem:CodeForces-1779E] Anya\u0027s simultaneous exhibition构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy), 交互性问题(interactive), 排序算法(sortings\n[problem:CodeForces-1844E] Great grids二分图可满足性问题(2-sat) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-710F] String set queries暴力枚举(brute force) 数据结构(data structures), 哈希表(hashing), 交互性问题(interactive), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-1494E] A-z graph构造算法(constructive algorithms) 数据结构(data structures), 图论(graphs), 哈希表(hashing\n[problem:CodeForces-1753D] The beach构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1706D2] Chopping carrots (hard version)暴力枚举(brute force) 构造算法(constructive algorithms), 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 数学(math), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-525D] Arthur and walls构造算法(constructive algorithms) 数据结构(data structures), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1139E] Maximize mex流(flows) 图匹配(graph matchings), 图论(graphs\n[problem:CodeForces-1373F] Network coverage二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-1260E] Tournament暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1634E] Fair share构造算法(constructive algorithms) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图匹配(graph matchings), 图论(graphs\n[problem:CodeForces-1715E] Long way home数据结构(data structures) 分治算法(divide and conquer), 动态规划(dp), 计算几何(geometry), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-121E] Lucky array数据结构(data structures \n[problem:CodeForces-1887C] Minimum array二分搜索(binary search) 暴力枚举(brute force), 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 哈希表(hashing), 双指针算法(two pointers\n[problem:CodeForces-1592E] Bored bakry位掩码(bitmasks) 贪心策略(greedy), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1749E] Cactus wall构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1442C] Graph transpositions深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1027F] Session in bsu二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图匹配(graph matchings), 图论(graphs\n[problem:CodeForces-1626E] Black and white tree深度优先搜索及其变种(dfs and similar) 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1713E] Cross swapping二分图可满足性问题(2-sat) 数据结构(data structures), 并查集(dsu), 贪心策略(greedy), 矩阵(matrices\n[problem:CodeForces-916E] Jamie and tree数据结构(data structures) 树形结构(trees\n[problem:CodeForces-1329C] Drazil likes heap构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1718C] Tonya and burenka-179数据结构(data structures) 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-1630D] Flipping range构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-911F] Tree destruction构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1830C] Hyperregular bracket strings组合数学(combinatorics) 贪心策略(greedy), 哈希表(hashing), 数学(math), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-1826E] Walk the runway位掩码(bitmasks) 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1290C] Prefix enlightenment深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs\n[problem:CodeForces-1093E] Intersection of permutations数据结构(data structures \n[problem:CodeForces-1482F] Useful edges图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-1242C] Sum balance位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs\n[problem:CodeForces-1401F] Reverse and swap二分搜索(binary search) 位掩码(bitmasks), 数据结构(data structures\n[problem:CodeForces-1633E] Spanning tree queries二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 数学(math), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1227F2] Wrong answer on test 233 (hard version)组合数学(combinatorics) 数学(math\n[problem:CodeForces-1667C] Half queen cover构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-869E] The untended antiquity数据结构(data structures) 哈希表(hashing\n[problem:CodeForces-1743E] Ftl二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-912E] Prime gift二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 数学(math), Meet-in-the-middle算法(meet-in-the-middle), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-1367F2] Flying sort (hard version)二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1137D] Cooperative game构造算法(constructive algorithms) 交互性问题(interactive), 数论(number theory\n[problem:CodeForces-1174F] Ehab and the big finale构造算法(constructive algorithms) 分治算法(divide and conquer), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive), 树形结构(trees\n[problem:CodeForces-1463E] Plan of lectures构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1848F] Vika and wiki二分搜索(binary search) 位掩码(bitmasks), 组合数学(combinatorics), 分治算法(divide and conquer), 动态规划(dp), 数学(math\n[problem:CodeForces-1455E] Four points暴力枚举(brute force) 构造算法(constructive algorithms), 流(flows), 计算几何(geometry), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 三分搜索(ternary search\n[problem:CodeForces-1210D] Konrad and company evaluation图论(graphs \n[problem:CodeForces-1852C] Ina of the mountain数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1333E] Road to 1600暴力枚举(brute force) 构造算法(constructive algorithms\n[problem:CodeForces-1036E] Covered points快速傅里叶变换(fft) 计算几何(geometry), 数论(number theory\n[problem:CodeForces-1606D] Red-blue matrix暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1088E] Ehab and a component choosing problem动态规划(dp) 贪心策略(greedy), 数学(math), 树形结构(trees\n[problem:CodeForces-1499E] Chaotic merge组合数学(combinatorics) 动态规划(dp), 数学(math), 字符串处理(strings\n[problem:CodeForces-1615E] Purple crayon数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 博弈论(games), 图论(graphs), 贪心策略(greedy), 数学(math), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-653E] Bear and forgotten tree 2深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1819C] The fox and the complete tree traversal构造算法(constructive algorithms) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 树形结构(trees\n[problem:CodeForces-1707C] Dfs trees深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1096G] Lucky tickets分治算法(divide and conquer) 动态规划(dp), 快速傅里叶变换(fft\n[problem:CodeForces-914E] Palindromes in a tree位掩码(bitmasks) 数据结构(data structures), 分治算法(divide and conquer), 树形结构(trees\n[problem:CodeForces-1036F] Relatively prime powers组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-115E] Linear kingdom races数据结构(data structures) 动态规划(dp\n[problem:CodeForces-1608D] Dominoes组合数学(combinatorics) 快速傅里叶变换(fft), 图论(graphs), 数学(math), 数论(number theory\n[problem:CodeForces-1059E] Split the tree二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1804E] Routing位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs\n[problem:CodeForces-1732D2] Balance (hard version)暴力枚举(brute force) 数据结构(data structures), 数论(number theory\n[problem:CodeForces-908F] New year and rainbow roads图论(graphs) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1750E] Bracket cost二分搜索(binary search) 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1726E] Almost perfect组合数学(combinatorics) 快速傅里叶变换(fft), 数学(math\n[problem:CodeForces-1370F1] The hidden pair (easy version)二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 交互性问题(interactive), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1598F] Rbs二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-220E] Little elephant and inversions数据结构(data structures) 双指针算法(two pointers\n[problem:CodeForces-643C] Levels and regions动态规划(dp \n[problem:CodeForces-1886E] I wanna be the team leader位掩码(bitmasks) 构造算法(constructive algorithms), 动态规划(dp), 贪心策略(greedy), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1792E] Divisors and table暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 数论(number theory\n[problem:CodeForces-1780E] Josuke and complete graph二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 数学(math), 数论(number theory\n[problem:CodeForces-1770E] Koxia and tree组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 并查集(dsu), 数学(math), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-626E] Simple skewness二分搜索(binary search) 数学(math), 三分搜索(ternary search\n[problem:CodeForces-1860E] Fast travel text editor数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1304F2] Animal observation (hard version)数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-825F] String compression动态规划(dp) 哈希表(hashing), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-873F] Forbidden indices并查集(dsu) 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-1244G] Running in pairs构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1237E] Balanced binary search trees动态规划(dp) 数学(math\n[problem:CodeForces-1450F] The struggling contestant构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1594F] Ideal farm构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1109D] Sasha and interesting fact from graph theory暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 数学(math), 树形结构(trees\n[problem:CodeForces-1101F] Trucks and cities二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-1374F] Cyclic shifts sorting暴力枚举(brute force) 构造算法(constructive algorithms), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-698C] Lru位掩码(bitmasks) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-1499F] Diameter cuts组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1343F] Restore the permutation by sorted segments暴力枚举(brute force) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1736C2] Good subarrays (hard version)二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-1443E] Long permutation暴力枚举(brute force) 数学(math), 双指针算法(two pointers\n[problem:CodeForces-277E] Binary tree on plane流(flows) 树形结构(trees\n[problem:CodeForces-1909E] Multiple lamps位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 数学(math), 数论(number theory\n[problem:CodeForces-962F] Simple cycles edges深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-1286C1] Madhouse (easy version)暴力枚举(brute force) 构造算法(constructive algorithms), 交互性问题(interactive), 数学(math\n[problem:CodeForces-1042F] Leaf sets数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1005E2] Median on segments (general case edition)排序算法(sortings \n[problem:CodeForces-1542E1] Abnormal permutation pairs (easy version)组合数学(combinatorics) 动态规划(dp), 快速傅里叶变换(fft), 数学(math\n[problem:CodeForces-906C] Party位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 图论(graphs\n[problem:CodeForces-593D] Happy tree party数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 数学(math), 树形结构(trees\n[problem:CodeForces-1879E] Interactive game with coloring暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 交互性问题(interactive), 树形结构(trees\n[problem:CodeForces-1764E] Doremy\u0027s number line动态规划(dp) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1739E] Cleaning robot位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-524E] Rooks and rectangles数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-1142C] U2计算几何(geometry \n[problem:CodeForces-1585F] Non-equal neighbours组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-498B] Name that tune动态规划(dp) 概率论(probabilities), 双指针算法(two pointers\n[problem:CodeForces-1738F] Connectivity addicts构造算法(constructive algorithms) 并查集(dsu), 图论(graphs), 贪心策略(greedy), 交互性问题(interactive), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-679C] Bear and square grid深度优先搜索及其变种(dfs and similar) 并查集(dsu), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1697E] Coloring暴力枚举(brute force) 组合数学(combinatorics), 构造算法(constructive algorithms), 动态规划(dp), 计算几何(geometry), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1028E] Restore array构造算法(constructive algorithms \n[problem:CodeForces-835E] The penguin\u0027s game二分搜索(binary search) 构造算法(constructive algorithms), 交互性问题(interactive\n[problem:CodeForces-1264C] Beautiful mirrors with queries数据结构(data structures) 概率论(probabilities\n[problem:CodeForces-1205C] Palindromic paths实现问题,编程技巧,模拟(implementation) 交互性问题(interactive\n[problem:CodeForces-1680D] Dog walking暴力枚举(brute force) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1632E1] Distance tree (easy version)二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1934D2] Xor break --- game version位掩码(bitmasks) 博弈论(games), 贪心策略(greedy), 交互性问题(interactive\n[problem:CodeForces-605C] Freelancer\u0027s dreams计算几何(geometry \n[problem:CodeForces-1679E] Typical party in dorm位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 字符串处理(strings\n[problem:CodeForces-601D] Acyclic organic compounds数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 哈希表(hashing), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-377D] Developing game数据结构(data structures \n[problem:CodeForces-1839E] Decreasing game构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 交互性问题(interactive\n[problem:CodeForces-1089K] King kog\u0027s reception数据结构(data structures \n[problem:CodeForces-498D] Traffic jams in the land数据结构(data structures) 动态规划(dp), 数论(number theory\n[problem:CodeForces-1868C] Travel plan组合数学(combinatorics) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math), 树形结构(trees\n[problem:CodeForces-526E] Transmitting levels动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1578L] Labyrinth二分搜索(binary search) 并查集(dsu), 贪心策略(greedy\n[problem:CodeForces-808F] Card game二分搜索(binary search) 流(flows), 图论(graphs\n[problem:CodeForces-1619H] Permutation and queries暴力枚举(brute force) 数据结构(data structures), 分治算法(divide and conquer), 双指针算法(two pointers\n[problem:CodeForces-641D] Little artem and random variable动态规划(dp) 实现问题,编程技巧,模拟(implementation), 数学(math), 概率论(probabilities\n[problem:CodeForces-802N] April fools\u0027 problem (medium)二分搜索(binary search) 流(flows), 图论(graphs\n[problem:CodeForces-1935E] Distance learning courses in mac位掩码(bitmasks) 暴力枚举(brute force), 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1874B] Jellyfish and math位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1795F] Blocking chips二分搜索(binary search) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1943D1] Counting is fun (easy version)暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-258E] Little elephant and tree数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-452E] Three strings数据结构(data structures) 并查集(dsu), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-780F] Axel and marston in bitland位掩码(bitmasks) 动态规划(dp), 图论(graphs), 矩阵(matrices\n[problem:CodeForces-1526E] Oolimry and suffix array组合数学(combinatorics) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-749E] Inversions after shuffle数据结构(data structures) 概率论(probabilities\n[problem:CodeForces-1774F1] Magician and pigs (easy version)暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-17D] Notepad数论(number theory \n[problem:CodeForces-1735E] House planning构造算法(constructive algorithms) 数据结构(data structures), 图匹配(graph matchings), 贪心策略(greedy\n[problem:CodeForces-632F] Magic matrix暴力枚举(brute force) 分治算法(divide and conquer), 图论(graphs), 矩阵(matrices), 树形结构(trees\n[problem:CodeForces-1924C] Fractal origami计算几何(geometry) 数学(math), 矩阵(matrices\n[problem:CodeForces-31E] Tv game动态规划(dp \n[problem:CodeForces-1004E] Sonya and ice cream二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1794E] Labeling the tree with distances数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-707E] Garlands数据结构(data structures \n[problem:CodeForces-1585E] Frequency queries数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-744C] Hongcow buys a deck of cards位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp\n[problem:CodeForces-125E] Mst company二分搜索(binary search) 图论(graphs\n[problem:CodeForces-1605E] Array equalizer二分搜索(binary search) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1107G] Vasya and maximum profit二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 动态规划(dp), 并查集(dsu\n[problem:CodeForces-756D] Bacterial melee暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 字符串后缀结构(string suffix structures\n[problem:CodeForces-1221F] Choose a square二分搜索(binary search) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-886E] Maximum element组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1091E] New year and the acquaintance estimation二分搜索(binary search) 数据结构(data structures), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-1093F] Vasya and array动态规划(dp \n[problem:CodeForces-585C] Alice Bob, Oranges and apples数论(number theory\n[problem:CodeForces-621D] Rat kwesh and cheese暴力枚举(brute force) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-1044D] Deduction queries数据结构(data structures) 并查集(dsu\n[problem:CodeForces-1936C] Pokémon arena数据结构(data structures) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-1194F] Crossword expert组合数学(combinatorics) 动态规划(dp), 数论(number theory), 概率论(probabilities), 双指针算法(two pointers\n[problem:CodeForces-1038E] Maximum matching位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs\n[problem:CodeForces-1132G] Greedy subsequences数据结构(data structures) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-767E] Change-free贪心策略(greedy \n[problem:CodeForces-1784D] Wooden spoon组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-1106F] Lunar new year and a recursive sequence数学(math) 矩阵(matrices), 数论(number theory\n[problem:CodeForces-1282E] The cake is a lie构造算法(constructive algorithms) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-1882E1] Two permutations (easy version)暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-1152E] Neko and flashback构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-297C] Splitting the uniqueness构造算法(constructive algorithms \n[problem:CodeForces-1930E] 2..3...4.... wonderful! wonderful!组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1007B] Pave the parallelepiped位掩码(bitmasks) 暴力枚举(brute force), 组合数学(combinatorics), 数学(math), 数论(number theory\n[problem:CodeForces-1670F] Jee You see?位掩码(bitmasks), 组合数学(combinatorics), 动态规划(dp\n[problem:CodeForces-1016E] Rest in the shades二分搜索(binary search) 计算几何(geometry\n[problem:CodeForces-1817C] Similar polynomials组合数学(combinatorics) 数学(math\n[problem:CodeForces-416D] Population size贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1099F] Cookies二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 博弈论(games), 树形结构(trees\n[problem:CodeForces-1032F] Vasya and maximum matching动态规划(dp) 树形结构(trees\n[problem:CodeForces-1129C] Morse code二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 哈希表(hashing), 排序算法(sortings), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-676E] The last fight between human and ai数学(math \n[problem:CodeForces-329C] Graph reconstruction构造算法(constructive algorithms \n[problem:CodeForces-1080E] Sonya and matrix beauty字符串处理(strings \n[problem:CodeForces-1913E] Matrix problem流(flows) 图论(graphs\n[problem:CodeForces-990F] Flow control深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1252F] Regular forestation哈希表(hashing) 树形结构(trees\n[problem:CodeForces-1098C] Construct a tree二分搜索(binary search) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-164C] Machine programming流(flows) 图论(graphs\n[problem:CodeForces-1902F] Trees and xor queries again数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 数学(math), 树形结构(trees\n[problem:CodeForces-533F] Encoding哈希表(hashing) 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-611E] New year and three musketeers数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1725L] Lemper cooking competition数据结构(data structures \n[problem:CodeForces-1620G] Subsequences galore位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp\n[problem:CodeForces-939F] Cutlet数据结构(data structures) 动态规划(dp\n[problem:CodeForces-29E] Quarrel图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-303C] Minimum modular暴力枚举(brute force) 图论(graphs), 数学(math), 数论(number theory\n[problem:CodeForces-226C] Anniversary数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 数学(math), 矩阵(matrices), 数论(number theory\n[problem:CodeForces-581F] Zublicanes and mumocrates动态规划(dp) 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-733E] Sleep in class构造算法(constructive algorithms) 数据结构(data structures), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1263F] Economic difficulties数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 流(flows), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1146E] Hot is cold位掩码(bitmasks) 数据结构(data structures), 分治算法(divide and conquer), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-83D] Numbers动态规划(dp) 数学(math), 数论(number theory\n[problem:CodeForces-1905E] One-x组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 数学(math), 树形结构(trees\n[problem:CodeForces-755E] Polandball and white-red graph构造算法(constructive algorithms) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1017E] The supersonic rocket计算几何(geometry) 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1777F] Comfortably numb位掩码(bitmasks) 数据结构(data structures), 分治算法(divide and conquer), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-983C] Elevator动态规划(dp) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1267A] Apprentice learning trajector \n[problem:CodeForces-865C] Gotta go fast二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-1809E] Two tanks二分搜索(binary search) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-21D] Traveling graph位掩码(bitmasks) 图匹配(graph matchings), 图论(graphs\n[problem:CodeForces-1182D] Complete mirror构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-639D] Bear and contribution数据结构(data structures) 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1673F] Anti-theft road planning位掩码(bitmasks) 构造算法(constructive algorithms), 分治算法(divide and conquer), 贪心策略(greedy), 交互性问题(interactive), 数学(math\n[problem:CodeForces-417E] Square table构造算法(constructive algorithms) 数学(math), 概率论(probabilities\n[problem:CodeForces-1009G] Allowed letters位掩码(bitmasks) 流(flows), 图匹配(graph matchings), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-794D] Labelling cities深度优先搜索及其变种(dfs and similar) 图论(graphs), 哈希表(hashing\n[problem:CodeForces-1186F] Vus the cossack and a graph深度优先搜索及其变种(dfs and similar) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-913E] Logical expression位掩码(bitmasks) 动态规划(dp), 最短路算法(shortest paths\n[problem:CodeForces-26D] Tickets组合数学(combinatorics) 数学(math), 概率论(probabilities\n[problem:CodeForces-822E] Liar二分搜索(binary search) 动态规划(dp), 哈希表(hashing), 字符串后缀结构(string suffix structures\n[problem:CodeForces-837F] Prefix sums二分搜索(binary search) 暴力枚举(brute force), 组合数学(combinatorics), 数学(math), 矩阵(matrices\n[problem:CodeForces-582C] Superior periodic subarrays数论(number theory \n[problem:CodeForces-1423J] Bubble cup hypothesis位掩码(bitmasks) 构造算法(constructive algorithms), 动态规划(dp), 数学(math\n[problem:CodeForces-1147D] Palindrome xor深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-266D] Berdonalds图论(graphs) 数学(math), 最短路算法(shortest paths\n[problem:CodeForces-920D] Tanks动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1166F] Vicky\u0027s delivery service数据结构(data structures) 并查集(dsu), 图论(graphs), 哈希表(hashing\n[problem:CodeForces-209C] Trails and glades构造算法(constructive algorithms) 并查集(dsu), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1061F] Lost root交互性问题(interactive) 概率论(probabilities\n[problem:CodeForces-288D] Polo the penguin and trees组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-441E] Valera and number位掩码(bitmasks) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-1866M] Mighty rock tower暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-1080F] Katya and segments sets数据结构(data structures) 交互性问题(interactive), 排序算法(sortings\n[problem:CodeForces-1780G] Delicious dessert二分搜索(binary search) 并查集(dsu), 哈希表(hashing), 数学(math), 数论(number theory), 字符串后缀结构(string suffix structures\n[problem:CodeForces-1765A] Access levels位掩码(bitmasks) 并查集(dsu), 流(flows), 图匹配(graph matchings\n[problem:CodeForces-256E] Lucky arrays数据结构(data structures \n[problem:CodeForces-853D] Michael and charging stations二分搜索(binary search) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-200A] Cinema暴力枚举(brute force) 数据结构(data structures\n[problem:CodeForces-1866L] Lihmuf balling二分搜索(binary search) 暴力枚举(brute force), 数学(math\n[problem:CodeForces-1163E] Magical permutation位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 数据结构(data structures), 图论(graphs), 数学(math\n[problem:CodeForces-161C] Abracadabra分治算法(divide and conquer \n[problem:CodeForces-295D] Greg and caves组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-513G2] Inversions problem动态规划(dp) 概率论(probabilities\n[problem:CodeForces-625D] Finals in arithmetic构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-796E] Exam cheating二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-717G] Underfail流(flows \n[problem:CodeForces-367D] Sereja and sets位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-1055D] Refactoring贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-922F] Divisibility构造算法(constructive algorithms) 动态规划(dp), 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-758F] Geometrical progression暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-847J] Students initiation二分搜索(binary search) 流(flows), 图论(graphs\n[problem:CodeForces-1938F] Forming group \n[problem:CodeForces-1089M] Minegraphed构造算法(constructive algorithms) 图论(graphs\n[problem:CodeForces-979E] Kuro and topological parity动态规划(dp \n[problem:CodeForces-28D] Don\u0027t fear Dravde is kind二分搜索(binary search), 数据结构(data structures), 动态规划(dp), 哈希表(hashing\n[problem:CodeForces-845E] Fire in the city二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-160E] Buses and people二分搜索(binary search) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-665F] Four divisors数据结构(data structures) 动态规划(dp), 数学(math), 数论(number theory), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-633E] Startup funding二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 概率论(probabilities), 双指针算法(two pointers\n[problem:CodeForces-323C] Two permutations数据结构(data structures \n[problem:CodeForces-1765L] Project manager暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-883J] Renovation构造算法(constructive algorithms) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-567F] Mausoleum动态规划(dp \n[problem:CodeForces-293C] Cube problem暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-380B] Sereja and tree图论(graphs) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-316D3] Pe lesson动态规划(dp) 数学(math\n[problem:CodeForces-946F] Fibonacci string subsequences组合数学(combinatorics) 动态规划(dp), 矩阵(matrices\n[problem:CodeForces-542A] Place your ad here数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-283D] Cows and cool sequences动态规划(dp) 数学(math), 数论(number theory\n[problem:CodeForces-1070I] Privatization of roads in berland流(flows) 图匹配(graph matchings), 图论(graphs\n[problem:CodeForces-856C] Eleventh birthday组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-690A3] Collective mindsets (hard \n[problem:CodeForces-193C] Hamming distance构造算法(constructive algorithms) 贪心策略(greedy), 数学(math), 矩阵(matrices\n[problem:CodeForces-1938K] Tree qui \n[problem:CodeForces-1184E3] Daleks\u0027 invasion (hard)数据结构(data structures) 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1045B] Space isaac哈希表(hashing) 数论(number theory\n[problem:CodeForces-1090C] New year presents构造算法(constructive algorithms) 数据结构(data structures\n[problem:CodeForces-1054E] Chips puzzle构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-316G3] Good substrings字符串后缀结构(string suffix structures \n[problem:CodeForces-887D] Ratings and reality shows数据结构(data structures) 双指针算法(two pointers\n[problem:CodeForces-1070B] Berkomnadzor数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-359E] Neatness构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-354B] Game with strings位掩码(bitmasks) 动态规划(dp), 博弈论(games\n[problem:CodeForces-277C] Game博弈论(games) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-534F] Simplified nonogram位掩码(bitmasks) 动态规划(dp), 哈希表(hashing), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-1710E] Two arrays二分搜索(binary search) 博弈论(games), 图匹配(graph matchings\n[problem:CodeForces-662A] Gambling nim位掩码(bitmasks) 数学(math), 矩阵(matrices), 概率论(probabilities\n[problem:CodeForces-513D1] Constrained tree深度优先搜索及其变种(dfs and similar \n[problem:CodeForces-717H] Pokermon league challenge数学(math) 概率论(probabilities\n[problem:CodeForces-154D] Flatland fencing博弈论(games) 数学(math\n[problem:CodeForces-198E] Gripping story二分搜索(binary search) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-83C] Track图论(graphs) 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-107D] Crime management动态规划(dp) 图论(graphs), 矩阵(matrices\n[problem:CodeForces-593E] Strange calculation and cats动态规划(dp) 矩阵(matrices\n[problem:CodeForces-1912G] Great city saint petersburg数据结构(data structures \n[problem:CodeForces-204D] Little elephant and retro strings动态规划(dp \n[problem:CodeForces-720B] Cactusophobia深度优先搜索及其变种(dfs and similar) 流(flows\n[problem:CodeForces-273D] Dima and figure动态规划(dp \n[problem:CodeForces-332D] Theft of blueprints图论(graphs) 数学(math\n[problem:CodeForces-198C] Delivering carcinogen二分搜索(binary search) 计算几何(geometry\n[problem:CodeForces-1045H] Self-exploration数学(math \n[problem:CodeForces-952F] 2 + 2 !\u003d \n[problem:CodeForces-856D] Masha and cactus动态规划(dp) 树形结构(trees\n[problem:CodeForces-331C2] The great julya calendar动态规划(dp \n[problem:CodeForces-107C] Arrangement位掩码(bitmasks) 动态规划(dp\n[problem:CodeForces-51E] Pentagon组合数学(combinatorics) 图论(graphs), 矩阵(matrices\n[problem:CodeForces-74D] Hanger数据结构(data structures \n[problem:CodeForces-26E] Multithreading构造算法(constructive algorithms \n[problem:CodeForces-1912H] Hypercatapult commute图论(graphs \n[problem:CodeForces-58E] Expression动态规划(dp \n[problem:CodeForces-534E] Berland local positioning system构造算法(constructive algorithms) 贪心策略(greedy), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-200E] Tractor college实现问题,编程技巧,模拟(implementation) 数学(math), 数论(number theory), 三分搜索(ternary search\n[problem:CodeForces-73E] Morrowindows数学(math) 数论(number theory\n[problem:CodeForces-32E] Hide-and-seek计算几何(geometry) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-847L] Berland su computer network构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 哈希表(hashing), 树形结构(trees\n[problem:CodeForces-1218D] Xor spanning tree分治算法(divide and conquer) 快速傅里叶变换(fft), 图论(graphs\n[problem:CodeForces-335D] Rectangles and square暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-97C] Winning strategy二分搜索(binary search) 图论(graphs), 数学(math), 最短路算法(shortest paths\n[problem:CodeForces-332E] Binary key动态规划(dp) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-175D] Plane of tanks: duel暴力枚举(brute force) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-1403A] The potion of great power special problem 二分图可满足性问题(2-sat), 二分搜索(binary search), 数据结构(data structures), 图论(graphs), 交互性问题(interactive), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-802L] Send the fool further! (hard)深度优先搜索及其变种(dfs and similar) 动态规划(dp), 数学(math), 树形结构(trees\n[problem:CodeForces-75E] Ship\u0027s shortest path计算几何(geometry) 最短路算法(shortest paths\n[problem:CodeForces-38H] The great marathon动态规划(dp \n[problem:CodeForces-350D] Looking for owls二分搜索(binary search) 数据结构(data structures), 计算几何(geometry), 哈希表(hashing), 排序算法(sortings\n[problem:CodeForces-97A] Domino暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1575M] Managing telephone poles数据结构(data structures) 计算几何(geometry\n[problem:CodeForces-331D1] Escaping on beaveractor深度优先搜索及其变种(dfs and similar) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-177G1] Fibonacci strings字符串处理(strings \n[problem:CodeForces-929D] Пограничные врат \n[problem:CodeForces-39G] Inverse function实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-409I] Feed the golorp special proble \n[problem:CodeForces-119E] Alternative reality计算几何(geometry \n[problem:CodeForces-64I] Sort the table special problem 排序算法(sortings\n[problem:CodeForces-1910H] Sum of digits of sums special problem 二分搜索(binary search), 数据结构(data structures\n[problem:CodeForces-661H] Rotate matrix special proble \n[problem:CodeForces-100J] Interval coloring special problem 贪心策略(greedy), 数学(math\n","threadId":188474,"likeCnt":0,"createTime":1711959387000,"isWorkbook":true,"viewCnt":24,"openness":2,"fav":false,"id":4796,"trustable":false}