Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-44E\":[\"Anfisa the Monkey\",5292,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/44\\\"\\u003eSchool Team Contest 2 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-1526B\":[\"I Hate 1111\",29487,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1526\\\"\\u003eCodeforces Round 723 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1001B\":[\"Generate Bell state\",705,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1001\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018 - Warmup\\u003c/a\\u003e\"],\"CodeForces-1110B\":[\"Tape\",11143,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1110\\\"\\u003eCodeforces Global Round 1\\u003c/a\\u003e\"],\"CodeForces-1461B\":[\"Find the Spruce\",12695,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1461\\\"\\u003eCodeforces Round 689 (Div. 2, based on Zed Code Competition)\\u003c/a\\u003e\"],\"CodeForces-334B\":[\"Eight Point Sets\",3964,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/334\\\"\\u003eCodeforces Round 194 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1001C\":[\"Generate GHZ state\",647,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1001\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018 - Warmup\\u003c/a\\u003e\"],\"CodeForces-1279C\":[\"Stack of Presents\",11857,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1279\\\"\\u003eEducational Codeforces Round 79 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1691C\":[\"Sum of Substrings\",15279,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1691\\\"\\u003eCodeCraft-22 and Codeforces Round 795 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-358A\":[\"Dima and Continuous Line\",7892,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/358\\\"\\u003eCodeforces Round 208 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1001G\":[\"Oracle for f(x) \\u003d k-th element of x\",533,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1001\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018 - Warmup\\u003c/a\\u003e\"],\"CodeForces-727C\":[\"Guess the Array\",7470,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/727\\\"\\u003eTechnocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1001D\":[\"Distinguish plus state and minus state\",676,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1001\\\"\\u003eMicrosoft Q# Coding Contest - Summer 2018 - Warmup\\u003c/a\\u003e\"],\"CodeForces-1190A\":[\"Tokitsukaze and Discard Items\",9226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1190\\\"\\u003eCodeforces Round 573 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-479B\":[\"Towers\",8030,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/479\\\"\\u003eCodeforces Round 274 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-479C\":[\"Exams\",29938,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/479\\\"\\u003eCodeforces Round 274 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-697B\":[\"Barnicle\",6434,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/697\\\"\\u003eCodeforces Round 362 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-920C\":[\"Swap Adjacent Elements\",9513,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1907D\":[\"Jumping Through Segments\",12058,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1907\\\"\\u003eCodeforces Round 913 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1919C\":[\"Grouping Increases\",17120,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1919\\\"\\u003eHello 2024\\u003c/a\\u003e\"],\"CodeForces-770D\":[\"Draw Brackets!\",1585,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/770\\\"\\u003eVK Cup 2017 - Qualification 2\\u003c/a\\u003e\"],\"CodeForces-1513B\":[\"AND Sequences\",14055,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1513\\\"\\u003eDivide by Zero 2021 and Codeforces Round 714 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1634B\":[\"Fortune Telling\",15875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1634\\\"\\u003eCodeforces Round 770 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-430B\":[\"Balls Game\",4116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/430\\\"\\u003eCodeforces Round 245 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1266C\":[\"Diverse Matrix\",9542,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1266\\\"\\u003eCodeforces Global Round 6\\u003c/a\\u003e\"],\"CodeForces-1351C\":[\"Skier\",8363,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1351\\\"\\u003eTesting Round 16 (Unrated)\\u003c/a\\u003e\"],\"CodeForces-357B\":[\"Flag Day\",8334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/357\\\"\\u003eCodeforces Round 207 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-248B\":[\"Chilly Willy\",5790,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/248\\\"\\u003eCodeforces Round 152 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-369B\":[\"Valera and Contest\",6561,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/369\\\"\\u003eCodeforces Round 216 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1363B\":[\"Subsequence Hate\",23591,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1363\\\"\\u003eCodeforces Round 646 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1375C\":[\"Element Extermination\",21048,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1375\\\"\\u003eCodeforces Global Round 9\\u003c/a\\u003e\"],\"CodeForces-1840D\":[\"Wooden Toy Festival\",12968,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1840\\\"\\u003eCodeforces Round 878 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-604B\":[\"More Cowbell\",9295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/604\\\"\\u003eCodeforces Round 334 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-713A\":[\"Sonya and Queries\",8733,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/713\\\"\\u003eCodeforces Round 371 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-955B\":[\"Not simply beatiful strings\",5093,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/955\\\"\\u003eCodeforces Round 471 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1918C\":[\"XOR-distance\",12522,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1918\\\"\\u003eCodeforces Round 922 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-45I\":[\"TCMCF+++\",2477,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/45\\\"\\u003eSchool Team Contest 3 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-1415C\":[\"Bouncing Ball\",10785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1415\\\"\\u003eTechnocup 2021 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-1875C\":[\"Jellyfish and Green Apple\",11162,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1875\\\"\\u003eCodeforces Round 901 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-30A\":[\"Accounting\",3736,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/30\\\"\\u003eCodeforces Beta Round 30 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-1548A\":[\"Web of Lies\",16117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1548\\\"\\u003eCodeforces Round 736 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-42A\":[\"Guilty --- to the kitchen!\",3175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/42\\\"\\u003eCodeforces Beta Round 41\\u003c/a\\u003e\"],\"CodeForces-441B\":[\"Valera and Fruits\",7445,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/441\\\"\\u003eCodeforces Round 252 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1427B\":[\"Chess Cheater\",10975,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1427\\\"\\u003eCodeforces Global Round 11\\u003c/a\\u003e\"],\"CodeForces-1253B\":[\"Silly Mistake\",11282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1253\\\"\\u003eCodeforces Round 600 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1350B\":[\"Orac and Models\",21066,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1350\\\"\\u003eCodeforces Round 641 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1362C\":[\"Johnny and Another Rating Drop\",17295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1362\\\"\\u003eCodeforces Round 647 (Div. 2) - Thanks, Algo Muse!\\u003c/a\\u003e\"],\"CodeForces-1374D\":[\"Zero Remainder Array\",22659,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1374\\\"\\u003eCodeforces Round 653 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1156A\":[\"Inscribed Figures\",8451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1156\\\"\\u003eEducational Codeforces Round 64 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-507B\":[\"Amr and Pins\",25402,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/507\\\"\\u003eCodeforces Round 287 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1863D\":[\"Two-Colored Dominoes\",8954,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1863\\\"\\u003ePinely Round 2 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1144D\":[\"Equalize Them All\",10379,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1144\\\"\\u003eCodeforces Round 550 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-954B\":[\"String Typing\",8133,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/954\\\"\\u003eEducational Codeforces Round 40 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-748C\":[\"Santa Claus and Robot\",4712,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/748\\\"\\u003eTechnocup 2017 - Elimination Round 3\\u003c/a\\u003e\"],\"CodeForces-978E\":[\"Bus Video System\",10097,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/978\\\"\\u003eCodeforces Round 481 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-489C\":[\"Given Length and Sum of Digits...\",46187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/489\\\"\\u003eCodeforces Round 277.5 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1091C\":[\"New Year and the Sphere Transmission\",10216,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1091\\\"\\u003eGood Bye 2018\\u003c/a\\u003e\"],\"CodeForces-1905C\":[\"Largest Subsequence\",11069,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1905\\\"\\u003eCodeforces Round 915 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-550B\":[\"Preparing Olympiad\",23032,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/550\\\"\\u003eCodeforces Round 306 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-683D\":[\"Chocolate Bar\",321,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/683\\\"\\u003eSurprise Language Round 8\\u003c/a\\u003e\"],\"CodeForces-1929C\":[\"Sasha and the Casino\",13227,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1929\\\"\\u003eCodeforces Round 926 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-182D\":[\"Common Divisors\",8609,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/182\\\"\\u003eCodeforces Round 117 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1535C\":[\"Unstable String\",16315,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1535\\\"\\u003eEducational Codeforces Round 110 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1644C\":[\"Increase Subarray Sums\",13489,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1644\\\"\\u003eEducational Codeforces Round 123 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-79B\":[\"Colorful Field\",7097,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/79\\\"\\u003eCodeforces Beta Round 71\\u003c/a\\u003e\"],\"CodeForces-1903C\":[\"Theofanis\\u0027 Nightmare\",10381,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1903\\\"\\u003eCodeforces Round 912 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1927E\":[\"Klever Permutation\",12602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1927\\\"\\u003eCodeforces Round 923 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1046C\":[\"Space Formula\",3173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1046\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 2]\\u003c/a\\u003e\"],\"CodeForces-1494B\":[\"Berland Crossword\",14372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1494\\\"\\u003eEducational Codeforces Round 105 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-379C\":[\"New Year Ratings Change\",6997,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/379\\\"\\u003eGood Bye 2013\\u003c/a\\u003e\"],\"CodeForces-1167C\":[\"News Distribution\",18586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1167\\\"\\u003eEducational Codeforces Round 65 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1167B\":[\"Lost Numbers\",11251,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1167\\\"\\u003eEducational Codeforces Round 65 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1276A\":[\"As Simple as One and Two\",12412,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1276\\\"\\u003eCodeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-125A\":[\"Measuring Lengths in Baden\",2947,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/125\\\"\\u003eCodeforces Testing Round 2\\u003c/a\\u003e\"],\"CodeForces-518B\":[\"Tanya and Postcard\",8335,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/518\\\"\\u003eCodeforces Round 293 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1046F\":[\"Splitting money\",2782,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1046\\\"\\u003eBubble Cup 11 - Finals [Online Mirror, Div. 2]\\u003c/a\\u003e\"],\"CodeForces-1131B\":[\"Draw!\",10281,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1131\\\"\\u003eCodeforces Round 541 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1143C\":[\"Queen\",11689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1143\\\"\\u003eCodeforces Round 549 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-505B\":[\"Mr. Kitayuta\\u0027s Colorful Graph\",13284,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/505\\\"\\u003eCodeforces Round 286 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-614B\":[\"Gena\\u0027s Code\",7404,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/614\\\"\\u003eCodeforces Round 339 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-868B\":[\"Race Against Time\",3841,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/868\\\"\\u003eCodeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-977D\":[\"Divide by three, multiply by two\",19473,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/977\\\"\\u003eCodeforces Round 479 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-602B\":[\"Approximating a Constant Range\",11498,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/602\\\"\\u003eCodeforces Round 333 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-711B\":[\"Chris and Magic Square\",8744,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/711\\\"\\u003eCodeforces Round 369 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1904C\":[\"Array Game\",10949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1904\\\"\\u003eCodeforces Round 914 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-290D\":[\"Orange\",1832,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/290\\\"\\u003eApril Fools Day Contest 2013\\u003c/a\\u003e\"],\"CodeForces-290A\":[\"Mysterious strings\",2988,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/290\\\"\\u003eApril Fools Day Contest 2013\\u003c/a\\u003e\"],\"CodeForces-188E\":[\"HQ9+\",490,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/188\\\"\\u003eSurprise Language Round 6\\u003c/a\\u003e\"],\"CodeForces-152C\":[\"Pocket Book\",10937,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/152\\\"\\u003eCodeforces Round 108 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-261A\":[\"Maxim and Discounts\",5342,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/261\\\"\\u003eCodeforces Round 160 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-188F\":[\"Binary Notation\",286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/188\\\"\\u003eSurprise Language Round 6\\u003c/a\\u003e\"],\"CodeForces-1833D\":[\"Flipper\",12802,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1833\\\"\\u003eCodeforces Round 874 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-188C\":[\"LCM\",436,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/188\\\"\\u003eSurprise Language Round 6\\u003c/a\\u003e\"],\"CodeForces-1627C\":[\"Not Assigning\",14462,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1627\\\"\\u003eCodeforces Round 766 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1845C\":[\"Strong Password\",13375,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1845\\\"\\u003eEducational Codeforces Round 151 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1748B\":[\"Diverse Substrings\",14597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1748\\\"\\u003eCodeforces Round 833 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1506D\":[\"Epic Transformation\",21610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1506\\\"\\u003eCodeforces Round 710 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-24A\":[\"Ring road\",5516,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/24\\\"\\u003eCodeforces Beta Round 24\\u003c/a\\u003e\"],\"CodeForces-719B\":[\"Anatoly and Cockroaches\",9274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/719\\\"\\u003eCodeforces Round 373 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-435B\":[\"Pasha Maximizes\",7329,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/435\\\"\\u003eCodeforces Round 249 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1102B\":[\"Array K-Coloring\",11140,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1102\\\"\\u003eCodeforces Round 531 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-205B\":[\"Little Elephant and Sorting\",6622,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/205\\\"\\u003eCodeforces Round 129 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-816B\":[\"Karen and Coffee\",19812,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/816\\\"\\u003eCodeforces Round 419 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1097C\":[\"Yuhao and a Parenthesis\",8562,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1097\\\"\\u003eHello 2019\\u003c/a\\u003e\"],\"CodeForces-1320A\":[\"Journey Planning\",15655,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1320\\\"\\u003eCodeforces Round 625 (Div. 1, based on Technocup 2020 Final Round)\\u003c/a\\u003e\"],\"CodeForces-1332B\":[\"Composite Coloring\",17599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1332\\\"\\u003eCodeforces Round 630 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1453B\":[\"Suffix Operations\",13418,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1453\\\"\\u003eCodeforces Round 688 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-108B\":[\"Datatypes\",2770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/108\\\"\\u003eCodeforces Beta Round 83 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-804B\":[\"Minimum number of steps\",10028,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/804\\\"\\u003eCodeforces Round 411 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-937B\":[\"Vile Grasshoppers\",7210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/937\\\"\\u003eCodeforces Round 467 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-689A\":[\"Mike and Cellphone\",5692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/689\\\"\\u003eCodeforces Round 361 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1061B\":[\"Views Matter\",7724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1061\\\"\\u003eCodeforces Round 523 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-677B\":[\"Vanya and Food Processor\",8032,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/677\\\"\\u003eCodeforces Round 355 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-544B\":[\"Sea and Islands\",8675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/544\\\"\\u003eCodeforces Round 302 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-665B\":[\"Shopping\",3731,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/665\\\"\\u003eEducational Codeforces Round 12\\u003c/a\\u003e\"],\"CodeForces-762B\":[\"USB vs. PS/2\",8057,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"CodeForces-520B\":[\"Two Buttons\",53154,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/520\\\"\\u003eCodeforces Round 295 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-641B\":[\"Little Artem and Matrix\",4172,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/641\\\"\\u003eVK Cup 2016 - Round 2\\u003c/a\\u003e\"],\"CodeForces-762A\":[\"k-th divisor\",21229,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"CodeForces-1519C\":[\"Berland Regional\",16137,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1519\\\"\\u003eEducational Codeforces Round 108 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1628A\":[\"Meximum Array\",15300,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1628\\\"\\u003eCodeforces Round 767 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-260A\":[\"Adding Digits\",14741,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/260\\\"\\u003eCodeforces Round 158 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-272B\":[\"Dima and Sequence\",4114,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/272\\\"\\u003eCodeforces Round 167 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1844D\":[\"Row Major\",11647,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1844\\\"\\u003eCodeforces Round 884 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-175A\":[\"Robot Bicorn Attack\",2506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/175\\\"\\u003eCodeforces Round 115\\u003c/a\\u003e\"],\"CodeForces-284A\":[\"Cows and Primitive Roots\",6821,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/284\\\"\\u003eCodeforces Round 174 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1517C\":[\"Fillomino 2\",13335,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1517\\\"\\u003eContest 2050 and Codeforces Round 718 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1759D\":[\"Make It Round\",12575,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1759\\\"\\u003eCodeforces Round 834 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-175B\":[\"Plane of Tanks: Pro\",1465,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/175\\\"\\u003eCodeforces Round 115\\u003c/a\\u003e\"],\"CodeForces-1735C\":[\"Phase Shift\",9716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1735\\\"\\u003eCodeforces Round 824 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1505C\":[\"Fibonacci Words\",6408,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1505\\\"\\u003eApril Fools Day Contest 2021\\u003c/a\\u003e\"],\"CodeForces-1670C\":[\"Where is the Pizza?\",9639,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1670\\\"\\u003eCodeforces Round 788 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-313C\":[\"Ilya and Matrix\",5821,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/313\\\"\\u003eCodeforces Round 186 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1682C\":[\"LIS or Reverse LIS?\",14263,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1682\\\"\\u003eCodeforces Round 793 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1004C\":[\"Sonya and Robots\",7822,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1004\\\"\\u003eCodeforces Round 495 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-337B\":[\"Routine Problem\",9558,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/337\\\"\\u003eCodeforces Round 196 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-228B\":[\"Two Tables\",3571,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/228\\\"\\u003eCodeforces Round 141 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1355D\":[\"Game With Array\",17899,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1355\\\"\\u003eCodeforces Round 643 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1452B\":[\"Toy Blocks\",14844,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1452\\\"\\u003eEducational Codeforces Round 98 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-107A\":[\"Dorm Water Supply\",5444,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/107\\\"\\u003eCodeforces Beta Round 83 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-803A\":[\"Maximal Binary Matrix\",5134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-1573B\":[\"Swaps\",14703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1573\\\"\\u003eCodeforces Round 743 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-911C\":[\"Three Garlands\",7392,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-797B\":[\"Odd sum\",11380,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"CodeForces-652A\":[\"Gabriel and Caterpillar\",4854,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/652\\\"\\u003eEducational Codeforces Round 10\\u003c/a\\u003e\"],\"CodeForces-802J\":[\"Send the Fool Further! (easy)\",4721,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"CodeForces-81A\":[\"Plug-in\",11798,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/81\\\"\\u003eYandex.Algorithm Open 2011: Qualification 1\\u003c/a\\u003e\"],\"CodeForces-174B\":[\"File List\",2351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/174\\\"\\u003eVK Cup 2012 Round 3 (Unofficial Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-150A\":[\"Win or Freeze\",8294,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/150\\\"\\u003eCodeforces Round 107 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-198B\":[\"Jumping on Walls\",4628,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/198\\\"\\u003eCodeforces Round 125 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-295A\":[\"Greg and Array\",17066,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/295\\\"\\u003eCodeforces Round 179 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1758C\":[\"Almost All Multiples\",13274,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1758\\\"\\u003eCodeforces Round 836 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1451C\":[\"String Equality\",16046,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1451\\\"\\u003eCodeforces Round 685 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-203C\":[\"Photographer\",5901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/203\\\"\\u003eCodeforces Round 128 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-445B\":[\"DZY Loves Chemistry\",14438,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/445\\\"\\u003eCodeforces Round 254 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1245C\":[\"Constanze\\u0027s Machine\",17870,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1245\\\"\\u003eCodeforces Round 597 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-838A\":[\"Binary Blocks\",967,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/838\\\"\\u003eIndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)\\u003c/a\\u003e\"],\"CodeForces-1463B\":[\"Find The Array\",19206,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1463\\\"\\u003eEducational Codeforces Round 100 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1475C\":[\"Ball in Berland\",20482,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1475\\\"\\u003eCodeforces Round 697 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1330B\":[\"Dreamoon Likes Permutations\",14032,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1330\\\"\\u003eCodeforces Round 631 (Div. 2) - Thanks, Denis aramis Shitov!\\u003c/a\\u003e\"],\"CodeForces-1095C\":[\"Powers Of Two\",16947,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1095\\\"\\u003eCodeforces Round 529 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-699B\":[\"One Bomb\",8687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/699\\\"\\u003eCodeforces Round 363 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-675B\":[\"Restoring Painting\",8163,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/675\\\"\\u003eCodeforces Round 353 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1790E\":[\"Vlad and a Pair of Numbers\",14335,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1790\\\"\\u003eCodeforces Round 847 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1408B\":[\"Arrays Sum\",9960,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1408\\\"\\u003eGrakn Forces 2020\\u003c/a\\u003e\"],\"CodeForces-1909C\":[\"Heavy Intervals\",9952,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1909\\\"\\u003ePinely Round 3 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-270B\":[\"Multithreading\",4306,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/270\\\"\\u003eCodeforces Round 165 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1624D\":[\"Palindromes Coloring\",16566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1624\\\"\\u003eCodeforces Round 764 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1721C\":[\"Min-Max Array Transformation\",13601,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1721\\\"\\u003eEducational Codeforces Round 134 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1951C\":[\"Ticket Hoarding\",9174,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1951\\\"\\u003eCodeforces Global Round 25\\u003c/a\\u003e\"],\"CodeForces-1830A\":[\"Copil Copac Draws Trees\",12701,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1830\\\"\\u003eCodeforces Round 875 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1878E\":[\"Iva \\u0026 Pav\",11128,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1878\\\"\\u003eCodeforces Round 900 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-197B\":[\"Limit\",5036,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/197\\\"\\u003eCodeforces Round 124 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1648A\":[\"Weird Sum\",11854,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1648\\\"\\u003eCodeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics)\\u003c/a\\u003e\"],\"CodeForces-1866B\":[\"Battling with Numbers\",7230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1866\\\"\\u003eCOMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1515C\":[\"Phoenix and Towers\",16697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1515\\\"\\u003eCodeforces Global Round 14\\u003c/a\\u003e\"],\"CodeForces-1600J\":[\"Robot Factory\",3907,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1600\\\"\\u003eBubble Cup 14 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1462D\":[\"Add to Neighbour and Remove\",16621,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1462\\\"\\u003eCodeforces Round 690 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-335A\":[\"Banana\",2608,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/335\\\"\\u003eMemSQL start[c]up Round 2 - online version\\u003c/a\\u003e\"],\"CodeForces-1256B\":[\"Minimize the Permutation\",13576,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1256\\\"\\u003eCodeforces Round 598 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-226A\":[\"Flying Saucer Segments\",4087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/226\\\"\\u003eCodeforces Round 140 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-359B\":[\"Permutation\",8267,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/359\\\"\\u003eCodeforces Round 209 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-934A\":[\"A Compatible Pair\",7467,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/934\\\"\\u003eCodeforces Round 462 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1365C\":[\"Rotation Matching\",22692,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1365\\\"\\u003eCodeforces Round 648 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-703B\":[\"Mishka and trip\",6021,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/703\\\"\\u003eCodeforces Round 365 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-698A\":[\"Vacations\",30490,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/698\\\"\\u003eCodeforces Round 363 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1692G\":[\"2^Sort\",16553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1692\\\"\\u003eCodeforces Round 799 (Div. 4)\\u003c/a\\u003e\"],\"CodeForces-650A\":[\"Watchmen\",15703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/650\\\"\\u003eCodeforces Round 345 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-120E\":[\"Put Knight!\",2871,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-1009B\":[\"Minimum Ternary String\",10719,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1009\\\"\\u003eEducational Codeforces Round 47 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1348B\":[\"Phoenix and Beauty\",25036,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1348\\\"\\u003eCodeforces Round 638 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-120F\":[\"Spiders\",3797,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-120D\":[\"Three Sons\",2044,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-253B\":[\"Physics Practical\",12134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/253\\\"\\u003eCodeforces Round 154 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-386B\":[\"Fly, freebies, fly!\",2549,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/386\\\"\\u003eTesting Round 9\\u003c/a\\u003e\"],\"CodeForces-1215B\":[\"The Number of Products\",13014,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1215\\\"\\u003eCodeforces Round 585 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1837D\":[\"Bracket Coloring\",13504,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1837\\\"\\u003eEducational Codeforces Round 149 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-277A\":[\"Learning Languages\",19811,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/277\\\"\\u003eCodeforces Round 170 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-289B\":[\"Polo the Penguin and Matrix\",17318,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/289\\\"\\u003eCodeforces Round 177 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-808C\":[\"Tea Party\",6908,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"CodeForces-929A\":[\"Прокат велосипедов\",2491,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/929\\\"\\u003eVK Cup 2018 - Квалификация 2\\u003c/a\\u003e\"],\"CodeForces-1312C\":[\"Adding Powers\",16381,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1312\\\"\\u003eEducational Codeforces Round 83 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1324D\":[\"Pair of Topics\",28563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1324\\\"\\u003eCodeforces Round 627 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1162B\":[\"Double Matrix\",6171,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1162\\\"\\u003eCodeforces Round 557 (Div. 2) [based on Forethought Future Cup - Final Round]\\u003c/a\\u003e\"],\"CodeForces-1421C\":[\"Palindromifier\",12806,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1421\\\"\\u003eCodeforces Round 676 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1772D\":[\"Absolute Sorting\",15072,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1772\\\"\\u003eCodeforces Round 839 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1893A\":[\"Anonymous Informant\",11348,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1893\\\"\\u003eCodeforces Round 908 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-548B\":[\"Mike and Fun\",8844,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/548\\\"\\u003eCodeforces Round 305 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1380B\":[\"Universal Solution\",14643,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1380\\\"\\u003eEducational Codeforces Round 91 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1380C\":[\"Create The Teams\",20488,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1380\\\"\\u003eEducational Codeforces Round 91 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-851B\":[\"Arpa and an exam about geometry\",6295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/851\\\"\\u003eCodeforces Round 432 (Div. 2, based on IndiaHacks Final Round 2017)\\u003c/a\\u003e\"],\"CodeForces-1838C\":[\"No Prime Differences\",13525,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1838\\\"\\u003eCodeforces Round 877 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-60B\":[\"Serial Time!\",5079,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/60\\\"\\u003eCodeforces Beta Round 56\\u003c/a\\u003e\"],\"CodeForces-131C\":[\"The World is a Theatre\",12232,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/131\\\"\\u003eCodeforces Beta Round 95 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1468C\":[\"Berpizza\",9143,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1468\\\"\\u003e2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-1606C\":[\"Banknotes\",13979,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1606\\\"\\u003eEducational Codeforces Round 116 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1214A\":[\"Optimal Currency Exchange\",9134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1214\\\"\\u003eCodeforces Round 583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)\\u003c/a\\u003e\"],\"CodeForces-1824A\":[\"LuoTianyi and the Show\",10845,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1824\\\"\\u003eCodeforces Round 872 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-928B\":[\"Chat\",2529,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/928\\\"\\u003eVK Cup 2018 - Квалификация 1\\u003c/a\\u003e\"],\"CodeForces-402B\":[\"Trees in a Row\",4273,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/402\\\"\\u003eCodeforces Round 236 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-414B\":[\"Mashmokh and ACM\",22169,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/414\\\"\\u003eCodeforces Round 240 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1771B\":[\"Hossam and Friends\",12904,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1771\\\"\\u003eCodeforces Round 837 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1197C\":[\"Array Splitting\",14343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1197\\\"\\u003eEducational Codeforces Round 69 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1088C\":[\"Ehab and a 2-operation task\",8415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1088\\\"\\u003eCodeforces Round 525 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1270C\":[\"Make Good\",14122,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1270\\\"\\u003eGood Bye 2019\\u003c/a\\u003e\"],\"CodeForces-523C\":[\"Name Quest\",2642,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/523\\\"\\u003eVK Cup 2015 - Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-632B\":[\"Alice, Bob, Two Teams\",4358,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/632\\\"\\u003eEducational Codeforces Round 9\\u003c/a\\u003e\"],\"CodeForces-898C\":[\"Phone Numbers\",5643,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-995B\":[\"Suit and Tie\",7260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/995\\\"\\u003eCodeforces Round 492 (Div. 1) [Thanks, uDebug!]\\u003c/a\\u003e\"],\"CodeForces-1728C\":[\"Digital Logarithm\",15279,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1728\\\"\\u003eEducational Codeforces Round 135 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-470A\":[\"Crystal Ball Sequence\",665,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/470\\\"\\u003eSurprise Language Round 7\\u003c/a\\u003e\"],\"CodeForces-130B\":[\"Gnikool Ssalg\",515,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/130\\\"\\u003eUnknown Language Round 4\\u003c/a\\u003e\"],\"CodeForces-1346B\":[\"Boot Camp\",1178,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1346\\\"\\u003eKotlin Heroes: Episode 4\\u003c/a\\u003e\"],\"CodeForces-1714E\":[\"Add Modulo 10\",15372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1714\\\"\\u003eCodeforces Round 811 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1932D\":[\"Card Game\",9822,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1932\\\"\\u003eCodeforces Round 927 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1932C\":[\"LR-remainders\",13620,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1932\\\"\\u003eCodeforces Round 927 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1605C\":[\"Dominant Character\",16597,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1605\\\"\\u003eCodeforces Round 754 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1847C\":[\"Vampiric Powers, anyone?\",12259,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1847\\\"\\u003eCodeforces Round 882 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-401C\":[\"Team\",20249,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/401\\\"\\u003eCodeforces Round 235 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-413C\":[\"Jeopardy!\",2619,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/413\\\"\\u003eCoder-Strike 2014 - Round 2\\u003c/a\\u003e\"],\"CodeForces-1201C\":[\"Maximum Median\",24000,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1201\\\"\\u003eCodeforces Round 577 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-38C\":[\"Blinds\",2296,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/38\\\"\\u003eSchool Personal Contest #1 (Winter Computer School 2010/11) - Codeforces Beta Round 38 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-26B\":[\"Regular Bracket Sequence\",20577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/26\\\"\\u003eCodeforces Beta Round 26 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-437C\":[\"The Child and Toy\",14897,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/437\\\"\\u003eCodeforces Round 250 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1540A\":[\"Great Graphs\",13844,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1540\\\"\\u003eCodeforces Round 728 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1443C\":[\"The Delivery Dilemma\",15636,\"\\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-1431B\":[\"Polycarp and the Language of Gods\",997,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1431\\\"\\u003eKotlin Heroes 5: ICPC Round\\u003c/a\\u003e\"],\"CodeForces-1697C\":[\"awoo\\u0027s Favorite Problem\",14165,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1697\\\"\\u003eEducational Codeforces Round 130 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-219B\":[\"Special Offer! Super Price 999 Bourles!\",6101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/219\\\"\\u003eCodeforces Round 135 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-679A\":[\"Bear and Prime 100\",12847,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/679\\\"\\u003eCodeforces Round 356 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-534B\":[\"Covered Path\",10863,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/534\\\"\\u003eCodeforces Round 298 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-546C\":[\"Soldier and Cards\",18963,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/546\\\"\\u003eCodeforces Round 304 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-994B\":[\"Knights of a Polygonal Table\",6278,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/994\\\"\\u003eCodeforces Round 488 by NEAR (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-493B\":[\"Vasya and Wrestling\",13344,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/493\\\"\\u003eCodeforces Round 281 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1931E\":[\"Anna and the Valentine\\u0027s Day Gift\",13276,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1931\\\"\\u003eCodeforces Round 925 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-630L\":[\"Cracking the Code\",3542,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-141B\":[\"Hopscotch\",5687,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/141\\\"\\u003eCodeforces Round 101 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1369C\":[\"RationalLee\",19487,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1369\\\"\\u003eCodeforces Round 652 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1701C\":[\"Schedule Management\",16399,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1701\\\"\\u003eEducational Codeforces Round 131 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1955D\":[\"Inaccurate Subsequence Search\",12047,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1955\\\"\\u003eCodeforces Round 938 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1103A\":[\"Grid game\",9889,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1103\\\"\\u003eCodeforces Round 534 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-286A\":[\"Lucky Permutation\",3213,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/286\\\"\\u003eCodeforces Round 176 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1749C\":[\"Number Game\",13609,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1749\\\"\\u003eEducational Codeforces Round 138 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1200C\":[\"Round Corridor\",10341,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1200\\\"\\u003eCodeforces Round 578 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-436B\":[\"Om Nom and Spiders\",3209,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/436\\\"\\u003eZepto Code Rush 2014\\u003c/a\\u003e\"],\"CodeForces-1195C\":[\"Basketball Exercise\",25790,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1195\\\"\\u003eCodeforces Round 574 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1292A\":[\"NEKO\\u0027s Maze Game\",13133,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1292\\\"\\u003eCodeforces Round 614 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-1696C\":[\"Fishingprince Plays With Array\",11374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1696\\\"\\u003eCodeforces Global Round 21\\u003c/a\\u003e\"],\"CodeForces-315A\":[\"Sereja and Bottles\",11329,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/315\\\"\\u003eCodeforces Round 187 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-448B\":[\"Suffix Structures\",16140,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/448\\\"\\u003eCodeforces Round 256 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1684C\":[\"Column Swapping\",12230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1684\\\"\\u003eCodeforces Round 792 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-799B\":[\"T-shirt buying\",10202,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/799\\\"\\u003ePlayrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1183D\":[\"Candy Box (easy version)\",13879,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1183\\\"\\u003eCodeforces Round 570 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1183C\":[\"Computer Game\",15074,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1183\\\"\\u003eCodeforces Round 570 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-981C\":[\"Useful Decomposition\",5636,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/981\\\"\\u003eAvito Code Challenge 2018\\u003c/a\\u003e\"],\"CodeForces-630H\":[\"Benches\",5330,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"CodeForces-492C\":[\"Vanya and Exams\",14749,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/492\\\"\\u003eCodeforces Round 280 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1679C\":[\"Rooks Defenders\",10103,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1679\\\"\\u003eCodeforces Round 791 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1764C\":[\"Doremy\\u0027s City Construction\",9117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1764\\\"\\u003eCodeforces Global Round 24\\u003c/a\\u003e\"],\"CodeForces-100C\":[\"A+B\",528,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/100\\\"\\u003eUnknown Language Round 3\\u003c/a\\u003e\"],\"CodeForces-245E\":[\"Mishap in Club\",3745,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/245\\\"\\u003eCROC-MBTU 2012, Elimination Round (ACM-ICPC)\\u003c/a\\u003e\"],\"CodeForces-233B\":[\"Non-square Equation\",8181,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/233\\\"\\u003eCodeforces Round 144 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1316B\":[\"String Modification\",11231,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1316\\\"\\u003eCodeCraft-20 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1425A\":[\"Arena of Greed\",6691,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1425\\\"\\u003e2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-124B\":[\"Permutations\",4850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/124\\\"\\u003eCodeforces Beta Round 92 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-1057B\":[\"DDoS\",1835,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1057\\\"\\u003eMail.Ru Cup 2018 - Practice Round\\u003c/a\\u003e\"],\"CodeForces-1425F\":[\"Flamingoes of Mystery\",5336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1425\\\"\\u003e2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1130C\":[\"Connect\",9187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1130\\\"\\u003eCodeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1251B\":[\"Binary Palindromes\",11153,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1251\\\"\\u003eEducational Codeforces Round 75 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1263C\":[\"Everyone is a Winner!\",14181,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1263\\\"\\u003eCodeforces Round 603 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1154C\":[\"Gourmet Cat\",11303,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1154\\\"\\u003eCodeforces Round 552 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1263B\":[\"PIN Codes\",11723,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1263\\\"\\u003eCodeforces Round 603 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1740C\":[\"Bricks and Bags\",10680,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1740\\\"\\u003eCodeforces Round 831 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-988C\":[\"Equal Sums\",10526,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/988\\\"\\u003eCodeforces Round 486 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-637C\":[\"Promocodes with Mistakes\",2473,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/637\\\"\\u003eVK Cup 2016 - Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-843A\":[\"Sorting by Subsequences\",5698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/843\\\"\\u003eAIM Tech Round 4 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-710B\":[\"Optimal Point on a Line\",9883,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/710\\\"\\u003eEducational Codeforces Round 16\\u003c/a\\u003e\"],\"CodeForces-940B\":[\"Our Tanya is Crying Out Loud\",9440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/940\\\"\\u003eCodeforces Round 466 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-475B\":[\"Strongly Connected City\",8839,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/475\\\"\\u003eBayan 2015 Contest Warm Up\\u003c/a\\u003e\"],\"CodeForces-180C\":[\"Letter\",7872,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/180\\\"\\u003eCodeforces Round 116 (Div. 2, ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-41B\":[\"Martian Dollar\",4244,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/41\\\"\\u003eCodeforces Beta Round 40 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1303B\":[\"National Project\",15866,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1303\\\"\\u003eEducational Codeforces Round 82 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1896C\":[\"Matching Arrays\",8611,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1896\\\"\\u003eCodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-1654C\":[\"Alice and the Cake\",13420,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1654\\\"\\u003eCodeforces Round 778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round)\\u003c/a\\u003e\"],\"CodeForces-77A\":[\"Heroes\",1792,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/77\\\"\\u003eCodeforces Beta Round 69 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-1901C\":[\"Add, Divide and Floor\",10685,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1901\\\"\\u003eEducational Codeforces Round 158 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-111A\":[\"Petya and Inequiations\",5084,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/111\\\"\\u003eCodeforces Beta Round 85 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-159C\":[\"String Manipulation 1.0\",3063,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/159\\\"\\u003eVK Cup 2012 Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-1189C\":[\"Candies!\",10703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1189\\\"\\u003eCodeforces Round 572 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-159A\":[\"Friends or Not\",2595,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/159\\\"\\u003eVK Cup 2012 Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-1068A\":[\"Birthday\",7088,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1068\\\"\\u003eCodeforces Round 518 (Div. 2) [Thanks, Mail.Ru!]\\u003c/a\\u003e\"],\"CodeForces-1860C\":[\"Game on Permutation\",12428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1860\\\"\\u003eEducational Codeforces Round 153 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1250A\":[\"Berstagram\",4670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1250\\\"\\u003e2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-649B\":[\"Этажи\",519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/649\\\"\\u003eТехнокубок 2016 - Отборочный Раунд 2\\u003c/a\\u003e\"],\"CodeForces-757B\":[\"Bash\\u0027s Big Day\",11100,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/757\\\"\\u003eCodecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-987C\":[\"Three displays\",14045,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/987\\\"\\u003eCodeforces Round 485 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-515C\":[\"Drazil and Factorial\",26559,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/515\\\"\\u003eCodeforces Round 292 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-745B\":[\"Hongcow Solves A Puzzle\",3923,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/745\\\"\\u003eCodeforces Round 385 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-612C\":[\"Replace To Make Regular Bracket Sequence\",8611,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/612\\\"\\u003eEducational Codeforces Round 4\\u003c/a\\u003e\"],\"CodeForces-8B\":[\"Obsession with Robots\",4498,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/8\\\"\\u003eCodeforces Beta Round 8\\u003c/a\\u003e\"],\"CodeForces-975C\":[\"Valhalla Siege\",11316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/975\\\"\\u003eCodeforces Round 478 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1805C\":[\"Place for a Selfie\",12113,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1805\\\"\\u003eCodeforces Round 862 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1108D\":[\"Diverse Garland\",15759,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1108\\\"\\u003eCodeforces Round 535 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-907B\":[\"Tic-Tac-Toe\",4167,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/907\\\"\\u003eCodeforces Round 454 (Div. 2, based on Technocup 2018 Elimination Round 4)\\u003c/a\\u003e\"],\"CodeForces-158C\":[\"Cd and pwd commands\",9340,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/158\\\"\\u003eVK Cup 2012 Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-279B\":[\"Books\",53341,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/279\\\"\\u003eCodeforces Round 171 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-388A\":[\"Fox and Box Accumulation\",11825,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/388\\\"\\u003eCodeforces Round 228 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-279A\":[\"Point on Spiral\",5854,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/279\\\"\\u003eCodeforces Round 171 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1883F\":[\"You Are So Beautiful\",8194,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1883\\\"\\u003eCodeforces Round 905 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1750C\":[\"Complementary XOR\",9305,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1750\\\"\\u003eCodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!)\\u003c/a\\u003e\"],\"CodeForces-417C\":[\"Football\",5132,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/417\\\"\\u003eRCC 2014 Warmup (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1285C\":[\"Fadi and LCM\",24205,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1285\\\"\\u003eCodeforces Round 613 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1520E\":[\"Arranging The Sheep\",20784,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1520\\\"\\u003eCodeforces Round 719 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1895C\":[\"Torn Lucky Ticket\",10105,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1895\\\"\\u003eEducational Codeforces Round 157 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-417B\":[\"Crash\",1923,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/417\\\"\\u003eRCC 2014 Warmup (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1762C\":[\"Binary Strings are Fun\",8897,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1762\\\"\\u003eCodeforces Round 838 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-538B\":[\"Quasi Binary\",18885,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/538\\\"\\u003eCodeforces Round 300\\u003c/a\\u003e\"],\"CodeForces-526B\":[\"Om Nom and Dark Park\",4840,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/526\\\"\\u003eZeptoLab Code Rush 2015\\u003c/a\\u003e\"],\"CodeForces-514B\":[\"Han Solo and Lazer Gun\",21522,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/514\\\"\\u003eCodeforces Round 291 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-865A\":[\"Save the problem!\",4221,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/865\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 2 (onsite finalists)\\u003c/a\\u003e\"],\"CodeForces-962C\":[\"Make a Square\",8351,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/962\\\"\\u003eEducational Codeforces Round 42 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1370C\":[\"Number Game\",24286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1370\\\"\\u003eCodeforces Round 651 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-485A\":[\"Factory\",8592,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/485\\\"\\u003eCodeforces Round 276 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1719C\":[\"Fighting Tournament\",12956,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1719\\\"\\u003eCodeforces Round 814 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1228B\":[\"Filling the Grid\",11769,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1228\\\"\\u003eCodeforces Round 589 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1579D\":[\"Productive Meeting\",15838,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1579\\\"\\u003eCodeforces Round 744 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-363C\":[\"Fixing Typos\",13462,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/363\\\"\\u003eCodeforces Round 211 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1923C\":[\"Find B\",13046,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1923\\\"\\u003eEducational Codeforces Round 162 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1705C\":[\"Mark and His Unfinished Essay\",13072,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1705\\\"\\u003eCodeforces Round 807 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1393B\":[\"Applejack and Storages\",16569,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1393\\\"\\u003eCodeforces Round 662 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-19A\":[\"World Football Cup\",2875,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/19\\\"\\u003eCodeforces Beta Round 19\\u003c/a\\u003e\"],\"CodeForces-1761C\":[\"Set Construction\",9286,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1761\\\"\\u003ePinely Round 1 (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1773E\":[\"Easy Assembly\",4767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1773\\\"\\u003e2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-1284B\":[\"New Year and Ascent Sequence\",11050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1284\\\"\\u003eHello 2020\\u003c/a\\u003e\"],\"CodeForces-416A\":[\"Guess a number!\",10216,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/416\\\"\\u003eCodeforces Round 241 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-538A\":[\"Cutting Banner\",7532,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/538\\\"\\u003eCodeforces Round 300\\u003c/a\\u003e\"],\"CodeForces-1066C\":[\"Books Queries\",10709,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1066\\\"\\u003eCodeforces Round 515 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-525B\":[\"Pasha and String\",9879,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/525\\\"\\u003eCodeforces Round 297 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-888C\":[\"K-Dominant Character\",9067,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-961C\":[\"Chessboard\",5506,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/961\\\"\\u003eEducational Codeforces Round 41 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1490E\":[\"Accidental Victory\",19031,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1490\\\"\\u003eCodeforces Round 702 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1609C\":[\"Complex Market Analysis\",9721,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1609\\\"\\u003eDeltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1706C\":[\"Qpwoeirut And The City\",14485,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1706\\\"\\u003eCodeforces Round 809 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-472C\":[\"Design Tutorial: Make It Nondeterministic\",6540,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/472\\\"\\u003eCodeforces Round 270\\u003c/a\\u003e\"],\"CodeForces-581C\":[\"Developing Skills\",7837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/581\\\"\\u003eCodeforces Round 322 (Div. 2)\\u003c/a\\u003e\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"ExtractStars","updateTime":1713879492000,"title":"CodeForces rating 1400 题目集","dislikeCnt":0,"content":"[problem:CodeForces-520B] Two Buttons深度优先搜索及其变种(dfs and similar),图论(graphs),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math),最短路算法(shortest paths)\n[problem:CodeForces-279B] Books二分搜索(binary search),暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-489C] Given Length and Sum of Digits...动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1526B] I Hate 1111动态规划(dp),数学(math),数论(number theory)\n[problem:CodeForces-479C] Exams贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-698A] Vacations动态规划(dp)\n[problem:CodeForces-1324D] Pair of Topics二分搜索(binary search),数据结构(data structures),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-515C] Drazil and Factorial贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1348B] Phoenix and Beauty构造算法(constructive algorithms),数据结构(data structures),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-507B] Amr and Pins计算几何(geometry),数学(math)\n[problem:CodeForces-1195C] Basketball Exercise动态规划(dp)\n[problem:CodeForces-1370C] Number Game博弈论(games),数学(math),数论(number theory)\n[problem:CodeForces-1363B] Subsequence Hate实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1365C] Rotation Matching构造算法(constructive algorithms),数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1374D] Zero Remainder Array数学(math),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1285C] Fadi and LCM暴力枚举(brute force),数学(math),数论(number theory)\n[problem:CodeForces-1201C] Maximum Median二分搜索(binary search),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-414B] Mashmokh and ACM组合数学(combinatorics),动态规划(dp),数论(number theory)\n[problem:CodeForces-1506D] Epic Transformation构造算法(constructive algorithms),数据结构(data structures),贪心策略(greedy)\n[problem:CodeForces-1350B] Orac and Models动态规划(dp),数学(math),数论(number theory)\n[problem:CodeForces-1375C] Element Extermination构造算法(constructive algorithms),数据结构(data structures),贪心策略(greedy)\n[problem:CodeForces-514B] Han Solo and Lazer Gun暴力枚举(brute force),数据结构(data structures),计算几何(geometry),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1475C] Ball in Berland组合数学(combinatorics),图论(graphs),数学(math)\n[problem:CodeForces-1380C] Create The Teams暴力枚举(brute force),动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1520E] Arranging The Sheep贪心策略(greedy),数学(math)\n[problem:CodeForces-550B] Preparing Olympiad位掩码(bitmasks),暴力枚举(brute force)\n[problem:CodeForces-401C] Team构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1369C] RationalLee贪心策略(greedy),数学(math),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1463B] Find The Array位掩码(bitmasks),构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1490E] Accidental Victory二分搜索(binary search),数据结构(data structures),贪心策略(greedy)\n[problem:CodeForces-277A] Learning Languages深度优先搜索及其变种(dfs and similar),并查集(dsu)\n[problem:CodeForces-762A] k-th divisor数学(math),数论(number theory)\n[problem:CodeForces-538B] Quasi Binary构造算法(constructive algorithms),动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-977D] Divide by three,multiply by two深度优先搜索及其变种(dfs and similar),数学(math),排序算法(sortings)\n[problem:CodeForces-1355D] Game With Array构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-26B] Regular Bracket Sequence贪心策略(greedy)\n[problem:CodeForces-546C] Soldier and Cards暴力枚举(brute force),深度优先搜索及其变种(dfs and similar),博弈论(games)\n[problem:CodeForces-1332B] Composite Coloring暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1362C] Johnny and Another Rating Drop位掩码(bitmasks),贪心策略(greedy),数学(math)\n[problem:CodeForces-1167C] News Distribution深度优先搜索及其变种(dfs and similar),并查集(dsu),图论(graphs)\n[problem:CodeForces-1245C] Constanze\u0027s Machine动态规划(dp)\n[problem:CodeForces-289B] Polo the Penguin and Matrix暴力枚举(brute force),动态规划(dp),实现问题,编程技巧,模拟(implementation),排序算法(sortings),三分搜索(ternary search)\n[problem:CodeForces-1919C] Grouping Increases数据结构(data structures),动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1515C] Phoenix and Towers构造算法(constructive algorithms),数据结构(data structures),贪心策略(greedy)\n[problem:CodeForces-816B] Karen and Coffee二分搜索(binary search),数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1605C] Dominant Character暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1393B] Applejack and Storages构造算法(constructive algorithms),数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1624D] Palindromes Coloring二分搜索(binary search),贪心策略(greedy),排序算法(sortings),字符串处理(strings)\n[problem:CodeForces-1462D] Add to Neighbour and Remove贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1535C] Unstable String二分搜索(binary search),动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),字符串处理(strings),双指针算法(two pointers)\n[problem:CodeForces-1548A] Web of Lies暴力枚举(brute force),图论(graphs),贪心策略(greedy)\n[problem:CodeForces-295A] Greg and Array数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1519C] Berland Regional暴力枚举(brute force),数据结构(data structures),贪心策略(greedy),数论(number theory),排序算法(sortings)\n[problem:CodeForces-1692G] 2^Sort数据结构(data structures),动态规划(dp),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1312C] Adding Powers位掩码(bitmasks),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory),三分搜索(ternary search)\n[problem:CodeForces-1095C] Powers Of Two位掩码(bitmasks),贪心策略(greedy)\n[problem:CodeForces-1701C] Schedule Management二分搜索(binary search),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-448B] Suffix Structures实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1634B] Fortune Telling位掩码(bitmasks),数学(math)\n[problem:CodeForces-1303B] National Project数学(math)\n[problem:CodeForces-1320A] Journey Planning数据结构(data structures),动态规划(dp),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1579D] Productive Meeting构造算法(constructive algorithms),图论(graphs),贪心策略(greedy)\n[problem:CodeForces-1451C] String Equality动态规划(dp),贪心策略(greedy),哈希表(hashing),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1628A] Meximum Array二分搜索(binary search),构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1714E] Add Modulo 10暴力枚举(brute force),数学(math),数论(number theory)\n[problem:CodeForces-1691C] Sum of Substrings暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy),数学(math),字符串处理(strings)\n[problem:CodeForces-650A] Watchmen数据结构(data structures),计算几何(geometry),数学(math)\n[problem:CodeForces-1728C] Digital Logarithm数据结构(data structures),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1443C] The Delivery Dilemma二分搜索(binary search),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1772D] Absolute Sorting构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-1108D] Diverse Garland构造算法(constructive algorithms),动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1452B] Toy Blocks二分搜索(binary search),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1706C] Qpwoeirut And The City动态规划(dp),流(flows),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1380B] Universal Solution贪心策略(greedy)\n[problem:CodeForces-1748B] Diverse Substrings暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-1573B] Swaps贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1790E] Vlad and a Pair of Numbers位掩码(bitmasks),构造算法(constructive algorithms)\n[problem:CodeForces-1682C] LIS or Reverse LIS?构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-260A] Adding Digits实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1627C] Not Assigning构造算法(constructive algorithms),深度优先搜索及其变种(dfs and similar),数论(number theory),树形结构(trees)\n[problem:CodeForces-1494B] Berland Crossword位掩码(bitmasks),暴力枚举(brute force),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1697C] awoo\u0027s Favorite Problem二分搜索(binary search),构造算法(constructive algorithms),数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),字符串处理(strings),双指针算法(two pointers)\n[problem:CodeForces-1330B] Dreamoon Likes Permutations实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1606C] Banknotes贪心策略(greedy),数论(number theory)\n[problem:CodeForces-1513B] AND Sequences位掩码(bitmasks),组合数学(combinatorics),构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-492C] Vanya and Exams贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1540A] Great Graphs构造算法(constructive algorithms),图论(graphs),贪心策略(greedy),最短路算法(shortest paths),排序算法(sortings)\n[problem:CodeForces-1183C] Computer Game二分搜索(binary search),数学(math)\n[problem:CodeForces-1270C] Make Good位掩码(bitmasks),构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-1197C] Array Splitting贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-437C] The Child and Toy图论(graphs),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1932C] LR-remainders暴力枚举(brute force),数据结构(data structures),实现问题,编程技巧,模拟(implementation),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1838C] No Prime Differences构造算法(constructive algorithms),数学(math),数论(number theory)\n[problem:CodeForces-1644C] Increase Subarray Sums暴力枚举(brute force),动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1263C] Everyone is a Winner!二分搜索(binary search),数学(math),meet-in-the-middle算法(meet-in-the-middle),数论(number theory)\n[problem:CodeForces-1845C] Strong Password二分搜索(binary search),动态规划(dp),贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1749C] Number Game二分搜索(binary search),数据结构(data structures),博弈论(games),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1183D] Candy Box 贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1837D] Bracket Coloring构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1654C] Alice and the Cake数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1453B] Suffix Operations构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1931E] Anna and the Valentine\u0027s Day Gift博弈论(games),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-987C] Three displays暴力枚举(brute force),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-363C] Fixing Typos贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1517C] Fillomino 2构造算法(constructive algorithms),深度优先搜索及其变种(dfs and similar),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1929C] Sasha and the Casino二分搜索(binary search),暴力枚举(brute force),构造算法(constructive algorithms),博弈论(games),贪心策略(greedy),数学(math)\n[problem:CodeForces-493B] Vasya and Wrestling实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1705C] Mark and His Unfinished Essay暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1721C] Min-Max Array Transformation二分搜索(binary search),贪心策略(greedy),双指针算法(two pointers)\n[problem:CodeForces-1292A] NEKO\u0027s Maze Game数据结构(data structures),并查集(dsu),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1758C] Almost All Multiples贪心策略(greedy),数论(number theory)\n[problem:CodeForces-1923C] Find B构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1719C] Fighting Tournament二分搜索(binary search),数据结构(data structures),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-1256B] Minimize the Permutation贪心策略(greedy)\n[problem:CodeForces-1771B] Hossam and Friends二分搜索(binary search),构造算法(constructive algorithms),动态规划(dp),双指针算法(two pointers)\n[problem:CodeForces-1840D] Wooden Toy Festival二分搜索(binary search),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1833D] Flipper暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1421C] Palindromifier构造算法(constructive algorithms),字符串处理(strings)\n[problem:CodeForces-1918C] XOR-distance位掩码(bitmasks),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1461B] Find the Spruce暴力枚举(brute force),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1860C] Game on Permutation数据结构(data structures),动态规划(dp),博弈论(games),贪心策略(greedy)\n[problem:CodeForces-1830A] Copil Copac Draws Trees深度优先搜索及其变种(dfs and similar),动态规划(dp),图论(graphs),树形结构(trees)\n[problem:CodeForces-679A] Bear and Prime 100构造算法(constructive algorithms),交互性问题(interactive),数学(math)\n[problem:CodeForces-1927E] Klever Permutation构造算法(constructive algorithms),数学(math),双指针算法(two pointers)\n[problem:CodeForces-1847C] Vampiric Powers,anyone?位掩码(bitmasks),暴力枚举(brute force),动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-505B] Mr. Kitayuta\u0027s Colorful Graph深度优先搜索及其变种(dfs and similar),动态规划(dp),并查集(dsu),图论(graphs)\n[problem:CodeForces-445B] DZY Loves Chemistry深度优先搜索及其变种(dfs and similar),并查集(dsu),贪心策略(greedy)\n[problem:CodeForces-1215B] The Number of Products组合数学(combinatorics),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1276A] As Simple as One and Two动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1684C] Column Swapping暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1759D] Make It Round暴力枚举(brute force),数论(number theory)\n[problem:CodeForces-1805C] Place for a Selfie二分搜索(binary search),数据结构(data structures),计算几何(geometry),数学(math)\n[problem:CodeForces-1907D] Jumping Through Segments二分搜索(binary search),构造算法(constructive algorithms)\n[problem:CodeForces-1648A] Weird Sum组合数学(combinatorics),数据结构(data structures),计算几何(geometry),数学(math),矩阵(matrices),排序算法(sortings)\n[problem:CodeForces-1955D] Inaccurate Subsequence Search数据结构(data structures),双指针算法(two pointers)\n[problem:CodeForces-1844D] Row Major构造算法(constructive algorithms),贪心策略(greedy),数学(math),数论(number theory),字符串处理(strings)\n[problem:CodeForces-1279C] Stack of Presents数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-388A] Fox and Box Accumulation贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1696C] Fishingprince Plays With Array构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1228B] Filling the Grid实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1893A] Anonymous Informant暴力枚举(brute force),深度优先搜索及其变种(dfs and similar),图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1143C] Queen深度优先搜索及其变种(dfs and similar),树形结构(trees)\n[problem:CodeForces-1263B] PIN Codes贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1316B] String Modification暴力枚举(brute force),构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),排序算法(sortings),字符串处理(strings)\n[problem:CodeForces-1905C] Largest Subsequence贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1253B] Silly Mistake贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1878E] Iva \u0026 Pav二分搜索(binary search),位掩码(bitmasks),数据结构(data structures),贪心策略(greedy)\n[problem:CodeForces-1824A] LuoTianyi and the Show贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1251B] Binary Palindromes贪心策略(greedy),字符串处理(strings)\n[problem:CodeForces-1875C] Jellyfish and Green Apple位掩码(bitmasks),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-315A] Sereja and Bottles暴力枚举(brute force)\n[problem:CodeForces-1427B] Chess Cheater贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1415C] Bouncing Ball暴力枚举(brute force),动态规划(dp),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-131C] The World is a Theatre组合数学(combinatorics),数学(math)\n[problem:CodeForces-1901C] Add,Divide and Floor构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-1284B] New Year and Ascent Sequence二分搜索(binary search),组合数学(combinatorics),数据结构(data structures),动态规划(dp),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1110B] Tape贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1740C] Bricks and Bags构造算法(constructive algorithms),博弈论(games),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-1167B] Lost Numbers暴力枚举(brute force),分治算法(divide and conquer),交互性问题(interactive),数学(math)\n[problem:CodeForces-1904C] Array Game二分搜索(binary search),暴力枚举(brute force),数据结构(data structures),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-602B] Approximating a Constant Range动态规划(dp),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-253B] Physics Practical二分搜索(binary search),动态规划(dp),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1189C] Candies!数据结构(data structures),动态规划(dp),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1903C] Theofanis\u0027 Nightmare构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-152C] Pocket Book组合数学(combinatorics)\n[problem:CodeForces-1154C] Gourmet Cat实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1102B] Array K-Coloring贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-797B] Odd sum动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-81A] Plug-in实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1895C] Torn Lucky Ticket暴力枚举(brute force),动态规划(dp),哈希表(hashing),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1144D] Equalize Them All构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-1009B] Minimum Ternary String贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-988C] Equal Sums实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1909C] Heavy Intervals构造算法(constructive algorithms),数据结构(data structures),并查集(dsu),贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1679C] Rooks Defenders数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-534B] Covered Path动态规划(dp),贪心策略(greedy),数学(math)\n[problem:CodeForces-757B] Bash\u0027s Big Day贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1091C] New Year and the Sphere Transmission数学(math),数论(number theory)\n[problem:CodeForces-1408B] Arrays Sum构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-1932D] Card Game贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1200C] Round Corridor数学(math),数论(number theory)\n[problem:CodeForces-1103A] Grid game构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1735C] Phase Shift深度优先搜索及其变种(dfs and similar),并查集(dsu),图论(graphs),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-804B] Minimum number of steps组合数学(combinatorics),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1670C] Where is the Pizza?数据结构(data structures),深度优先搜索及其变种(dfs and similar),并查集(dsu),图论(graphs),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1131B] Draw!贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1609C] Complex Market Analysis二分搜索(binary search),动态规划(dp),实现问题,编程技巧,模拟(implementation),数论(number theory),调度算法(schedules),双指针算法(two pointers)\n[problem:CodeForces-975C] Valhalla Siege二分搜索(binary search)\n[problem:CodeForces-1066C] Books Queries实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1266C] Diverse Matrix构造算法(constructive algorithms),贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1750C] Complementary XOR构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-978E] Bus Video System组合数学(combinatorics),数学(math)\n[problem:CodeForces-525B] Pasha and String构造算法(constructive algorithms),贪心策略(greedy),数学(math),字符串处理(strings)\n[problem:CodeForces-1761C] Set Construction构造算法(constructive algorithms),深度优先搜索及其变种(dfs and similar),图论(graphs),贪心策略(greedy)\n[problem:CodeForces-1190A] Tokitsukaze and Discard Items实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-337B] Routine Problem贪心策略(greedy),数学(math),数论(number theory)\n[problem:CodeForces-1764C] Doremy\u0027s City Construction图论(graphs),贪心策略(greedy)\n[problem:CodeForces-920C] Swap Adjacent Elements深度优先搜索及其变种(dfs and similar),贪心策略(greedy),数学(math),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1863D] Two-Colored Dominoes构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-158C] Cd and pwd commands*special problem,数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1951C] Ticket Hoarding贪心策略(greedy),数学(math),排序算法(sortings)\n[problem:CodeForces-1762C] Binary Strings are Fun组合数学(combinatorics),数学(math)\n[problem:CodeForces-940B] Our Tanya is Crying Out Loud动态规划(dp),贪心策略(greedy)\n[problem:CodeForces-1214A] Optimal Currency Exchange暴力枚举(brute force),数学(math)\n[problem:CodeForces-416A] Guess a number!贪心策略(greedy),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-1896C] Matching Arrays二分搜索(binary search),构造算法(constructive algorithms),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-710B] Optimal Point on a Line暴力枚举(brute force),排序算法(sortings)\n[problem:CodeForces-799B] T-shirt buying数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-711B] Chris and Magic Square构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-719B] Anatoly and Cockroaches贪心策略(greedy)\n[problem:CodeForces-1097C] Yuhao and a Parenthesis贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-713A] Sonya and Queries数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1130C] Connect暴力枚举(brute force),深度优先搜索及其变种(dfs and similar),并查集(dsu)\n[problem:CodeForces-548B] Mike and Fun暴力枚举(brute force),动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-604B] More Cowbell二分搜索(binary search),贪心策略(greedy)\n[problem:CodeForces-475B] Strongly Connected City暴力枚举(brute force),深度优先搜索及其变种(dfs and similar),图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1351C] Skier数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1883F] You Are So Beautiful数据结构(data structures)\n[problem:CodeForces-1156A] Inscribed Figures计算几何(geometry)\n[problem:CodeForces-485A] Factory实现问题,编程技巧,模拟(implementation),数学(math),矩阵(matrices)\n[problem:CodeForces-888C] K-Dominant Character二分搜索(binary search),实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-357B] Flag Day构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1088C] Ehab and a 2-operation task构造算法(constructive algorithms),贪心策略(greedy),数学(math)\n[problem:CodeForces-544B] Sea and Islands构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-182D] Common Divisors暴力枚举(brute force),哈希表(hashing),实现问题,编程技巧,模拟(implementation),数学(math),字符串处理(strings)\n[problem:CodeForces-518B] Tanya and Postcard贪心策略(greedy),实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-962C] Make a Square暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-359B] Permutation构造算法(constructive algorithms),动态规划(dp),数学(math)\n[problem:CodeForces-358A] Dima and Continuous Line暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-150A] Win or Freeze博弈论(games),数学(math),数论(number theory)\n[problem:CodeForces-479B] Towers暴力枚举(brute force),构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-677B] Vanya and Food Processor实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-699B] One Bomb实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-612C] Replace To Make Regular Bracket Sequence数据结构(data structures),表达式解析(expression parsing),数学(math)\n[problem:CodeForces-762B] USB vs. PS/2贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings),双指针算法(two pointers)\n[problem:CodeForces-1004C] Sonya and Robots构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1468C] Berpizza数据结构(data structures),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-233B] Non-square Equation二分搜索(binary search),暴力枚举(brute force),数学(math)\n[problem:CodeForces-675B] Restoring Painting暴力枚举(brute force),构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-581C] Developing Skills实现问题,编程技巧,模拟(implementation),数学(math),排序算法(sortings)\n[problem:CodeForces-1061B] Views Matter贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-1866B] Battling with Numbers组合数学(combinatorics),数学(math),数论(number theory)\n[problem:CodeForces-954B] String Typing实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-538A] Cutting Banner暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-180C] Letter动态规划(dp)\n[problem:CodeForces-995B] Suit and Tie贪心策略(greedy),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-911C] Three Garlands暴力枚举(brute force),构造算法(constructive algorithms)\n[problem:CodeForces-441B] Valera and Fruits贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-727C] Guess the Array构造算法(constructive algorithms),交互性问题(interactive),数学(math)\n[problem:CodeForces-937B] Vile Grasshoppers暴力枚举(brute force),数学(math),数论(number theory)\n[problem:CodeForces-79B] Colorful Field实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-614B] Gena\u0027s Code实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-435B] Pasha Maximizes贪心策略(greedy)\n[problem:CodeForces-934A] A Compatible Pair暴力枚举(brute force),博弈论(games)\n[problem:CodeForces-1068A] Birthday数学(math)\n[problem:CodeForces-379C] New Year Ratings Change贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-284A] Cows and Primitive Roots实现问题,编程技巧,模拟(implementation),数学(math),数论(number theory)\n[problem:CodeForces-1425A] Arena of Greed博弈论(games),贪心策略(greedy)\n[problem:CodeForces-472C] Design Tutorial: Make It Nondeterministic贪心策略(greedy)\n[problem:CodeForces-1505C] Fibonacci Words*special problem,实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-369B] Valera and Contest构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-808C] Tea Party构造算法(constructive algorithms),贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-205B] Little Elephant and Sorting暴力枚举(brute force),贪心策略(greedy)\n[problem:CodeForces-1162B] Double Matrix暴力枚举(brute force),贪心策略(greedy)\n[problem:CodeForces-219B] Special Offer! Super Price 999 Bourles!实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-697B] Barnicle暴力枚举(brute force),实现问题,编程技巧,模拟(implementation),数学(math),字符串处理(strings)\n[problem:CodeForces-703B] Mishka and trip实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-203C] Photographer贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-843A] Sorting by Subsequences深度优先搜索及其变种(dfs and similar),并查集(dsu),实现问题,编程技巧,模拟(implementation),数学(math),排序算法(sortings)\n[problem:CodeForces-994B] Knights of a Polygonal Table贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-313C] Ilya and Matrix构造算法(constructive algorithms),贪心策略(greedy),实现问题,编程技巧,模拟(implementation),排序算法(sortings)\n[problem:CodeForces-279A] Point on Spiral暴力枚举(brute force),计算几何(geometry),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-851B] Arpa and an exam about geometry计算几何(geometry),数学(math)\n[problem:CodeForces-961C] Chessboard位掩码(bitmasks),暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-248B] Chilly Willy数学(math),数论(number theory)\n[problem:CodeForces-689A] Mike and Cellphone暴力枚举(brute force),构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1425F] Flamingoes of Mystery交互性问题(interactive)\n[problem:CodeForces-898C] Phone Numbers实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-981C] Useful Decomposition实现问题,编程技巧,模拟(implementation),树形结构(trees)\n[problem:CodeForces-141B] Hopscotch计算几何(geometry),数学(math)\n[problem:CodeForces-261A] Maxim and Discounts贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-107A] Dorm Water Supply深度优先搜索及其变种(dfs and similar),图论(graphs)\n[problem:CodeForces-44E] Anfisa the Monkey动态规划(dp)\n[problem:CodeForces-24A] Ring road图论(graphs)\n[problem:CodeForces-803A] Maximal Binary Matrix构造算法(constructive algorithms)\n[problem:CodeForces-630H] Benches组合数学(combinatorics),数学(math)\n[problem:CodeForces-955B] Not simply beatiful strings实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1773E] Easy Assembly贪心策略(greedy),排序算法(sortings)\n[problem:CodeForces-111A] Petya and Inequiations贪心策略(greedy)\n[problem:CodeForces-417C] Football构造算法(constructive algorithms),图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-652A] Gabriel and Caterpillar实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-748C] Santa Claus and Robot构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-197B] Limit数学(math)\n[problem:CodeForces-526B] Om Nom and Dark Park深度优先搜索及其变种(dfs and similar),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-60B] Serial Time!深度优先搜索及其变种(dfs and similar),并查集(dsu)\n[problem:CodeForces-802J] Send the Fool Further! 深度优先搜索及其变种(dfs and similar),图论(graphs),树形结构(trees)\n[problem:CodeForces-865A] Save the problem!构造算法(constructive algorithms)\n[problem:CodeForces-270B] Multithreading数据结构(data structures),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-198B] Jumping on Walls最短路算法(shortest paths)\n[problem:CodeForces-8B] Obsession with Robots构造算法(constructive algorithms),图论(graphs),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1250A] Berstagram实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-907B] Tic-Tac-Toe实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-272B] Dima and Sequence实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-226A] Flying Saucer Segments数学(math)\n[problem:CodeForces-632B] Alice,Bob,Two Teams暴力枚举(brute force),构造算法(constructive algorithms)\n[problem:CodeForces-41B] Martian Dollar暴力枚举(brute force)\n[problem:CodeForces-1600J] Robot Factory位掩码(bitmasks),深度优先搜索及其变种(dfs and similar)\n[problem:CodeForces-124B] Permutations暴力枚举(brute force),组合数学(combinatorics),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-641B] Little Artem and Matrix实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-745B] Hongcow Solves A Puzzle实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-402B] Trees in a Row暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-868B] Race Against Time实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-430B] Balls Game暴力枚举(brute force),双指针算法(two pointers)\n[problem:CodeForces-334B] Eight Point Sets排序算法(sortings)\n[problem:CodeForces-120F] Spiders动态规划(dp),贪心策略(greedy),树形结构(trees)\n[problem:CodeForces-665B] Shopping暴力枚举(brute force)\n[problem:CodeForces-630L] Cracking the Code实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-228B] Two Tables暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-30A] Accounting暴力枚举(brute force),数学(math)\n[problem:CodeForces-245E] Mishap in Club贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-286A] Lucky Permutation构造算法(constructive algorithms),数学(math)\n[problem:CodeForces-436B] Om Nom and Spiders实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-1046C] Space Formula贪心策略(greedy)\n[problem:CodeForces-290A] Mysterious strings*special problem,实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-159C] String Manipulation 1.0*special problem,二分搜索(binary search),暴力枚举(brute force),数据结构(data structures),字符串处理(strings)\n[problem:CodeForces-42A] Guilty --- to the kitchen!贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1046F] Splitting money实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-120E] Put Knight!博弈论(games),数学(math)\n[problem:CodeForces-125A] Measuring Lengths in Baden数学(math)\n[problem:CodeForces-19A] World Football Cup实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-335A] Banana二分搜索(binary search),构造算法(constructive algorithms),贪心策略(greedy)\n[problem:CodeForces-929A] Прокат велосипедов*special problem,贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-928B] Chat*special problem,动态规划(dp)\n[problem:CodeForces-523C] Name Quest*special problem,贪心策略(greedy)\n[problem:CodeForces-159A] Friends or Not*special problem,贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-637C] Promocodes with Mistakes*special problem,暴力枚举(brute force),构造算法(constructive algorithms),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-108B] Datatypes数学(math),排序算法(sortings)\n[problem:CodeForces-175A] Robot Bicorn Attack暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-413C] Jeopardy!贪心策略(greedy),数学(math)\n[problem:CodeForces-45I] TCMCF+++贪心策略(greedy)\n[problem:CodeForces-174B] File List动态规划(dp),贪心策略(greedy),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-386B] Fly,freebies,fly!二分搜索(binary search),暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-38C] Blinds暴力枚举(brute force)\n[problem:CodeForces-120D] Three Sons暴力枚举(brute force)\n[problem:CodeForces-290D] Orange*special problem,实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1057B] DDoS*special problem,暴力枚举(brute force)\n[problem:CodeForces-417B] Crash实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-77A] Heroes暴力枚举(brute force),实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-770D] Draw Brackets!*special problem,实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-175B] Plane of Tanks: Pro实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1346B] Boot Camp*special problem,贪心策略(greedy)\n[problem:CodeForces-1431B] Polycarp and the Language of Gods*special problem,实现问题,编程技巧,模拟(implementation),双指针算法(two pointers)\n[problem:CodeForces-838A] Binary Blocks暴力枚举(brute force)\n[problem:CodeForces-1001B] Generate Bell state*special problem\n[problem:CodeForces-1001D] Distinguish plus state and minus state*special problem\n[problem:CodeForces-470A] Crystal Ball Sequence*special problem,实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-1001C] Generate GHZ state*special problem\n[problem:CodeForces-1001G] Oracle for f \u003d k-th element of x*special problem\n[problem:CodeForces-649B] Этажи构造算法(constructive algorithms)\n[problem:CodeForces-130B] Gnikool Ssalg*special problem,实现问题,编程技巧,模拟(implementation),字符串处理(strings)\n[problem:CodeForces-100C] A+B*special problem,实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-188E] HQ9+*special problem,实现问题,编程技巧,模拟(implementation)\n[problem:CodeForces-188C] LCM*special problem,实现问题,编程技巧,模拟(implementation),数学(math)\n[problem:CodeForces-683D] Chocolate Bar*special problem,数学(math)\n[problem:CodeForces-188F] Binary Notation*special problem,实现问题,编程技巧,模拟(implementation)\n","threadId":190417,"likeCnt":0,"createTime":1713879492000,"isWorkbook":true,"viewCnt":18,"openness":2,"fav":false,"id":4921,"trustable":false}