Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"CodeForces-20B\":[\"Equation\",4114,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/20\\\"\\u003eCodeforces Alpha Round 20 (Codeforces format)\\u003c/a\\u003e\"],\"UVA-12389\":[\"Cybercrime Donut Investigation\",57,null],\"CodeForces-68C\":[\"Synchrophasotron\",326,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/68\\\"\\u003eCodeforces Beta Round 62\\u003c/a\\u003e\"],\"SPOJ-ALLIN1\":[\"All in One\",210,\"\"],\"CodeForces-68B\":[\"Energy exchange\",4950,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/68\\\"\\u003eCodeforces Beta Round 62\\u003c/a\\u003e\"],\"CodeForces-68D\":[\"Half-decay tree\",486,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/68\\\"\\u003eCodeforces Beta Round 62\\u003c/a\\u003e\"],\"CodeForces-68A\":[\"Irrational problem\",5160,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/68\\\"\\u003eCodeforces Beta Round 62\\u003c/a\\u003e\"],\"UVALive-3850\":[\"Here We Go(relians) Again\",95,\"Regionals 2007 \\u003e\\u003e North America - Mid-Central USA\"],\"CodeForces-739C\":[\"Alyona and towers\",1519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/739\\\"\\u003eCodeforces Round 381 (Div. 1)\\u003c/a\\u003e\"],\"UVA-811\":[\"The Fortified Forest\",678,null],\"CodeForces-605C\":[\"Freelancer\\u0027s Dreams\",1139,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/605\\\"\\u003eCodeforces Round 335 (Div. 1)\\u003c/a\\u003e\"],\"Gym-100923B\":[\"Por Costel and the Algorithm\",258,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100923\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 ACM National Contest Romania - Round 1\\u003c/a\\u003e\"],\"SPOJ-ADAINDEX\":[\"Ada and Indexing\",2489,\"\"],\"SPOJ-KNMOVE\":[\"Knight Move\",616,\"Own Problem\"],\"UVA-11060\":[\"Beverages\",4816,null],\"UVA-1142\":[\"Fighting the Heat\",69,null],\"Gym-100923D\":[\"Por Costel and the Censorship Committee\",71,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100923\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 ACM National Contest Romania - Round 1\\u003c/a\\u003e\"],\"SPOJ-TWOPATHS\":[\"Two Paths\",259,\"Codeforces round 14 with larger limits\"],\"Gym-100923C\":[\"Por Costel and Bujor\",121,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100923\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 ACM National Contest Romania - Round 1\\u003c/a\\u003e\"],\"CodeForces-21D\":[\"Traveling Graph\",882,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/21\\\"\\u003eCodeforces Alpha Round 21 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-21C\":[\"Stripe 2\",2393,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/21\\\"\\u003eCodeforces Alpha Round 21 (Codeforces format)\\u003c/a\\u003e\"],\"UVA-12378\":[\"Ball Blasting Game\",248,null],\"UVA-10198\":[\"Counting\",4721,null],\"CodeForces-69D\":[\"Dot\",1034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/69\\\"\\u003eCodeforces Beta Round 63 (Div. 2)\\u003c/a\\u003e\"],\"UVA-10196\":[\"Check The Check\",5134,null],\"SPOJ-MKEQUAL\":[\"Make them equal !\",2231,\"Own\"],\"CodeForces-69E\":[\"Subsegments\",4356,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/69\\\"\\u003eCodeforces Beta Round 63 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-21A\":[\"Jabber ID\",2024,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/21\\\"\\u003eCodeforces Alpha Round 21 (Codeforces format)\\u003c/a\\u003e\"],\"SPOJ-FUNNUMS\":[\"FUN WITH LETTERS\",231,\"\"],\"CodeForces-822C\":[\"Hacker, pack your bags!\",4852,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/822\\\"\\u003eCodeforces Round 422 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-822B\":[\"Crossword solving\",10220,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/822\\\"\\u003eCodeforces Round 422 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-822D\":[\"My pretty girl Noora\",3082,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/822\\\"\\u003eCodeforces Round 422 (Div. 2)\\u003c/a\\u003e\"],\"UVA-13215\":[\"Polygonal Park\",178,null],\"UVA-13214\":[\"The Robot\\u0027s Grid\",97,null],\"UVA-13213\":[\"Quidditch Match\",21,null],\"UVA-13212\":[\"How many inversions?\",407,null],\"CodeForces-66A\":[\"Petya and Java\",6954,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/66\\\"\\u003eCodeforces Beta Round 61 (Div. 2)\\u003c/a\\u003e\"],\"UVA-13211\":[\"Geonosis\",81,null],\"UVA-12363\":[\"Hedge Mazes\",683,null],\"UVA-10183\":[\"How Many Fibs?\",6259,null],\"SPOJ-BTCODE_H\":[\"Trie Expectation\",171,\"Bytecode 2011, NIT Trichy, India\"],\"CodeForces-66B\":[\"Petya and Countryside\",20144,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/66\\\"\\u003eCodeforces Beta Round 61 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-BTCODE_G\":[\"Coloring Trees\",348,\"Bytecode 2011, NIT Trichy, India\"],\"SPOJ-CDRSANJ\":[\"CODER FIRST PROBLEM\",1880,\"\"],\"UVA-11038\":[\"How Many O\\u0027s?\",1676,null],\"UVALive-2542\":[\"Polar Explorer\",169,\"Regionals 2002 \\u003e\\u003e North America - South Central USA\"],\"SPOJ-PR003004\":[\"Digit Sum\",3226,\"BAPC\"],\"CodeForces-869E\":[\"The Untended Antiquity\",1677,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/869\\\"\\u003eCodeforces Round 439 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-821D\":[\"Okabe and City\",1578,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/821\\\"\\u003eCodeforces Round 420 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-821C\":[\"Okabe and Boxes\",7581,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/821\\\"\\u003eCodeforces Round 420 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-821E\":[\"Okabe and El Psy Kongroo\",1599,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/821\\\"\\u003eCodeforces Round 420 (Div. 2)\\u003c/a\\u003e\"],\"UVA-10192\":[\"Vacation\",9090,null],\"SPOJ-MULTQ3\":[\"Multiples of 3\",4483,\"own problem\"],\"SPOJ-PRMQUER\":[\"Prime queries\",498,\"Own\"],\"UVA-10178\":[\"Count the Faces.\",1206,null],\"SPOJ-CLOPPAIR\":[\"Closest Point Pair\",2020,\"Standard Problem\"],\"CodeChef-SHAIKHGN\":[\"Funny gnomes\",380,\"na2a\"],\"SPOJ-NITTROAD\":[\"Roads of NITT\",677,\"That would be me.\"],\"CodeForces-67A\":[\"Partial Teacher\",2280,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/67\\\"\\u003eManthan 2011\\u003c/a\\u003e\"],\"CodeForces-67D\":[\"Optical Experiment\",1507,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/67\\\"\\u003eManthan 2011\\u003c/a\\u003e\"],\"CodeForces-67C\":[\"Sequence of Balls\",694,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/67\\\"\\u003eManthan 2011\\u003c/a\\u003e\"],\"UVA-13209\":[\"My Password is a Palindromic Prime Number\",124,null],\"UVA-13208\":[\"Drought In Nlogonia\",62,null],\"UVA-13207\":[\"AirCraft: Monster\",52,null],\"SPOJ-ADARAIN\":[\"Ada and Rain\",424,\"\"],\"UVA-12359\":[\"Diccionário Portuñol\",163,null],\"CodeForces-869B\":[\"The Eternal Immortality\",14215,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/869\\\"\\u003eCodeforces Round 439 (Div. 2)\\u003c/a\\u003e\"],\"UVA-1171\":[\"Board Games\",74,null],\"CodeForces-868C\":[\"Qualification Rounds\",4746,\"\\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\"],\"Gym-101242B\":[\"Branch Assignment\",382,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101242\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2016 ACM-ICPC World Finals\\u003c/a\\u003e\"],\"CodeForces-868E\":[\"Policeman and a Tree\",481,\"\\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-868D\":[\"Huge Strings\",927,\"\\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-735E\":[\"Ostap and Tree\",890,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/735\\\"\\u003eCodeforces Round 382 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-820B\":[\"Mister B and Angle in Polygon\",5429,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/820\\\"\\u003eCodeforces Round 421 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-868F\":[\"Yet Another Minimization Problem\",3753,\"\\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\"],\"SPOJ-MINMOVE\":[\"Minimum Rotations\",1023,\"Based on a problem from ACM Central European Programming Contest\"],\"CodeForces-820D\":[\"Mister B and PR Shifts\",79,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/820\\\"\\u003eCodeforces Round 421 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-BOGGLE\":[\"Boggle Scoring\",538,\"\"],\"SPOJ-MATHII\":[\"Yet Another Mathematical Problem\",58,\"ACM/ICPC Regional Contest, Chengdu 2012\"],\"UVA-1175\":[\"Ladies\\u0027 Choice\",427,null],\"SPOJ-FASTFLOW\":[\"Fast Maximum Flow\",3179,\"\"],\"CodeChef-ASTRING\":[\"Akhil And Random String\",638,\"amitpandeykgp\"],\"CodeForces-24B\":[\"F1 Champions\",1891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/24\\\"\\u003eCodeforces Beta Round 24\\u003c/a\\u003e\"],\"UVA-11099\":[\"Next Same-Factored\",388,null],\"CodeForces-24E\":[\"Berland collider\",940,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/24\\\"\\u003eCodeforces Beta Round 24\\u003c/a\\u003e\"],\"UVA-11096\":[\"Nails\",869,null],\"CodeForces-24D\":[\"Broken robot\",2110,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/24\\\"\\u003eCodeforces Beta Round 24\\u003c/a\\u003e\"],\"UVA-11097\":[\"Poor My Problem! :-(\",137,null],\"CodeForces-24A\":[\"Ring road\",5496,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/24\\\"\\u003eCodeforces Beta Round 24\\u003c/a\\u003e\"],\"UVALive-3415\":[\"Guardian of Decency\",562,\"Regionals 2005 \\u003e\\u003e Europe - Northwestern\"],\"CodeForces-828C\":[\"String Reconstruction\",141,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/828\\\"\\u003eCodeforces Round 423 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-913A\":[\"Modular Exponentiation\",22280,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/913\\\"\\u003eHello 2018\\u003c/a\\u003e\"],\"CodeForces-828B\":[\"Black Square\",6078,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/828\\\"\\u003eCodeforces Round 423 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-913B\":[\"Christmas Spruce\",16560,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/913\\\"\\u003eHello 2018\\u003c/a\\u003e\"],\"CodeForces-828D\":[\"High Load\",117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/828\\\"\\u003eCodeforces Round 423 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"SPOJ-KDOMINO\":[\"K-dominant array\",326,\"Me, MYSELF \\u0026 I\"],\"CodeForces-827F\":[\"Dirty Arkady\\u0027s Kitchen\",406,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/827\\\"\\u003eCodeforces Round 423 (Div. 1, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-912D\":[\"Fishes\",2115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/912\\\"\\u003eCodeforces Round 456 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-827E\":[\"Rusty String\",867,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/827\\\"\\u003eCodeforces Round 423 (Div. 1, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-912E\":[\"Prime Gift\",1603,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/912\\\"\\u003eCodeforces Round 456 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-912B\":[\"New Year\\u0027s Eve\",11794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/912\\\"\\u003eCodeforces Round 456 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-SNGPG\":[\"Prime Generator The Easiest Question Ever\",1176,\"Abhimanyu Singh My Problems\"],\"SPOJ-GONESORT\":[\"G-One Sort\",776,\"Own\"],\"Gym-101370A\":[\"Abelian Groups\",66,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101370\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2009-2010 Summer Petrozavodsk Camp, Petr Mitrichev Contest 5\\u003c/a\\u003e\"],\"UVA-13284\":[\"Macarons\",51,null],\"UVA-13282\":[\"Cakey McCakeFace\",81,null],\"SPOJ-ADASALES\":[\"Ada and Travelling Salesman\",211,\"\"],\"UVA-11089\":[\"Fi-binary Number\",1194,null],\"UVA-1118\":[\"Binary Stirling Numbers\",236,null],\"SPOJ-CIRU\":[\"The area of the union of circles\",627,\"https://www.spoj.pl/problems/VCIRCLES/\"],\"CodeForces-25D\":[\"Roads not only in Berland\",11463,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/25\\\"\\u003eCodeforces Beta Round 25 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-11087\":[\"Divisibility Testing\",358,null],\"UVALive-2559\":[\"Number Base Conversion\",102,\"Regionals 2002 \\u003e\\u003e North America - Greater NY\"],\"CodeForces-25C\":[\"Roads in Berland\",6713,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/25\\\"\\u003eCodeforces Beta Round 25 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-11085\":[\"Back to the 8-Queens\",4513,null],\"SPOJ-ILKQUERY\":[\"I LOVE Kd-TREES\",228,\"My own\"],\"CodeForces-912A\":[\"Tricky Alchemy\",14464,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/912\\\"\\u003eCodeforces Round 456 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-RANGESUM\":[\"Range Sum\",1584,\"\"],\"HackerRank-jeanies-route\":[\"Jeanie\\u0027s Route\",86,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/101hack35\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e101hack35\\u003c/a\\u003e\"],\"CodeForces-911C\":[\"Three Garlands\",7388,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-911D\":[\"Inversion Counting\",4791,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADAJOBS\":[\"Ada and Jobs\",182,\"\"],\"CodeForces-911B\":[\"Two Cakes\",11707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-PUCMM025\":[\"Divisor Digits\",1280,\"Used in 2da Olimpiada de Programacion PUCMM-ACM-ISC (fase 2)\"],\"SPOJ-LKS\":[\"Large Knapsack\",2572,\"\"],\"CodeForces-911G\":[\"Mass Change Queries\",2700,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-911E\":[\"Stack Sorting\",2652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-911F\":[\"Tree Destruction\",1640,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/911\\\"\\u003eEducational Codeforces Round 35 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UVA-11093\":[\"Just Finish it up\",2814,null],\"CodeForces-22E\":[\"Scheme\",1745,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/22\\\"\\u003eCodeforces Beta Round 22 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-22D\":[\"Segments\",2799,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/22\\\"\\u003eCodeforces Beta Round 22 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-13257\":[\"License Plates\",198,null],\"SPOJ-TRYCOMP\":[\"Try to complete\",692,\"\"],\"SPOJ-ADAPOWER\":[\"Ada and Power\",63,\"\"],\"UVA-11076\":[\"Add Again\",1589,null],\"UVA-11077\":[\"Find the Permutations\",867,null],\"Gym-101020H\":[\"Weekend\",407,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101020\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 Syrian Private Universities Collegiate Programming Contest\\u003c/a\\u003e\"],\"CodeForces-22C\":[\"System Administrator\",3244,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/22\\\"\\u003eCodeforces Beta Round 22 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-11074\":[\"Draw Grid\",1409,null],\"SPOJ-RMID\":[\"Running Median\",1221,\"\"],\"SPOJ-BEHAPPY\":[\"Be Awesome As Barney Stinson\",1923,\"Inspired\"],\"SPOJ-ADAGAME\":[\"Ada and Game\",671,\"\"],\"CodeForces-825D\":[\"Suitable Replacement\",3414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-910B\":[\"Door Frames\",1997,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/910\\\"\\u003eTesting Round 14 (Unrated)\\u003c/a\\u003e\"],\"CodeForces-825C\":[\"Multi-judge Solving\",4757,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-910C\":[\"Minimum Sum\",2008,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/910\\\"\\u003eTesting Round 14 (Unrated)\\u003c/a\\u003e\"],\"CodeForces-3A\":[\"Shortest path of the king\",20670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/3\\\"\\u003eCodeforces Beta Round 3\\u003c/a\\u003e\"],\"CodeForces-825F\":[\"String Compression\",1468,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-3B\":[\"Lorry\",4504,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/3\\\"\\u003eCodeforces Beta Round 3\\u003c/a\\u003e\"],\"CodeForces-825E\":[\"Minimal Labels\",3309,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"CodeForces-910A\":[\"The Way to Home\",12990,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/910\\\"\\u003eTesting Round 14 (Unrated)\\u003c/a\\u003e\"],\"SPOJ-ADAQUEUE\":[\"Ada and Queue\",7270,\"\"],\"UVA-1123\":[\"Crazy Search\",247,null],\"UVA-11081\":[\"Strings\",530,null],\"CodeForces-3D\":[\"Least Cost Bracket Sequence\",3264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/3\\\"\\u003eCodeforces Beta Round 3\\u003c/a\\u003e\"],\"CodeForces-23E\":[\"Tree\",659,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/23\\\"\\u003eCodeforces Beta Round 23\\u003c/a\\u003e\"],\"UVA-13246\":[\"Chained Words\",20,null],\"UVA-1139\":[\"Stormy Versailles\",7,null],\"CodeForces-23C\":[\"Oranges and Apples\",1556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/23\\\"\\u003eCodeforces Beta Round 23\\u003c/a\\u003e\"],\"UVALive-5603\":[\"Graph Coloring\",38,\"Regionals 1995 \\u003e\\u003e Europe - Southwestern\"],\"SPOJ-COLOR_CC\":[\"Colors\",28,\"CodeCraft 13 , Author : Shubhanshu Agarwal\"],\"CodeForces-825B\":[\"Five-In-a-Row\",4700,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/825\\\"\\u003eEducational Codeforces Round 25\\u003c/a\\u003e\"],\"SPOJ-NTHPRIME\":[\"Nth Prime\",97,\"Own Problem\"],\"SPOJ-ADAGROW\":[\"Ada and Replant\",26,\"\"],\"UVA-11072\":[\"Points\",407,null],\"SPOJ-GAMEMVS\":[\"ShaatChara\",71,\"This problem was originally used in NHSPC National 2017, Bangladesh.\"],\"UVA-11070\":[\"The Good Old Times\",396,null],\"CodeForces-2B\":[\"The least round way\",10894,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/2\\\"\\u003eCodeforces Beta Round 2\\u003c/a\\u003e\"],\"CodeForces-120E\":[\"Put Knight!\",2868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-120F\":[\"Spiders\",3786,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-60A\":[\"Where Are My Flakes?\",3815,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/60\\\"\\u003eCodeforces Beta Round 56\\u003c/a\\u003e\"],\"CodeForces-120C\":[\"Winnie-the-Pooh and honey\",3839,\"\\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\",2043,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-120A\":[\"Elevator\",4648,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"CodeForces-120B\":[\"Quiz League\",3451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/120\\\"\\u003eSchool Regional Team Contest, Saratov, 2011\\u003c/a\\u003e\"],\"SPOJ-ADACROW\":[\"Ada and Scarecrow\",14,\"\"],\"SPOJ-EALP1\":[\"Enough of analyzing, let\\u0026#8217;s play\",263,\"Own Problem (Samir\\u0027s Contest 2 @Lightoj)\"],\"SPOJ-ADAMOLD\":[\"Ada and Mold\",173,\"\"],\"CodeChef-CNTPRIME\":[\"Counting Primes\",472,\"rccroshan1\"],\"SPOJ-ADADIG\":[\"Ada and Digits\",174,\"\"],\"CodeForces-60C\":[\"Mushroom Strife\",628,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/60\\\"\\u003eCodeforces Beta Round 56\\u003c/a\\u003e\"],\"SPOJ-YUMMY\":[\"Yummy Triangular Pizza\",467,\"ACM/ICPC Regional Contest, Shanghai 2011; Problem Setter: g201513\"],\"CodeForces-60B\":[\"Serial Time!\",5071,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/60\\\"\\u003eCodeforces Beta Round 56\\u003c/a\\u003e\"],\"CodeForces-60D\":[\"Savior\",452,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/60\\\"\\u003eCodeforces Beta Round 56\\u003c/a\\u003e\"],\"SPOJ-INGRED\":[\"Ingredients\",366,\"\"],\"CodeForces-916A\":[\"Jamie and Alarm Snooze\",9304,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/916\\\"\\u003eCodeforces Round 457 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-916D\":[\"Jamie and To-do List\",543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/916\\\"\\u003eCodeforces Round 457 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-916E\":[\"Jamie and Tree\",1644,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/916\\\"\\u003eCodeforces Round 457 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-GIVEAWAY\":[\"Give Away\",1381,\"\"],\"CodeForces-916B\":[\"Jamie and Binary Sequence (changed after round)\",1858,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/916\\\"\\u003eCodeforces Round 457 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-5622\":[\"Pushing Boxes\",12,\"Regionals 1997 \\u003e\\u003e Europe - Southwestern\"],\"CodeForces-916C\":[\"Jamie and Interesting Graph\",5320,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/916\\\"\\u003eCodeforces Round 457 (Div. 2)\\u003c/a\\u003e\"],\"Gym-101466E\":[\"Text Editor\",648,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101466\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 ACM-ICPC, Universidad Nacional de Colombia Programming Contest\\u003c/a\\u003e\"],\"CodeForces-915E\":[\"Physical Education Lessons\",4308,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UVA-423\":[\"MPI Maelstrom\",3701,null],\"SPOJ-GHOSTS\":[\"Ghosts having fun\",201,\"\"],\"CodeForces-915F\":[\"Imbalance Value of a Tree\",2445,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-MULTII\":[\"Yet Another Multiple Problem\",370,\"ACM/ICPC Regional Contest, Chengdu 2012\"],\"CodeForces-61D\":[\"Eternal Victory\",6917,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/61\\\"\\u003eCodeforces Beta Round 57 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-61C\":[\"Capture Valerian\",741,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/61\\\"\\u003eCodeforces Beta Round 57 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-61E\":[\"Enemy is weak\",10922,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/61\\\"\\u003eCodeforces Beta Round 57 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-915C\":[\"Permute Digits\",7607,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UVALive-4322\":[\"Destroying the bus stations\",188,\"Regionals 2008 \\u003e\\u003e Asia - Beijing\"],\"CodeForces-915D\":[\"Almost Acyclic Graph\",3660,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-915A\":[\"Garden\",15846,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-915B\":[\"Browser\",8262,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/915\\\"\\u003eEducational Codeforces Round 36 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-914F\":[\"Substrings in a String\",1595,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-914D\":[\"Bash and a Tough Math Puzzle\",5723,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeChef-PSHTTR\":[\"Pishty and tree\",1092,\"fekete\"],\"SPOJ-SOLVEIT\":[\"SOLVEIT\",580,\"\"],\"SPOJ-ADAPLANT\":[\"Ada and Plants\",422,\"\"],\"UVA-872\":[\"Ordering\",2946,null],\"SPOJ-DIVSEQ\":[\"DIVSEQ\",238,\"http://www.math.bas.bg/infos/files/2013-05-02-C1.pdf\"],\"Gym-100792G\":[\"Garden Gathering\",396,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100792\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015-2016 ACM-ICPC, NEERC, Moscow Subregional Contest\\u003c/a\\u003e\"],\"UVA-13288\":[\"Cordon Bleu\",33,null],\"UVA-13287\":[\"Shattered Cake\",1004,null],\"UVA-13286\":[\"Ingredients\",61,null],\"HackerRank-circular-palindromes\":[\"Circular Palindromes\",29,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/101hack35\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e101hack35\\u003c/a\\u003e\"],\"CodeForces-914B\":[\"Conan and Agasa play a Card Game\",9079,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-914C\":[\"Travelling Salesman and Special Numbers\",3919,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"SPOJ-NUMPLAY\":[\"Fun with numbers\",301,\"own problem\"],\"UVALive-7821\":[\"Elections\",132,\"Regionals 2016 \\u003e\\u003e Asia - Tehran\"],\"CodeForces-914A\":[\"Perfect Squares\",14400,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/914\\\"\\u003eCodecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"SPOJ-ADACROP\":[\"Ada and Harvest\",332,\"\"],\"CodeForces-913E\":[\"Logical Expression\",765,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/913\\\"\\u003eHello 2018\\u003c/a\\u003e\"],\"CodeForces-828F\":[\"Best Edge Weight\",11,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/828\\\"\\u003eCodeforces Round 423 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-913C\":[\"Party Lemonade\",8529,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/913\\\"\\u003eHello 2018\\u003c/a\\u003e\"],\"CodeForces-913D\":[\"Too Easy Problems\",4743,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/913\\\"\\u003eHello 2018\\u003c/a\\u003e\"],\"SPOJ-ADAMATCH\":[\"Ada and Nucleobase\",549,\"\"],\"SPOJ-ADAROBOT\":[\"Ada and CAPTCHA\",178,\"\"],\"CodeForces-124C\":[\"Prime Permutation\",157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/124\\\"\\u003eCodeforces Beta Round 92 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-MAY99_4\":[\"Rachu\",1040,\"Gunjit Agrawal\"],\"CodeForces-124D\":[\"Squares\",37,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/124\\\"\\u003eCodeforces Beta Round 92 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-MAY99_3\":[\"Easy Jug\",2211,\"\"],\"CodeForces-124B\":[\"Permutations\",4837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/124\\\"\\u003eCodeforces Beta Round 92 (Div. 2 Only)\\u003c/a\\u003e\"],\"LightOJ-1086\":[\"Jogging Trails\",516,null],\"SPOJ-SHLIGHTS\":[\"Shifting Lights\",227,\"\"],\"UVA-11931\":[\"Maze Escape\",92,null],\"UVA-10600\":[\"ACM Contest and Blackout\",5705,null],\"UVA-11932\":[\"Net Profit\",65,null],\"UVALive-3014\":[\"Reverse Assignment\",154,\"Regionals 2004 \\u003e\\u003e Asia - Dhaka\"],\"UVALive-6525\":[\"Attacking rooks\",422,\"Regionals 2013 \\u003e\\u003e Latin America\"],\"SPOJ-TSUM\":[\"Triple Sums\",661,\"own problem, used for a contest on codechef\"],\"UVA-11930\":[\"Rectangles\",157,null],\"SPOJ-PAIRDIV\":[\"Pair Divisible\",53,\"\"],\"CodeForces-123D\":[\"String\",1335,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/123\\\"\\u003eCodeforces Beta Round 92 (Div. 1 Only)\\u003c/a\\u003e\"],\"LightOJ-1096\":[\"nth Term\",1328,null],\"UVA-11925\":[\"Generating Permutations\",762,null],\"UVALive-3487\":[\"Duopoly\",104,\"Regionals 2005 \\u003e\\u003e Asia - Hangzhou\"],\"UVA-866\":[\"Intersecting Line Segments\",1046,null],\"SPOJ-ADACHESS\":[\"Ada and Chess\",38,\"\"],\"UVA-869\":[\"Airline Comparison\",1198,null],\"UVA-1198\":[\"The Geodetic Set Problem\",220,null],\"SPOJ-ADAPANEL\":[\"Ada and Panels\",55,\"\"],\"CodeForces-122C\":[\"Lucky Sum\",333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/122\\\"\\u003eCodeforces Beta Round 91 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-255E\":[\"Furlo and Rublo and Game\",874,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/255\\\"\\u003eCodeforces Round 156 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-122D\":[\"Lucky Transformation\",175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/122\\\"\\u003eCodeforces Beta Round 91 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-122A\":[\"Lucky Division\",123848,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/122\\\"\\u003eCodeforces Beta Round 91 (Div. 2 Only)\\u003c/a\\u003e\"],\"LightOJ-1061\":[\"N Queen Again\",382,null],\"CodeForces-122B\":[\"Lucky Substring\",12767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/122\\\"\\u003eCodeforces Beta Round 91 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-919C\":[\"Seat Arrangements\",9350,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/919\\\"\\u003eCodeforces Round 460 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-919D\":[\"Substring\",10030,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/919\\\"\\u003eCodeforces Round 460 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-919B\":[\"Perfect Number\",29134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/919\\\"\\u003eCodeforces Round 460 (Div. 2)\\u003c/a\\u003e\"],\"LightOJ-1068\":[\"Investigation\",3459,null],\"CodeForces-919E\":[\"Congruence Equation\",2012,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/919\\\"\\u003eCodeforces Round 460 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-919F\":[\"A Game With Numbers\",345,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/919\\\"\\u003eCodeforces Round 460 (Div. 2)\\u003c/a\\u003e\"],\"UVA-833\":[\"Water Falls\",1315,null],\"SPOJ-GCPC11A\":[\"Faculty Dividing Powers\",488,\"German Collegiate Programming Contest 2011 (Authors: Christopher Dennl and Thomas Fersch)\"],\"SPOJ-ADACHES2\":[\"Ada and Palaces\",196,\"\"],\"SPOJ-POCRI\":[\"Power Crisis\",452,\"\"],\"SPOJ-LCS2\":[\"Longest Common Substring II\",2821,\"\"],\"UVA-836\":[\"Largest Submatrix\",4104,null],\"SPOJ-LCS0\":[\"Longest Common Subsequence\",126,\"Folklore\"],\"SPOJ-ADACHERY\":[\"Ada and Cherry\",153,\"\"],\"CodeForces-691D\":[\"Swaps in Permutation\",5697,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/691\\\"\\u003eEducational Codeforces Round 14\\u003c/a\\u003e\"],\"SPOJ-ADATEAMS\":[\"Ada and Teams\",1020,\"\"],\"CodeForces-63D\":[\"Dividing Island\",1313,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/63\\\"\\u003eCodeforces Beta Round 59 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-121E\":[\"Lucky Array\",1958,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/121\\\"\\u003eCodeforces Beta Round 91 (Div. 1 Only)\\u003c/a\\u003e\"],\"LightOJ-1070\":[\"Algebraic Problem\",1113,null],\"LightOJ-1073\":[\"DNA Sequence\",333,null],\"LightOJ-1074\":[\"Extended Traffic\",2938,null],\"CodeForces-918B\":[\"Radio Station\",18357,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/918\\\"\\u003eCodeforces Round 459 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-918C\":[\"The Monster\",207,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/918\\\"\\u003eCodeforces Round 459 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-GCPC11J\":[\"Time to live\",2149,\"German Collegiate Programming Contest 2011 (Author: Tobias Werth)\"],\"CodeForces-918A\":[\"Eleven\",18033,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/918\\\"\\u003eCodeforces Round 459 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-CERC07C\":[\"Cell Phone\",171,\"Central European Programming Contest, Prague 2007\"],\"Gym-101597B\":[\"Triangle in a Triangle\",408,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101597\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM-ICPC-Swiss-Subregional 2017\\u003c/a\\u003e\"],\"CodeForces-918D\":[\"MADMAX\",55,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/918\\\"\\u003eCodeforces Round 459 (Div. 2)\\u003c/a\\u003e\"],\"Gym-101597A\":[\"Chess\",192,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101597\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM-ICPC-Swiss-Subregional 2017\\u003c/a\\u003e\"],\"UVA-11908\":[\"Skyscraper\",394,null],\"Gym-101597J\":[\"Box Hedge\",231,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101597\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM-ICPC-Swiss-Subregional 2017\\u003c/a\\u003e\"],\"SPOJ-ZIGZAG2\":[\"Zig when you zag\",31,\"\"],\"CodeChef-TWOCOINS\":[\"Two Coins\",395,\"admin3\"],\"CodeForces-63E\":[\"Sweets Game\",763,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/63\\\"\\u003eCodeforces Beta Round 59 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11851\":[\"Celebrity Split\",135,null],\"LightOJ-1160\":[\"Discovering Paths in Grid\",187,null],\"UVA-11858\":[\"Frosh Week\",1420,null],\"LightOJ-1162\":[\"Min Max Roads\",921,null],\"CodeForces-116D\":[\"Lawnmower\",67,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/116\\\"\\u003eCodeforces Beta Round 87 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-11859\":[\"Division Game\",457,null],\"CodeForces-116E\":[\"Plumber\",8,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/116\\\"\\u003eCodeforces Beta Round 87 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-116B\":[\"Little Pigs and Wolves\",14012,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/116\\\"\\u003eCodeforces Beta Round 87 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-10526\":[\"Intellectual Property\",166,null],\"CodeForces-116C\":[\"Party\",371,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/116\\\"\\u003eCodeforces Beta Round 87 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-10523\":[\"Very Easy !!!\",4594,null],\"SPOJ-ADAPLUS\":[\"Ada and Plus\",160,\"\"],\"UVA-11855\":[\"Buzzwords\",480,null],\"SPOJ-ENIGMATH\":[\"PLAY WITH MATH\",6942,\"\"],\"UVA-11852\":[\"Knight\\u0027s Trip\",99,null],\"UVALive-7785\":[\"m-ary Partitions\",50,\"Regionals 2016 \\u003e\\u003e North America - Greater NY\"],\"SPOJ-ARBITRAG\":[\"Arbitrage\",2265,\"University of Ulm Local Contest 1996\"],\"CodeForces-770C\":[\"Online Courses In BSU\",2884,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/770\\\"\\u003eVK Cup 2017 - Qualification 2\\u003c/a\\u003e\"],\"SPOJ-NARHIL\":[\"NARUTO AND HILLS\",48,\"Own\"],\"CodeForces-770B\":[\"Maximize Sum of Digits\",2869,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/770\\\"\\u003eVK Cup 2017 - Qualification 2\\u003c/a\\u003e\"],\"CodeChef-CHSTR\":[\"Chef and String\",983,\"antoniuk1\"],\"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\"],\"UVA-10990\":[\"Another New Function\",1653,null],\"CodeForces-115E\":[\"Linear Kingdom Races\",1507,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/115\\\"\\u003eCodeforces Beta Round 87 (Div. 1 Only)\\u003c/a\\u003e\"],\"LightOJ-1171\":[\"Knights in Chessboard (II)\",256,null],\"LightOJ-1174\":[\"Commandos\",3658,null],\"UVA-11843\":[\"Guessing Game\",164,null],\"UVA-10511\":[\"Councilling\",781,null],\"SPOJ-LCPC11B\":[\"Co-Prime\",312,\"LCPC2011\"],\"UVA-10519\":[\"!! Really Strange !!\",1547,null],\"SPOJ-DIGOKEYS\":[\"Find the Treasure\",664,\"Codeblitz-4\"],\"SPOJ-FACTMULN\":[\"Product of factorials (easy)\",120,\"Own Problem\"],\"CodeForces-114D\":[\"Petr#\",50,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/114\\\"\\u003eCodeforces Beta Round 86 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-114E\":[\"Double Happiness\",175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/114\\\"\\u003eCodeforces Beta Round 86 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-ADACLEAN\":[\"Ada and Spring Cleaning\",2162,\"\"],\"CodeForces-114B\":[\"PFAST Inc.\",3860,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/114\\\"\\u003eCodeforces Beta Round 86 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-10989\":[\"Bomb, Divide and Conquer\",503,null],\"LightOJ-1143\":[\"Knights in FEN\",57,null],\"SPOJ-NAIVELOK\":[\"Naive Loki\",116,\"CodeCraft 13 , own problem\"],\"UVA-11833\":[\"Route Change\",556,null],\"LightOJ-1146\":[\"Closest Distance\",1205,null],\"UVA-11830\":[\"Contract Revision\",1973,null],\"SPOJ-TREEISO\":[\"Tree Isomorphism\",544,\"\"],\"UVA-11838\":[\"Come and Go\",4466,null],\"CodeForces-598B\":[\"Queries on a String\",11783,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/598\\\"\\u003eEducational Codeforces Round 1\\u003c/a\\u003e\"],\"CodeForces-598C\":[\"Nearest vectors\",4420,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/598\\\"\\u003eEducational Codeforces Round 1\\u003c/a\\u003e\"],\"SPOJ-AKVQLD03\":[\"How to Handle the Fans\",1724,\"Self\"],\"CodeForces-598D\":[\"Igor In the Museum\",12044,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/598\\\"\\u003eEducational Codeforces Round 1\\u003c/a\\u003e\"],\"CodeForces-598E\":[\"Chocolate Bar\",4877,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/598\\\"\\u003eEducational Codeforces Round 1\\u003c/a\\u003e\"],\"UVA-355\":[\"The Bases Are Loaded\",3465,null],\"SPOJ-JGTLE\":[\"Jalil Got TLE\",593,\"\"],\"SPOJ-DRACULA\":[\"Dracula\",140,\"IME/USP 2 - Brazilian ICPC Training Camp, Jan-Feb/2012\"],\"UVA-10977\":[\"Enchanted Forest\",1302,null],\"LightOJ-1155\":[\"Power Transmission\",899,null],\"LightOJ-1157\":[\"LCS Revisited\",442,null],\"SPOJ-PTRI\":[\"primes triangle (I)\",68,\"owner\"],\"CodeChef-TRANDED\":[\"Torque and edges\",229,\"torque\"],\"SPOJ-WOWSUBSTR2\":[\"Counting WOW-Substrings2\",109,\"MySelf\"],\"CodeForces-597A\":[\"Divisibility\",4925,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/597\\\"\\u003eTesting Round 12\\u003c/a\\u003e\"],\"CodeForces-597B\":[\"Restaurant\",5569,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/597\\\"\\u003eTesting Round 12\\u003c/a\\u003e\"],\"SPOJ-NINJA2\":[\"PATHETIC STRINGS\",71,\"\"],\"CodeForces-597C\":[\"Subsequences\",5091,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/597\\\"\\u003eTesting Round 12\\u003c/a\\u003e\"],\"CodeForces-682E\":[\"Alyona and Triangles\",752,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/682\\\"\\u003eCodeforces Round 358 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-GUMATH2\":[\"Card Meets (medium)\",53,\"GUMATH\"],\"UVA-11894\":[\"Genius MJ\",366,null],\"UVA-11892\":[\"ENimEN\",901,null],\"SPOJ-KLUG1\":[\"COUNT JUMPS\",111,\"https://en.wikipedia.org/wiki/Knight_(chess)\"],\"SPOJ-ADABLOOM\":[\"Ada and Bloom\",60,\"\"],\"UVA-11890\":[\"Calculus Simplified\",207,null],\"SPOJ-GRAFFDEF\":[\"King Graffs Defense\",501,\"Own problem\"],\"SPOJ-NINJA7\":[\"TWO SEQUENCES PROBLEM\",270,\"\"],\"UVA-11419\":[\"SAM I AM\",1710,null],\"LightOJ-1120\":[\"Rectangle Union\",432,null],\"UVA-12747\":[\"Back to Edit Distance\",232,null],\"UVA-11898\":[\"Killer Problem\",429,null],\"UVA-12745\":[\"Wishmaster\",98,null],\"SPOJ-DCEPC11I\":[\"Impossible Boss\",190,\"Own Problem\"],\"Gym-101411G\":[\"Game for Little Johnny\",68,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101411\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2009-2010 ACM-ICPC, NEERC, Western Subregional Contest\\u003c/a\\u003e\"],\"LightOJ-1118\":[\"Incredible Molecules\",852,null],\"SPOJ-HS08PAUL\":[\"A conjecture of Paul Erdős\",2303,\"High School Programming League 2008/09\"],\"SPOJ-IITD4\":[\"Divisor Summation Powered\",373,\"own problem, used for IIT Delhi ACM ICPC provincial contest 2010\"],\"SPOJ-ADAPARTY\":[\"Ada and Party\",20,\"\"],\"SPOJ-AU7_5\":[\"STUDENTS\",459,\"\"],\"LightOJ-1130\":[\"Intersection between Circle and Rectangle\",137,null],\"LightOJ-1131\":[\"Just Two Functions\",1002,null],\"SPOJ-TIEROPE\":[\"Tie the Rope\",92,\"Own problem\"],\"LightOJ-1132\":[\"Summing up Powers\",720,null],\"UVA-11888\":[\"Abnormal 89\\u0027s\",1276,null],\"CodeForces-119D\":[\"String Transformation\",517,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/119\\\"\\u003eCodeforces Beta Round 90\\u003c/a\\u003e\"],\"LightOJ-1134\":[\"Be Efficient\",911,null],\"UVA-11404\":[\"Palindromic Subsequence\",1559,null],\"UVA-11885\":[\"Number of Battlefields\",199,null],\"CodeForces-119A\":[\"Epic Game\",28135,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/119\\\"\\u003eCodeforces Beta Round 90\\u003c/a\\u003e\"],\"SPOJ-DCEPC11B\":[\"Boring Factorials\",2051,\"Own Problem\"],\"SPOJ-ADAPARTI\":[\"Ada and Parties\",3,\"\"],\"SPOJ-SQRMINSUM\":[\"Minimum Sum\",212,\"Standard Pro Co\"],\"SPOJ-BLOPER\":[\"Operators\",606,\"\"],\"SPOJ-JOKER1\":[\"Knifes Are Fun\",1293,\"\"],\"UVA-11871\":[\"New Land\",114,null],\"CodeForces-118D\":[\"Caesar\\u0027s Legions\",18150,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11879\":[\"Multiple of 17\",6200,null],\"CodeForces-118E\":[\"Bertown roads\",6425,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-118B\":[\"Present from Lena\",29555,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-UOFTAE\":[\"Foxling Feeding Frenzy\",461,\"Own problem, used in the 2012 UofT ACM Tryouts\"],\"CodeForces-118C\":[\"Fancy Number\",2775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"LightOJ-1101\":[\"A Secret Mission\",889,null],\"CodeForces-118A\":[\"String Task\",190770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/118\\\"\\u003eCodeforces Beta Round 89 (Div. 2)\\u003c/a\\u003e\"],\"UVA-315\":[\"Network\",9464,null],\"UVA-314\":[\"Robot\",1813,null],\"CodeForces-687D\":[\"Dividing Kingdom II\",897,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/687\\\"\\u003eCodeforces Round 360 (Div. 1)\\u003c/a\\u003e\"],\"UVA-796\":[\"Critical Links\",6295,null],\"SPOJ-ITRIX_E\":[\"THE BLACK AND WHITE QUEENS\",80,\"ITRIX 2011\"],\"UVA-793\":[\"Network Connections\",8395,null],\"CodeChef-COLTREE\":[\"Coloring A Tree\",633,\"admin2\"],\"SPOJ-DCEPC12G\":[\"G Force\",405,\"\"],\"CodeForces-117C\":[\"Cycle\",2745,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/117\\\"\\u003eCodeforces Beta Round 88\\u003c/a\\u003e\"],\"LightOJ-1110\":[\"An Easy LCS\",1969,null],\"UVA-11863\":[\"Prime Game\",119,null],\"Gym-101630A\":[\"Archery Tournament\",903,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101630\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC Northern Eurasia (Northeastern European Regional) Contest (NEERC 17)\\u003c/a\\u003e\"],\"LightOJ-1104\":[\"Birthday Paradox\",2490,null],\"Gym-101630C\":[\"Connections\",1460,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101630\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC Northern Eurasia (Northeastern European Regional) Contest (NEERC 17)\\u003c/a\\u003e\"],\"Gym-101630L\":[\"Laminar Family\",623,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101630\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC Northern Eurasia (Northeastern European Regional) Contest (NEERC 17)\\u003c/a\\u003e\"],\"CodeChef-APRPS\":[\"Irrational Root\",50,\"chemthan\"],\"SPOJ-SUMMATION\":[\"SUMMATION\",508,\"\"],\"CodeForces-16E\":[\"Fish\",5075,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/16\\\"\\u003eCodeforces Beta Round 16 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-11451\":[\"Water restrictions\",133,null],\"Gym-101726B\":[\"Spy Duel\",95,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101726\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013 USP Try-outs\\u003c/a\\u003e\"],\"SPOJ-JZPCIR\":[\"Jumping Zippy\",65,\"own problem\"],\"Gym-100963I\":[\"Minimum Bounding Rectangle\",64,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100963\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2007-2008 Summer Petrozavodsk Camp, Japanese Contest, 2007-08-29\\u003c/a\\u003e\"],\"CodeForces-16B\":[\"Burglar and Matches\",17828,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/16\\\"\\u003eCodeforces Beta Round 16 (Div. 2 Only)\\u003c/a\\u003e\"],\"Gym-101726E\":[\"Election in Yekaterinburg\",179,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101726\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013 USP Try-outs\\u003c/a\\u003e\"],\"CodeForces-16A\":[\"Flag\",15003,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/16\\\"\\u003eCodeforces Beta Round 16 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-RAONE\":[\"Ra-One Numbers\",1802,\"Own\"],\"CodeForces-16C\":[\"Monitor\",5041,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/16\\\"\\u003eCodeforces Beta Round 16 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-12307\":[\"Smallest Enclosing Rectangle\",226,null],\"UVA-10128\":[\"Queue\",2804,null],\"CodeForces-427C\":[\"Checkposts\",14096,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/427\\\"\\u003eCodeforces Round 244 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-MAKEMAZE\":[\"VALIDATE THE MAZE\",3526,\"\"],\"Gym-101726J\":[\"The Sverdlovsk incident\",60,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101726\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013 USP Try-outs\\u003c/a\\u003e\"],\"SPOJ-DICT\":[\"Search in the dictionary!\",1684,\"Own problem\"],\"CodeForces-645B\":[\"Mischievous Mess Makers\",3598,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/645\\\"\\u003eCROC 2016 - Elimination Round\\u003c/a\\u003e\"],\"SPOJ-NDIVPHI2\":[\"N DIV PHI_N (Hard)\",191,\"Frank Rafael Arteaga\"],\"CodeForces-863B\":[\"Kayaking\",8354,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"CodeForces-645E\":[\"Intellectual Inquiry\",1283,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/645\\\"\\u003eCROC 2016 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-863D\":[\"Yet Another Array Queries Problem\",3382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"CodeForces-863C\":[\"1-2-3\",2566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"CodeForces-863F\":[\"Almost Permutation\",1307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"CodeForces-863E\":[\"Turn Off The TV\",3222,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/863\\\"\\u003eEducational Codeforces Round 29\\u003c/a\\u003e\"],\"Gym-100963F\":[\"Flame of Nucleus\",122,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100963\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2007-2008 Summer Petrozavodsk Camp, Japanese Contest, 2007-08-29\\u003c/a\\u003e\"],\"SPOJ-ZCR\":[\"Zen And His Crush\",403,\"\"],\"SPOJ-ADAQUBIC\":[\"Ada and TicTacToe\",47,\"\"],\"CodeForces-17C\":[\"Balance\",905,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/17\\\"\\u003eCodeforces Beta Round 17\\u003c/a\\u003e\"],\"CodeForces-17B\":[\"Hierarchy\",5285,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/17\\\"\\u003eCodeforces Beta Round 17\\u003c/a\\u003e\"],\"CodeForces-17D\":[\"Notepad\",1167,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/17\\\"\\u003eCodeforces Beta Round 17\\u003c/a\\u003e\"],\"UVA-11448\":[\"Who said crisis?\",1725,null],\"CodeForces-777B\":[\"Game of Credit Cards\",10199,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"CodeChef-COPRIME3\":[\"Coprime Triples\",1063,\"sergey_adm\"],\"CodeForces-777D\":[\"Cloud of Hashtags\",5358,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-777C\":[\"Alyona and Spreadsheet\",6858,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-862C\":[\"Mahmoud and Ehab and the xor\",4515,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/862\\\"\\u003eCodeforces Round 435 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-777E\":[\"Hanoi Factory\",4364,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/777\\\"\\u003eCodeforces Round 401 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-RIOI_2_3\":[\"Path of the righteous man\",493,\"Own Problem\"],\"CodeForces-862D\":[\"Mahmoud and Ehab and the binary string\",1780,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/862\\\"\\u003eCodeforces Round 435 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11432\":[\"Busy Programmer\",326,null],\"UVA-1208\":[\"Oreon\",1608,null],\"UVA-10583\":[\"Ubiquitous Religions\",7757,null],\"Gym-101064K\":[\"Mount Rushmore and Birthdays\",398,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101064\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2016 USP Try-outs\\u003c/a\\u003e\"],\"CodeForces-14D\":[\"Two Paths\",4719,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/14\\\"\\u003eCodeforces Beta Round 14 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-DYNALCA\":[\"Dynamic LCA\",466,\"\"],\"UVA-10109\":[\"Solving Systems of Linear Equations\",222,null],\"UVA-11439\":[\"Maximizing the ICPC\",221,null],\"UVA-11436\":[\"Cubes - EXTREME!!!\",317,null],\"UVA-12768\":[\"Inspired Procrastination\",141,null],\"UVA-10106\":[\"Product\",15126,null],\"SPOJ-COUNT1IT\":[\"Ghost Town\",359,\"My own problem\"],\"UVALive-8259\":[\"High Score\",0,\"Regionals 2017 \\u003e\\u003e Europe - Northwestern\"],\"UVALive-8257\":[\"Factor-Free Tree\",12,\"Regionals 2017 \\u003e\\u003e Europe - Northwestern\"],\"SPOJ-KOIREP\":[\"Representatives\",529,\"2011 KOI regional\"],\"CodeForces-643A\":[\"Bear and Colors\",4228,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/643\\\"\\u003eVK Cup 2016 - Round 3\\u003c/a\\u003e\"],\"CodeForces-776C\":[\"Molly\\u0027s Chemicals\",6377,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/776\\\"\\u003eICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"UVALive-8255\":[\"Dunglish\",22,\"Regionals 2017 \\u003e\\u003e Europe - Northwestern\"],\"UVA-1683\":[\"In case of failure\",70,null],\"CodeForces-776B\":[\"Sherlock and his girlfriend\",21084,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/776\\\"\\u003eICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-776E\":[\"The Holmes Children\",2398,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/776\\\"\\u003eICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-861B\":[\"Which floor?\",130,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/861\\\"\\u003eCodeforces Round 434 (Div. 2, based on Technocup 2018 Elimination Round 1)\\u003c/a\\u003e\"],\"UVALive-8253\":[\"Boss Battle\",57,\"Regionals 2017 \\u003e\\u003e Europe - Northwestern\"],\"CodeForces-776D\":[\"The Door Problem\",5382,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/776\\\"\\u003eICM Technex 2017 and Codeforces Round 400 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-861A\":[\"k-rounding\",255,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/861\\\"\\u003eCodeforces Round 434 (Div. 2, based on Technocup 2018 Elimination Round 1)\\u003c/a\\u003e\"],\"UVA-1201\":[\"Taxi Cab Scheme\",605,null],\"CodeForces-861D\":[\"Polycarp\\u0027s phone book\",116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/861\\\"\\u003eCodeforces Round 434 (Div. 2, based on Technocup 2018 Elimination Round 1)\\u003c/a\\u003e\"],\"CodeForces-861C\":[\"Did you mean...\",93,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/861\\\"\\u003eCodeforces Round 434 (Div. 2, based on Technocup 2018 Elimination Round 1)\\u003c/a\\u003e\"],\"CodeForces-861F\":[\"Wizard\\u0027s Tour\",7,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/861\\\"\\u003eCodeforces Round 434 (Div. 2, based on Technocup 2018 Elimination Round 1)\\u003c/a\\u003e\"],\"UVA-1218\":[\"Perfect Service\",2061,null],\"CodeForces-15D\":[\"Map\",782,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/15\\\"\\u003eCodeforces Beta Round 15\\u003c/a\\u003e\"],\"SPOJ-NAJPF\":[\"Pattern Find\",6597,\"\"],\"CodeForces-15C\":[\"Industrial Nim\",2529,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/15\\\"\\u003eCodeforces Beta Round 15\\u003c/a\\u003e\"],\"UVALive-2931\":[\"Bridging signals\",283,\"Regionals 2003 \\u003e\\u003e Europe - Northwestern\"],\"UVA-11427\":[\"Expect the Expected\",957,null],\"SPOJ-DIVSUM\":[\"Divisor Summation\",19239,\"Neal Zane\"],\"SPOJ-BORW\":[\"Black or White\",1573,\"FCEyN UBA ICPC Selection 2009\"],\"UVA-10167\":[\"Birthday Cake\",3622,null],\"UVA-11499\":[\"Longest Increasing Sequence\",190,null],\"UVA-11012\":[\"Cosmic Cabbages\",558,null],\"SPOJ-FREQUENT\":[\"Frequent values\",4165,\"University of Ulm Local Contest 2007\"],\"UVA-11495\":[\"Bubbles and Buckets\",2687,null],\"SPOJ-ADAAPHID\":[\"Ada and Aphids\",227,\"\"],\"SPOJ-PLUSEVI\":[\"How Many Plusses\",174,\"Croatian junior team selection test 2011\"],\"SPOJ-KSMALL\":[\"K-th smallest number\",224,\"\"],\"UVA-11019\":[\"Matrix Matcher\",1651,null],\"SPOJ-WRONG\":[\"Wrong directions\",47,\"Usaco march 2012\"],\"UVA-12347\":[\"Binary Search Tree\",2071,null],\"CodeForces-867B\":[\"Save the problem!\",120,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/867\\\"\\u003eCodeforces Round 437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)\\u003c/a\\u003e\"],\"CodeForces-867D\":[\"Gotta Go Fast\",4,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/867\\\"\\u003eCodeforces Round 437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)\\u003c/a\\u003e\"],\"SPOJ-DCOWS\":[\"Dancing Cows\",633,\"USACO 2008 Gold\"],\"CodeForces-867C\":[\"Ordering Pizza\",67,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/867\\\"\\u003eCodeforces Round 437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)\\u003c/a\\u003e\"],\"CodeForces-734E\":[\"Anton and Tree\",4378,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/734\\\"\\u003eCodeforces Round 379 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-867E\":[\"Buy Low Sell High\",227,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/867\\\"\\u003eCodeforces Round 437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)\\u003c/a\\u003e\"],\"CodeChef-CLOSEFAR\":[\"So Close Yet So Far\",122,\"animesh_f\"],\"SPOJ-ALONE\":[\"FOREVER ALONE\",96,\"problem setter: rishi_kumar\"],\"UVA-11487\":[\"Gathering Food\",604,null],\"UVA-11488\":[\"Hyper Prefix Sets\",1897,null],\"Gym-100960H\":[\"Garland Checking\",147,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100960\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015-2016 Petrozavodsk Winter Training Camp, Nizhny Novgorod SU Contest\\u003c/a\\u003e\"],\"UVA-12333\":[\"Revenge of Fibonacci\",798,null],\"SPOJ-HACKRNDM\":[\"Hacking the random number generator\",6942,\"Own Problem\"],\"UVA-11486\":[\"Finding Paths in Grid\",377,null],\"UVALive-3803\":[\"Mahabharat -- A Story in disguise\",18,\"Regionals 2006 \\u003e\\u003e Asia - Coimbatore\"],\"UVA-11481\":[\"Arrange the Numbers\",534,null],\"UVA-11482\":[\"Building a Triangular Museum\",439,null],\"SPOJ-TPCPALIN\":[\"Palindrome Merge\",39,\"\"],\"UVA-11008\":[\"Antimatter Ray Clearcutting\",675,null],\"UVA-12338\":[\"Anti-Rhyme Pairs\",592,null],\"CodeForces-600D\":[\"Area of Two Circles\\u0027 Intersection\",2362,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/600\\\"\\u003eEducational Codeforces Round 2\\u003c/a\\u003e\"],\"CodeForces-733F\":[\"Drivers Dissatisfaction\",1251,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/733\\\"\\u003eCodeforces Round 378 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-COLORSEG\":[\"Coloring Segments\",97,\"Own Problem\"],\"UVALive-8262\":[\"Knockout Tournament\",0,\"Regionals 2017 \\u003e\\u003e Europe - Northwestern\"],\"UVA-11491\":[\"Erasing and Winning\",2210,null],\"SPOJ-INVDIV\":[\"Smallest Inverse Sum of Divisors\",100,\"Own Problem\"],\"Gym-100960C\":[\"Missing Part\",129,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100960\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015-2016 Petrozavodsk Winter Training Camp, Nizhny Novgorod SU Contest\\u003c/a\\u003e\"],\"UVALive-8260\":[\"Installing Apps\",0,\"Regionals 2017 \\u003e\\u003e Europe - Northwestern\"],\"SPOJ-ELIS\":[\"Easy Longest Increasing Subsequence\",9176,\"\"],\"UVA-11474\":[\"Dying Tree\",459,null],\"UVALive-3837\":[\"The Stable Marriage Problem\",283,\"Regionals 2007 \\u003e\\u003e Europe - Southeastern\"],\"SPOJ-POSTERIN\":[\"Postering\",655,\"POI XV\"],\"UVA-11471\":[\"Arrange the Tiles\",197,null],\"CodeForces-18D\":[\"Seller Bob\",1118,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/18\\\"\\u003eCodeforces Beta Round 18 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-18C\":[\"Stripe\",14275,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/18\\\"\\u003eCodeforces Beta Round 18 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVALive-3833\":[\"Loan Scheduling\",209,\"Regionals 2007 \\u003e\\u003e Europe - Southeastern\"],\"SPOJ-TAKIN\":[\"Taskin and apple tree\",401,\"\"],\"CodeForces-18E\":[\"Flag 2\",1087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/18\\\"\\u003eCodeforces Beta Round 18 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-11478\":[\"Halum\",861,null],\"CodeForces-18A\":[\"Triangle\",6264,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/18\\\"\\u003eCodeforces Beta Round 18 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-514D\":[\"R2D2 and Droid Army\",4589,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/514\\\"\\u003eCodeforces Round 291 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-8299\":[\"Bricks\",3,\"Regionals 2017 \\u003e\\u003e Europe - Southeastern\"],\"CodeForces-732E\":[\"Sockets\",1669,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/732\\\"\\u003eCodeforces Round 377 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADAPLNTS\":[\"Ada and Plants 2\",75,\"Tunisian Collegiate Training Contest - Round #01\"],\"CodeForces-732F\":[\"Tourist Reform\",2384,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/732\\\"\\u003eCodeforces Round 377 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11465\":[\"Count the Polygons\",129,null],\"UVA-10131\":[\"Is Bigger Smarter?\",9710,null],\"CodeForces-19D\":[\"Points\",2517,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/19\\\"\\u003eCodeforces Beta Round 19\\u003c/a\\u003e\"],\"UVA-1658\":[\"Admiral\",830,null],\"CodeForces-19C\":[\"Deletion of Repeats\",1175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/19\\\"\\u003eCodeforces Beta Round 19\\u003c/a\\u003e\"],\"CodeForces-19B\":[\"Checkout Assistant\",4879,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/19\\\"\\u003eCodeforces Beta Round 19\\u003c/a\\u003e\"],\"CodeForces-779D\":[\"String Game\",525,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/779\\\"\\u003eCodeforces Round 402 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-779C\":[\"Dishonest Sellers\",12841,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/779\\\"\\u003eCodeforces Round 402 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-864C\":[\"Bus\",6405,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/864\\\"\\u003eCodeforces Round 436 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-779E\":[\"Bitwise Formula\",35,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/779\\\"\\u003eCodeforces Round 402 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-731D\":[\"80-th Level Archeology\",1221,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/731\\\"\\u003eCodeforces Round 376 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-864E\":[\"Fire\",4602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/864\\\"\\u003eCodeforces Round 436 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-731C\":[\"Socks\",7709,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/731\\\"\\u003eCodeforces Round 376 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-864D\":[\"Make a Permutation!\",6353,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/864\\\"\\u003eCodeforces Round 436 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-731F\":[\"Video Cards\",2972,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/731\\\"\\u003eCodeforces Round 376 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-731E\":[\"Funny Game\",1491,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/731\\\"\\u003eCodeforces Round 376 (Div. 2)\\u003c/a\\u003e\"],\"Gym-100962A\":[\"ABBA\",420,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100962\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015-2016 Petrozavodsk Winter Training Camp, Moscow SU Trinity Contest\\u003c/a\\u003e\"],\"UVA-13116\":[\"Multistory Labyrinth\",185,null],\"CodeForces-56E\":[\"Domino Principle\",2546,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/56\\\"\\u003eCodeforces Beta Round 52 (Div. 2)\\u003c/a\\u003e\"],\"UVA-13114\":[\"Josephus lottery II\",54,null],\"CodeForces-56B\":[\"Spoilt Permutation\",3903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/56\\\"\\u003eCodeforces Beta Round 52 (Div. 2)\\u003c/a\\u003e\"],\"UVA-13112\":[\"Are you ok?\",61,null],\"SPOJ-HOLI\":[\"Holiday Accommodation\",1099,\"ACM/ICPC Regional Contest, Chengdu 2011\"],\"CodeForces-56D\":[\"Changing a String\",1946,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/56\\\"\\u003eCodeforces Beta Round 52 (Div. 2)\\u003c/a\\u003e\"],\"UVA-1027\":[\"Toll\",202,null],\"SPOJ-KGSS\":[\"Maximum Sum\",7922,\"Kurukshetra 09 OPC\"],\"UVALive-2642\":[\"Spelling Be\",66,\"Regionals 2002 \\u003e\\u003e North America - Mid-Atlantic USA\"],\"UVA-13117\":[\"ACIS, A Contagious vIruS\",359,null],\"CodeForces-617E\":[\"XOR and Favorite Number\",8962,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/617\\\"\\u003eCodeforces Round 340 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-835B\":[\"The number on the board\",11886,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-920B\":[\"Tea Queue\",7795,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADAROADS\":[\"Ada and Roads\",14,\"\"],\"CodeForces-835E\":[\"The penguin\\u0027s game\",1195,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ORDSUM23\":[\"Sums of 2 and 3\",1602,\"Own Problem\"],\"CodeForces-835D\":[\"Palindromic characteristics\",4149,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/835\\\"\\u003eCodeforces Round 427 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-920E\":[\"Connected Components?\",6183,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-920F\":[\"SUM and REPLACE\",7024,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-920C\":[\"Swap Adjacent Elements\",9505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-SYNC13C\":[\"WHAT A CO-ACCIDENT\",1492,\"\"],\"CodeForces-920D\":[\"Tanks\",716,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UVA-10094\":[\"Place the Guards\",513,null],\"CodeForces-920G\":[\"List Of Integers\",1762,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/920\\\"\\u003eEducational Codeforces Round 37 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UVA-10092\":[\"The Problem with the Problem Setter\",2106,null],\"UVA-12257\":[\"The Queue\",99,null],\"CodeForces-57C\":[\"Array\",2778,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/57\\\"\\u003eCodeforces Beta Round 53\\u003c/a\\u003e\"],\"UVA-10075\":[\"Airlines\",1030,null],\"UVA-10074\":[\"Take the Land\",4991,null],\"SPOJ-MAIN74\":[\"Euclids algorithm revisited\",1438,\"Own problem used for NSIT-IIITA main contest #7\"],\"SPOJ-MAIN72\":[\"Subset sum\",2069,\"Own problem used for NSIT-IIITA main contest #7\"],\"CodeForces-1000E\":[\"We Need More Bosses\",4245,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1000\\\"\\u003eEducational Codeforces Round 46 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-MAIN75\":[\"BST again\",94,\"Own problem used for NSIT-IIITA main contest #7\"],\"CodeForces-749E\":[\"Inversions After Shuffle\",1117,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/749\\\"\\u003eCodeforces Round 388 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-834B\":[\"The Festive Evening\",9015,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/834\\\"\\u003eCodeforces Round 426 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-749D\":[\"Leaving Auction\",2606,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/749\\\"\\u003eCodeforces Round 388 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-HARSHAD\":[\"Devlali Numbers\",737,\"\"],\"CodeForces-701C\":[\"They Are Everywhere\",15377,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/701\\\"\\u003eCodeforces Round 364 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-834D\":[\"The Bakery\",260,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/834\\\"\\u003eCodeforces Round 426 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-834C\":[\"The Meaningless Game\",336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/834\\\"\\u003eCodeforces Round 426 (Div. 2)\\u003c/a\\u003e\"],\"Gym-101252C\":[\"Electrician\",143,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101252\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2009-2010 ACM-ICPC, NEERC, Southern Subregional Contest\\u003c/a\\u003e\"],\"CodeForces-834E\":[\"Ever-Hungry Krakozyabra\",18,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/834\\\"\\u003eCodeforces Round 426 (Div. 2)\\u003c/a\\u003e\"],\"UVA-10083\":[\"Division\",1379,null],\"UVA-10080\":[\"Gopher II\",3085,null],\"SPOJ-VISIBLEBOX\":[\"Decreasing Number of Visible Box\",277,\"AIUB CS Fest 2015 (Mokaddesh Rashid Shovon)\"],\"SPOJ-NY10E\":[\"Non-Decreasing Digits\",3879,\"ACM Greater New York Regionals 2010\"],\"CodeForces-54A\":[\"Presents\",2179,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/54\\\"\\u003eCodeforces Beta Round 50\\u003c/a\\u003e\"],\"UVA-11394\":[\"Digit Blocks\",135,null],\"UVA-12240\":[\"Cocircular Points\",158,null],\"CodeForces-749C\":[\"Voting\",6590,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/749\\\"\\u003eCodeforces Round 388 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-SPIKES\":[\"Spiky Mazes\",1317,\"Self created problem\"],\"CodeForces-700C\":[\"Break Up\",1280,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/700\\\"\\u003eCodeforces Round 364 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-833D\":[\"Red-Black Cobweb\",423,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/833\\\"\\u003eCodeforces Round 426 (Div. 1)\\u003c/a\\u003e\"],\"UVA-10070\":[\"Leap Year or Not Leap Year and ...\",7283,null],\"SPOJ-WPC5I\":[\"LCM\",435,\"ACA judge IITK, WPC5\"],\"UVA-11388\":[\"GCD LCM\",13363,null],\"CodeForces-55D\":[\"Beautiful numbers\",6028,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"UVA-11386\":[\"Triples\",408,null],\"UVA-11387\":[\"The 3-Regular Graph\",895,null],\"CodeForces-55A\":[\"Flea travel\",3706,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"CodeForces-55C\":[\"Pie or die\",1903,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"CodeForces-55B\":[\"Smallest number\",3071,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/55\\\"\\u003eCodeforces Beta Round 51\\u003c/a\\u003e\"],\"SPOJ-HC12\":[\"Card Game\",563,\"Facebook Hacker Cup 2013 Round 1\"],\"CodeForces-614C\":[\"Peter and Snow Blower\",261,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/614\\\"\\u003eCodeforces Round 339 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-747E\":[\"Comments\",2054,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/747\\\"\\u003eCodeforces Round 387 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-832B\":[\"Petya and Exam\",4775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/832\\\"\\u003eCodeforces Round 425 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-747D\":[\"Winter Is Coming\",3226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/747\\\"\\u003eCodeforces Round 387 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-832D\":[\"Misha, Grisha and Underground\",4166,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/832\\\"\\u003eCodeforces Round 425 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-747F\":[\"Igor and Interesting Numbers\",448,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/747\\\"\\u003eCodeforces Round 387 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11391\":[\"Blobs in the Board\",535,null],\"UVA-11392\":[\"Binary*3 Type Multiple\",300,null],\"SPOJ-BSPRIME\":[\"Binary Sequence of Prime Number\",239,\"Own Problem\"],\"CodeForces-12E\":[\"Start of the session\",1272,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/12\\\"\\u003eCodeforces Beta Round 12 (Div 2 Only)\\u003c/a\\u003e\"],\"SPOJ-INVESORT\":[\"Inversion Sort\",182,\"FCEyN UBA ICPC Selection 2009\"],\"CodeForces-12A\":[\"Super Agent\",13835,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/12\\\"\\u003eCodeforces Beta Round 12 (Div 2 Only)\\u003c/a\\u003e\"],\"CodeForces-12D\":[\"Ball\",2198,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/12\\\"\\u003eCodeforces Beta Round 12 (Div 2 Only)\\u003c/a\\u003e\"],\"UVA-13154\":[\"Extreme XOR Sum\",132,null],\"CodeForces-12C\":[\"Fruits\",6336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/12\\\"\\u003eCodeforces Beta Round 12 (Div 2 Only)\\u003c/a\\u003e\"],\"UVA-13153\":[\"Number of Connected Components\",382,null],\"UVA-1469\":[\"Ardenia\",68,null],\"SPOJ-GIRLSNBS\":[\"Girls and Boys\",12362,\"FCEyN UBA ICPC Selection 2010\"],\"CodeForces-707E\":[\"Garlands\",1051,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/707\\\"\\u003eCodeforces Round 368 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADAGCD\":[\"Ada and GCD\",527,\"\"],\"UVA-13162\":[\"Dinner Bet\",31,null],\"SPOJ-ADJDUCKS\":[\"Adjusting Ducks\",62,\"HUST\"],\"SPOJ-ACQUIRE\":[\"Land Acquisition\",1486,\"USACO Mar08\"],\"SPOJ-AFS2\":[\"Amazing Factor Sequence (medium)\",205,\"AFS\"],\"CodeForces-13C\":[\"Sequence\",4343,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/13\\\"\\u003eCodeforces Beta Round 13\\u003c/a\\u003e\"],\"SPOJ-EDIST\":[\"Edit distance\",14899,\"Internet\"],\"CodeForces-13E\":[\"Holes\",5931,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/13\\\"\\u003eCodeforces Beta Round 13\\u003c/a\\u003e\"],\"SPOJ-SUBXOR\":[\"SubXor\",1957,\"\"],\"CodeForces-839C\":[\"Journey\",17232,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/839\\\"\\u003eCodeforces Round 428 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-839B\":[\"Game of the Rows\",3649,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/839\\\"\\u003eCodeforces Round 428 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-706D\":[\"Vasiliy\\u0027s Multiset\",10238,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/706\\\"\\u003eCodeforces Round 367 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-839E\":[\"Mother of Dragons\",970,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/839\\\"\\u003eCodeforces Round 428 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-839D\":[\"Winter is here\",3038,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/839\\\"\\u003eCodeforces Round 428 (Div. 2)\\u003c/a\\u003e\"],\"UVA-13152\":[\"Balanced String\",221,null],\"UVA-13150\":[\"National Bomb Defusing Squad\",321,null],\"SPOJ-FAST2\":[\"Fast Sum of two to an exponent\",1050,\"Own problem\"],\"CodeForces-10D\":[\"LCIS\",4482,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/10\\\"\\u003eCodeforces Beta Round 10\\u003c/a\\u003e\"],\"CodeForces-58D\":[\"Calendar\",796,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/58\\\"\\u003eCodeforces Beta Round 54 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-58C\":[\"Trees\",2209,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/58\\\"\\u003eCodeforces Beta Round 54 (Div. 2)\\u003c/a\\u003e\"],\"UVA-13132\":[\"Laser Mirrors\",474,null],\"CodeForces-58E\":[\"Expression\",387,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/58\\\"\\u003eCodeforces Beta Round 54 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-58B\":[\"Coins\",12967,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/58\\\"\\u003eCodeforces Beta Round 54 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-838B\":[\"Diverging Directions\",759,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/838\\\"\\u003eIndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)\\u003c/a\\u003e\"],\"UVA-1480\":[\"Jewel\",54,null],\"CodeForces-704D\":[\"Captain America\",886,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/704\\\"\\u003eCodeforces Round 366 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-837E\":[\"Vasya\\u0027s Function\",1610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"CodeForces-922C\":[\"Cave Painting\",7566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-837D\":[\"Round Subset\",5174,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"CodeForces-922D\":[\"Robot Vacuum Cleaner\",4739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-922A\":[\"Cloning Toys\",12246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-922B\":[\"Magic Forest\",9224,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-KIMO1\":[\"abdou set\",56,\"owner\"],\"SPOJ-RRANGE\":[\"Ranges\",241,\"Copa Lenin 2012 - Level 1\"],\"CodeForces-922E\":[\"Birds\",2408,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"CodeChef-CHEFNUMK\":[\"Chef and Queries\",237,\"mgch\"],\"CodeForces-922F\":[\"Divisibility\",641,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/922\\\"\\u003eCodeforces Round 461 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-MLK\":[\"Milk Trading\",203,\"Egyptian Olympiad in Informatics ( EOI ) 2009, August 14 - 21, Cairo\"],\"Gym-100800A\":[\"Aqueduct Construction\",99,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100800\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 United Kingdom and Ireland Programming Contest (UKIEPC 2015)\\u003c/a\\u003e\"],\"SPOJ-CF25E\":[\"Test\",450,\"Codeforces - Unofficial Test Cases\"],\"SPOJ-CODESPTB\":[\"Insertion Sort\",3881,\"own problem used for CodeSprint - InterviewStreet Contest\"],\"HackerRank-short-palindrome\":[\"Short Palindrome\",560,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/world-codesprint-5\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eworld-codesprint-5\\u003c/a\\u003e\"],\"UVA-10099\":[\"The Tourist Guide\",7591,null],\"SPOJ-CODESPTD\":[\"Queens on a Board\",52,\"own problem used for CodeSprint - InterviewStreet Contest\"],\"CodeForces-59E\":[\"Shortest Path\",3414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/59\\\"\\u003eCodeforces Beta Round 55 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-11B\":[\"Jumping Jack\",4754,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/11\\\"\\u003eCodeforces Beta Round 11\\u003c/a\\u003e\"],\"UVALive-7903\":[\"Pandaria\",15,\"Regionals 2016 \\u003e\\u003e Asia - China Final\"],\"CodeForces-59C\":[\"Title\",2332,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/59\\\"\\u003eCodeforces Beta Round 55 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-837C\":[\"Two Seals\",4278,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"CodeForces-837B\":[\"Flag of Berland\",4224,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/837\\\"\\u003eEducational Codeforces Round 26\\u003c/a\\u003e\"],\"SPOJ-BOMARBLE\":[\"D - Playing with Marbles\",3495,\"\"],\"CodeForces-703E\":[\"Mishka and Divisors\",633,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/703\\\"\\u003eCodeforces Round 365 (Div. 2)\\u003c/a\\u003e\"],\"UVA-1496\":[\"Peach Blossom Spring\",81,null],\"SPOJ-CODESPTI\":[\"Repairing Roads\",21,\"own problem used for CodeSprint - InterviewStreet Contest\"],\"CodeForces-96B\":[\"Lucky Numbers (easy)\",17205,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/96\\\"\\u003eCodeforces Beta Round 77 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-ADABRANC\":[\"Ada and Branches\",343,\"Tunisian Collegiate Training Contest - Round #01\"],\"UVALive-2243\":[\"Channel Allocation\",217,\"Regionals 2001 \\u003e\\u003e Africa/Middle East - South Africa\"],\"SPOJ-GRASSPLA\":[\"Grass Planting\",559,\"USCAO contests\"],\"SPOJ-DANGER\":[\"In Danger\",4463,\"University of Ulm Local Contest 2004\"],\"HackerRank-r-tree-decoration\":[\"Robanukkah Tree\",137,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/june-world-codesprint\\u0027 target\\u003d\\u0027_blank\\u0027\\u003ejune-world-codesprint\\u003c/a\\u003e\"],\"UVA-10925\":[\"Krakovia\",2825,null],\"SPOJ-CCHESS\":[\"COSTLY CHESS\",2020,\"IIITM Local Contest\"],\"CodeForces-131E\":[\"Yet Another Task with Queens\",1904,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/131\\\"\\u003eCodeforces Beta Round 95 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-97B\":[\"Superset\",1034,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/97\\\"\\u003eYandex.Algorithm 2011: Finals\\u003c/a\\u003e\"],\"CodeForces-131C\":[\"The World is a Theatre\",12201,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/131\\\"\\u003eCodeforces Beta Round 95 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-131A\":[\"cAPS lOCK\",86266,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/131\\\"\\u003eCodeforces Beta Round 95 (Div. 2)\\u003c/a\\u003e\"],\"UVA-13189\":[\"Humbertov and the Triangular Spiral\",79,null],\"CodeForces-131B\":[\"Opposites Attract\",7664,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/131\\\"\\u003eCodeforces Beta Round 95 (Div. 2)\\u003c/a\\u003e\"],\"UVA-13186\":[\"Tobby and the quaseEquals strings\",57,null],\"UVALive-7921\":[\"Anticlockwise Motion\",28,\"Regionals 2016 \\u003e\\u003e South Pacific\"],\"UVA-10918\":[\"Tri Tiling\",2733,null],\"UVA-787\":[\"Maximum Sub-sequence Product\",3217,null],\"SPOJ-CHAOS_CC\":[\"Chaos In Arkham\",61,\"CodeCraft 13 , Author : Nikhil Goyal\"],\"UVA-13194\":[\"DPA Numbers II\",261,null],\"SPOJ-GOC11A\":[\"Appending String\",277,\"\"],\"UVA-13191\":[\"Tobby Primes\",75,null],\"SPOJ-ADAFTBLL\":[\"Ada and Football\",203,\"Tunisian Collegiate Training Contest - Round #01\"],\"CodeForces-94B\":[\"Friends\",4912,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/94\\\"\\u003eCodeforces Beta Round 76 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-13179\":[\"Smarter than hunger\",17,null],\"UVA-13177\":[\"Orchestral scores\",196,null],\"UVA-13176\":[\"Chocolate with almonds\",44,null],\"UVA-13175\":[\"Children to the top\",29,null],\"SPOJ-MEANARR\":[\"Mean of array\",199,\"Me, MYSELF \\u0026 I\"],\"UVALive-6623\":[\"Battle for Silver\",211,\"Regionals 2013 \\u003e\\u003e Europe - Northwestern\"],\"CodeForces-709E\":[\"Centroids\",35,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/709\\\"\\u003eAIM Tech Round 3 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-6622\":[\"Absurdistan Roads\",178,\"Regionals 2013 \\u003e\\u003e Europe - Northwestern\"],\"UVALive-6631\":[\"Jingle Balls\",83,\"Regionals 2013 \\u003e\\u003e Europe - Northwestern\"],\"UVA-10907\":[\"Art Gallery\",114,null],\"SPOJ-PSYCHON\":[\"Psycho\",1169,\"\"],\"SPOJ-DCEPC501\":[\"Save Thy Toys\",2937,\"Own Problem\"],\"UVA-13185\":[\"DPA Numbers I\",1479,null],\"UVA-13184\":[\"Counting Edges and Graphs\",64,null],\"SPOJ-PSYCHOT\":[\"Psycho34 (easy)\",59,\"PSYCHON\"],\"UVA-13183\":[\"Tobby and Array\",56,null],\"UVA-13182\":[\"Tobby\\u0027s Ancestors\",45,null],\"SPOJ-DCEPC505\":[\"Bazinga!\",818,\"Own Problem\"],\"UVA-13169\":[\"Balls and Needles\",43,null],\"UVA-13166\":[\"Pascal\\u0027s Hyper-Pyramids\",32,null],\"UVA-13164\":[\"Performance Review\",29,null],\"UVALive-7948\":[\"Periodic Strings\",107,\"Regionals 2016 \\u003e\\u003e North America - Southeast USA\"],\"SPOJ-EXPOR\":[\"OR\",143,\"https://algo.codemarshal.org/contests/goc-0101\"],\"Gym-101650A\":[\"Alphabet\",9,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101650\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2006-2007 ACM-ICPC, NEERC, Northern Subregional Contest\\u003c/a\\u003e\"],\"UVALive-7951\":[\"Islands\",88,\"Regionals 2016 \\u003e\\u003e North America - Southeast USA\"],\"Gym-101650D\":[\"Deciphering\",33,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101650\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2006-2007 ACM-ICPC, NEERC, Northern Subregional Contest\\u003c/a\\u003e\"],\"Gym-101650F\":[\"Feng Shui\",86,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101650\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2006-2007 ACM-ICPC, NEERC, Northern Subregional Contest\\u003c/a\\u003e\"],\"SPOJ-CPCRC1C\":[\"Sum of Digits\",5081,\"http://cs.ikiu.ac.ir/cms/icpc/training/7-contest/86-contest1\"],\"Gym-101650H\":[\"Halloween holidays\",189,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101650\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2006-2007 ACM-ICPC, NEERC, Northern Subregional Contest\\u003c/a\\u003e\"],\"Gym-101650G\":[\"Genealogy\",167,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101650\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2006-2007 ACM-ICPC, NEERC, Northern Subregional Contest\\u003c/a\\u003e\"],\"SPOJ-MAIN12B\":[\"PrimeFactorofLCM\",782,\"Vaibhav Mittal\"],\"SPOJ-CODERE3\":[\"Coder Express 3!!\",1317,\"AASF - ABV-IIITM PC-01-9-2013\"],\"SPOJ-OPCPIZZA\":[\"Pizzamania\",2241,\"MNNIT OPC 31-08-2012\"],\"UVA-13173\":[\"Secret Santa\",35,null],\"Gym-101650I\":[\"Ideal Frame\",21,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101650\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2006-2007 ACM-ICPC, NEERC, Northern Subregional Contest\\u003c/a\\u003e\"],\"UVA-13172\":[\"The music teacher\",50,null],\"UVA-13171\":[\"Pixel Art\",370,null],\"Gym-101650K\":[\"Kennings\",49,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101650\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2006-2007 ACM-ICPC, NEERC, Northern Subregional Contest\\u003c/a\\u003e\"],\"UVA-13170\":[\"Verbal arithmetic\",13,null],\"SPOJ-COMDIV\":[\"Number of common divisors\",7968,\"Own problem, used in UODA TST\"],\"UVA-760\":[\"DNA Sequencing\",2054,null],\"CodeForces-52B\":[\"Right Triangles\",2327,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/52\\\"\\u003eCodeforces Testing Round 1\\u003c/a\\u003e\"],\"CodeForces-52C\":[\"Circular RMQ\",9479,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/52\\\"\\u003eCodeforces Testing Round 1\\u003c/a\\u003e\"],\"CodeForces-136D\":[\"Rectangle and Square\",75,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/136\\\"\\u003eCodeforces Beta Round 97 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-136C\":[\"Replacement\",175,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/136\\\"\\u003eCodeforces Beta Round 97 (Div. 2)\\u003c/a\\u003e\"],\"UVA-10968\":[\"KuPellaKeS\",309,null],\"CodeForces-136A\":[\"Presents\",112015,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/136\\\"\\u003eCodeforces Beta Round 97 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11813\":[\"Shopping\",448,null],\"UVALive-7979\":[\"Red Rover\",51,\"Regionals 2016 \\u003e\\u003e North America - East Central NA\"],\"UVALive-7977\":[\"The Key to Cryptography\",46,\"Regionals 2016 \\u003e\\u003e North America - East Central NA\"],\"UVA-11817\":[\"Tunnelling the Earth\",766,null],\"CodeForces-53C\":[\"Little Frog\",6852,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/53\\\"\\u003eCodeforces Beta Round 49 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-53B\":[\"Blog Photo\",1446,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/53\\\"\\u003eCodeforces Beta Round 49 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-53D\":[\"Physical Education\",2106,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/53\\\"\\u003eCodeforces Beta Round 49 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-MUL\":[\"Fast Multiplication\",8924,\"PAL\"],\"SPOJ-NGIRL\":[\"Namit In Trouble\",887,\"Own Problem\"],\"SPOJ-MAXWOODS\":[\"MAXIMUM WOOD CUTTER\",1574,\"Inspired from http://codeforces.com/problemset/problem/115/B\"],\"SPOJ-KPRIMESB\":[\"Almost Prime Numbers Again\",375,\"\"],\"CodeChef-CHEFKEY\":[\"Chef and Keyboard\",8222,\"berezin\"],\"UVA-11806\":[\"Cheerleaders\",2450,null],\"SPOJ-GNYR04C\":[\"Lennys Lucky Lotto Lists\",227,\"ACM Regionals 2004 North America - Greater NY\"],\"CodeForces-50B\":[\"Choosing Symbol Pairs\",6541,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/50\\\"\\u003eCodeforces Beta Round 47\\u003c/a\\u003e\"],\"CodeForces-50A\":[\"Domino piling\",248587,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/50\\\"\\u003eCodeforces Beta Round 47\\u003c/a\\u003e\"],\"CodeForces-134B\":[\"Pairs of Numbers\",2122,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/134\\\"\\u003eCodeforces Testing Round 3\\u003c/a\\u003e\"],\"CodeForces-134A\":[\"Average Numbers\",4217,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/134\\\"\\u003eCodeforces Testing Round 3\\u003c/a\\u003e\"],\"SPOJ-ADAFRIEN\":[\"Ada and Friends\",1053,\"Tunisian Collegiate Training Contest - Round #01\"],\"SPOJ-CITY2\":[\"A Famous City\",986,\"FDU Local Contest 2012\"],\"UVA-10944\":[\"Nuts for nuts..\",1002,null],\"UVALive-7998\":[\"Election\",26,\"Regionals 2016 \\u003e\\u003e North America - South Central USA\"],\"UVA-10949\":[\"Kids in a Grid\",220,null],\"UVA-10947\":[\"Bear with me, again..\",756,null],\"UVA-713\":[\"Adding Reversed Numbers\",9695,null],\"HackerRank-johnland\":[\"Roads in HackerLand\",567,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/june-world-codesprint\\u0027 target\\u003d\\u0027_blank\\u0027\\u003ejune-world-codesprint\\u003c/a\\u003e\"],\"SPOJ-DRTREE\":[\"Dynamically-Rooted Tree\",334,\"own problem\"],\"SPOJ-ADACABAA\":[\"Ada and Species\",104,\"\"],\"SPOJ-QTREE2\":[\"Query on a tree II\",5506,\"Special thanks to Ivan Krasilnikov for his alternative solution\"],\"CodeChef-HOGON\":[\"Hogathon\",28,\"codopediac3\"],\"CodeForces-51C\":[\"Three Base Stations\",2461,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/51\\\"\\u003eCodeforces Beta Round 48\\u003c/a\\u003e\"],\"CodeForces-133E\":[\"Logo Turtle\",30,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/133\\\"\\u003eCodeforces Beta Round 96 (Div. 2)\\u003c/a\\u003e\"],\"CodeChef-KTHCON\":[\"The potato problem\",131,\"xellos0\"],\"CodeForces-133A\":[\"HQ9+\",102678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/133\\\"\\u003eCodeforces Beta Round 96 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-133B\":[\"Unary\",9087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/133\\\"\\u003eCodeforces Beta Round 96 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-7988\":[\"Flow Shop\",27,\"Regionals 2016 \\u003e\\u003e \\tNorth America - North Central NA\"],\"SPOJ-FOXLINGS\":[\"Foxlings\",1196,\"Own problem\"],\"UVALive-7985\":[\"Bumper-to-Bumper Traffic\",20,\"Regionals 2016 \\u003e\\u003e \\tNorth America - North Central NA\"],\"UVALive-7502\":[\"Suffixes and Palindromes\",50,\"Regionals 2015 \\u003e\\u003e Asia - EC Final\"],\"UVA-10937\":[\"Blackbeard the Pirate\",669,null],\"SPOJ-EC_DIVS\":[\"Divisors\",100,\"Competencia CCBOL 2013\"],\"SPOJ-ADABANKET\":[\"Ada and Banquet\",298,\"\"],\"CodeForces-51E\":[\"Pentagon\",398,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/51\\\"\\u003eCodeforces Beta Round 48\\u003c/a\\u003e\"],\"CodeForces-51D\":[\"Geometrical problem\",488,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/51\\\"\\u003eCodeforces Beta Round 48\\u003c/a\\u003e\"],\"SPOJ-IITKWPCN\":[\"Playing With Balls\",1897,\"IITK ACA CSE online judge\"],\"UVA-10880\":[\"Colin and Ryan\",2028,null],\"UVA-11737\":[\"Extreme Primitive Society\",91,null],\"SPOJ-GDIL\":[\"Dilemma\",73,\"\"],\"UVA-10888\":[\"Warehouse\",595,null],\"CodeForces-346B\":[\"Lucky Common Subsequence\",3765,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/346\\\"\\u003eCodeforces Round 201 (Div. 1)\\u003c/a\\u003e\"],\"UVA-10405\":[\"Longest Common Subsequence\",16422,null],\"CodeForces-128D\":[\"Numbers\",1247,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/128\\\"\\u003eCodeforces Beta Round 94 (Div. 1 Only)\\u003c/a\\u003e\"],\"UVA-11733\":[\"Airports\",2744,null],\"UVALive-7899\":[\"Mr. Panda and Strips\",37,\"Regionals 2016 \\u003e\\u003e Asia - China Final\"],\"SPOJ-SUMPRIM2\":[\"Sum of primes (reverse mode)\",20,\"Own Problem\"],\"UVA-10887\":[\"Concatenation of Languages\",2317,null],\"SPOJ-RKS\":[\"RK Sorting\",1430,\"\"],\"UVA-11732\":[\"\\\"strcmp()\\\" Anyone?\",1660,null],\"SPOJ-POLICEMEN\":[\"Police Men\",401,\"Mine\"],\"SPOJ-SUMPRIM1\":[\"Sum of primes\",55,\"Own Problem\"],\"SPOJ-ADARAINB\":[\"Ada and Rain II\",126,\"\"],\"UVA-259\":[\"Software Allocation\",2833,null],\"SPOJ-IITKWPCA\":[\"Niceness of the string\",1345,\"IITK ACA CSE online judge\"],\"UVALive-6571\":[\"It Can Be Arranged\",219,\"Regionals 2013 \\u003e\\u003e Europe - Southwestern\"],\"SPOJ-IITKWPCC\":[\"Count right angle triangles\",50,\"IITK ACA CSE online judge\"],\"SPOJ-IITKWPCE\":[\"Let us play with strings\",319,\"IITK ACA CSE online judge\"],\"SPOJ-IITKWPCD\":[\"Partition the sticks\",109,\"\"],\"SPOJ-ADAFUROW\":[\"Ada and Furrows\",122,\"\"],\"SPOJ-ADACON\":[\"Ada and Connections\",83,\"\"],\"SPOJ-IITKWPCG\":[\"Help the old King\",702,\"IITK ACA CSE online judge\"],\"SPOJ-IITKWPCF\":[\"Help Feluda with mathematical equations\",276,\"IITK ACA CSE online judge\"],\"SPOJ-IITKWPCI\":[\"Find Lexicographically Smallest Permutation\",420,\"IITK ACA CSE online judge\"],\"SPOJ-IITKWPCH\":[\"Find Number Of Pair of Friends\",490,\"general problem\"],\"SPOJ-IITKWPCJ\":[\"Check the string Powers\",496,\"\"],\"SPOJ-IITKWPCM\":[\"Coprime Again\",68,\"IITK ACA CSE online judge\"],\"SPOJ-IITKWPCL\":[\"Find Distances In A Plane\",47,\"IITK ACA CSE online judge\"],\"UVA-10871\":[\"Primed Subsequence\",1408,null],\"UVA-10872\":[\"Triangles\",274,null],\"LightOJ-1052\":[\"String Growth\",444,null],\"CodeForces-127B\":[\"Canvas Frames\",8950,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/127\\\"\\u003eCodeforces Beta Round 93 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-11725\":[\"Colorful Board\",146,null],\"CodeForces-127A\":[\"Wasted Time\",11661,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/127\\\"\\u003eCodeforces Beta Round 93 (Div. 2 Only)\\u003c/a\\u003e\"],\"LightOJ-1057\":[\"Collecting Gold\",1086,null],\"LightOJ-1058\":[\"Parallelogram Counting\",1202,null],\"UVALive-7886\":[\"Assigning Teams\",417,\"Regionals 2016 \\u003e\\u003e Latin America\"],\"UVALive-7887\":[\"Back to the Future\",92,\"Regionals 2016 \\u003e\\u003e Latin America\"],\"SPOJ-ANAGR\":[\"Anagrams\",259,\"\"],\"UVALive-7892\":[\"Game of Matchings\",58,\"Regionals 2016 \\u003e\\u003e Latin America\"],\"CodeForces-696D\":[\"Legen...\",1334,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/696\\\"\\u003eCodeforces Round 362 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-FLWRS\":[\"Flowers\",323,\"(modified) Egyptian Olympiad in Informatics ( EOI ) 2009, August 14 - 21, Cairo\"],\"CodeForces-781C\":[\"Underground Lab\",84,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/781\\\"\\u003eCodeforces Round 403 (Div. 1, based on Technocup 2017 Finals)\\u003c/a\\u003e\"],\"UVA-10860\":[\"Many a Little makes a Mickle\",379,null],\"CodeForces-126D\":[\"Fibonacci Sums\",869,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/126\\\"\\u003eCodeforces Beta Round 93 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-126B\":[\"Password\",20587,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/126\\\"\\u003eCodeforces Beta Round 93 (Div. 1 Only)\\u003c/a\\u003e\"],\"SPOJ-KOLICA\":[\"Kolica\",61,\"Croatian Nationals 2007\"],\"SPOJ-BAPM\":[\"Base and Power\",206,\"\"],\"UVA-11710\":[\"Expensive subway\",1981,null],\"UVALive-6589\":[\"Captain Obvious and the Rabbit-Man\",34,\"Regionals 2013 \\u003e\\u003e Europe - Central\"],\"SPOJ-MAX_NUM\":[\"finding maximum possible number\",370,\"general\"],\"LightOJ-1018\":[\"Brush (IV)\",1296,null],\"LightOJ-1019\":[\"Brush (V)\",3233,null],\"UVA-11719\":[\"Gridland Airports\",185,null],\"UVALive-6591\":[\"Bus\",596,\"Regionals 2013 \\u003e\\u003e Europe - Central\"],\"UVA-11718\":[\"Fantasy of a Summation\",856,null],\"UVA-231\":[\"Testing the CATCHER\",7058,null],\"UVALive-6590\":[\"Digraphs\",200,\"Regionals 2013 \\u003e\\u003e Europe - Central\"],\"SPOJ-EQ2\":[\"A Famous Equation\",122,\"g201513\\u0027s own problem, used in FDU Local Contest 2012\"],\"SPOJ-ADACITY\":[\"Ada and Cities\",143,\"\"],\"UVA-10850\":[\"The Gossipy Gossipers Gossip Gossips\",260,null],\"SPOJ-GAME3\":[\"Yet Another Fancy Game\",254,\"originated from a mathematical problem\"],\"SPOJ-SUBLEX\":[\"Lexicographical Substring Search\",2950,\"Own Problem\"],\"CodeForces-125D\":[\"Two progressions\",442,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/125\\\"\\u003eCodeforces Testing Round 2\\u003c/a\\u003e\"],\"SPOJ-GAME2\":[\"Looks like Nim - but it is not\",102,\"idea of Goran Zuzic\"],\"CodeForces-125E\":[\"MST Company\",1141,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/125\\\"\\u003eCodeforces Testing Round 2\\u003c/a\\u003e\"],\"CodeForces-125C\":[\"Hobbits\\u0027 Party\",1033,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/125\\\"\\u003eCodeforces Testing Round 2\\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\"],\"LightOJ-1034\":[\"Hit the Light Switches\",1881,null],\"UVA-10854\":[\"Number of Paths\",544,null],\"UVALive-6584\":[\"Escape\",22,\"Regionals 2013 \\u003e\\u003e Europe - Central\"],\"UVA-247\":[\"Calling Circles\",5626,null],\"UVALive-6585\":[\"Draughts\",364,\"Regionals 2013 \\u003e\\u003e Europe - Central\"],\"UVALive-6582\":[\"Magical GCD\",382,\"Regionals 2013 \\u003e\\u003e Europe - Central\"],\"UVA-11709\":[\"Trust groups\",2279,null],\"UVALive-6583\":[\"Subway\",47,\"Regionals 2013 \\u003e\\u003e Europe - Central\"],\"UVA-10859\":[\"Placing Lampposts\",1594,null],\"SPOJ-ADAUNIQ\":[\"Ada and Unique Vegetable\",396,\"\"],\"SPOJ-GAMES\":[\"How Many Games?\",3856,\"\"],\"UVA-11770\":[\"Lighting Away\",2232,null],\"SPOJ-MAIN111\":[\"Strictly not a Prime\",376,\"own problem used in - http://www.spoj.pl/MAIN11/\"],\"LightOJ-1003\":[\"Drunk\",2400,null],\"SPOJ-MAIN113\":[\"Special String\",1105,\"\"],\"SPOJ-MAIN112\":[\"Re-Arrange II\",342,\"own problem used in - http://www.spoj.pl/MAIN11/\"],\"SPOJ-AFS\":[\"Amazing Factor Sequence\",2394,\"\"],\"CodeForces-786B\":[\"Legacy\",5871,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"UVA-218\":[\"Moth Eradication\",1784,null],\"CodeForces-786C\":[\"Till I Collapse\",2736,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/786\\\"\\u003eCodeforces Round 406 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-653D\":[\"Delivery Bears\",2836,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/653\\\"\\u003eIndiaHacks 2016 - Online Edition (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"SPOJ-EC_CONB\":[\"Even Numbers\",5532,\"\"],\"CodeForces-653E\":[\"Bear and Forgotten Tree 2\",1463,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/653\\\"\\u003eIndiaHacks 2016 - Online Edition (Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-92C\":[\"Newspaper Headline\",40,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/92\\\"\\u003eCodeforces Beta Round 75 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-92A\":[\"Chips\",19323,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/92\\\"\\u003eCodeforces Beta Round 75 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-92B\":[\"Binary Number\",5251,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/92\\\"\\u003eCodeforces Beta Round 75 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-11762\":[\"Race to 1\",1290,null],\"SPOJ-TSHOW1\":[\"Amusing numbers\",3274,\"AOL code contest\"],\"SPOJ-MAIN8_D\":[\"Coing tossing\",168,\"Own problem used for NSIT-IIITA Main contest #8\"],\"SPOJ-MAIN8_C\":[\"Shake Shake Shaky\",2984,\"Own problem used for NSIT-IIITA Main contest #8\"],\"SPOJ-CUTCAKE\":[\"Eat all the brownies !\",1581,\"\"],\"SPOJ-DCEPCA06\":[\"Saving BOB\",102,\"Own Problem\"],\"UVA-11768\":[\"Lattice Point or Not\",336,null],\"LightOJ-1010\":[\"Knights on a Chessboard\",6734,null],\"SPOJ-DCEPCA03\":[\"Totient Extreme\",1927,\"Own Problem\"],\"UVA-11769\":[\"All Souls Night\",148,null],\"SPOJ-DCEPCA09\":[\"MMM\",100,\"Own Problem\"],\"LightOJ-1005\":[\"Rooks\",4846,null],\"SPOJ-BADXOR\":[\"Bad XOR\",1126,\"\"],\"LightOJ-1007\":[\"Mathematically Hard\",4503,null],\"CodeForces-785B\":[\"Anton and Classes\",11134,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/785\\\"\\u003eCodeforces Round 404 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-A_W_S_N\":[\"Happy Valentine Day (Valentine Maze Game)\",168,\"My Love (A_W_S_N) \\\\(^_^)/ I love her since 2008 (when I was studying at EKASMA High School) until present ;-)\"],\"CodeForces-785E\":[\"Anton and Permutation\",1974,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/785\\\"\\u003eCodeforces Round 404 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-HAP01\":[\"Play with Binary Numbers\",562,\"own\"],\"SPOJ-ADAPET\":[\"Ada and Pet\",821,\"\"],\"CodeForces-785D\":[\"Anton and School - 2\",2928,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/785\\\"\\u003eCodeforces Round 404 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-MAIN8_E\":[\"Cover the string\",227,\"Own problem used for NSIT-IIITA Main contest #8\"],\"CodeForces-93E\":[\"Lostborn\",474,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/93\\\"\\u003eCodeforces Beta Round 76 (Div. 1 Only)\\u003c/a\\u003e\"],\"UVA-12604\":[\"Caesar Cipher\",539,null],\"SPOJ-CHGROOM\":[\"Room Change\",142,\"\"],\"UVA-11753\":[\"Creating Palindrome\",949,null],\"UVALive-6157\":[\"How do spiders walk on water?\",178,\"Regionals 2012 \\u003e\\u003e Europe - Southwestern\"],\"SPOJ-BNMT\":[\"Binary Matrix\",16,\"ACM ICPC Hatyai 2012\"],\"SPOJ-FRNDCIRC\":[\"FRIEND CIRCLE\",1392,\"\"],\"UVALive-6154\":[\"RNA Secondary Structure\",72,\"Regionals 2012 \\u003e\\u003e Europe - Southwestern\"],\"UVALive-6151\":[\"Beehives\",346,\"Regionals 2012 \\u003e\\u003e Europe - Southwestern\"],\"CodeForces-90E\":[\"Chip Play\",8,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/90\\\"\\u003eCodeforces Beta Round 74 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-SQUAREV1\":[\"Revenge of the squares (variation)\",485,\"\"],\"CodeForces-90B\":[\"African Crossword\",5739,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/90\\\"\\u003eCodeforces Beta Round 74 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-CUBEFR\":[\"Cube Free Numbers\",4485,\"Own. For alternate thanks Sayef Azad Sakin\"],\"UVA-10892\":[\"LCM Cardinality\",4559,null],\"UVA-10890\":[\"Maze\",354,null],\"CodeForces-129D\":[\"String\",85,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/129\\\"\\u003eCodeforces Beta Round 94 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-11747\":[\"Heavy Cycle Edges\",4265,null],\"CodeForces-129E\":[\"Games with Rectangle\",76,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/129\\\"\\u003eCodeforces Beta Round 94 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-10897\":[\"Travelling Distance\",428,null],\"CodeForces-129B\":[\"Students and Shoelaces\",12499,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/129\\\"\\u003eCodeforces Beta Round 94 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-10898\":[\"Combo Deal\",761,null],\"CodeForces-129A\":[\"Cookies\",23116,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/129\\\"\\u003eCodeforces Beta Round 94 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-698D\":[\"Limak and Shooting Points\",550,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/698\\\"\\u003eCodeforces Round 363 (Div. 1)\\u003c/a\\u003e\"],\"UVA-681\":[\"Convex Hull Finding\",2546,null],\"SPOJ-ADADUNG\":[\"Ada and Manure\",352,\"\"],\"UVA-200\":[\"Rare Order\",7300,null],\"UVA-10002\":[\"Center of Masses\",1797,null],\"UVA-11331\":[\"The Joys of Farming\",506,null],\"UVA-11330\":[\"Andy\\u0027s Shoes\",487,null],\"UVA-10480\":[\"Sabotage\",2546,null],\"SPOJ-TULIPNUM\":[\"Tulip And Numbers\",993,\"Own Problem\"],\"UVA-10007\":[\"Count the Trees\",2899,null],\"UVA-11338\":[\"Minefield\",385,null],\"UVA-10005\":[\"Packing polygons\",1649,null],\"SPOJ-ARRAYSUB\":[\"subarrays\",10331,\"own\"],\"CodeForces-742D\":[\"Arpa\\u0027s weak amphitheater and Mehrdad\\u0027s valuable Hoses\",210,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/742\\\"\\u003eCodeforces Round 383 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-875E\":[\"Delivery Club\",1027,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/875\\\"\\u003eCodeforces Round 441 (Div. 1, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-875F\":[\"Royal Questions\",1415,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/875\\\"\\u003eCodeforces Round 441 (Div. 1, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"Gym-100975F\":[\"Simple Calculations\",215,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100975\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2003-2004 Petrozavodsk Summer Training Camp, Saratov SU Contest\\u003c/a\\u003e\"],\"CodeChef-LYRC\":[\"Music \\u0026 Lyrics\",548,\"kaush_adm\"],\"UVA-11323\":[\"Satisfying Constraints\",90,null],\"UVA-12653\":[\"Buses\",221,null],\"SPOJ-NFACTOR\":[\"N-Factorful\",3268,\"Facebook Hacker Cup 2011 Round 1C\"],\"UVA-11327\":[\"Enumerating Rational Numbers\",1765,null],\"SPOJ-MOVIFAN\":[\"Movie Fan\",142,\"\"],\"UVA-11324\":[\"The Largest Clique\",2079,null],\"UVA-12655\":[\"Trucks\",445,null],\"SPOJ-NACCI\":[\"Nacci Fear\",333,\"Own problem\"],\"CodeForces-789C\":[\"Functions again\",379,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/789\\\"\\u003eCodeforces Round 407 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-789B\":[\"Masha and geometric depression\",4703,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/789\\\"\\u003eCodeforces Round 407 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-789D\":[\"Weird journey\",115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/789\\\"\\u003eCodeforces Round 407 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-EZDIJKST\":[\"Easy Dijkstra Problem\",6701,\"\"],\"CodeForces-741C\":[\"Arpa’s overnight party and Mehrdad’s silent entering\",2513,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/741\\\"\\u003eCodeforces Round 383 (Div. 1)\\u003c/a\\u003e\"],\"UVALive-6160\":[\"Countdown\",208,\"Regionals 2012 \\u003e\\u003e Europe - Southwestern\"],\"Gym-100625D\":[\"Destination Unknown\",243,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100625\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2013 Benelux Algorithm Programming Contest (BAPC 13)\\u003c/a\\u003e\"],\"CodeForces-741D\":[\"Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths\",2754,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/741\\\"\\u003eCodeforces Round 383 (Div. 1)\\u003c/a\\u003e\"],\"UVA-11795\":[\"Mega Man\\u0027s Mission\",1159,null],\"UVA-11312\":[\"Flipping Frustration\",197,null],\"UVALive-3917\":[\"Tiling a Grid With Dominoes\",183,\"Regionals 2007 \\u003e\\u003e North America - Greater NY\"],\"SPOJ-ADRABR\":[\"Adrita and Her Bike Ride\",203,\"\"],\"SPOJ-APS\":[\"Amazing Prime Sequence\",3673,\"\"],\"UVA-11790\":[\"Murcia\\u0027s Skyline\",3587,null],\"UVA-12645\":[\"Water Supply\",282,null],\"UVA-11798\":[\"Colorful Board 2\",94,null],\"UVA-12644\":[\"Vocabulary\",258,null],\"SPOJ-PAINTWAL\":[\"Paint on a Wall\",26,\"Fudan University Local Contest #3, by g201513\"],\"SPOJ-POP1\":[\"play with prime numbers (I)\",33,\"owner\"],\"CodeForces-873C\":[\"Strange Game On Matrix\",3543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/873\\\"\\u003eEducational Codeforces Round 30\\u003c/a\\u003e\"],\"SPOJ-POP2\":[\"play with prime numbers (II)\",34,\"owner\"],\"CodeForces-873B\":[\"Balanced Substring\",8868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/873\\\"\\u003eEducational Codeforces Round 30\\u003c/a\\u003e\"],\"SPOJ-POP3\":[\"play with prime numbers (III)(hard )\",31,\"owner\"],\"CodeForces-873E\":[\"Awards For Contestants\",524,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/873\\\"\\u003eEducational Codeforces Round 30\\u003c/a\\u003e\"],\"CodeForces-873F\":[\"Forbidden Indices\",1414,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/873\\\"\\u003eEducational Codeforces Round 30\\u003c/a\\u003e\"],\"UVA-11301\":[\"Great Wall of China\",298,null],\"UVA-11786\":[\"Global Raining at Bididibus\",801,null],\"UVA-12633\":[\"Super Rooks on Chessboard\",276,null],\"UVA-1571\":[\"How I Mathematician Wonder What You Are!\",103,null],\"CodeForces-787C\":[\"Berzerk\",119,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/787\\\"\\u003eCodeforces Round 406 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-CLSLDR\":[\"Class Leader\",188,\"\"],\"CodeForces-872B\":[\"Maximum of Maximums of Minimums\",773,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/872\\\"\\u003eCodeforces Round 440 (Div. 2, based on Technocup 2018 Elimination Round 2)\\u003c/a\\u003e\"],\"SPOJ-ADADIGIT\":[\"Ada and Digits 2\",71,\"Tunisian Collegiate Training Contest - Round #01\"],\"CodeForces-872D\":[\"Something with XOR Queries\",17,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/872\\\"\\u003eCodeforces Round 440 (Div. 2, based on Technocup 2018 Elimination Round 2)\\u003c/a\\u003e\"],\"SPOJ-ADABEHIVE\":[\"Ada and Behives\",386,\"\"],\"CodeForces-872C\":[\"Maximum splitting\",155,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/872\\\"\\u003eCodeforces Round 440 (Div. 2, based on Technocup 2018 Elimination Round 2)\\u003c/a\\u003e\"],\"CodeForces-872E\":[\"Points, Lines and Ready-made Titles\",25,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/872\\\"\\u003eCodeforces Round 440 (Div. 2, based on Technocup 2018 Elimination Round 2)\\u003c/a\\u003e\"],\"UVA-11377\":[\"Airport Setup\",903,null],\"UVALive-3939\":[\"Plucking fruits\",84,\"Regionals 2007 \\u003e\\u003e Asia - Nanjing\"],\"Gym-100753K\":[\"Upside down primes\",924,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100753\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 German Collegiate Programming Contest (GCPC 15) + POI 10-T3\\u003c/a\\u003e\"],\"UVA-11375\":[\"Matches\",818,null],\"UVA-11374\":[\"Airport Express\",2015,null],\"Gym-100886H\":[\"Biathlon 2.0\",238,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100886\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015-2016 Petrozavodsk Winter Training Camp, Saratov SU Contest\\u003c/a\\u003e\"],\"SPOJ-ESYR\":[\"Khaita kha\",173,\"\"],\"UVA-10048\":[\"Audiophobia\",8935,null],\"SPOJ-ADAHLIA\":[\"Ada and Dahlia\",23,\"Proposed by Mr. Puchýř\"],\"SPOJ-STRCOUNT\":[\"Counting binary strings\",345,\"folklore\"],\"CodeForces-879C\":[\"Short Program\",107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/879\\\"\\u003eCodeforces Round 443 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-879B\":[\"Table Tennis\",13469,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/879\\\"\\u003eCodeforces Round 443 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-746D\":[\"Green and Black Tea\",5486,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/746\\\"\\u003eCodeforces Round 386 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-879E\":[\"Tournament\",10,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/879\\\"\\u003eCodeforces Round 443 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADAGIFT\":[\"Ada and Birthday\",35,\"\"],\"CodeForces-746C\":[\"Tram\",4045,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/746\\\"\\u003eCodeforces Round 386 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-879D\":[\"Teams Formation\",16,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/879\\\"\\u003eCodeforces Round 443 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-746F\":[\"Music in Car\",832,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/746\\\"\\u003eCodeforces Round 386 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-831C\":[\"Jury Marks\",4721,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/831\\\"\\u003eCodeforces Round 424 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-746E\":[\"Numbers Exchange\",1822,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/746\\\"\\u003eCodeforces Round 386 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-831E\":[\"Cards Sorting\",71,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/831\\\"\\u003eCodeforces Round 424 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"CodeForces-746G\":[\"New Roads\",1426,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/746\\\"\\u003eCodeforces Round 386 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-831D\":[\"Office Keys\",186,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/831\\\"\\u003eCodeforces Round 424 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"UVA-11380\":[\"Down Went The Titanic\",980,null],\"Gym-100753B\":[\"Bounty Hunter II\",535,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100753\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 German Collegiate Programming Contest (GCPC 15) + POI 10-T3\\u003c/a\\u003e\"],\"CodeForces-831F\":[\"Bamboo Partition\",19,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/831\\\"\\u003eCodeforces Round 424 (Div. 2, rated, based on VK Cup Finals)\\u003c/a\\u003e\"],\"Gym-100753A\":[\"A Journey to Greece\",451,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100753\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 German Collegiate Programming Contest (GCPC 15) + POI 10-T3\\u003c/a\\u003e\"],\"UVA-10034\":[\"Freckles\",10950,null],\"UVA-11365\":[\"Copying DNA\",44,null],\"UVA-11361\":[\"Investigating Div-Sum Property\",1097,null],\"SPOJ-SERGRID\":[\"Grid\",1028,\"ACM SER 2015\"],\"CodeForces-879A\":[\"Borya\\u0027s Diagnosis\",9802,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/879\\\"\\u003eCodeforces Round 443 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-745E\":[\"Hongcow Buys a Deck of Cards\",10,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/745\\\"\\u003eCodeforces Round 385 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-SPCE\":[\"Gopu and Combinatorics on Graphs\",85,\"IITK ACA CSE online judge\"],\"SPOJ-SPCJ\":[\"Gopu and Create Collections Part Two\",262,\"IITK ACA CSE online judge\"],\"SPOJ-SPCM\":[\"Gopu and function\",226,\"IITK ACA CSE online judge\"],\"SPOJ-SPCO\":[\"Gopu and Counting Bitwise Prime Numbers\",243,\"IITK ACA CSE online judge\"],\"UVA-11355\":[\"Cool Points\",164,null],\"UVA-11353\":[\"A Different Kind of Sorting\",1024,null],\"UVA-10023\":[\"Square root\",2115,null],\"UVA-11354\":[\"Bond\",1590,null],\"UVA-11351\":[\"Last Man Standing\",1068,null],\"UVA-11352\":[\"Crazy King\",1856,null],\"SPOJ-CRAYON\":[\"Crayon\",130,\"Own Problem\"],\"SPOJ-SPCU\":[\"Gopu and Validity of Arrangement\",1671,\"IITK ACA CSE online judge\"],\"SPOJ-ETF\":[\"Euler Totient Function\",12732,\"\"],\"UVA-12206\":[\"Stammering Aliens\",609,null],\"SPOJ-ADACYCLE\":[\"Ada and Cycle\",1002,\"\"],\"CodeForces-877C\":[\"Slava and tanks\",6163,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-659E\":[\"New Reform\",7823,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/659\\\"\\u003eCodeforces Round 346 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-744A\":[\"Hongcow Builds A Nation\",8365,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/744\\\"\\u003eCodeforces Round 385 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-877B\":[\"Nikita and string\",10713,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-877E\":[\"Danil and a Part-time Job\",4705,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-877D\":[\"Olya and Energy Drinks\",4439,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-877F\":[\"Ann and Books\",1727,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/877\\\"\\u003eCodeforces Round 442 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADACUT\":[\"Ada and Alley\",381,\"\"],\"UVA-10013\":[\"Super long sums\",7258,null],\"UVA-10497\":[\"Sweet Child Makes Trouble\",1359,null],\"UVA-11344\":[\"The Huge One\",1919,null],\"UVA-11343\":[\"Isolated Segments\",1205,null],\"UVA-10496\":[\"Collecting Beepers\",4875,null],\"SPOJ-NDS\":[\"Increasing numbers\",669,\"\"],\"UVA-10494\":[\"If We Were a Child Again\",4635,null],\"SPOJ-LOPOV\":[\"Lopov\",323,\"COCI 2013 1. round\"],\"UVALive-3943\":[\"Liking\\u0027s Letter\",78,\"Regionals 2007 \\u003e\\u003e Asia - Nanjing\"],\"UVA-11348\":[\"Exhibition\",1154,null],\"HackerRank-black-box-1\":[\"The Black Box\",10,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/w8\\u0027 target\\u003d\\u0027_blank\\u0027\\u003ew8\\u003c/a\\u003e\"],\"CodeForces-876B\":[\"Divisiblity of Differences\",9526,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/876\\\"\\u003eCodeforces Round 441 (Div. 2, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"SPOJ-ADACAROT\":[\"Ada and Carrot\",137,\"\"],\"CodeForces-876D\":[\"Sorting the Coins\",101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/876\\\"\\u003eCodeforces Round 441 (Div. 2, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-876C\":[\"Classroom Watch\",332,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/876\\\"\\u003eCodeforces Round 441 (Div. 2, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"SPOJ-FUNFACT\":[\"Factorial challenge\",349,\"Own problem\"],\"SPOJ-PSTR\":[\"Number of Prime Strings\",99,\"CodeCraft 11\"],\"CodeForces-743E\":[\"Vladik and cards\",1645,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/743\\\"\\u003eCodeforces Round 384 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-876F\":[\"High Cry\",26,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/876\\\"\\u003eCodeforces Round 441 (Div. 2, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"SPOJ-RIOI_3_2\":[\"Counting\",92,\"Known Problem\"],\"CodeForces-610D\":[\"Vika and Segments\",1505,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/610\\\"\\u003eCodeforces Round 337 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-876E\":[\"National Property\",33,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/876\\\"\\u003eCodeforces Round 441 (Div. 2, by Moscow Team Olympiad)\\u003c/a\\u003e\"],\"CodeForces-44E\":[\"Anfisa the Monkey\",5242,\"\\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-44A\":[\"Indian Summer\",12111,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/44\\\"\\u003eSchool Team Contest 2 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"UVA-12144\":[\"Almost Shortest Path\",909,null],\"SPOJ-RANDG\":[\"Red And Green\",256,\"Topcoder\"],\"CodeForces-44B\":[\"Cola\",2292,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/44\\\"\\u003eSchool Team Contest 2 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"SPOJ-TIPTOP\":[\"Tip Top Game\",1997,\"\"],\"SPOJ-ABA12A\":[\"Help Balaji!\",1182,\"Own problem\"],\"SPOJ-ADATOMEL\":[\"Ada and Tomel\",38,\"\"],\"SPOJ-ABA12D\":[\"Sum of divisors!\",2449,\"Own problem\"],\"SPOJ-ABA12E\":[\"Shooting the balloons!\",371,\"Own problem\"],\"CodeForces-714C\":[\"Sonya and Queries\",256,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/714\\\"\\u003eCodeforces Round 371 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-847D\":[\"Dog Show\",1099,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"SPOJ-PUCMM210\":[\"A Summatory\",1751,\"Used in 2nd dominican ACM-ICPC Warm Up 2012 Competition in PUCMM\"],\"CodeForces-847C\":[\"Sum of Nestings\",2584,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-714D\":[\"Searching Rectangles\",18,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/714\\\"\\u003eCodeforces Round 371 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADANUM\":[\"Ada and Numbering\",160,\"\"],\"CodeForces-847E\":[\"Packmen\",2972,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"SPOJ-BLINNET\":[\"Bytelandian Blingors Network\",4202,\"PAL\"],\"UVALive-8078\":[\"Bracket Sequence\",281,\"Regionals 2017 \\u003e\\u003e Asia - Dhaka\"],\"CodeForces-847J\":[\"Students Initiation\",678,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"SPOJ-ADATREE\":[\"Ada and Trees\",248,\"Tunisian Collegiate Training Contest - Round #01\"],\"SPOJ-MYQ8\":[\"The National Game\",68,\"Bytecode 2012\"],\"CodeForces-847K\":[\"Travel Cards\",1634,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"SPOJ-ACPC10D\":[\"Tri graphs\",5037,\"ACPC 2010\"],\"SPOJ-TRKNIGHT\":[\"Travelling Knight\",50,\"own problem used for Codechef Snackdown Onsite\"],\"SPOJ-SABBIRGAME\":[\"Sabbir and Game\",878,\"\"],\"CodeForces-45D\":[\"Event Dates\",1724,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/45\\\"\\u003eSchool Team Contest 3 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"CodeForces-45C\":[\"Dancing Lessons\",1064,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/45\\\"\\u003eSchool Team Contest 3 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"SPOJ-GONE\":[\"G-One Numbers\",2378,\"Own\"],\"Gym-101047J\":[\"The Kamphaeng Phet\\u0027s Chedis\",59,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101047\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 USP Try-outs\\u003c/a\\u003e\"],\"Gym-101047I\":[\"The Kunming-Singapore Railway\",12,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101047\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 USP Try-outs\\u003c/a\\u003e\"],\"UVALive-2755\":[\"Hidden Password\",538,\"Regionals 2003 \\u003e\\u003e Europe - Southeastern\"],\"Gym-101047H\":[\"Guarding the Temples\",110,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101047\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015 USP Try-outs\\u003c/a\\u003e\"],\"CodeForces-847B\":[\"Preparing for Merge Sort\",5008,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/847\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-846C\":[\"Four Segments\",2746,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"CodeForces-846B\":[\"Math Show\",2629,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"CodeForces-713D\":[\"Animals and Puzzle\",1227,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/713\\\"\\u003eCodeforces Round 371 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-846E\":[\"Chemistry in Berland\",901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"SPOJ-PUCMM223\":[\"C You and Me\",96,\"Used in 3rd PUCMM Olympiad 2012 (1st phase)\"],\"CodeForces-713C\":[\"Sonya and Problem Wihtout a Legend\",5169,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/713\\\"\\u003eCodeforces Round 371 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-846D\":[\"Monitor\",2662,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"CodeForces-846F\":[\"Random Query\",2385,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/846\\\"\\u003eEducational Codeforces Round 28\\u003c/a\\u003e\"],\"Gym-101482G\":[\"Gathering\",91,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101482\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014-2015 Northwestern European Regional Contest (NWERC 2014)\\u003c/a\\u003e\"],\"UVA-11291\":[\"Smeech\",521,null],\"UVA-1395\":[\"Slim Span\",3472,null],\"SPOJ-VECTAR11\":[\"Game of Squares\",622,\"\"],\"UVA-1394\":[\"And Then There Was One\",962,null],\"CodeForces-42C\":[\"Safe cracking\",492,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/42\\\"\\u003eCodeforces Beta Round 41\\u003c/a\\u003e\"],\"CodeForces-42B\":[\"Game of chess unfinished\",1008,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/42\\\"\\u003eCodeforces Beta Round 41\\u003c/a\\u003e\"],\"SPOJ-POWERCAR\":[\"Car with powers\",346,\"\"],\"SPOJ-DTPOLY\":[\"Divide Polygon\",33,\"\"],\"CodeForces-42A\":[\"Guilty --- to the kitchen!\",3170,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/42\\\"\\u003eCodeforces Beta Round 41\\u003c/a\\u003e\"],\"UVALive-2308\":[\"Deeper Blue\",9,\"Regionals 2001 \\u003e\\u003e North America - South Central USA\"],\"UVA-11273\":[\"Warping N Dimensional Space\",51,null],\"SPOJ-NDIVPHI\":[\"N DIV PHI_N\",750,\"ProjectEuler\"],\"UVALive-4963\":[\"3-sided dice\",115,\"Regionals 2010 \\u003e\\u003e Europe - Southwestern\"],\"CodeForces-845B\":[\"Luba And The Ticket\",5410,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"CodeForces-627D\":[\"Preorder Test\",863,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/627\\\"\\u003e8VC Venture Cup 2016 - Final Round\\u003c/a\\u003e\"],\"CodeForces-712C\":[\"Memory and De-Evolution\",6120,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/712\\\"\\u003eCodeforces Round 370 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-845D\":[\"Driving Test\",2513,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"CodeForces-845C\":[\"Two TVs\",8556,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"CodeForces-712D\":[\"Memory and Scores\",1879,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/712\\\"\\u003eCodeforces Round 370 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-845E\":[\"Fire in the City\",618,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"Gym-101485E\":[\"Elementary Math\",879,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101485\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015-2016 Northwestern European Regional Contest (NWERC 2015)\\u003c/a\\u003e\"],\"CodeForces-845G\":[\"Shortest Path Problem?\",1577,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/845\\\"\\u003eEducational Codeforces Round 27\\u003c/a\\u003e\"],\"UVA-11281\":[\"Triangular Pegs in Round Holes\",337,null],\"UVA-11282\":[\"Mixing Invitations\",666,null],\"SPOJ-CNTINDX\":[\"Count The Indexes\",297,\"\"],\"SPOJ-ADAFIELD\":[\"Ada and Field\",678,\"\"],\"SPOJ-WAGE\":[\"Wood, Axe and Grass\",513,\"Own\"],\"CodeForces-43D\":[\"Journey\",1115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/43\\\"\\u003eCodeforces Beta Round 42 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-43C\":[\"Lucky Tickets\",4483,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/43\\\"\\u003eCodeforces Beta Round 42 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11265\":[\"The Sultan\\u0027s Problem\",551,null],\"SPOJ-ADAMONEY\":[\"Ada and Economy\",144,\"\"],\"UVA-11266\":[\"Equations\",105,null],\"UVALive-4957\":[\"Fake scoreboard\",163,\"Regionals 2010 \\u003e\\u003e Europe - Southwestern\"],\"CodeForces-43B\":[\"Letter\",16833,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/43\\\"\\u003eCodeforces Beta Round 42 (Div. 2)\\u003c/a\\u003e\"],\"UVA-12593\":[\"Next Generation Macaw\",135,null],\"UVA-11262\":[\"Weird Fence\",530,null],\"SPOJ-PCPC12I\":[\"peaks\",82,\"The First Palestinian Collegiate Programming Contest\"],\"SPOJ-SUBMERGE\":[\"Submerging Islands\",4934,\"MiniMaraton 2013 - UCV\"],\"UVALive-4956\":[\"Comparing answers\",247,\"Regionals 2010 \\u003e\\u003e Europe - Southwestern\"],\"SPOJ-MSUBSTR\":[\"Mirror Strings !!!\",1043,\"MNNIT OPC 21-09-2012\"],\"CodeForces-759C\":[\"Nikita and stack\",17,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/759\\\"\\u003eCodeforces Round 393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition)\\u003c/a\\u003e\"],\"CodeForces-844C\":[\"Sorting by Subsequences\",111,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/844\\\"\\u003eAIM Tech Round 4 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-844B\":[\"Rectangles\",7540,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/844\\\"\\u003eAIM Tech Round 4 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-844E\":[\"Upgrading Tree\",0,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/844\\\"\\u003eAIM Tech Round 4 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-844D\":[\"Interactive LowerBound\",28,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/844\\\"\\u003eAIM Tech Round 4 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-711E\":[\"ZS and The Birthday Paradox\",1317,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/711\\\"\\u003eCodeforces Round 369 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-8086\":[\"Substring Sorting\",53,\"Regionals 2017 \\u003e\\u003e Asia - Dhaka\"],\"UVALive-8085\":[\"Divisors\",97,\"Regionals 2017 \\u003e\\u003e Asia - Dhaka\"],\"UVALive-8080\":[\"Christmas Tree\",188,\"Regionals 2017 \\u003e\\u003e Asia - Dhaka\"],\"CodeForces-140C\":[\"New Year Snowmen\",5020,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/140\\\"\\u003eCodeforces Round 100\\u003c/a\\u003e\"],\"SPOJ-ADAPATH\":[\"Ada and Path\",114,\"\"],\"CodeForces-140A\":[\"New Year Table\",4641,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/140\\\"\\u003eCodeforces Round 100\\u003c/a\\u003e\"],\"SPOJ-CNT_LUCK\":[\"Counting Lucky Numbers\",186,\"general\"],\"UVA-12189\":[\"Dinner Hall\",136,null],\"UVALive-4507\":[\"Darts\",152,\"Regionals 2009 \\u003e\\u003e Europe - Southwestern\"],\"SPOJ-ADATOMAT\":[\"Ada and Tomato\",54,\"\"],\"CodeForces-48D\":[\"Permutations\",2682,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/48\\\"\\u003eSchool Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"UVA-12187\":[\"Brothers\",941,null],\"UVA-12186\":[\"Another Crisis\",3109,null],\"UVA-1345\":[\"Jamie\\u0027s Contact Groups\",190,null],\"CodeForces-48A\":[\"Rock-paper-scissors\",6101,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/48\\\"\\u003eSchool Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"SPOJ-FACEFRND\":[\"Friends of Friends\",7978,\"Own Problem\"],\"CodeForces-719B\":[\"Anatoly and Cockroaches\",9272,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/719\\\"\\u003eCodeforces Round 373 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-48B\":[\"Land Lot\",3002,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/48\\\"\\u003eSchool Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-719C\":[\"Efim and Strange Grade\",140,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/719\\\"\\u003eCodeforces Round 373 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-803D\":[\"Magazine Ad\",3398,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-803C\":[\"Maximal GCD\",5493,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-803F\":[\"Coprime Subsequences\",3204,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-803E\":[\"Roma and Poker\",2214,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"CodeForces-803G\":[\"Periodic RMQ Problem\",1336,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/803\\\"\\u003eEducational Codeforces Round 20\\u003c/a\\u003e\"],\"SPOJ-SEUG\":[\"Seetha’s Unique Game\",312,\"\"],\"UVA-12194\":[\"Isosceles Triangles\",200,null],\"UVA-12192\":[\"Grapevine\",1860,null],\"UVA-12191\":[\"File Recover\",187,null],\"SPOJ-ADATRIP\":[\"Ada and Trip\",1304,\"\"],\"SPOJ-AUT\":[\"Vending Machine\",33,\"AMPPZ 2012\"],\"SPOJ-SUBSET\":[\"Balanced Cow Subsets\",408,\"Usaco open 2012\"],\"UVA-12179\":[\"Randomly-priced Tickets\",161,null],\"UVA-13024\":[\"Saint John Festival\",134,null],\"UVA-12176\":[\"Bring Your Own Horse\",284,null],\"CodeForces-49D\":[\"Game\",2208,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/49\\\"\\u003eCodeforces Beta Round 46 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-718C\":[\"Sasha and Array\",3766,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/718\\\"\\u003eCodeforces Round 373 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-718D\":[\"Andrew and Chemistry\",433,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/718\\\"\\u003eCodeforces Round 373 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-802C\":[\"Heidi and Library (hard)\",590,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"SPOJ-ADFRUITS\":[\"Advanced Fruits\",2646,\"University of Ulm Local Contest 1999\"],\"CodeForces-802B\":[\"Heidi and Library (medium)\",1085,\"\\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-802I\":[\"Fake News (hard)\",1489,\"\\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-802H\":[\"Fake News (medium)\",451,\"\\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-802K\":[\"Send the Fool Further! (medium)\",631,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"UVA-13030\":[\"Brain Fry\",36,null],\"SPOJ-HLP_RAMS\":[\"Topper Rama Rao\",1147,\"My own Problem\"],\"UVA-12181\":[\"The Merchant Guild\",23,null],\"CodeForces-802N\":[\"April Fools\\u0027 Problem (medium)\",1106,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/802\\\"\\u003eHelvetic Coding Contest 2017 online mirror (teams allowed, unrated)\\u003c/a\\u003e\"],\"UVA-12169\":[\"Disgruntled Judge\",1783,null],\"CodeForces-46C\":[\"Hamsters and Tigers\",2748,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/46\\\"\\u003eSchool Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"CodeForces-46B\":[\"T-shirts from Sponsor\",3939,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/46\\\"\\u003eSchool Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"UVA-13010\":[\"Galactic taxes\",181,null],\"CodeForces-46A\":[\"Ball Game\",9019,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/46\\\"\\u003eSchool Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)\\u003c/a\\u003e\"],\"UVALive-3673\":[\"Black-White Grid\",159,\"Regionals 2006 \\u003e\\u003e Asia - Hanoi\"],\"SPOJ-BRDGHRD\":[\"Building Bridges(HARD)\",502,\"Based on: Building Bridges By Troika::Bytes\"],\"SPOJ-FACT2\":[\"Integer Factorization (29 digits)\",107,\"\"],\"SPOJ-FACT1\":[\"Integer Factorization (20 digits)\",575,\"\"],\"SPOJ-FACT0\":[\"Integer Factorization (15 digits)\",4422,\"\"],\"CodeForces-934D\":[\"A Determined Cleanup\",25,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/934\\\"\\u003eCodeforces Round 462 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-716D\":[\"Complete The Graph\",127,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/716\\\"\\u003eCodeforces Round 372 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-849E\":[\"Goodbye Souvenir\",27,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/849\\\"\\u003eCodeforces Round 431 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-801C\":[\"Voltage Keepsake\",211,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/801\\\"\\u003eCodeforces Round 409 (rated, Div. 2, based on VK Cup 2017 Round 2)\\u003c/a\\u003e\"],\"CodeForces-801E\":[\"Vulnerable Kerbals\",10,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/801\\\"\\u003eCodeforces Round 409 (rated, Div. 2, based on VK Cup 2017 Round 2)\\u003c/a\\u003e\"],\"SPOJ-NNS\":[\"Nearest Neighbor Search\",12,\"\"],\"UVA-12173\":[\"White Water Rafting\",70,null],\"UVA-12172\":[\"Matchsticks\",222,null],\"UVA-12159\":[\"Gun Fight\",181,null],\"CodeForces-47D\":[\"Safe\",886,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/47\\\"\\u003eCodeforces Beta Round 44 (Div. 2)\\u003c/a\\u003e\"],\"UVA-12154\":[\"Shrinking Polygons\",99,null],\"UVA-13000\":[\"VIP Treatment\",58,null],\"UVALive-4513\":[\"Stammering Aliens\",901,\"Regionals 2009 \\u003e\\u003e Europe - Southwestern\"],\"CodeForces-47B\":[\"Coins\",14316,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/47\\\"\\u003eCodeforces Beta Round 44 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-4510\":[\"Slalom\",146,\"Regionals 2009 \\u003e\\u003e Europe - Southwestern\"],\"CodeForces-849B\":[\"Tell Your World\",3767,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/849\\\"\\u003eCodeforces Round 431 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-934A\":[\"A Compatible Pair\",7461,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/934\\\"\\u003eCodeforces Round 462 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-716C\":[\"Plus and Square Root\",214,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/716\\\"\\u003eCodeforces Round 372 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-849D\":[\"Rooter\\u0027s Song\",11,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/849\\\"\\u003eCodeforces Round 431 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-849C\":[\"From Y to Y\",147,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/849\\\"\\u003eCodeforces Round 431 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-715C\":[\"Digit Tree\",2039,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/715\\\"\\u003eCodeforces Round 372 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-TREEDEGREE\":[\"Degree of a Tree\",229,\"SBU Newbies Programming Contest 2017\"],\"SPOJ-SEGSQRSS\":[\"Sum of Squares with Segment Tree\",2251,\"\"],\"UVA-1376\":[\"Animal Run\",304,null],\"SPOJ-DCEPC810\":[\"Cousin Wars\",50,\"Own Problem\"],\"CodeForces-84B\":[\"Magical Array\",167,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/84\\\"\\u003eCodeforces Beta Round 72 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-144C\":[\"Anagram Search\",4226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/144\\\"\\u003eCodeforces Round 103 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-GOODB\":[\"Good Predictions\",1171,\"Own problem\"],\"CodeForces-144D\":[\"Missile Silos\",4281,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/144\\\"\\u003eCodeforces Round 103 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-GOODE\":[\"Good Debugging\",58,\"Own problem\"],\"UVA-10800\":[\"Not That Kind of Graph\",1902,null],\"CodeForces-808C\":[\"Tea Party\",6905,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"CodeForces-808E\":[\"Selling Souvenirs\",1922,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"CodeForces-808D\":[\"Array Division\",7362,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"CodeForces-808G\":[\"Anthem of Berland\",2707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"CodeForces-808F\":[\"Card Game\",1186,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/808\\\"\\u003eEducational Codeforces Round 21\\u003c/a\\u003e\"],\"UVA-657\":[\"The die is cast\",3412,null],\"UVA-10806\":[\"Dijkstra, Dijkstra.\",2042,null],\"UVA-10804\":[\"Gopher Strategy\",516,null],\"UVA-13085\":[\"Forming Teams\",167,null],\"UVA-13083\":[\"Yet another GCDSUM\",114,null],\"CodeForces-84D\":[\"Doctor\",14,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/84\\\"\\u003eCodeforces Beta Round 72 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-MATCHING\":[\"Fast Maximum Matching\",2140,\"\"],\"CodeForces-85A\":[\"Domino\",1850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/85\\\"\\u003eYandex.Algorithm 2011: Round 1\\u003c/a\\u003e\"],\"CodeForces-85D\":[\"Sum of Medians\",2315,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/85\\\"\\u003eYandex.Algorithm 2011: Round 1\\u003c/a\\u003e\"],\"CodeForces-276D\":[\"Little Girl and Maximum XOR\",14200,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/276\\\"\\u003eCodeforces Round 169 (Div. 2)\\u003c/a\\u003e\"],\"UVA-13068\":[\"The Weakest Link\",48,null],\"UVA-13067\":[\"Prime Kebab Menu\",299,null],\"SPOJ-PARSUMS\":[\"Nonnegative Partial Sums\",539,\"Southwestern Europe Regional, SWERC 2011\"],\"CodeForces-807C\":[\"Success Rate\",246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/807\\\"\\u003eCodeforces Round 412 (rated, Div. 2, base on VK Cup 2017 Round 3)\\u003c/a\\u003e\"],\"CodeForces-807E\":[\"Prairie Partition\",9,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/807\\\"\\u003eCodeforces Round 412 (rated, Div. 2, base on VK Cup 2017 Round 3)\\u003c/a\\u003e\"],\"SPOJ-BDOI16B\":[\"Beautiful Factorial Game\",203,\"Bangladesh Olympiad on Informatics 2016 National; Problem Setter: Rakibul Islam\"],\"CodeForces-82A\":[\"Double Cola\",31459,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/82\\\"\\u003eYandex.Algorithm 2011: Qualification 2\\u003c/a\\u003e\"],\"UVA-13058\":[\"Baking Cakes with Grandma\",31,null],\"UVA-13057\":[\"Prove Them All\",157,null],\"CodeChef-SMPLSUM\":[\"Simple Sum\",1237,\"kaizer\"],\"UVALive-5418\":[\"A Plug for UNIX\",41,\"Regionals 1999 \\u003e\\u003e North America - East Central NA\"],\"SPOJ-KQUERYO\":[\"K-Query Online\",2074,\"\"],\"CodeForces-805F\":[\"Expected diameter of a tree\",16,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/805\\\"\\u003eCodeforces Round 411 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-805E\":[\"Ice cream coloring\",58,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/805\\\"\\u003eCodeforces Round 411 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-SGIFT\":[\"Sabbir and gifts\",406,\"\"],\"HackerRank-minimum-transformation-cost\":[\"Minimum Transformation Cost\",1291,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/morgan-stanley-2015\\u0027 target\\u003d\\u0027_blank\\u0027\\u003emorgan-stanley-2015\\u003c/a\\u003e\"],\"SPOJ-AROPE\":[\"Alphabetic Rope\",219,\"MySelf\"],\"CodeForces-141D\":[\"Take-off Ramps\",944,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/141\\\"\\u003eCodeforces Round 101 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-SBO\":[\"MAXIMUM RARITY\",94,\"Own\"],\"CodeForces-141E\":[\"Clearing Up\",906,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/141\\\"\\u003eCodeforces Round 101 (Div. 2)\\u003c/a\\u003e\"],\"HackerRank-nearby-attractions\":[\"Nearby Attractions\",191,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/booking-hackathon\\u0027 target\\u003d\\u0027_blank\\u0027\\u003ebooking-hackathon\\u003c/a\\u003e\"],\"CodeForces-141B\":[\"Hopscotch\",5671,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/141\\\"\\u003eCodeforces Round 101 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-141C\":[\"Queue\",2663,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/141\\\"\\u003eCodeforces Round 101 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-UCV2013E\":[\"Greedy Walking\",688,\"Local UCV 2013. Fernando Crema\"],\"Gym-100114J\":[\"Computer Network\",192,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100114\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2012-2013 ACM-ICPC, NEERC, Central Subregional Contest\\u003c/a\\u003e\"],\"CodeForces-141A\":[\"Amusing Joke\",83941,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/141\\\"\\u003eCodeforces Round 101 (Div. 2)\\u003c/a\\u003e\"],\"UVA-12197\":[\"Trick or Treat\",343,null],\"SPOJ-UCV2013J\":[\"Valences\",1277,\"Local UCV 2013. Walter Hernández\"],\"UVA-12196\":[\"Klingon Levels\",101,null],\"SPOJ-STREETR\":[\"Street Trees\",3079,\"2010 KOI High School Division\"],\"CodeForces-805C\":[\"Find Amir\",976,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/805\\\"\\u003eCodeforces Round 411 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADAPRIME\":[\"Ada and Prime\",78,\"\"],\"CodeForces-83D\":[\"Numbers\",888,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/83\\\"\\u003eCodeforces Beta Round 72 (Div. 1 Only)\\u003c/a\\u003e\"],\"SPOJ-UCV2013A\":[\"Counting Ids\",1942,\"Local UCV 2013. Héctor Navarro\"],\"CodeForces-40A\":[\"Find Color\",4255,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/40\\\"\\u003eCodeforces Beta Round 39\\u003c/a\\u003e\"],\"CodeForces-88E\":[\"Interesting Game\",24,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/88\\\"\\u003eCodeforces Beta Round 73 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-GCD2\":[\"GCD2\",7014,\"My own Resource\"],\"SPOJ-ALTSEQ\":[\"Alternating Sequences\",2351,\"Hackerrank\"],\"CodeForces-148E\":[\"Porcelain\",4349,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/148\\\"\\u003eCodeforces Round 105 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-88C\":[\"Trains\",141,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/88\\\"\\u003eCodeforces Beta Round 73 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-JOCHEF\":[\"Farmer Sepp\",323,\"Josef Ziegler\"],\"UVALive-7619\":[\"Guessing the Dice Roll\",29,\"Regionals 2016 \\u003e\\u003e Asia - Shenyang\"],\"CodeForces-148D\":[\"Bag of mice\",8669,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/148\\\"\\u003eCodeforces Round 105 (Div. 2)\\u003c/a\\u003e\"],\"UVA-619\":[\"Numerically Speaking\",1478,null],\"CodeForces-148A\":[\"Insomnia cure\",91616,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/148\\\"\\u003eCodeforces Round 105 (Div. 2)\\u003c/a\\u003e\"],\"UVA-10844\":[\"Bloques\",275,null],\"CodeForces-148B\":[\"Escape\",5932,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/148\\\"\\u003eCodeforces Round 105 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-7616\":[\"Counting Cliques\",118,\"Regionals 2016 \\u003e\\u003e Asia - Shenyang\"],\"UVALive-7613\":[\"Relative atomic mass\",175,\"Regionals 2016 \\u003e\\u003e Asia - Shenyang\"],\"SPOJ-NTICKETS\":[\"Nlogonian Tickets\",403,\"UFPR/Own problem\"],\"CodeChef-DISTNUM3\":[\"Primitive Queries\",236,\"mgch\"],\"SPOJ-SPEC_SET\":[\"Special Set\",119,\"My own Problem\"],\"Gym-100818E\":[\"Taxies\",28,\"2015-2016 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2015)\"],\"SPOJ-ABCPATH\":[\"ABC Path\",8405,\"FCIS Local Contest 2012\"],\"CodeForces-41D\":[\"Pawn\",2323,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/41\\\"\\u003eCodeforces Beta Round 40 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-41C\":[\"Email address\",4030,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/41\\\"\\u003eCodeforces Beta Round 40 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-UPDATEIT\":[\"Update the array !\",6036,\"Own\"],\"CodeForces-147B\":[\"Smile House\",829,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/147\\\"\\u003eCodeforces Testing Round 4\\u003c/a\\u003e\"],\"UVALive-7606\":[\"Percolation\",213,\"Regionals 2016 \\u003e\\u003e Asia - Daejeon\"],\"CodeForces-147A\":[\"Punctuation\",3902,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/147\\\"\\u003eCodeforces Testing Round 4\\u003c/a\\u003e\"],\"SPOJ-NOVICE43\":[\"Problem 3\",731,\"NSIT Noivce contest #4\"],\"UVA-10830\":[\"A New Function\",756,null],\"UVALive-7601\":[\"Football\",182,\"Regionals 2016 \\u003e\\u003e Asia - Daejeon\"],\"UVA-623\":[\"500!\",10198,null],\"CodeChef-MGCHGEOM\":[\"Misha and Geometry\",45,\"mgch\"],\"SPOJ-HPYNOSII\":[\"Happy Numbers II\",675,\"(modified) Egyptian Olympiad in Informatics ( EOI ) 2009, August 14 - 21, Cairo\"],\"CodeForces-41E\":[\"3-cycles\",2057,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/41\\\"\\u003eCodeforces Beta Round 40 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-86D\":[\"Powerful array\",14566,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"CodeForces-146E\":[\"Lucky Subsequence\",28,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/146\\\"\\u003eCodeforces Round 104 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-86A\":[\"Reflection\",1404,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/86\\\"\\u003eYandex.Algorithm 2011: Round 2\\u003c/a\\u003e\"],\"CodeForces-146C\":[\"Lucky Conversion\",333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/146\\\"\\u003eCodeforces Round 104 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-146D\":[\"Lucky Number 2\",81,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/146\\\"\\u003eCodeforces Round 104 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-364A\":[\"Matrix\",4741,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/364\\\"\\u003eCodeforces Round 213 (Div. 1)\\u003c/a\\u003e\"],\"Gym-100460C\":[\"Born for the Battle\",201,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100460\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2014, VII Samara Regional Intercollegiate Programming Contest\\u003c/a\\u003e\"],\"CodeForces-146A\":[\"Lucky Ticket\",15815,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/146\\\"\\u003eCodeforces Round 104 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-DIEHARD\":[\"DIE HARD\",8322,\"\"],\"CodeForces-146B\":[\"Lucky Mask\",4672,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/146\\\"\\u003eCodeforces Round 104 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-STC04\":[\"Difference\",68,\"POI XVIII\"],\"Gym-101223C\":[\"Manic Moving\",96,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101223\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 Facebook Hacker Cup, Round 1\\u003c/a\\u003e\"],\"UVA-10828\":[\"Back to Kernighan-Ritchie\",460,null],\"CodeChef-TOMJERGA\":[\"Tom \\u0026 Jerry\",106,\"admin2\"],\"CodeForces-87D\":[\"Beautiful Road\",918,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/87\\\"\\u003eCodeforces Beta Round 73 (Div. 1 Only)\\u003c/a\\u003e\"],\"SPOJ-ADAGAME5\":[\"Ada and Palace Game\",18,\"\"],\"SPOJ-SAS002\":[\"Apoorv and Math problem\",148,\"College Contests.\"],\"SPOJ-SAS001\":[\"Apoorv and Maximum Inversion\",182,\"Own\"],\"SPOJ-ADAGAME4\":[\"Ada and Game of Divisors\",124,\"\"],\"CodeForces-145D\":[\"Lucky Pair\",259,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/145\\\"\\u003eCodeforces Round 104 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-145E\":[\"Lucky Queries\",3230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/145\\\"\\u003eCodeforces Round 104 (Div. 1)\\u003c/a\\u003e\"],\"UVA-13089\":[\"Golden Coins\",75,null],\"SPOJ-QUE2\":[\"Queue (Pro)\",1510,\"\"],\"SPOJ-ADASEA\":[\"Ada and Island\",412,\"\"],\"UVA-10814\":[\"Simplifying Fractions\",2311,null],\"UVALive-7629\":[\"Powers\",62,\"Regionals 2016 \\u003e\\u003e Africa/Middle East - South Africa\"],\"UVA-10810\":[\"Ultra-QuickSort\",5767,null],\"SPOJ-ADAGAME2\":[\"Ada and Easy Game\",110,\"\"],\"SPOJ-NAJ0001\":[\"Divisible Number Sum\",45,\"\"],\"SPOJ-VFRIEND2\":[\"Very Friends 2\",37,\"\"],\"UVA-10817\":[\"Headmaster\\u0027s Headache\",2420,null],\"UVA-10818\":[\"Dora Trip\",192,null],\"UVA-10816\":[\"Travel in Desert\",1296,null],\"UVA-13092\":[\"Fold the String\",51,null],\"SPOJ-HPYNOS\":[\"Happy Numbers I\",9457,\"Egyptian Olympiad in Informatics ( EOI ) 2009, August 14 - 21, Cairo\"],\"SPOJ-ADAUSORT\":[\"Ada and Unstable Sort\",1379,\"Tunisian Collegiate Training Contest - Round #01\"],\"SPOJ-VGCD\":[\"The Very Greatest Common Divisor\",94,\"Open All-Ukrainian Collegiate Contest Semi-Final, 2010\"],\"UVA-10769\":[\"Pillars\",274,null],\"UVA-11617\":[\"An Odd Love\",170,null],\"SPOJ-ADAHOSE\":[\"Ada and Hose\",22,\"\"],\"UVA-12944\":[\"Earthquake Disaster\",74,null],\"UVA-11613\":[\"Acme Corporation\",423,null],\"UVA-11610\":[\"Reverse Prime\",530,null],\"SPOJ-NUMOFPAL\":[\"Number of Palindromes\",1549,\"Udit Agarwal\"],\"SPOJ-SOLDIERS\":[\"SOLDIERS\",765,\"\"],\"SPOJ-JNEXT\":[\"Just Next !!!\",6994,\"MNNIT OPC 31-08-2012\"],\"CodeForces-794C\":[\"Naming Company\",3306,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/794\\\"\\u003eTinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADV04B1\":[\"Upper Right King (Hard)\",176,\"Advancement Autumn 2010, http://sevolymp.uuuq.com/, author: Alexey Shchepin\"],\"CodeForces-794B\":[\"Cutting Carrot\",7179,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/794\\\"\\u003eTinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-794E\":[\"Choosing Carrot\",675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/794\\\"\\u003eTinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-794D\":[\"Labelling Cities\",773,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/794\\\"\\u003eTinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-794F\":[\"Leha and security system\",763,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/794\\\"\\u003eTinkoff Challenge - Final Round (Codeforces Round 414, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"UVA-10750\":[\"Beautiful Points\",513,null],\"SPOJ-PRIMES2\":[\"Printing some primes (Hard)\",155,\"Thanks to TDuke\"],\"CodeForces-139D\":[\"Digits Permutations\",22,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/139\\\"\\u003eCodeforces Beta Round 99 (Div. 2)\\u003c/a\\u003e\"],\"UVA-12934\":[\"Factorial Division\",137,null],\"CodeForces-139A\":[\"Petr and Book\",30341,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/139\\\"\\u003eCodeforces Beta Round 99 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-SPIRALGR\":[\"A Famous Grid\",282,\"ACM/ICPC World Finals 2012 - Dressing Rehearsal Contest, also used in FDU Local Contest 2012\"],\"UVA-12931\":[\"Common Area\",37,null],\"SPOJ-CTTC\":[\"Counting Child\",396,\"\"],\"Gym-101741F\":[\"GCD\",154,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101741\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 Petrozavodsk Winter Training Camp, Saratov SU Contest\\u003c/a\\u003e\"],\"Gym-101741J\":[\"Subsequence Sum Queries\",483,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101741\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 Petrozavodsk Winter Training Camp, Saratov SU Contest\\u003c/a\\u003e\"],\"Gym-101741K\":[\"Consistent Occurrences\",508,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101741\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 Petrozavodsk Winter Training Camp, Saratov SU Contest\\u003c/a\\u003e\"],\"CodeForces-793D\":[\"Presents in Bankopolis\",1616,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/793\\\"\\u003eTinkoff Challenge - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-793C\":[\"Mice problem\",1307,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/793\\\"\\u003eTinkoff Challenge - Elimination Round\\u003c/a\\u003e\"],\"SPOJ-TWIST\":[\"Twist and whirl - want to cheat\",317,\"NEERC Southern Subregion 2003 - 2004\"],\"SPOJ-FACTCG2\":[\"Medium Factorization\",1966,\"\"],\"SPOJ-JLNT\":[\"Jarin Loves New Task\",46,\"\"],\"SPOJ-AHOCUR\":[\"Aho-Corasick Trie\",61,\"Data Enhanced from Classic Problem by Manzurur Rahman Khan\"],\"SPOJ-MUTDNA\":[\"DNA\",628,\"COCI 2011-2012 Contest #5\"],\"SPOJ-ADAHW\":[\"Ada and Homework\",66,\"\"],\"CodeForces-138D\":[\"World of Darkraft\",563,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/138\\\"\\u003eCodeforces Beta Round 99 (Div. 1)\\u003c/a\\u003e\"],\"UVA-12926\":[\"Trouble in Terrorist Town\",69,null],\"UVA-10748\":[\"Knights Roaming\",180,null],\"SPOJ-TIP1\":[\"Totient in permutation (easy)\",314,\"Extension of Project Euler n°###\"],\"UVA-10745\":[\"Dominant Strings\",518,null],\"UVA-12924\":[\"Immortal Rabbits\",44,null],\"UVA-10743\":[\"Blocks on Blocks\",140,null],\"UVA-12921\":[\"Triple shot\",130,null],\"LightOJ-1388\":[\"Trapezium Drawing\",153,null],\"UVALive-6234\":[\"Tile Cut\",151,\"Regionals 2012 \\u003e\\u003e North America - Pacific Northwest\"],\"SPOJ-FARIDA\":[\"Princess Farida\",13607,\"FCIS/ASU Local Contest 2013\"],\"UVA-117\":[\"The Postal Worker Rings Once\",3850,null],\"SPOJ-UCBINTC\":[\"Good\",84,\"2013年每周一赛第十四场, http://soj.me/9563\"],\"SPOJ-WTK\":[\"Why this kolaveri di\",1515,\"\"],\"UVA-12927\":[\"Points Cover\",22,null],\"SPOJ-GCDS\":[\"Sabbir and gcd problem\",356,\"\"],\"CodeForces-792E\":[\"Colored Balls\",1155,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/792\\\"\\u003eEducational Codeforces Round 18\\u003c/a\\u003e\"],\"SPOJ-NSUBSTR2\":[\"Substrings II\",183,\"Immagination\"],\"SPOJ-ADASQR\":[\"Ada and Squares\",55,\"\"],\"CodeForces-137E\":[\"Last Chance\",1258,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/137\\\"\\u003eCodeforces Beta Round 98 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-222C\":[\"Reducing Fractions\",2222,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/222\\\"\\u003eCodeforces Round 137 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-137C\":[\"History\",7534,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/137\\\"\\u003eCodeforces Beta Round 98 (Div. 2)\\u003c/a\\u003e\"],\"UVA-12915\":[\"TripleCorn\",13,null],\"CodeForces-137D\":[\"Palindromes\",1632,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/137\\\"\\u003eCodeforces Beta Round 98 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-NOVICE63\":[\"Special Numbers\",809,\"own problem used in - http://www.spoj.pl/NOVICE6/\"],\"CodeForces-137A\":[\"Postcards and photos\",7391,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/137\\\"\\u003eCodeforces Beta Round 98 (Div. 2)\\u003c/a\\u003e\"],\"UVA-10735\":[\"Euler Circuit\",829,null],\"CodeForces-137B\":[\"Permutation\",14453,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/137\\\"\\u003eCodeforces Beta Round 98 (Div. 2)\\u003c/a\\u003e\"],\"UVA-12912\":[\"Josephus lottery\",43,null],\"UVALive-3189\":[\"Confusing Login Names\",23,\"Regionals 2004 \\u003e\\u003e Asia - Ehime\"],\"UVA-10732\":[\"The Strange Research\",186,null],\"SPOJ-BOKAM143SOU\":[\"Checking cubes.\",297,\"\"],\"UVA-12910\":[\"Snakes and Ladders\",67,null],\"UVA-10730\":[\"Antiarithmetic?\",1593,null],\"SPOJ-NITT4\":[\"Tiles\",114,\"\"],\"SPOJ-ADAGF\":[\"Ada and Greenflies\",120,\"\"],\"SPOJ-NITT2\":[\"hai jolly jolly jolly\",1268,\"\"],\"UVA-125\":[\"Numbering Paths\",2555,null],\"CodeForces-791D\":[\"Bear and Tree Jumps\",85,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/791\\\"\\u003eCodeforces Round 405 (rated, Div. 2, based on VK Cup 2017 Round 1)\\u003c/a\\u003e\"],\"SPOJ-NITT8\":[\"Dating Rishi\",645,\"Radhakrishnan\"],\"UVA-124\":[\"Following Orders\",4500,null],\"CodeForces-791E\":[\"Bear and Company\",10,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/791\\\"\\u003eCodeforces Round 405 (rated, Div. 2, based on VK Cup 2017 Round 1)\\u003c/a\\u003e\"],\"UVA-10321\":[\"Polygon Intersection\",296,null],\"CodeForces-883K\":[\"Road Widening\",1133,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/883\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"SPOJ-CAPCITY\":[\"Capital City\",3147,\"Armenian TST 2010, Round 2\"],\"CodeChef-COZIE\":[\"Golu and Sweetness\",732,\"codopediac3\"],\"CodeChef-POLYEVAL\":[\"Evaluate the polynomial\",297,\"sergey_adm\"],\"SPOJ-ADV04F1\":[\"Four Chips (Hard)\",159,\"\"],\"UVA-10327\":[\"Flip Sort\",16620,null],\"UVA-12506\":[\"Shortest Names\",953,null],\"SPOJ-SECTORS\":[\"Equalize the Sectors\",158,\"Codeblitz-4\"],\"UVA-11659\":[\"Informants\",503,null],\"UVA-11654\":[\"Arithmetic Subsequence\",279,null],\"SPOJ-KOMPICI\":[\"Kompići\",1121,\"COCI 2011/2012 2nd round\"],\"SPOJ-HOTELS\":[\"Hotels Along the Croatian Coast\",12565,\"that would be me\"],\"CodeForces-798C\":[\"Mike and gcd problem\",6271,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/798\\\"\\u003eCodeforces Round 410 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-798B\":[\"Mike and strings\",9230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/798\\\"\\u003eCodeforces Round 410 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-XMEN\":[\"X-MEN\",943,\"CodeCraft 13 , Author : Nadeem Moidu\"],\"CodeForces-798D\":[\"Mike and distribution\",2217,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/798\\\"\\u003eCodeforces Round 410 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-665F\":[\"Four Divisors\",631,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/665\\\"\\u003eEducational Codeforces Round 12\\u003c/a\\u003e\"],\"CodeForces-750E\":[\"New Year and Old Subsequence\",1580,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/750\\\"\\u003eGood Bye 2016\\u003c/a\\u003e\"],\"CodeChef-COZIC\":[\"Chef and Kites\",20,\"codopediac3\"],\"CodeForces-883H\":[\"Palindromic Cut\",1753,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/883\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-750F\":[\"New Year and Finding Roots\",475,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/750\\\"\\u003eGood Bye 2016\\u003c/a\\u003e\"],\"CodeForces-883G\":[\"Orientation of Edges\",1497,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/883\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"CodeForces-883I\":[\"Photo Processing\",2058,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/883\\\"\\u003e2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)\\u003c/a\\u003e\"],\"UVA-12972\":[\"Cuban Challenge\",38,null],\"SPOJ-NAKANJ\":[\"Minimum Knight moves !!!\",9173,\"Used for Code it - Vidyut 2012 - Amrita University\"],\"UVA-10793\":[\"The Orc Attack\",934,null],\"UVA-10316\":[\"Airline Hub\",483,null],\"UVA-11645\":[\"Bits\",457,null],\"UVA-11643\":[\"Knight Tour\",164,null],\"SPOJ-SUMSUM\":[\"Enjoy Sum with Operations\",446,\"Own Problem\"],\"UVA-12974\":[\"Exquisite Strings\",85,null],\"SPOJ-NKLEAVES\":[\"Leaves\",1083,\"Campion 2005\"],\"SPOJ-SID\":[\"Search Insert Delete\",103,\"Own problem\"],\"UVA-109\":[\"SCUD Busters\",2728,null],\"CodeForces-797D\":[\"Broken BST\",1808,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"CodeForces-664D\":[\"Graph Coloring\",14,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/664\\\"\\u003eCodeforces Round 347 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-81E\":[\"Pairs\",338,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/81\\\"\\u003eYandex.Algorithm Open 2011: Qualification 1\\u003c/a\\u003e\"],\"CodeForces-797E\":[\"Array Queries\",4327,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/797\\\"\\u003eEducational Codeforces Round 19\\u003c/a\\u003e\"],\"CodeForces-81A\":[\"Plug-in\",11748,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/81\\\"\\u003eYandex.Algorithm Open 2011: Qualification 1\\u003c/a\\u003e\"],\"CodeForces-81D\":[\"Polycarp\\u0027s Picture Gallery\",689,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/81\\\"\\u003eYandex.Algorithm Open 2011: Qualification 1\\u003c/a\\u003e\"],\"CodeForces-81C\":[\"Average Score\",1704,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/81\\\"\\u003eYandex.Algorithm Open 2011: Qualification 1\\u003c/a\\u003e\"],\"SPOJ-GARDENHU\":[\"Garden Hull\",670,\"Fall Bulgarian National Contest 2003\"],\"UVA-11630\":[\"Cyclic antimonotonic permutations\",147,null],\"UVA-11631\":[\"Dark roads\",7833,null],\"HackerRank-challenging-palindromes\":[\"Build a Palindrome\",90,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/world-codesprint-5\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eworld-codesprint-5\\u003c/a\\u003e\"],\"UVA-10307\":[\"Killing Aliens in Borg Maze\",1250,null],\"UVA-10305\":[\"Ordering Tasks\",23266,null],\"UVA-10303\":[\"How Many Trees?\",2313,null],\"UVA-10301\":[\"Rings and Glue\",1744,null],\"UVA-12963\":[\"Astragalus Nitidiflorus\",36,null],\"SPOJ-HRSIAM\":[\"Angry Siam\",65,\"\"],\"SPOJ-DIFERENC\":[\"DIFERENCIJA\",476,\"COCI 2010/2011 Contest 3 by Adrian Satja Kurdija\"],\"SPOJ-CSQUARE\":[\"Powered and Squared\",714,\"\"],\"CodeForces-796C\":[\"Bank Hacking\",3270,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/796\\\"\\u003eCodeforces Round 408 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-796E\":[\"Exam Cheating\",653,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/796\\\"\\u003eCodeforces Round 408 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-796D\":[\"Police Stations\",5651,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/796\\\"\\u003eCodeforces Round 408 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-CODFURY\":[\"Megatron and his rage\",2012,\"\"],\"UVA-12950\":[\"Even Obsession\",426,null],\"SPOJ-ONBRIDGE\":[\"Online Bridge Searching\",99,\"\"],\"SPOJ-CRAN04\":[\"Audition\",834,\"\"],\"UVA-10777\":[\"God! Save me\",574,null],\"SPOJ-CRAN02\":[\"Roommate Agreement\",1791,\"\"],\"UVALive-7589\":[\"Rearranging a Sequence\",42,\"Regionals 2016 \\u003e\\u003e Asia - Tsukuba\"],\"UVALive-6263\":[\"The Dragon and the knights\",132,\"Regionals 2012 \\u003e\\u003e Europe - Central\"],\"CodeForces-795A\":[\"Amusement Park\",1,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/795\\\"\\u003eVK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror)\\u003c/a\\u003e\"],\"UVALive-7591\":[\"Distribution Center\",24,\"Regionals 2016 \\u003e\\u003e Asia - Tsukuba\"],\"UVA-563\":[\"Crimewave\",1371,null],\"UVA-11692\":[\"Rain Fall\",284,null],\"UVA-10360\":[\"Rat Attack\",3968,null],\"UVA-11218\":[\"KTV\",1733,null],\"UVA-12549\":[\"Sentry Robots\",451,null],\"UVA-11214\":[\"Guarding the Chessboard\",852,null],\"UVA-11699\":[\"Rooks\",211,null],\"Gym-100190I\":[\"Wally World\",197,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100190\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2011 ACM-ICPC East Central North America (ECNA 2011)\\u003c/a\\u003e\"],\"CodeChef-INSQ16F\":[\"JARVIS and LCP \",204,\"vikky_codder\"],\"CodeForces-887B\":[\"Cubes for Masha\",6009,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/887\\\"\\u003eCodeforces Round 444 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-UNIHW\":[\"University Homework\",60,\"own problem\"],\"CodeForces-669E\":[\"Little Artem and Time Machine\",195,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/669\\\"\\u003eCodeforces Round 348 (VK Cup 2016 Round 2, Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-754C\":[\"Vladik and chat\",969,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/754\\\"\\u003eCodeforces Round 390 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-754E\":[\"Dasha and cyclic table\",519,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/754\\\"\\u003eCodeforces Round 390 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-621E\":[\"Wet Shark and Blocks\",3065,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/621\\\"\\u003eCodeforces Round 341 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-SARRAY\":[\"Suffix Array\",2670,\"\"],\"UVA-12533\":[\"Joining Couples\",173,null],\"UVA-11686\":[\"Pick up sticks\",3501,null],\"UVA-12530\":[\"Game of Tiles\",148,null],\"SPOJ-LCASQ\":[\"Lowest Common Ancestor\",2294,\"\"],\"SPOJ-JHAGIRLS\":[\"AAO KABHI HAWELI PE :P\",1674,\"\"],\"SPOJ-ALIEN\":[\"Aliens at the train\",4632,\"Own problem\"],\"UVA-11206\":[\"Coloring the map, but not anyhow\",100,null],\"CodeForces-753C\":[\"Interactive Bulls and Cows (Hard)\",288,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/753\\\"\\u003eTesting Round 13\\u003c/a\\u003e\"],\"SPOJ-KOZE\":[\"Sheep\",2027,\"Croatian Regionals 2005\"],\"SPOJ-MINNUM\":[\"Minimum Number\",541,\"\"],\"SPOJ-CF36D\":[\"New Game with a Chess Piece\",215,\"Codeforces #36\"],\"SPOJ-DAYOUT2C\":[\"Prime Or Not\",366,\"Own problem\"],\"CodeForces-38B\":[\"Chess\",3851,\"\\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\"],\"SPOJ-CHAIR\":[\"Chairs\",560,\"Based on a problem in 2010 KOI High School \\u0026 Middle School Division\"],\"SPOJ-BGSHOOT\":[\"Shoot and kill\",400,\"\"],\"UVA-12524\":[\"Arranging Heaps\",301,null],\"UVALive-8017\":[\"Mancunian and Sonu Generate Strings\",1,\"Regionals 2016 \\u003e\\u003e Asia - Chennai\"],\"CodeForces-667A\":[\"Pouring Rain\",8418,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/667\\\"\\u003eCodeforces Round 349 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-8015\":[\"Alice and Bob play Contact\",36,\"Regionals 2016 \\u003e\\u003e Asia - Chennai\"],\"UVALive-8014\":[\"Birthday Pizza Party\",18,\"Regionals 2016 \\u003e\\u003e Asia - Chennai\"],\"CodeForces-667C\":[\"Reberland Linguistics\",73,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/667\\\"\\u003eCodeforces Round 349 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-THREETW1\":[\"Connecting three towns (variation)\",52,\"\"],\"UVALive-8012\":[\"Voting Fraud\",57,\"Regionals 2016 \\u003e\\u003e Asia - Chennai\"],\"CodeForces-752E\":[\"Santa Claus and Tangerines\",25,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/752\\\"\\u003eCodeforces Round 389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)\\u003c/a\\u003e\"],\"CodeForces-752D\":[\"Santa Claus and a Palindrome\",76,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/752\\\"\\u003eCodeforces Round 389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)\\u003c/a\\u003e\"],\"CodeForces-752F\":[\"Santa Clauses and a Soccer Championship\",10,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/752\\\"\\u003eCodeforces Round 389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)\\u003c/a\\u003e\"],\"UVA-12511\":[\"Virus\",410,null],\"UVA-12995\":[\"Farey Sequence\",472,null],\"CodeForces-39J\":[\"Spelling Check\",3165,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/39\\\"\\u003eSchool Team Contest 1 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"Gym-101174K\":[\"Balls and Needles\",691,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101174\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2016-2017 ACM-ICPC Southwestern European Regional Programming Contest (SWERC 2016)\\u003c/a\\u003e\"],\"SPOJ-ANTP\":[\"Mr. Ant \\u0026 His Problem\",305,\"Own Problem\"],\"UVA-12519\":[\"The Farnsworth Parabox\",328,null],\"CodeForces-39E\":[\"What Has Dirichlet Got to Do with That?\",933,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/39\\\"\\u003eSchool Team Contest 1 (Winter Computer School 2010/11)\\u003c/a\\u003e\"],\"SPOJ-RPLD\":[\"Database\",3056,\"Own Problem used for the RPL contest\"],\"SPOJ-HAYBALE\":[\"Haybale stacking\",3316,\"Usaco 2012 January bronze\"],\"SPOJ-RPLC\":[\"Coke madness\",3910,\"Own Problem used for the RPL contest\"],\"UVA-11665\":[\"Chinese Ink\",145,null],\"CodeForces-799B\":[\"T-shirt buying\",10188,\"\\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\"],\"SPOJ-HSHW\":[\"Highschool Homework\",53,\"own problem\"],\"SPOJ-RPLN\":[\"Negative Score\",4019,\"Own Problem used for the RPL contest\"],\"CodeForces-799D\":[\"Field expansion\",2085,\"\\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-666C\":[\"Codeword\",803,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/666\\\"\\u003eCodeforces Round 349 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-799C\":[\"Fountains\",3924,\"\\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\"],\"UVALive-8000\":[\"FizzBuzz\",130,\"Regionals 2016 \\u003e\\u003e North America - South Central USA\"],\"CodeForces-884C\":[\"Bertown Subway\",4994,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/884\\\"\\u003eEducational Codeforces Round 31\\u003c/a\\u003e\"],\"CodeForces-799E\":[\"Aquarium decoration\",958,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/799\\\"\\u003ePlayrix Codescapes Cup (Codeforces Round 413, rated, Div. 1 + Div. 2)\\u003c/a\\u003e\"],\"CodeForces-884B\":[\"Japanese Crosswords Strike Back\",7509,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/884\\\"\\u003eEducational Codeforces Round 31\\u003c/a\\u003e\"],\"CodeForces-884E\":[\"Binary Matrix\",698,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/884\\\"\\u003eEducational Codeforces Round 31\\u003c/a\\u003e\"],\"CodeForces-884D\":[\"Boxes And Balls\",2070,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/884\\\"\\u003eEducational Codeforces Round 31\\u003c/a\\u003e\"],\"CodeForces-884F\":[\"Anti-Palindromize\",1018,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/884\\\"\\u003eEducational Codeforces Round 31\\u003c/a\\u003e\"],\"SPOJ-MATSUM\":[\"Matrix Summation\",3930,\"Al-Khawarizm 2006\"],\"SPOJ-LOVINGPW\":[\"Loving Power\",115,\"Luis Giro\"],\"CodeForces-758E\":[\"Broken Tree\",466,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/758\\\"\\u003eCodeforces Round 392 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-8037\":[\"Military Service\",30,\"Regionals 2016 \\u003e\\u003e Africa/Middle East - Arab Contest\"],\"SPOJ-ADAFEAR\":[\"Ada and Primal Fear\",26,\"\"],\"CodeForces-710C\":[\"Magic Odd Square\",5440,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/710\\\"\\u003eEducational Codeforces Round 16\\u003c/a\\u003e\"],\"CodeForces-843D\":[\"Dynamic Shortest Path\",813,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/843\\\"\\u003eAIM Tech Round 4 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-758F\":[\"Geometrical Progression\",643,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/758\\\"\\u003eCodeforces Round 392 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-710E\":[\"Generate a String\",5332,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/710\\\"\\u003eEducational Codeforces Round 16\\u003c/a\\u003e\"],\"CodeForces-710D\":[\"Two Arithmetic Progressions\",1338,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/710\\\"\\u003eEducational Codeforces Round 16\\u003c/a\\u003e\"],\"SPOJ-TNVFC1M\":[\"Miraculous\",203,\"\"],\"UVA-190\":[\"Circle Through Three Points\",4804,null],\"UVA-12576\":[\"Simply Loopy\",86,null],\"UVA-11243\":[\"Texas Trip\",203,null],\"UVA-11240\":[\"Antimonotonicity\",758,null],\"SPOJ-SCPC11H\":[\"Dolls\",110,\"Syrian Collegiate Programming Contest 2011\"],\"Gym-101309D\":[\"Dome of Circus\",191,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101309\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2010-2011 ACM-ICPC Northeastern European Regional Contest (NEERC 10)\\u003c/a\\u003e\"],\"SPOJ-ROADTRIP\":[\"Road trip\",76,\"IOPC2011\"],\"UVALive-8025\":[\"Stacking Cups\",61,\"Regionals 2016 \\u003e\\u003e North America - Rocky Mountain\"],\"CodeForces-757F\":[\"Team Rocket Rises Again\",1190,\"\\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\"],\"UVALive-8024\":[\"Stack Construction\",25,\"Regionals 2016 \\u003e\\u003e North America - Rocky Mountain\"],\"SPOJ-DOSA\":[\"Lalith Dosa\",363,\"Own\"],\"CodeForces-757E\":[\"Bash Plays with Functions\",1369,\"\\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-842D\":[\"Vitya and Strange Lesson\",3521,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/842\\\"\\u003eCodeforces Round 430 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-UNICA\":[\"Unique Strings\",71,\"Cuban Olympiad in Informatics 2011 - Day 2 Problem A\"],\"UVA-11230\":[\"Annoying painting tool\",556,null],\"SPOJ-ADASTRNG\":[\"Ada and Substring\",516,\"Tunisian Collegiate Training Contest - Round #01\"],\"UVA-11237\":[\"Halloween treats\",559,null],\"CodeForces-756C\":[\"Nikita and stack\",1324,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/756\\\"\\u003e8VC Venture Cup 2017 - Final Round\\u003c/a\\u003e\"],\"CodeForces-841D\":[\"Leha and another game about graph\",49,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/841\\\"\\u003eCodeforces Round 429 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-841C\":[\"Leha and Function\",148,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/841\\\"\\u003eCodeforces Round 429 (Div. 2)\\u003c/a\\u003e\"],\"UVA-151\":[\"Power Crisis\",11929,null],\"SPOJ-TWOGAME\":[\"Two Game\",330,\"\"],\"SPOJ-THRBL\":[\"Catapult that ball\",3432,\"\"],\"UVA-1416\":[\"Warfare And Logistics\",451,null],\"SPOJ-ADASUM\":[\"Ada and Expenses\",403,\"\"],\"UVA-11228\":[\"Transportation system.\",3357,null],\"UVA-12556\":[\"\\\"Center\\\" of perimeter midpoints\",110,null],\"CodeForces-319C\":[\"Kalila and Dimna in the Logging Industry\",5161,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/319\\\"\\u003eCodeforces Round 189 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-888C\":[\"K-Dominant Character\",9060,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-888B\":[\"Buggy Robot\",10438,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-888E\":[\"Maximum Subsequence\",7473,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-755C\":[\"PolandBall and Forest\",12543,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/755\\\"\\u003e8VC Venture Cup 2017 - Elimination Round\\u003c/a\\u003e\"],\"CodeForces-888G\":[\"Xor-MST\",4367,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"HackerRank-degree-diameter-on-trees\":[\"Degree-Diameter on Trees\",10,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/mathemagic-bits\\u0027 target\\u003d\\u0027_blank\\u0027\\u003emathemagic-bits\\u003c/a\\u003e\"],\"CodeForces-888F\":[\"Connecting Vertices\",846,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/888\\\"\\u003eEducational Codeforces Round 32\\u003c/a\\u003e\"],\"CodeForces-840D\":[\"Destiny\",3043,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/840\\\"\\u003eCodeforces Round 429 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-32D\":[\"Constellation\",1337,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/32\\\"\\u003eCodeforces Beta Round 32 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-32C\":[\"Flea\",2363,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/32\\\"\\u003eCodeforces Beta Round 32 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"UVA-11177\":[\"Fighting Against a Polygonal Monster\",209,null],\"SPOJ-AMR10G\":[\"Christmas Play\",8170,\"ICPC Asia regionals, Amritapuri 2010\"],\"UVALive-2407\":[\"Super Star\",35,\"Regionals 2001 \\u003e\\u003e Asia - Hakodate\"],\"SPOJ-AMR10C\":[\"Square Free Factorization\",1754,\"own problem, ICPC Asia regionals, Amritapuri 2010\"],\"UVA-11174\":[\"Stand in a Line\",631,null],\"SPOJ-CPAIR2\":[\"Counting diff-pairs\",297,\"own problem\"],\"SPOJ-AMR10I\":[\"Dividing Stones\",280,\"own problem, ICPC Asia regionals, Amritapuri 2010\"],\"CodeForces-727A\":[\"Transformation: from A to B\",15101,\"\\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\"],\"UVALive-2883\":[\"Runner Pawns\",154,\"Regionals 2003 \\u003e\\u003e Latin America - South America\"],\"CodeForces-727C\":[\"Guess the Array\",7448,\"\\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\"],\"SPOJ-AMR10J\":[\"Mixing Chemicals\",202,\"own problem, ICPC Asia regionals, Amritapuri 2010\"],\"CodeForces-859E\":[\"Desk Disorder\",1752,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/859\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-859D\":[\"Third Month Insanity\",919,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/859\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-811C\":[\"Vladik and Memorable Trip\",3451,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/811\\\"\\u003eCodeforces Round 416 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-PUCMM334\":[\"White Hats\",617,\"Olimpiada de Programación PUCMM ACM-ISC 2013\"],\"HackerRank-gp-on-fibonacci-matrix\":[\"GP on Fibonacci Matrix\",8,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/mathemagic-bits\\u0027 target\\u003d\\u0027_blank\\u0027\\u003emathemagic-bits\\u003c/a\\u003e\"],\"CodeForces-811E\":[\"Vladik and Entertaining Flags\",850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/811\\\"\\u003eCodeforces Round 416 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-811D\":[\"Vladik and Favorite Game\",1655,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/811\\\"\\u003eCodeforces Round 416 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-PARCARD1\":[\"Partition function (EASY)\",96,\"\"],\"UVA-12030\":[\"Help the Winners\",376,null],\"UVA-11183\":[\"Teen Girl Squad\",995,null],\"UVA-11168\":[\"Airport\",888,null],\"CodeForces-33D\":[\"Knights\",1246,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/33\\\"\\u003eCodeforces Beta Round 33 (Codeforces format)\\u003c/a\\u003e\"],\"SPOJ-AMR11E\":[\"Distinct Primes\",6961,\"Varun Jalan - ICPC Asia regionals, Amritapuri 2011\"],\"SPOJ-ADATAXES\":[\"Ada and Taxes\",105,\"\"],\"UVA-11167\":[\"Monkeys in the Emei Mountain\",629,null],\"UVA-12012\":[\"Detection of Extraterrestrial\",330,null],\"CodeForces-33A\":[\"What is for dinner?\",4294,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/33\\\"\\u003eCodeforces Beta Round 33 (Codeforces format)\\u003c/a\\u003e\"],\"UVALive-3725\":[\"Hie with the Pie\",191,\"Regionals 2006 \\u003e\\u003e North America - East Central NA\"],\"UVA-11165\":[\"Galactic Travel\",134,null],\"SPOJ-PLAYGAME\":[\"PLAYGAME\",708,\"gametheory\"],\"CodeForces-33C\":[\"Wonderful Randomized Sum\",3092,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/33\\\"\\u003eCodeforces Beta Round 33 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-33B\":[\"String Problem\",4787,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/33\\\"\\u003eCodeforces Beta Round 33 (Codeforces format)\\u003c/a\\u003e\"],\"UVALive-5905\":[\"Pool construction\",149,\"Regionals 2011 \\u003e\\u003e Europe - Northwestern\"],\"UVALive-2871\":[\"Rhyme Schemes\",71,\"Regionals 2003 \\u003e\\u003e North America - Greater NY\"],\"HackerRank-euler010\":[\"Project Euler #10: Summation of primes\",15818,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/projecteuler\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eprojecteuler\\u003c/a\\u003e\"],\"CodeForces-859C\":[\"Pie Rules\",5652,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/859\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-859B\":[\"Lazy Security Guard\",7405,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/859\\\"\\u003eMemSQL Start[c]UP 3.0 - Round 1\\u003c/a\\u003e\"],\"CodeForces-725C\":[\"Hidden Word\",2704,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/725\\\"\\u003eCanada Cup 2016\\u003c/a\\u003e\"],\"Gym-101806Q\":[\"QueryreuQ\",350,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101806\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2018 KAIST RUN Spring Contest\\u003c/a\\u003e\"],\"CodeForces-725E\":[\"Too Much Money\",684,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/725\\\"\\u003eCanada Cup 2016\\u003c/a\\u003e\"],\"CodeForces-810B\":[\"Summer sell-off\",11670,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/810\\\"\\u003eCodeforces Round 415 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-725D\":[\"Contest Balloons\",2888,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/725\\\"\\u003eCanada Cup 2016\\u003c/a\\u003e\"],\"HackerRank-road-maintenance\":[\"Road Maintenance\",13,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/101hack35\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e101hack35\\u003c/a\\u003e\"],\"CodeForces-810D\":[\"Glad to see you!\",31,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/810\\\"\\u003eCodeforces Round 415 (Div. 2)\\u003c/a\\u003e\"],\"Gym-101806T\":[\"Touch The Sky\",95,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101806\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2018 KAIST RUN Spring Contest\\u003c/a\\u003e\"],\"CodeForces-725F\":[\"Family Photos\",514,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/725\\\"\\u003eCanada Cup 2016\\u003c/a\\u003e\"],\"CodeForces-810C\":[\"Do you want a date?\",187,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/810\\\"\\u003eCodeforces Round 415 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-MAXSUB\":[\"Maximum Subset of Array\",732,\"\"],\"Gym-101806X\":[\"Xtreme NP-hard Problem?!\",83,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101806\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2018 KAIST RUN Spring Contest\\u003c/a\\u003e\"],\"SPOJ-GEEKOUNT\":[\"EVEN COUNT\",359,\"problem setter: rkarthikeyan\"],\"UVA-12005\":[\"Find Solutions\",354,null],\"UVA-12489\":[\"Combating cancer\",183,null],\"UVA-12004\":[\"Bubble Sort\",1854,null],\"CodeForces-78E\":[\"Evacuation\",628,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/78\\\"\\u003eCodeforces Beta Round 70 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-30A\":[\"Accounting\",3730,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/30\\\"\\u003eCodeforces Beta Round 30 (Codeforces format)\\u003c/a\\u003e\"],\"SPOJ-FRNDAM\":[\"Friendship\",296,\"\"],\"UVA-12003\":[\"Array Transformer\",1223,null],\"SPOJ-AMR12I\":[\"Saruman of Many Colours\",545,\"Varun Jalan - ICPC Asia regionals, Amritapuri 2012\"],\"UVA-11155\":[\"Be Efficient\",483,null],\"CodeForces-30C\":[\"Shooting Gallery\",2166,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/30\\\"\\u003eCodeforces Beta Round 30 (Codeforces format)\\u003c/a\\u003e\"],\"UVA-12001\":[\"UVa Panel Discussion\",362,null],\"CodeForces-78B\":[\"Easter Eggs\",13658,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/78\\\"\\u003eCodeforces Beta Round 70 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-AMR12C\":[\"Entmoot\",149,\"Utkarsh Lath - ICPC Asia regionals, Amritapuri 2012\"],\"CodeForces-78A\":[\"Haiku\",12574,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/78\\\"\\u003eCodeforces Beta Round 70 (Div. 2)\\u003c/a\\u003e\"],\"UVA-12483\":[\"Toboggan of Marbles\",229,null],\"SPOJ-AMR12D\":[\"The Mirror of Galadriel\",6237,\"Varun Jalan - ICPC Asia regionals, Amritapuri 2012\"],\"HackerRank-euler025\":[\"Project Euler #25: N-digit Fibonacci number\",6426,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/projecteuler\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eprojecteuler\\u003c/a\\u003e\"],\"HackerRank-euler020\":[\"Project Euler #20: Factorial digit sum\",11661,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/projecteuler\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eprojecteuler\\u003c/a\\u003e\"],\"CodeForces-724B\":[\"Batch Sort\",4464,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/724\\\"\\u003eIntel Code Challenge Final Round (Div. 1 + Div. 2, Combined)\\u003c/a\\u003e\"],\"CodeForces-724D\":[\"Dense Subsequence\",2442,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/724\\\"\\u003eIntel Code Challenge Final Round (Div. 1 + Div. 2, Combined)\\u003c/a\\u003e\"],\"CodeForces-724C\":[\"Ray Tracing\",2239,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/724\\\"\\u003eIntel Code Challenge Final Round (Div. 1 + Div. 2, Combined)\\u003c/a\\u003e\"],\"SPOJ-ADAVISIT\":[\"Ada and Plum\",151,\"\"],\"SPOJ-ADAPHONE\":[\"Ada and Contact\",25,\"\"],\"SPOJ-AMR12A\":[\"The Black Riders\",280,\"Utkarsh Lath - ICPC Asia regionals, Amritapuri 2012\"],\"SPOJ-ADASEQEN\":[\"Ada and Subsequence\",1166,\"Tunisian Collegiate Training Contest - Round #01\"],\"CodeForces-30E\":[\"Tricky and Clever Password\",764,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/30\\\"\\u003eCodeforces Beta Round 30 (Codeforces format)\\u003c/a\\u003e\"],\"UVA-10299\":[\"Relatives\",4982,null],\"CodeForces-31C\":[\"Schedule\",1968,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/31\\\"\\u003eCodeforces Beta Round 31 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"Gym-101808B\":[\"Amer and Graphs\",188,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101808\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM International Collegiate Programming Contest, Damascus University Collegiate Programming Contest(2018)\\u003c/a\\u003e\"],\"SPOJ-LCMSUM\":[\"LCM Sum\",4121,\"own problem used for Codechef Snackdown Onsite\"],\"CodeForces-31B\":[\"Sysadmin Bob\",4571,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/31\\\"\\u003eCodeforces Beta Round 31 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-31E\":[\"TV Game\",1135,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/31\\\"\\u003eCodeforces Beta Round 31 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-31D\":[\"Chocolate\",1115,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/31\\\"\\u003eCodeforces Beta Round 31 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"Gym-101808A\":[\"Martadella Strikes Again\",1025,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101808\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM International Collegiate Programming Contest, Damascus University Collegiate Programming Contest(2018)\\u003c/a\\u003e\"],\"CodeForces-79C\":[\"Beaver\",1843,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/79\\\"\\u003eCodeforces Beta Round 71\\u003c/a\\u003e\"],\"UVA-10295\":[\"Hay Points\",8538,null],\"Gym-101808F\":[\"Random Sort\",780,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101808\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM International Collegiate Programming Contest, Damascus University Collegiate Programming Contest(2018)\\u003c/a\\u003e\"],\"Gym-101808G\":[\"Weird Requirements\",290,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101808\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM International Collegiate Programming Contest, Damascus University Collegiate Programming Contest(2018)\\u003c/a\\u003e\"],\"Gym-101808D\":[\"Simplified 2048\",23,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101808\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM International Collegiate Programming Contest, Damascus University Collegiate Programming Contest(2018)\\u003c/a\\u003e\"],\"Gym-101808E\":[\"Floods\",82,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101808\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM International Collegiate Programming Contest, Damascus University Collegiate Programming Contest(2018)\\u003c/a\\u003e\"],\"UVA-928\":[\"Eternal Truths\",757,null],\"Gym-101808K\":[\"Another Shortest Path Problem\",336,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101808\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM International Collegiate Programming Contest, Damascus University Collegiate Programming Contest(2018)\\u003c/a\\u003e\"],\"CodeForces-79A\":[\"Bus Game\",4213,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/79\\\"\\u003eCodeforces Beta Round 71\\u003c/a\\u003e\"],\"Gym-101808I\":[\"Ildar Yalalov\",405,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101808\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eACM International Collegiate Programming Contest, Damascus University Collegiate Programming Contest(2018)\\u003c/a\\u003e\"],\"CodeForces-638C\":[\"Road Improvement\",1601,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/638\\\"\\u003eVK Cup 2016 - Qualification Round 2\\u003c/a\\u003e\"],\"UVA-920\":[\"Sunny Mountains\",3202,null],\"CodeForces-638D\":[\"Three-dimensional Turtle Super Computer\",707,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/638\\\"\\u003eVK Cup 2016 - Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-723C\":[\"Polycarp at the Radio\",4710,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/723\\\"\\u003eCodeforces Round 375 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-723E\":[\"One-Way Reform\",2072,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/723\\\"\\u003eCodeforces Round 375 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-723F\":[\"st-Spanning Tree\",1534,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/723\\\"\\u003eCodeforces Round 375 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADAZOO\":[\"Ada and Zoo\",22,\"\"],\"UVA-1227\":[\"The longest constant gene\",128,null],\"UVA-1226\":[\"Numerical surprises\",991,null],\"SPOJ-KOILINE\":[\"Line up\",430,\"2011 KOI Regional\"],\"SPOJ-ADAPICK\":[\"Ada and Cucumber\",108,\"\"],\"CodeForces-36E\":[\"Two Paths\",536,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/36\\\"\\u003eCodeforces Beta Round 36\\u003c/a\\u003e\"],\"SPOJ-TPGA\":[\"The Permutation Game Again\",169,\"Motivated by www.spoj.com/problems/PERMRANK\"],\"CodeForces-36B\":[\"Fractal\",1584,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/36\\\"\\u003eCodeforces Beta Round 36\\u003c/a\\u003e\"],\"CodeForces-816B\":[\"Karen and Coffee\",19743,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/816\\\"\\u003eCodeforces Round 419 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-PALMKR\":[\"Palindrome Maker\",92,\"hobby\"],\"CodeForces-816D\":[\"Karen and Test\",42,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/816\\\"\\u003eCodeforces Round 419 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-816C\":[\"Karen and Game\",157,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/816\\\"\\u003eCodeforces Round 419 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-900C\":[\"Remove Extra One\",4736,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/900\\\"\\u003eCodeforces Round 450 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-900D\":[\"Unusual Sequences\",3266,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/900\\\"\\u003eCodeforces Round 450 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-900A\":[\"Find Extra One\",14602,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/900\\\"\\u003eCodeforces Round 450 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-900B\":[\"Position in Fraction\",8460,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/900\\\"\\u003eCodeforces Round 450 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-900E\":[\"Maximum Questions\",1061,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/900\\\"\\u003eCodeforces Round 450 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-INVPHI\":[\"Smallest Inverse Euler Totient Function\",254,\"Own Problem\"],\"UVA-1220\":[\"Party at Hali-Bula\",2329,null],\"SPOJ-ADASALE\":[\"Ada and Salesman\",40,\"\"],\"CodeChef-CHEFYODA\":[\"Chef and Yoda\",562,\"omelyanenko\"],\"UVA-1235\":[\"Anti Brute Force Lock\",1937,null],\"CodeForces-37C\":[\"Old Berland Language\",1657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/37\\\"\\u003eCodeforces Beta Round 37\\u003c/a\\u003e\"],\"SPOJ-ADASETS\":[\"Ada and Sets\",45,\"\"],\"SPOJ-SICRANO\":[\"Sicrano\",559,\"UFPE\"],\"UVA-908\":[\"Re-connecting Computer Sites\",4022,null],\"SPOJ-POLCONST\":[\"Constructible Regular Polygons\",500,\"Classical math.\"],\"CodeForces-814D\":[\"An overnight dance in discotheque\",2319,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/814\\\"\\u003eCodeforces Round 418 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-729F\":[\"Financiers Game\",965,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/729\\\"\\u003eTechnocup 2017 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-814C\":[\"An impassioned circulation of affection\",6684,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/814\\\"\\u003eCodeforces Round 418 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADACOINS\":[\"Ada and Coins\",842,\"\"],\"CodeForces-814E\":[\"An unavoidable detour for home\",712,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/814\\\"\\u003eCodeforces Round 418 (Div. 2)\\u003c/a\\u003e\"],\"UVA-12062\":[\"Reverse Assignment\",88,null],\"UVA-1233\":[\"USHER\",268,null],\"UVA-1230\":[\"MODEX\",7691,null],\"UVA-12047\":[\"Highest Paid Toll\",1441,null],\"UVA-12045\":[\"Fun with Strings\",137,null],\"UVALive-6829\":[\"Intrepid climber\",292,\"Regionals 2014 \\u003e\\u003e Latin America\"],\"CodeForces-34D\":[\"Road Map\",5610,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/34\\\"\\u003eCodeforces Beta Round 34 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-34C\":[\"Page Numbers\",4637,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/34\\\"\\u003eCodeforces Beta Round 34 (Div. 2)\\u003c/a\\u003e\"],\"HackerRank-jenny-subtrees\":[\"Jenny\\u0027s Subtrees\",9,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/hourrank-16\\u0027 target\\u003d\\u0027_blank\\u0027\\u003ehourrank-16\\u003c/a\\u003e\"],\"SPOJ-GSWORDS\":[\"Counting Words\",185,\"Jonathan Irvin Gunawan, used in TOKI OpenContest March 2012\"],\"CodeForces-729C\":[\"Road to Cinema\",4111,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/729\\\"\\u003eTechnocup 2017 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-729B\":[\"Spotlights\",8177,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/729\\\"\\u003eTechnocup 2017 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-729E\":[\"Subordinates\",2190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/729\\\"\\u003eTechnocup 2017 - Elimination Round 2\\u003c/a\\u003e\"],\"SPOJ-ADABASET\":[\"Ada and Database\",21,\"\"],\"CodeForces-729D\":[\"Sea Battle\",4014,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/729\\\"\\u003eTechnocup 2017 - Elimination Round 2\\u003c/a\\u003e\"],\"CodeForces-814A\":[\"An abandoned sentiment from past\",10818,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/814\\\"\\u003eCodeforces Round 418 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-813C\":[\"The Tag Game\",6374,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"CodeForces-813B\":[\"The Golden Age\",4037,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"CodeForces-813E\":[\"Army Creation\",2667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"SPOJ-DCEPC705\":[\"Weird Points\",215,\"Own Problem\"],\"SPOJ-DCEPC706\":[\"Meeting For Party\",634,\"Own Problem\"],\"CodeForces-813D\":[\"Two Melodies\",1026,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"SPOJ-SUBSN\":[\"Subsequence\",178,\"FCIS/ASU Local Contest 2013\"],\"SPOJ-PERMPATT\":[\"Check 1324\",106,\"\"],\"UVA-1242\":[\"Necklace\",237,null],\"SPOJ-EC_P\":[\"Critical Edges\",1885,\"\"],\"UVA-12034\":[\"Race\",2144,null],\"CodeForces-35C\":[\"Fire Again\",7547,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/35\\\"\\u003eCodeforces Beta Round 35 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11186\":[\"Circum Triangle\",569,null],\"UVA-12031\":[\"Summation of Four Squares\",37,null],\"UVALive-3305\":[\"Tour\",188,\"Regionals 2005 \\u003e\\u003e Europe - Southeastern\"],\"SPOJ-VECTAR4\":[\"Changus Final Battle\",272,\"\"],\"SPOJ-VECTAR5\":[\"Count Subsets\",253,\"\"],\"UVALive-2453\":[\"Wall\",249,\"Regionals 2001 \\u003e\\u003e Europe - Northeastern\"],\"CodeForces-813A\":[\"The Contest\",5269,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/813\\\"\\u003eEducational Codeforces Round 22\\u003c/a\\u003e\"],\"CodeForces-727E\":[\"Games on a CD\",1270,\"\\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-812B\":[\"Sagheer, the Hausmeister\",5573,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/812\\\"\\u003eCodeforces Round 417 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-727D\":[\"T-shirts Distribution\",1970,\"\\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-727F\":[\"Polycarp\\u0027s problems\",808,\"\\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\"],\"SPOJ-BUSYMAN\":[\"I AM VERY BUSY\",9174,\"\"],\"CodeForces-812E\":[\"Sagheer and Apple Tree\",1109,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/812\\\"\\u003eCodeforces Round 417 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-VECTAR8\":[\"Primal Fear\",1828,\"\"],\"HackerRank-mining\":[\"Mining\",201,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/world-codesprint-5\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eworld-codesprint-5\\u003c/a\\u003e\"],\"UVA-12040\":[\"Again Lucky Numbers\",107,null],\"UVA-1254\":[\"Top 10\",309,null],\"SPOJ-ADAORANG\":[\"Ada and Orange Tree\",403,\"\"],\"SPOJ-NFURY\":[\"Training Land of Fury\",1390,\"Code Weavers 2013\"],\"Gym-101492L\":[\"Approximate Search\",164,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101492\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 USP Try-outs\\u003c/a\\u003e\"],\"SPOJ-ADALICI\":[\"Ada and Lychees\",16,\"\"],\"SPOJ-MSCHED\":[\"Milk Scheduling\",1226,\"USACO Dec 13, Silver Div\"],\"SPOJ-AROPE2\":[\"Alphabetic Rope2\",105,\"MySelf\"],\"UVA-536\":[\"Tree Recovery\",8549,null],\"UVA-535\":[\"Globetrotter\",992,null],\"UVALive-6851\":[\"The Programmers\",298,\"Regionals 2014 \\u003e\\u003e Asia - Bangkok\"],\"SPOJ-KAOS\":[\"Kaos\",326,\"COI, 2006, 2nd Day, Seniors\"],\"SPOJ-WAYHOME\":[\"The Bridge to Home\",115,\"\"],\"SPOJ-ADAPHOTO\":[\"Ada and Terramorphing\",287,\"\"],\"UVA-531\":[\"Compromise\",4500,null],\"CodeForces-592D\":[\"Super M\",2553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/592\\\"\\u003eCodeforces Round 328 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADAFIMBR\":[\"Ada and Fimbers\",117,\"Tunisian Collegiate Training Contest - Round #01\"],\"CodeForces-73C\":[\"LionAge II\",2232,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/73\\\"\\u003eCodeforces Beta Round 66\\u003c/a\\u003e\"],\"CodeForces-73B\":[\"Need For Brake\",521,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/73\\\"\\u003eCodeforces Beta Round 66\\u003c/a\\u003e\"],\"SPOJ-FINDSR\":[\"Find String Roots\",2411,\"FCEyN UBA ICPC Selection 2009\"],\"SPOJ-MC\":[\"Minimum Cost\",1565,\"BAPS\"],\"SPOJ-DYNACON1\":[\"Dynamic Tree Connectivity\",587,\"\"],\"CodeForces-903F\":[\"Clear The Matrix\",700,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-DSUBTREE\":[\"Distinct Subtrees\",18,\"Fudan University Local Contest #3, by g201513\"],\"SPOJ-DYNACON2\":[\"Dynamic Graph Connectivity\",307,\"\"],\"CodeForces-818G\":[\"Four Melodies\",688,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"CodeForces-903G\":[\"Yet Another Maxflow Problem\",568,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-903D\":[\"Almost Difference\",4002,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-CBANK\":[\"Charu and Coin Distribution\",415,\"Bytecode 2013\"],\"SPOJ-TETRAHRD\":[\"Sum of Tetranacci numbers\",276,\"own problem\"],\"SPOJ-HORRIBLE\":[\"Horrible Queries\",12253,\"Own. Thanks to Emir Habul.\"],\"SPOJ-SUBSHARD\":[\"Subset and upset (HARD)\",134,\"Hard version of NITT5 problem.\"],\"CodeForces-818B\":[\"Permutation Game\",3168,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"SPOJ-ADASEED\":[\"Ada and Tulips\",13,\"\"],\"SPOJ-LEXSTR\":[\"Lexicographically Smallest\",480,\"\"],\"CodeForces-818D\":[\"Multicolored Cars\",3673,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"CodeForces-903B\":[\"The Modcrab\",8567,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"SPOJ-NUMTSN\":[\"369 Numbers\",930,\"\"],\"CodeForces-818C\":[\"Sofa Thief\",1289,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"CodeForces-903C\":[\"Boxes Packing\",19124,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-818F\":[\"Level Generation\",1361,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"CodeForces-818E\":[\"Card Game Again\",1993,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/818\\\"\\u003eEducational Codeforces Round 24\\u003c/a\\u003e\"],\"CodeForces-903A\":[\"Hungry Student Problem\",15785,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/903\\\"\\u003eEducational Codeforces Round 34 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-902E\":[\"Bipartite Segments\",12,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/902\\\"\\u003eCodeforces Round 453 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-817F\":[\"MEX Queries\",2585,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"CodeForces-902C\":[\"Hashing Trees\",107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/902\\\"\\u003eCodeforces Round 453 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-902D\":[\"GCD of Polynomials\",42,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/902\\\"\\u003eCodeforces Round 453 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-KOPC12A\":[\"K12 - Building Construction\",2432,\"Own\"],\"SPOJ-KOPC12B\":[\"K12-Combinations\",416,\"\"],\"HackerRank-elastic-rope\":[\"Elastic rope\",4,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/world-codesprint-7\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eworld-codesprint-7\\u003c/a\\u003e\"],\"SPOJ-KOPC12G\":[\"K12-Bored of Suffixes and Prefixes\",113,\"Own\"],\"UVA-12093\":[\"Protecting Zonk\",382,null],\"SPOJ-KOPC12H\":[\"K12-OE Numbers\",277,\"\"],\"CodeForces-70A\":[\"Cookies\",3575,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/70\\\"\\u003eCodeforces Beta Round 64\\u003c/a\\u003e\"],\"CodeForces-70D\":[\"Professor\\u0027s task\",1035,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/70\\\"\\u003eCodeforces Beta Round 64\\u003c/a\\u003e\"],\"UVALive-7708\":[\"Cubes\",21,\"Regionals 2016 \\u003e\\u003e Europe - Southeastern\"],\"UVALive-7706\":[\"Pokemons\",73,\"Regionals 2016 \\u003e\\u003e Europe - Southeastern\"],\"UVALive-6856\":[\"Circle of digits\",45,\"Regionals 2014 \\u003e\\u003e Europe - Southeastern\"],\"UVALive-7703\":[\"Reading Digits\",82,\"Regionals 2016 \\u003e\\u003e Europe - Southeastern\"],\"CodeForces-817A\":[\"Treasure Hunt\",6667,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"UVALive-7701\":[\"Favorite music\",1,\"Regionals 2016 \\u003e\\u003e Europe - Southeastern\"],\"CodeForces-817C\":[\"Really Big Numbers\",8031,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"CodeForces-902A\":[\"Visiting a Friend\",10402,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/902\\\"\\u003eCodeforces Round 453 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-7702\":[\"Castle\",31,\"Regionals 2016 \\u003e\\u003e Europe - Southeastern\"],\"CodeForces-817B\":[\"Makes And The Product\",6421,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"CodeForces-902B\":[\"Coloring a Tree\",11478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/902\\\"\\u003eCodeforces Round 453 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-817E\":[\"Choosing The Commander\",2948,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"UVALive-3346\":[\"Perfect Domination on Trees\",50,\"Regionals 2005 \\u003e\\u003e Asia - Taipei\"],\"CodeForces-817D\":[\"Imbalanced Array\",4949,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/817\\\"\\u003eEducational Codeforces Round 23\\u003c/a\\u003e\"],\"UVALive-6861\":[\"Grammar\",11,\"Regionals 2014 \\u003e\\u003e Europe - Southeastern\"],\"CodeForces-901D\":[\"Weighting a Tree\",462,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/901\\\"\\u003eCodeforces Round 453 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-TDPRIMES\":[\"Printing some primes\",8943,\"Thanks to TDuke\"],\"CodeForces-816E\":[\"Karen and Supermarket\",83,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/816\\\"\\u003eCodeforces Round 419 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-71C\":[\"Round Table Knights\",6595,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/71\\\"\\u003eCodeforces Beta Round 65 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ADAAPPLE\":[\"Ada and Apple\",189,\"BTCODE_G\"],\"CodeForces-76D\":[\"Plus and xor\",2147,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/76\\\"\\u003eAll-Ukrainian School Olympiad in Informatics\\u003c/a\\u003e\"],\"SPOJ-ADAHACK\":[\"Ada and Diary\",63,\"\"],\"CodeForces-245H\":[\"Queries for Number of Palindromes\",6844,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/245\\\"\\u003eCROC-MBTU 2012, Elimination Round (ACM-ICPC)\\u003c/a\\u003e\"],\"CodeForces-76E\":[\"Points\",1789,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/76\\\"\\u003eAll-Ukrainian School Olympiad in Informatics\\u003c/a\\u003e\"],\"CodeForces-112D\":[\"Petya and Divisors\",75,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/112\\\"\\u003eCodeforces Beta Round 85 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-909A\":[\"Generate Login\",9850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-76B\":[\"Mice\",516,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/76\\\"\\u003eAll-Ukrainian School Olympiad in Informatics\\u003c/a\\u003e\"],\"CodeForces-76A\":[\"Gift\",1731,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/76\\\"\\u003eAll-Ukrainian School Olympiad in Informatics\\u003c/a\\u003e\"],\"CodeForces-112C\":[\"Petya and Inequiations\",186,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/112\\\"\\u003eCodeforces Beta Round 85 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-909D\":[\"Colorful Points\",1822,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-112A\":[\"Petya and Strings\",218941,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/112\\\"\\u003eCodeforces Beta Round 85 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-909E\":[\"Coprocessor\",2178,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-909B\":[\"Segments\",6553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"UVA-10724\":[\"Road Construction\",621,null],\"CodeForces-909C\":[\"Python Indentation\",5099,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-6887\":[\"Book Club\",297,\"Regionals 2014 \\u003e\\u003e Europe - Southwestern\"],\"UVALive-3378\":[\"Swamp Things\",100,\"Regionals 2005 \\u003e\\u003e North America - East Central NA\"],\"CodeForces-909F\":[\"AND-permutations\",553,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/909\\\"\\u003eCodeforces Round 455 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-6886\":[\"Golf Bot\",454,\"Regionals 2014 \\u003e\\u003e Europe - Southwestern\"],\"SPOJ-TRIGALGE\":[\"Easy Calculation\",1838,\"\"],\"SPOJ-LONGCS\":[\"Longest Common Substring\",834,\"UNI\"],\"SPOJ-PTIME\":[\"Prime Time\",2278,\"DWITE Programming Contest 2012 (Own Problem)\"],\"CodeForces-681E\":[\"Runaway to a Shadow\",496,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/681\\\"\\u003eCodeforces Round 357 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-111D\":[\"Petya and Coloring\",810,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/111\\\"\\u003eCodeforces Beta Round 85 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-908C\":[\"New Year and Curling\",7074,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"CodeForces-908D\":[\"New Year and Arbitrary Arrangement\",2432,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"CodeForces-908A\":[\"New Year and Counting Cards\",15918,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"UVALive-7726\":[\"A Simple Math Problem\",152,\"Regionals 2016 \\u003e\\u003e Asia - Dalian\"],\"CodeForces-908B\":[\"New Year and Buggy Bot\",8455,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"CodeForces-908F\":[\"New Year and Rainbow Roads\",1453,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/908\\\"\\u003eGood Bye 2017\\u003c/a\\u003e\"],\"UVALive-7730\":[\"To begin or not to begin\",160,\"Regionals 2016 \\u003e\\u003e Asia - Dalian\"],\"UVA-10716\":[\"Evil Straw Warts Live\",727,null],\"SPOJ-ADABERRY\":[\"Ada and Mulberry\",240,\"\"],\"SPOJ-CAC\":[\"Cactus\",201,\"FCIS/ASU Local Contest 2013\"],\"UVA-983\":[\"Localized Summing for Blurring\",1155,null],\"CodeForces-680E\":[\"Bear and Square Grid\",6,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/680\\\"\\u003eCodeforces Round 356 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-110D\":[\"Lucky Probability\",26,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/110\\\"\\u003eCodeforces Beta Round 84 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-74C\":[\"Chessboard Billiard\",1050,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/74\\\"\\u003eCodeforces Beta Round 68\\u003c/a\\u003e\"],\"CodeForces-110E\":[\"Lucky Tree\",53,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/110\\\"\\u003eCodeforces Beta Round 84 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-110B\":[\"Lucky String\",10840,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/110\\\"\\u003eCodeforces Beta Round 84 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-110C\":[\"Lucky Sum of Digits\",295,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/110\\\"\\u003eCodeforces Beta Round 84 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-110A\":[\"Nearly Lucky Number\",148892,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/110\\\"\\u003eCodeforces Beta Round 84 (Div. 2 Only)\\u003c/a\\u003e\"],\"SPOJ-WORKB\":[\"Working in Beijing\",640,\"Fudan University Local Contest #3, by lcosvse\"],\"CodeForces-907C\":[\"Shockers\",78,\"\\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\"],\"SPOJ-FCDC\":[\"Factorial Modulo\",500,\"Own Problem\"],\"CodeForces-907A\":[\"Masha and Bears\",6058,\"\\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-907F\":[\"Power Tower\",9,\"\\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-907D\":[\"Seating of Students\",16,\"\\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-907E\":[\"Party\",11,\"\\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\"],\"Gym-100917K\":[\"Krotek\",20,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100917\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015-2016 XVI Open Cup, Grand Prix of Bashkortostan, SKB Kontur Cup Stage 2\\u003c/a\\u003e\"],\"CodeForces-75C\":[\"Modified GCD\",14095,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/75\\\"\\u003eCodeforces Beta Round 67 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-GGD\":[\"Mr Toothless and His GCD Operation\",399,\"Own Problem\"],\"CodeForces-75A\":[\"Life Without Zeros\",26226,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/75\\\"\\u003eCodeforces Beta Round 67 (Div. 2)\\u003c/a\\u003e\"],\"LightOJ-1196\":[\"Inhabitants\",134,null],\"UVALive-7743\":[\"Cliques\",10,\"Regionals 2016 \\u003e\\u003e Asia - QingDao\"],\"UVALive-3396\":[\"Alphabetics\",104,\"Regionals 2017 \\u003e\\u003e \\tAfrica/Middle East - South Africa\"],\"SPOJ-JOHNNY\":[\"Johnny Goes Shopping\",1498,\"\"],\"UVA-11979\":[\"Hamming Base\",230,null],\"Kattis-airport\":[\"Airport Construction\",253,\"\\u003ca href\\u003d\\\"https://open.kattis.com/problem-sources/International%20Collegiate%20Programming%20Contest%20%28ACM-ICPC%29%20World%20Finals%202017\\\"\\u003eInternational Collegiate Programming Contest (ACM-ICPC) World Finals 2017\\u003c/a\\u003e\"],\"SPOJ-PT07X\":[\"Vertex Cover\",4494,\"Co-author Amber\"],\"UVA-12821\":[\"Double Shortest Paths\",135,null],\"SPOJ-EC_ESTA\":[\"Statistics Applied\",213,\"COMPETENCIA CCBOL2013\"],\"UVA-495\":[\"Fibonacci Freeze\",12033,null],\"SPOJ-DCEPC203\":[\"Obsession\",32,\"Own Problem\"],\"UVA-497\":[\"Strategic Defense Initiative\",4806,null],\"SPOJ-DCEPC206\":[\"Its a Murder!\",2639,\"Own Problem\"],\"UVA-11960\":[\"Divisor Game\",1071,null],\"UVA-11961\":[\"DNA\",639,null],\"CodeForces-321E\":[\"Ciel and Gondolas\",5080,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/321\\\"\\u003eCodeforces Round 190 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-CNTPRIME\":[\"Counting Primes\",1763,\"Own Problem\"],\"UVA-10635\":[\"Prince and Princess\",4675,null],\"UVA-11966\":[\"Galactic Bonding\",911,null],\"CodeChef-CHEFELEC\":[\"Chefland and Electricity\",3222,\"admin2\"],\"UVALive-7649\":[\"Performance Review\",55,\"Regionals 2016 \\u003e\\u003e Europe - Southwestern\"],\"UVA-11962\":[\"DNA II\",358,null],\"UVALive-7651\":[\"Pascal\\u0027s Hyper-Pyramids\",63,\"Regionals 2016 \\u003e\\u003e Europe - Southwestern\"],\"Gym-101620G\":[\"Gambling Guide\",453,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101620\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC, Central Europe Regional Contest (CERC 17)\\u003c/a\\u003e\"],\"Gym-101620F\":[\"Faulty Factorial\",803,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101620\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC, Central Europe Regional Contest (CERC 17)\\u003c/a\\u003e\"],\"UVA-12818\":[\"Arc and Point\",67,null],\"Gym-101620J\":[\"Justified Jungle\",755,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101620\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC, Central Europe Regional Contest (CERC 17)\\u003c/a\\u003e\"],\"CodeForces-672C\":[\"Recycling Bottles\",86,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/672\\\"\\u003eCodeforces Round 352 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-890B\":[\"Vlad and Cafes\",133,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/890\\\"\\u003eCodeforces Round 445 (Div. 2, based on Technocup 2018 Elimination Round 3)\\u003c/a\\u003e\"],\"CodeForces-890A\":[\"ACM ICPC\",261,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/890\\\"\\u003eCodeforces Round 445 (Div. 2, based on Technocup 2018 Elimination Round 3)\\u003c/a\\u003e\"],\"SPOJ-BUBBLESORT\":[\"Bubble Sort\",748,\"AIUB CS Fest 2015 (H.M. Mehrab)\"],\"CodeForces-890D\":[\"Restoration of string\",11,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/890\\\"\\u003eCodeforces Round 445 (Div. 2, based on Technocup 2018 Elimination Round 3)\\u003c/a\\u003e\"],\"CodeForces-890C\":[\"Petya and Catacombs\",52,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/890\\\"\\u003eCodeforces Round 445 (Div. 2, based on Technocup 2018 Elimination Round 3)\\u003c/a\\u003e\"],\"CodeForces-890E\":[\"Maximum Element\",1,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/890\\\"\\u003eCodeforces Round 445 (Div. 2, based on Technocup 2018 Elimination Round 3)\\u003c/a\\u003e\"],\"SPOJ-JOSWAP\":[\"Just One Swap\",187,\"National High School Programming Contest 2017\"],\"CodeChef-FRJUMP\":[\"Chef and cities\",810,\"fiter\"],\"SPOJ-SUFEQPRE\":[\"Suffix Equal Prefix\",689,\"Own Problem\"],\"CodeForces-102C\":[\"Homework\",230,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/102\\\"\\u003eCodeforces Beta Round 79 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-102D\":[\"Buses\",176,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/102\\\"\\u003eCodeforces Beta Round 79 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-102A\":[\"Clothes\",3435,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/102\\\"\\u003eCodeforces Beta Round 79 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-102B\":[\"Sum of Digits\",27346,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/102\\\"\\u003eCodeforces Beta Round 79 (Div. 2 Only)\\u003c/a\\u003e\"],\"Gym-101889D\":[\"Daunting device\",186,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101889\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC Latin American Regional Programming Contest\\u003c/a\\u003e\"],\"Gym-101889H\":[\"Hard choice\",1685,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101889\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC Latin American Regional Programming Contest\\u003c/a\\u003e\"],\"Gym-101889E\":[\"Enigma\",792,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101889\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC Latin American Regional Programming Contest\\u003c/a\\u003e\"],\"SPOJ-HG\":[\"HUGE GCD\",840,\"\"],\"Gym-101889L\":[\"Linearville\",37,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101889\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC Latin American Regional Programming Contest\\u003c/a\\u003e\"],\"Gym-101889M\":[\"Marblecoin\",117,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101889\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017-2018 ACM-ICPC Latin American Regional Programming Contest\\u003c/a\\u003e\"],\"CodeForces-671C\":[\"Ultimate Weirdness of an Array\",695,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/671\\\"\\u003eCodeforces Round 352 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-ADAKOHL\":[\"Ada and Kohlrabi\",76,\"\"],\"SPOJ-GUESSTHE\":[\"Guess the Number\",2255,\"FCEyN UBA ICPC Selection 2008\"],\"SPOJ-SKYLINE\":[\"Skyline\",953,\"ACM ICPC Southeast USA Regional 2010\"],\"CodeForces-149B\":[\"Martian Clock\",2390,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-RTREE\":[\"Roger and tree\",355,\"Own problem (Codecracker 2014)\"],\"Gym-101840B\":[\"Breaking the Curse\",137,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101840\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eEgyptian Collegiate Programming Contest 2017 (ACM ECPC 2017)\\u003c/a\\u003e\"],\"CodeForces-149A\":[\"Business trip\",40338,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/149\\\"\\u003eCodeforces Round 106 (Div. 2)\\u003c/a\\u003e\"],\"Gym-101840A\":[\"Assessments\",119,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101840\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eEgyptian Collegiate Programming Contest 2017 (ACM ECPC 2017)\\u003c/a\\u003e\"],\"Gym-101840F\":[\"Forgot the Flag!\",96,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101840\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eEgyptian Collegiate Programming Contest 2017 (ACM ECPC 2017)\\u003c/a\\u003e\"],\"UVALive-7673\":[\"What a Simple Research\",441,\"Regionals 2016 \\u003e\\u003e Asia - Beijing\"],\"Gym-101840D\":[\"Dream Team\",411,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101840\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eEgyptian Collegiate Programming Contest 2017 (ACM ECPC 2017)\\u003c/a\\u003e\"],\"Gym-101840E\":[\"Evaluations\",187,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101840\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eEgyptian Collegiate Programming Contest 2017 (ACM ECPC 2017)\\u003c/a\\u003e\"],\"UVALive-7671\":[\"What a Beautiful Lake\",466,\"Regionals 2016 \\u003e\\u003e Asia - Beijing\"],\"Gym-101840I\":[\"Important matches\",405,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101840\\u0027 target\\u003d\\u0027_blank\\u0027\\u003eEgyptian Collegiate Programming Contest 2017 (ACM ECPC 2017)\\u003c/a\\u003e\"],\"UVA-481\":[\"What Goes Up\",6476,null],\"SPOJ-FACTDIV\":[\"Factorial and divisorss\",105,\"self\"],\"SPOJ-MON2012\":[\"Monkey and apples\",189,\"izho 2012\"],\"UVA-11539\":[\"Another Word Game\",199,null],\"UVA-11538\":[\"Chess Queen\",3496,null],\"CodeForces-459D\":[\"Pashmak and Parmida\\u0027s problem\",10578,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/459\\\"\\u003eCodeforces Round 261 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11535\":[\"Set of Marbles\",241,null],\"CodeForces-108D\":[\"Basketball Team\",59,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/108\\\"\\u003eCodeforces Beta Round 83 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-108A\":[\"Palindromic Times\",10085,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/108\\\"\\u003eCodeforces Beta Round 83 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-108B\":[\"Datatypes\",2761,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/108\\\"\\u003eCodeforces Beta Round 83 (Div. 2 Only)\\u003c/a\\u003e\"],\"UVA-11534\":[\"Say Goodbye to Tic-Tac-Toe\",317,null],\"CodeForces-895A\":[\"Pizza Separation\",6868,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-895C\":[\"Square Subsets\",5478,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-895B\":[\"XK Segments\",3676,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-762D\":[\"Maximum path\",1396,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"CodeForces-895E\":[\"Eyes Closed\",975,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-762C\":[\"Two strings\",2518,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"CodeForces-895D\":[\"String Mark\",1126,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/895\\\"\\u003eCodeforces Round 448 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-DOMINO1\":[\"The Longest Chain of Domino Tiles\",291,\"own problem\"],\"CodeForces-762E\":[\"Radio stations\",1391,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"SPOJ-FRNDZND\":[\"Friend Zoned\",302,\"\"],\"UVA-453\":[\"Intersecting Circles\",410,null],\"Gym-100685G\":[\"Gadget Hackwrench\",366,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100685\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2012-2013 ACM-ICPC, NEERC, Moscow Subregional Contest\\u003c/a\\u003e\"],\"SPOJ-BCAKE\":[\"Birthday Cake\",267,\"inspired by TopCoder problem\"],\"SPOJ-DIVFACT4\":[\"Divisors of factorial (extreme)\",77,\"DIVFACT\"],\"UVA-11526\":[\"H(n)\",4500,null],\"CodeForces-107D\":[\"Crime Management\",462,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/107\\\"\\u003eCodeforces Beta Round 83 (Div. 1 Only)\\u003c/a\\u003e\"],\"UVA-10679\":[\"I Love Strings!!\",4994,null],\"UVA-10678\":[\"The Grazing Cow\",3781,null],\"UVA-11522\":[\"Pyramid Number\",151,null],\"UVALive-7204\":[\"Blood groups\",135,\"Regionals 2015 \\u003e\\u003e Latin America\"],\"UVA-11523\":[\"Recycling\",320,null],\"SPOJ-DIVFACT3\":[\"Divisors of factorial (hard)\",167,\"DIVFACT2\"],\"SPOJ-POLYMUL\":[\"Polynomial Multiplication\",1834,\"\"],\"UVALive-7691\":[\"Falling Apples\",40,\"Regionals 2016 \\u003e\\u003e North America - Mid-Central USA\"],\"CodeForces-894B\":[\"Ralph And His Magic Field\",4773,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/894\\\"\\u003eCodeforces Round 447 (Div. 2)\\u003c/a\\u003e\"],\"UVALive-7692\":[\"Square Deal\",36,\"Regionals 2016 \\u003e\\u003e North America - Mid-Central USA\"],\"CodeForces-894A\":[\"QAQ\",36099,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/894\\\"\\u003eCodeforces Round 447 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-894D\":[\"Ralph And His Tour in Binary Country\",1162,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/894\\\"\\u003eCodeforces Round 447 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-894C\":[\"Marco and GCD Sequence\",4634,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/894\\\"\\u003eCodeforces Round 447 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-761E\":[\"Dasha and Puzzle\",1984,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/761\\\"\\u003eCodeforces Round 394 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-894E\":[\"Ralph and Mushrooms\",2340,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/894\\\"\\u003eCodeforces Round 447 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-761F\":[\"Dasha and Photos\",437,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/761\\\"\\u003eCodeforces Round 394 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11510\":[\"Erdös Unit Fractions\",96,null],\"SPOJ-STRMATCH\":[\"Match me if you can\",234,\"Me, MYSELF \\u0026 I\"],\"SPOJ-ADAXMAS\":[\"Ada and Christmas\",12,\"http://www.spoj.com/problems/ADAGAME5/\"],\"UVA-11990\":[\"``Dynamic\\u0027\\u0027 Inversion\",887,null],\"UVA-12849\":[\"Mother\\u0027s Jam Puzzle\",81,null],\"CodeChef-ROBOTDAG\":[\"Robots in a DAG\",526,\"admin3\"],\"CodeForces-106C\":[\"Buns\",6837,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/106\\\"\\u003eCodeforces Beta Round 82 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11516\":[\"WiFi\",1488,null],\"CodeForces-106A\":[\"Card Game\",7755,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/106\\\"\\u003eCodeforces Beta Round 82 (Div. 2)\\u003c/a\\u003e\"],\"LightOJ-1221\":[\"Travel Company\",513,null],\"CodeForces-106B\":[\"Choosing Laptop\",6376,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/106\\\"\\u003eCodeforces Beta Round 82 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11514\":[\"Batman\",337,null],\"UVA-10667\":[\"Largest Block\",2391,null],\"UVA-12843\":[\"Disputed Claims\",66,null],\"UVA-11512\":[\"GATTACA\",2474,null],\"UVALive-6395\":[\"Surely You Congest\",156,\"World Finals \\u003e\\u003e 2013 - Saint Petersburg\"],\"UVA-439\":[\"Knight Moves\",16526,null],\"CodeForces-893A\":[\"Chess For Three\",10881,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UVA-438\":[\"The Circumference of the Circle\",7850,null],\"CodeForces-675D\":[\"Tree Construction\",3832,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/675\\\"\\u003eCodeforces Round 353 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-760B\":[\"Frodo and pillows\",6794,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/760\\\"\\u003eCodeforces Round 393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-893C\":[\"Rumor\",24311,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-675E\":[\"Trains and Statistic\",2795,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/675\\\"\\u003eCodeforces Round 353 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-893B\":[\"Beautiful Divisors\",11751,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-760D\":[\"Travel Card\",55,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/760\\\"\\u003eCodeforces Round 393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-893E\":[\"Counting Arrays\",3589,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-893D\":[\"Credit Card\",3093,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-760F\":[\"Bacterial Melee\",26,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/760\\\"\\u003eCodeforces Round 393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition)\\u003c/a\\u003e\"],\"CodeForces-893F\":[\"Subtree Minimum Query\",1755,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/893\\\"\\u003eEducational Codeforces Round 33 (Rated for Div. 2)\\u003c/a\\u003e\"],\"UVA-12830\":[\"A Football Stadium\",84,null],\"SPOJ-IWGBS\":[\"0110SS\",1822,\"\"],\"UVA-11506\":[\"Angry Programmer\",1800,null],\"SPOJ-RMID2\":[\"Running Median Again\",2051,\"variation on RMID\"],\"Gym-101666A\":[\"Amsterdam Distance\",806,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101666\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 Benelux Algorithm Programming Contest (BAPC 17)\\u003c/a\\u003e\"],\"Gym-101666D\":[\"Detour\",686,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101666\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 Benelux Algorithm Programming Contest (BAPC 17)\\u003c/a\\u003e\"],\"UVA-11987\":[\"Almost Union-Find\",3626,null],\"UVA-11503\":[\"Virtual Friends\",7830,null],\"Gym-101666E\":[\"Easter Eggs\",375,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101666\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 Benelux Algorithm Programming Contest (BAPC 17)\\u003c/a\\u003e\"],\"UVA-11985\":[\"Prime Independence\",102,null],\"UVA-12831\":[\"Bob the Builder\",56,null],\"Gym-101666C\":[\"Collatz Conjecture\",651,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101666\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 Benelux Algorithm Programming Contest (BAPC 17)\\u003c/a\\u003e\"],\"Gym-101666H\":[\"Hoarse Horses\",148,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101666\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 Benelux Algorithm Programming Contest (BAPC 17)\\u003c/a\\u003e\"],\"Gym-101666I\":[\"Irrational Division\",598,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101666\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 Benelux Algorithm Programming Contest (BAPC 17)\\u003c/a\\u003e\"],\"Gym-101666G\":[\"Going Dutch\",239,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101666\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 Benelux Algorithm Programming Contest (BAPC 17)\\u003c/a\\u003e\"],\"Gym-101666L\":[\"Lemonade Trade\",494,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101666\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2017 Benelux Algorithm Programming Contest (BAPC 17)\\u003c/a\\u003e\"],\"UVA-11509\":[\"Touring Robot\",139,null],\"UVA-440\":[\"Eeny Meeny Moo\",5277,null],\"CodeForces-892B\":[\"Wrath\",9984,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/892\\\"\\u003eCodeforces Round 446 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-892A\":[\"Greed\",14517,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/892\\\"\\u003eCodeforces Round 446 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-892D\":[\"Gluttony\",128,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/892\\\"\\u003eCodeforces Round 446 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-892C\":[\"Pride\",384,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/892\\\"\\u003eCodeforces Round 446 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-GOT\":[\"Gao on a tree\",848,\"\"],\"CodeForces-892E\":[\"Envy\",59,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/892\\\"\\u003eCodeforces Round 446 (Div. 2)\\u003c/a\\u003e\"],\"UVA-11573\":[\"Ocean Currents\",944,null],\"UVA-1306\":[\"The K-League\",208,null],\"SPOJ-COT2\":[\"Count on a tree II\",3706,\"Just for fun...\"],\"CodeForces-28C\":[\"Bath Queue\",1152,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/28\\\"\\u003eCodeforces Beta Round 28 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-28B\":[\"pSort\",4902,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/28\\\"\\u003eCodeforces Beta Round 28 (Codeforces format)\\u003c/a\\u003e\"],\"SPOJ-ADALIST\":[\"Ada and List\",505,\"\"],\"SPOJ-TRIPINV\":[\"Mega Inversions\",645,\"Nordic programming contest\"],\"UVA-12425\":[\"Best Friend\",406,null],\"SPOJ-SUB_PROB\":[\"Substring Problem\",916,\"Codefest 2010 CW R#2\"],\"CodeForces-5A\":[\"Chat Servers Outgoing Traffic\",10227,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/5\\\"\\u003eCodeforces Beta Round 5\\u003c/a\\u003e\"],\"HackerRank-easy-gcd-1\":[\"Easy GCD\",1264,\"\\u003ca href\\u003d\\u0027https://www.hackerrank.com/contests/master\\u0027 target\\u003d\\u0027_blank\\u0027\\u003emaster\\u003c/a\\u003e\"],\"CodeForces-899A\":[\"Splitting in Teams\",10898,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-5B\":[\"Center Alignment\",6167,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/5\\\"\\u003eCodeforces Beta Round 5\\u003c/a\\u003e\"],\"CodeForces-5C\":[\"Longest Regular Bracket Sequence\",14236,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/5\\\"\\u003eCodeforces Beta Round 5\\u003c/a\\u003e\"],\"CodeForces-899C\":[\"Dividing the numbers\",9015,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-899B\":[\"Months and Years\",6199,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-766D\":[\"Mahmoud and a Dictionary\",3633,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/766\\\"\\u003eCodeforces Round 396 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-899E\":[\"Segments Removal\",2904,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-766C\":[\"Mahmoud and a Message\",4562,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/766\\\"\\u003eCodeforces Round 396 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-899D\":[\"Shovel Sale\",2820,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-766E\":[\"Mahmoud and a xor trip\",3022,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/766\\\"\\u003eCodeforces Round 396 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-899F\":[\"Letters Removing\",1657,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/899\\\"\\u003eCodeforces Round 452 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-633F\":[\"The Chocolate Spree\",978,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/633\\\"\\u003eManthan, Codefest 16\\u003c/a\\u003e\"],\"CodeForces-851E\":[\"Arpa and a game with Mojtaba\",82,\"\\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-633G\":[\"Yash And Trees\",775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/633\\\"\\u003eManthan, Codefest 16\\u003c/a\\u003e\"],\"CodeForces-851D\":[\"Arpa and a list of numbers\",40,\"\\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-5E\":[\"Bindian Signalizing\",2096,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/5\\\"\\u003eCodeforces Beta Round 5\\u003c/a\\u003e\"],\"Gym-100866A\":[\"Anti factorial\",276,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100866\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2005-2006 ACM-ICPC, NEERC, Moscow Subregional Contest\\u003c/a\\u003e\"],\"SPOJ-PAIRSUM\":[\"Sum of Pairwise Products\",1137,\"\"],\"UVA-11563\":[\"Introspective Caching\",151,null],\"UVA-12891\":[\"Risk of Trading\",29,null],\"CodeForces-29D\":[\"Ant on the Tree\",2551,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/29\\\"\\u003eCodeforces Beta Round 29 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-29C\":[\"Mail Stamps\",5532,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/29\\\"\\u003eCodeforces Beta Round 29 (Div. 2, Codeforces format)\\u003c/a\\u003e\"],\"CodeChef-ALLPOLY\":[\"Defend the Recipe\",67,\"kevinsogo\"],\"SPOJ-STRSEQ\":[\"String Subsequence\",91,\"Author: Guilherme Souza (guirns)\"],\"SPOJ-PRIMPERM\":[\"Prime Permutations\",105,\"own problem\"],\"SPOJ-STONE2\":[\"A Famous Stone Collector\",223,\"Classical Problem, used in FDU Local Contest 2012\"],\"SPOJ-PON\":[\"Prime or Not\",5374,\"ZCon 2005\"],\"CodeForces-898B\":[\"Proper Nutrition\",10173,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-BWHEELER\":[\"Burrows Wheeler Precompression\",421,\"NITT ACM ICPC Local Contest 2007 [Wikipedia/General]\"],\"CodeForces-4C\":[\"Registration System\",89695,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/4\\\"\\u003eCodeforces Beta Round 4 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-898A\":[\"Rounding\",16944,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-898D\":[\"Alarm Clock\",4052,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-898C\":[\"Phone Numbers\",5635,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-765E\":[\"Tree Folding\",1321,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/765\\\"\\u003eCodeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-898F\":[\"Restoring the Expression\",1349,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-898E\":[\"Squares and not squares\",4919,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/898\\\"\\u003eCodeforces Round 451 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-ROHAAN\":[\"Defend The Rohan\",1693,\"Own\"],\"CodeForces-765F\":[\"Souvenirs\",2026,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/765\\\"\\u003eCodeforces Round 397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined)\\u003c/a\\u003e\"],\"CodeForces-4D\":[\"Mysterious Present\",10511,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/4\\\"\\u003eCodeforces Beta Round 4 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeChef-KBIGNUMB\":[\"Eugene and big number\",893,\"aangairbender\"],\"UVALive-2827\":[\"Phone Home\",111,\"Regionals 2003 \\u003e\\u003e North America - East Central NA\"],\"UVA-10220\":[\"I Love Big Numbers !\",7093,null],\"UVA-11551\":[\"Experienced Endeavour\",497,null],\"UVA-11552\":[\"Fewest Flops\",1221,null],\"CodeForces-26D\":[\"Tickets\",850,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/26\\\"\\u003eCodeforces Beta Round 26 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-26A\":[\"Almost Prime\",34709,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/26\\\"\\u003eCodeforces Beta Round 26 (Codeforces format)\\u003c/a\\u003e\"],\"SPOJ-SINEGGS\":[\"Sinha and Eggs\",569,\"\"],\"CodeForces-26C\":[\"Parquet\",929,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/26\\\"\\u003eCodeforces Beta Round 26 (Codeforces format)\\u003c/a\\u003e\"],\"CodeForces-26B\":[\"Regular Bracket Sequence\",20359,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/26\\\"\\u003eCodeforces Beta Round 26 (Codeforces format)\\u003c/a\\u003e\"],\"SPOJ-VCIRCLES\":[\"Area of circles\",379,\"IOICAMP\"],\"UVA-11556\":[\"Best Compression Ever\",682,null],\"CodeForces-7D\":[\"Palindrome Degree\",4041,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/7\\\"\\u003eCodeforces Beta Round 7\\u003c/a\\u003e\"],\"CodeForces-897A\":[\"Scarborough Fair\",14775,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/897\\\"\\u003eCodeforces Round 449 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-897C\":[\"Nephren gives a riddle\",133,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/897\\\"\\u003eCodeforces Round 449 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-546D\":[\"Soldier and Number Game\",12235,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/546\\\"\\u003eCodeforces Round 304 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-897B\":[\"Chtholly\\u0027s request\",7710,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/897\\\"\\u003eCodeforces Round 449 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-7A\":[\"Kalevitch and Chess\",7786,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/7\\\"\\u003eCodeforces Beta Round 7\\u003c/a\\u003e\"],\"CodeForces-897E\":[\"Willem, Chtholly and Seniorious\",11,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/897\\\"\\u003eCodeforces Round 449 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-897D\":[\"Ithea Plays With Chtholly\",90,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/897\\\"\\u003eCodeforces Round 449 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-631E\":[\"Product Sum\",2548,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/631\\\"\\u003eCodeforces Round 344 (Div. 2)\\u003c/a\\u003e\"],\"Gym-100820A\":[\"Airports\",317,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/100820\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2015-2016 ACM-ICPC Pacific Northwest Regional Contest (Div. 1)\\u003c/a\\u003e\"],\"UVALive-2819\":[\"Cave Raider\",59,\"Regionals 2003 \\u003e\\u003e Asia - Kaohsiung\"],\"CodeForces-27E\":[\"Number With The Given Amount Of Divisors\",4675,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/27\\\"\\u003eCodeforces Beta Round 27 (Codeforces format, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-27B\":[\"Tournament\",5648,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/27\\\"\\u003eCodeforces Beta Round 27 (Codeforces format, Div. 2)\\u003c/a\\u003e\"],\"CodeForces-27D\":[\"Ring Road 2\",2586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/27\\\"\\u003eCodeforces Beta Round 27 (Codeforces format, Div. 2)\\u003c/a\\u003e\"],\"UVA-11548\":[\"Blackboard Bonanza\",466,null],\"CodeForces-27C\":[\"Unordered Subsequence\",3053,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/27\\\"\\u003eCodeforces Beta Round 27 (Codeforces format, Div. 2)\\u003c/a\\u003e\"],\"SPOJ-TFRIENDS\":[\"True Friends\",1305,\"\"],\"CodeForces-109D\":[\"Lucky Sorting\",669,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/109\\\"\\u003eCodeforces Beta Round 84 (Div. 1 Only)\\u003c/a\\u003e\"],\"CodeForces-6B\":[\"President\\u0027s Office\",13069,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/6\\\"\\u003eCodeforces Beta Round 6 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-6C\":[\"Alice, Bob and Chocolate\",14828,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/6\\\"\\u003eCodeforces Beta Round 6 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-6D\":[\"Lizards and Basements 2\",1951,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/6\\\"\\u003eCodeforces Beta Round 6 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-6E\":[\"Exposition\",3235,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/6\\\"\\u003eCodeforces Beta Round 6 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-678B\":[\"The Same Calendar\",4594,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/678\\\"\\u003eEducational Codeforces Round 13\\u003c/a\\u003e\"],\"CodeForces-678C\":[\"Joty and Chocolate\",10163,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/678\\\"\\u003eEducational Codeforces Round 13\\u003c/a\\u003e\"],\"CodeForces-678E\":[\"Another Sith Tournament\",2055,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/678\\\"\\u003eEducational Codeforces Round 13\\u003c/a\\u003e\"],\"CodeForces-763C\":[\"Timofey and remoduling\",731,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/763\\\"\\u003eCodeforces Round 395 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-6A\":[\"Triangle\",21702,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/6\\\"\\u003eCodeforces Beta Round 6 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-763E\":[\"Timofey and our friends animals\",487,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/763\\\"\\u003eCodeforces Round 395 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-763D\":[\"Timofey and a flat tree\",574,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/763\\\"\\u003eCodeforces Round 395 (Div. 1)\\u003c/a\\u003e\"],\"SPOJ-TUG\":[\"Tug of War\",638,\"own problem\"],\"SPOJ-RANJAN02\":[\"Tower Of Hanoi - Revisited\",2115,\"IIITM Local Contest\"],\"UVA-1330\":[\"City Game\",949,null],\"CodeForces-630H\":[\"Benches\",5323,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/630\\\"\\u003eExperimental Educational Round: VolBIT Formulas Blitz\\u003c/a\\u003e\"],\"SPOJ-DELIVER\":[\"Delivery Route\",53,\"USACO JAN12\"],\"UVA-12467\":[\"Secret Word\",1800,null],\"UVA-12466\":[\"Ancestors\",102,null],\"UVA-10282\":[\"Babelfish\",11088,null],\"SPOJ-ADAFENCE\":[\"Ada and Fence\",47,\"\"],\"SPOJ-GCDEX\":[\"GCD Extreme\",2844,\"ACM World Final Warm up 1 - 2008\"],\"SPOJ-SHAHBG\":[\"SHAHBAG\",1544,\"\"],\"SPOJ-ESYRCRTN\":[\"Why Always Recursion\",1338,\"None\"],\"SPOJ-LCS\":[\"Longest Common Substring\",4448,\"\"],\"UVA-11138\":[\"Nuts and Bolts\",1491,null],\"CodeForces-638B\":[\"Making Genome in Berland\",1989,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/638\\\"\\u003eVK Cup 2016 - Qualification Round 2\\u003c/a\\u003e\"],\"CodeForces-9E\":[\"Interestring graph and Apples\",1061,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/9\\\"\\u003eCodeforces Beta Round 9 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-637B\":[\"Chat Order\",19367,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/637\\\"\\u003eVK Cup 2016 - Qualification Round 1\\u003c/a\\u003e\"],\"CodeForces-855A\":[\"Tom Riddle\\u0027s Diary\",23718,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-855C\":[\"Helga Hufflepuff\\u0027s Cup\",2096,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-855B\":[\"Marvolo Gaunt\\u0027s Ring\",9304,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-855E\":[\"Salazar Slytherin\\u0027s Locket\",1770,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-9B\":[\"Running Student\",5664,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/9\\\"\\u003eCodeforces Beta Round 9 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-855D\":[\"Rowena Ravenclaw\\u0027s Diadem\",496,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/855\\\"\\u003eManthan, Codefest 17\\u003c/a\\u003e\"],\"CodeForces-9C\":[\"Hexadecimal\\u0027s Numbers\",13412,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/9\\\"\\u003eCodeforces Beta Round 9 (Div. 2 Only)\\u003c/a\\u003e\"],\"CodeForces-722F\":[\"Cyclic Cipher\",503,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/722\\\"\\u003eIntel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-722E\":[\"Research Rover\",901,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/722\\\"\\u003eIntel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"UVA-12470\":[\"Tribonacci\",1423,null],\"SPOJ-NG0FRCTN\":[\"Fractions on Tree\",940,\"own\"],\"SPOJ-MAXMATCH\":[\"Maximum Self-Matching\",800,\"own problem\"],\"UVA-11125\":[\"Arrange Some Marbles\",389,null],\"SPOJ-GSS1\":[\"Can you answer these queries I\",15350,\"\"],\"UVA-11123\":[\"Counting Trapizoid\",115,null],\"SPOJ-DTPOLY2\":[\"Divide Polygon (HARD)\",17,\"\"],\"UVA-12452\":[\"Plants vs. Zombies HD SP\",171,null],\"SPOJ-NAJPWG\":[\"Playing with GCD\",1074,\"\"],\"UVA-11127\":[\"Triple-Free Binary Strings\",398,null],\"CodeForces-769C\":[\"Cycle In Maze\",2280,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/769\\\"\\u003eVK Cup 2017 - Qualification 1\\u003c/a\\u003e\"],\"CodeForces-769B\":[\"News About Credit\",3322,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/769\\\"\\u003eVK Cup 2017 - Qualification 1\\u003c/a\\u003e\"],\"CodeForces-769D\":[\"k-Interesting Pairs Of Integers\",2300,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/769\\\"\\u003eVK Cup 2017 - Qualification 1\\u003c/a\\u003e\"],\"CodeForces-8B\":[\"Obsession with Robots\",4494,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/8\\\"\\u003eCodeforces Beta Round 8\\u003c/a\\u003e\"],\"CodeForces-721E\":[\"Road to Home\",333,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/721\\\"\\u003eCodeforces Round 374 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-8C\":[\"Looking for Order\",3586,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/8\\\"\\u003eCodeforces Beta Round 8\\u003c/a\\u003e\"],\"SPOJ-LOOPEXP\":[\"Loop Expectation\",725,\"Own\"],\"SPOJ-LCA\":[\"Lowest Common Ancestor\",8216,\"FCIS/ASU Local Contest 2013\"],\"SPOJ-ADAPEAR\":[\"Ada and Pear\",9,\"\"],\"UVA-11594\":[\"All Pairs Maximum Flow\",297,null],\"UVA-11115\":[\"Uncle Jack\",1659,null],\"CodeForces-768D\":[\"Jon and Orbs\",2992,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/768\\\"\\u003eDivide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"SPOJ-MAXLN\":[\"THE MAX LINES\",8164,\"Own Problem(used for CSE,University of Dhaka, Newbies Contest)\"],\"CodeForces-768C\":[\"Jon Snow and his Favourite Number\",3991,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/768\\\"\\u003eDivide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"CodeForces-768E\":[\"Game of Stones\",3112,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/768\\\"\\u003eDivide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined)\\u003c/a\\u003e\"],\"SPOJ-IITWPC4J\":[\"Gopu and Fishes\",105,\"IITK ACA CSE online judge\"],\"SPOJ-MATHLOVE\":[\"Math is Love\",1299,\"\"],\"SPOJ-ULM09\":[\"Dark roads\",1777,\"2009/2010 ACM International Collegiate Programming Contest University of Ulm Local Contest\"],\"UVA-10256\":[\"The Great Divide\",843,null],\"Gym-101408C\":[\"Cat vs. Dog\",54,\"\\u003ca href\\u003d\\u0027https://codeforces.com/gym/101408\\u0027 target\\u003d\\u0027_blank\\u0027\\u003e2008-2009 Northwestern European Regional Contest (NWERC 2008)\\u003c/a\\u003e\"],\"SPOJ-IITWPC4H\":[\"Maggu and Cuteness of Strings\",164,\"IITK ACA CSE online judge\"],\"SPOJ-NOSQ\":[\"No Squares Numbers\",903,\"\"],\"SPOJ-IITWPC4D\":[\"Arrangement Validity\",230,\"IITK ACA CSE online judge\"],\"SPOJ-PHT\":[\"Pigeonhole Tower\",1897,\"Own Problem\"],\"UVA-11107\":[\"Life Forms\",1454,null],\"SPOJ-IITWPC4B\":[\"Maggu and Triangles\",417,\"IITK ACA CSE online judge\"],\"CodeForces-767C\":[\"Garland\",4420,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/767\\\"\\u003eCodeforces Round 398 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-767E\":[\"Change-free\",1059,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/767\\\"\\u003eCodeforces Round 398 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-767D\":[\"Cartons of milk\",2366,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/767\\\"\\u003eCodeforces Round 398 (Div. 2)\\u003c/a\\u003e\"],\"SPOJ-THREENUMBERS\":[\"nth number\",675,\"SELF\"],\"SPOJ-COT\":[\"Count on a tree\",3565,\"Just for fun...\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"Heart_Blue","updateTime":1540911728000,"title":"codeforces上的一个题单(原版改)","dislikeCnt":1,"content":"来源:http://codeforces.com/blog/entry/55274\n\n### aho\n[problem:SPOJ-ADAJOBS]\nURI 2226 [5] //[NICE][NUMBERS][DP]\n[problem:SPOJ-SUB_PROB]\n[problem:CodeForces-696D] 8\n[problem:SPOJ-AHOCUR] 5 //Aho-Corassic + DP\n[problem:CodeChef-LYRC] [5] //Sample aho-brute-force\n[problem:CodeForces-346B] //Proposed by bradyawn\n### automat\n[problem:UVALive-6861] //CYK\n[problem:UVA-10679] //Suffix Automat\n[problem:SPOJ-STRMATCH] //Suffix Automat trie might do too\n[problem:SPOJ-NSUBSTR2] //Suffix Automaton\n### belman-ford\n[problem:UVA-12519]\n[problem:SPOJ-ARBITRAG] [4] //Or Floyd-Warshall\n### bfs\n[problem:SPOJ-ADACYCLE] [FW]\n[problem:UVALive-6151] [4] //[NICE] //Search for shortest cycle\nhttps://devskill.com/CodingProblems/ViewProblem/60\nhttps://devskill.com/CodingProblems/ViewProblem/150\n[problem:UVA-11312] [3]\n[problem:UVA-11392] [4]\n[problem:CodeForces-653E] [6]\n[problem:CodeForces-769C] 5 //FL:ODD/\\\\\\\\ | bfs+greed NICE\n[problem:UVA-10968] [3] //EASY + NICE [bfs withot \\\u003c\u003d2 nodes]\n[problem:CodeForces-796D] [3] //NICE+EASY ... print visited in bfs [not par]\n[problem:UVA-10888] [4] //VERY NICE but not main technique ... ++ DP /or/ MCMF\n[problem:CodeForces-821D] [5] //VERY NICE Consider only points not GRID\n[problem:SPOJ-DIGOKEYS] [4] //Easy [Nice problem weird statement]\n[problem:SPOJ-SPIKES] [3] //Easy bfs [# of \u0027s\u0027 \\ 2]\n[problem:SPOJ-MULTII] [4] //VERY NICE: BFS over numbers [K\\10+d]%N\n[problem:SPOJ-ADV04F1] [5] //VERY NICE: [imple] ~ N^4\\BigConstant\n[problem:SPOJ-INVESORT] [5] //Big limit [really usefull :P]\n[problem:CodeForces-59E] [5] //[NICE][DOUBLE-STATES][SET]\n[problem:CodeForces-877D] [4] //[NICE] Add vector to # of states\n### bfs-grid\n[problem:UVA-10977] [3]\n[problem:UVA-928] [3]\n[problem:UVA-13116] [4]\n[problem:UVA-314] [3]\n[problem:UVA-11487] [4]\n[problem:UVALive-5622] LA [7]\n[problem:UVA-11931] [5]\n[problem:SPOJ-KNMOVE] 3 //simple knights\n[problem:SPOJ-SERGRID] 3 //almost classical\n[problem:SPOJ-NAKANJ] 3 //Classical chess KNIGHT\n[problem:SPOJ-PUCMM223] [4] //NICE [but not many languages] 2 moving [x][y]\n[problem:SPOJ-SPIRALGR] [4] //NICE [not typical] [SIEVE]\n[problem:SPOJ-DCEPC706] [4] //NICE travelling outside\n[problem:CodeForces-35C] [3] //No obstacles [multiple starts]\n### big\nhttps://devskill.com/CodingProblems/ViewProblem/394 [2] //Multiplication [or math]\n[problem:CodeForces-66A] [2] //Big + iffs + implementation\n[problem:UVA-10183]\n[problem:UVA-10106] [UVA]\n[problem:UVA-10523] Easy !!! [UVA]\n[problem:UVA-787] Sub-sequence Product [UVA]\n[problem:UVALive-2871] Rhyme Schemes UVALive[BELL]\n[problem:UVA-10497]\n[problem:SPOJ-MUL]\n[problem:SPOJ-ITRIX_E]\n[problem:UVA-11115] Jack\n[problem:UVA-11448] said crisis? [UVA]\n[problem:SPOJ-GCD2]\n[problem:UVA-10083] [UVA]\n[problem:UVA-11830] Revision [UVA]\n[problem:UVA-1230] [UVA]\n[problem:SPOJ-NUMPLAY]\n[problem:UVA-10519]\n[problem:UVALive-7651] Hyper-Pyramids UVALive\n[problem:UVA-11344] Huge One [UVA]\n[problem:UVA-10303] Many Trees? [UVA]\n[problem:SPOJ-FAST2]\n[problem:UVA-495] Freeze [UVA]\n[problem:UVA-10023] root [UVA]\n[problem:SPOJ-SKYLINE]\n[problem:SPOJ-NITT2]\n[problem:UVA-11879] of 17\n[problem:SPOJ-MINNUM]\n[problem:UVA-10494] We Were a Child Again [UVA]\n[problem:UVA-10013] long sums [UVA]\n[problem:UVA-10925] [UVA]\n[problem:UVA-10814] Fractions [UVA]\n[problem:UVA-619] Speaking [UVA]\n[problem:UVA-713] Reversed Numbers [UVA]\n[problem:UVA-1226] surprises [UVA]\n[problem:UVA-623] [UVA]\n[problem:CodeForces-18D]\n[problem:SPOJ-NUMTSN]\n[problem:CodeChef-FRJUMP]\n[problem:UVA-10220] Love Big Numbers ! [UVA]\n[problem:HackerRank-euler025]\n[problem:HackerRank-euler020]\n[problem:UVA-11645] 4\n[problem:Gym-100866A] [ACM ICPC 2005–2006 NEERC Moscow Subregional Contest]\n[problem:SPOJ-CSQUARE] \n[problem:SPOJ-PARCARD1]\n[problem:UVA-10070] Year or Not Leap Year and .. [UVA]\n[problem:SPOJ-SOLDIERS]\n[problem:UVA-12333] of Fibonacci [UVA]\n[problem:SPOJ-NDIVPHI]\n[problem:SPOJ-IWGBS] [UVA]\n[problem:SPOJ-POP3] [Prime-Test]\n[problem:SPOJ-VGCD]\n[problem:SPOJ-NDIVPHI2]\n[problem:UVA-12924] Rabbits [UVA]\n[problem:UVA-10007] Count the Trees [UVA][10007]\n[problem:UVA-10198] [UVA]\n[problem:UVA-11375] 3\n[problem:SPOJ-MINNUM] 3 // BIG/9+!![BIG%9]\n[problem:UVA-10844] 4 //Bell numbers + big [might be slightly slow!]\n[problem:SPOJ-NITT2] 2 //Divisibility by two constants\n[problem:SPOJ-NUMPLAY] [3] //With DP\n[problem:SPOJ-IWGBS] [3] //Fibonacci 10^4\n[problem:SPOJ-PUCMM025] [2] //Divisibility by 1 → 9\n[problem:SPOJ-CSQUARE] [3] //Converse + Power\n[problem:CodeForces-17D] [5] //B^[N-1]\\[B-1]%C [B/N are big]\n### binary_search\n[problem:CodeForces-920G] [5] //[NICE][MATH][IE]\n[problem:CodeForces-140C] [4] //[NICE][GREEDY]\n[problem:CodeForces-898E] [4] //[NICE][SIMPLE][PREPROCESS]\n[problem:CodeForces-888C] [3] //Can be done without BS\n[problem:CodeForces-68B] [3] //[EASY][DOUBLE]\n[problem:CodeForces-42A] [2] //Or simple math\n[problem:CodeForces-883I] [4] //[NICE][SET][2Pointers]\n[problem:CodeForces-51C] [4] //[NICE][GREEDY-CHECK]\n[problem:CodeForces-729C] 3\n[problem:CodeForces-714D] 8\n[problem:UVA-13150] 4\n[problem:CodeForces-749D] 5\n[problem:UVA-11692] 4\n[problem:UVA-11516] 3\n[problem:CodeForces-760B] 3\n[problem:CodeForces-675D] 4 //dunno solvable with treap\n[problem:SPOJ-NDS] 4 //BS over LIS\n[problem:SPOJ-VECTAR4] 3\n[problem:CodeForces-767D] 4 //NICE\n[problem:CodeForces-627D] [7] //with dp NICE\n[problem:CodeForces-779D] [3] //NICE + EASY\n[problem:SPOJ-CNTINDX] [4] //Map+BS \u003d\u003d\u003d OK\n[problem:UVA-13177] [3] //BS over answer \u003d\u003d OK\n[problem:CodeForces-801C] [3] //BS + SUM -EASY\n[problem:CodeForces-803D] [3] //BS by answer\n[problem:CodeForces-807C] [3] //Or math\n[problem:CodeForces-818F] [4] //NICE Live VS Clique\n[problem:CodeForces-845E] [5] //VERY NICE min[X,Y] .. add time, repeat\n[problem:SPOJ-MATHLOVE] [2] //BS + Gaus [or otter ways]\n[problem:SPOJ-SABBIRGAME] [3] //Binary search over answer ::max[0,ANS]\n[problem:CodeForces-846D] [4] //BS+Precalculation OR 2D-RMQ\n[problem:SPOJ-RPLC] [3] //Classical\n[problem:SPOJ-TRIGALGE] [2] //On doubles simple function given\n[problem:SPOJ-ABA12E] [4] //VERY NICE BS on answer + 2Pointers\n[problem:CodeForces-847E] [4] //NICE: Back+Front OR Front+Back\n[problem:SPOJ-MAIN8_C] [3] //Classical simultion over array\n[problem:SPOJ-FUNFACT] [4] //VERY NICE Sterling Approximation\n[problem:CodeForces-16C] [3] //[or math][simple formula check]\n[problem:CodeForces-21C] [3] //[NICE][prefix-sum+lower_bound]\n[problem:CodeForces-24E] [5] //[doubles]\n[problem:CodeForces-875E] [6] //VERY NICE [BS][Keep possible places]\n### bits\n[problem:CodeForces-879C] [3] //[NICE] one of each operation is enough\n[problem:CodeForces-92B] [2] //Bit addition/shifting [but big number]\n[problem:CodeForces-907C] [3] //Nice but ugly statement: sets\n[problem:UVA-11659] [4]\n[problem:UVA-11535] [4]\n[problem:CodeForces-779E] [5] //NICE + Parsing\n[problem:SPOJ-EC_CONB] [1] //reverse numbers\n[problem:CodeForces-769D] [4] //freq + brute-force\n[problem:SPOJ-HAP01] [2] //builtin_popcount\n[problem:CodeForces-862C] [3] //VERY NICE Random works well\n[problem:SPOJ-KOMPICI] [4] //NICE Bitmask over digits\n### bitset\n[problem:SPOJ-ADACOINS]\n[problem:SPOJ-ADACHERY]\n[problem:SPOJ-ADAFUROW]\n[problem:CodeForces-914F] [7] //[VERY NICE][POLYMUL-LIKE][BRUTE]\n[problem:CodeForces-117C] [5] //Finding 3cycles in directed graph [NICE]\n[problem:CodeForces-754E] 6\n[problem:SPOJ-UCBINTC] 5 //polymul with bitset\n[problem:CodeForces-33D] [4] //VERY NICE [LCA works too]\n[problem:CodeForces-918C] [4] //Brute-force+Bitset [or...]\n### bridges\n[problem:CodeForces-118E] [4] //[NICE] //Orientation [+DFS]\n[problem:UVA-315]\n[problem:UVA-796] Links\n[problem:UVA-12363]\n[problem:Gym-100114J] [2012-2013 ACM-ICPC, NEERC, Central Subregional Contest]\n[problem:SPOJ-ONBRIDGE] [ONLINE][HARD][NICE][D\u0026C]\n[problem:CodeForces-732F] 7\n[problem:CodeForces-700C] 7\n[problem:SPOJ-EC_P] [3] //bridges ONLY\n[problem:SPOJ-SUBMERGE] [3] //Direct articulation\n[problem:SPOJ-GRAFFDEF] [5] //Bridge tree\n[problem:CodeForces-1000E] // Sugested by Muhanad_Alwarareh\n### brute-force\n[problem:Gym-101806X] [6] //[VERY NICE][DFS][IFS][OBSERVATION]\n[problem:UVALive-8259] High Score LA //[VERY NICE][TS works too] add only low number to minimum [NOT WORKING?]\n[problem:CodeForces-922B] [2] //Test all pairs observe 3rd\n[problem:CodeForces-919B] [1] //Simply simulate\n[problem:CodeForces-146B] [2] //Test all bigger numbers\n[problem:CodeForces-911B] [1]\n[problem:UVALive-7692] Deal [4] //Permutations+Swap\n[problem:CodeForces-907A] [2] //try all triples 0→ 200\n[problem:CodeForces-124B] [3] //next-permutation\n[problem:CodeForces-910C] [3] //Next-permutation\n[problem:CodeForces-898B] [2] //Try all possibilities\n[problem:UVALive-6160] [5] //[NICE][DFS][EFFICIENT?]\n[problem:CodeForces-122C] [3] //Just around 2^10 lucky [RECURSION]\n[problem:UVALive-7899] Panda and Strips [4] //Weak test-cases\n[problem:UVALive-7671] a Beautiful Lake [2] //Try up/down from every node\n[problem:CodeForces-110A] [1] //4 or 7\n[problem:CodeForces-106B] [2] //Cycles \n[problem:CodeForces-895A] [2] //All segments [in circle]\n[problem:CodeForces-893B] [2] //Try each divisor\n[problem:CodeForces-894A] [1] //3-cycles\n[problem:CodeForces-892C] [3] //Try to find \"1\" ASAP\n[problem:CodeForces-102A] [2] //Iterate over all triples\n[problem:CodeForces-96B] [2] //Check all\n[problem:CodeForces-94B] [1] //3cycles\n[problem:CodeForces-887B] [3] //Test all numbers\n[problem:Gym-101597A] [4] //[MATH][MODULO][SIMULATION]\n[problem:CodeForces-68C] [5] //[VERY NICE][RECURSION][MAX COST MIN FLOW]\n[problem:CodeForces-68A] [1] //Simple simulation\n[problem:CodeForces-66B] [2] //Test always whole platform\n[problem:CodeForces-879C] [3] //[NICE] one of each operation is enough\n[problem:CodeForces-46C] [2] //[2pointers][N^2 works too]\n[problem:CodeForces-47D] [4] //[Implementation][DFS]\n[problem:CodeForces-51D] [4] //Check all/check without 1s/2nd\nhttp://code-festival-2017-qualc.contest.atcoder.jp/tasks/code_festival_2017_qualc_b [2]\n[problem:CodeForces-53B] [3] //at most 60 possibilities\n[problem:CodeForces-55B] [3] //Try all permutations \u0026 possibilities [NICE]\n[problem:CodeForces-877B] [3] //NICE [N^2][PrefixSum]\n[problem:UVALive-6623] Battle for Silver [3] //4 for-cycles inside ~ K4 search\n[problem:UVA-12169] [2]\n[problem:CodeForces-725C] 4\n[problem:CodeForces-725E] 6\n[problem:CodeForces-724B] 3\n[problem:UVA-11961] [2]\n[problem:UVA-11898] [4]\n[problem:UVA-11659] [4]\n[problem:CodeForces-753C] 7\n[problem:UVA-11699] [4]\n[problem:UVA-11548] [3]\n[problem:UVA-11471] [5] //With dynamic programming\n[problem:CodeForces-698D] 8 //with geometry\n[problem:Gym-101840F] //[NICE][BS][DISTANCE]\n[problem:UVA-11206] [6] //4^20 [but somehow passes]\n[problem:UVA-11214] [6] //úvaha + pruning\n[problem:UVA-11127] [4] //Simple dfs [just realize you can do so]\n[problem:SPOJ-BOKAM143SOU] [3] //just implement for-cycles\n[problem:SPOJ-BLOPER] [4] dfs with little pruning\n[problem:UVA-13173] [3] //just brute-force + branching\n[problem:CodeForces-799D] [4] //VERY NICE [only top 34 needed] trick with 2 [~20]\n[problem:UVA-10890] [4] //Simple brute-force times out, but with simple pruning AC [answer detection\n[problem:CodeForces-813B] [3] //All\\All [BF] care for overflow! NICE \u0026 EASY\n[problem:CodeForces-817C] [3] //Check S+Constant [NICE!]\n[problem:UVA-10732] [2] //Brute-force passes .. just don\u0027t trust them O[N^2]\n[problem:UVA-10748] [5] //VERY Nice [knights have K^2 moves not 8^K]\n[problem:CodeForces-818D] [4] //NICE for each \u0027A\u0027 check all remaining [max SQRT]\n[problem:CodeForces-834E] [5] //NICE hard to imple: all 11122...999 OK\n[problem:SPOJ-JHAGIRLS] [4] //Efficient or store output in array\n[problem:CodeForces-846B] [3] //Brute-force\n[problem:SPOJ-ALONE] [4] //Generate everything \\\u003c10^15 [NICE]\n[problem:CodeForces-861B] [3] //Check all floor-sizes\n[problem:SPOJ-RRANGE] [3] //Compare all queries agains all updates + GAUSS\n[problem:CodeForces-598B] [3] //Treap works too ;-]\n[problem:SPOJ-AMR10I] [4] //Can be solved with brute-force with dp\n[problem:CodeForces-868C] [4] //Brute-force [fixet at most 6 each bits]\n[problem:CodeForces-868D] [5] //NICE: Maximal K is low [I assumed 15]\n[problem:CodeForces-31C] [2] //LOW-Constaints: N^2\n[problem:CodeForces-32D] [3] //Simply try all possibilities\n[problem:CodeForces-876C] [3] //Try N and ~100 lower\n[problem:CodeForces-44B] [2] //N^2 works fine\n### centroid\n[problem:Gym-101840E] //NICE\nDCP-176: Motku2 [DevSkills]\n[problem:CodeForces-715C] 9\n[problem:CodeForces-741D] 8\n[problem:UVA-13164] [7]\n[problem:CodeForces-752F] 5\n[problem:CodeForces-766E] 6\n[problem:CodeForces-833D] 7 //Very nice hard [thinking + imple] + FW\n[problem:SPOJ-HOLI] [4] //VERY NICE: 2\\Distances from centroids\n### coloring\n[problem:CodeForces-741C] 6\n[problem:UVA-11331] [4]\n[problem:CodeForces-664D] 4\n### combinatorics\n[problem:SPOJ-ADATEAMS]\n[problem:SPOJ-ADASUM]\n[problem:Gym-101808F] [3] //[EASY]][FACTORIAL]\n[problem:CodeForces-364A] [4] //[NICE][STL-or-sorting][IF]\n[problem:CodeForces-145D] [7] //[VERY NICE][SET][OBSERVATION][BS][BIG]\n[problem:CodeForces-909B] [3]\n[problem:CodeForces-131C] [3] //[EASY][BRUTE-FORCE][COMB-NUMBERS]\n[problem:CodeForces-131B] [2] //[EASY]\n[problem:CodeForces-129E] [5] //[NICE][COMB-NUMBERS] //Observe\n[problem:CodeForces-111D] [5] //[COMB-NUMBERS][POWER][VERY NICE][DP]\n[problem:CodeForces-895D] [4] //[COMB-NUMBERS][OPTI]\n[problem:CodeForces-893E] [5] //[COMB-NUMBERS][NUMBER-THEORY]\n[problem:CodeForces-894B] [3] //try without last row\n[problem:CodeForces-890E] [6] //Permutations\n[problem:CodeForces-52B] [4] //[NICE][PREPROCESS][ROTATION]\n[problem:UVALive-3917] tiling [fancy approximation fomula]\n[problem:CodeForces-760F]\nhttps://devskill.com/CodingProblems/ViewProblem/61\nhttps://devskill.com/CodingProblems/ViewProblem/255\n[problem:UVA-10918]\n[problem:UVA-12576]\n[problem:UVA-1118] //Parity\n[problem:SPOJ-HLP_RAMS] //Comb parity\nProject Euler #78: Coin partitions //Partition function\n[problem:SPOJ-MAIN75] //DP #of trees\n[problem:UVA-12001] [3]\n[problem:UVA-12034] [4]\n[problem:UVA-11719] [5]\n[problem:UVA-11798] [5]\n[problem:UVA-11282] [4] //dearrangement\n[problem:UVA-11174] [4]\n[problem:CodeForces-666C] 7\n[problem:SPOJ-JOKER1] 3 prod[Ai-i]\n[problem:SPOJ-ANTP] //4\n[problem:CodeForces-645E] [5] //formula: A[i]\u003dSum[A]+1\n[problem:SPOJ-SPCE] [5] // N^{K-2}\\Prod[comp_size]\n[problem:CodeForces-785D] [5] // F\u0027[\u0027 C\"[+]-1\",\"[\"\n[problem:UVA-13184] [3]\n[problem:CodeForces-816D] [5] // Observation\n[problem:UVA-13214] //OEIS? : C[N+M-2,N-1]\n[problem:CodeForces-844B] [2] //Easy pro prvaky\n[problem:SPOJ-JOSWAP] [3] //Frequence array\n[problem:SPOJ-UCV2013E] [4] //NICE\u0026EASY: Choose steps to direction\n[problem:SPOJ-PARCARD1] [4] //Partition function [raw]\n[problem:SPOJ-GOODB] [2] //Easy [NICE]: Choose [order]\n[problem:SPOJ-LOOPEXP] [4] //A000254/N!\n[problem:SPOJ-DTPOLY] [5] //DP might work too\n[problem:SPOJ-DTPOLY2] [7] //Harder version of above [NICE but hell]\n[problem:SPOJ-HC12] [3] //NICE Sort + C[i,K-1]\\A[i]\n[problem:SPOJ-STONE2] [4] //NICE Mostly DP [INVERSION][FACTORIAL]\n[problem:SPOJ-MAIN8_D] [5] //NICE Suffixes/Prefixes [same add 2^i]\n[problem:SPOJ-ITRIX_E] [4] //VERY NICE #Nonattacking 2-queens\n[problem:SPOJ-MAXSUB] [3] //NICE Subsets made of zeroes\n[problem:SPOJ-SKYLINE] [3] //Catalan numbers [weird modulo care]\n[problem:CodeForces-26D] [5] //Division of two combintion numbers [NI:/]\n[problem:CodeForces-872E] [6] // Prod:Sum[C[DistLines,CompSize]]\n### constructive\n[problem:CodeForces-922F] [6] //[NICE][MATH][GREEDY]\n[problem:CodeForces-916C] [3] //Graph construction\n[problem:CodeForces-148B] [3] //[SIMULATION][math or bs]\n[problem:CodeForces-909F] [6] //[VERY NICE][BITS]\n[problem:CodeForces-141C] [4] //[NICE][BRUTE-FORCE]\n[problem:CodeForces-907D] [5] //[VERY NICE][RANDOM]\n[problem:CodeForces-124C] [3] //[NICE][SIEVE]\n[problem:CodeForces-125C] [4] //[NICE][C[N,2]]\n[problem:CodeForces-902C] [4] //[NICE] //Tree isomorphism\n[problem:CodeForces-112C] [3] //[GREEDY] //Max + 1s\n[problem:CodeForces-110B] [2] //Easy modulo\n[problem:CodeForces-894C] [3] //[VERY NICE] //AiAiGCD\n[problem:CodeForces-97B] [4] //NICE Walls in middles [D\u0026C]\n[problem:CodeForces-85A] [3] //MODULO / SHIFT\n[problem:CodeForces-81D] [3] //NICE MAX[N/2] even/odd\n[problem:CodeForces-63D] [3] //NICE[GO BY LINES][4 WAYS B/D ODD/EVEN]\n[problem:CodeForces-42C] [4] //Constructive works too but random is fine :]\n[problem:CodeForces-43D] [3] //NICE Easy to see [implementation]\n[problem:CodeForces-53C] [2] //EASY [B/E Alternate]\n[problem:CodeForces-877C] [3] //NICE 3\\Alternative\n[problem:CodeForces-802H] [6] //We can do \"N+k\" by adding a letter p+k\\x+u+xx\n[problem:CodeForces-12E] [5] //g[i][j]\u003d1+[i+j]%[N-1] [+/-]\n[problem:CodeForces-22C] [4] //Start and then clique without v [+ random]\n[problem:CodeForces-26C] [5] //make Even\\Even: do by 2\\2 fields\n[problem:CodeForces-41E] [4] //[NICE][CN/2,N/2]\n[problem:CodeForces-78B] [2] //NICE last 3 and then rest in modulo\n[problem:CodeForces-109D] [5] //[NICE][BACK-POINTERS][SIMULATION][SORT]\n### dfs\n[problem:SPOJ-ADASEA]\nhttps://www.urionlinejudge.com.br/judge/en/problems/view/2732 [3] //Easy flood\n[problem:CodeForces-920E] [5] //[NICE][DFS][SET] //Or clever random\n[problem:CodeForces-915D] [4] //[VERY NICE][CYCLES DETECTION [ORIENTED]]\n[problem:SPOJ-CTTC] [3] //[EASY][GRAPH-RECONSTRUCTION]\n[problem:UVALive-7951] [3] //[NICE]Flood-Fill\n[problem:CodeForces-901D] [7] //Observations / Tree reduction\n[problem:CodeForces-902B] [3] //No dfs needed\n[problem:Gym-101630C] [4] //[NICE][SCC]\n[problem:Gym-101620J] [4] //DFS + multiples of divisors\n[problem:CodeForces-120F] [3] //Width of tree\n[problem:UVALive-7606] [3] //Dfs on grid [EASY]\n[problem:CodeForces-116C] [2] //[DEPTH]\n[problem:UVALive-8080] Tree [3] //[SIMPLE][NICE]\n[problem:UVALive-6584] [8] //[VERY VERY VERY NICE][COMPRESSION][MERGING] //Hard but I recommend this one!!\n[problem:UVALive-6590] [4] //[VERY NICE][CYCLES][DP][IDEA]\n[problem:CodeForces-893C] [3] //Minimum from each connected component\n[problem:CodeForces-884C] [3] //[EASY][PERMUTATIONS][SORTING]\n[problem:CodeForces-883G] [4] //Greedy picking\n[problem:CodeForces-60B] [3] //3D Flood-Fill [NICE][EASY]\n[problem:CodeForces-60C] [4] //[VERY NICE][BF] //Not many real possibilities\nhttps://devskill.com/CodingProblems/ViewProblem/3\nhttps://devskill.com/CodingProblems/ViewProblem/17\nhttps://devskill.com/CodingProblems/ViewProblem/118 //Kind-of\n[problem:UVA-657] die is cast [UVA]\n[problem:UVA-12186] [3]\n[problem:CodeForces-734E] [5]\n[problem:CodeForces-727A] [3]\n[problem:CodeForces-723E] [6]\n[problem:CodeForces-709E] [6]\n[problem:CodeForces-710E] [4]\n[problem:CodeForces-758E] [8]\n[problem:UVA-11323] [5]\n[problem:CodeForces-760B] [3]\n[problem:CodeForces-761E] [6]\n[problem:CodeForces-638B] [3] //connect cons. letters\n[problem:CodeForces-638C] [4] //greedy idea easy\n[problem:CodeForces-638D] [5] //spec-DAG articulatin\n[problem:CodeForces-767C] [4]\n[problem:CodeForces-781C] [5]\n[problem:CodeForces-794D] [5] //NICE! Right done dfs\n[problem:CodeForces-802K] [5] //Slightly DP-like [NICE] TREE\n[problem:CodeForces-813C] [3] //Simply 2 DFS: NICE + EASY\n[problem:CodeForces-841D] [4] //DFS while tracking \"next\"\n[problem:CodeForces-845G] [5] //Keep track of cycles\n[problem:CodeForces-844E] [5] //Post-Order → line, Connect i → N-2: star\n[problem:SPOJ-CAC] [5] //VERY NICE! Find all cycles in cactus\n[problem:CodeForces-849C] [3] //State search by gauss\n[problem:CodeForces-846E] [5] //NICE: DFS + some overflow logic\n[problem:SPOJ-KOZE] [3] //NICE: Floods\n[problem:SPOJ-RIOI_2_3] [4] //DFS /OR/ BFS /OR/ DSU [NICE][EASY][BF]\n[problem:SPOJ-MAKEMAZE] [3] //EASY Simple dfs on grid\n[problem:CodeForces-861F] [5] //VERY NICE: Modify dfs tree so it remains connected\n[problem:SPOJ-GHOSTS] [3] //NICE must remain dag after each QR\n[problem:SPOJ-AMR10J] [5] //VERY NICE! DFS+DP [DAG with cycles]\n[problem:CodeForces-24A] [2]//NICE [DFS-ON-CYCLE]\n[problem:CodeForces-29C] [3] //Find begining/end of line [graph]\n[problem:CodeForces-29D] [4] //Tree [implementation][simulation]\n### digits\n[problem:SPOJ-PR003004] [4] //Simple digits count\n[problem:CodeForces-770B] [3] //max num max digsum\n### dijkstra\n[problem:SPOJ-ADATRIP]\n[problem:Gym-101666D] //[NICE]\n[problem:CodeForces-144D] [4] //[VERY NICE][IFS]\n[problem:SPOJ-ADRABR] [3] //Classical dijkstra bad statement\n[problem:CodeForces-141D] [5] //[NICE]Many Conditions\n[problem:UVALive-6583] [5] //[NICE] //Not exactly dijkstra by slightly similar [IMPLEMENTATION]\n[problem:UVALive-3850]\n[problem:Gym-100625D] [2013 Benelux Algorithm Programming Contest [BAPC 13]]\n[problem:UVA-12950]\n[problem:Gym-100753A] [2015 German Collegiate Programming Contest [GCPC 15] + POI 10-T3]\n[problem:UVA-13030]\n[problem:UVA-1027]\n[problem:UVA-11377]\n[problem:CodeForces-843D]\n[problem:UVA-11813]\n[problem:Gym-101242B] [2016 ACM-ICPC World Finals] //+DP\n[problem:Gym-100923B] [2015 ACM National Contest Romania Round 1]\n[problem:UVA-11833]\n[problem:SPOJ-EZDIJKST]\n[problem:LightOJ-1019]\n[problem:UVA-13010] //+TS\n[problem:UVALive-2819]\n[problem:UVA-12144]\n[problem:CodeForces-716D] 7\n[problem:UVA-12047] 4\n[problem:UVA-11514] 4\n[problem:CodeForces-757F] 7\n[problem:UVA-11338] [4]\n[problem:UVA-11374] [4]\n[problem:UVA-11097] [4] //Divide to N\\1000 nodes and go!\n[problem:UVA-13172] [5] //6\\DJ per query + permutations\n[problem:UVA-10816] [4] //Easy Linear-Search by answer + DJ with path\n[problem:CodeForces-827F] 7 //Very nice Even\u0026Odd\n[problem:SPOJ-DELIVER] [5] //Normalize coordinates + Optimalize\n[problem:SPOJ-CCHESS] [4] //Dijkstra as knight\n### divide_conquer\n[problem:UVALive-8257] Factor-Free Tree //[VERY VERY NICE][PRIMES][FACTOR]\nhttps://www.urionlinejudge.com.br/judge/en/problems/view/1683 [4] //RAW histogram\n[problem:CodeForces-817D] [5] //Very nice NlogN\n[problem:SPOJ-DYNACON2] [8] //Lesser hell offline Nlog[N] /or/ NlogN^2\n[problem:CodeForces-876F] [5] //VERY NICE Find greatest + next/back functions\n### divisors\n[problem:Gym-101840D] //[EVENTS][NICE]\n[problem:Gym-101741F] [6] //[NICE][PROBABILITY][GCD]\n[problem:SPOJ-FRNDAM] [3] //Simply find sum of all divisors [low constraints]\n[problem:CodeForces-920F] [5] //[NICE][FAST FALL][SET][DIVISORS]\n[problem:UVALive-7726] Simple Math Problem [4] //TLE if naive [consider only divisors]\n[problem:CodeForces-112D] [4] //[NICE] Last-position [FACTOR]\n[problem:CodeForces-75C] [3] //[NICE][BS]\n[problem:LightOJ-1068]\n[problem:LightOJ-1134]\nProject Euler #95: Amicable chains\nNAJ0001 Divisible Number Sum [SPOJ]\n[problem:SPOJ-LCMSUM]\n[problem:HackerRank-easy-gcd-1]\n[problem:UVA-13085]\n[problem:SPOJ-CDRSANJ]\n[problem:SPOJ-DIVSEQ]\n[problem:UVA-12154]\n[problem:UVA-13058]\n[problem:SPOJ-EC_DIVS]\n[problem:CodeChef-CHEFKEY]\n[problem:CodeForces-671C]\n[problem:Gym-101411G] [2009-2010 ACM-ICPC, NEERC, Western Subregional Contest]\n[problem:CodeForces-831F]\n[problem:CodeForces-839D]\n[problem:UVA-12934] Division [UVA]\n[problem:UVA-10880]\n[problem:SPOJ-PSTR]\n[problem:CodeForces-27E]\n[problem:UVALive-3014]\n[problem:UVA-12843]\nhttps://www.urionlinejudge.com.br/judge/en/problems/view/1164\n[problem:CodeForces-803F]\n[problem:UVA-10892] Cardinality\n[problem:SPOJ-GCDEX]\n[problem:SPOJ-INVDIV]\n[problem:UVA-13083] another GCDSUM //ll\n[problem:SPOJ-IITKWPCF] //ll\n[problem:UVA-13185]\n[problem:UVA-13194]\n[problem:UVA-11388]\n[problem:SPOJ-SAS002]\n[problem:UVA-12425] Friend\n[problem:CodeForces-703E]\nhttps://www.hackerearth.com/problem/algorithm/harry-gets-into-infy/\n[problem:UVA-10830] //SUM\n[problem:SPOJ-DIVSUM] //SUM\n[problem:SPOJ-AFS] //SUM\n[problem:UVA-11526] //SUM\n### dp\n[problem:SPOJ-ADAZOO]\n[problem:SPOJ-ADASEQEN]\n[problem:SPOJ-ADAMOLD]\n[problem:SPOJ-ADASALE]\n[problem:Gym-101889E]\n \n[problem:Gym-101808D] [7] //[NICE][OPTIMISATION][EFFICIENCY]\n \n[problem:Gym-101666I]\n \n[problem:Gym-101840A] //Doubles\nDevSkills 475: Bunty\u0027s Xor Game [4] //[BITS][GAME THEORY]\nhttps://www.devskill.com/CodingProblems/ViewProblem/489 [5] //[NICE][FACTORISATION]\nDevSkills 534 [4] //[BITSET][COMBINATIONS]\n[problem:Gym-101650D] //Not hard more coding + printing\n[problem:UVA-13286] [4] //[NICE][DAG] Classical\n[problem:UVALive-8299] [5] //[NICE][COMBINATORICS][SORTING]\n[problem:CodeForces-934] [4] //Subsequence\n[problem:CodeForces-922E] [5] //find max mana\n[problem:CodeForces-920D] [4] //[NICE][KNAPSACK-MODULO][GREEDY]\n[problem:CodeForces-919D] [4] //[NICE][DFS][CYCLE][DAG]\n[problem:CodeForces-914C] [3] //[DIGITS][BINARY]\n[problem:CodeForces-913E] [5] //[NICE][EXPRESSION]\n[problem:CodeForces-148E] [5] //[DP][PREFIX SUM][GREED]\n[problem:SPOJ-PALMKR] [4] //Classical palindrome + print + lexicography\n[problem:CodeForces-146E] [5] //[NICE][COMBINATORICS][OBSERVATION]\n[problem:CodeForces-909C] [4] //[NICE][CLASSICAL][EASY]\n[problem:UVALive-7785] Partitions [4] //Combinatorics\n[problem:CodeForces-133E] [4] //[IMPLEMENTATION]\n[problem:CodeForces-126D] [5] //[NICE] //Decomposet DP//Own hash-map\n[problem:CodeForces-910B] [3] //Or many other ways\n[problem:UVALive-6154] Secondary Structure [5] //[NICE] Unoptimal might work too\nhttps://arc087.contest.atcoder.jp/tasks/arc087_b [4] //[VERY NICE][OBSERVATION]\n[problem:CodeForces-903F] [5] //[VERY NICE][BITMASK][BRUTE]\n[problem:CodeForces-903A] [2] //Easy knapsack-like // Low constraints\n[problem:CodeForces-900E] [4] //[NICE] //Patter-match: FFT or KMP or Brute-Force\n[problem:CodeForces-118D] [3] //[COMBINATORICS][LOW-CONSTRAINTS]\n[problem:CodeForces-115E] [5] //[VERY NICE][SEGMENT TREE]\n[problem:CodeForces-116D] [3] //CLASSICAL[LOW-CONSTRAINTS]\n[problem:UVA-10128] [uva] [4] //One possibility is bitmask second combinatorics\n[problem:CodeForces-110C] [3] //[EASY] // Greedy/math works too\n[problem:UVALive-8078] Sequence [4] //[VERY NICE][DP-LINKS]\n[problem:CodeForces-106C] [3] //[NICE][EASY]\n[problem:CodeForces-895C] [4] //[NICE]\n[problem:UVALive-8024] Construction [4] //[NICE] Palindromic style but not exactly\n[problem:UVALive-7708] [6] //[MATH]\n[problem:CodeForces-888F] [6] //[NICE][FLAG]\n[problem:SPOJ-ACQUIRE] [5] //[NICE][CH-OPT]\n[problem:CodeForces-319C] [6] //[NICE][CH-OPT]\n[problem:SPOJ-NKLEAVES] [5] //[NICE][DC]\n[problem:CodeForces-76D] [4] //[BITS][OVERFLOW]\n[problem:CodeForces-73C] [4] //[NICE][EASY][TRY-ALL-LETTERS]\n[problem:CodeForces-67C] [4] //[NICE][LEAVENSTEIN]\n[problem:CodeForces-67A] [3] //[EASY][PRINTING][OTHER POSSIBLE WAYS]\n[problem:CodeForces-55D] [5] //[NICE][DIGITS][EFFICIENT]\n[problem:CodeForces-56D] [4] //String modification + printing [NICE]\n[problem:CodeForces-58E] [6] //[NICE][IMPLEMENTATION]\n[problem:UVA-12181]\nhttps://devskill.com/CodingProblems/ViewProblem/21\nhttps://devskill.com/CodingProblems/ViewProblem/37\nhttps://devskill.com/CodingProblems/ViewProblem/71\nhttps://devskill.com/CodingProblems/ViewProblem/103\nhttps://devskill.com/CodingProblems/ViewProblem/107\nhttps://devskill.com/CodingProblems/ViewProblem/115\nhttps://devskill.com/CodingProblems/ViewProblem/126\nhttps://devskill.com/CodingProblems/ViewProblem/131\nhttps://devskill.com/CodingProblems/ViewProblem/134\nhttps://devskill.com/CodingProblems/ViewProblem/174\nhttps://devskill.com/CodingProblems/ViewProblem/186\nhttps://devskill.com/CodingProblems/ViewProblem/201\nhttps://devskill.com/CodingProblems/ViewProblem/338\nhttps://devskill.com/CodingProblems/ViewProblem/368\nhttps://devskill.com/CodingProblems/ViewProblem/392\nhttps://devskill.com/CodingProblems/ViewProblem/399\n[problem:HackerRank-mining]\n[problem:UVA-12915] //Opti\n[problem:UVA-12524] //Opti\n[problem:CodeForces-631E] //CH\nhttps://devskill.com/CodingProblems/ViewProblem/6\nhttps://devskill.com/CodingProblems/ViewProblem/11\n[problem:UVA-11552] [3]\n[problem:UVA-12172] [3]\n[problem:UVALive-4507] [5]\n[problem:UVALive-4510] [5] [+ geometry]\n[problem:UVA-12181] [6]\n[problem:CodeForces-729F] 6\n[problem:CodeForces-735E] 9\n[problem:CodeForces-731E] 5\n[problem:UVA-12030] [4]\n[problem:CodeForces-721E] 7\n[problem:CodeForces-742D] 4\n[problem:UVA-12040] [5]\n[problem:CodeForces-712D] 5\n[problem:UVA-13162] [6]\n[problem:CodeForces-743E] 6\n[problem:UVA-11908] [3]\n[problem:UVA-11932] [4]\n[problem:CodeForces-745E] [7]\n[problem:UVA-11806] [4]\n[problem:CodeForces-747F] [5]\n[problem:UVA-11843] [4]\n[problem:CodeForces-752E] [5]\n[problem:CodeForces-703E] [7]\n[problem:UVA-11753] [4]\n[problem:UVA-11725] [5]\n[problem:CodeForces-722E] [9]\n[problem:CodeForces-760F] [8]\n[problem:UVA-11795] [3]\n[problem:UVA-11654] [4]\n[problem:UVA-11523] [5]\n[problem:UVA-11404] [4]\n[problem:UVA-11432] [4]\n[problem:UVA-11451] [4] //C\u003d\u003d20 mistake in statement\n[problem:UVA-11301] [4]\n[problem:CodeForces-762D] 5\n[problem:UVA-11361] [4] //digit DP\n[problem:UVA-11365] [7]\n[problem:UVA-11391] [4] //easy+implementation\n[problem:UVA-11394] [3]\n[problem:UVA-11218] [2]\n[problem:UVA-11125] [4] //slightly implementation\n[problem:UVA-11076] [3]\n[problem:UVA-11081] [4] //3 string subsequences [beware of fail]\n[problem:CodeForces-678E] [5] //bitset dp + probability\n[problem:CodeForces-766C] [4]\n[problem:CodeForces-667C] [3]\n[problem:SPOJ-MOVIFAN] [3]\n[problem:SPOJ-ORDSUM23] [3]\n[problem:SPOJ-DIVSEQ] [4] //N^3 [but better...] works fine\n[problem:CodeForces-633F] [7] //Tree dp\n[problem:SPOJ-ADJDUCKS] [4] sort + pick 2-3 continous O[N]\n[problem:SPOJ-JLNT] [4] //pick 0 or 2 | 1e3\\5e3\n[problem:SPOJ-TPCPALIN] [5] //500^3 works [3rd countable]\n[problem:SPOJ-COLORSEG] [4] //50^4\u003d\u003dOK 50^4log[N]\u003dTLE NICE\n[problem:SPOJ-POWERCAR] [3] //1e3\\1e3\\2 follow rules\n[problem:SPOJ-INGRED] [5] //TSP-like [reduce + go]\n[problem:SPOJ-BADXOR] [4] //classical subsets\n[problem:SPOJ-SPCO] [5] //64\\64\\2 DP {OPT: prime O[1] + clear only half}\n[problem:SPOJ-WAYHOME] [5] //NICE: 1] 1\\1 b]12,1,\\\\,2\n[problem:SPOJ-NFURY] [2] //Minimal sum of squares\n[problem:SPOJ-GDIL] [3] //combinatorics\n[problem:CodeForces-791D] [5] //Tree\n[problem:CodeForces-791E] [6] //V,K,X pick any\n[problem:CodeForces-789C] [3]\n[problem:UVA-13176] //N^6\n[problem:UVA-13179] //NICE [Ath][Bth][TimeDiff]\n[problem:CodeForces-796E] [6] //NICE: N\\P\\K\\K [WC can\u0027t happen!]\n[problem:CodeForces-797E] [4] //NICE: Almost BF-able [but care of low K]\n[problem:CodeForces-793D] [3] //NICE \u0026 EASY: begin/end/actual/USED\n[problem:CodeForces-803E] [4] //State search many IF\u0027s [EASY]\n[problem:CodeForces-805F] [7] //NICE: DP on tree + fast BF + hack\n[problem:CodeForces-808E] [5] //NICE!\n[problem:CodeForces-811C] [4] //Precalculate + DP [greedy thinking]\n[problem:UVA-10817] 4 //Easy but slightly implementation\n[problem:UVA-10859] 4 //Nice on tree .. but for a reason small constrains\n[problem:UVA-10898] 4 //Hash is lesser than 1e6 .. try everything\n[problem:CodeForces-812B] [3] //Not only DP, yet imho easiest ..many spec cases\n[problem:CodeForces-813D] [5] //VERY VERY NICE N\\N [none picked between a/b]\n[problem:CodeForces-814E] 5 //VERY NICE Harder imple: Combinatorics\n[problem:CodeForces-816E] [6] //NICE Tree [hard 2C complexity]\n[problem:CodeForces-837D] [5] //NICE yet kinda pain [must be iterative]\n[problem:SPOJ-AUT] [4] //NICE K is interesting ~ at most 1600\n[problem:SPOJ-GNYR04C] [3] //Easy Nice idea [Big→ Low approach]\n[problem:SPOJ-TIEROPE] [4] //Process 2\\L ~ otherwise pick BIG\n[problem:SPOJ-IITKWPCE] [4] //Palindromes [efficiency!] NICE!\n[problem:SPOJ-IITKWPCD] [4] //+Slightly geometry\n[problem:UVA-1496] //[Steiner\u0027s Tree] Very Nice [8]\n[problem:SPOJ-LKS] [3] //Classical knapsack\n[problem:SPOJ-UOFTAE] [3] //Easy \u0026 Sympatic DP\n[problem:SPOJ-DCOWS] [4] //Very NICE [sort + GO]\n[problem:SPOJ-FARIDA] [3] //Easy \u0026 Sympatic [[u+1] | Price+[u+2]]\n[problem:SPOJ-AU7_5] [2] //EASY: dyn[n-1]+dyn[n-k-1]\n[problem:SPOJ-NAIVELOK] [4] //NICE [depalindromisation]\n[problem:CodeForces-846C] [4] //With print\n[problem:SPOJ-CNT_LUCK] [4] //Number [binary] dp [NICE] {ull care 0-1}\n[problem:SPOJ-MAY99_4] [3] //Almost combinatoric Sub and 0/1,1/0\n[problem:SPOJ-GEEKOUNT] [4] //Number dp\n[problem:SPOJ-MUTDNA] [4] // N\\2 [turned?] [not sure if grd poss.]\n[problem:SPOJ-RIOI_3_2] [5] //VERY NICE [easy imple Number Theory thinking]\n[problem:SPOJ-MAXWOODS] [3] //NICE [EASY][GRID]\n[problem:SPOJ-DIEHARD] [3] //Easy prolly solvable by greedy [but dp is easier]\n[problem:SPOJ-DCEPC810] [4] //VERY VERY NICE Subsequence 2pointers+2bools\n[problem:SPOJ-EQ2] [4] //NICE: Digit + Carry [from back] iff-party\n[problem:SPOJ-DCEPC501] [3] //NICE \u0026 EASY\n[problem:SPOJ-NUMTSN] [4] //NICE Thinking or Opti\n[problem:SPOJ-GONE] [4] //NICE \u0026 EASY [digits]\n[problem:SPOJ-RAONE] [4] //NICE \u0026 EASY [digits] almost similar as above\n[problem:SPOJ-STRSEQ] [4] //VERY VERY NICE Next-Function\n[problem:SPOJ-MYQ8] [4] //VERY NICE 3x3 tic-tac-toe [implementation]\n[problem:CodeForces-859C] [3] //Easy+Sympathic [PrefixSumOptional]\n[problem:CodeForces-859D] [4] //NICE [Probabilities]\n[problem:SPOJ-UNICA] [4] //VERY NICE [Posibilities][Print][Classical]\n[problem:SPOJ-KOPC12H] [4] //NICE Digit-DP\n[problem:SPOJ-DRACULA] [4] //NICE Digit-DP [Both sides] iterate by sum\n[problem:SPOJ-ABCPATH] [3] //DP over dfs [maybe without dp works too?]\n[problem:SPOJ-BEHAPPY] [2] //Easy one low constraints\n[problem:SPOJ-STRCOUNT] [4] //No input [over bits]\n[problem:CodeForces-855B] [2] //prolly not even necessary\n[problem:CodeForces-855C] [4] //dp on tree\n[problem:CodeForces-855E] [5] //VERY NICE Digits \u0026 Bitmask \u0026 Query [learning!]\n[problem:SPOJ-PAINTWAL] [6] //VERY NICE Imho hard [opti could beat]\n[problem:SPOJ-ADFRUITS] [3] //Very simple [substring \u003d\u003d subsequence]\n[problem:SPOJ-MAIN113] [2] //NICE but somehow too low constraints\n[problem:SPOJ-MAIN112] [4] //NICE Bitmask\n[problem:CodeForces-864E] [5] //VERY NICE Sort\n[problem:SPOJ-NOVICE63] [4] //NICE -On digits [binary]\n[problem:SPOJ-TUG] [3] //NICE + Observation {N\u003e100 \u003d\u003d YES}\n[problem:SPOJ-DOMINO1] [4] //Used map to solve it\n[problem:SPOJ-NY10E] [2] //Easy dp\n[problem:SPOJ-MAIN72] [3] //Easy knapsack\n[problem:SPOJ-NOVICE43] [2] //Unbelievably low constraints\n[problem:CodeForces-598E] [4] //N^5 strategy works fine [VERY NICE]\n[problem:SPOJ-CHAIR] [3] //Maybe combinatorics too?\n[problem:SPOJ-ACPC10D] [3] //NICE DAG traversal\n[problem:SPOJ-CPCRC1C] [4] //Digits dp [return pair]\n[problem:SPOJ-BORW] [3] //Inc+Dec sequence [small array]\n[problem:CodeForces-16E] [5] //Bitmask [NICE]\n[problem:CodeForces-18E] [5] //VERY NICE {no need for second iteration}\n[problem:CodeForces-2B] [5] //NICE 2/5 are in-fact independent\n[problem:CodeForces-4D] [3] //Classical [FW works too] XY \u003e xy\n[problem:CodeForces-6D] [4] //NICE [N^4]\n[problem:CodeForces-321E] [7] //VERY NICE D\u0026C Trick\n[problem:CodeForces-868F] [8] //VERY VERY NICE D\u0026C Trick With MO Principal\n[problem:CodeForces-8C] [5] //NICE Masks [N\\2^N]\n[problem:CodeForces-868E] [8] //VERY NICE HARD on tree\n[problem:CodeForces-10D] [4] //LCIS [NICE]\n[problem:CodeForces-13C] [5] //NICE [sorting][only elements from array]\n[problem:CodeForces-17C] [5] //[NICE][iterative-sparse][+idea]\n[problem:CodeForces-19B] [4] //Knapsack [after good look]\n[problem:CodeForces-30C] [4] //Probabilities + [slight]GEO\n[problem:CodeForces-31E] [4] //[NICE]\n[problem:CodeForces-41D] [4] //With printing\n### dsu\n[problem:SPOJ-ADABRANC]\n[problem:CodeForces-915F] [6] //[VERY NICE][SORTING]\n[problem:CodeForces-141E] [6] //[NICE][SPANNIG TREE]\n[problem:UVALive-7903] [7] //[VERY NICE][DSU][SORTING][MERGE][DFS]\n[problem:CodeForces-110E] [4] //[NICE][COMBINATORICS][TREE]\n[problem:CodeForces-90E] [5] //[NICE][DSU-LIKE-LINKS][SIMULATION]\n[problem:CodeForces-87D] [5] //[VERY NICE][SORTING][COMPRES][DFS]\n[problem:CodeForces-884E] [5] //[VERY NICE][MEMORY SPARSE]\n[problem:CodeForces-60D] [6] //[NICE][Pythagorean Triples][Gen over max!]\n[problem:UVA-10947]\n[problem:UVA-12363]\n[problem:UVALive-3833]\n[problem:CodeForces-742D] //+DP\n[problem:UVA-10178]\n[problem:CodeForces-723F] 7\n[problem:UVA-13153] [5]\n[problem:UVA-13169] [3]\n[problem:UVA-11987] [3]\n[problem:UVA-11474] [4]\n[problem:SPOJ-BTCODE_G]\n[problem:CodeForces-691D]\n[problem:Gym-101174K] [2016-2017 ACM-ICPC Southwestern European Regional Programming Contest [SWERC 2016]]\n[problem:UVA-10583]\n[problem:LightOJ-1003]\n[problem:CodeForces-731C]\n[problem:UVA-793]\n[problem:UVA-11966]\n[problem:CodeChef-COZIC]\n[problem:UVALive-3939]\n[problem:UVA-11503]\n[problem:CodeForces-755C]\n[problem:UVA-1395]\n[problem:CodeForces-687D] 6\n[problem:CodeForces-680E] 7 //+precalculation/brute force\n[problem:CodeForces-766D] 5\n[problem:SPOJ-LEXSTR] [3] //Nice na stringu\n[problem:CodeForces-805C] 3 //NICE [dijkstra like :P]\n[problem:SPOJ-IITKWPCI] [3] //VERY NICE\n[problem:SPOJ-FRNDCIRC] [3] //Classical DSU [NICE for practice]\n[problem:SPOJ-FOXLINGS] [3] Easy just renumbering\n[problem:SPOJ-NITTROAD] [4] //Process from back\n[problem:SPOJ-SHAHBG] [2] //DSU not needes [simulated by array]\n[problem:CodeForces-598D] [3] //Can be solved with DFS too\n[problem:CodeForces-9E] [4] //Making one big cycle\n[problem:CodeForces-25D] [4] //Could be done linear too\n[problem:CodeForces-28B] [4] //NICE [imho bad statement]\n[problem:CodeForces-876D] [4] //DSU adjacent + visited\n[problem:CodeForces-875F] [6] //NICE Maximum cactus-forest [kruskal-like]\n### euler_function\n[problem:CodeForces-907F] [7] //[MAGIC]\n[problem:UVA-10299]\n[problem:UVA-10990]\n[problem:CodeChef-SMPLSUM]\n[problem:CodeChef-COZIE]\n[problem:SPOJ-LCMSUM]\n[problem:Gym-100975F] [2003-2004 Petrozavodsk Summer Training Camp, Saratov SU Contest]\n[problem:UVA-13132]\n[problem:SPOJ-GCDEX]\n[problem:UVA-12995]\n[problem:SPOJ-TIP1]\n[problem:UVA-11327]\n[problem:LightOJ-1007]\n[problem:SPOJ-ETF]\nProject Euler #72: Counting fractions\n[problem:SPOJ-DCEPCA03]\n[problem:SPOJ-NAJPWG] 4 //Gauss-Euler\n[problem:SPOJ-DCEPC12G] [5] //Do what is written there\n[problem:SPOJ-INVPHI] [5] //Inverse euler\n### euler_tour\n[problem:Gym-101650I] //[NICE][GRAPHS] // Theory is useful\n[problem:UVA-13246] Words [4] //[NICE][LEXICOGRAPHICAL]\n[problem:UVA-10735]\n[problem:CodeForces-789D] //Adj EG + Self/everything\n[problem:CodeForces-21D] [5] //[NICE][EulerTour+DP]\n[problem:CodeForces-36E] [6] //VERY NICE [4odd is hardest]\n### factorization\n[problem:SPOJ-ADAHW] [RHO][Number Theory]\n[problem:SPOJ-ADADIGIT] [Permutations]\n[problem:UVA-13067]\nProject Euler #108: Diophantine reciprocals I\n[problem:SPOJ-CHGROOM]\n[problem:Gym-101370A] [2009-2010 Summer Petrozavodsk Camp, Petr Mitrichev Contest 5]\n[problem:CodeForces-837E]\n[problem:SPOJ-PSYCHOT]\n[problem:SPOJ-FACTDIV]\n[problem:SPOJ-NOSQ]\n[problem:SPOJ-FCDC]\n[problem:SPOJ-NFACTOR]\n[problem:SPOJ-ABA12D]\n[problem:SPOJ-PSTR]\n[problem:SPOJ-AMR11E]\n[problem:SPOJ-FACT1]\n[problem:SPOJ-FACT2]\nhttps://www.hackerearth.com/problem/algorithm/gold-at-lolympics/\n[problem:UVA-12005] [7]\n[problem:UVA-12062] [6]\n[problem:UVA-11960] [3]\n[problem:SPOJ-FACTCG2] [3]\n[problem:SPOJ-FACT0] [4]\n[problem:CodeForces-546D] 5\n[problem:CodeForces-222C] 6\n[problem:SPOJ-COMDIV] 3\n[problem:SPOJ-SINEGGS] 3\n[problem:SPOJ-BDOI16B] 4\n[problem:SPOJ-HG] 4 //Map \u003d\u003d OK\n[problem:UVA-11099] [3] //factor + recursion\n[problem:UVA-13194] [3] //factorize+generate /or just check\n[problem:UVA-13191] [6] //Pollard-Rho\n[problem:CodeForces-818E] [4] // Efficient + Two Pointers\n[problem:CodeForces-831F] [6] //MAGIC\n[problem:CodeForces-839D] [4] // Combinatorics + IE\n[problem:SPOJ-SAS002] [5] //Find all divisors [big numbers]\n[problem:SPOJ-GCDS] [4] //Lowest unused prime\n[problem:SPOJ-IITKWPCF] [4] //Nonprime divisors of N/2\n[problem:CodeForces-851D] [4] //Properties of GCD + factor: NICE\n[problem:SPOJ-PTIME] [3] //Low bounds check each prime independently\n[problem:SPOJ-MAIN12B] [3] //NICE [Factorization][Sort][Unique]\n[problem:SPOJ-AMR11E] [2] //2664 is the biggest\n[problem:SPOJ-GCPC11A] [4] //Very nice factorize + divide N by powers\n[problem:SPOJ-AMR10C] [3] //Maximum of factor-powers\n### fenwick\n[problem:SPOJ-ADABEHIVE] [2D]\n[problem:SPOJ-ADACABAA] [2D][Sparse]\n--- --- http://codeforces.com/Gym/101889 [5] //[NICE] normalize\nDevSkills-422: Double Pairs [4] //[NICE] normalize\n[problem:UVALive-7591] Center [4] //[NICE][SORTING]\n[problem:CodeForces-903D] [5] //[NICE][BIG]\n[problem:CodeForces-102D] [4] //[NICE][+DP][NORMALIZE]\n[problem:Gym-101047J] [2D]\n[problem:SPOJ-MATSUM] [2D]\nhttps://www.hackerearth.com/practice/data-structures/advanced-data-structures/fenwick-binary-indexed-trees/practice-problems/algorithm/counting-in-byteland/ [3D]\nhttps://devskill.com/CodingProblems/ViewProblem/300\n[problem:CodeForces-707E] 7 [2D]\n[problem:CodeForces-749E] 8\n[problem:CodeForces-101055PD] 5 [2D]\n[problem:UVA-11240] [4]\n[problem:CodeForces-459D] [4] //[NICE][SWEEPING]\n[problem:CodeForces-61E] [4] //[NICE][CLASSICAL][2\\FW][NORMALIZE]\n[problem:CodeForces-669E] 5 //fenwicks sparse\n[problem:CodeForces-777E] 4 //MAXIMUM\n[problem:SPOJ-TULIPNUM] 4 //inc 1 nor+num|sum[A[B],A[E]]\n[problem:CodeForces-799C] 3 //MAX FW [but possibly easier?]\n[problem:CodeForces-831E] 4 //MAP to get ORDER FW \u003d\u003d LIST\n[problem:SPOJ-SAS001] [4] //Nice number of inversions + 2P\n[problem:SPOJ-TPGA] [4] //NICE Lesser\\[N-i-1]!\n[problem:SPOJ-SGIFT] [4] //BS works too\n[problem:SPOJ-SUMSUM] [5] //Bit-by-Bit cnt 0/1\n[problem:SPOJ-AKVQLD03] [3] //Classical fenwick easy\n[problem:SPOJ-ZIGZAG2] [6] //Very nice FW + BS + DP\n[problem:CodeForces-849E] [7] //2D Fenwick / ST+TP [NICE]\n[problem:SPOJ-CRAYON] [5] //VERY NICE [2\\FW begin + end]\n[problem:SPOJ-NITT8] [4] //Norm. + Store indices in MAX-Fenwick [REVERSE] [VERY NICE]\n[problem:SPOJ-DCEPC705] [4] //NICE! Sort + Fenwick\n[problem:SPOJ-DCEPC206] [3] //NICE \u0026 EASY\n[problem:SPOJ-KOPC12G] [4] //N Fenwick trees\n[problem:SPOJ-TRIPINV] [4] //2xFenwick [triples counting]\n[problem:CodeForces-597C] [4] //[VERY NICE] 11\\Fenwick\n[problem:CodeForces-12D] [4] //NICE [triplet-comparing][sort]\n[problem:SPOJ-NARHIL] // Sugested by ak07\n### fft\n[problem:SPOJ-ADAMATCH]\n[problem:UVA-12633]\n[problem:UVALive-6886] Golf Bot\n[problem:SPOJ-POLYMUL]\n[problem:Gym-100960C] [2015-2016 Petrozavodsk Winter Training Camp, Nizhny Novgorod SU Contest]\n[problem:CodeChef-APRPS]\n[problem:CodeChef-POLYEVAL]\n[problem:SPOJ-TSUM] 5\n[problem:UVA-13182] 5 //ACTG hamming\n[problem:CodeForces-827E] [8] //MAGIC\n[problem:SPOJ-MAXMATCH] 5 //abc hamming\n### flow\n[problem:SPOJ-FASTFLOW] //Raw [no sauce]\n[problem:CodeForces-78E] [5] //NICE [Matching-like][+BFS]\n[problem:UVALive-4322] the bus stations [Live Archive]\n[problem:UVA-11380] Went The Titanic [UVA] //Interesting grid problem\n[problem:UVALive-6395] Surely You Congest [LA] //VERY NICE [slightly advanced]\n[problem:UVALive-7204] Blood groups [LA]\n[problem:Gym-100963F] [Flame of Nucleus F]\n[problem:UVA-11167] in the Emei Mountain //Also harder [imho]\n[problem:CodeForces-653D] [+BS]\n[problem:UVA-13000] Treatment [+BS]\n[problem:UVA-1242]\nhttps://www.deadline24.pl/assets/problemsets/dl24.elim.2017.B.en.pdf [DEADLINE 24 problem not sure if it can be submited :O]\n[problem:UVALive-3487] [Near matching]\n[problem:CodeForces-727D]\n[problem:CodeForces-704D] [Also advanced]\n[problem:UVALive-5418] A Plug for UNIX [LA]\n[problem:UVALive-4957] Fake scoreboard [LA] //If I remember well, other solutions was also possible\n[problem:LightOJ-1155] Power Transmission [LOJ] //[classical]\n[problem:CodeChef-ROBOTDAG] //Ford-Fukherson\n[problem:UVA-10804] Strategy [UVA]\n[problem:UVA-11506] Programmer [UVA] //Nodes division\n[problem:UVA-10511] [UVA]\n[problem:UVA-563]\n[problem:UVA-1306] K-League [UVA]\n[problem:UVA-1345] Contact Groups\n[problem:UVA-10092] Problem with the Problem Setter\nProblem B. Roller Coaster Scheduling [GCJ 2017]\n[problem:UVA-259] Allocation [UVA]\n[problem:UVALive-5905] Pool construction [LA] //Imho harder\n[problem:UVA-10480]\n[problem:CodeForces-808F] 6 //NICE nontrivial [max matching with bigger flows]\n[problem:CodeForces-847J] 6 //Probably not flows matching-like\n### flow-matching-like\n[problem:SPOJ-ADAHOSE] [DUAL-GRAPH]\n[problem:CodeForces-903G] [6] //[VERY NICE][SEG-TREE][CUT]\n[problem:UVALive-3837] //Stable Marriage\n[problem:UVA-1175] //Stable Marriage\n[problem:UVA-11594] Pairs Maximum Flow [UVA]\n[problem:SPOJ-ADABLOOM] //Maximum matching in general graph\n[problem:UVA-11439] the ICPC //Maximum matching in general graph\n[problem:UVA-1376] Run //Max flow on planar graph [Dual \u003d\u003d shortest path over edges]\n[problem:UVA-10989] Divide and Conquer //Stoer-Wagner global cut\n### floyd-warshall\n[problem:UVA-10724]\n[problem:UVA-117]\n[problem:CodeForces-21D]\n[problem:UVA-1198]\n[problem:LightOJ-1086] //+DP\n[problem:SPOJ-INGRED] //+DP\n[problem:UVA-10048]\n[problem:UVA-125]\n[problem:Gym-101223C] [2017 Facebook Hacker Cup, Round 1] //+DP\n[problem:LightOJ-1221]\n[problem:UVA-423]\n[problem:UVA-12179] //+DP\n[problem:UVA-1416]\n[problem:UVA-1233]\n[problem:UVA-10793]\n[problem:UVA-10099]\n[problem:UVA-869]\n[problem:LightOJ-1174]\n[problem:SPOJ-ARBITRAG] //Other algos shall work too\n[problem:UVA-13211] [5] //NICE FW adding states\n[problem:SPOJ-ROHAAN] [3] //Classical\n[problem:CodeForces-25C] [4] //Adding new edges .. need FW principal\n[problem:CodeForces-33B] [3] //NICE [dijkstra could work too]\n### friedvaldAlgorithm\n[problem:SPOJ-ADAPOWER]\n[problem:UVALive-4956]\n### game_theory\n[problem:SPOJ-ADAGAME] [DP]\n[problem:SPOJ-ADAGAME2]\n[problem:SPOJ-ADAGAME4]\n[problem:SPOJ-ADAQUBIC]\n[problem:SPOJ-ADAFIMBR]\n[problem:SPOJ-ADAGAME5]\n[problem:SPOJ-ADAXMAS]\n[problem:Gym-101808I] [5] //[DP][OBSERVATION]\n[problem:CodeForces-919F] [6] //[NICE][HARD][IMPLE][BFS][TOPO][GRAF]\n[problem:CodeForces-918D] [4] //[NICE][DAG][DP][TREE]\n[problem:CodeForces-914B] [3] //[NICE][EASY][OBSERVATION][PARITY]\n[problem:CodeForces-148D] [4] //[EASY][DP][PROBABILITY]\n[problem:CodeForces-138D] [7] //[VERY NICE][DP][OBSERVATION]\nhttps://arc087.contest.atcoder.jp/tasks/arc087_c [5] //[VERY NICE][TRIE][SEQUENCE]\n[problem:CodeForces-120E] [3] //[NICE][SYMETRY][PARITY]\n[problem:CodeForces-88E] [5] //[VERY NICE][PREFIX-XOR][NIMBERS][SQRT][MATH]\n[problem:CodeForces-69D] [4] //[NICE][DP] Reflection can be ignored\n[problem:CodeForces-55C] [4] //[NICE] Size of piece from border\n[problem:CodeForces-255E] --MEX\nhttps://devskill.com/CodingProblems/ViewProblem/91\nhttps://devskill.com/CodingProblems/ViewProblem/364\nProject Euler #96: Su Doku //Sudoku\n[problem:UVA-11859] 4\n[problem:UVA-11863] 4\n[problem:UVA-11892] 3 //Probably solved by many\n[problem:UVA-11534] 5\n[problem:SPOJ-VECTAR11] 4 //Nsqrt[N] passes [with break]\n[problem:CodeForces-768E] [4] //NICE Grundy\n[problem:SPOJ-SYNC13C] [4] //2\\DP {maybe not seeing sth}\n[problem:CodeForces-787C] [4]\n[problem:CodeForces-794C] [3] //Find optimal strategy: choose back/front\n[problem:CodeForces-794E] [5] //NICE Find stategy: Even/Odd\n[problem:CodeForces-812E] [7] //Advanced NIM strategy\n[problem:SPOJ-GAMEMVS] [4] //Nimbers [Ai^X]\\\u003c\u003dAi\n[problem:SPOJ-PLAYGAME] [3] //Check pattern\n[problem:SPOJ-CHAOS_CC] [4] //VERY NICE [nimbers]\n[problem:CodeForces-851E] [5] //Very nice [nimbers] [bitset]\n[problem:SPOJ-CHGROOM] [4] //+Factorisation [NICE \u0026 Easy]: Win unless 2 prime factors\n[problem:SPOJ-EALP1] [4] //NICE ~ Possible Moves of NIM\n[problem:SPOJ-GAME3] [4] //VERY NICE pattern watching [A145812]\n[problem:SPOJ-GAME2] [5] //VERY NICE https://community.topcoder.com/tc?module\u003dStatic\u0026d1\u003dmatch_editorials\u0026d2\u003dsrm338 [CAKE]\n[problem:SPOJ-CF36D] [5] //Pattern watching [care for 1]\n[problem:CodeForces-15C] [4] //VERY NICE [XOR: A,1,A+1,0..repeat]\n[problem:CodeForces-39E] [4] //Slightly [DP][MATH][ROUNDING]\n[problem:CodeForces-63E] [5] //[NICE][BITMASK-DP]\n### gauss\n[problem:UVA-12910] and Ladders [UVA]\n[problem:UVA-10828]\n[problem:Gym-100923C]\n[problem:UVALive-4963]\n[problem:UVA-12849]\n[problem:Gym-100962A] [2015-2016 Petrozavodsk Winter Training Camp, Moscow SU Trinity Contest][NICE]\n[problem:UVA-10109] [NICE][HARD-WORK]\n### geometry\n[problem:SPOJ-ADAPICK]\n[problem:SPOJ-ADAKOHL]\n[problem:Gym-101808E] [5]\n[problem:Gym-101808A] [2]\n[problem:Gym-101666A]\n[problem:Gym-101726J] [5] //[NICE][INTERSECTION][DS]\n[problem:Gym-101650F] //Polygons + circles\n[problem:Gym-101650H] //A few if\u0027s\n[problem:CodeForces-908C] [3]\n[problem:CodeForces-140A] [3] //Circles around bigger circle\n[problem:CodeForces-136D] [4] //+Brute-Force\n[problem:CodeForces-127A] [1] //Points distance\n[problem:Gym-101597B] [3] //Simply brute-force just the closest to points\n[problem:CodeForces-70D] [5] //Dynamic Convex Hull\n[problem:Kattis-airport] //Proposed by tautsjasiunsas\n[problem:HackerRank-elastic-rope] \nhttps://devskill.com/CodingProblems/ViewProblem/20 [EASY]\n[problem:UVA-10321] //Polygon intersection\n[problem:UVA-11265] //Polygon point +/-\n[problem:UVA-13112] //Polygon\n[problem:UVA-10907] [Area of polygon from a point]\n[problem:UVALive-3378] Swamp Things Maximum points on line\n[problem:UVA-11768] //Discrete points\n[problem:UVALive-2542] //Arc size [formula]\n[problem:UVA-1571] //As below [easier]\n[problem:CodeChef-ALLPOLY] //[NICE] Point seeing polygon\n[problem:SPOJ-IITKWPCL] //Point distance\n[problem:UVA-11281] //circle~triangle\n[problem:UVA-12921] //circle reconstruction\n[problem:UVA-190] //circle from 3 points\n[problem:UVA-12240] //pts\u003ecircle\n[problem:UVA-438] //circle pt\n[problem:LightOJ-1018] //Minimum # of lines through all pts [VERY NICE]\n[problem:UVA-11008] //Similar as above\n[problem:UVA-12830] //Biggest rectangle without points inside\n[problem:UVA-11012] //Most distant points\n[problem:UVA-1683] //Closest points\n[problem:UVA-12389] //3D MH Closest Points\n[problem:SPOJ-AMR12C] //Pt closest to all other points\n[problem:SPOJ-CLOPPAIR] //Closest pair of points\n[problem:UVA-10678] //Circles intersection\n[problem:CodeForces-600D] //Circles intersection\n[problem:LightOJ-1118] //Circles intersection\n[problem:SPOJ-CERC07C] //Bounding circle\n[problem:UVA-10005] //Bounding circle\n[problem:UVALive-2407] //Bounding Sphere\n[problem:LightOJ-1120] //Rectangle\u0027s Union\n[problem:LightOJ-1130] //Circle x Rectangle intersection\n[problem:UVA-11177] //Circle x Convex Polygon\n[problem:CodeForces-610D] //Lines intersections [axes parallel]\n[problem:UVALive-6263] //Pt in areas\n[problem:LightOJ-1058] //# parallelograma\n[problem:UVA-12931] //Common area of polygons\n[problem:UVA-10301] //Intersecting circles\n[problem:UVA-453] //Circles intersection\n[problem:CodeForces-681E] //Circles intersection\n[problem:UVA-920] //Lines intersecion [etc..]\n[problem:UVA-12556]\n[problem:CodeForces-793C] //Intersection ans similar\n[problem:UVA-11343] //Intersection of segments\n[problem:UVA-866] //Intersection of segments\n[problem:Gym-100190I] [2011 ACM-ICPC East Central North America [ECNA 2011]] //Segment intersection\n[problem:Gym-100917K]\n[problem:UVA-11686] //Segment intersection\n[problem:LightOJ-1388]\n[problem:UVA-833] //Segment intersection\n[problem:LightOJ-1196] //Points sides\n[problem:UVA-10167] //Points sides\n[problem:UVA-12818] //Arc \u0026 Point distance\n[problem:SPOJ-SICRANO] //Point-line distance\n[problem:CodeForces-614C] //Point-line distance\n[problem:UVA-13117] //Point-line distance\n[problem:UVA-12483] //Point-line distance\n[problem:UVA-12173] //Point-line distance\n[problem:UVA-10075] //Point distance on sphere\n[problem:HackerRank-nearby-attractions] \n[problem:UVA-535] //Point distance on sphere\n[problem:UVA-10897] //Sphere tavelling\n[problem:UVA-11817] //Sphere travelling\n[problem:UVA-10316] //Sphere travelling\n[problem:UVA-1469] //Fractions distance 3D\n[problem:UVA-11930]\n[problem:UVA-12173] 3\n[problem:UVA-12194] 4\n[problem:UVA-11894] 3\n[problem:UVA-11769] 7\n[problem:UVA-11665] 5\n[problem:UVA-11509] 4\n[problem:UVA-11355] 5\n[problem:UVA-11265] 6 //Nice one | polygon cut/pt-check/area\n[problem:UVA-11123] 4 //Counting trapezoids\n[problem:UVA-11177] 6 //BS+Polygon/Circle intersection\n[problem:UVA-11186] 3\n[problem:UVA-11008] 5 //with DP → #intersected triangles\n[problem:UVA-11012] 5 //Nejvzdáleněj?í body [Manhatton 3D]\n[problem:UVA-11072] 4 //Points v poly gonu\n[problem:CodeForces-682E] 6 [biggest triangle]\n[problem:CodeForces-672C] 4 //easy just think it up\n[problem:CodeForces-667A] 2 //vzorecky\n[problem:CodeForces-793C] 5 //EASY but beware of epsilons [NICE]\n[problem:CodeForces-794B] 2 //Can be done with BS\n[problem:CodeForces-814D] 5 //+DP on trees [NICE but low geom.]\n[problem:UVA-10750] 3 //Closest points try all pairs\n[problem:CodeForces-820B] 3 //Polygon angle find!\n[problem:UVA-13213] 5 //VERY NICE Voronoi diagram [low constraints so not actually needed]\n[problem:UVA-13215] 3 //EASY Sum areas and find side lengths\n[problem:SPOJ-IITKWPCC] [5] //VERY VERY NICE Nqrt[N]log[N]\n[problem:SPOJ-NNS] [5] Closest points query [fake geometry] {128}[NICE]\n[problem:CodeForces-849B] [3] //X-Product side\n[problem:SPOJ-AMR12C] [5] //Point closest to all other points [with speed]\n[problem:SPOJ-SICRANO] [3] //Line-Point distance\n[problem:SPOJ-VCIRCLES] [5] //Heavy geometrical \\\\\\\\\n[problem:SPOJ-CIRU] [5] //Same as above [yet bigger constraints]\n[problem:SPOJ-THREETW1] [4] //Fermat point search\n[problem:SPOJ-CLOPPAIR] [4] //Closest pair of points\n[problem:SPOJ-MAXLN] [2] //Some basic [4\\r^2+.25]\n[problem:SPOJ-KOLICA] [4] //VERY NICE [nasty iff party]\n[problem:CodeForces-598C] [4] //NICE ~ Precision! [ld]\n[problem:CodeForces-18A] [2] //EASY\u0026FINE: Pythagoreas\n[problem:CodeForces-40A] [2] //[EASY][DISTANCE]\n### graph\n[problem:Gym-101666H] //[VERY NICE][GEOMETRY][DSU][EULER][PLANAR]\n[problem:UVALive-2827] //3Coloring\n[problem:UVALive-2243] //3Coloring\n[problem:UVALive-5603] //Coloring\n[problem:UVA-1658] //Shortest paths\n[problem:UVA-12821] //Shortest paths\n[problem:CodeForces-27D] [5]\n[problem:UVA-11387] 4\n[problem:SPOJ-VFRIEND2] [5] //Graph possible check\n[problem:CodeForces-859E] [4] //VERY NICE [2 cases: CYCLE [x2] / TREE [x[Size+1]]\n[problem:CodeForces-847C] [2] //Forest making Easy\u0026Nice\n[problem:CodeForces-863C] [3] //Cycle in states\n### greedy\n--- --- http://codeforces.com/Gym/101666 [4] //[NICE][QUEUE][DFS][EVENTS]\n[problem:Gym-101806T] [5] //[NICE][SEGMENT TREE][SORTING]\n[problem:CodeForces-916B] [3] //[BITS] FIRST \u0026 LAST\n[problem:CodeForces-913C] [3] //+[DP]\n[problem:CodeForces-146D] [4] //[NICE][CONSTRUCTION]\n[problem:CodeForces-146C] [3] //[EASY][NICE][TWO-CASES]\n[problem:CodeForces-139D] [4] //Muchas cases\n[problem:UVALive-7887] to the Future [4] //[NICE][2\\HEAP]\n[problem:CodeForces-910A] [2] //DP works too\n[problem:CodeForces-125D] [4] //Limited possibilities\n[problem:CodeForces-902A] [2] //Just keep last\n[problem:CodeForces-898D] [4] //[NICE][FENWICK/OR/PREFIX]\n[problem:CodeForces-118C] [4] //[NICE] Try each digit [iterate in waves]\n[problem:UVALive-7706] [2] //Sweep and keep maximum\n[problem:CodeForces-893D] [4] //[NICE][SWEEP][MAXIMUM] pay max when have to\n[problem:CodeForces-892B] [2] //Sweep from back\n[problem:CodeForces-102C] [3] //sort by frequency\nhttps://devskill.com/CodingProblems/ViewProblem/419 [2] //Sweep from back\n[problem:CodeForces-890C] [3] //frequence\n[problem:CodeForces-890B] [2] //[EASY][REVERSE]\n[problem:CodeForces-888B] [2] //Equalize U/D and L/R\n[problem:Gym-101597J] [4] //[NICE][SWEEP]\n[problem:CodeForces-76B] [4] //[NICE][MATCHING-LIKE][2PTRS]\n[problem:CodeForces-73B] [4] //[IMPLEMENTATION][SORTING]\n[problem:CodeForces-883K] [4] //Nice Two sweeps\n[problem:CodeForces-49D] [3] //NICE 1010101 OR 0101010 [haming]\n[problem:CodeForces-58C] [4] //NICE group trees by slopes\n[problem:CodeForces-729D] 3\n[problem:CodeForces-729E] 4\n[problem:CodeForces-725D] 4\n[problem:CodeForces-725F] 9\n[problem:CodeForces-732E] 5\n[problem:CodeForces-727F] 6\n[problem:CodeForces-724D] 5\n[problem:CodeForces-723C] 4\n[problem:CodeForces-719B] 2\n[problem:CodeForces-712C] 3\n[problem:UVA-13152] [4]\n[problem:CodeForces-746E] 5\n[problem:CodeForces-746D] 3\n[problem:CodeForces-749C] 3\n[problem:UVA-11737] [3]\n[problem:UVA-11786] [4]\n[problem:UVA-11630] [5]\n[problem:UVA-11563] [4]\n[problem:UVA-11491] [4]\n[problem:UVA-11330] [3]\n[problem:UVA-11089] [2]\n[problem:CodeForces-884D] [4] //PQ or Sort\n[problem:SPOJ-SQRMINSUM] 3 //solve-able in O[N+M]-arrayqueue\n[problem:SPOJ-MSCHED] 3 //sweep from back\n[problem:SPOJ-ns\u003d18780683] 4 //all perm + A\\\u003cB\\\u003cC works\n[problem:SPOJ-NINJA7] [3] //sort by diff\n[problem:SPOJ-NINJA2] [4] //try all possib. [26]\n[problem:CodeForces-767E] [6]\n[problem:CodeForces-637B] [3] //NICE pro prvaky\n[problem:CodeForces-777B] [3] // -||-\n[problem:CodeForces-777D] [3] //just go from end\n[problem:CodeForces-779C] [3] //NICE pro prváky\n[problem:SPOJ-SPCU] [2] //Easy zamysleni [max int \u003d index]\n[problem:SPOJ-LOPOV] [4] //sort + queue [or just queue] NICE\n[problem:CodeForces-792E] [5] //T%S\\\u003c\u003dT/S + check proper\n[problem:CodeForces-807E] [5] //NICE put asice P2 / rest greedy from small\n[problem:CodeForces-799E] [5] //Many queues but NICE\n[problem:CodeForces-808C] [3] //EASY\n[problem:CodeForces-802B] [4] //Priority by \"next\"\n[problem:UVA-10850] [4] //Queue a brute-force\n[problem:CodeForces-813A] [1] //Zahrivacka pro prvaky\n[problem:UVA-10716] [4] //NICE always find closest pair\n[problem:CodeForces-816C] [3] //NICE greater\\\u003clesser side\n[problem:CodeForces-820D] [5] //VERY NICE O[N] -~- 5 events per number\n[problem:CodeForces-818B] [2] //Zahrivacka pro prvaky\n[problem:CodeForces-822C] [4] //Almost classical Sort+Queue\n[problem:CodeForces-825C] [2] //Nice \u0026 Easy\n[problem:CodeForces-825D] [3] //Update by modulo\n[problem:CodeForces-835B] [2] // Zahhrivacka pro prvaky\n[problem:CodeForces-839B] [3] //Nasty iffs yet nice excersize\n[problem:SPOJ-PCPC12I] [4] //Swipe MINIMUM from left/right [10^6-A[i] trick]\n[problem:SPOJ-AMR12I] [3] //NICE a] MAX_SEG\u003e\u003dK b] [SEG_SIZE-1]/K+1\n[problem:SPOJ-BUSYMAN] [2] //NICE\u0026EASY Sort + keep minimum\n[problem:CodeForces-861C] [3] //2+ but not same\n[problem:SPOJ-WORKB] [3] //Simple \"min\" formula for each neighbor\n[problem:CodeForces-864D] [4] //VERY NICE Frequency + unused\n[problem:SPOJ-ROADTRIP] [4] //VERY NICE Keeping last lesser\n[problem:CodeForces-597B] [3] //NICE [Classical]\n[problem:SPOJ-SHLIGHTS] [4]\n[problem:SPOJ-MLK] [3] //VERY NICE Sum all prefix sums\n[problem:CodeForces-867C] [4] //NICE [IMPLE][2POINTERS][MID+EPS]\n[problem:CodeForces-867E] [5] //NICE [EASY-IMPLE][HARD-CONS]\n[problem:CodeForces-18D] [4] //+Big Integer\n[problem:CodeForces-276D] [4] //NICE Find first mismatch bit [then 111...111]\n[problem:CodeForces-3B] [4] //Divide 1/2 [sort][2pointers]\n[problem:CodeForces-3D] [4] //?\u003d\u003d] ..if open \\\u003c 0: set max A-B to [\n[problem:CodeForces-26B] [4] // +1 [ | -1 ]: -1, erase .. erase sum in the end\n[problem:CodeForces-33A] [2] //EASY [long-statement]\n[problem:CodeForces-44E] [2] //Try mins then try maxs\n[problem:CodeForces-45D] [3] //Priority-queue+\u0027sort\u0027\n### hash\n[problem:SPOJ-ADACLEAN]\n[problem:Gym-101808B] [5] //[NICE][NUMBERS]\n[problem:Gym-101741K] [5] //[NICE][SQRT][PATTERN MATCHING]\n[problem:UVALive-7979] Rover [3] //[NICE] //Many other ways to solve\n[problem:CodeForces-898F] [5] //[VERY NICE] //Hash by 10\n[problem:CodeForces-114D] [4] //[NICE] //N^2Log[N] might/might-not be OK\nhttps://www.urionlinejudge.com.br/judge/en/problems/view/1503 [7] //[NICE][BS][OPTI]\n[problem:Gym-101466E] [2017 ACM-ICPC, Universidad Nacional de Colombia Programming Contest][NICE]\n[problem:UVA-12012] 4\n[problem:CodeForces-727E] 7\n[problem:CodeForces-718D] 8\n[problem:UVA-11855] 4\n[problem:CodeForces-752D] 5\n[problem:CodeForces-825F] 5 //String + Periods\n[problem:CodeForces-835D] 4 //Palindromes\n[problem:SPOJ-CF25E] [5] //VERY NICE [IMPLE\u003eCONCEPT]\n[problem:CodeForces-7D] [4] //Palindromes\n[problem:CodeForces-19C] [4] //[NICE]: Not a string\n### hull\n[problem:SPOJ-GARDENHU]\n[problem:UVALive-2453] Wall\n[problem:UVA-13213]\n[problem:UVA-11096]\n[problem:Gym-100792G] [2015-2016 ACM-ICPC, NEERC, Moscow Subregional Contest]\n[problem:CodeChef-KTHCON]\n[problem:CodeForces-605C]\n[problem:UVA-218]\n[problem:UVA-11072]\n[problem:UVA-11168]\n[problem:UVA-12307]\n[problem:Gym-100963I] [2007-2008 Summer Petrozavodsk Camp, Japanese Contest, 2007-08-29]\n[problem:UVA-11243]\n[problem:UVA-10256]\n[problem:UVA-109] Busters\n[problem:UVA-13024] [NICE]\n[problem:UVA-10002]\n[problem:Gym-100886H] [2015-2016 Petrozavodsk Winter Training Camp, Saratov SU Contest]\n[problem:UVA-1139]\n[problem:UVA-681]\n[problem:UVA-811]\n[problem:CodeChef-MGCHGEOM]\n[problem:UVA-11769] //3D\n### chess\n[problem:SPOJ-ADACHESS]\n[problem:SPOJ-ADACHES2]\n[problem:SPOJ-ADAGAME5]\n[problem:SPOJ-ADAXMAS]\n[problem:CodeForces-131E] [4] //[NICE][STL][SORTING][QUEEN]\n[problem:CodeForces-42B] [4] //NICE Checkmate check\n[problem:UVA-10748] //bfs\n[problem:LightOJ-1143]\nhttps://www.hackerearth.com/practice/algorithms/greedy/basics-of-greedy-algorithms/practice-problems/algorithm/harry-and-ron-play-a-game-of-chess/\n[problem:UVA-10196]\n[problem:SPOJ-KNMOVE]\n[problem:UVA-11352]\n[problem:SPOJ-NAKANJ] //BFS\n[problem:LightOJ-1010]\n[problem:LightOJ-1171] //MM\n[problem:UVALive-2883]\n[problem:UVA-439]\n[problem:SPOJ-TRKNIGHT] //??\n[problem:UVALive-2308]\n[problem:SPOJ-CCHESS] //Dijkstra\n[problem:CodeForces-630H] //[ROOKS][BIG][COMBINATORICS]\n[problem:LightOJ-1005] //As above [but with real rooks]\n[problem:LightOJ-1061] //Placing queens\n[problem:UVA-11085]\n[problem:UVA-10094] //Queen placing [NICE][PATTERN]\nhttps://devskill.com/CodingProblems/ViewProblem/383\n[problem:UVA-11852] [6]\n[problem:SPOJ-KLUG1] [2] //Jumps of horse\n[problem:SPOJ-CODESPTD] [5] //VERY NICE DP [Queens]\n[problem:CodeForces-3A] [2] //Imple Shortest path for king\n[problem:CodeForces-38B] [2] //NICE Simple possition checking\n### implementation\n[problem:Gym-101889H]\n[problem:CodeForces-934A] [2]\n[problem:CodeForces-922A] [2] //Iff-party\n[problem:CodeForces-914A] [1]\n[problem:CodeForces-916A] [2] //Time\n[problem:CodeForces-915B] [2] //Formula / Iff\n[problem:CodeForces-915A] [1]\n[problem:CodeForces-913A] [1]\n[problem:CodeForces-912A] [2] //Easy [corner-cases]\n[problem:CodeForces-146A] [1]\n[problem:SPOJ-ESYR] [1] //Bad one :/\n[problem:CodeForces-908A] [1]\n[problem:CodeForces-147A] [2] //Parsing\n[problem:CodeForces-139A] [1]\n[problem:CodeForces-137A] [1]\n[problem:UVALive-7886] Teams [2] //[EASY][SORTING]\n[problem:CodeForces-133A] [1]\n[problem:CodeForces-134A] [1]\n[problem:CodeForces-131A] [1]\n[problem:CodeForces-127B] [1] [EASY]\n[problem:CodeForces-899B] [2] //Dates\n[problem:CodeForces-898C] [3] //No thinking just implementation\n[problem:UVALive-6157] do spiders walk on water? [4] //boring problem\n[problem:CodeForces-900A] [1]\n[problem:UVALive-7613] atomic mass [1]\n[problem:CodeForces-122A] [1] //Find all lucky\n[problem:CodeForces-120B] [1] //Iteration\n[problem:CodeForces-120A] [1] //Iff/Logic\n[problem:CodeForces-118B] [2] //[PRINTING]\n[problem:CodeForces-108A] [1] //[EASY][PRINT][TIME]\n[problem:CodeForces-106A] [1] //Iff-party\n[problem:CodeForces-890A] [1] //if or perm\n[problem:CodeForces-90B] [2] //No idea just cycles\n[problem:CodeForces-75A] [1] //conversion\n[problem:CodeForces-884B] [1] //Simple sum +N-1\n[problem:CodeForces-48A] [1] //Very easy [fe. perm]\n[problem:CodeForces-51] [2] //Lex-lowest-string [|s|\u003d4]\n[problem:CodeForces-54A] [2] //Single sweep\n[problem:CodeForces-719C] 3\n[problem:CodeForces-747E] 4\n[problem:CodeForces-754C] 5\n[problem:UVA-11482] [4]\n[problem:UVA-11291] [3]\n[problem:UVA-11070] [5] //evaluation of expression\n[problem:UVA-11074] [2]\n[problem:CodeForces-678B] 2 //calendar days\n[problem:CodeForces-643A] 3 //easy just simulate\n[problem:CodeForces-770D] 5 //easy but pain draw\n[problem:CodeForces-789B] 3 //simulate [mby twice]\n[problem:UVA-13171] [1]\n[problem:UVA-10800] [3]\n[problem:CodeForces-828B] 2 //EASY \u0026 NICE just analysis\n[problem:CodeForces-825B] 2 //EASY \u0026 NICE Piskvorky pro prvaky\n[problem:CodeForces-837B] 2 //Just implementation\n[problem:CodeForces-837C] 2 //Some nasty iffs\n[problem:CodeForces-845B] 2 //Easy pro prvaky\n[problem:CodeForces-845D] 3 //Iffs folow the rules\n[problem:SPOJ-UNIHW] 4 //NICE [but many iffs]\n[problem:CodeForces-5A] [2] //Parsing\n[problem:CodeForces-5B] [3] //Output formating\n[problem:CodeForces-6B] [2] //Simply check by adjancecy vector + set\n[problem:CodeForces-7A] [1] //Oneinteresting if\n[problem:CodeForces-8B] [2] //Sample vectors + set/or/array\n[problem:CodeForces-12A] [1] //Find mirror by middle\n[problem:CodeForces-16A] [1] //Easy check of chars\n[problem:CodeForces-21A] [2] //Easy but nasty iff imple\n[problem:CodeForces-31B] [2] //Boring imple\n[problem:CodeForces-34C] [3] //Easy string parsing\n[problem:CodeForces-41C] [2] //String parsing\n### inclusion-exclusion\n[problem:SPOJ-KPRIMESB] [4]\n[problem:SPOJ-IITKWPCH] [4] //NICE on bits\n[problem:SPOJ-SUBSET] [5] //VERY NICE 3^10 [^2 but not exactly] [+ sorting]\nhttps://www.hackerearth.com/practice/algorithms/dynamic-programming/bit-masking/practice-problems/algorithm/special-pairs-7/description/ [4] //NICE [Brute-force]\n### interactive\n[problem:CodeForces-897D] [4] //NICE! Back/Front\n[problem:CodeForces-727C] [2]\n[problem:CodeForces-810D] [4] //BS \\ 3 [same]\n[problem:CodeForces-811D] [4] //BFS easy .. some ifs\n[problem:CodeForces-835E] [4] //NICE! Bitsets + Detect + XOR\n[problem:CodeForces-844D] [5] //NICE! Randomized algo\n[problem:CodeForces-862D] [4] //NICE! Find first + Binary Search\n[problem:CodeForces-872D] [4] //NICE! [no clue why it passed]\n### isomorphism\n[problem:UVA-12489] //Tree\n[problem:HackerRank-jenny-subtrees] \n[problem:SPOJ-DSUBTREE] [5] //Isomorphism on trees [try all subsets]\n[problem:SPOJ-TREEISO] [4] //Simple isomorphism of trees\n### josephus\n[problem:UVA-151]\n[problem:UVA-1394]\n[problem:UVA-440]\n[problem:UVALive-3803]\nhttps://www.urionlinejudge.com.br/judge/en/problems/view/1030\n[problem:UVA-12912]\n[problem:UVA-13114]\n[problem:UVA-11351] [2]\n[problem:SPOJ-CLSLDR] [4] //Muchas queries go DP\n[problem:SPOJ-WTK] [Easy] Suggested by ayushgupta1997\n[problem:SPOJ-DANGER] [Easy] Suggested by ayushgupta1997\n[problem:SPOJ-POCRI] [Medium] Suggested by ayushgupta1997\n[problem:SPOJ-NG0FRCTN] [Medium] Suggested by ayushgupta1997\n### KMP\n[problem:SPOJ-ADAPET]\n[problem:UVA-12604]\n[problem:UVA-12467]\n[problem:UVA-11019]\n[problem:SPOJ-NAJPF] [4] //classical kmp all patterns\n[problem:CodeForces-808G] [6] //with DP -harder\n### lca\n[problem:SPOJ-ADAAPPLE] [HLD][LCT works too]\n[problem:SPOJ-ADAVISIT] [HLD]\n[problem:SPOJ-ADALICI] [KTH Ancestor FAST!]\n[problem:SPOJ-ADAORANG]\n[problem:Gym-101808K] [5] //[NICE][IMPLEMENTATION][CYCLE]\n[problem:SPOJ-LCA] //Easiest one low constraints [practice]\n[problem:SPOJ-LCASQ]\n[problem:CodeForces-916E] [6] //[VERY NICE][SEG-TREE] //REROOT\n[problem:CodeForces-911F] [5] //[VERY NICE][LONGEST PATH]\nhttps://devskill.com/CodingProblems/ViewProblem/141\n[problem:UVA-12655]\n[problem:CodeChef-PSHTTR]\n[problem:LightOJ-1162]\n[problem:Gym-100685G] [2012-2013 ACM-ICPC, NEERC, Moscow Subregional Contest]\n[problem:UVA-12533]\n[problem:CodeChef-CLOSEFAR] //But kinda more comples [ST]\n[problem:CodeForces-733F] 7\n[problem:UVA-11354] [4]\n[problem:SPOJ-POLICEMEN] [3] //simple + small graph\n[problem:SPOJ-QTREE2] [5] //very easy if bin. understrood\n[problem:CodeForces-828F] 7 // Differently MST / Outside\n[problem:CodeForces-832D] [5] //Classical + Depth /OR/ HLD +ST\n[problem:SPOJ-DRTREE] [5] //NICE [finding ancestor + depths]\n[problem:CodeForces-838B] [6] //VERY NICE [HLD + ET + ST]\n[problem:SPOJ-NTICKETS] [4] //Maximum on path\n[problem:SPOJ-GRASSPLA] [5] //HLD\n[problem:CodeForces-855D] [4] //VERY VERY BAD STATEMENT [not so bad problem]\n[problem:Gym-101630L] [6] //[NICE][HLD or DSU][XOR] //Parenthessis\n### lcs_subsequence\n[problem:SPOJ-ADASEED] [HUNT]\n[problem:SPOJ-MC]\n[problem:UVA-10192]\n[problem:UVA-531]\n[problem:LightOJ-1110]\n[problem:UVA-12747] //Perm\n[problem:SPOJ-XMEN] //Perm\n[problem:UVA-10405]\n[problem:UVA-12511] //Increasing\n[problem:UVA-10635] //Increasing\n[problem:UVA-10949] [6] Hunt or Bit\n[problem:SPOJ-MC] [3] //Classical\n[problem:SPOJ-LCS0] [7] //Bit\n### lct\n[problem:SPOJ-ADAROADS] [ONLINE][UPDATES][LCT]\n[problem:SPOJ-DYNALCA] //DYNAMIC LCA\n[problem:Gym-100460C]\n[problem:Gym-100960H]\n[problem:SPOJ-DYNACON1]\n[problem:CodeForces-892E] [7] [VERY NICE] //By prices .. LCT\n### lis\n[problem:UVA-231]\n[problem:UVA-10131]\n[problem:UVALive-2931]\n[problem:SPOJ-NDS]\n[problem:UVA-481]\n[problem:SPOJ-ELIS]\n[problem:UVA-497]\n[problem:UVA-11790]\n[problem:SPOJ-ALTSEQ] 3 //solvable by FW in Nlog[N]\n[problem:SPOJ-VISIBLEBOX] [4] //with multiset\n[problem:SPOJ-DOSA] [5]\n[problem:SPOJ-CODERE3] 3 //Low bounds LIS/LDS\n[problem:SPOJ-BRDGHRD] 4 //lis [nondecreasing]\n[problem:SPOJ-GONESORT] 4 //Permutation-lis + riddle statement\n[problem:CodeForces-847B] 4 //Multiple Lis\u0027s\n[problem:CodeForces-67D] [4] //[NICE][DOUBLE REMAP]\n### matching\n[problem:SPOJ-ADAPATH]\n[problem:SPOJ-ADACITY]\n[problem:SPOJ-ADAPLNTS]\n[problem:Gym-101666E] //[NICE][GEOMETRY][BINARY SEARCH][PROBABILITY]\n[problem:SPOJ-MATCHING] //Raw [no sauce]\n[problem:CodeForces-116B] [3] //Low cons. Can be done without algo\n[problem:UVALive-6234] Tile Cut [LA]\n[problem:UVA-10080] II [UVA] //Easy sympathic\n[problem:UVA-11419] I AM [UVA] //Grid-Matching\n[problem:Gym-101485E] [Elementary Math E] //Very nice principal [not that hard]\n[problem:UVALive-3673] Grid [UVA] //Grid\n[problem:UVA-12927] Cover [UVA]\n[problem:UVALive-6851] The Programmers [LA]\n[problem:UVALive-6887] Club //NICE\n[problem:UVALive-6571] Can Be Arranged\n[problem:UVA-12530] of Tiles\n[problem:Gym-100820A] [Airport A] //Nice one\n[problem:Gym-100753B] [Bounty Hunterr II B] //VERY NICE I refered multiple times to this principal\n \n[problem:Gym-101408C] [Cat vs Dog C]\n[problem:LightOJ-1171] Knights in Chessboard [II] [LOJ] //Classical chess\n[problem:UVA-12644]\n[problem:Gym-101047H]\n[problem:CodeForces-659E]\n[problem:UVA-12972] Challenge [UVA]\n[problem:UVA-1201] Cab Scheme [UVA]\n[problem:UVA-12963] Nitidiflorus\n[problem:UVALive-6525] Attacking rooks [LA]\n[problem:UVALive-3415] Guardian of Decency [LA]\n[problem:UVA-12159] Fight [UVA]\n[problem:CodeChef-CHEFYODA] //Imho matching is not the crucial part here\n[problem:UVA-12831] the Builder\n[problem:CodeForces-831D]\n[problem:UVA-11262] Fence\n[problem:UVA-12549] Robots\n[problem:UVA-11138] and Bolts\n[problem:CodeForces-727D] 4\n[problem:UVA-11985] [5]\n[problem:SPOJ-AMR12A] [5] //VERY NICE goophers + bonus\n[problem:SPOJ-NITT4] [4] //VERY NICE [Chessboard matching]\n[problem:SPOJ-SCPC11H] [4]//NICE Match those which fits inside\n### matrix\n[problem:UVA-12045] [4]\n### matrix_exponentiation\n[problem:SPOJ-ADAMONEY]\n[problem:UVA-13284] [4] //[NICE][BITMASK][DP] Classical\n[problem:CodeForces-147B] [5] //[NICE][BS][GRAPHS]\n[problem:CodeForces-107D] [5] //[NICE][DP]\n[problem:UVA-12653]\n[problem:LightOJ-1131]\n[problem:UVA-12470]\n[problem:CodeForces-696D]\n[problem:HackerRank-gp-on-fibonacci-matrix] \n[problem:HackerRank-degree-diameter-on-trees] \n[problem:LightOJ-1052]\n[problem:CodeChef-KBIGNUMB]\n[problem:LightOJ-1160]\n[problem:LightOJ-1096]\n[problem:UVA-11486]\n[problem:CodeForces-718C]\n[problem:LightOJ-1070]\n[problem:LightOJ-1132]\n[problem:CodeForces-621E]\nProject Euler #114: Counting block combinations I\n[problem:CodeForces-821E]\n[problem:UVA-12593]\n[problem:CodeChef-SHAIKHGN] //Not exactly but similar principle\n[problem:UVA-11551] [4]\n[problem:UVA-11486] [5]\n[problem:UVA-10743] [5] //A001169 [easy multi / hard to come with recurence]\n[problem:CodeForces-821E] [6] //Not trivial to come-up with matrix\n[problem:SPOJ-DCEPCA06] [4] //NICE 10x10 matrix\n[problem:SPOJ-GSWORDS] [3] //NICE\u0026EASY 3-states \"OO,OX,XO\"\n[problem:SPOJ-TETRAHRD] [4] //Easy + Sum\n[problem:SPOJ-NACCI] [4] //Classical [N-Bonacci]\n[problem:SPOJ-JZPCIR] [5] //VERY NICE: A137726\n### mcmf\n[problem:SPOJ-ADAGROW]\n[problem:SPOJ-ADAFEAR]\n[problem:UVA-13288] Bleu [6] //[NICE][MATCHING]\n[problem:Gym-100800A] [Aqueduct Construction A]\n[problem:UVA-10806] Dijkstra.\n[problem:UVA-12944] Disaster\n[problem:UVA-12891] of Trading\n[problem:CodeChef-HOGON]\n[problem:CodeForces-863F] [5] //VERY NICE\n[problem:UVA-11613] [6]\n[problem:CodeForces-802C] [8] //Nice but hard to see + negative\n[problem:CodeForces-802N] [5] //Easy but faster MCMF needed\n[problem:CodeForces-818G] [6] //NICE + MUCH Faster MCMF\n[problem:SPOJ-BNMT] [7] //VERY NICE [some optimalisations needed + weird data set]\n[problem:CodeForces-884F] [6] //Alphabetical buckets\n### median\n[problem:CodeForces-713C] 7\n[problem:SPOJ-RMID2] 4\n[problem:SPOJ-RMID] 3 [as above just not so dynamic]\n[problem:SPOJ-EC_ESTA] 4 //classical dynamic median\n[problem:SPOJ-DCEPCA09] [6] //VERY NICE [MO +++ MEDIAN, MEAN, FREQ]\n### meet_in_middle\n[problem:CodeForces-912E] [5] //[VERY NICE][BS][2P][PRIMES]\n[problem:CodeForces-888E] [4] //NICE[EASY]\n[problem:CodeForces-51E] [6] //NICE[GRAPH][Cycles of length 5]\nhttps://devskill.com/CodingProblems/ViewProblem/245\nhttps://devskill.com/CodingProblems/ViewProblem/256\n[problem:UVA-11851] [5]\n[problem:UVA-11465] [5]\n[problem:UVA-13207] [4] //Straight-forward MIM\n[problem:SPOJ-COLOR_CC] [4] //VERY NICE div by partity [take lesser] → 8^6\n### MO\n[problem:SPOJ-ADAUNIQ] [Updates]\n[problem:SPOJ-ADANUM]\n[problem:SPOJ-ADAPEAR]\n[problem:SPOJ-ADAPHONE]\n[problem:SPOJ-ADAFTBLL] [Tree][Updates]\n[problem:SPOJ-FREQUENT]\n[problem:CodeForces-86D] [4] //[NICE][CLASSICAL]\n[problem:CodeForces-877F] [6] //[NICE][NORMALIZE]\n[problem:CodeForces-687D]\n[problem:CodeForces-617E]\n[problem:SPOJ-DCEPCA09]\n[problem:SPOJ-COT2]\n[problem:CodeChef-DISTNUM3] //Tree + Update\nhttps://toph.ws/p/distinct-dishting //Not sure if still working??\n[problem:CodeChef-CHEFNUMK]\nhttps://www.hackerearth.com/problem/algorithm/harry-gets-into-infy-1/description/\n[problem:SPOJ-COT] [7] //ON TREE [but very tight TLE]\n[problem:SPOJ-GOT] [5] //ON TREE\n[problem:SPOJ-CPAIR2] [4] //MO + Fenwick [VERY NICE]\n[problem:SPOJ-HRSIAM] [5] //With updates\n[problem:SPOJ-KDOMINO] [4] //NICE Frequencies\n### next\n[problem:UVA-13257] Plates UVA //Brute-Force 26^3 queries in O[1]\n[problem:CodeForces-92C] [3] //[VERY NICE]\n[problem:LightOJ-1157]\n[problem:CodeChef-ASTRING]\n[problem:SPOJ-MAIN8_E]\n[problem:CodeForces-701C]\n[problem:SPOJ-STRSEQ] //+DP\n[problem:CodeForces-762C]\n[problem:CodeForces-724D]\n[problem:SPOJ-SUBSN] //+BS\n[problem:HackerRank-short-palindrome] \n### np-hard\n[problem:SPOJ-ADACROW]\n[problem:SPOJ-ADAPARTY]\n[problem:SPOJ-ADAPARTI]\n[problem:Gym-101666G] //[NICE][BURTE FORCE][OBSERVATION][SUBSETS]\n[problem:CodeForces-907E] [5] //[VERY NICE][CLIQUE][DP]\n[problem:CodeForces-114B] [3] //[CLIQUE][BRUTE-FORCE]\n[problem:SPOJ-JOHNNY] //Not exact points\n[problem:SPOJ-TAKIN] [3] //[KNAPSACK][RECURSION]\n[problem:CodeForces-839E] [5] //NICE! Max-Clique\n[problem:UVALive-7743] [Similar to ADAPARTI] [8] //Parametrisation\n[problem:UVALive-7616] Cliques [4] //[NICE][CLIQUES][ELIMINATING-SETS]\n### number_rectangle\n[problem:UVA-10667] //Largest rectangle\n[problem:UVA-10074] //Largest rectangle\n[problem:UVA-836] //Largest rectangle\n[problem:UVA-1330] //Largest rectangle\n[problem:UVA-12192] 5\n[problem:CodeForces-729B] 2\n[problem:CodeForces-710C] 4\n[problem:UVA-11871] 6\n[problem:UVA-11617] [3]\n[problem:UVA-11573] [4]\n[problem:UVA-11499] [5]\n[problem:UVA-11230] [4]\n[problem:SPOJ-JOCHEF] [5] //NICE: Lagers rectange 0/1 O[N\\M]\n### number_theory\n[problem:SPOJ-ADAGCD] [+STL]\n[problem:SPOJ-ADAHACK]\n[problem:SPOJ-ADADUNG]\n[problem:SPOJ-ADACAROT]\n[problem:SPOJ-ADACON]\n[problem:SPOJ-ADATAXES]\n[problem:SPOJ-ADADIG]\n[problem:SPOJ-ADASETS]\n[problem:Gym-101808G] [4] //[GCD][IF][LCM]\n[problem:Gym-101666L] //[GREED][DP] Logarithms\n[problem:Gym-101666C] //[NICE][GCD]\n[problem:UVA-13287] Cake [2] //Rectangle\n[problem:Gym-101650G] //Graphs\n[problem:CodeForces-934D] [4] //Polynomials\n[problem:UVALive-8253] Boss Battle LA\n[problem:CodeForces-919E] [5] //[MODULAR-MATH]\n[problem:CodeForces-149B] [3] //Base to 10\n[problem:CodeForces-148B] [3] //[SIMULATION][math or bs]\n[problem:CodeForces-148A] [2] //[EASY][SIEVE][BRUTE-FOCE][LCM][IE]\n[problem:SPOJ-JGTLE] [3] //Sum reduction\n[problem:SPOJ-BAPM] [3] //Simple power / Observe, rare colisions\n[problem:CodeForces-911C] [2] //[Observation][Iff [or brute-froce]]\n[problem:CodeForces-133B] [2] //Bases + implementation\n[problem:CodeForces-129A] [1] //Parity\n[problem:CodeForces-124D] [4]\n[problem:CodeForces-125A] [1] //mod/div simple if\n[problem:CodeForces-902D] [4] //Polynomials / Fibonacci / Bitset\n[problem:CodeForces-899D] [4] //X99999 possibilities\n[problem:CodeForces-899C] [3] //[NICE][GREEDY KNAPSACK]\n[problem:CodeForces-899A] [1]\n[problem:CodeForces-898A] [1]\n[problem:Gym-101620F] [4] //[IFS][INVERSE][CASES]\n[problem:CodeForces-900D] [4] //[NICE][DIVISORS][GCD][IE]\n[problem:CodeForces-900B] [2] //Cycles or Brute-force + Division\n[problem:CodeForces-119A] [2] //[EASY][GCD]\n[problem:UVALive-8014] Pizza Party [4] //[NICE][OVERFLOW][LCM WITH SHIFT]\n[problem:UVALive-7629] [3] //One path is factorisation\n[problem:UVALive-8037] Service [2] //Sample formula\n[problem:UVALive-8085] [4] //[NICE][PRIMES/FACTORISATION/SIEVE]\n[problem:UVALive-6589] Obvious and the Rabbit-Man [7] //Sylvester\u0027s formula\n[problem:UVALive-6582] GCD [4] //[NICE] Data structures works too\n[problem:UVALive-8000] [1]\nhttps://devskill.com/CodingProblems/ViewProblem/421 [2] //6 buckets\n[problem:CodeForces-93E] [5] //[VERY NICE][DP][RECURSION]\n[problem:CodeForces-86A] [3] //[NICE] 50\\ is best [unless more digits]\n[problem:CodeForces-83D] [5] //[VERY NICE][PRIMES][BRUTE-FORE-2]\n[problem:CodeForces-82A] [2] //Simulation\n[problem:CodeForces-74C] [4] //gcd\n[problem:CodeForces-76E] [4] //Divide sumations [BF]\n[problem:CodeForces-71C] [3] //[EASY][NICE][BRUTE-FORCE][DIVISORS]\n[problem:CodeForces-70A] [2] //3^[N-1]\n[problem:CodeForces-43C] [2] //Moduly by 3 {0/2+min[1,2]}\n[problem:CodeForces-50A] [1] //[EASY]\n[problem:CodeForces-61C] [4] //Base conversion + roman\n[problem:UVA-355] //bases conversion\n[problem:UVALive-2559] //Base conversion\n[problem:CodeChef-COPRIME3] //Cyka mobius\n[problem:SPOJ-PSTR] //Cyka mobius\n[problem:CodeForces-803F] //Cyka mobius\nhttps://devskill.com/CodingProblems/ViewProblem/23\n[problem:CodeForces-731F] 4\n[problem:UVA-12031] [8]\n[problem:CodeForces-722F] [8]\n[problem:CodeForces-716C] 4\n[problem:CodeForces-711E] [8]\n[problem:CodeForces-710D] [6]\n[problem:UVA-13154] 7\n[problem:UVA-13166] 5\n[problem:UVA-11962] 2\n[problem:UVA-11718] 3\n[problem:UVA-11510] [5]\n[problem:UVA-11538] [3] //good one just math\n[problem:UVA-11556] [1]\n[problem:CodeForces-757E] [8]\n[problem:CodeForces-758F] [7]\n[problem:UVA-11481] [4]\n[problem:UVA-11237] [4] //Nice seems like knapsbag but it it not\n[problem:UVA-11155] [4] //Almost as previous problem\n[problem:UVA-11038] [3] //counting digits on interval\n[problem:CodeForces-763C] [7]\n[problem:UVA-11087] [4] //Sums of two numbers divisible with \\\u003c\u003d500 [10^5]\n[problem:CodeForces-678C] 2 //LCM\n[problem:CodeForces-665F] [8] //p^3 | p\\q\n[problem:SPOJ-LCMSUM] //Vzorec v knihovni?ce\n[problem:SPOJ-FRNDZND] [2] // [size 1 \u003d\u003d 1, else 0]\n[problem:SPOJ-EXPOR] //bit-by-bit [+ formula]\n[problem:SPOJ-FACTDIV] [5] //dyn-update of ans/factors GOOD\n[problem:SPOJ-PAIRDIV] [6] //cyka mobius \n[problem:SPOJ-FCDC] [4] //keep factorized factorial\n[problem:SPOJ-NTHPRIME] [7] // BS + NumPrime GOOD!!\n[problem:SPOJ-DIVFACT3] [7] // Sieve 10^8 + sqrt search\n[problem:SPOJ-DIVFACT4] [8] // Prime count\n[problem:CodeForces-776C] [4] //segments div. by number\n[problem:CodeForces-776E] [6] //vypsat cisla: f[N]\u003dPhi[N],g[N]\u003dN\n[problem:SPOJ-PHT] [2] //easy BS [NN+2N] mby math?\n[problem:SPOJ-GCDEX] [7] //OEIS A006579 enough [well imp]\n[problem:SPOJ-APS] [3] //just sieve + generate\n[problem:SPOJ-WPC5I] [3]//fc: C[a]!\u003dC[b]:F[a]^max[C[a],C[b]]\n[problem:SPOJ-SPEC_SET] N→N/k→N/k/k\n[problem:SPOJ-DCEPC11B] [5] //Wilson\u0027t theorem!\n[problem:SPOJ-FACTMULN] [5] //each f[i] /c[i] separately\n[problem:SPOJ-SPCM] [4] //just factorisation + prime check [10^12]\n[problem:SPOJ-TWOGAME] [5] //gcd \u003d\u003d Power of 3 \u003d\u003e YES\n[problem:SPOJ-MKEQUAL] [2] //Chceck if sum is divisible by N\n[problem:SPOJ-TIPTOP] [3] //sqrt[N]\u003d\u003dN? NICE!!\n[problem:SPOJ-PSYCHON] [4] // fast factorisation\n[problem:SPOJ-ENIGMATH] [1] // swap and div by gcd\n[problem:SPOJ-SNGPG] [3] // prime gen + check\n[problem:CodeForces-795A] [2] //brute-force\n[problem:CodeForces-801E] [6] //NICE! Clique-DAG + inversion\n[problem:CodeForces-798C] [4] //GCD \u003d\u003d at the beginning OR 2\n[problem:CodeForces-803C] [3] //Only \"low\" K and just divisors\n[problem:UVA-10830] //simple add 2→ sqrt[N] + their mirrors\n[problem:CodeForces-817A] [2] //check division + parity\n[problem:UVA-13209] [3] //Simple simulation of division [+states rememberance]\n[problem:CodeForces-834C] [4] //Has cube-root + both num divisible by cuberoot\n[problem:CodeForces-837E] [5] //Factorisation + GCD attributes\n[problem:SPOJ-SUMMATION] [3] //Number contribution: 2^[N-1]\n[problem:SPOJ-SECTORS] [4] //Odd len OR sum of odd indices \u003d\u003d sum of even\n[problem:SPOJ-IITKWPCM] [6] //VERY NICE Gauss\u0027s generalisation of Wilsons Theorem\n[problem:SPOJ-UCV2013A] [4] //N\\[N^L-1]/[N-1]\n[problem:SPOJ-KIMO1] [4] //NICE Adding/Subing by modulus\n[problem:SPOJ-AFS2] [4] //Sum of divisort [sqrt[N]] [+128int]\n[problem:SPOJ-FUNNUMS] [4] //Permutations [get ith + guess ith]\n[problem:SPOJ-MAY99_3] [3] //GCD\n[problem:SPOJ-PUCMM334] [3] //Classical hats problem\n[problem:SPOJ-LCPC11B] [4] //Factorize + count all subsets\n[problem:SPOJ-THREENUMBERS] [2] //EASY \u0026 NICE [lcm]\n[problem:SPOJ-GAMES] [2] //EASY\u0026NICE Go discrete [by 10^k] → 10^k/GCD\n[problem:SPOJ-SUBSHARD] [4] //dig\\10^sufix\\[choose sufix]\\^Prefix [VERY NICE]\n[problem:SPOJ-INVDIV] [6] //Sum of divisors function + factorisation [NICE]\n[problem:SPOJ-JNEXT] [2] //EASY Zah?íva?ka pro prváky\n[problem:SPOJ-TSHOW1] [3] //NICE Almost as binary repre with 5/6\n[problem:CodeForces-859B] [2] //Easy by iteration\n[problem:CodeForces-861A] [2] //5,2 division [EASY]\n[problem:SPOJ-ABA12D] [4] //NICE Formula for sum divisors Prod[Sum[fac-powers]]\n[problem:SPOJ-MAIN74] [3] //Fibo\u0027s\n[problem:SPOJ-NOSQ] [3] //Sieve + Digit check\n[problem:SPOJ-SQUAREV1] [3] //NICE [but dumb code limit]\n[problem:CodeForces-597A] [1] //Simple if+2\\Divide\n[problem:SPOJ-STREETR] [3] //Easy [GCD]\n[problem:SPOJ-HPYNOSII] [3] //\\\u003c\u003d1000 after first move\n[problem:SPOJ-HPYNOS] [1] //Same as above 1 number\n[problem:SPOJ-IITD4] [3] //Brute-force [sieve-like]\n[problem:SPOJ-GIRLSNBS] [2] //Some easy formula\n[problem:SPOJ-GUESSTHE] [2] //NICE [EASY][LCM]\n[problem:CodeForces-867B] [2] //NICE [observation][1 2]\n[problem:SPOJ-NDIVPHI] [4] //NICE Multiple of lowest primes [BIG-INT]\n[problem:SPOJ-NDIVPHI2] [5] //NICE Same as above [bigger constraints]\n[problem:CodeForces-6A] [1] //Triangle check [4 pts]\n[problem:CodeForces-869B] [1] //Answer is usually 0\n[problem:CodeForces-9C] [2] //Bases [2→ 10]\n[problem:CodeForces-20B] [2] //Ax^2+Bx+C\u003d0 [find roots]\n[problem:CodeForces-27E] [5] //[VERY NICE]: Factorisation+Recursion\n[problem:CodeForces-32C] [3] //DSU works too\n[problem:CodeForces-872C] [3] //NICE Compose of 4 [mby one 6 or 9]\n[problem:CodeForces-876B] [3] //Group by modulo\n### observation\n[problem:SPOJ-ADABANKET] //Observation [but Stoer-Wagner works too]\n[problem:CodeForces-922C] [3] //Note that K is always very low\n[problem:CodeForces-912B] [2] //Bits/XOR\n[problem:CodeForces-911D] [3] //[VERY NICE]\n[problem:CodeForces-902E] [5] //[VERY NICE] //LCT works too\n[problem:UVALive-7589] a Sequence [3] //Print from back and then real\n[problem:Gym-101630A] [6] //[NICE][STL]\n[problem:CodeForces-122B] [1] //just 4 or 7\n[problem:CodeForces-116E] [6] //[NICE][COMBINATORICS][FIND ANY]\n[problem:CodeForces-892D] [4] //NICE [SORTING]\n[problem:CodeForces-897E] [5] //[NICE][SET] //2 will beat all\n[problem:UVALive-7730] begin or not to begin [3] //Parity\n[problem:CodeForces-122D] [4] //[NICE] Sweep /OR/ cycle\n[problem:CodeForces-128D] [6] //Normalize + Sweeps\n### oeis\n[problem:UVALive-6591] [2] //2^N-1\n[problem:UVA-12004] 2\n[problem:UVA-11273] 5 //https://oeis.org/A001088\n[problem:UVA-11077] 3 //https://oeis.org/A094638\n[problem:SPOJ-VECTAR5] 3 //https://oeis.org/A038721\n[problem:SPOJ-ESYRCRTN] 2 //generate and see\n[problem:SPOJ-IITWPC4B] 3 //http://oeis.org/A005044\n[problem:SPOJ-POLCONST] [4] //A003401+Fermat Number [Prime]\n[problem:SPOJ-CUTCAKE] [3] // pattern [1 22 333 4444 55555]\n[problem:UVA-10872] 3 //Alcuin\u0027s Sequence\n[problem:SPOJ-LOVINGPW] [3] //A000788\n[problem:SPOJ-CBANK] [3] //A000292 Tetrahedral numbers\n[problem:SPOJ-GUMATH2] [4] //A000240 Modulo by MOD\\2\n[problem:SPOJ-MATHII] [4] //A006218 [Two formulas \u003d\u003e sqrt[N]]\n[problem:SPOJ-KOPC12B] [4] //A002457 [factorial + factorial modular]\n[problem:SPOJ-YUMMY] [4] //A006534\n[problem:SPOJ-ADV04B1] [5] //A001850\n[problem:SPOJ-FLWRS] [4] //A002464\n[problem:SPOJ-RANJAN02] [3] //A024023\n[problem:SPOJ-BOMARBLE] [2] //A000326\n[problem:CodeForces-57C] [4] //A045992\n[problem:CodeForces-918A] [1] //Fibo\n### offline\n[problem:SPOJ-ADARAIN]\n[problem:SPOJ-ADARAINB]\n[problem:SPOJ-ADAROBOT]\n[problem:Gym-101840I] //[NICE][PREPROCESS]\n[problem:CodeForces-816B] //Easier ST\n[problem:UVA-11266] [6] //slightly knapsack || [NICE]\n[problem:CodeForces-761F] [7]\n[problem:SPOJ-UPDATEIT] [2] //basic method\n[problem:UVA-13189] [4] //simulation + sort queries\n[problem:SPOJ-HAYBALE] [3] //Basic sum + sort [segment tree would work too]\n[problem:Gym-101597] H [6] //Offline 2D sum + geometry\n### palindromes\n[problem:Gym-101806Q] [4] //[HASHING][PALINDROMIC-TREE]\n[problem:CodeForces-897B] [2] //Palindromic numbers [EASY][FIRST]\n[problem:CodeForces-883H] [3] //Make as least odd as possible\nhttp://code-festival-2017-qualc.contest.atcoder.jp/tasks/code_festival_2017_qualc_c [3] //Similar to remove-dp, but greedy\nhttp://code-festival-2017-qualc.contest.atcoder.jp/tasks/code_festival_2017_qualc_d [4] //DP with greedy thinking\n[problem:CodeForces-59C] [3] //Implementation [constructive]\n[problem:UVA-13092] //manacher\n[problem:SPOJ-MSUBSTR] //manacher\n[problem:UVA-11888] //manacher\n[problem:HackerRank-circular-palindromes] //manacher\n[problem:UVA-12378] //manacher\n[problem:HackerRank-challenging-palindromes] //SA\n[problem:SPOJ-NUMOFPAL] //Palindromic Tree\n[problem:CodeForces-245H] //# of palindromes [DP]\n[problem:SPOJ-ANAGR] 2 //frequency + palindromes\n[problem:SPOJ-AMR12D] [1] //Palindrome check //Zahrivacka pro prvaky\n[problem:CodeForces-835D] //Hashing\n[problem:CodeForces-137D] [4] //[NICE][DP]\n### patter-matching\n[problem:UVA-11019] [5]\n### permutations\n[problem:CodeForces-137B] [1] //Frequency + size\n[problem:CodeForces-136A] [1] //Permutation cycles\n[problem:CodeForces-844C] 3 //NICE Permutations in array\n[problem:CodeForces-48D] [3] //NICE [frequency array]\n[problem:CodeForces-56B] [2] //Restore from 1 reverse [EASY]\n[problem:CodeForces-122D] [5] //NICE [BRUTE-FORCE] //ONLY BACK MATTERS\n### persistent_segment_tree\n[problem:CodeForces-893F] [6] //[VERY NICE][EULER TOUR]\n[problem:CodeForces-813E] [6] //Easy but hard data structure\n### preprocess\n[problem:SPOJ-ADAPLUS]\n[problem:SPOJ-ADASQR] [Monotone Queue]\n[problem:Gym-101889L] //[NICE][PREFIX SUM][BINARY SEARCH]\n[problem:CodeForces-120D] [3] //But maybe work naively ?!\n[problem:CodeForces-48B] [2] //2D Prefix Sum [BF prolly works too]\n[problem:CodeForces-761F]\n[problem:UVA-10360] //2D Prefix Sum\n[problem:UVA-983] //2D Prefix Sum\n[problem:CodeForces-777C] [4] //NICE\n[problem:CodeForces-818C] [4] //Prefix Sum\n[problem:CodeForces-834B] [2] //26 queries NICE rozehrivacka pro prvaky\n[problem:SPOJ-RANGESUM] [4] //NICE: Offline [delta] + Prefix Sum\n[problem:SPOJ-RANDG] [3] //NICE [but too low bounds] [PrefixSum] [Try all indexes]\n[problem:SPOJ-HARSHAD] [3] //Sieve + simple function\n[problem:SPOJ-PUCMM210] [3] //Number theory [thinking not necessary]\n[problem:SPOJ-BCAKE] [3] //Prefix sum of rectangle + N^4\n[problem:SPOJ-PAIRSUM] [4] //VERY NICE Prefix sum + Prefix PW sum\n[problem:SPOJ-MAIN111] [3] //Sieve + Brute Force [answer in O[1]]\n[problem:SPOJ-PLUSEVI] [4] //NICE There are not many of them\n[problem:CodeForces-18C] [2] //Prefix sum End\u003d\u003d2\\i\n[problem:CodeForces-873B] [2] //Search for same prefix [+/-1]\n[problem:CodeForces-33C] [4] //Prefix sum + Sweep from back + sweep from front\n[problem:CodeForces-872B] [3] //Sweep from both sides [RMQ works too]\n### prime-count\n[problem:SPOJ-NTHPRIME]\n[problem:SPOJ-DIVFACT4]\n[problem:CodeForces-665F]\n[problem:CodeChef-CNTPRIME]\n[problem:SPOJ-SUMPRIM1]\n[problem:SPOJ-SUMPRIM2] [NO hard]\n[problem:HackerRank-euler010] //easy\n### prime-testing\n[problem:SPOJ-ADAGIFT]\n[problem:SPOJ-PON]\n[problem:SPOJ-DAYOUT2C] [EASY]\nProject Euler #60: Prime pair sets\nProject Euler #58: Spiral primes\nProject Euler #131: Prime cube partnership\nhttps://devskill.com/CodingProblems/ViewProblem/229\nhttps://devskill.com/CodingProblems/ViewProblem/327\n[problem:Gym-100753K] [2015 German Collegiate Programming Contest [GCPC 15] + POI 10-T3]\nProject Euler #130: Composites with prime repunit property\n[problem:SPOJ-ABA12A] [3]\n[problem:UVA-10871] [3] //Easy fermat not necessary\n[problem:SPOJ-POP1] [4] //Fast primality testing [or somehow]\n[problem:SPOJ-POP2] [5] //NICE same as above [yet with ll]\n[problem:SPOJ-POP3] [6] //same as above [yet with big]\n[problem:SPOJ-DCEPC203] [6] //NICE [optimalisation]\n[problem:SPOJ-PRIMPERM] [4] //NICE [next_perm + sieve]\n### probability\n[problem:Gym-101726B] [4] //[NICE][DP][BRUTE-FORCE]\nhttps://www.devskill.com/CodingProblems/ViewProblem/470 [3] //Brute Force\n[problem:UVALive-8262] Knockout Tournament [4] //[NICE][SIMULATION] //Might not be working on LA [but on CF y]\n[problem:CodeForces-912D] [4] //[VERY NICE][EXPECT][DIJKSTRA]\n[problem:CodeForces-908D] [5] //[DP][MATH][INVERSION]\n[problem:UVALive-7821] [4] //[EASY][DP]\n[problem:Gym-101620G] [5] //[VERY NICE][DIJKSTRA][EXPECTED VALUE]\n[problem:CodeForces-110D] [4] //[NICE][COMBINATORICS]\n[problem:CodeForces-108D] [4] //[NICE][SIMPLE][COMBINATORICS]\n[problem:UVALive-7619] the Dice Roll [5] //[NICE][AHO][MATRIX EXPO]\n[problem:UVALive-7998] [3] //Math works too [probability][DP]\n[problem:LightOJ-1104] //Birthday Paradox\n[problem:Gym-101064K] [2016 USP Try-outs] //Birthday Paradox\n[problem:UVA-11762] [5]\n[problem:UVA-11427] [5]\n[problem:UVA-11348] [2]\n[problem:CodeForces-768D] [4] //With DP\n[problem:SPOJ-IITWPC4J] [4] //with DP\n[problem:UVA-10828] [5] //Nice problem but bad statemend: Expected value of visits MC\n[problem:UVA-10777] [4] //NICE yet solvable with DP\n[problem:CodeForces-839C] [3] //NICE \u0026 Easy \u003d\u003e Tree\n[problem:SPOJ-ZCR] [3] //Easy [+DP]\n[problem:SPOJ-IITKWPCN] [2] //Easy Odd/Eve [black balls]\n[problem:CodeForces-846F] [5] // Expected number of unique elements\n[problem:SPOJ-BTCODE_H] [4] //DP [but main GROW is idea]\n[problem:CodeForces-867D] [5] //VERY NICE [DP]\n[problem:CodeForces-24D] [5] //VERY NICE [DP]+[TIME]\n[problem:CodeForces-28C] [4] //VERY NICE [DP]\n### recursion\n[problem:UVALive-8255] Dunglish LA //Finding all possibilities\n[problem:CodeForces-915C] [4] //[NICE][DP-works-too][GREEDY]\n[problem:CodeForces-134B] [4] //Number Theory\n[problem:CodeForces-897C] [4] //+Slightly [DP]\n[problem:UVALive-6585] [4] //[NICE][BACKTRACK][DFS]\n[problem:CodeForces-68D] [5] //[NICE] Keep max and kill branches\n[problem:UVA-536] //Tree from dfs\n[problem:UVA-12347] //BST from preorder\n[problem:SPOJ-GOC11A] 4\n[problem:UVA-13170] [7] //heavy implementation but NICE!\n[problem:UVA-10854] [3] //if/else\n[problem:CodeForces-31D] [4] //[NICE] Brute-force by recursion\n[problem:CodeForces-36B] [2] //[NICE][SIMPLE]\n### RMQ\n[problem:CodeForces-514D] //+BS\n[problem:CodeForces-872B]\n[problem:SPOJ-TNVFC1M]\nhttps://devskill.com/CodingProblems/ViewProblem/19\n[problem:CodeForces-713D] 6\n[problem:CodeForces-675E] 5\n[problem:SPOJ-POSTERIN] 5 //VERY NICE Delete all minimas\n[problem:SPOJ-RPLN] [3] //RMQ only\n[problem:SPOJ-CITY2] [4] //RMQ + MAP [NICE][VAGUE STATEMENT]\n[problem:SPOJ-DIFERENC] [4] //Solve separately [linear D\u0026C]\n[problem:CodeForces-863E] [4] //OR some Queue / sorting\n[problem:CodeForces-5C] [4] //NICE many other options\n[problem:CodeForces-15D] [5] //VERY NICE 2D RM [sliding-windw][monotone-queue]\n[problem:CodeForces-873E] [5] //[NICE][Brute-Force + RMQ]\n### rope\n[problem:SPOJ-AROPE] 4\n[problem:SPOJ-AROPE2] 5 //same as above [+time]\n### scc\n[problem:SPOJ-ADAPANEL] [combinatorics]\n[problem:CodeForces-427C] proposed by unofficial10\n[problem:CodeForces-894E] [5] //[NICE][DP]\nhttps://devskill.com/CodingProblems/ViewProblem/79\n[problem:UVA-11838]\n[problem:UVA-247]\n[problem:UVA-13057]\n[problem:UVA-12645]\n[problem:UVA-11770]\n[problem:UVA-12926]\n[problem:UVA-11324]\n[problem:UVA-11709]\n[problem:UVA-12745]\n[problem:SPOJ-TFRIENDS] [4] //just scc size\n[problem:SPOJ-CAPCITY] [4] //scc destination [WEAK TC]\n[problem:CodeForces-22E] [5] //[NICE][make it strongly connected][SRC\u003eDST]\n### segment_tree\n[problem:SPOJ-ADABERRY] [+TREAP]\n[problem:Gym-101741J] [6] //[NICE][COMBINATORICS]\n[problem:CodeForces-914D] [5] //[NICE][GCD][LOG]\n[problem:CodeForces-915E] [5] //[VERY NICE][UNLIMITED]\n[problem:CodeForces-145E] [5] //[NICE] //Bit swap + subsequence\n[problem:SPOJ-ADAGF]\n[problem:SPOJ-ADATREE]\n[problem:CodeForces-911G] [7] //Segment tree over queries\n[problem:CodeForces-895E] [5] //[PRECISION]\n[problem:CodeForces-52C] [4] //Easy [MIN]+[INCREASE]\n[problem:CodeForces-56E] [5] //[NICE][NORMALIZE][MAX]\n[problem:CodeForces-877E] [5] //[VERY NICE][EULER TOUR TREE]\nhttps://devskill.com/CodingProblems/ViewProblem/283\nhttps://devskill.com/CodingProblems/ViewProblem/315\n[problem:CodeForces-756C]\n[problem:CodeForces-739C] [8]\n[problem:CodeForces-718C] [8]\n[problem:CodeForces-750E] [7]\n[problem:CodeForces-759C] [7]\n[problem:UVA-11165] [5]\n[problem:CodeForces-763E] [8] //VERY NICE [non-trivial]\n[problem:SPOJ-BGSHOOT] [5] //normalize then easy\n[problem:SPOJ-KGSS] [4]\n[problem:CodeForces-765F] [7] //VERY NICE CASCADE\n[problem:SPOJ-GSS1] [5] //Idea then easy\n[problem:SPOJ-KQUERYO] [5] //Seg-tree of vectors\n[problem:CodeForces-633G] [8] //EulerTree+Seg+Bitset\n[problem:SPOJ-NAJ0001] [7] //10^8 int memory [and worked]\n[problem:SPOJ-PRMQUER] [5] //2 segment trees + sieve\n[problem:SPOJ-EC_DIVS] [5] //dunno if intended\n[problem:SPOJ-DCEPC11I] [5] //NICE 1,2,3,4,5,.. inc\n[problem:SPOJ-QUE2] [4] //kth number\n[problem:CodeForces-785E] [6] //Seg+Treap [and faster]\n[problem:CodeForces-786B] [6] //+Dijkstra\n[problem:UVA-13183] [6] //Merge-Sort-Tree [dunno]\n[problem:CodeForces-121E] [7] //Dunno done by vectorisation\n[problem:CodeForces-803G] [5] //VERY NICE!! ST 10^9 + ST/RMQ 10^5\n[problem:CodeForces-794F] [7] //Digit by digit! [N\\log[N]\\100 ]\n[problem:CodeForces-811E] [6] //VERY NICE DSU [easier Timofey + animals]\n[problem:CodeForces-817F] [7] //10^18 + MEX NICE yet problematic\n[problem:CodeForces-816B] [3] //Or offline trick makes it easier\n[problem:CodeForces-834D] [5] //+Dynamic Programming | NICE\n[problem:SPOJ-SBO] [5] //preLast→ last [-1], last→ now [+1] VERY NICE\n[problem:SPOJ-GOODE] [5] //NICE: Inversion + L-Mex\n[problem:SPOJ-CNTPRIME] [3] //ST+Sieve [short range]\n[problem:SPOJ-SEGSQRSS] [4] //NICE {weak data} SQRT works too\n[problem:SPOJ-MON2012] [5] //NICE [Online][10^9 Range]\n[problem:SPOJ-PARSUMS] [4] //But other approaches work too\n[problem:SPOJ-THRBL] [4] //Simple SA maximum on range \\\u003c\u003d A[a]\n[problem:SPOJ-HORRIBLE] [3] //Totally classical\n[problem:SPOJ-MULTQ3] [4] //NICE [interesting operation]\n[problem:SPOJ-PERMPATT] [4] //NICE [minimum][+IDEA]\n[problem:CodeForces-869E] [5] //NICE 2D [random][XOR]\n[problem:CodeForces-19D] [5] //NICE [+BS][+SET] {bs not necessary}\n### sequences\n[problem:UVA-11885] 7 //Previous problem requested for statement\n[problem:UVA-11522] 3 //Trick low numbers only :P\n### sieve\n[problem:SPOJ-ADAPRIME]\n[problem:CodeForces-114E] [5] //[NICE][FAST THINGS NEEDED][SEGMENTED]\n[problem:CodeForces-58B] [3] //[NICE][GREEDY][LEAST PRIME FACTOR]\nProject Euler #134: Prime pair connection //Segmented\n[problem:UVA-11610] [5]\n[problem:UVA-11353] [3]\n[problem:SPOJ-TDPRIMES] [4]\n[problem:SPOJ-VECTAR8] [3]\n[problem:SPOJ-NFACTOR] [4]\n[problem:SPOJ-HS08PAUL] [4] //simply generate\n[problem:CodeForces-776B] [3] //Easy trict: PM-1/ELSE-2\n[problem:SPOJ-GGD] [4] // N/lowestDiv\\[lowestDiv-1]\n[problem:CodeForces-822D] [4] //DP + Lowest factor\n[problem:SPOJ-NGIRL] [4] //Squares Primes + BS \u003d\u003d Easiest\n[problem:SPOJ-PTRI] [5] //Very fast sieve necessary:/\n[problem:SPOJ-AFS] [3] //Sum of divisort + DP\n[problem:SPOJ-BSPRIME] [4] //Very fast sieve needed\n[problem:SPOJ-DCEPC505] [4] //NICE at most 10527450\n[problem:SPOJ-CUBEFR] [3] //NICE Sieve out k^3 numbers\n[problem:SPOJ-PRIMES2] [8] //VERY NICE Some hell-shit optimizing\n[problem:CodeForces-26A] [2] //Easy many ways to solve it\n### simulation\n[problem:Gym-101650A] //[VERY NICE][TREAP][PROBABILITY]\n[problem:Gym-101650K] //[NICE] //Perhaps weak TC\nhttps://abc084.contest.atcoder.jp/tasks/abc084_c [3] //Brute-Force\n[problem:CodeForces-908B] [2] //[EASY][NICE]\n[problem:CodeForces-141B] [3] //[NICE][IF-PARTY]\n[problem:UVALive-7921] Motion [4] //Simulate in sqrt\n[problem:UVALive-7691] Apples [3]\n[problem:UVALive-7977] Key to Cryptography [2]\n[problem:CodeForces-129B] [2] //Graph\n[problem:CodeForces-903B] [2] //[NICE]\n[problem:CodeForces-120C] [1]\n[problem:CodeForces-118A] [1]\n[problem:UVALive-8012] Fraud [1]\n[problem:CodeForces-897A] [1] //BF do as they say\n[problem:UVALive-7985] Traffic [4] //FINE We have whole time-lapse\n[problem:UVALive-7988] Shop [3] //Do as they say. Trivial but not bad.\n[problem:UVALive-7703] Digits [2] //Simple simulate what they ask for\n[problem:CodeForces-893A] [1] //Easy but nice\n[problem:CodeForces-102B] [2] //Do as they write log-convergence\n[problem:CodeForces-92A] [1] //Way too easy\n[problem:CodeForces-88C] [3] //[NUMBER THEORY]\n[problem:CodeForces-84D] [4] //Priority queue by min\\size\n[problem:CodeForces-79A] [1] //Simulate rules\n[problem:CodeForces-879A] [1] //Iterate day-by-day\n[problem:CodeForces-879B] [3] //Either at most N^2 or the biggest element [NICE]\n[problem:CodeForces-879D] [4] //[NICE][Array elimination]\n[problem:CodeForces-46A] [2] //[EASY][MODULO]\n[problem:CodeForces-46B] [3] //[EASY][SEARCH-EACH-QUERY]\n[problem:CodeForces-55A] [2] //Simple [long] simulation\n[problem:CodeForces-60A] [1] //Moving LR bounds\n[problem:UVA-12187] [2]\n[problem:CodeForces-724C] 5\n[problem:CodeForces-746C] 3\n[problem:UVA-11093] [2]\n[problem:CodeForces-768C] [4]\n[problem:SPOJ-WRONG] [5] //VERY NICE precalculate from back, then go from front\n[problem:CodeForces-864C] [4] //Not nice just iffs\n[problem:SPOJ-WAGE] [3] //Simple Game Of Life Modification\n[problem:CodeForces-6C] [2] //Simple simulate from both sides\n[problem:CodeForces-9B] [2] //Simulate what is given [+ doubles]\n[problem:CodeForces-11B] [3] //sqrt[X] [diff must be even]\n[problem:CodeForces-30A] [2] //Simply simulate process [-1000→ 1000]\n### sorting\n[problem:SPOJ-ADATOMAT]\n[problem:SPOJ-ADAUSORT]\n[problem:SPOJ-ADACUT]\n[problem:SPOJ-ADAHLIA]\n[problem:Gym-101726E] [3] //[STRUCTURES][IMPLEMENTATION]\n[problem:UVA-13282] McCakeFace [3] //Brute Force\n[problem:UVALive-8260] Apps [4] //[NICE] //Sorting + some DP\n[problem:CodeForces-922D] [3] //[NICE][GREEDY][EASY]\n[problem:CodeForces-920C] [3] //[EASY] Sortable by parts\n[problem:CodeForces-913D] [4] //[NICE][BS][2P][FW]\n[problem:CodeForces-149A] [2] //Sorting|Greedy\n[problem:SPOJ-SEUG] [2] //Bad statement\n[problem:CodeForces-141A] [2] //Or frequency\n[problem:CodeForces-137E] [4] //[NICE][PREFIX SUM MATCHING]\n[problem:CodeForces-137C] [4] //[NICE][FENWICK WORKS TOO]\n[problem:CodeForces-136C] [3] //Last to 1[2] |OR| first to INF\n[problem:UVALive-7601] [3] //Greedy\n[problem:UVALive-7673] a Simple Research [2] //[EASY][IMPLE]\n[problem:CodeForces-108B] [2] //Easy \u0026 Adjacent\n[problem:UVALive-8025] Cups [2] //Sorting+input\n[problem:CodeForces-892A] [2] //[EASY][SUM]\nhttps://www.urionlinejudge.com.br/judge/en/problems/view/2290 [3] //Sort+check [fast]\n[problem:CodeForces-81C] [3] //MATH[Lesser\u003dgreater][comparator]\n[problem:CodeForces-53D] [3] //Bubble sort\n[problem:CodeForces-58D] [4] //[BUCKET][GREEDY][STRING]\n[problem:UVA-10810] //INV\n[problem:UVA-11858] //INV\n[problem:CodeForces-645B] //INV\n[problem:UVA-10327] //INV\n[problem:SPOJ-BUBBLESORT] //INV\n[problem:UVA-11495] //INV [GAME]\n[problem:SPOJ-CODESPTB] //INV\n[problem:UVA-13212] //INV\n[problem:CodeForces-749E] //INV\n[problem:UVA-12189] [3]\n[problem:UVA-12196] [4]\n[problem:CodeForces-731D] 7\n[problem:UVA-11925] [4]\n[problem:UVA-11979] [3]\n[problem:CodeForces-747D] [4]\n[problem:UVA-11890] [4]\n[problem:SPOJ-KAOS] [4] //INV GOOD problem!!!!\n[problem:SPOJ-KSMALL] [5] //fast sort /or/ quick-select\n[problem:SPOJ-RKS] [3] //use map\n[problem:SPOJ-SPCJ] [4] //reverse + go from back\n[problem:CodeForces-785B] [2] //last-first + vice versa\n[problem:CodeForces-798D] [4] //Take 1st then take best B of every pair [sort by A]\n[problem:CodeForces-810B] [2]\n[problem:CodeForces-810C] [3] //+Math\n[problem:CodeForces-814A] [1] //Pro prváky but nice observation\n[problem:CodeForces-817B] [3] //Frequency of TOP 3\n[problem:UVA-10769] [3] //Sadly N^4 passes\n[problem:UVA-13208] [4] //Sort + Prefix Sum\n[problem:UVA-13212] [3] //Number of inversions\n[problem:CodeForces-831C] [3] //NICE ~ Check all \"add\" against first\n[problem:CodeForces-831D] [4] //Can be solved with BS+Max-Match\n[problem:CodeForces-841C] [3] //NICE match greatest to lowest\n[problem:CodeForces-845C] [2] //EASY pro prvaky\n[problem:SPOJ-HSHW] [4] //Test every big/low pair + big/big low/low on +/-\n[problem:SPOJ-CODESPTB] [3] //Count inversions [BASIC]\n[problem:CodeForces-863B] [2] //Sort and omit 2\n[problem:SPOJ-AMR10G] [2] //Easy yet NICE\n[problem:CodeForces-12C] [2] //Very simple\n[problem:CodeForces-16B] [1] //[EASY]\n[problem:CodeForces-22D] [3] //Sort by begin + sweep\n[problem:CodeForces-23C] [3] //Take them by pairs + add last\n[problem:CodeForces-24B] [3] //Simple follow the rules\n[problem:CodeForces-27B] [3] //Compare number of victories\n[problem:CodeForces-27C] [4] //[NICE] Find next bigger/lesser [sort]\n### spanning_tree\n[problem:CodeForces-908F] [5] //[VERY NICE] //Not exactly MST but similar[GREEDY]\n[problem:CodeForces-125E] [5] //[BS]\n[problem:CodeForces-76A] [4] //[VERY NICE] Sort by A and KEEP spanning + one edge\n[problem:UVALive-6622] Absurdistan Roads [4] //Plus one edge\n[problem:UVA-12176]\n[problem:UVA-10600]\n[problem:UVA-10724]\n[problem:HackerRank-johnland] \n[problem:UVA-11710]\n[problem:Gym-101252C] [2014-2015 CT S02E05: Codeforces Trainings Season 2 Episode 5 2009-2010 ACM-ICPC]\n[problem:Gym-101047I] [2015 USP Try-outs][HARD]\n[problem:UVA-11183] [Directed]\n[problem:LightOJ-1101]\n[problem:CodeChef-CHEFELEC]\n[problem:UVA-10307]\n[problem:CodeForces-598D]\n[problem:CodeForces-32C]\n[problem:CodeForces-744A]\nhttps://devskill.com/CodingProblems/ViewProblem/344\n[problem:UVA-908] Computer Sites [UVA]\n[problem:UVA-1208] [UVA]\n[problem:UVA-1235] Brute Force Lock [UVA]\n[problem:UVA-10034] [UVA]\n[problem:UVA-11228] system [UVA]\n[problem:UVA-11631] roads [UVA]\n[problem:UVA-11733] [UVA]\n[problem:UVA-11747] Cycle Edges [UVA]\n[problem:SPOJ-BLINNET] [3]\n[problem:UVA-11183] [4] //Directed [need to know algo!]\n[problem:SPOJ-ULM09] [3] //Sum-Kruskal\n[problem:SPOJ-IITKWPCG] [4] //VERY NICE [log instead of price]\n[problem:CodeForces-17B] [3] //Spanning tree [no dsu]\n### spfa\n[problem:LightOJ-1074]\n[problem:UVA-1171]\n[problem:UVA-11478]\n[problem:UVA-12768]\n[problem:UVA-11478] [5]\n### sqrt\n[problem:Gym-101889D] //[NICE][STL]\n[problem:CodeForces-916D] [6] //[NICE][BS][BINARY-LIFTING]\n[problem:UVA-12003] 7\n[problem:UVA-11990] [5]\n[problem:SPOJ-GIVEAWAY] [7] //SQRT + BS \u003e [or Seg+Trie]\n[problem:CodeForces-786C] [5] //Nsqrn [bg] + sqrSegs [end]\n[problem:CodeForces-840D] [5] //NICE Either frequent OR brute-force\n[problem:CodeForces-13E] //VERY NICE [SQRT-BLOCK UPDATE/JUMP]\n[problem:CodeForces-85D] [4] //NICE [ST shall work too]\n### stl\n[problem:SPOJ-ADABASET] [IO-testing][ARRAY]\n[problem:SPOJ-ADALIST] [ROPE]\n[problem:SPOJ-ADAFIELD] [SET]\n[problem:SPOJ-ADAQUEUE]\n[problem:SPOJ-ADAFRIEN]\n[problem:CodeForces-920B] [3] //[NICE][QUEUE][SIMPLE]\n[problem:CodeForces-911E] [4] //[NICE][STACK][SET]\n[problem:CodeForces-909D] [4] //[VERY NICE][SIMULATION][GROUP]\n[problem:CodeForces-899E] [4] //[VERY NICE][SET]\nhttps://arc087.contest.atcoder.jp/tasks/arc087_a [2] //Map\n[problem:CodeForces-903C] [2] //Map\n[problem:CodeForces-900C] [3] //[NICE][SET]\n[problem:CodeForces-112A] [1] //tolower [trivial]\n[problem:UVALive-3396] [2] //Getline, letters identification\n[problem:CodeForces-81A] [2] //Stack OR string\n[problem:CodeForces-78A] [1] //fgets + imple\n[problem:CodeForces-69E] [3] //NICE [2POINTERS][SET][MAP]\n[problem:SPOJ-RMID] //Dynamic Median\n[problem:SPOJ-RMID2] //Dynamic Median\n[problem:CodeForces-713C] //Dynamic Median\n[problem:SPOJ-EC_ESTA] //Dynamic median\n[problem:CodeForces-799B] [2] //EASY MAP\n[problem:CodeForces-808D] [3] //MAP\n[problem:UVA-10887] //string + map\n[problem:UVA-10730] //Easy with hash-map\n[problem:CodeForces-821C] [3] //STACK [vector] Nice+Easy\n[problem:SPOJ-SOLVEIT] [3] //Set + lower_bound\n[problem:SPOJ-IITKWPCA] [2] //Set + getline\n[problem:CodeForces-849D] [5] //Queue\n[problem:SPOJ-CRAN02] [4] //Map [+Math]\n[problem:SPOJ-MAX_NUM] [4] //Queue [possibly multiple ways]\n[problem:SPOJ-SID] [5] //Sort + Vector [or similar] [strict TLE]\n[problem:SPOJ-RPLD] [2] //Map of sets\n[problem:CodeForces-861D] [4] //unordered map of sets\n[problem:SPOJ-FACEFRND] [2] //Set or Bitset\n[problem:SPOJ-HACKRNDM] [3] //Easy map\n[problem:CodeForces-847K] [4] //NICE Map+Queue\n[problem:CodeForces-855A] [1] //set\n[problem:CodeForces-4C] [2] //map+string\n[problem:CodeForces-5E] [6] //iffs + RMQ+BS+SET [or other sol]\n[problem:CodeForces-44A] [1] //Set + pair\n[problem:CodeForces-45C] [4] //NICE Handling with sets\n[problem:CodeForces-918B] [2] //[MAP] //TLDR\n### strings\n[problem:CodeForces-909A] [1] //Lexicographical comparision [EASY]\n[problem:UVALive-7948] Strings [2] //Brute-force\n[problem:UVALive-7892] of Matchings [6] //No idea heuristic works but seems to be nice\n[problem:UVALive-8017] and Sonu Generate Strings [5] //[NICE][DP] //+Something: Trie/SA/SET...?\n[problem:CodeForces-890D] [4] //[NICE][SET][SORTING][26][BRUTE-FORCE]\n[problem:CodeForces-43B] [2] //Frequency\n[problem:CodeForces-50B] [2] //Frequency + Power\n[problem:SPOJ-MINMOVE] [3] //Minimal lexicographical rotation\n[problem:SPOJ-BWHEELER] //Burrows Wheeler\n[problem:SPOJ-EDIST] //Edit Distance\n[problem:UVALive-3189] //Edit Distance\n[problem:HackerRank-minimum-transformation-cost] //Edit Distance\n[problem:Gym-101492L] //Laevenstein Distance\n[problem:UVA-13068] //Lexicographically lowest rotation\n[problem:UVALive-2755] //Lexicographically lowest rotation\n[problem:LightOJ-1073] //Lexicographically Shortest Superstring\n[problem:CodeForces-762C] 5\n[problem:SPOJ-LCS0] 10 //LCS\n[problem:SPOJ-IITWPC4H] 2 //Frequence array\n[problem:UVA-13186] [6] //Bitset + Trie ~ NICE [6-7 mby?]\n[problem:CodeForces-798B] [2] //Brute-force .. pro prváky\n[problem:UVA-10745] [4] //Frequency [N^2 possible if efficient!!]\n[problem:CodeForces-822B] [2] //Easy pro prvaky [slightly imple.]\n[problem:CodeForces-828C] [4] //+Sorting [process only necessary!]\n[problem:CodeForces-832B] [3] //Naive compare back+front [+freq]\n[problem:SPOJ-STC04] [5] //Next + pairs O[N\\26] [frist look O[26^2\\N]]\n[problem:SPOJ-IITKWPCJ] [4] //GCD or HASHING\n[problem:SPOJ-SUBSN] [4] //Next [NICE bad input]:\n[problem:SPOJ-BOGGLE] [2] //EASY [MAP][STREAM]\n[problem:SPOJ-MAIN8_E] [4] //VERY NICE Next function\n[problem:SPOJ-STRMATCH] [3] //Nice matching, yet low constraints on \"N\"\n[problem:SPOJ-FINDSR] [3] //Clever bruteforce works here [NlogN]\n[problem:CodeForces-39J] [2] //Simple iteration over string\n[problem:CodeForces-876E] [4] //Compare from back + make fail-pairs\n### suffix_array\n[problem:SPOJ-ADAPHOTO] [or hashing after turboanalisis]\n[problem:SPOJ-ADASTRNG]\n[problem:Gym-101889M] //[VERY NICE][OBSERVATION]\n[problem:Gym-101840B] //[NICE][ST][BIT][LCP]\n[problem:CodeForces-129D] [4] //[NICE] //Suffix Automaton / Brute Force works too\n[problem:CodeForces-123D] [5] //[NICE][RMQ][D\u0026C]\n[problem:UVALive-8086] Sorting [7] //[VERY NICE][RMQ][BS][PST]\n[problem:UVALive-7702] //6 [VERY NICE][RMQ][BS][FW]\n[problem:UVALive-7701] music //8 [VERY NICE][RMQ][SEARCH][OPTI] //WRONG TIME-LIMIT\u003d\u003dOPTI\nhttps://www.urionlinejudge.com.br/judge/en/problems/view/1530 //7 [VERY NICE][RMQ][SET][OFFLINE]\nhttps://www.urionlinejudge.com.br/judge/en/problems/view/2000 [5] //Basic disubstr counting\n[problem:UVA-760] //LCS\n[problem:UVA-1227] //LCS\n[problem:SPOJ-LCS] //LCS\n[problem:UVA-11512]\n[problem:UVALive-7502]\n[problem:Gym-100923D] [2015 ACM National Contest Romania Round 1]\n[problem:UVA-1254]\n[problem:UVA-12191]\n[problem:UVA-12206]\n[problem:CodeChef-INSQ16F]\n[problem:UVALive-3943]\n[problem:UVA-11107]\n[problem:UVA-12974]\n[problem:UVA-10526]\nDavos and Reading [INSOMNIA] //Awesome problem but can\u0027t find link [hard] non of regular judges\n[problem:UVA-12338]\nhttps://devskill.com/CodingProblems/ViewProblem/328\n[problem:UVA-12191] 5\n[problem:SPOJ-SARRAY] 3\n[problem:UVALive-4513] 6\n[problem:SPOJ-LCS2] 7 // must be linear [SA+LCP+MQ]\n[problem:CodeForces-802I] 7 //NICE! SA+LCP+[Segmentree/queue]\n[problem:SPOJ-LONGCS] //5 LCS of multiple strings [NICE]\n[problem:SPOJ-SUBLEX] //5 VERY NICE: Kth substring\n[problem:CodeForces-873F] //6 VERY NICE: SA+Histogram\n[problem:CodeForces-30E] //7 VERY NICE: [many other sols: Manach/KMP/HASH...]\n[problem:UVALive-6856] of digits //7 [VERY NICE]\n### ternary_search\n[problem:LightOJ-1146]\n[problem:Gym-101482G] [2014-2015 Northwestern European Regional Contest [NWERC 2014]]\n[problem:Gym-101309D] [2010-2011 ACM-ICPC Northeastern European Regional Contest [NEERC 10]]\n[problem:UVA-13010] //+Dijkstra\n2015-2016 CTU Open Contest: Chasing the Cheetah\n[problem:UVA-12197] [4]\n[problem:SPOJ-KOPC12A] [4] //TS [sadly brute-force works too N^2]\n### topo\n[problem:UVA-11686]\n[problem:LightOJ-1034]\n[problem:UVA-10305]\n[problem:UVA-124] Orders [UVA]\n[problem:UVA-200] Order [UVA]\n[problem:UVA-872] [UVA]\n[problem:UVA-11060] [UVA]\n[problem:CodeForces-765E] 5\n[problem:CodeForces-770C] 4 //reduce + toposort\n[problem:CodeForces-825E] 4 //Toposort from biggest/backward\n[problem:SPOJ-CODESPTI] [6] //VERY NICE Hard/Weak children\n[problem:CodeForces-47B] [2] //[EASY][Toposort on 3 elements]\n[problem:CodeForces-909E] [4] //[NICE][BFS][RECURSION]\n### treap\n[problem:CodeForces-899F] [5] //[VERY NICE][DATA STRUCTURE] [FW or Treap]\n[problem:CodeForces-879E] [6] //[VERY NICE][Making somponents]\n[problem:SPOJ-ADAAPHID] [or clever fenwick][or SQRT-tree]\n[problem:SPOJ-ADACROP]\n[problem:CodeForces-762E] 6\n[problem:SPOJ-COUNT1IT] 5\n[problem:SPOJ-IITWPC4D] 4 //From end pick i-th + del i-th\n[problem:SPOJ-ALLIN1] 4 //Typical treap operations\n[problem:CodeForces-847D] 5 //Prolly overkill VERY NICE\n[problem:CodeForces-863D] 4 //Not desired solution\n[problem:SPOJ-KOILINE] [4] //VERY NICE Iterate from back get+remove\n[problem:SPOJ-TWIST] [5] //NICE: Reverse\n[problem:SPOJ-MEANARR] [5] //VERY NICE! [POLICY][SHORT]\n### tree\n[problem:SPOJ-ADATOMEL]\n[problem:CodeForces-913B] [2] //Simple check\n[problem:CodeForces-894D] [5] //[NICE][MERGING][BINARY]\n[problem:CodeForces-746G] 5\n[problem:CodeForces-750F] 9\n[problem:SPOJ-RTREE] 3 //longest path tree query\n[problem:UVA-13175] [2] //something like preorder build\n[problem:CodeForces-796C] [3] //Just counting inc by at most 2\n[problem:CodeForces-797D] [4] //VERY NICE sort + D\u0026C all\n[problem:CodeForces-805E] [4] //NICE Treewidth coloring [greedy]\n[problem:CodeForces-828D] [3] //Star construction\n[problem:SPOJ-TREEDEGREE] [3] //Degree from euler tree\n[problem:SPOJ-UCV2013J] [3] //Find what is leaf in Binary Tree\n[problem:SPOJ-GCPC11J] [3] //Finding ceter\n[problem:CodeForces-34D] [3] //Simple reconstruction + DFS\n### tree-dp\n[problem:SPOJ-ADASALES]\n[problem:SPOJ-PT07X] [4] //Classical- VC on tree [NICE]\n[problem:CodeForces-81E] [6] //[NICE][PSEUDOFOREST REDUCTION]\n[problem:CodeForces-61D] [4] //dfs-only might works too\n[problem:UVALive-6631] Jingle Balls [4] //[NICE][SIMPLE]\n[problem:CodeChef-TRANDED] //By sahil070197\n[problem:UVA-13089] Coins [UVA]\n[problem:CodeForces-855C]\n[problem:CodeForces-718D]\n[problem:CodeChef-TWOCOINS]\n[problem:HackerRank-road-maintenance] \n[problem:UVALive-7649] Performance Review [LA]\n[problem:CodeForces-741D]\n[problem:CodeForces-592D]\n[problem:CodeChef-TOMJERGA]\n[problem:CodeForces-814D]\n[problem:UVA-1220] at Hali-Bula [UVA]\n[problem:HackerRank-r-tree-decoration] \n[problem:UVA-12452] vs. Zombies HD SP [UVA]\n[problem:CodeForces-735E]\n[problem:CodeChef-COLTREE]\n[problem:UVA-12466] [UVA]\n[problem:UVALive-6829] Intrepid climber [LA]\n[problem:HackerRank-jeanies-route] \n[problem:UVA-12257] Queue [UVA]\n[problem:CodeForces-805F]\n[problem:CodeForces-763D]\n[problem:UVA-1218] Service\n[problem:UVALive-3346] Domination on Trees [same as above ]\n[problem:UVA-12093] Zonk\n[problem:UVA-10859] Lampposts\n[problem:CodeForces-23E] //NICE [but requires big int]\n[problem:CodeForces-14D] [5] //NICE [sorting-one][2DFS]\n[problem:SPOJ-TWOPATHS] [6] //VERY NICE Same as above ~ bigger constraints\n[problem:CodeForces-868E] [8] //VERY NICE HARD on tree\n### trie_bit\n[problem:CodeForces-888G] [5] //NICE[BIT-BY-BIT D\u0026C]\n[problem:CodeForces-842D] //Proposed by usernameson\n[problem:CodeForces-706D]\n[problem:HackerRank-black-box-1] \nhttps://csacademy.com/contest/round-42/task/xor-submatrix/\n[problem:CodeForces-714C] 5\n[problem:SPOJ-SUBXOR] [4]\n[problem:CodeForces-817E] [5] //Classical remember sum! NICE!\n[problem:CodeForces-37C] [4] //NICE Prefix dictionary [or math]\n### trie_string\n[problem:SPOJ-ADAINDEX]\n[problem:UVALive-8015] and Bob play Contact [5] //[VERY NICE] 1stBob\n[problem:UVALive-2642]\n[problem:UVA-10860]\n[problem:UVA-10295]\n[problem:UVA-13186] //+Bitset\n[problem:UVA-1123]\n[problem:UVA-12506]\n[problem:UVA-11539]\n[problem:UVA-1142]\n[problem:UVA-12359]\n[problem:UVA-10282]\n[problem:UVA-11732] [5]\n[problem:UVA-11539] [5]\n[problem:UVA-11488] [4]\n[problem:SPOJ-TRYCOMP] [4]\n[problem:UVA-10860] [4] //DP + Trie [nice slightly generic]\n[problem:SPOJ-DICT] [4] //Sample trie but slightly weak/wrong data-set\n### TSP\nhttps://www.urionlinejudge.com.br/judge/en/problems/view/2810 [5] //[NICE][DOUBLE]\n[problem:Gym-100818E] [2015-2016 ACM-ICPC Southeastern European Regional Programming Contest [SEERC 2015]]\n[problem:UVALive-3725]\n[problem:UVA-10496]\n[problem:Gym-101020H] [2015 Syrian Private Universities Collegiate Programming Contest] N!\n[problem:LightOJ-1057]\n[problem:UVA-11643] //[NICE][BFS]\n[problem:UVALive-3305] //On plane\n[problem:UVA-10937] [4] //find \u0027!\u0027 / BFS / TSP NICE!\n[problem:UVA-10944] [4]\n[problem:UVA-10818] [5] //Easy but not-easy implementation: ++Dijkstra [LEX!]\n[problem:SPOJ-A_W_S_N] [4] //BFS + TSP [path] NICE\n### two-pointers\n[problem:SPOJ-ADAFENCE] [Multiple Pointers]\n[problem:SPOJ-ADAPLANT]\nDev Skills-499: Closest Pair Point [4] //[NICE][GEOMETRY][STRUCTURES]\n[problem:CodeForces-919C] [3] //Similar simple sweep [EASY]\n[problem:CodeForces-144C] [3] //[NICE][FREQUENCY][STRINGS]\n[problem:CodeForces-895B] [3] //[OR BS]\n[problem:CodeForces-84B] [2] //EASY //ll\n[problem:CodeForces-79C] [4] //NICE [STRINGS][SET][COMPARE]\n[problem:CodeForces-746F] 6\n[problem:UVA-11436] [5]\n[problem:CodeForces-760D] 4\n[problem:UVA-11386] [4]\n[problem:SPOJ-WOWSUBSTR2] 3\n[problem:SPOJ-ARRAYSUB] 4\n[problem:SPOJ-CODFURY] 3 //easy ukazkove\n[problem:CodeForces-769B] 3 //sort + TP\n[problem:CodeForces-814C] 4 //NICE maybe some DP +/-\n[problem:SPOJ-CRAN04] 4 //NICE [more or less] 3 pointers\n[problem:SPOJ-OPCPIZZA] 3 //NICE [EASY] [AGAINS EACH OTHER]\n[problem:SPOJ-ALIEN] [3] //Classical\n[problem:SPOJ-HOTELS] [3] //Classical \u0026 Easy\n[problem:SPOJ-KOIREP] [4] //VERY NICE N buckedt find mid diff\n[problem:CodeForces-6E] [4] //NICE Multiset\n[problem:CodeForces-873C] [3] //NICE M times 2P tenchique\n### wavelet_tree\n[problem:UVA-1480]\n[problem:SPOJ-ILKQUERY]\n[problem:CodeForces-840D] //Proposed by GreenGrape\n### Zfunction\n[problem:CodeChef-CHSTR] //Proposed by Apptica\n[problem:SPOJ-SUFEQPRE]\n[problem:CodeForces-126B]\n[problem:CodeForces-119D] [7] //[VERY NICE]\n### 2SAT\n[problem:UVA-11930] [4]\n[problem:CodeForces-776D] [5]\n","threadId":38057,"likeCnt":86,"createTime":1540902526000,"isWorkbook":true,"viewCnt":33433,"openness":2,"fav":false,"id":711,"trustable":false}