Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-1037A\":[\"Packets\",11380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1037\\\"\\u003eManthan, Codefest 18 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1279B\":[\"Verse For Santa\",13930,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1279\\\"\\u003eEducational Codeforces Round 79 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1659B\":[\"Bit Flipping\",10759,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1659\\\"\\u003eCodeforces Round 782 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1037B\":[\"Reach Median\",10912,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1037\\\"\\u003eManthan, Codefest 18 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1768C\":[\"Elemental Decompress\",13623,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1768\\\"\\u003eCodeforces Round 842 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1647C\":[\"Madoka and Childish Pranks\",12527,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1647\\\"\\u003eCodeforces Round 777 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1538C\":[\"Number of Pairs\",27894,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1538\\\"\\u003eCodeforces Round 725 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1889A\":[\"Qingshan Loves Strings 2\",11991,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1889\\\"\\u003eCodeforces Round 906 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1352D\":[\"Alice, Bob and Candies\",25497,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1352\\\"\\u003eCodeforces Round 640 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1037C\":[\"Equalize\",19101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1037\\\"\\u003eManthan, Codefest 18 (rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-509B\":[\"Painting Pebbles\",10015,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/509\\\"\\u003eCodeforces Round 289 (Div. 2, ACM ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1364B\":[\"Most socially-distanced subsequence\",18794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1364\\\"\\u003eCodeforces Round 649 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-932B\":[\"Recursive Queries\",9028,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/932\\\"\\u003eICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-1093C\":[\"Mishka and the Last Exam\",9537,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1093\\\"\\u003eEducational Codeforces Round 56 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-588B\":[\"Duff in Love\",15053,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/588\\\"\\u003eCodeforces Round 326 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1864C\":[\"Divisor Chain\",12698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1864\\\"\\u003eHarbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1307B\":[\"Cow and Friend\",13472,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1307\\\"\\u003eCodeforces Round 621 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-236B\":[\"Easy Number Challenge\",15712,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/236\\\"\\u003eCodeforces Round 146 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1157B\":[\"Long Number\",15330,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1157\\\"\\u003eCodeforces Round 555 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-508B\":[\"Anton and currency you all know\",23425,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/508\\\"\\u003eCodeforces Round 288 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-617B\":[\"Chocolate\",19057,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/617\\\"\\u003eCodeforces Round 340 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-810B\":[\"Summer sell-off\",11729,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/810\\\"\\u003eCodeforces Round 415 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-478B\":[\"Random Teams\",37253,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/478\\\"\\u003eCodeforces Round 273 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1899E\":[\"Queue Sort\",13937,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1899\\\"\\u003eCodeforces Round 909 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1209B\":[\"Koala and Lights\",8303,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1209\\\"\\u003eCodeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1766C\":[\"Hamiltonian Wall\",13361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1766\\\"\\u003eEducational Codeforces Round 139 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1899D\":[\"Yarik and Musical Notes\",12207,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1899\\\"\\u003eCodeforces Round 909 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-66A\":[\"Petya and Java\",6982,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/66\\\"\\u003eCodeforces Beta Round 61 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1059B\":[\"Forgery\",7471,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1059\\\"\\u003eCodeforces Round 514 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1778B\":[\"The Forbidden Permutation\",12948,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1778\\\"\\u003eCodeforces Round 848 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1265B\":[\"Beautiful Numbers\",12794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1265\\\"\\u003eCodeforces Round 604 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1669H\":[\"Maximal AND\",16581,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1669\\\"\\u003eCodeforces Round 784 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-519C\":[\"A and B and Team Training\",20805,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/519\\\"\\u003eCodeforces Round 294 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-628B\":[\"New Skateboard\",11008,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/628\\\"\\u003eEducational Codeforces Round 8\\u003c/a\\u003e\"],\"CodeForces-1851D\":[\"Prefix Permutation Sums\",14403,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1851\\\"\\u003eCodeforces Round 888 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-598B\":[\"Queries on a String\",11805,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/598\\\"\\u003eEducational Codeforces Round 1\\u003c/a\\u003e\"],\"CodeForces-792B\":[\"Counting-out Rhyme\",6384,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/792\\\"\\u003eEducational Codeforces Round 18\\u003c/a\\u003e\"],\"CodeForces-1547D\":[\"Co-growing Sequence\",17067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1547\\\"\\u003eCodeforces Round 731 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1915E\":[\"Romantic Glasses\",18448,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1915\\\"\\u003eCodeforces Round 918 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-222B\":[\"Cosmic Tables\",6520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/222\\\"\\u003eCodeforces Round 137 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1155C\":[\"Alarm Clocks Everywhere\",9342,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1155\\\"\\u003eEducational Codeforces Round 63 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-246B\":[\"Increase and Decrease\",11695,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/246\\\"\\u003eCodeforces Round 151 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1373C\":[\"Pluses and Minuses\",18276,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1373\\\"\\u003eEducational Codeforces Round 90 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1470A\":[\"Strange Birthday Party\",21528,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1470\\\"\\u003eCodeforces Round 694 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1850F\":[\"We Were Both Children\",17412,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1850\\\"\\u003eCodeforces Round 886 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1741D\":[\"Masha and a Beautiful Tree\",14982,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1741\\\"\\u003eCodeforces Round 826 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1862D\":[\"Ice Cream Balls\",16165,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1862\\\"\\u003eCodeforces Round 894 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-626B\":[\"Cards\",7012,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/626\\\"\\u003e8VC Venture Cup 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-844B\":[\"Rectangles\",7552,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/844\\\"\\u003eAIM Tech Round 4 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-476B\":[\"Dreamoon and WiFi\",32102,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/476\\\"\\u003eCodeforces Round 272 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-573A\":[\"Bear and Poker\",18011,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/573\\\"\\u003eCodeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1807E\":[\"Interview\",12139,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1807\\\"\\u003eCodeforces Round 859 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-670C\":[\"Cinema\",10695,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/670\\\"\\u003eCodeforces Round 350 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1819A\":[\"Constructive Problem\",12043,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1819\\\"\\u003eCodeforces Round 866 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1029A\":[\"Many Equal Substrings\",13456,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1029\\\"\\u003eCodeforces Round 506 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-152B\":[\"Steps\",6936,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/152\\\"\\u003eCodeforces Round 108 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1821C\":[\"Tear It Apart\",13807,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1821\\\"\\u003eEducational Codeforces Round 147 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1603A\":[\"Di-visible Confusion\",16272,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1603\\\"\\u003eCodeforces Round 752 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1615B\":[\"And It\\u0027s Non-Zero\",15899,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1615\\\"\\u003eCodeforces Global Round 18\\u003c/a\\u003e\"],\"CodeForces-1005C\":[\"Summarize to the Power of Two\",12067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1005\\\"\\u003eCodeforces Round 496 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1627B\":[\"Not Sitting\",16443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1627\\\"\\u003eCodeforces Round 766 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1857D\":[\"Strong Vertices\",17787,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1857\\\"\\u003eCodeforces Round 891 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1194B\":[\"Yet Another Crosses Problem\",10812,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1194\\\"\\u003eEducational Codeforces Round 68 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-459B\":[\"Pashmak and Flowers\",40192,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/459\\\"\\u003eCodeforces Round 261 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-707B\":[\"Bakery\",14109,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/707\\\"\\u003eCodeforces Round 368 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1574C\":[\"Slay the Dragon\",17069,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1574\\\"\\u003eEducational Codeforces Round 114 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-912B\":[\"New Year\\u0027s Eve\",11803,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/912\\\"\\u003eCodeforces Round 456 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1291B\":[\"Array Sharpening\",14602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1291\\\"\\u003eCodeforces Round 616 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-900B\":[\"Position in Fraction\",8463,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/900\\\"\\u003eCodeforces Round 450 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1182B\":[\"Plus from Picture\",11779,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1182\\\"\\u003eCodeforces Round 566 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1194C\":[\"From S To T\",13336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1194\\\"\\u003eEducational Codeforces Round 68 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-798B\":[\"Mike and strings\",9239,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/798\\\"\\u003eCodeforces Round 410 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-665C\":[\"Simple Strings\",10037,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/665\\\"\\u003eEducational Codeforces Round 12\\u003c/a\\u003e\"],\"CodeForces-750B\":[\"New Year and North Pole\",10214,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/750\\\"\\u003eGood Bye 2016\\u003c/a\\u003e\"],\"CodeForces-1711B\":[\"Party\",13201,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1711\\\"\\u003eCodeforces Round 810 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1844C\":[\"Particles\",14939,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1844\\\"\\u003eCodeforces Round 884 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1016B\":[\"Segment Occurrences\",9898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1016\\\"\\u003eEducational Codeforces Round 48 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1638C\":[\"Inversion Graph\",14617,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1638\\\"\\u003eCodeforces Round 771 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1004B\":[\"Sonya and Exhibition\",9911,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1004\\\"\\u003eCodeforces Round 495 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1868A\":[\"Fill in the Matrix\",11150,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1868\\\"\\u003eCodeforces Round 896 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1561C\":[\"Deep Down Below\",13925,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1561\\\"\\u003eCodeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine))\\u003c/a\\u003e\"],\"CodeForces-1101B\":[\"Accordion\",11053,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1101\\\"\\u003eEducational Codeforces Round 58 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-25A\":[\"IQ test\",86893,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/25\\\"\\u003eCodeforces Beta Round 25 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1113B\":[\"Sasha and Magnetic Machines\",8201,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1113\\\"\\u003eCodeforces Round 539 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1367C\":[\"Social Distance\",23600,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1367\\\"\\u003eCodeforces Round 650 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1476B\":[\"Inflation\",19957,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1476\\\"\\u003eEducational Codeforces Round 103 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1096B\":[\"Substring Removal\",10846,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1096\\\"\\u003eEducational Codeforces Round 57 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1585C\":[\"Minimize Distance\",11612,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1585\\\"\\u003eTechnocup 2022 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-567B\":[\"Berland National Library\",9115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/567\\\"\\u003eCodeforces Round #Pi (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-761B\":[\"Dasha and friends\",7280,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/761\\\"\\u003eCodeforces Round 394 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-870C\":[\"Maximum splitting\",9455,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/870\\\"\\u003eTechnocup 2018 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-271B\":[\"Prime Matrix\",14514,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/271\\\"\\u003eCodeforces Round 166 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1407B\":[\"Big Vova\",17843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1407\\\"\\u003eCodeforces Round 669 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1879C\":[\"Make it Alternating\",15380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1879\\\"\\u003eEducational Codeforces Round 155 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1649B\":[\"Game of Ball Passing\",12949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1649\\\"\\u003eCodeforces Round 775 (Div. 2, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"CodeForces-1746C\":[\"Permutation Operations\",12541,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1746\\\"\\u003eCodeforces Global Round 23\\u003c/a\\u003e\"],\"CodeForces-1867C\":[\"Salyg1n and the MEX Game\",10568,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1867\\\"\\u003eCodeforces Round 897 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1601A\":[\"Array Elimination\",13396,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1601\\\"\\u003eCodeforces Round 751 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-312B\":[\"Archer\",12386,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/312\\\"\\u003eCodeforces Round 185 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1100B\":[\"Build a Contest\",11850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1100\\\"\\u003eCodeforces Round 532 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-58B\":[\"Coins\",13017,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/58\\\"\\u003eCodeforces Beta Round 54 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1003B\":[\"Binary String Constructing\",12014,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1003\\\"\\u003eCodeforces Round 494 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1003C\":[\"Intense Heat\",11344,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1003\\\"\\u003eCodeforces Round 494 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1560D\":[\"Make a Power of Two\",17921,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1560\\\"\\u003eCodeforces Round 739 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1366B\":[\"Shuffle\",20137,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1366\\\"\\u003eEducational Codeforces Round 89 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1693A\":[\"Directional Increase\",15739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1693\\\"\\u003eCodeforces Round 800 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-922A\":[\"Cloning Toys\",12300,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-946C\":[\"String Transformation\",9433,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/946\\\"\\u003eEducational Codeforces Round 39 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-469B\":[\"Chat Online\",12764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/469\\\"\\u003eCodeforces Round 268 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-922B\":[\"Magic Forest\",9242,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-796B\":[\"Find The Bone\",10192,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/796\\\"\\u003eCodeforces Round 408 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-893C\":[\"Rumor\",24426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1612C\":[\"Chat Ban\",16781,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1612\\\"\\u003eEducational Codeforces Round 117 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1733C\":[\"Parity Shuffle Sorting\",15698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1733\\\"\\u003eCodeforces Round 821 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1418B\":[\"Negative Prefixes\",16525,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1418\\\"\\u003eEducational Codeforces Round 95 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-185A\":[\"Plant\",7152,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/185\\\"\\u003eCodeforces Round 118 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1038C\":[\"Gambling\",9687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1038\\\"\\u003eCodeforces Round 508 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1159B\":[\"Expansion coefficient of the array\",7716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1159\\\"\\u003eCodeforces Round 559 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1220B\":[\"Multiplication Table\",11917,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1220\\\"\\u003eCodeforces Round 586 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-347A\":[\"Difference Row\",10831,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/347\\\"\\u003eCodeforces Round 201 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1498B\":[\"Box Fitting\",16588,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1498\\\"\\u003eCodeCraft-21 and Codeforces Round 711 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1365B\":[\"Trouble Sort\",26662,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1365\\\"\\u003eCodeforces Round 648 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-716B\":[\"Complete the Word\",13211,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/716\\\"\\u003eCodeforces Round 372 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1341B\":[\"Nastya and Door\",19390,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1341\\\"\\u003eCodeforces Round 637 (Div. 2) - Thanks, Ivan Belonogov!\\u003c/a\\u003e\"],\"CodeForces-1220C\":[\"Substring Game in the Lesson\",9987,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1220\\\"\\u003eCodeforces Round 586 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1692F\":[\"3SUM\",21802,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1692\\\"\\u003eCodeforces Round 799 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-96B\":[\"Lucky Numbers (easy)\",17244,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/96\\\"\\u003eCodeforces Beta Round 77 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1203C\":[\"Common Divisors\",21467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1203\\\"\\u003eCodeforces Round 579 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1922C\":[\"Closest Cities\",17035,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1922\\\"\\u003eEducational Codeforces Round 161 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1607D\":[\"Blue-Red Permutation\",16638,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1607\\\"\\u003eCodeforces Round 753 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1881D\":[\"Divide and Equalize\",14495,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1881\\\"\\u003eCodeforces Round 903 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-808B\":[\"Average Sleep Time\",7230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"CodeForces-1271B\":[\"Blocks\",11594,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1271\\\"\\u003eCodeforces Round 608 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1675D\":[\"Vertical Paths\",12902,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1675\\\"\\u003eCodeforces Round 787 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1174C\":[\"Ehab and a Special Coloring Problem\",12479,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1174\\\"\\u003eCodeforces Round 563 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1433E\":[\"Two Round Dances\",18785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1433\\\"\\u003eCodeforces Round 677 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-318B\":[\"Strings of Power\",8335,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/318\\\"\\u003eCodeforces Round 188 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1065B\":[\"Vasya and Isolated Vertices\",11196,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1065\\\"\\u003eEducational Codeforces Round 52 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1077C\":[\"Good Array\",16578,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1077\\\"\\u003eCodeforces Round 521 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-899C\":[\"Dividing the numbers\",9022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1271C\":[\"Shawarma Tent\",10638,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1271\\\"\\u003eCodeforces Round 608 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-633B\":[\"A Trivial Problem\",7310,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/633\\\"\\u003eManthan, Codefest 16\\u003c/a\\u003e\"],\"CodeForces-621B\":[\"Wet Shark and Bishops\",11716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/621\\\"\\u003eCodeforces Round 341 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-996B\":[\"World Cup\",9702,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/996\\\"\\u003eCodeforces Round 492 (Div. 2) [Thanks, uDebug!]\\u003c/a\\u003e\"],\"CodeForces-1717C\":[\"Madoka and Formal Statement\",14475,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1717\\\"\\u003eCodeforces Round 818 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-471B\":[\"MUH and Important Things\",6229,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/471\\\"\\u003eCodeforces Round 269 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1698C\":[\"3SUM Closure\",17994,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1698\\\"\\u003eCodeforces Round 803 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1703F\":[\"Yet Another Problem About Pairs Satisfying an Inequality\",18720,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1703\\\"\\u003eCodeforces Round 806 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1945D\":[\"Seraphim the Owl\",11965,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1945\\\"\\u003eCodeforces Round 935 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1618D\":[\"Array and Operations\",18582,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1618\\\"\\u003eCodeforces Round 760 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-276B\":[\"Little Girl and Game\",28290,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/276\\\"\\u003eCodeforces Round 169 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1238B\":[\"Kill `Em All\",14416,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1238\\\"\\u003eEducational Codeforces Round 74 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-288A\":[\"Polo the Penguin and Strings\",6631,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/288\\\"\\u003eCodeforces Round 177 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1650D\":[\"Twist the Permutation\",13843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1650\\\"\\u003eCodeforces Round 776 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1294C\":[\"Product of Three Numbers\",33855,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1294\\\"\\u003eCodeforces Round 615 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1335D\":[\"Anti-Sudoku\",27230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1335\\\"\\u003eCodeforces Round 634 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1040B\":[\"Shashlik Cooking\",7480,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1040\\\"\\u003eCodeforces Round 507 (Div. 2, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-1311C\":[\"Perform the Combo\",16126,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1311\\\"\\u003eCodeforces Round 624 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1553B\":[\"Reverse String\",15217,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1553\\\"\\u003eHarbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1076C\":[\"Meme Problem\",12917,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1076\\\"\\u003eEducational Codeforces Round 54 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-777B\":[\"Game of Credit Cards\",10210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-4C\":[\"Registration System\",90119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/4\\\"\\u003eCodeforces Beta Round 4 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-862B\":[\"Mahmoud and Ehab and the bipartiteness\",17421,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/862\\\"\\u003eCodeforces Round 435 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1007A\":[\"Reorder the Array\",12447,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1007\\\"\\u003eCodeforces Round 497 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1322A\":[\"Unusual Competitions\",12395,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1322\\\"\\u003eCodeforces Round 626 (Div. 1, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"CodeForces-251A\":[\"Points on Line\",17867,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/251\\\"\\u003eCodeforces Round 153 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1617C\":[\"Paprika and Permutation\",14590,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1617\\\"\\u003eCodeforces Round 761 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1823C\":[\"Strongly Composite\",11826,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1823\\\"\\u003eCodeforces Round 868 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1237B\":[\"Balanced Tunnel\",15398,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1237\\\"\\u003eCodeforces Global Round 5\\u003c/a\\u003e\"],\"CodeForces-1726C\":[\"Jatayu\\u0027s Balanced Bracket Sequence\",12107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1726\\\"\\u003eCodeforces Round 819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022\\u003c/a\\u003e\"],\"CodeForces-1443B\":[\"Saving the City\",15969,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1443\\\"\\u003eCodeforces Round 681 (Div. 2, based on VK Cup 2019-2020 - Final)\\u003c/a\\u003e\"],\"CodeForces-1794C\":[\"Scoring Subsequences\",12641,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1794\\\"\\u003eCodeforces Round 856 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-437A\":[\"The Child and Homework\",9610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/437\\\"\\u003eCodeforces Round 250 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1063A\":[\"Oh Those Palindromes\",10578,\"\\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-915B\":[\"Browser\",8306,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1661B\":[\"Getting Zero\",17520,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1661\\\"\\u003eEducational Codeforces Round 126 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-558B\":[\"Amr and The Large Array\",8311,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/558\\\"\\u003eCodeforces Round 312 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-897B\":[\"Chtholly\\u0027s request\",7713,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/897\\\"\\u003eCodeforces Round 449 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-982B\":[\"Bus of Characters\",8931,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/982\\\"\\u003eCodeforces Round 484 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-740A\":[\"Alyona and copybooks\",9699,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/740\\\"\\u003eCodeforces Round 381 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-493A\":[\"Vasya and Football\",6347,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/493\\\"\\u003eCodeforces Round 281 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1931D\":[\"Divisible Pairs\",15786,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1931\\\"\\u003eCodeforces Round 925 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-371B\":[\"Fox Dividing Cheese\",11873,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/371\\\"\\u003eCodeforces Round 218 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-83A\":[\"Magical Array\",6531,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/83\\\"\\u003eCodeforces Beta Round 72 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1810C\":[\"Make It Permutation\",13883,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1810\\\"\\u003eCodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1236C\":[\"Labs\",10153,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1236\\\"\\u003eCodeforces Round 593 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1955C\":[\"Inhabitant of the Deep Sea\",16882,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1955\\\"\\u003eCodeforces Round 938 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1943A\":[\"MEX Game 1\",15039,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1943\\\"\\u003eCodeforces Round 934 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1737B\":[\"Ela\\u0027s Fitness and the Luxury Number\",9268,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1737\\\"\\u003eDytechlab Cup 2022\\u003c/a\\u003e\"],\"CodeForces-298A\":[\"Snow Footprints\",11050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/298\\\"\\u003eCodeforces Round 180 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-189A\":[\"Cut Ribbon\",67727,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/189\\\"\\u003eCodeforces Round 119 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1660C\":[\"Get an Even String\",19118,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1660\\\"\\u003eCodeforces Round 780 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-303A\":[\"Lucky Permutation Triple\",8081,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/303\\\"\\u003eCodeforces Round 183 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1466C\":[\"Canine poetry\",17666,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1466\\\"\\u003eGood Bye 2020\\u003c/a\\u003e\"],\"CodeForces-1062A\":[\"A Prank\",9430,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1062\\\"\\u003eCodeforces Round 520 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1454D\":[\"Number into Sequence\",21080,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1454\\\"\\u003eCodeforces Round 686 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-545D\":[\"Queue\",26576,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/545\\\"\\u003eCodeforces Round 303 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-630F\":[\"Selection of Personnel\",7171,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-192A\":[\"Funky Numbers\",11959,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/192\\\"\\u003eCodeforces Round 121 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1401C\":[\"Mere Array\",23904,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1401\\\"\\u003eCodeforces Round 665 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1534C\":[\"Little Alawn\\u0027s Puzzle\",12735,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1534\\\"\\u003eCodeforces LATOKEN Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1788C\":[\"Matching Numbers\",16576,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1788\\\"\\u003eCodeforces Round 851 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-330B\":[\"Road Construction\",17379,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/330\\\"\\u003eCodeforces Round 192 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-451B\":[\"Sort the Array\",44945,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/451\\\"\\u003eCodeforces Round 258 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1328B\":[\"K-th Beautiful String\",29441,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1328\\\"\\u003eCodeforces Round 629 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1667A\":[\"Make it Increasing\",14399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1667\\\"\\u003eCodeforces Round 783 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1829F\":[\"Forever Winter\",16474,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1829\\\"\\u003eCodeforces Round 871 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1902C\":[\"Insert and Equalize\",12654,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1902\\\"\\u003eEducational Codeforces Round 159 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1558A\":[\"Charmed by the Game\",10956,\"\\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-1926D\":[\"Vlad and Division\",13464,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1926\\\"\\u003eCodeforces Round 928 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-257B\":[\"Playing Cubes\",7434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/257\\\"\\u003eCodeforces Round 159 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1178C\":[\"Tiles\",12098,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1178\\\"\\u003eCodeforces Global Round 4\\u003c/a\\u003e\"],\"CodeForces-1372B\":[\"Omkar and Last Class of Math\",26857,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1372\\\"\\u003eCodeforces Round 655 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1493B\":[\"Planet Lapituletti\",12166,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1493\\\"\\u003eCodeforces Round 705 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-909B\":[\"Segments\",6557,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1178B\":[\"WOW Factor\",14635,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1178\\\"\\u003eCodeforces Global Round 4\\u003c/a\\u003e\"],\"CodeForces-1776H\":[\"Beppa and SwerChat\",6523,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1776\\\"\\u003eSWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1873F\":[\"Money Trees\",13941,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1873\\\"\\u003eCodeforces Round 898 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-976B\":[\"Lara Croft and the New Game\",6122,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/976\\\"\\u003eEducational Codeforces Round 43 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-625C\":[\"K-special Tables\",7065,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/625\\\"\\u003eCodeforces Round 342 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-722A\":[\"Broken Clock\",7021,\"\\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-1360D\":[\"Buying Shovels\",31977,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1360\\\"\\u003eCodeforces Round 644 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1360E\":[\"Polygon\",25039,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1360\\\"\\u003eCodeforces Round 644 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1927D\":[\"Find the Different Ones!\",18153,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1927\\\"\\u003eCodeforces Round 923 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-572B\":[\"Order Book\",8465,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/572\\\"\\u003eCodeforces Round 317 [AimFund Thanks-Round] (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-681B\":[\"Economy Game\",9678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/681\\\"\\u003eCodeforces Round 357 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1315B\":[\"Homecoming\",9298,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1315\\\"\\u003eCodeforces Round 623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine)\\u003c/a\\u003e\"],\"CodeForces-1775B\":[\"Gardener and the Array\",12547,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1775\\\"\\u003eCodeforces Round 843 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1521B\":[\"Nastia and a Good Array\",21063,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1521\\\"\\u003eCodeforces Round 720 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-450B\":[\"Jzzhu and Sequences\",27919,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/450\\\"\\u003eCodeforces Round 257 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-462B\":[\"Appleman and Card Game\",14767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/462\\\"\\u003eCodeforces Round 263 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-220A\":[\"Little Elephant and Problem\",12527,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/220\\\"\\u003eCodeforces Round 136 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1913C\":[\"Game with Multiset\",13724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1913\\\"\\u003eEducational Codeforces Round 160 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-135A\":[\"Replacement\",7682,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/135\\\"\\u003eCodeforces Beta Round 97 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1371C\":[\"A Cookie for You\",20582,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1371\\\"\\u003eCodeforces Round 654 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1165C\":[\"Good String\",13595,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1165\\\"\\u003eCodeforces Round 560 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-515B\":[\"Drazil and His Happy Friends\",8181,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/515\\\"\\u003eCodeforces Round 292 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-612A\":[\"The Text Splitting\",7686,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/612\\\"\\u003eEducational Codeforces Round 4\\u003c/a\\u003e\"],\"CodeForces-600B\":[\"Queries about less or equal elements\",32677,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/600\\\"\\u003eEducational Codeforces Round 2\\u003c/a\\u003e\"],\"CodeForces-486B\":[\"OR in Matrix\",17542,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/486\\\"\\u003eCodeforces Round 277 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1108C\":[\"Nice Garland\",12349,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1108\\\"\\u003eCodeforces Round 535 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1556B\":[\"Take Your Places!\",12512,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1556\\\"\\u003eDeltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1786B\":[\"Cake Assembly Line\",8721,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1786\\\"\\u003eCodeforces Round 850 (Div. 2, based on VK Cup 2022 - Final Round)\\u003c/a\\u003e\"],\"CodeForces-1217A\":[\"Creating a Character\",15382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1217\\\"\\u003eEducational Codeforces Round 72 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1326C\":[\"Permutation Partitions\",15451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1326\\\"\\u003eCodeforces Global Round 7\\u003c/a\\u003e\"],\"CodeForces-1900C\":[\"Anji\\u0027s Binary Tree\",10678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1900\\\"\\u003eCodeforces Round 911 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-352B\":[\"Jeff and Periods\",16042,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/352\\\"\\u003eCodeforces Round 204 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-158D\":[\"Ice Sculptures\",6418,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/158\\\"\\u003eVK Cup 2012 Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-376B\":[\"I.O.U.\",6475,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/376\\\"\\u003eCodeforces Round 221 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1459B\":[\"Move and Turn\",14487,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1459\\\"\\u003eCodeforces Round 691 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-919C\":[\"Seat Arrangements\",9354,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/919\\\"\\u003eCodeforces Round 460 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1152B\":[\"Neko Performs Cat Furrier Transform\",9200,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1152\\\"\\u003eCodeforces Round 554 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1774C\":[\"Ice and Fire\",11670,\"\\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-1176C\":[\"Lose it!\",14781,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1176\\\"\\u003eCodeforces Round 565 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1285B\":[\"Just Eat It!\",21869,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1285\\\"\\u003eCodeforces Round 613 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-659B\":[\"Qualifying Contest\",6850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/659\\\"\\u003eCodeforces Round 346 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-611B\":[\"New Year and Old Property\",10855,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/611\\\"\\u003eGood Bye 2015\\u003c/a\\u003e\"],\"CodeForces-962A\":[\"Equator\",13140,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/962\\\"\\u003eEducational Codeforces Round 42 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-962B\":[\"Students in Railway Carriage\",8048,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/962\\\"\\u003eEducational Codeforces Round 42 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-485B\":[\"Valuable Resources\",6990,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/485\\\"\\u003eCodeforces Round 276 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1937B\":[\"Binary Path\",12995,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1937\\\"\\u003eCodeforces Round 930 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-570B\":[\"Simple Game\",17306,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/570\\\"\\u003eCodeforces Round 316 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1446A\":[\"Knapsack\",15148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1446\\\"\\u003eCodeforces Round 683 (Div. 1, by Meet IT)\\u003c/a\\u003e\"],\"CodeForces-1119B\":[\"Alyona and a Narrow Fridge\",10282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1119\\\"\\u003eCodeforces Global Round 2\\u003c/a\\u003e\"],\"CodeForces-1555C\":[\"Coin Rows\",21402,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1555\\\"\\u003eEducational Codeforces Round 112 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1422B\":[\"Nice Matrix\",14519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1422\\\"\\u003eCodeforces Round 675 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1555B\":[\"Two Tables\",15890,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1555\\\"\\u003eEducational Codeforces Round 112 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-230B\":[\"T-primes\",77245,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/230\\\"\\u003eCodeforces Round 142 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1216D\":[\"Swords\",11574,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1216\\\"\\u003eCodeforces Round 587 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1826C\":[\"Dreaming of Freedom\",12862,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1826\\\"\\u003eCodeforces Round 870 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1107C\":[\"Brutality\",10415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1107\\\"\\u003eEducational Codeforces Round 59 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1187B\":[\"Letters Shop\",12394,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1187\\\"\\u003eEducational Codeforces Round 67 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1260B\":[\"Obtain Two Zeroes\",15894,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1260\\\"\\u003eEducational Codeforces Round 77 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1030C\":[\"Vasya and Golden Ticket\",9779,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1030\\\"\\u003eTechnocup 2019 - Elimination Round 1\\u003c/a\\u003e\"],\"CodeForces-1870C\":[\"Colorful Table\",10856,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1870\\\"\\u003eCodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-416B\":[\"Art Union\",8888,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/416\\\"\\u003eCodeforces Round 241 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1676G\":[\"White-Black Balanced Subtrees\",14754,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1676\\\"\\u003eCodeforces Round 790 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1676F\":[\"Longest Strike\",16121,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1676\\\"\\u003eCodeforces Round 790 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-1882B\":[\"Sets and Union\",14282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1882\\\"\\u003eCodeforces Round 899 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-429A\":[\"Xor-tree\",10992,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/429\\\"\\u003eCodeforces Round 245 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-876B\":[\"Divisiblity of Differences\",9534,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/876\\\"\\u003eCodeforces Round 441 (Div. 2, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-840A\":[\"Leha and Function\",7116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/840\\\"\\u003eCodeforces Round 429 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-610B\":[\"Vika and Squares\",7927,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/610\\\"\\u003eCodeforces Round 337 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-755C\":[\"PolandBall and Forest\",12864,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/755\\\"\\u003e8VC Venture Cup 2017 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-1815A\":[\"Ian and Array Sorting\",13469,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1815\\\"\\u003eCodeforces Round 865 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1839C\":[\"Insert Zero and Invert Prefix\",11445,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1839\\\"\\u003eCodeforces Round 876 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1948C\":[\"Arrow Path\",14397,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1948\\\"\\u003eEducational Codeforces Round 163 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-472B\":[\"Design Tutorial: Learn from Life\",7671,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/472\\\"\\u003eCodeforces Round 270\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1713879710000,"title":"CodeForces rating 1300 题目集","dislikeCnt":0,"content":"[problem:CodeForces-25A] IQ test暴力枚举(brute force)\n[problem:CodeForces-4C] Registration System数据结构(data structures),哈希表(hashing),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-230B] T-primes二分搜索(binary search),实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-189A] Cut Ribbon暴力枚举(brute force),动态规划(dp)\n[problem:CodeForces-451B] Sort the Array实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-459B] Pashmak and Flowers组合数学(combinatorics),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-478B] Random Teams组合数学(combinatorics),构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-1294C] Product of Three Numbers贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1360D] Buying Shovels数学(math),数论(number theory)\n[problem:CodeForces-476B] Dreamoon and WiFi位掩码(bitmasks),暴力枚举(brute force),组合数学(combinatorics),动态规划(dp),数学(math),概率论(probabilities)\n[problem:CodeForces-1328B] K-th Beautiful String二分搜索(binary search),暴力枚举(brute force),组合数学(combinatorics),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-600B] Queries about less or equal elements二分搜索(binary search),数据结构(data structures),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-276B] Little Girl and Game博弈论(games),贪心策略(greedy)\n[problem:CodeForces-1538C] Number of Pairs二分搜索(binary search),数据结构(data structures),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1335D] Anti-Sudoku构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1372B] Omkar and Last Class of Math贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1365B] Trouble Sort构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-450B] Jzzhu and Sequences实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1352D] Alice,Bob and Candies实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1360E] Polygon动态规划(dp),图论(graphs),实现问题,编程技巧,模拟(implementation),最短路算法(shortest paths)\n[problem:CodeForces-545D] Queue贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1401C] Mere Array构造算法(constructive algorithms),数学(math),数论(number theory),排序算法(sortings)\n[problem:CodeForces-1367C] Social Distance构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-508B] Anton and currency you all know贪心策略(greedy),数学(math),字符串处理(strings)\n[problem:CodeForces-893C] Rumor深度优先搜索及其变种(dfs and similar),图论(graphs),贪心策略(greedy)\n[problem:CodeForces-1470A] Strange Birthday Party二分搜索(binary search),动态规划(dp),贪心策略(greedy),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1692F] 3SUM暴力枚举(brute force),数学(math)\n[problem:CodeForces-1285B] Just Eat It!动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1555C] Coin Rows暴力枚举(brute force),构造算法(constructive algorithms),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1521B] Nastia and a Good Array构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-1371C] A Cookie for You贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1454D] Number into Sequence构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-1366B] Shuffle数学(math),双指针算法(two pointers)\n[problem:CodeForces-1203C] Common Divisors实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1476B] Inflation二分搜索(binary search),暴力枚举(brute force),贪心策略(greedy),数学(math)\n[problem:CodeForces-519C] A and B and Team Training贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-1341B] Nastya and Door贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1660C] Get an Even String动态规划(dp),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1364B] Most socially-distanced subsequence贪心策略(greedy),双指针算法(two pointers)\n[problem:CodeForces-1037C] Equalize动态规划(dp),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1618D] Array and Operations动态规划(dp),贪心策略(greedy),数学(math)\n[problem:CodeForces-1915E] Romantic Glasses数据结构(data structures),贪心策略(greedy),数学(math)\n[problem:CodeForces-1703F] Yet Another Problem About Pairs Satisfying an Inequality二分搜索(binary search),数据结构(data structures),动态规划(dp),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1433E] Two Round Dances组合数学(combinatorics),数学(math)\n[problem:CodeForces-1927D] Find the Different Ones!二分搜索(binary search),暴力枚举(brute force),数据结构(data structures),动态规划(dp),并查集(dsu),贪心策略(greedy),双指针算法(two pointers)\n[problem:CodeForces-1373C] Pluses and Minuses数学(math)\n[problem:CodeForces-1698C] 3SUM Closure暴力枚举(brute force),数据结构(data structures)\n[problem:CodeForces-1560D] Make a Power of Two贪心策略(greedy),数学(math),字符串处理(strings)\n[problem:CodeForces-1857D] Strong Vertices数学(math),排序算法(sortings),树形结构(trees)\n[problem:CodeForces-1466C] Canine poetry动态规划(dp),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-617B] Chocolate组合数学(combinatorics)\n[problem:CodeForces-1850F] We Were Both Children暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-1661B] Getting Zero位掩码(bitmasks),暴力枚举(brute force),深度优先搜索及其变种(dfs and similar),动态规划(dp),图论(graphs),贪心策略(greedy),最短路算法(shortest paths)\n[problem:CodeForces-486B] OR in Matrix贪心策略(greedy),哈希表(hashing),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1922C] Closest Cities贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1407B] Big Vova暴力枚举(brute force),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-251A] Points on Line二分搜索(binary search),组合数学(combinatorics),双指针算法(two pointers)\n[problem:CodeForces-1574C] Slay the Dragon二分搜索(binary search),贪心策略(greedy),排序算法(sortings),三分搜索(ternary search)\n[problem:CodeForces-1788C] Matching Numbers构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-1607D] Blue-Red Permutation贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-330B] Road Construction构造算法(constructive algorithms),图论(graphs)\n[problem:CodeForces-573A] Bear and Poker实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-1418B] Negative Prefixes贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1627B] Not Sitting博弈论(games),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1603A] Di-visible Confusion构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-1955C] Inhabitant of the Deep Sea贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1829F] Forever Winter深度优先搜索及其变种(dfs and similar),图论(graphs),数学(math)\n[problem:CodeForces-1498B] Box Fitting二分搜索(binary search),位掩码(bitmasks),数据结构(data structures),贪心策略(greedy)\n[problem:CodeForces-1669H] Maximal AND位掩码(bitmasks),贪心策略(greedy),数学(math)\n[problem:CodeForces-1547D] Co-growing Sequence位掩码(bitmasks),构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1862D] Ice Cream Balls二分搜索(binary search),组合数学(combinatorics),构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-862B] Mahmoud and Ehab and the bipartiteness深度优先搜索及其变种(dfs and similar),图论(graphs),树形结构(trees)\n[problem:CodeForces-352B] Jeff and Periods实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-570B] Simple Game构造算法(constructive algorithms),博弈论(games),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1676F] Longest Strike数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1612C] Chat Ban二分搜索(binary search),数学(math)\n[problem:CodeForces-1693A] Directional Increase贪心策略(greedy)\n[problem:CodeForces-1555B] Two Tables暴力枚举(brute force)\n[problem:CodeForces-1931D] Divisible Pairs组合数学(combinatorics),数学(math),数论(number theory)\n[problem:CodeForces-1311C] Perform the Combo暴力枚举(brute force)\n[problem:CodeForces-1443B] Saving the City动态规划(dp),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1326C] Permutation Partitions组合数学(combinatorics),贪心策略(greedy),数学(math)\n[problem:CodeForces-1077C] Good Array\n[problem:CodeForces-1615B] And It\u0027s Non-Zero位掩码(bitmasks),贪心策略(greedy),数学(math)\n[problem:CodeForces-1260B] Obtain Two Zeroes二分搜索(binary search),数学(math)\n[problem:CodeForces-1733C] Parity Shuffle Sorting构造算法(constructive algorithms),排序算法(sortings)\n[problem:CodeForces-1446A] Knapsack构造算法(constructive algorithms),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1879C] Make it Alternating组合数学(combinatorics),动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1844C] Particles动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1943A] MEX Game 1博弈论(games),贪心策略(greedy)\n[problem:CodeForces-1217A] Creating a Character二分搜索(binary search),数学(math)\n[problem:CodeForces-1237B] Balanced Tunnel数据结构(data structures),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1617C] Paprika and Permutation二分搜索(binary search),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1741D] Masha and a Beautiful Tree深度优先搜索及其变种(dfs and similar),分治算法(divide and conquer),图论(graphs),排序算法(sortings),树形结构(trees)\n[problem:CodeForces-1157B] Long Number贪心策略(greedy)\n[problem:CodeForces-96B] Lucky Numbers 二分搜索(binary search),位掩码(bitmasks),暴力枚举(brute force)\n[problem:CodeForces-1638C] Inversion Graph数据结构(data structures),并查集(dsu),图论(graphs),数学(math)\n[problem:CodeForces-1667A] Make it Increasing暴力枚举(brute force),贪心策略(greedy),数学(math)\n[problem:CodeForces-1851D] Prefix Permutation Sums实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1717C] Madoka and Formal Statement贪心策略(greedy)\n[problem:CodeForces-1881D] Divide and Equalize数学(math),数论(number theory)\n[problem:CodeForces-1882B] Sets and Union位掩码(bitmasks),暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1422B] Nice Matrix贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1676G] White-Black Balanced Subtrees深度优先搜索及其变种(dfs and similar),动态规划(dp),图论(graphs),树形结构(trees)\n[problem:CodeForces-462B] Appleman and Card Game贪心策略(greedy)\n[problem:CodeForces-1948C] Arrow Path暴力枚举(brute force),构造算法(constructive algorithms),深度优先搜索及其变种(dfs and similar),动态规划(dp),图论(graphs),最短路算法(shortest paths)\n[problem:CodeForces-1459B] Move and Turn动态规划(dp),数学(math)\n[problem:CodeForces-1176C] Lose it!动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-588B] Duff in Love数学(math)\n[problem:CodeForces-1291B] Array Sharpening贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1553B] Reverse String暴力枚举(brute force),动态规划(dp),哈希表(hashing),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1178B] WOW Factor动态规划(dp),字符串处理(strings)\n[problem:CodeForces-1899E] Queue Sort贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1810C] Make It Permutation暴力枚举(brute force),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1873F] Money Trees二分搜索(binary search),贪心策略(greedy),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1821C] Tear It Apart暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math),字符串处理(strings)\n[problem:CodeForces-1768C] Elemental Decompress构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1913C] Game with Multiset二分搜索(binary search),位掩码(bitmasks),暴力枚举(brute force),贪心策略(greedy)\n[problem:CodeForces-1561C] Deep Down Below二分搜索(binary search),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-236B] Easy Number Challenge实现问题,编程技巧,模拟(implementation),数论(number theory)\n[problem:CodeForces-1815A] Ian and Array Sorting贪心策略(greedy),数学(math)\n[problem:CodeForces-1279B] Verse For Santa二分搜索(binary search),暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1926D] Vlad and Division位掩码(bitmasks),贪心策略(greedy)\n[problem:CodeForces-1601A] Array Elimination位掩码(bitmasks),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1711B] Party暴力枚举(brute force),图论(graphs)\n[problem:CodeForces-1238B] Kill `Em All贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1766C] Hamiltonian Wall动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1307B] Cow and Friend计算几何(geometry),贪心策略(greedy),数学(math)\n[problem:CodeForces-1778B] The Forbidden Permutation贪心策略(greedy),数学(math)\n[problem:CodeForces-1937B] Binary Path动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1194C] From S To T实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1649B] Game of Ball Passing贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-707B] Bakery图论(graphs)\n[problem:CodeForces-1826C] Dreaming of Freedom贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1650D] Twist the Permutation暴力枚举(brute force),构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1165C] Good String贪心策略(greedy)\n[problem:CodeForces-1864C] Divisor Chain位掩码(bitmasks),构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-962A] Equator实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1675D] Vertical Paths图论(graphs),实现问题,编程技巧,模拟(implementation),树形结构(trees)\n[problem:CodeForces-1534C] Little Alawn\u0027s Puzzle组合数学(combinatorics),动态规划(dp),并查集(dsu),图论(graphs),数学(math)\n[problem:CodeForces-1556B] Take Your Places!实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1775B] Gardener and the Array位掩码(bitmasks),构造算法(constructive algorithms)\n[problem:CodeForces-1794C] Scoring Subsequences二分搜索(binary search),贪心策略(greedy),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1647C] Madoka and Childish Pranks构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-271B] Prime Matrix二分搜索(binary search),暴力枚举(brute force),数学(math),数论(number theory)\n[problem:CodeForces-1746C] Permutation Operations构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-469B] Chat Online实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1265B] Beautiful Numbers数据结构(data structures),实现问题,编程技巧,模拟(implementation),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1322A] Unusual Competitions贪心策略(greedy)\n[problem:CodeForces-1902C] Insert and Equalize暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1899D] Yarik and Musical Notes哈希表(hashing),数学(math),数论(number theory)\n[problem:CodeForces-1076C] Meme Problem二分搜索(binary search),数学(math)\n[problem:CodeForces-1819A] Constructive Problem暴力枚举(brute force),贪心策略(greedy)\n[problem:CodeForces-1029A] Many Equal Substrings实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1007A] Reorder the Array组合数学(combinatorics),数据结构(data structures),数学(math),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1889A] Qingshan Loves Strings 2构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1187B] Letters Shop二分搜索(binary search),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1726C] Jatayu\u0027s Balanced Bracket Sequence数据结构(data structures),并查集(dsu),图论(graphs),贪心策略(greedy)\n[problem:CodeForces-58B] Coins贪心策略(greedy)\n[problem:CodeForces-220A] Little Elephant and Problem实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-716B] Complete the Word贪心策略(greedy),双指针算法(two pointers)\n[problem:CodeForces-1174C] Ehab and a Special Coloring Problem构造算法(constructive algorithms),数论(number theory)\n[problem:CodeForces-1807E] Interview二分搜索(binary search),实现问题,编程技巧,模拟(implementation),交互性问题(interactive)\n[problem:CodeForces-1108C] Nice Garland暴力枚举(brute force),贪心策略(greedy),数学(math)\n[problem:CodeForces-1823C] Strongly Composite贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1945D] Seraphim the Owl动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1493B] Planet Lapituletti暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1774C] Ice and Fire构造算法(constructive algorithms),动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1585C] Minimize Distance贪心策略(greedy)\n[problem:CodeForces-755C] PolandBall and Forest深度优先搜索及其变种(dfs and similar),并查集(dsu),图论(graphs),交互性问题(interactive),树形结构(trees)\n[problem:CodeForces-1220B] Multiplication Table数学(math),数论(number theory)\n[problem:CodeForces-1839C] Insert Zero and Invert Prefix构造算法(constructive algorithms)\n[problem:CodeForces-912B] New Year\u0027s Eve位掩码(bitmasks),构造算法(constructive algorithms),数论(number theory)\n[problem:CodeForces-1005C] Summarize to the Power of Two暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1178C] Tiles组合数学(combinatorics),贪心策略(greedy),数学(math)\n[problem:CodeForces-922A] Cloning Toys实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1868A] Fill in the Matrix构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1271B] Blocks贪心策略(greedy),数学(math)\n[problem:CodeForces-312B] Archer数学(math),概率论(probabilities)\n[problem:CodeForces-1003B] Binary String Constructing构造算法(constructive algorithms)\n[problem:CodeForces-1558A] Charmed by the Game暴力枚举(brute force),数学(math)\n[problem:CodeForces-246B] Increase and Decrease贪心策略(greedy),数学(math)\n[problem:CodeForces-1100B] Build a Contest数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1037A] Packets构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-371B] Fox Dividing Cheese数学(math),数论(number theory)\n[problem:CodeForces-810B] Summer sell-off贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1182B] Plus from Picture深度优先搜索及其变种(dfs and similar),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1216D] Swords数学(math)\n[problem:CodeForces-621B] Wet Shark and Bishops组合数学(combinatorics),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1065B] Vasya and Isolated Vertices构造算法(constructive algorithms),图论(graphs)\n[problem:CodeForces-1870C] Colorful Table二分搜索(binary search),数据结构(data structures),动态规划(dp),实现问题,编程技巧,模拟(implementation),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1659B] Bit Flipping位掩码(bitmasks),构造算法(constructive algorithms),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1867C] Salyg1n and the MEX Game构造算法(constructive algorithms),数据结构(data structures),博弈论(games),贪心策略(greedy),交互性问题(interactive)\n[problem:CodeForces-298A] Snow Footprints贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-598B] Queries on a String实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1101B] Accordion贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1096B] Substring Removal组合数学(combinatorics),数学(math),字符串处理(strings)\n[problem:CodeForces-1900C] Anji\u0027s Binary Tree深度优先搜索及其变种(dfs and similar),动态规划(dp),树形结构(trees)\n[problem:CodeForces-1003C] Intense Heat暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-628B] New Skateboard动态规划(dp)\n[problem:CodeForces-1271C] Shawarma Tent暴力枚举(brute force),计算几何(geometry),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1063A] Oh Those Palindromes构造算法(constructive algorithms),字符串处理(strings)\n[problem:CodeForces-1037B] Reach Median贪心策略(greedy)\n[problem:CodeForces-192A] Funky Numbers二分搜索(binary search),暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1194B] Yet Another Crosses Problem实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-429A] Xor-tree深度优先搜索及其变种(dfs and similar),树形结构(trees)\n[problem:CodeForces-1220C] Substring Game in the Lesson博弈论(games),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1236C] Labs构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1119B] Alyona and a Narrow Fridge二分搜索(binary search),流(flows),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-611B] New Year and Old Property位掩码(bitmasks),暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1107C] Brutality贪心策略(greedy),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-509B] Painting Pebbles构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-750B] New Year and North Pole计算几何(geometry),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1038C] Gambling贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-777B] Game of Credit Cards数据结构(data structures),动态规划(dp),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1030C] Vasya and Golden Ticket实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1093C] Mishka and the Last Exam贪心策略(greedy)\n[problem:CodeForces-1016B] Segment Occurrences暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1004B] Sonya and Exhibition构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1737B] Ela\u0027s Fitness and the Luxury Number二分搜索(binary search),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-665C] Simple Strings动态规划(dp),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1155C] Alarm Clocks Everywhere数学(math),数论(number theory)\n[problem:CodeForces-870C] Maximum splitting动态规划(dp),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-796B] Find The Bone实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1315B] Homecoming二分搜索(binary search),动态规划(dp),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-670C] Cinema实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-437A] The Child and Homework实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-996B] World Cup二分搜索(binary search),数学(math)\n[problem:CodeForces-919C] Seat Arrangements暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-740A] Alyona and copybooks暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1152B] Neko Performs Cat Furrier Transform位掩码(bitmasks),构造算法(constructive algorithms),深度优先搜索及其变种(dfs and similar),数学(math)\n[problem:CodeForces-946C] String Transformation贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-347A] Difference Row构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-681B] Economy Game暴力枚举(brute force)\n[problem:CodeForces-876B] Divisiblity of Differences实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-1062A] A Prank贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1786B] Cake Assembly Line暴力枚举(brute force),排序算法(sortings)\n[problem:CodeForces-416B] Art Union暴力枚举(brute force),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-567B] Berland National Library实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-922B] Magic Forest暴力枚举(brute force)\n[problem:CodeForces-798B] Mike and strings暴力枚举(brute force),动态规划(dp),字符串处理(strings)\n[problem:CodeForces-899C] Dividing the numbers构造算法(constructive algorithms),图论(graphs),数学(math)\n[problem:CodeForces-982B] Bus of Characters数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1209B] Koala and Lights实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-932B] Recursive Queries二分搜索(binary search),数据结构(data structures),深度优先搜索及其变种(dfs and similar)\n[problem:CodeForces-558B] Amr and The Large Array实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-303A] Lucky Permutation Triple构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1113B] Sasha and Magnetic Machines贪心策略(greedy),数论(number theory)\n[problem:CodeForces-915B] Browser实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-900B] Position in Fraction数学(math),数论(number theory)\n[problem:CodeForces-962B] Students in Railway Carriage构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-135A] Replacement贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-472B] Design Tutorial: Learn from Life\n[problem:CodeForces-318B] Strings of Power实现问题,编程技巧,模拟(implementation),字符串处理(strings),双指针算法(two pointers)\n[problem:CodeForces-515B] Drazil and His Happy Friends暴力枚举(brute force),并查集(dsu),meet-in-the-middle算法(meet-in-the-middle),数论(number theory)\n[problem:CodeForces-897B] Chtholly\u0027s request暴力枚举(brute force)\n[problem:CodeForces-610B] Vika and Squares构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1040B] Shashlik Cooking动态规划(dp),贪心策略(greedy),数学(math)\n[problem:CodeForces-612A] The Text Splitting暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-844B] Rectangles组合数学(combinatorics),数学(math)\n[problem:CodeForces-840A] Leha and Function组合数学(combinatorics),贪心策略(greedy),数学(math),数论(number theory),排序算法(sortings)\n[problem:CodeForces-1059B] Forgery实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1159B] Expansion coefficient of the array实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-257B] Playing Cubes博弈论(games),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-761B] Dasha and friends暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-572B] Order Book数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-625C] K-special Tables构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-722A] Broken Clock暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-808B] Average Sleep Time数据结构(data structures),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-630F] Selection of Personnel组合数学(combinatorics),数学(math)\n[problem:CodeForces-633B] A Trivial Problem暴力枚举(brute force),构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-626B] Cards构造算法(constructive algorithms),动态规划(dp),数学(math)\n[problem:CodeForces-485B] Valuable Resources暴力枚举(brute force),贪心策略(greedy)\n[problem:CodeForces-152B] Steps二分搜索(binary search),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-288A] Polo the Penguin and Strings贪心策略(greedy)\n[problem:CodeForces-909B] Segments构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-66A] Petya and Java实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-659B] Qualifying Contest构造算法(constructive algorithms),排序算法(sortings)\n[problem:CodeForces-158D] Ice Sculptures*special problem,暴力枚举(brute force),数论(number theory)\n[problem:CodeForces-376B] I.O.U.实现问题,编程技巧,模拟(implementation)\n\n[problem:CodeForces-83A] Magical Array数学(math)\n[problem:CodeForces-493A] Vasya and Football实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1776H] Beppa and SwerChat双指针算法(two pointers)\n[problem:CodeForces-222B] Cosmic Tables数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-792B] Counting-out Rhyme实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-471B] MUH and Important Things实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-185A] Plant数学(math)\n[problem:CodeForces-976B] Lara Croft and the New Game实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1870C] Colorful Table二分搜索(binary search),数据结构(data structures),动态规划(dp),实现问题,编程技巧,模拟(implementation),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1659B] Bit Flipping位掩码(bitmasks),构造算法(constructive algorithms),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1867C] Salyg1n and the MEX Game构造算法(constructive algorithms),数据结构(data structures),博弈论(games),贪心策略(greedy),交互性问题(interactive)\n[problem:CodeForces-298A] Snow Footprints贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-598B] Queries on a String实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1101B] Accordion贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1096B] Substring Removal组合数学(combinatorics),数学(math),字符串处理(strings)\n[problem:CodeForces-1900C] Anji\u0027s Binary Tree深度优先搜索及其变种(dfs and similar),动态规划(dp),树形结构(trees)\n[problem:CodeForces-1003C] Intense Heat暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-628B] New Skateboard动态规划(dp)\n[problem:CodeForces-1271C] Shawarma Tent暴力枚举(brute force),计算几何(geometry),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1063A] Oh Those Palindromes构造算法(constructive algorithms),字符串处理(strings)\n[problem:CodeForces-1037B] Reach Median贪心策略(greedy)\n[problem:CodeForces-192A] Funky Numbers二分搜索(binary search),暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1194B] Yet Another Crosses Problem实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-429A] Xor-tree深度优先搜索及其变种(dfs and similar),树形结构(trees)\n[problem:CodeForces-1220C] Substring Game in the Lesson博弈论(games),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1236C] Labs构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1119B] Alyona and a Narrow Fridge二分搜索(binary search),流(flows),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-611B] New Year and Old Property位掩码(bitmasks),暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1107C] Brutality贪心策略(greedy),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-509B] Painting Pebbles构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-750B] New Year and North Pole计算几何(geometry),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1038C] Gambling贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-777B] Game of Credit Cards数据结构(data structures),动态规划(dp),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1030C] Vasya and Golden Ticket实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1093C] Mishka and the Last Exam贪心策略(greedy)\n[problem:CodeForces-1016B] Segment Occurrences暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1004B] Sonya and Exhibition构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1737B] Ela\u0027s Fitness and the Luxury Number二分搜索(binary search),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-665C] Simple Strings动态规划(dp),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1155C] Alarm Clocks Everywhere数学(math),数论(number theory)\n[problem:CodeForces-870C] Maximum splitting动态规划(dp),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-796B] Find The Bone实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1315B] Homecoming二分搜索(binary search),动态规划(dp),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-670C] Cinema实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-437A] The Child and Homework实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-996B] World Cup二分搜索(binary search),数学(math)\n[problem:CodeForces-919C] Seat Arrangements暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-740A] Alyona and copybooks暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1152B] Neko Performs Cat Furrier Transform位掩码(bitmasks),构造算法(constructive algorithms),深度优先搜索及其变种(dfs and similar),数学(math)\n[problem:CodeForces-946C] String Transformation贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-347A] Difference Row构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-681B] Economy Game暴力枚举(brute force)\n[problem:CodeForces-876B] Divisiblity of Differences实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-1062A] A Prank贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1786B] Cake Assembly Line暴力枚举(brute force),排序算法(sortings)\n[problem:CodeForces-416B] Art Union暴力枚举(brute force),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-567B] Berland National Library实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-922B] Magic Forest暴力枚举(brute force)\n[problem:CodeForces-798B] Mike and strings暴力枚举(brute force),动态规划(dp),字符串处理(strings)\n[problem:CodeForces-899C] Dividing the numbers构造算法(constructive algorithms),图论(graphs),数学(math)\n[problem:CodeForces-982B] Bus of Characters数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1209B] Koala and Lights实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-932B] Recursive Queries二分搜索(binary search),数据结构(data structures),深度优先搜索及其变种(dfs and similar)\n[problem:CodeForces-558B] Amr and The Large Array实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-303A] Lucky Permutation Triple构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1113B] Sasha and Magnetic Machines贪心策略(greedy),数论(number theory)\n[problem:CodeForces-915B] Browser实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-900B] Position in Fraction数学(math),数论(number theory)\n[problem:CodeForces-962B] Students in Railway Carriage构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-135A] Replacement贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-472B] Design Tutorial: Learn from Life\n[problem:CodeForces-318B] Strings of Power实现问题,编程技巧,模拟(implementation),字符串处理(strings),双指针算法(two pointers)\n[problem:CodeForces-515B] Drazil and His Happy Friends暴力枚举(brute force),并查集(dsu),meet-in-the-middle算法(meet-in-the-middle),数论(number theory)\n[problem:CodeForces-897B] Chtholly\u0027s request暴力枚举(brute force)\n[problem:CodeForces-610B] Vika and Squares构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1040B] Shashlik Cooking动态规划(dp),贪心策略(greedy),数学(math)\n[problem:CodeForces-612A] The Text Splitting暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-844B] Rectangles组合数学(combinatorics),数学(math)\n[problem:CodeForces-840A] Leha and Function组合数学(combinatorics),贪心策略(greedy),数学(math),数论(number theory),排序算法(sortings)\n[problem:CodeForces-1059B] Forgery实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1159B] Expansion coefficient of the array实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-257B] Playing Cubes博弈论(games),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-761B] Dasha and friends暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-572B] Order Book数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-625C] K-special Tables构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-722A] Broken Clock暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-808B] Average Sleep Time数据结构(data structures),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-630F] Selection of Personnel组合数学(combinatorics),数学(math)\n[problem:CodeForces-633B] A Trivial Problem暴力枚举(brute force),构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-626B] Cards构造算法(constructive algorithms),动态规划(dp),数学(math)\n[problem:CodeForces-485B] Valuable Resources暴力枚举(brute force),贪心策略(greedy)\n[problem:CodeForces-152B] Steps二分搜索(binary search),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-288A] Polo the Penguin and Strings贪心策略(greedy)\n[problem:CodeForces-909B] Segments构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-66A] Petya and Java实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-659B] Qualifying Contest构造算法(constructive algorithms),排序算法(sortings)\n[problem:CodeForces-158D] Ice Sculptures*special problem,暴力枚举(brute force),数论(number theory)\n[problem:CodeForces-376B] I.O.U.实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-83A] Magical Array数学(math)\n[problem:CodeForces-493A] Vasya and Football实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1776H] Beppa and SwerChat双指针算法(two pointers)\n[problem:CodeForces-222B] Cosmic Tables数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-792B] Counting-out Rhyme实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-471B] MUH and Important Things实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-185A] Plant数学(math)\n[problem:CodeForces-976B] Lara Croft and the New Game实现问题,编程技巧,模拟(implementation),数学(math)\n","threadId":190418,"likeCnt":0,"createTime":1713879710000,"isWorkbook":true,"viewCnt":20,"openness":2,"fav":false,"id":4922,"trustable":false}