Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-20C\":[\"Dijkstra?\",34303,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/20\\\"\\u003eCodeforces Alpha Round 20 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-739B\":[\"Alyona and a tree\",4804,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/739\\\"\\u003eCodeforces Round 381 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-848B\":[\"Rooter\\u0027s Song\",1891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/848\\\"\\u003eCodeforces Round 431 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-702D\":[\"Road to Post Office\",3414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/702\\\"\\u003eEducational Codeforces Round 15\\u003c/a\\u003e\"],\"CodeForces-811C\":[\"Vladik and Memorable Trip\",3451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/811\\\"\\u003eCodeforces Round 416 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-835D\":[\"Palindromic characteristics\",4149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-847I\":[\"Noise Level\",1604,\"\\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-195D\":[\"Analyzing Polyline\",1121,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/195\\\"\\u003eCodeforces Round 123 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-69D\":[\"Dot\",1034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/69\\\"\\u003eCodeforces Beta Round 63 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-57C\":[\"Array\",2787,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/57\\\"\\u003eCodeforces Beta Round 53\\u003c/a\\u003e\"],\"CodeForces-45D\":[\"Event Dates\",1727,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/45\\\"\\u003eSchool Team Contest 3 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-45C\":[\"Dancing Lessons\",1064,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/45\\\"\\u003eSchool Team Contest 3 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-21A\":[\"Jabber ID\",2029,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/21\\\"\\u003eCodeforces Alpha Round 21 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1012B\":[\"Chemical table\",3792,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1012\\\"\\u003eCodeforces Round 500 (Div. 1) [based on EJOI]\\u003c/a\\u003e\"],\"CodeForces-1242B\":[\"0-1 MST\",7282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1242\\\"\\u003eCodeforces Round 599 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1375D\":[\"Replace by MEX\",8842,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1375\\\"\\u003eCodeforces Global Round 9\\u003c/a\\u003e\"],\"CodeForces-1012C\":[\"Hills\",3514,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1012\\\"\\u003eCodeforces Round 500 (Div. 1) [based on EJOI]\\u003c/a\\u003e\"],\"CodeForces-1157D\":[\"N Problems During K Days\",3768,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1157\\\"\\u003eCodeforces Round 555 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1036C\":[\"Classy Numbers\",9318,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1036\\\"\\u003eEducational Codeforces Round 50 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1000D\":[\"Yet Another Problem On a Subsequence\",4253,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1000\\\"\\u003eEducational Codeforces Round 46 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-846D\":[\"Monitor\",2670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"CodeForces-1906E\":[\"Merge Not Sort\",1293,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1906\\\"\\u003e2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1918D\":[\"Blocking Elements\",4238,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1918\\\"\\u003eCodeforces Round 922 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-292E\":[\"Copying Data\",4332,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/292\\\"\\u003eCroc Champ 2013 - Round 1\\u003c/a\\u003e\"],\"CodeForces-292D\":[\"Connected Components\",2576,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/292\\\"\\u003eCroc Champ 2013 - Round 1\\u003c/a\\u003e\"],\"CodeForces-207B2\":[\"Military Trainings\",178,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/207\\\"\\u003eAbbyy Cup 2.0 - Final (unofficial)\\u003c/a\\u003e\"],\"CodeForces-1120A\":[\"Diana and Liana\",1652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1120\\\"\\u003eCodeforces Round 543 (Div. 1, based on Technocup 2019 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1277D\":[\"Let\\u0027s Play the Words?\",3047,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1277\\\"\\u003eCodeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-1718A2\":[\"Burenka and Traditions (hard version)\",5020,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1718\\\"\\u003eCodeforces Round 814 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1883G2\":[\"Dances (Hard Version)\",4865,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1883\\\"\\u003eCodeforces Round 905 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1168B\":[\"Good Triple\",3414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1168\\\"\\u003eCodeforces Round 562 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-409F\":[\"000001\",2095,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/409\\\"\\u003eApril Fools Day Contest 2014\\u003c/a\\u003e\"],\"CodeForces-1144E\":[\"Median String\",4333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1144\\\"\\u003eCodeforces Round 550 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1495B\":[\"Let\\u0027s Go Hiking\",5874,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1495\\\"\\u003eCodeforces Round 706 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-724D\":[\"Dense Subsequence\",2446,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/724\\\"\\u003eIntel Code Challenge Final Round (Div. 1 + Div. 2, Combined)\\u003c/a\\u003e\"],\"CodeForces-700A\":[\"As Fast As Possible\",3273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/700\\\"\\u003eCodeforces Round 364 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-930C\":[\"Teodor is not a liar!\",2145,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/930\\\"\\u003eCodeforces Round 468 (Div. 1, based on Technocup 2018 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1808C\":[\"Unlucky Numbers\",3659,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1808\\\"\\u003eCodeforces Round 861 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1929D\":[\"Sasha and a Walk in the City\",4145,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1929\\\"\\u003eCodeforces Round 926 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-67D\":[\"Optical Experiment\",1513,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/67\\\"\\u003eManthan 2011\\u003c/a\\u003e\"],\"CodeForces-55C\":[\"Pie or die\",1904,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"CodeForces-1927F\":[\"Microcycle\",3718,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1927\\\"\\u003eCodeforces Round 923 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1264B\":[\"Beautiful Sequence\",5641,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1264\\\"\\u003eCodeforces Round 604 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1276B\":[\"Two Fairs\",4913,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1276\\\"\\u003eCodeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-1361B\":[\"Johnny and Grandmaster\",3478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1361\\\"\\u003eCodeforces Round 647 (Div. 1) - Thanks, Algo Muse!\\u003c/a\\u003e\"],\"CodeForces-1494C\":[\"1D Sokoban\",5299,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1494\\\"\\u003eEducational Codeforces Round 105 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1470B\":[\"Strange Definition\",6271,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1470\\\"\\u003eCodeforces Round 694 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1482D\":[\"Playlist\",3787,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1482\\\"\\u003eТехнокубок 2021 - Финал\\u003c/a\\u003e\"],\"CodeForces-1155D\":[\"Beautiful Array\",7154,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1155\\\"\\u003eEducational Codeforces Round 63 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-505C\":[\"Mr. Kitayuta, the Treasure Hunter\",6378,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/505\\\"\\u003eCodeforces Round 286 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-711D\":[\"Directed Roads\",4563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/711\\\"\\u003eCodeforces Round 369 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-832D\":[\"Misha, Grisha and Underground\",4173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/832\\\"\\u003eCodeforces Round 425 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-965D\":[\"Single-use Stones\",3275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/965\\\"\\u003eCodeforces Round 476 (Div. 2) [Thanks, Telegram!]\\u003c/a\\u003e\"],\"CodeForces-1928D\":[\"Lonely Mountain Dungeons\",3706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1928\\\"\\u003eCodeforces Round 924 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1819B\":[\"The Butcher\",3434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1819\\\"\\u003eCodeforces Round 866 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-285D\":[\"Permutation Sum\",1610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/285\\\"\\u003eCodeforces Round 175 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-261B\":[\"Maxim and Restaurant\",1493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/261\\\"\\u003eCodeforces Round 160 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1477B\":[\"Nezzar and Binary String\",3114,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1477\\\"\\u003eCodeforces Round 698 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1029D\":[\"Concatenated Multiples\",3997,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1029\\\"\\u003eCodeforces Round 506 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1017D\":[\"The Wu\",3452,\"\\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-1114D\":[\"Flood Fill\",7062,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1114\\\"\\u003eCodeforces Round 538 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-949C\":[\"Data Center Maintenance\",2087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/949\\\"\\u003eCodeforces Round 469 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1453D\":[\"Checkpoints\",4146,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1453\\\"\\u003eCodeforces Round 688 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-803D\":[\"Magazine Ad\",3406,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-803C\":[\"Maximal GCD\",5497,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-490D\":[\"Chocolate\",2157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/490\\\"\\u003eCodeforces Round 279 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-25D\":[\"Roads not only in Berland\",11502,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/25\\\"\\u003eCodeforces Beta Round 25 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-25C\":[\"Roads in Berland\",6727,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/25\\\"\\u003eCodeforces Beta Round 25 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-199B\":[\"Special Olympics\",831,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/199\\\"\\u003eCodeforces Round 125 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1909I\":[\"Short Permutation Problem\",73,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1909\\\"\\u003ePinely Round 3 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-37C\":[\"Old Berland Language\",1661,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/37\\\"\\u003eCodeforces Beta Round 37\\u003c/a\\u003e\"],\"CodeForces-1488C\":[\"Two Policemen\",399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1488\\\"\\u003eKotlin Heroes: Episode 6\\u003c/a\\u003e\"],\"CodeForces-839B\":[\"Game of the Rows\",3651,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/839\\\"\\u003eCodeforces Round 428 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1488D\":[\"Problemsolving Marathon\",331,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1488\\\"\\u003eKotlin Heroes: Episode 6\\u003c/a\\u003e\"],\"CodeForces-1367E\":[\"Necklace Assembly\",5265,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1367\\\"\\u003eCodeforces Round 650 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1585D\":[\"Yet Another Sorting Problem\",3635,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1585\\\"\\u003eTechnocup 2022 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-717E\":[\"Paint it really, really dark gray\",1555,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/717\\\"\\u003eBubble Cup 9 - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-959E\":[\"Mahmoud and Ehab and the xor-MST\",3542,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/959\\\"\\u003eCodeforces Round 473 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-935D\":[\"Fafa and Ancient Alphabet\",2730,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/935\\\"\\u003eCodeforces Round 465 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-22D\":[\"Segments\",2815,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/22\\\"\\u003eCodeforces Beta Round 22 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-162D\":[\"Remove digits\",223,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/162\\\"\\u003eVK Cup 2012 Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-46E\":[\"Comb\",972,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/46\\\"\\u003eSchool Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1342D\":[\"Multiple Testcases\",5916,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1342\\\"\\u003eEducational Codeforces Round 86 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1463D\":[\"Pairs\",4324,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1463\\\"\\u003eEducational Codeforces Round 100 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1245D\":[\"Shichikuji and Power Grid\",7433,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1245\\\"\\u003eCodeforces Round 597 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1475F\":[\"Unusual Matrix\",5217,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1475\\\"\\u003eCodeforces Round 697 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1475G\":[\"Strange Beauty\",6627,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1475\\\"\\u003eCodeforces Round 697 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-959D\":[\"Mahmoud and Ehab and another array construction task\",3215,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/959\\\"\\u003eCodeforces Round 473 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-717D\":[\"Dexterina’s Lab\",1433,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/717\\\"\\u003eBubble Cup 9 - Finals [Online Mirror]\\u003c/a\\u003e\"],\"CodeForces-729E\":[\"Subordinates\",2190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/729\\\"\\u003eTechnocup 2017 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1354D\":[\"Multiset\",8612,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1354\\\"\\u003eEducational Codeforces Round 87 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-3B\":[\"Lorry\",4504,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/3\\\"\\u003eCodeforces Beta Round 3\\u003c/a\\u003e\"],\"CodeForces-1909D\":[\"Split Plus K\",3966,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1909\\\"\\u003ePinely Round 3 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1486C2\":[\"Guessing the Greatest (hard version)\",8274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1486\\\"\\u003eCodeforces Round 703 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-173C\":[\"Spiral Maximum\",1044,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/173\\\"\\u003eCroc Champ 2012 - Round 1\\u003c/a\\u003e\"],\"CodeForces-294C\":[\"Shaass and Lights\",4131,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/294\\\"\\u003eCodeforces Round 178 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1147B\":[\"Chladni Figure\",2854,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1147\\\"\\u003eForethought Future Cup - Final Round (Onsite Finalists Only)\\u003c/a\\u003e\"],\"CodeForces-1365E\":[\"Maximum Subsequence Value\",7576,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1365\\\"\\u003eCodeforces Round 648 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1353E\":[\"K-periodic Garland\",6963,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1353\\\"\\u003eCodeforces Round 642 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-607B\":[\"Zuma\",12355,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/607\\\"\\u003eCodeforces Round 336 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1220D\":[\"Alex and Julian\",3782,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1220\\\"\\u003eCodeforces Round 586 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-178E1\":[\"The Beaver\\u0027s Problem - 2\",286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-362C\":[\"Insertion Sort\",1757,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/362\\\"\\u003eCodeforces Round 212 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1922D\":[\"Berserk Monsters\",5210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1922\\\"\\u003eEducational Codeforces Round 161 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-374C\":[\"Inna and Dima\",2837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/374\\\"\\u003eCodeforces Round 220 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1704D\":[\"Magical Array\",4969,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1704\\\"\\u003eCodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-144D\":[\"Missile Silos\",4291,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/144\\\"\\u003eCodeforces Round 103 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1801C\":[\"Music Festival\",3287,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1801\\\"\\u003eCodeforces Round 857 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1946D\":[\"Birthday Gift\",3941,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1946\\\"\\u003eCodeforces Round 936 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1174D\":[\"Ehab and the Expected XOR Problem\",4793,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1174\\\"\\u003eCodeforces Round 563 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-808D\":[\"Array Division\",7370,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"CodeForces-1089F\":[\"Fractions\",1953,\"\\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-1041E\":[\"Tree Reconstruction\",3666,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1041\\\"\\u003eCodeforces Round 509 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-120J\":[\"Minimum Sum\",977,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-72F\":[\"Oil\",116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/72\\\"\\u003eUnknown Language Round 2\\u003c/a\\u003e\"],\"CodeForces-241G\":[\"Challenging Balloons\",540,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/241\\\"\\u003eBayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)\\u003c/a\\u003e\"],\"CodeForces-470E\":[\"Chessboard\",190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/470\\\"\\u003eSurprise Language Round 7\\u003c/a\\u003e\"],\"CodeForces-1921F\":[\"Sum of Progression\",3444,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1921\\\"\\u003eCodeforces Round 920 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1800F\":[\"Dasha and Nightmares\",3864,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1800\\\"\\u003eCodeforces Round 855 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1945F\":[\"Kirill and Mushrooms\",3470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1945\\\"\\u003eCodeforces Round 935 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1715D\":[\"2+ doors\",4950,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1715\\\"\\u003eCodeforces Round 816 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1739D\":[\"Reset K Edges\",4934,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1739\\\"\\u003eEducational Codeforces Round 136 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-819B\":[\"Mister B and PR Shifts\",1664,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/819\\\"\\u003eCodeforces Round 421 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1076E\":[\"Vasya and a Tree\",3830,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1076\\\"\\u003eEducational Codeforces Round 54 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1184E1\":[\"Daleks\\u0027 Invasion (easy)\",1646,\"\\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-1197D\":[\"Yet Another Subarray Problem\",5342,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1197\\\"\\u003eEducational Codeforces Round 69 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-178D2\":[\"Magic Squares\",262,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-928C\":[\"Dependency management\",883,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/928\\\"\\u003eVK Cup 2018 - Квалификация 1\\u003c/a\\u003e\"],\"CodeForces-928D\":[\"Autocompletion\",810,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/928\\\"\\u003eVK Cup 2018 - Квалификация 1\\u003c/a\\u003e\"],\"CodeForces-1270D\":[\"Strange Device\",4468,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1270\\\"\\u003eGood Bye 2019\\u003c/a\\u003e\"],\"CodeForces-1294E\":[\"Obtain a Permutation\",4839,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1294\\\"\\u003eCodeforces Round 615 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1015E2\":[\"Stars Drawing (Hard Edition)\",3591,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1015\\\"\\u003eCodeforces Round 501 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-470C\":[\"Eval\",232,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/470\\\"\\u003eSurprise Language Round 7\\u003c/a\\u003e\"],\"CodeForces-61E\":[\"Enemy is weak\",10957,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/61\\\"\\u003eCodeforces Beta Round 57 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-470D\":[\"Caesar Cipher\",144,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/470\\\"\\u003eSurprise Language Round 7\\u003c/a\\u003e\"],\"CodeForces-1932F\":[\"Feed Cats\",3333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1932\\\"\\u003eCodeforces Round 927 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1920D\":[\"Array Repetition\",5072,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1920\\\"\\u003eCodeforces Round 919 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1823D\":[\"Unique Palindromes\",3703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1823\\\"\\u003eCodeforces Round 868 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-372B\":[\"Counting Rectangles is Fun\",2690,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/372\\\"\\u003eCodeforces Round 219 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1714F\":[\"Build a Tree and That Is It\",3095,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1714\\\"\\u003eCodeforces Round 811 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1847D\":[\"Professor Higashikata\",3641,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1847\\\"\\u003eCodeforces Round 882 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1738D\":[\"Permutation Addicts\",3343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1738\\\"\\u003eCodeforces Global Round 22\\u003c/a\\u003e\"],\"CodeForces-1799D1\":[\"Hot Start Up (easy version)\",4098,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1799\\\"\\u003eCodeforces Round 854 by cybercats (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1063C\":[\"Dwarves, Hats and Extrasensory Abilities\",2850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1063\\\"\\u003eCodeforces Round 516 (Div. 1, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-1172B\":[\"Nauuo and Circle\",3804,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1172\\\"\\u003eCodeforces Round 564 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-178C2\":[\"Smart Beaver and Resolving Collisions\",284,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/178\\\"\\u003eABBYY Cup 2.0 - Hard\\u003c/a\\u003e\"],\"CodeForces-818E\":[\"Card Game Again\",2006,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"CodeForces-914D\":[\"Bash and a Tough Math Puzzle\",5742,\"\\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-926E\":[\"Merge Equal Elements\",916,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/926\\\"\\u003eVK Cup 2018 - Wild-card Round 1\\u003c/a\\u003e\"],\"CodeForces-1002A4\":[\"Generate W state\",261,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1002\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018\\u003c/a\\u003e\"],\"CodeForces-250D\":[\"Building Bridge\",911,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/250\\\"\\u003eCROC-MBTU 2012, Final Round (Online version, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1846G\":[\"Rudolf and CodeVid-23\",4130,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1846\\\"\\u003eCodeforces Round 883 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-95C\":[\"Volleyball\",3025,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/95\\\"\\u003eCodeforces Beta Round 77 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1834D\":[\"Survey in Class\",4383,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1834\\\"\\u003eCodeforces Round 879 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1701D\":[\"Permutation Restoration\",5598,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1701\\\"\\u003eEducational Codeforces Round 131 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1749D\":[\"Counting Arrays\",5321,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1749\\\"\\u003eEducational Codeforces Round 138 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-708B\":[\"Recover the String\",3298,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/708\\\"\\u003eAIM Tech Round 3 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-817D\":[\"Imbalanced Array\",4955,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"CodeForces-1183H\":[\"Subsequences (hard version)\",3072,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1183\\\"\\u003eCodeforces Round 570 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1508A\":[\"Binary Literature\",6046,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1508\\\"\\u003eCodeforces Round 715 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-463D\":[\"Gargari and Permutations\",6395,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/463\\\"\\u003eCodeforces Round 264 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1902E\":[\"Collapsing Strings\",3782,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1902\\\"\\u003eEducational Codeforces Round 159 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1914F\":[\"Programming Competition\",3654,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1914\\\"\\u003eCodeforces Round 916 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1926G\":[\"Vlad and Trouble at MIT\",2903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1926\\\"\\u003eCodeforces Round 928 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-342C\":[\"Cupboard and Balloons\",2142,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/342\\\"\\u003eCodeforces Round 199 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-463C\":[\"Gargari and Bishops\",8699,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/463\\\"\\u003eCodeforces Round 264 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1902D\":[\"Robot Queries\",3697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1902\\\"\\u003eEducational Codeforces Round 159 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-148E\":[\"Porcelain\",4367,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/148\\\"\\u003eCodeforces Round 105 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-257D\":[\"Sum\",1669,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/257\\\"\\u003eCodeforces Round 159 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-366C\":[\"Dima and Salad\",5839,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/366\\\"\\u003eCodeforces Round 214 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-909E\":[\"Coprocessor\",2187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1251D\":[\"Salary Changing\",6069,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1251\\\"\\u003eEducational Codeforces Round 75 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1178E\":[\"Archaeology\",4294,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1178\\\"\\u003eCodeforces Global Round 4\\u003c/a\\u003e\"],\"CodeForces-1360G\":[\"A/B Matrix\",7633,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1360\\\"\\u003eCodeforces Round 644 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1479B1\":[\"Painting the Array I\",6802,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1479\\\"\\u003eCodeforces Round 700 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1216E1\":[\"Numerical Sequence (easy version)\",3598,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1216\\\"\\u003eCodeforces Round 587 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-41D\":[\"Pawn\",2331,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/41\\\"\\u003eCodeforces Beta Round 40 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-135C\":[\"Zero-One\",1396,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/135\\\"\\u003eCodeforces Beta Round 97 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-232B\":[\"Table\",1532,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/232\\\"\\u003eCodeforces Round 144 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-353B\":[\"Two Heaps\",2326,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/353\\\"\\u003eCodeforces Round 205 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1925D\":[\"Good Trip\",3204,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1925\\\"\\u003eCodeforces Round 921 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-111B\":[\"Petya and Divisors\",3832,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/111\\\"\\u003eCodeforces Beta Round 85 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-377B\":[\"Preparing for the Contest\",2214,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/377\\\"\\u003eCodeforces Round 222 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1044B\":[\"Intersecting Subtrees\",1562,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1044\\\"\\u003eLyft Level 5 Challenge 2018 - Final Round\\u003c/a\\u003e\"],\"CodeForces-1383B\":[\"GameGame\",4848,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1383\\\"\\u003eCodeforces Round 659 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1032D\":[\"Barcelonian Distance\",2742,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1032\\\"\\u003eTechnocup 2019 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-1153D\":[\"Serval and Rooted Tree\",5142,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1153\\\"\\u003eCodeforces Round 551 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1313C2\":[\"Skyscrapers (hard version)\",6432,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1313\\\"\\u003eCodeforces Round 622 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1141G\":[\"Privatization of Roads in Treeland\",2267,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1141\\\"\\u003eCodeforces Round 547 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1492D\":[\"Genius\\u0027s Gambit\",6061,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1492\\\"\\u003eCodeforces Round 704 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1938C\":[\"Bit Counting Sequence\",1258,\"\\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-1817B\":[\"Fish Graph\",3869,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1817\\\"\\u003eCodeforces Round 869 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-41E\":[\"3-cycles\",2063,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/41\\\"\\u003eCodeforces Beta Round 40 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-177E2\":[\"Space Voyage\",410,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/177\\\"\\u003eABBYY Cup 2.0 - Easy\\u003c/a\\u003e\"],\"CodeForces-1912D\":[\"Divisibility Test\",1304,\"\\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-134B\":[\"Pairs of Numbers\",2123,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/134\\\"\\u003eCodeforces Testing Round 3\\u003c/a\\u003e\"],\"CodeForces-279E\":[\"Beautiful Decomposition\",1540,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/279\\\"\\u003eCodeforces Round 171 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-158E\":[\"Phone Talks\",1519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/158\\\"\\u003eVK Cup 2012 Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-1912A\":[\"Accumulator Apex\",1874,\"\\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-388B\":[\"Fox and Minimal path\",2572,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/388\\\"\\u003eCodeforces Round 228 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1067A\":[\"Array Without Local Maximums\",2931,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1067\\\"\\u003eCodeforces Round 518 (Div. 1) [Thanks, Mail.Ru!]\\u003c/a\\u003e\"],\"CodeForces-1031D\":[\"Minimum path\",2686,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1031\\\"\\u003eTechnocup 2019 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1043E\":[\"Train Hard, Win Easy\",2902,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1043\\\"\\u003eCodeforces Round 519 by Botan Investments\\u003c/a\\u003e\"],\"CodeForces-1285D\":[\"Dr. Evil Underscores\",7693,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1285\\\"\\u003eCodeforces Round 613 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1055C\":[\"Lucky Days\",1928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1055\\\"\\u003eMail.Ru Cup 2018 Round 2\\u003c/a\\u003e\"],\"CodeForces-1237C2\":[\"Balanced Removals (Harder)\",4204,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1237\\\"\\u003eCodeforces Global Round 5\\u003c/a\\u003e\"],\"CodeForces-582B\":[\"Once Again...\",3527,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/582\\\"\\u003eCodeforces Round 323 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1707B\":[\"Difference Array\",5538,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1707\\\"\\u003eCodeforces Round 808 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-691E\":[\"Xor-sequences\",2550,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/691\\\"\\u003eEducational Codeforces Round 14\\u003c/a\\u003e\"],\"CodeForces-63D\":[\"Dividing Island\",1315,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/63\\\"\\u003eCodeforces Beta Round 59 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-351B\":[\"Jeff and Furik\",2571,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/351\\\"\\u003eCodeforces Round 204 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-121C\":[\"Lucky Permutation\",1308,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/121\\\"\\u003eCodeforces Beta Round 91 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1717D\":[\"Madoka and The Corruption Scheme\",4264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1717\\\"\\u003eCodeforces Round 818 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1729F\":[\"Kirei and the Linear Function\",4048,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1729\\\"\\u003eCodeforces Round 820 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1054D\":[\"Changing Array\",2316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1054\\\"\\u003eMail.Ru Cup 2018 Round 1\\u003c/a\\u003e\"],\"CodeForces-1175D\":[\"Array Splitting\",5995,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1175\\\"\\u003eEducational Codeforces Round 66 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1490G\":[\"Old Floppy Drive\",5678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1490\\\"\\u003eCodeforces Round 702 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1260D\":[\"A Game with Traps\",3739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1260\\\"\\u003eEducational Codeforces Round 77 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1272E\":[\"Nearest Opposite Parity\",6507,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1272\\\"\\u003eCodeforces Round 605 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-496D\":[\"Tennis Game\",3097,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/496\\\"\\u003eCodeforces Round 283 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-472D\":[\"Design Tutorial: Inverse the Problem\",5466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/472\\\"\\u003eCodeforces Round 270\\u003c/a\\u003e\"],\"CodeForces-1647D\":[\"Madoka and the Best School in Russia\",5169,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1647\\\"\\u003eCodeforces Round 777 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1659D\":[\"Reverse Sort Sum\",3919,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1659\\\"\\u003eCodeforces Round 782 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-213B\":[\"Numbers\",1755,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/213\\\"\\u003eCodeforces Round 131 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-455B\":[\"A Lot of Games\",6183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/455\\\"\\u003eCodeforces Round 260 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1081E\":[\"Missing Numbers\",2639,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1081\\\"\\u003eAvito Cool Challenge 2018\\u003c/a\\u003e\"],\"CodeForces-479E\":[\"Riding in a Lift\",5168,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/479\\\"\\u003eCodeforces Round 274 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-685B\":[\"Kay and Snowflake\",3919,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/685\\\"\\u003eCodeforces Round 359 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-552C\":[\"Vanya and Scales\",5928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/552\\\"\\u003eCodeforces Round 308 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-661B\":[\"Seasons\",222,\"\\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-552D\":[\"Vanya and Triangles\",4692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/552\\\"\\u003eCodeforces Round 308 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-540D\":[\"Bad Luck Island\",6066,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/540\\\"\\u003eCodeforces Round 301 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-661F\":[\"Primes in Interval\",230,\"\\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-1439A2\":[\"Binary Table (Hard Version)\",5002,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1439\\\"\\u003eCodeforces Round 684 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-321B\":[\"Ciel and Duel\",3075,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/321\\\"\\u003eCodeforces Round 190 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1307D\":[\"Cow and Fields\",6314,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1307\\\"\\u003eCodeforces Round 621 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1404B\":[\"Tree Tag\",7168,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1404\\\"\\u003eCodeforces Round 668 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1428D\":[\"Bouncing Boomerangs\",4488,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1428\\\"\\u003eCodeforces Raif Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-103C\":[\"Russian Roulette\",979,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/103\\\"\\u003eCodeforces Beta Round 80 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1092F\":[\"Tree with Maximum Cost\",7559,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1092\\\"\\u003eCodeforces Round 527 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-599D\":[\"Spongebob and Squares\",2765,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/599\\\"\\u003eCodeforces Round 332 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-660D\":[\"Number of Parallelograms\",4215,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/660\\\"\\u003eEducational Codeforces Round 11\\u003c/a\\u003e\"],\"CodeForces-1887B\":[\"Time Travel\",2684,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1887\\\"\\u003eCodeforces Round 905 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-223C\":[\"Partial Sums\",1721,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/223\\\"\\u003eCodeforces Round 138 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-223B\":[\"Two Strings\",1778,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/223\\\"\\u003eCodeforces Round 138 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-356B\":[\"Xenia and Hamming\",1959,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/356\\\"\\u003eCodeforces Round 207 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-126A\":[\"Hot Bath\",1493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/126\\\"\\u003eCodeforces Beta Round 93 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-138B\":[\"Digits Permutations\",1063,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/138\\\"\\u003eCodeforces Beta Round 99 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1512F\":[\"Education\",6075,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1512\\\"\\u003eCodeforces Round 713 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1899G\":[\"Unusual Entertainment\",2914,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1899\\\"\\u003eCodeforces Round 909 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-550D\":[\"Regular Bridge\",3493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/550\\\"\\u003eCodeforces Round 306 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-780D\":[\"Innokenty and a Football League\",2900,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/780\\\"\\u003eТехнокубок 2017 - Финал (только для онсайт-финалистов)\\u003c/a\\u003e\"],\"CodeForces-792D\":[\"Paths in a Complete Binary Tree\",3045,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/792\\\"\\u003eEducational Codeforces Round 18\\u003c/a\\u003e\"],\"CodeForces-683G\":[\"The Fraction\",130,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/683\\\"\\u003eSurprise Language Round 8\\u003c/a\\u003e\"],\"CodeForces-683H\":[\"Exchange of Books\",95,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/683\\\"\\u003eSurprise Language Round 8\\u003c/a\\u003e\"],\"CodeForces-1208D\":[\"Restore Permutation\",4989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1208\\\"\\u003eManthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1777D\":[\"Score of a Tree\",3243,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1777\\\"\\u003eCodeforces Round 845 (Div. 2) and ByteRace 2023\\u003c/a\\u003e\"],\"CodeForces-1898D\":[\"Absolute Beauty\",4729,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1898\\\"\\u003eCodeforces Round 910 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1305D\":[\"Kuroni and the Celebration\",4939,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1305\\\"\\u003eOzon Tech Challenge 2020 (Div.1 + Div.2, Rated, T-shirts + prizes!)\\u003c/a\\u003e\"],\"CodeForces-1854A2\":[\"Dual (Hard Version)\",6678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1854\\\"\\u003eCodeforces Round 889 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1547F\":[\"Array Stabilization (GCD version)\",5610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1547\\\"\\u003eCodeforces Round 731 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1656D\":[\"K-good\",6728,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1656\\\"\\u003eCodeTON Round 1 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-222E\":[\"Decoding Genome\",2764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/222\\\"\\u003eCodeforces Round 137 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-452D\":[\"Washer, Dryer, Folder\",1512,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/452\\\"\\u003eMemSQL Start[c]UP 2.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-222D\":[\"Olympiad\",2368,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/222\\\"\\u003eCodeforces Round 137 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-343C\":[\"Read Time\",3219,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/343\\\"\\u003eCodeforces Round 200 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-149D\":[\"Coloring Brackets\",4951,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1163C1\":[\"Power Transmission (Easy Edition)\",3350,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1163\\\"\\u003eCodeforces Round 558 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-137D\":[\"Palindromes\",1633,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/137\\\"\\u003eCodeforces Beta Round 98 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-367B\":[\"Sereja ans Anagrams\",2566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/367\\\"\\u003eCodeforces Round 215 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-258B\":[\"Little Elephant and Elections\",1658,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/258\\\"\\u003eCodeforces Round 157 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1644E\":[\"Expand the Path\",3119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1644\\\"\\u003eEducational Codeforces Round 123 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1163C2\":[\"Power Transmission (Hard Edition)\",3600,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1163\\\"\\u003eCodeforces Round 558 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1620E\":[\"Replace the Numbers\",8050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1620\\\"\\u003eEducational Codeforces Round 119 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-488B\":[\"Candy Boxes\",2228,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/488\\\"\\u003eCodeforces Round 278 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1090B\":[\"LaTeX Expert\",1399,\"\\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-597C\":[\"Subsequences\",5109,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/597\\\"\\u003eTesting Round 12\\u003c/a\\u003e\"],\"CodeForces-476D\":[\"Dreamoon and Sets\",4658,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/476\\\"\\u003eCodeforces Round 272 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-682D\":[\"Alyona and Strings\",3396,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/682\\\"\\u003eCodeforces Round 358 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1700D\":[\"River Locks\",5919,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1700\\\"\\u003eCodeforces Round 802 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1821D\":[\"Black Cells\",4791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1821\\\"\\u003eEducational Codeforces Round 147 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1611E2\":[\"Escape The Maze (hard version)\",3670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1611\\\"\\u003eCodeforces Round 756 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1627D\":[\"Not Adding\",7997,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1627\\\"\\u003eCodeforces Round 766 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-459E\":[\"Pashmak and Graph\",5678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/459\\\"\\u003eCodeforces Round 261 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1141F1\":[\"Same Sum Blocks (Easy)\",3818,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1141\\\"\\u003eCodeforces Round 547 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1141F2\":[\"Same Sum Blocks (Hard)\",4214,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1141\\\"\\u003eCodeforces Round 547 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-459C\":[\"Pashmak and Buses\",6363,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/459\\\"\\u003eCodeforces Round 261 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-229C\":[\"Triangles\",1703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/229\\\"\\u003eCodeforces Round 142 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-568B\":[\"Symmetric and Transitive\",2392,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/568\\\"\\u003eCodeforces Round 315 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-653C\":[\"Bear and Up-Down\",1719,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/653\\\"\\u003eIndiaHacks 2016 - Online Edition (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-750D\":[\"New Year and Fireworks\",3216,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/750\\\"\\u003eGood Bye 2016\\u003c/a\\u003e\"],\"CodeForces-883G\":[\"Orientation of Edges\",1497,\"\\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-883I\":[\"Photo Processing\",2060,\"\\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-1759G\":[\"Restore the Permutation\",4242,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1759\\\"\\u003eCodeforces Round 834 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1747D\":[\"Yet Another Problem\",4500,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1747\\\"\\u003eCodeforces Round 832 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1371E1\":[\"Asterism (Easy Version)\",5036,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1371\\\"\\u003eCodeforces Round 654 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-228E\":[\"The Road to Berland is Paved With Good Intentions\",2506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/228\\\"\\u003eCodeforces Round 141 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-119B\":[\"Before Exam\",1137,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/119\\\"\\u003eCodeforces Beta Round 90\\u003c/a\\u003e\"],\"CodeForces-1060D\":[\"Social Circles\",3973,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1060\\\"\\u003eCodeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1181C\":[\"Flag\",3126,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1181\\\"\\u003eCodeforces Round 567 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-894C\":[\"Marco and GCD Sequence\",4637,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/894\\\"\\u003eCodeforces Round 447 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-93B\":[\"End of Exams\",949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/93\\\"\\u003eCodeforces Beta Round 76 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1613D\":[\"MEX Sequences\",4504,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1613\\\"\\u003eEducational Codeforces Round 118 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1601B\":[\"Frog Traveler\",4833,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1601\\\"\\u003eCodeforces Round 751 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1746D\":[\"Paths on the Tree\",4445,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1746\\\"\\u003eCodeforces Global Round 23\\u003c/a\\u003e\"],\"CodeForces-421D\":[\"Bug in Code\",537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/421\\\"\\u003eCoder-Strike 2014 - Finals (online edition, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-215D\":[\"Hot Days\",1705,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/215\\\"\\u003eCodeforces Round 132 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-331B2\":[\"Shave Beaver!\",699,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/331\\\"\\u003eABBYY Cup 3.0 - Finals (online version)\\u003c/a\\u003e\"],\"CodeForces-336B\":[\"Vasily the Bear and Fly\",1243,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/336\\\"\\u003eCodeforces Round 195 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-457B\":[\"Distributed Join\",1171,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/457\\\"\\u003eMemSQL Start[c]UP 2.0 - Round 2\\u003c/a\\u003e\"],\"CodeForces-118C\":[\"Fancy Number\",2776,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1095F\":[\"Make It Connected\",6323,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1095\\\"\\u003eCodeforces Round 529 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1095E\":[\"Almost Regular Bracket Sequence\",4180,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1095\\\"\\u003eCodeforces Round 529 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-687C\":[\"The Values You Can Make\",5410,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/687\\\"\\u003eCodeforces Round 360 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-796C\":[\"Bank Hacking\",3270,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/796\\\"\\u003eCodeforces Round 408 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-566D\":[\"Restructuring Company\",3657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/566\\\"\\u003eVK Cup 2015 - Finals, online mirror\\u003c/a\\u003e\"],\"CodeForces-784D\":[\"Touchy-Feely Palindromes\",432,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/784\\\"\\u003eApril Fools Contest 2017\\u003c/a\\u003e\"],\"CodeForces-784F\":[\"Crunching Numbers Just for You\",1017,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/784\\\"\\u003eApril Fools Contest 2017\\u003c/a\\u003e\"],\"CodeForces-893D\":[\"Credit Card\",3104,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1002E2\":[\"Another array reconstruction algorithm\",198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1002\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018\\u003c/a\\u003e\"],\"CodeForces-1878F\":[\"Vasilije Loves Number Theory\",3719,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1878\\\"\\u003eCodeforces Round 900 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1842D\":[\"Tenzing and His Animal Friends\",3961,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1842\\\"\\u003eCodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1866C\":[\"Completely Searching for Inversions\",2846,\"\\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-420C\":[\"Bug in Code\",1258,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/420\\\"\\u003eCoder-Strike 2014 - Finals (online edition, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1648C\":[\"Tyler and Strings\",2891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1648\\\"\\u003eCodeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"CodeForces-335B\":[\"Palindrome\",2118,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/335\\\"\\u003eMemSQL start[c]up Round 2 - online version\\u003c/a\\u003e\"],\"CodeForces-226B\":[\"Naughty Stone Piles\",1696,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/226\\\"\\u003eCodeforces Round 140 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-359C\":[\"Prime Number\",3213,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/359\\\"\\u003eCodeforces Round 209 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1600E\":[\"Array Game\",1961,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1600\\\"\\u003eBubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1624G\":[\"MinOr Tree\",5653,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1624\\\"\\u003eCodeforces Round 764 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1744E2\":[\"Divisible Numbers (hard version)\",5382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1744\\\"\\u003eCodeforces Round 828 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-577B\":[\"Modulo Sum\",12599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/577\\\"\\u003eCodeforces Round 319 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-553B\":[\"Kyoya and Permutation\",2219,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/553\\\"\\u003eCodeforces Round 309 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-650B\":[\"Image Preview\",3556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/650\\\"\\u003eCodeforces Round 345 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1348D\":[\"Phoenix and Science\",8724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1348\\\"\\u003eCodeforces Round 638 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-16E\":[\"Fish\",5090,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/16\\\"\\u003eCodeforces Beta Round 16 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-16D\":[\"Logging\",1605,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/16\\\"\\u003eCodeforces Beta Round 16 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1421D\":[\"Hexagons\",4130,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1421\\\"\\u003eCodeforces Round 676 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1651D\":[\"Nearest Excluded Points\",4891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1651\\\"\\u003eEducational Codeforces Round 124 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1784B\":[\"Letter Exchange\",3201,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1784\\\"\\u003eVK Cup 2022 - Финальный раунд (Engine)\\u003c/a\\u003e\"],\"CodeForces-319B\":[\"Psychos in a Line\",4343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/319\\\"\\u003eCodeforces Round 189 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-5C\":[\"Longest Regular Bracket Sequence\",14263,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/5\\\"\\u003eCodeforces Beta Round 5\\u003c/a\\u003e\"],\"CodeForces-524C\":[\"The Art of Dealing with ATM\",2077,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/524\\\"\\u003eVK Cup 2015 - Round 1\\u003c/a\\u003e\"],\"CodeForces-633C\":[\"Spy Syndrome 2\",2888,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/633\\\"\\u003eManthan, Codefest 16\\u003c/a\\u003e\"],\"CodeForces-500D\":[\"New Year Santa Network\",3208,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/500\\\"\\u003eGood Bye 2014\\u003c/a\\u003e\"],\"CodeForces-730J\":[\"Bottles\",3539,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/730\\\"\\u003e2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1444B\":[\"Divide and Sum\",6134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1444\\\"\\u003eCodeforces Round 680 (Div. 1, based on Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-1105D\":[\"Kilani and the Game\",4334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1105\\\"\\u003eCodeforces Round 533 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1238D\":[\"AB-string\",5991,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1238\\\"\\u003eEducational Codeforces Round 74 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1117C\":[\"Magic Ship\",6842,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1117\\\"\\u003eEducational Codeforces Round 60 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1311F\":[\"Moving Points\",4103,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1311\\\"\\u003eCodeforces Round 624 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1650E\":[\"Rescheduling the Exam\",4100,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1650\\\"\\u003eCodeforces Round 776 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1202D\":[\"Print a 1337-string...\",5169,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1202\\\"\\u003eEducational Codeforces Round 70 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1214D\":[\"Treasure Island\",5347,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1214\\\"\\u003eCodeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-208C\":[\"Police Station\",2182,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/208\\\"\\u003eCodeforces Round 130 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-208B\":[\"Solitaire\",1472,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/208\\\"\\u003eCodeforces Round 130 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-547B\":[\"Mike and Feet\",8750,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/547\\\"\\u003eCodeforces Round 305 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-656A\":[\"Da Vinci Powers\",3741,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/656\\\"\\u003eApril Fools Day Contest 2016\\u003c/a\\u003e\"],\"CodeForces-535C\":[\"Tavas and Karafs\",4063,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/535\\\"\\u003eCodeforces Round 299 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-535D\":[\"Tavas and Malekas\",4084,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/535\\\"\\u003eCodeforces Round 299 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-862C\":[\"Mahmoud and Ehab and the xor\",4520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/862\\\"\\u003eCodeforces Round 435 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-656F\":[\"Ace It!\",902,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/656\\\"\\u003eApril Fools Day Contest 2016\\u003c/a\\u003e\"],\"CodeForces-656G\":[\"You\\u0027re a Professional\",476,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/656\\\"\\u003eApril Fools Day Contest 2016\\u003c/a\\u003e\"],\"CodeForces-1358D\":[\"The Best Vacation\",8347,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1358\\\"\\u003eCodeforces Round 645 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1467C\":[\"Three Bags\",6364,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1467\\\"\\u003eCodeforces Round 695 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-14D\":[\"Two Paths\",4724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/14\\\"\\u003eCodeforces Beta Round 14 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-14E\":[\"Camels\",1779,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/14\\\"\\u003eCodeforces Beta Round 14 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1213E\":[\"Two Small Strings\",5117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1661D\":[\"Progressions Covering\",4652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1661\\\"\\u003eEducational Codeforces Round 126 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-38D\":[\"Vasya the Architect\",818,\"\\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-437D\":[\"The Child and Zoo\",3413,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/437\\\"\\u003eCodeforces Round 250 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1891D\":[\"Suspicious logarithms\",3701,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1891\\\"\\u003eCodeforces Round 907 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1697D\":[\"Guess The String\",4310,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1697\\\"\\u003eEducational Codeforces Round 130 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1794D\":[\"Counting Factorizations\",3367,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1794\\\"\\u003eCodeforces Round 856 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1673D\":[\"Lost Arithmetic Progression\",3230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1673\\\"\\u003eCodeforces Round 785 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-558C\":[\"Amr and Chemistry\",4327,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/558\\\"\\u003eCodeforces Round 312 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-534D\":[\"Handshakes\",2643,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/534\\\"\\u003eCodeforces Round 298 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-510D\":[\"Fox And Jumping\",5616,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/510\\\"\\u003eCodeforces Round 290 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-982D\":[\"Shark\",2398,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/982\\\"\\u003eCodeforces Round 484 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1077F1\":[\"Pictures with Kittens (easy version)\",4279,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1077\\\"\\u003eCodeforces Round 521 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1369D\":[\"TediousLee\",8442,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1369\\\"\\u003eCodeforces Round 652 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-412E\":[\"E-mail Addresses\",911,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/412\\\"\\u003eCoder-Strike 2014 - Round 1\\u003c/a\\u003e\"],\"CodeForces-1200D\":[\"White Lines\",4131,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1200\\\"\\u003eCodeforces Round 578 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1430E\":[\"String Reversal\",6661,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1430\\\"\\u003eEducational Codeforces Round 96 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-27C\":[\"Unordered Subsequence\",3060,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/27\\\"\\u003eCodeforces Beta Round 27 (Codeforces format, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-327D\":[\"Block Tower\",2405,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/327\\\"\\u003eCodeforces Round 191 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-448C\":[\"Painting Fence\",8679,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/448\\\"\\u003eCodeforces Round 256 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-109B\":[\"Lucky Probability\",1462,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/109\\\"\\u003eCodeforces Beta Round 84 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-109C\":[\"Lucky Tree\",3352,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/109\\\"\\u003eCodeforces Beta Round 84 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1696D\":[\"Permutation Graph\",5268,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1696\\\"\\u003eCodeforces Global Round 21\\u003c/a\\u003e\"],\"CodeForces-6E\":[\"Exposition\",3245,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/6\\\"\\u003eCodeforces Beta Round 6 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-557C\":[\"Arthur and Table\",4327,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/557\\\"\\u003eCodeforces Round 311 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-993B\":[\"Open Communication\",2002,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/993\\\"\\u003eCodeforces Round 488 by NEAR (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-981D\":[\"Bookshelves\",3363,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/981\\\"\\u003eAvito Code Challenge 2018\\u003c/a\\u003e\"],\"CodeForces-630E\":[\"A rectangle\",2348,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-1679D\":[\"Toss a Coin to Your Graph...\",4656,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1679\\\"\\u003eCodeforces Round 791 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1328E\":[\"Tree Queries\",9475,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1328\\\"\\u003eCodeforces Round 629 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1413C\":[\"Perform Easily\",5571,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1413\\\"\\u003eTechnocup 2021 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1207E\":[\"XOR Guessing\",5786,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1207\\\"\\u003eEducational Codeforces Round 71 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1558B\":[\"Up the Strip\",4676,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1558\\\"\\u003eCodeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine))\\u003c/a\\u003e\"],\"CodeForces-529B\":[\"Group Photo 2 (online mirror version)\",948,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/529\\\"\\u003eVK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)\\u003c/a\\u003e\"],\"CodeForces-613A\":[\"Peter and Snow Blower\",3408,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/613\\\"\\u003eCodeforces Round 339 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-613B\":[\"Skills\",2310,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/613\\\"\\u003eCodeforces Round 339 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1527B2\":[\"Palindrome Game (hard version)\",7707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1527\\\"\\u003eCodeforces Round 721 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-722D\":[\"Generating Sets\",3243,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/722\\\"\\u003eIntel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-746E\":[\"Numbers Exchange\",1824,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/746\\\"\\u003eCodeforces Round 386 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-952B\":[\"A Map of the Cat\",2023,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/952\\\"\\u003eApril Fools Contest 2018\\u003c/a\\u003e\"],\"CodeForces-9D\":[\"How many trees?\",4119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/9\\\"\\u003eCodeforces Beta Round 9 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-180D\":[\"Name\",806,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/180\\\"\\u003eCodeforces Round 116 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1545B\":[\"AquaMoon and Chess\",5689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1545\\\"\\u003eCodeforces Round 732 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1569D\":[\"Inconvenient Pairs\",4283,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1569\\\"\\u003eEducational Codeforces Round 113 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1787D\":[\"Game on Axis\",3279,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1787\\\"\\u003eTypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1436D\":[\"Bandit in a City\",6117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1436\\\"\\u003eCodeforces Round 678 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1303D\":[\"Fill The Bag\",7055,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1303\\\"\\u003eEducational Codeforces Round 82 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1400D\":[\"Zigzags\",10011,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1400\\\"\\u003eEducational Codeforces Round 94 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1133F2\":[\"Spanning Tree with One Fixed Degree\",3190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1133\\\"\\u003eCodeforces Round 544 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-999D\":[\"Equalize the Remainders\",4532,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/999\\\"\\u003eCodeforces Round 490 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-648D\":[\"Собачки и миски\",221,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/648\\\"\\u003eТехнокубок 2016 - Отборочный Раунд 1\\u003c/a\\u003e\"],\"CodeForces-757C\":[\"Felicity is Coming!\",2491,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/757\\\"\\u003eCodecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1702G1\":[\"Passable Paths (easy version)\",5159,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1702\\\"\\u003eCodeforces Round 805 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-191C\":[\"Fools and Roads\",7594,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/191\\\"\\u003eCodeforces Round 121 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1423B\":[\"Valuable Paper\",1891,\"\\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-1677C\":[\"Tokitsukaze and Two Colorful Tapes\",3442,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1677\\\"\\u003eCodeforces Round 789 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1689D\":[\"Lena and Matrix\",4090,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1689\\\"\\u003eCodeforces Round 798 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1560F1\":[\"Nearest Beautiful Number (easy version)\",6051,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1560\\\"\\u003eCodeforces Round 739 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1205B\":[\"Shortest Cycle\",6555,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1205\\\"\\u003eCodeforces Round 580 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1774E\":[\"Two Chess Pieces\",3419,\"\\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-417D\":[\"Cunning Gena\",2641,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/417\\\"\\u003eRCC 2014 Warmup (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1895D\":[\"XOR Construction\",5586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1895\\\"\\u003eEducational Codeforces Round 157 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-309C\":[\"Memory for Arrays\",1361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/309\\\"\\u003eCroc Champ 2013 - Finals (online version, Div. 1)\\u003c/a\\u003e\"],\"CodeForces-744B\":[\"Hongcow\\u0027s Game\",1757,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/744\\\"\\u003eCodeforces Round 385 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-865B\":[\"Ordering Pizza\",1749,\"\\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-190D\":[\"Non-Secret Cypher\",2460,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/190\\\"\\u003eCodeforces Round 120 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1791G2\":[\"Teleporters (Hard Version)\",4521,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1791\\\"\\u003eCodeforces Round 849 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1593D2\":[\"Half of Same\",4869,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1593\\\"\\u003eCodeforces Round 748 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1773A\":[\"Amazing Trick\",1513,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1773\\\"\\u003e2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1119E\":[\"Pavel and Triangles\",5241,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1119\\\"\\u003eCodeforces Global Round 2\\u003c/a\\u003e\"],\"CodeForces-1228D\":[\"Complete Tripartite\",5099,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1228\\\"\\u003eCodeforces Round 589 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-404D\":[\"Minesweeper 1D\",2272,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/404\\\"\\u003eCodeforces Round 237 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1384B1\":[\"Koa and the Beach (Easy Version)\",3900,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1384\\\"\\u003eCodeforces Round 659 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1543C\":[\"Need for Pink Slips\",5343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1543\\\"\\u003eCodeforces Round 730 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1882D\":[\"Tree XOR\",4970,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1882\\\"\\u003eCodeforces Round 899 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1797D\":[\"Li Hua and Tree\",3720,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1797\\\"\\u003eCodeforces Round 864 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-19B\":[\"Checkout Assistant\",4907,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/19\\\"\\u003eCodeforces Beta Round 19\\u003c/a\\u003e\"],\"CodeForces-549D\":[\"Haar Features\",2249,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/549\\\"\\u003eLooksery Cup 2015\\u003c/a\\u003e\"],\"CodeForces-622D\":[\"Optimal Number Permutation\",2977,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/622\\\"\\u003eEducational Codeforces Round 7\\u003c/a\\u003e\"],\"CodeForces-1773K\":[\"King\\u0027s Puzzle\",1398,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1773\\\"\\u003e2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-731F\":[\"Video Cards\",2972,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/731\\\"\\u003eCodeforces Round 376 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-961E\":[\"Tufurama\",3792,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/961\\\"\\u003eEducational Codeforces Round 41 (Rated for Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1711956954000,"title":"CodeForces rating 1900 题目集","dislikeCnt":0,"content":"[problem:CodeForces-20C] Dijkstra?图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-5C] Longest regular bracket sequence构造算法(constructive algorithms) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-577B] Modulo sum组合数学(combinatorics) 数据结构(data structures), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-607B] Zuma动态规划(dp \n[problem:CodeForces-25D] Roads not only in berland并查集(dsu) 图论(graphs), 树形结构(trees\n[problem:CodeForces-61E] Enemy is weak数据结构(data structures) 树形结构(trees\n[problem:CodeForces-1400D] Zigzags暴力枚举(brute force) 组合数学(combinatorics), 数据结构(data structures), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1328E] Tree queries深度优先搜索及其变种(dfs and similar) 图论(graphs), 树形结构(trees\n[problem:CodeForces-1375D] Replace by mex暴力枚举(brute force) 构造算法(constructive algorithms), 排序算法(sortings\n[problem:CodeForces-1348D] Phoenix and science二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1036C] Classy numbers组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-463C] Gargari and bishops贪心策略(greedy) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1369D] Tediouslee动态规划(dp) 图论(graphs), 贪心策略(greedy), 数学(math), 树形结构(trees\n[problem:CodeForces-1354D] Multiset二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-547B] Mike and feet二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 并查集(dsu\n[problem:CodeForces-1486C2] Guessing the greatest (hard version)二分搜索(binary search) 交互性问题(interactive\n[problem:CodeForces-1358D] The best vacation二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-448C] Painting fence分治算法(divide and conquer) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1627D] Not adding暴力枚举(brute force) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1620E] Replace the numbers构造算法(constructive algorithms) 数据结构(data structures), 并查集(dsu), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1527B2] Palindrome game (hard version)构造算法(constructive algorithms) 博弈论(games\n[problem:CodeForces-1365E] Maximum subsequence value暴力枚举(brute force) 构造算法(constructive algorithms\n[problem:CodeForces-1360G] A/b matrix构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1285D] Dr. evil underscores位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 分治算法(divide and conquer), 动态规划(dp), 贪心策略(greedy), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1404B] Tree tag深度优先搜索及其变种(dfs and similar) 动态规划(dp), 博弈论(games), 树形结构(trees\n[problem:CodeForces-1242B] 0-1 mst深度优先搜索及其变种(dfs and similar) 并查集(dsu), 图论(graphs), 排序算法(sortings\n[problem:CodeForces-1092F] Tree with maximum cost深度优先搜索及其变种(dfs and similar) 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1245D] Shichikuji and power grid并查集(dsu) 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1353E] K-periodic garland暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1303D] Fill the bag位掩码(bitmasks) 贪心策略(greedy\n[problem:CodeForces-1479B1] Painting the array i构造算法(constructive algorithms) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-808D] Array division二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-191C] Fools and roads数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 树形结构(trees\n[problem:CodeForces-1155D] Beautiful array暴力枚举(brute force) 数据结构(data structures), 分治算法(divide and conquer), 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1854A2] Dual (hard version)构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1656D] K-good构造算法(constructive algorithms) 数学(math), 数论(number theory\n[problem:CodeForces-1114D] Flood fill动态规划(dp \n[problem:CodeForces-1475G] Strange beauty动态规划(dp) 数学(math), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-1205B] Shortest cycle位掩码(bitmasks) 暴力枚举(brute force), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1117C] Magic ship二分搜索(binary search \n[problem:CodeForces-1467C] Three bags构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1430E] String reversal数据结构(data structures) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1470B] Strange definition位掩码(bitmasks) 图论(graphs), 哈希表(hashing), 数学(math), 数论(number theory\n[problem:CodeForces-1313C2] Skyscrapers (hard version)数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-459C] Pashmak and buses组合数学(combinatorics) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-505C] Mr. kitayuta The treasure hunter深度优先搜索及其变种(dfs and similar), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-1444B] Divide and sum组合数学(combinatorics) 数学(math), 排序算法(sortings\n[problem:CodeForces-1508A] Binary literature构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings), 双指针算法(two pointers\n[problem:CodeForces-1307D] Cow and fields二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths), 排序算法(sortings\n[problem:CodeForces-1492D] Genius\u0027s gambit位掩码(bitmasks) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-463D] Gargari and permutations深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1512F] Education暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1560F1] Nearest beautiful number (easy version)二分搜索(binary search) 位掩码(bitmasks), 暴力枚举(brute force), 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy\n[problem:CodeForces-1495B] Let\u0027s go hiking博弈论(games) 贪心策略(greedy\n[problem:CodeForces-1342D] Multiple testcases二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1436D] Bandit in a city二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1700D] River locks二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 数学(math\n[problem:CodeForces-25C] Roads in berland图论(graphs) 最短路算法(shortest paths\n[problem:CodeForces-1272E] Nearest opposite parity深度优先搜索及其变种(dfs and similar) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1238D] Ab-string二分搜索(binary search) 组合数学(combinatorics), 动态规划(dp), 字符串处理(strings\n[problem:CodeForces-1095F] Make it connected并查集(dsu) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-455B] A lot of games深度优先搜索及其变种(dfs and similar) 动态规划(dp), 博弈论(games), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1175D] Array splitting贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-1251D] Salary changing二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1545B] Aquamoon and chess组合数学(combinatorics) 数学(math\n[problem:CodeForces-1207E] Xor guessing位掩码(bitmasks) 交互性问题(interactive), 数学(math\n[problem:CodeForces-1264B] Beautiful sequence暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy\n[problem:CodeForces-1413C] Perform easily二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1707B] Difference array暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1624G] Minor tree位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1547F] Array stabilization (gcd version)二分搜索(binary search) 暴力枚举(brute force), 数据结构(data structures), 分治算法(divide and conquer), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-1490G] Old floppy drive二分搜索(binary search) 数据结构(data structures), 数学(math\n[problem:CodeForces-1701D] Permutation restoration二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 数学(math), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1895D] Xor construction位掩码(bitmasks) 构造算法(constructive algorithms), 数据结构(data structures), 数学(math), 字符串后缀结构(string suffix structures), 树形结构(trees\n[problem:CodeForces-552C] Vanya and scales暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 数学(math), Meet-in-the-middle算法(meet-in-the-middle), 数论(number theory\n[problem:CodeForces-459E] Pashmak and graph动态规划(dp) 排序算法(sortings\n[problem:CodeForces-1494C] 1d sokoban二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1749D] Counting arrays组合数学(combinatorics) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1543C] Need for pink slips位掩码(bitmasks) 暴力枚举(brute force), 深度优先搜索及其变种(dfs and similar), 实现问题,编程技巧,模拟(implementation), 数学(math), 概率论(probabilities\n[problem:CodeForces-1744E2] Divisible numbers (hard version)暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-510D] Fox and jumping位掩码(bitmasks) 暴力枚举(brute force), 动态规划(dp), 数学(math\n[problem:CodeForces-1696D] Permutation graph二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 分治算法(divide and conquer), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-540D] Bad luck island动态规划(dp) 概率论(probabilities\n[problem:CodeForces-1367E] Necklace assembly暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-1647D] Madoka and the best school in russia构造算法(constructive algorithms) 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1197D] Yet another subarray problem动态规划(dp) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1475F] Unusual matrix二分图可满足性问题(2-sat) 暴力枚举(brute force), 构造算法(constructive algorithms\n[problem:CodeForces-1702G1] Passable paths (easy version)深度优先搜索及其变种(dfs and similar) 树形结构(trees\n[problem:CodeForces-1922D] Berserk monsters暴力枚举(brute force) 数据结构(data structures), 并查集(dsu), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-914D] Bash and a tough math puzzle数据结构(data structures) 数论(number theory\n[problem:CodeForces-1228D] Complete tripartite暴力枚举(brute force) 构造算法(constructive algorithms), 图论(graphs), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-472D] Design tutorial: inverse the problem深度优先搜索及其变种(dfs and similar) 并查集(dsu), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1371E1] Asterism (easy version)二分搜索(binary search) 暴力枚举(brute force), 组合数学(combinatorics), 数学(math), 数论(number theory), 排序算法(sortings\n[problem:CodeForces-1439A2] Binary table (hard version)构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1920D] Array repetition二分搜索(binary search) 暴力枚举(brute force), 并查集(dsu), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1718A2] Burenka and traditions (hard version)数据结构(data structures) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-479E] Riding in a lift组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-1214D] Treasure island深度优先搜索及其变种(dfs and similar) 动态规划(dp), 流(flows), 哈希表(hashing\n[problem:CodeForces-803C] Maximal gcd构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1213E] Two small strings暴力枚举(brute force) 构造算法(constructive algorithms\n[problem:CodeForces-687C] The values you can make动态规划(dp \n[problem:CodeForces-1715D] 2+ doors二分图可满足性问题(2-sat) 位掩码(bitmasks), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1202D] Print a 1337-string...组合数学(combinatorics) 构造算法(constructive algorithms), 数学(math), 字符串处理(strings\n[problem:CodeForces-1704D] Magical array构造算法(constructive algorithms) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1739D] Reset k edges二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1882D] Tree xor位掩码(bitmasks) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1593D2] Half of same暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-1651D] Nearest excluded points二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1883G2] Dances (hard version)二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1383B] Gamegame位掩码(bitmasks) 构造算法(constructive algorithms), 动态规划(dp), 博弈论(games), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1601B] Frog traveler数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs), 最短路算法(shortest paths), 双指针算法(two pointers\n[problem:CodeForces-1119E] Pavel and triangles暴力枚举(brute force) 动态规划(dp), 快速傅里叶变换(fft), 贪心策略(greedy), 三分搜索(ternary search\n[problem:CodeForces-1305D] Kuroni and the celebration构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 交互性问题(interactive), 树形结构(trees\n[problem:CodeForces-1821D] Black cells二分搜索(binary search) 暴力枚举(brute force), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1153D] Serval and rooted tree二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1208D] Restore permutation二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1294E] Obtain a permutation贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1276B] Two fairs组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-1898D] Absolute beauty贪心策略(greedy) 数学(math\n[problem:CodeForces-1174D] Ehab and the expected xor problem位掩码(bitmasks) 构造算法(constructive algorithms\n[problem:CodeForces-1558B] Up the strip暴力枚举(brute force) 动态规划(dp), 数学(math), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-16E] Fish位掩码(bitmasks) 动态规划(dp), 概率论(probabilities\n[problem:CodeForces-1679D] Toss a coin to your graph...二分搜索(binary search) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 图论(graphs\n[problem:CodeForces-366C] Dima and salad动态规划(dp \n[problem:CodeForces-1661D] Progressions covering数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-597C] Subsequences数据结构(data structures) 动态规划(dp\n[problem:CodeForces-1747D] Yet another problem二分搜索(binary search) 位掩码(bitmasks), 构造算法(constructive algorithms), 数据结构(data structures\n[problem:CodeForces-1613D] Mex sequences动态规划(dp) 数学(math\n[problem:CodeForces-1791G2] Teleporters (hard version)二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1428D] Bouncing boomerangs构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-739B] Alyona and a tree二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1746D] Paths on the tree深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1270D] Strange device构造算法(constructive algorithms) 交互性问题(interactive), 数学(math), 排序算法(sortings\n[problem:CodeForces-817D] Imbalanced array数据结构(data structures) 分治算法(divide and conquer), 并查集(dsu), 排序算法(sortings\n[problem:CodeForces-711D] Directed roads组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 数学(math\n[problem:CodeForces-552D] Vanya and triangles暴力枚举(brute force) 组合数学(combinatorics), 数据结构(data structures), 计算几何(geometry), 数学(math), 排序算法(sortings\n[problem:CodeForces-476D] Dreamoon and sets构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-19B] Checkout assistant动态规划(dp \n[problem:CodeForces-1834D] Survey in class暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-14D] Two paths深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 最短路算法(shortest paths), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-894C] Marco and gcd sequence构造算法(constructive algorithms) 数学(math\n[problem:CodeForces-1697D] Guess the string二分搜索(binary search) 构造算法(constructive algorithms), 交互性问题(interactive\n[problem:CodeForces-1569D] Inconvenient pairs二分搜索(binary search) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1463D] Pairs二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1717D] Madoka and the corruption scheme组合数学(combinatorics) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math\n[problem:CodeForces-1759G] Restore the permutation二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy), 数学(math\n[problem:CodeForces-3B] Lorry贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-999D] Equalize the remainders数据结构(data structures) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1237C2] Balanced removals (harder)二分搜索(binary search) 构造算法(constructive algorithms), 分治算法(divide and conquer), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1178E] Archaeology暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-1918D] Blocking elements二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-1453D] Checkpoints暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math), 概率论(probabilities\n[problem:CodeForces-1421D] Hexagons暴力枚举(brute force) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 最短路算法(shortest paths\n[problem:CodeForces-1141F2] Same sum blocks (hard)数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-1689D] Lena and matrix数据结构(data structures) 动态规划(dp), 计算几何(geometry), 最短路算法(shortest paths\n[problem:CodeForces-319B] Psychos in a line数据结构(data structures) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1799D1] Hot start up (easy version)动态规划(dp \n[problem:CodeForces-1650E] Rescheduling the exam二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-1105D] Kilani and the game深度优先搜索及其变种(dfs and similar) 图论(graphs), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-1846G] Rudolf and codevid-23位掩码(bitmasks) 动态规划(dp), 图论(graphs), 贪心策略(greedy), 最短路算法(shortest paths\n[problem:CodeForces-1929D] Sasha and a walk in the city组合数学(combinatorics) 动态规划(dp), 数学(math), 树形结构(trees\n[problem:CodeForces-1729F] Kirei and the linear function哈希表(hashing) 数学(math\n[problem:CodeForces-557C] Arthur and table暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-1000D] Yet another problem on a subsequence组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-1077F1] Pictures with kittens (easy version)动态规划(dp \n[problem:CodeForces-862C] Mahmoud and ehab and the xor构造算法(constructive algorithms \n[problem:CodeForces-292E] Copying data数据结构(data structures \n[problem:CodeForces-1144E] Median string位掩码(bitmasks) 数学(math), 数论(number theory), 字符串处理(strings\n[problem:CodeForces-558C] Amr and chemistry暴力枚举(brute force) 图论(graphs), 贪心策略(greedy), 数学(math), 最短路算法(shortest paths\n[problem:CodeForces-1200D] White lines暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-835D] Palindromic characteristics暴力枚举(brute force) 动态规划(dp), 哈希表(hashing), 字符串处理(strings\n[problem:CodeForces-1842D] Tenzing and his animal friends构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1311F] Moving points数据结构(data structures) 分治算法(divide and conquer), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-1659D] Reverse sort sum构造算法(constructive algorithms) 数据结构(data structures), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 双指针算法(two pointers\n[problem:CodeForces-1384B1] Koa and the beach (easy version)暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-1095E] Almost regular bracket sequence实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-660D] Number of parallelograms计算几何(geometry \n[problem:CodeForces-1817B] Fish graph暴力枚举(brute force) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-1909D] Split plus k贪心策略(greedy) 数学(math), 数论(number theory\n[problem:CodeForces-148E] Porcelain动态规划(dp \n[problem:CodeForces-685B] Kay and snowflake数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-1482D] Playlist数据结构(data structures) 并查集(dsu), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths\n[problem:CodeForces-1141F1] Same sum blocks (easy)贪心策略(greedy \n[problem:CodeForces-1172B] Nauuo and circle组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-535D] Tavas and malekas贪心策略(greedy) 哈希表(hashing), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-535C] Tavas and karafs二分搜索(binary search) 贪心策略(greedy), 数学(math\n[problem:CodeForces-294C] Shaass and lights组合数学(combinatorics) 数论(number theory\n[problem:CodeForces-1029D] Concatenated multiples实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-144D] Missile silos数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-1220D] Alex and julian位掩码(bitmasks) 数学(math), 数论(number theory\n[problem:CodeForces-1012B] Chemical table构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 矩阵(matrices\n[problem:CodeForces-9D] How many trees?组合数学(combinatorics) 分治算法(divide and conquer), 动态规划(dp\n[problem:CodeForces-1891D] Suspicious logarithms二分搜索(binary search) 暴力枚举(brute force), 数学(math\n[problem:CodeForces-1797D] Li hua and tree暴力枚举(brute force) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1878F] Vasilije loves number theory暴力枚举(brute force) 数学(math), 数论(number theory\n[problem:CodeForces-1800F] Dasha and nightmares位掩码(bitmasks) 哈希表(hashing), Meet-in-the-middle算法(meet-in-the-middle), 字符串处理(strings\n[problem:CodeForces-1902E] Collapsing strings数据结构(data structures) 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1585D] Yet another sorting problem数据结构(data structures) 数学(math\n[problem:CodeForces-1611E2] Escape the maze (hard version)深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 最短路算法(shortest paths), 树形结构(trees\n[problem:CodeForces-1076E] Vasya and a tree数据结构(data structures) 树形结构(trees\n[problem:CodeForces-1823D] Unique palindromes构造算法(constructive algorithms) 数学(math), 字符串处理(strings\n[problem:CodeForces-1260D] A game with traps二分搜索(binary search) 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1928D] Lonely mountain dungeons暴力枚举(brute force) 数据结构(data structures), 贪心策略(greedy), 数学(math), 三分搜索(ternary search\n[problem:CodeForces-1927F] Microcycle数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 树形结构(trees\n[problem:CodeForces-1060D] Social circles贪心策略(greedy) 数学(math\n[problem:CodeForces-1847D] Professor higashikata数据结构(data structures) 并查集(dsu), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 字符串处理(strings\n[problem:CodeForces-1902D] Robot queries二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-656A] Da vinci powers \n[problem:CodeForces-111B] Petya and divisors二分搜索(binary search) 数据结构(data structures), 数论(number theory\n[problem:CodeForces-1914F] Programming competition深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图匹配(graph matchings), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-832D] Misha Grisha and underground深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1808C] Unlucky numbers暴力枚举(brute force) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-149D] Coloring brackets动态规划(dp \n[problem:CodeForces-1041E] Tree reconstruction构造算法(constructive algorithms) 数据结构(data structures), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1157D] N problems during k days构造算法(constructive algorithms) 贪心策略(greedy), 数学(math\n[problem:CodeForces-1015E2] Stars drawing (hard edition)二分搜索(binary search) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-961E] Tufurama数据结构(data structures \n[problem:CodeForces-1819B] The butcher计算几何(geometry) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-1163C2] Power transmission (hard edition)数据结构(data structures) 计算几何(geometry), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-1361B] Johnny and grandmaster贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-1677C] Tokitsukaze and two colorful tapes构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1216E1] Numerical sequence (easy version)二分搜索(binary search) 暴力枚举(brute force), 数学(math\n[problem:CodeForces-1017D] The wu位掩码(bitmasks) 暴力枚举(brute force), 数据结构(data structures\n[problem:CodeForces-1921F] Sum of progression暴力枚举(brute force) 数据结构(data structures), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-650B] Image preview二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp), 双指针算法(two pointers\n[problem:CodeForces-582B] Once again...构造算法(constructive algorithms) 动态规划(dp), 矩阵(matrices\n[problem:CodeForces-1794D] Counting factorizations组合数学(combinatorics) 分治算法(divide and conquer), 动态规划(dp), 数学(math), 数论(number theory\n[problem:CodeForces-1774E] Two chess pieces深度优先搜索及其变种(dfs and similar) 动态规划(dp), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-1168B] Good triple暴力枚举(brute force) 双指针算法(two pointers\n[problem:CodeForces-1738D] Permutation addicts构造算法(constructive algorithms) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 树形结构(trees\n[problem:CodeForces-959E] Mahmoud and ehab and the xor-mst位掩码(bitmasks) 动态规划(dp), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-839B] Game of the rows暴力枚举(brute force) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1946D] Birthday gift位掩码(bitmasks) 暴力枚举(brute force), 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-550D] Regular bridge构造算法(constructive algorithms) 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1787D] Game on axis组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-702D] Road to post office数学(math \n[problem:CodeForces-1012C] Hills动态规划(dp \n[problem:CodeForces-811C] Vladik and memorable trip动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1784B] Letter exchange构造算法(constructive algorithms \n[problem:CodeForces-708B] Recover the string构造算法(constructive algorithms) 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-613A] Peter and snow blower二分搜索(binary search) 计算几何(geometry), 三分搜索(ternary search\n[problem:CodeForces-109C] Lucky tree动态规划(dp) 并查集(dsu), 树形结构(trees\n[problem:CodeForces-682D] Alyona and strings动态规划(dp) 字符串处理(strings\n[problem:CodeForces-1673D] Lost arithmetic progression组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-1777D] Score of a tree位掩码(bitmasks) 组合数学(combinatorics), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 数学(math), 概率论(probabilities), 树形结构(trees\n[problem:CodeForces-1801C] Music festival二分搜索(binary search) 数据结构(data structures), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-981D] Bookshelves位掩码(bitmasks) 动态规划(dp), 贪心策略(greedy\n[problem:CodeForces-700A] As fast as possible二分搜索(binary search) 数学(math\n[problem:CodeForces-437D] The child and zoo并查集(dsu) 排序算法(sortings\n[problem:CodeForces-730J] Bottles动态规划(dp \n[problem:CodeForces-1163C1] Power transmission (easy edition)暴力枚举(brute force) 计算几何(geometry\n[problem:CodeForces-1925D] Good trip组合数学(combinatorics) 动态规划(dp), 数学(math), 概率论(probabilities\n[problem:CodeForces-722D] Generating sets二分搜索(binary search) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 贪心策略(greedy), 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-1477B] Nezzar and binary string数据结构(data structures) 贪心策略(greedy\n[problem:CodeForces-750D] New year and fireworks暴力枚举(brute force) 数据结构(data structures), 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-566D] Restructuring company数据结构(data structures) 并查集(dsu\n[problem:CodeForces-1932F] Feed cats数据结构(data structures) 动态规划(dp), 排序算法(sortings\n[problem:CodeForces-959D] Mahmoud and ehab and another array construction task构造算法(constructive algorithms) 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-803D] Magazine ad二分搜索(binary search) 贪心策略(greedy\n[problem:CodeForces-1714F] Build a tree and that is it构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-500D] New year santa network组合数学(combinatorics) 深度优先搜索及其变种(dfs and similar), 图论(graphs), 树形结构(trees\n[problem:CodeForces-1945F] Kirill and mushrooms数据结构(data structures) 排序算法(sortings\n[problem:CodeForces-1181C] Flag暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-496D] Tennis game二分搜索(binary search \n[problem:CodeForces-796C] Bank hacking构造算法(constructive algorithms) 数据结构(data structures), 动态规划(dp), 树形结构(trees\n[problem:CodeForces-965D] Single-use stones二分搜索(binary search) 流(flows), 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1133F2] Spanning tree with one fixed degree构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-1277D] Let\u0027s play the words?数据结构(data structures) 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-321B] Ciel and duel动态规划(dp) 流(flows), 贪心策略(greedy\n[problem:CodeForces-1644E] Expand the path暴力枚举(brute force) 组合数学(combinatorics), 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-6E] Exposition二分搜索(binary search) 数据结构(data structures), 并查集(dsu), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-359C] Prime number数学(math) 数论(number theory\n[problem:CodeForces-893D] Credit card数据结构(data structures) 动态规划(dp), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-343C] Read time二分搜索(binary search) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-1183H] Subsequences (hard version)动态规划(dp) 字符串处理(strings\n[problem:CodeForces-792D] Paths in a complete binary tree位掩码(bitmasks) 树形结构(trees\n[problem:CodeForces-1648C] Tyler and strings组合数学(combinatorics) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-780D] Innokenty and a football league二分图可满足性问题(2-sat) 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 最短路算法(shortest paths), 字符串处理(strings\n[problem:CodeForces-1899G] Unusual 进入tainment数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 最短路算法(shortest paths), 排序算法(sortings), 树形结构(trees), 双指针算法(two pointers\n[problem:CodeForces-1866C] Completely searching for inversions深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs\n[problem:CodeForces-622D] Optimal number permutation构造算法(constructive algorithms \n[problem:CodeForces-1063C] Dwarves Hats and extrasensory abilities二分搜索(binary search), 构造算法(constructive algorithms), 计算几何(geometry), 交互性问题(interactive\n[problem:CodeForces-1067A] Array without local maximums动态规划(dp \n[problem:CodeForces-731F] Video cards暴力枚举(brute force) 数据结构(data structures), 实现问题,编程技巧,模拟(implementation), 数学(math), 数论(number theory\n[problem:CodeForces-1926G] Vlad and trouble at mit深度优先搜索及其变种(dfs and similar) 动态规划(dp), 流(flows), 图论(graphs), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 树形结构(trees\n[problem:CodeForces-1043E] Train hard Win easy构造算法(constructive algorithms), 贪心策略(greedy), 数学(math), 排序算法(sortings\n[problem:CodeForces-27C] Unordered subsequence构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-1147B] Chladni figure暴力枚举(brute force) 字符串处理(strings\n[problem:CodeForces-95C] Volleyball最短路算法(shortest paths \n[problem:CodeForces-374C] Inna and dima深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1032D] Barcelonian distance计算几何(geometry) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1031D] Minimum path贪心策略(greedy \n[problem:CodeForces-1887B] Time travel二分搜索(binary search) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-22D] Segments贪心策略(greedy) 排序算法(sortings\n[problem:CodeForces-633C] Spy syndrome 2数据结构(data structures) 动态规划(dp), 哈希表(hashing), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 字符串后缀结构(string suffix structures), 字符串处理(strings\n[problem:CodeForces-599D] Spongebob and squares暴力枚举(brute force) 数学(math\n[problem:CodeForces-1081E] Missing numbers二分搜索(binary search) 构造算法(constructive algorithms), 贪心策略(greedy), 数学(math), 数论(number theory\n[problem:CodeForces-118C] Fancy number暴力枚举(brute force) 贪心策略(greedy), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-935D] Fafa and ancient alphabet数学(math) 概率论(probabilities\n[problem:CodeForces-372B] Counting rectangles is fun暴力枚举(brute force) 分治算法(divide and conquer), 动态规划(dp\n[problem:CodeForces-222E] Decoding genome动态规划(dp) 矩阵(matrices\n[problem:CodeForces-388B] Fox and minimal path位掩码(bitmasks) 构造算法(constructive algorithms), 图论(graphs), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-367B] Sereja ans anagrams二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-534D] Handshakes二分搜索(binary search) 构造算法(constructive algorithms), 数据结构(data structures), 贪心策略(greedy\n[problem:CodeForces-417D] Cunning gena位掩码(bitmasks) 动态规划(dp), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-691E] Xor-sequences矩阵(matrices \n[problem:CodeForces-846D] Monitor二分搜索(binary search) 数据结构(data structures\n[problem:CodeForces-757C] Felicity is coming!数据结构(data structures) 哈希表(hashing), 排序算法(sortings), 字符串处理(strings\n[problem:CodeForces-292D] Connected components数据结构(data structures) 深度优先搜索及其变种(dfs and similar), 动态规划(dp), 并查集(dsu\n[problem:CodeForces-228E] The road to berland is paved with good intentions二分图可满足性问题(2-sat) 深度优先搜索及其变种(dfs and similar), 并查集(dsu), 图论(graphs\n[problem:CodeForces-57C] Array组合数学(combinatorics) 数学(math\n[problem:CodeForces-351B] Jeff and furik组合数学(combinatorics) 动态规划(dp), 概率论(probabilities\n[problem:CodeForces-982D] Shark暴力枚举(brute force) 数据结构(data structures), 并查集(dsu), 树形结构(trees\n[problem:CodeForces-724D] Dense subsequence数据结构(data structures) 贪心策略(greedy), 字符串处理(strings\n[problem:CodeForces-190D] Non-secret cypher双指针算法(two pointers \n[problem:CodeForces-568B] Symmetric and transitive组合数学(combinatorics) 动态规划(dp), 数学(math\n[problem:CodeForces-1054D] Changing array贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-327D] Block tower构造算法(constructive algorithms) 深度优先搜索及其变种(dfs and similar), 图论(graphs\n[problem:CodeForces-1141G] Privatization of roads in treeland二分搜索(binary search) 构造算法(constructive algorithms), 深度优先搜索及其变种(dfs and similar), 图论(graphs), 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-353B] Two heaps组合数学(combinatorics) 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math), 排序算法(sortings\n[problem:CodeForces-613B] Skills二分搜索(binary search) 暴力枚举(brute force), 动态规划(dp), 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-41D] Pawn动态规划(dp \n[problem:CodeForces-729E] Subordinates构造算法(constructive algorithms) 数据结构(data structures), 图论(graphs), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-549D] Haar features贪心策略(greedy) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-222D] Olympiad二分搜索(binary search) 贪心策略(greedy), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-630E] A rectangle数学(math \n[problem:CodeForces-553B] Kyoya and permutation二分搜索(binary search) 组合数学(combinatorics), 构造算法(constructive algorithms), 贪心策略(greedy), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-488B] Candy boxes暴力枚举(brute force) 构造算法(constructive algorithms), 数学(math\n[problem:CodeForces-930C] Teodor is not a liar!数据结构(data structures) 动态规划(dp\n[problem:CodeForces-490D] Chocolate暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 数学(math), Meet-in-the-middle算法(meet-in-the-middle), 数论(number theory\n[problem:CodeForces-404D] Minesweeper 1d动态规划(dp) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-409F] 000001 \n[problem:CodeForces-949C] Data center maintenance深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-524C] The art of dealing with atm二分搜索(binary search) 排序算法(sortings\n[problem:CodeForces-377B] Preparing for the contest二分搜索(binary search) 数据结构(data structures), 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-952B] A map of the cat暴力枚举(brute force) 交互性问题(interactive\n[problem:CodeForces-909E] Coprocessor深度优先搜索及其变种(dfs and similar) 动态规划(dp), 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-335B] Palindrome构造算法(constructive algorithms) 动态规划(dp\n[problem:CodeForces-993B] Open communication位掩码(bitmasks) 暴力枚举(brute force\n[problem:CodeForces-1600E] Array game博弈论(games) 贪心策略(greedy), 双指针算法(two pointers\n[problem:CodeForces-134B] Pairs of numbers暴力枚举(brute force) 深度优先搜索及其变种(dfs and similar), 数学(math), 数论(number theory\n[problem:CodeForces-1089F] Fractions数学(math \n[problem:CodeForces-356B] Xenia and hamming实现问题,编程技巧,模拟(implementation) 数学(math\n[problem:CodeForces-41E] 3-cycles构造算法(constructive algorithms) 图论(graphs), 贪心策略(greedy\n[problem:CodeForces-883I] Photo processing二分搜索(binary search) 动态规划(dp\n[problem:CodeForces-818E] Card game again二分搜索(binary search) 数据结构(data structures), 数论(number theory), 双指针算法(two pointers\n[problem:CodeForces-1055C] Lucky days数学(math) 数论(number theory\n[problem:CodeForces-342C] Cupboard and balloons计算几何(geometry \n[problem:CodeForces-848B] Rooter\u0027s song构造算法(constructive algorithms) 数据结构(data structures), 计算几何(geometry), 实现问题,编程技巧,模拟(implementation), 排序算法(sortings), 双指针算法(two pointers\n[problem:CodeForces-208C] Police station动态规划(dp) 图论(graphs), 最短路算法(shortest paths\n[problem:CodeForces-21A] Jabber id实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-1423B] Valuable paper二分搜索(binary search) 流(flows), 图匹配(graph matchings), 图论(graphs\n[problem:CodeForces-1912A] Accumulator apex数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-223B] Two strings数据结构(data structures) 动态规划(dp), 字符串处理(strings\n[problem:CodeForces-744B] Hongcow\u0027s game位掩码(bitmasks) 分治算法(divide and conquer), 交互性问题(interactive\n[problem:CodeForces-746E] Numbers exchange贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-213B] Numbers组合数学(combinatorics) 动态规划(dp\n[problem:CodeForces-865B] Ordering pizza二分搜索(binary search) 排序算法(sortings), 三分搜索(ternary search\n[problem:CodeForces-362C] Insertion sort数据结构(data structures) 动态规划(dp), 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-653C] Bear and up-down暴力枚举(brute force) 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1120A] Diana and liana贪心策略(greedy) 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-819B] Mister b and pr shifts数据结构(data structures) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-229C] Triangles组合数学(combinatorics) 图论(graphs), 数学(math\n[problem:CodeForces-14E] Camels动态规划(dp \n[problem:CodeForces-55C] Pie or die博弈论(games \n[problem:CodeForces-215D] Hot days贪心策略(greedy \n[problem:CodeForces-45D] Event dates贪心策略(greedy) Meet-in-the-middle算法(meet-in-the-middle), 排序算法(sortings\n[problem:CodeForces-257D] Sum贪心策略(greedy) 数学(math\n[problem:CodeForces-1184E1] Daleks\u0027 invasion (easy)图论(graphs) 树形结构(trees\n[problem:CodeForces-1044B] Intersecting subtrees深度优先搜索及其变种(dfs and similar) 交互性问题(interactive), 树形结构(trees\n[problem:CodeForces-285D] Permutation sum位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 实现问题,编程技巧,模拟(implementation), Meet-in-the-middle算法(meet-in-the-middle\n[problem:CodeForces-226B] Naughty stone piles贪心策略(greedy \n[problem:CodeForces-223C] Partial sums组合数学(combinatorics) 数学(math), 数论(number theory\n[problem:CodeForces-16D] Logging实现问题,编程技巧,模拟(implementation) 字符串处理(strings\n[problem:CodeForces-847I] Noise level深度优先搜索及其变种(dfs and similar) 实现问题,编程技巧,模拟(implementation), 数学(math\n[problem:CodeForces-37C] Old berland language数据结构(data structures) 贪心策略(greedy), 树形结构(trees\n[problem:CodeForces-137D] Palindromes动态规划(dp) 字符串处理(strings\n[problem:CodeForces-452D] Washer Dryer, Folder贪心策略(greedy), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1773A] Amazing trick构造算法(constructive algorithms) 图匹配(graph matchings), 数学(math), 概率论(probabilities\n[problem:CodeForces-158E] Phone talks 动态规划(dp), 排序算法(sortings\n[problem:CodeForces-717E] Paint it really Really dark gray深度优先搜索及其变种(dfs and similar\n[problem:CodeForces-258B] Little elephant and elections暴力枚举(brute force) 组合数学(combinatorics), 动态规划(dp\n[problem:CodeForces-279E] Beautiful decomposition动态规划(dp) 博弈论(games), 贪心策略(greedy), 数论(number theory\n[problem:CodeForces-126A] Hot bath二分搜索(binary search) 暴力枚举(brute force), 数学(math\n[problem:CodeForces-232B] Table位掩码(bitmasks) 组合数学(combinatorics), 动态规划(dp), 数学(math\n[problem:CodeForces-883G] Orientation of edges深度优先搜索及其变种(dfs and similar) 图论(graphs\n[problem:CodeForces-1090B] Latex exper \n[problem:CodeForces-1773K] King\u0027s puzzle构造算法(constructive algorithms \n[problem:CodeForces-261B] Maxim and restaurant动态规划(dp) 数学(math), 概率论(probabilities\n[problem:CodeForces-717D] Dexterina’s lab博弈论(games) 矩阵(matrices), 概率论(probabilities\n[problem:CodeForces-208B] Solitaire深度优先搜索及其变种(dfs and similar) 动态规划(dp\n[problem:CodeForces-67D] Optical experiment二分搜索(binary search) 数据结构(data structures), 动态规划(dp\n[problem:CodeForces-109B] Lucky probability暴力枚举(brute force) 概率论(probabilities\n[problem:CodeForces-135C] Zero-one构造算法(constructive algorithms) 博弈论(games), 贪心策略(greedy\n[problem:CodeForces-309C] Memory for arrays二分搜索(binary search) 位掩码(bitmasks), 贪心策略(greedy\n[problem:CodeForces-121C] Lucky permutation暴力枚举(brute force) 组合数学(combinatorics), 数论(number theory\n[problem:CodeForces-1912D] Divisibility test数学(math \n[problem:CodeForces-1906E] Merge not sort构造算法(constructive algorithms) 动态规划(dp\n[problem:CodeForces-63D] Dividing island构造算法(constructive algorithms \n[problem:CodeForces-420C] Bug in code数据结构(data structures) 图论(graphs), 实现问题,编程技巧,模拟(implementation), 双指针算法(two pointers\n[problem:CodeForces-336B] Vasily the bear and fly数学(math \n[problem:CodeForces-1938C] Bit counting sequenc \n[problem:CodeForces-457B] Distributed join贪心策略(greedy \n[problem:CodeForces-119B] Before exam构造算法(constructive algorithms) 实现问题,编程技巧,模拟(implementation), 排序算法(sortings\n[problem:CodeForces-138B] Digits permutations贪心策略(greedy \n[problem:CodeForces-195D] Analyzing polyline计算几何(geometry) 数学(math), 排序算法(sortings\n[problem:CodeForces-784F] Crunching numbers just for you 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-173C] Spiral maximum暴力枚举(brute force) 动态规划(dp\n[problem:CodeForces-103C] Russian roulette构造算法(constructive algorithms) 贪心策略(greedy\n[problem:CodeForces-69D] Dot动态规划(dp) 博弈论(games\n[problem:CodeForces-926E] Merge equal elements构造算法(constructive algorithms) 数据结构(data structures\n[problem:CodeForces-120J] Minimum sum分治算法(divide and conquer) 计算几何(geometry), 排序算法(sortings\n[problem:CodeForces-46E] Comb数据结构(data structures) 动态规划(dp\n[problem:CodeForces-93B] End of exams贪心策略(greedy \n[problem:CodeForces-928C] Dependency management 图论(graphs), 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-656F] Ace it! \n[problem:CodeForces-250D] Building bridge计算几何(geometry) 三分搜索(ternary search), 双指针算法(two pointers\n[problem:CodeForces-529B] Group photo 2 (online mirror version)暴力枚举(brute force) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-45C] Dancing lessons数据结构(data structures \n[problem:CodeForces-412E] E-mail addresses实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-928D] Autocompletion 字符串处理(strings), 树形结构(trees\n[problem:CodeForces-199B] Special olympics计算几何(geometry \n[problem:CodeForces-180D] Name贪心策略(greedy) 字符串处理(strings\n[problem:CodeForces-331B2] Shave beaver!数据结构(data structures \n[problem:CodeForces-241G] Challenging balloons构造算法(constructive algorithms \n[problem:CodeForces-421D] Bug in code二分搜索(binary search) 数据结构(data structures), 排序算法(sortings\n[problem:CodeForces-656G] You\u0027re a professional \n[problem:CodeForces-38D] Vasya the architect实现问题,编程技巧,模拟(implementation \n[problem:CodeForces-784D] Touchy-feely palindromes 实现问题,编程技巧,模拟(implementation\n[problem:CodeForces-1488C] Two policemen 二分搜索(binary search), 暴力枚举(brute force), 数学(math\n[problem:CodeForces-177E2] Space voyage二分搜索(binary search \n[problem:CodeForces-1488D] Problemsolving marathon 二分搜索(binary search), 贪心策略(greedy\n[problem:CodeForces-178E1] The beaver\u0027s problem - \n[problem:CodeForces-178C2] Smart beaver and resolving collision \n[problem:CodeForces-1002A4] Generate w stat \n[problem:CodeForces-178D2] Magic square \n[problem:CodeForces-661F] Primes in interval \n[problem:CodeForces-470C] Eval \n[problem:CodeForces-162D] Remove digits \n[problem:CodeForces-661B] Seasons \n[problem:CodeForces-648D] Собачки и миски数据结构(data structures) 贪心策略(greedy), 排序算法(sortings\n[problem:CodeForces-1002E2] Another array reconstruction algorith \n[problem:CodeForces-470E] Chessboard \n[problem:CodeForces-207B2] Military 训 \n[problem:CodeForces-470D] Caesar cipher \n[problem:CodeForces-683G] The fraction \n[problem:CodeForces-72F] Oil 贪心策略(greedy), 数学(math\n[problem:CodeForces-683H] Exchange of books \n[problem:CodeForces-1909I] Short permutation problem组合数学(combinatorics) 动态规划(dp), 快速傅里叶变换(fft), 数学(math\n","threadId":188469,"likeCnt":0,"createTime":1711956934000,"isWorkbook":true,"viewCnt":119,"openness":2,"fav":false,"id":4791,"trustable":false}