From 4dd79fab040d6464911803304dd2bf954d98c08e Mon Sep 17 00:00:00 2001 From: Aditya Paliwal Date: Tue, 27 Feb 2018 17:46:34 +0530 Subject: [PATCH 1/4] Updated problem data and problem ratings as per 27th Feb 2018 12:16 PM GMT --- .gitignore | 1 + ui/problem_data.csv | 771 +++++++++++++++++++++++++++++++++++++++++ ui/problem_ratings.csv | 485 ++++++++++++++++++++++++++ 3 files changed, 1257 insertions(+) create mode 100644 .gitignore diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..15584ca --- /dev/null +++ b/.gitignore @@ -0,0 +1 @@ +.pyc diff --git a/ui/problem_data.csv b/ui/problem_data.csv index 9aece5c..4630ded 100644 --- a/ui/problem_data.csv +++ b/ui/problem_data.csv @@ -3408,3 +3408,774 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 712,Codeforces Round #370 (Div. 2),2,Memory and De-Evolution,1500.0,C,1473525900,"[greedy, math]",PROGRAMMING 712,Codeforces Round #370 (Div. 2),2,Memory and Scores,2250.0,D,1473525900,"[combinatorics, dp]",PROGRAMMING 712,Codeforces Round #370 (Div. 2),2,Memory and Casinos,2500.0,E,1473525900,"[data structures, math, probabilities]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and his Company,500.0,A,1519058100,[brute force],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and the Gates,750.0,B,1519058100,[implementation],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fifa and Fafa,1250.0,C,1519058100,[geometry],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Alphabet,1750.0,D,1519058100,"[math, probabilities]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Mathematics,2250.0,E,1519058100,"[dp, trees]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Array,2750.0,F,1519058100,[data structures],PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Love Triangle,500.0,A,1518861900,"[brute force, implementation]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Hamster Farm,1000.0,B,1518861900,[implementation],PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Convenient For Everybody,1500.0,C,1518861900,"[binary search, two pointers]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Love Rescue,2000.0,D,1518861900,"[dfs and similar, dsu]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Maximize!,2500.0,E,1518861900,"[binary search, greedy, ternary search, two pointers]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Cutlet,2750.0,F,1518861900,"[data structures, dp]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Word Correction,,A,1518793500,[implementation],PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Run For Your Prize,,B,1518793500,[brute force],PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Constructing Tests,,C,1518793500,"[binary search, brute force]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Buy a Ticket,,D,1518793500,"[data structures, graphs, shortest paths]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Max History,,E,1518793500,"[combinatorics, math]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Erasing Substrings,,F,1518793500,"[bitmasks, dp, greedy]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Shortest Path Queries,,G,1518793500,"[bitmasks, data structures, graphs]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindromic Supersequence,500.0,A,1518705300,[constructive algorithms],PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Recursive Queries,1000.0,B,1518705300,"[data structures, dfs and similar]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Permutation Cycle,1500.0,C,1518705300,"[brute force, constructive algorithms]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Tree,2000.0,D,1518705300,"[binary search, dp, trees]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Team Work,2500.0,E,1518705300,"[combinatorics, dp]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Escape Through Leaf,2500.0,F,1518705300,"[data structures, dp, geometry]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindrome Partition,3000.0,G,1518705300,"[dp, strings]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Twisty Movement,500.0,A,1518609900,"[data structures, dp]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Determined Cleanup,750.0,B,1518609900,[math],PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Colourful Prospect,1500.0,C,1518609900,[geometry],PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Creative Cutout,2250.0,D,1518609900,"[brute force, combinatorics, math]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Preponderant Reunion,2500.0,E,1518609900,"[constructive algorithms, dp]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Compatible Pair,500.0,A,1518609900,[brute force],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Prosperous Lot,1000.0,B,1518609900,[implementation],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Twisty Movement,1500.0,C,1518609900,"[brute force, dp]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Determined Cleanup,2000.0,D,1518609900,[math],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Colourful Prospect,2500.0,E,1518609900,[],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Cloning Toys,500.0,A,1518023700,[implementation],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Magic Forest,1000.0,B,1518023700,[brute force],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Cave Painting,1250.0,C,1518023700,"[brute force, number theory]",PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Robot Vacuum Cleaner,1500.0,D,1518023700,"[greedy, sortings]",PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Birds,2000.0,E,1518023700,[dp],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Divisibility,2750.0,F,1518023700,"[constructive algorithms, dp, greedy, number theory]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Water The Garden,,A,1517582100,[implementation],PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tea Queue,,B,1517582100,[implementation],PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Swap Adjacent Elements,,C,1517582100,"[dfs and similar, greedy, sortings, two pointers]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tanks,,D,1517582100,"[dp, greedy, implementation]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Connected Components?,,E,1517582100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,SUM and REPLACE,,F,1517582100,"[brute force, data structures, number theory]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,List Of Integers,,G,1517582100,"[binary search, bitmasks, brute force, combinatorics, math, number theory]",PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-1,,01,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-2,,02,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-3,,03,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-4,,04,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-5,,05,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-6,,06,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-7,,07,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-8,,08,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-9,,09,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-10,,10,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-11,,11,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-12,,12,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-13,,13,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-14,,14,1517500800,[],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Supermarket,500.0,A,1517403900,[greedy],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Perfect Number,750.0,B,1517403900,"[binary search, brute force, dp, implementation, number theory]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Seat Arrangements,1000.0,C,1517403900,[implementation],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Substring,1500.0,D,1517403900,"[dfs and similar, dp, graphs]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Congruence Equation,2000.0,E,1517403900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,A Game With Numbers,2500.0,F,1517403900,"[games, graphs]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,The Monster,500.0,A,1517236500,[greedy],PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,MADMAX,750.0,B,1517236500,"[dp, games, graphs]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Pollywog,1500.0,C,1517236500,[dp],PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Stranger Trees,2000.0,D,1517236500,"[dp, math, matrices, trees]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Upside Down,2750.0,E,1517236500,"[data structures, string suffix structures, strings, trees]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Eleven,500.0,A,1517236500,[implementation],PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Radio Station,1000.0,B,1517236500,[implementation],PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,The Monster,1500.0,C,1517236500,"[data structures, greedy]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,MADMAX,1750.0,D,1517236500,"[dfs and similar, dp, games]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Pollywog,2500.0,E,1517236500,[],PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Perfect Squares,500.0,A,1516462500,"[implementation, math]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Conan and Agasa play a Card Game,1000.0,B,1516462500,"[games, greedy]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Travelling Salesman and Special Numbers,1500.0,C,1516462500,"[brute force, combinatorics, dp]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Bash and a Tough Math Puzzle,2000.0,D,1516462500,"[data structures, number theory]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Palindromes in a Tree,2500.0,E,1516462500,"[bitmasks, divide and conquer, trees]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Substrings in a String,3000.0,F,1516462500,"[bitmasks, brute force, string suffix structures, strings]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Sum the Fibonacci,3500.0,G,1516462500,"[bitmasks, divide and conquer]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Ember and Storm's Tree Game,3750.0,H,1516462500,"[combinatorics, dp, games, trees]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Alarm Snooze,500.0,A,1516372500,"[brute force, implementation]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Binary Sequence (changed after round),1000.0,B,1516372500,"[bitmasks, greedy]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Interesting Graph,1500.0,C,1516372500,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and To-do List,2250.0,D,1516372500,"[data structures, trees]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Tree,2500.0,E,1516372500,"[data structures, trees]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Garden,,A,1515848700,[implementation],PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Browser,,B,1515848700,[implementation],PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Permute Digits,,C,1515848700,"[dp, greedy]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Almost Acyclic Graph,,D,1515848700,"[dfs and similar, graphs]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Physical Education Lessons,,E,1515848700,"[data structures, implementation, sortings]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Imbalance Value of a Tree,,F,1515848700,"[data structures, dsu, graphs, trees]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Coprime Arrays,,G,1515848700,"[math, number theory]",PROGRAMMING +913,Hello 2018,12,Modular Exponentiation,500.0,A,1515422700,[implementation],PROGRAMMING +913,Hello 2018,12,Christmas Spruce,750.0,B,1515422700,"[implementation, trees]",PROGRAMMING +913,Hello 2018,12,Party Lemonade,1000.0,C,1515422700,"[bitmasks, dp, greedy]",PROGRAMMING +913,Hello 2018,12,Too Easy Problems,1250.0,D,1515422700,"[binary search, brute force, data structures, greedy, sortings]",PROGRAMMING +913,Hello 2018,12,Logical Expression,1750.0,E,1515422700,"[bitmasks, dp, shortest paths]",PROGRAMMING +913,Hello 2018,12,Strongly Connected Tournament,2250.0,F,1515422700,"[dp, graphs, probabilities]",PROGRAMMING +913,Hello 2018,12,Power Substring,3000.0,G,1515422700,"[math, number theory]",PROGRAMMING +913,Hello 2018,12,Don't Exceed,3500.0,H,1515422700,"[math, probabilities]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Tricky Alchemy,500.0,A,1515162900,[implementation],PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,New Year's Eve,1000.0,B,1515162900,"[bitmasks, constructive algorithms]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,"Perun, Ult!",1750.0,C,1515162900,"[brute force, greedy, sortings]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Fishes,2000.0,D,1515162900,"[data structures, probabilities]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Prime Gift,2500.0,E,1515162900,"[binary search, dfs and similar, math, meet-in-the-middle, number theory, two pointers]",PROGRAMMING +908,Good Bye 2017,12,New Year and Counting Cards,500.0,A,1514562000,[implementation],PROGRAMMING +908,Good Bye 2017,12,New Year and Buggy Bot,750.0,B,1514562000,"[brute force, implementation]",PROGRAMMING +908,Good Bye 2017,12,New Year and Curling,1000.0,C,1514562000,"[brute force, geometry, implementation, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Arbitrary Arrangement,1750.0,D,1514562000,"[dp, math, probabilities]",PROGRAMMING +908,Good Bye 2017,12,New Year and Entity Enumeration,1750.0,E,1514562000,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Rainbow Roads,2000.0,F,1514562000,"[graphs, greedy, implementation]",PROGRAMMING +908,Good Bye 2017,12,New Year and Original Order,2750.0,G,1514562000,"[dp, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Boolean Bridges,3500.0,H,1514562000,[],PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Nearest Minimums,,A,1514469900,[implementation],PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Two Cakes,,B,1514469900,"[binary search, brute force, implementation]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Three Garlands,,C,1514469900,"[brute force, constructive algorithms]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Inversion Counting,,D,1514469900,"[brute force, math]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Stack Sorting,,E,1514469900,"[data structures, implementation]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Tree Destruction,,F,1514469900,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Mass Change Queries,,G,1514469900,[data structures],PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Generate Login,500.0,A,1514392500,"[brute force, greedy, sortings]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Segments,1000.0,B,1514392500,"[constructive algorithms, math]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Python Indentation,1500.0,C,1514392500,[dp],PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Colorful Points,1750.0,D,1514392500,"[data structures, greedy, implementation]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Coprocessor,2000.0,E,1514392500,"[dfs and similar, dp, graphs, greedy]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,AND-permutations,2500.0,F,1514392500,[constructive algorithms],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Masha and Bears,500.0,A,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Tic-Tac-Toe,1000.0,B,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Shockers,1500.0,C,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Seating of Students,2250.0,D,1514037900,[constructive algorithms],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Party,2250.0,E,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Power Tower,3000.0,F,1514037900,[],PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Shockers,500.0,A,1514037900,[implementation],PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Seating of Students,1250.0,B,1514037900,"[brute force, constructive algorithms, math]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Party,1250.0,C,1514037900,"[bitmasks, brute force, dp, graphs]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Power Tower,2000.0,D,1514037900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Reverses,2500.0,E,1514037900,"[dp, string suffix structures, strings]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Masha and Bears,500.0,A,1514037900,"[brute force, implementation]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Tic-Tac-Toe,1000.0,B,1514037900,[implementation],PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Shockers,1500.0,C,1514037900,"[bitmasks, implementation]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Seating of Students,2250.0,D,1514037900,[],PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Party,2250.0,E,1514037900,"[bitmasks, dp]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Power Tower,3000.0,F,1514037900,[],PROGRAMMING +910,Testing Round #14 (Unrated),12,The Way to Home,500.0,A,1513940700,"[dfs and similar, dp, greedy]",PROGRAMMING +910,Testing Round #14 (Unrated),12,Door Frames,1000.0,B,1513940700,"[greedy, implementation]",PROGRAMMING +910,Testing Round #14 (Unrated),12,Minimum Sum,1500.0,C,1513940700,[greedy],PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Hashing Trees,500.0,A,1513697700,"[constructive algorithms, trees]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,GCD of Polynomials,1000.0,B,1513697700,"[constructive algorithms, math]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Bipartite Segments,1750.0,C,1513697700,"[binary search, data structures, dfs and similar, dsu, graphs, two pointers]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Weighting a Tree,2000.0,D,1513697700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Cyclic Cipher,2500.0,E,1513697700,[fft],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Visiting a Friend,500.0,A,1513697700,[implementation],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Coloring a Tree,1000.0,B,1513697700,"[dfs and similar, dsu]",PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Hashing Trees,1500.0,C,1513697700,[],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,GCD of Polynomials,2000.0,D,1513697700,[math],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Bipartite Segments,2750.0,E,1513697700,"[data structures, dfs and similar]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Splitting in Teams,500.0,A,1513492500,[greedy],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Months and Years,1000.0,B,1513492500,[implementation],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Dividing the numbers,1500.0,C,1513492500,"[constructive algorithms, graphs]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Shovel Sale,1750.0,D,1513492500,[math],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Segments Removal,2250.0,E,1513492500,"[data structures, dsu, flows, two pointers]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Letters Removing,2500.0,F,1513492500,[data structures],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Rounding,500.0,A,1513424100,[implementation],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Proper Nutrition,750.0,B,1513424100,"[brute force, number theory]",PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Phone Numbers,1500.0,C,1513424100,"[implementation, strings]",PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Alarm Clock,1750.0,D,1513424100,[greedy],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Squares and not squares,2000.0,E,1513424100,[greedy],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Restoring the Expression,2500.0,F,1513424100,"[brute force, hashing, math]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Hungry Student Problem,,A,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,The Modcrab,,B,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Boxes Packing,,C,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Almost Difference,,D,1513091100,[math],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Swapping Characters,,E,1513091100,"[hashing, implementation, strings]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Clear The Matrix,,F,1513091100,"[bitmasks, dp]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Yet Another Maxflow Problem,,G,1513091100,"[data structures, flows]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Find Extra One,500.0,A,1513008300,[implementation],PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Position in Fraction,1000.0,B,1513008300,[math],PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Remove Extra One,1500.0,C,1513008300,"[brute force, data structures]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Unusual Sequences,2000.0,D,1513008300,"[bitmasks, combinatorics, dp, math, number theory]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Maximum Questions,2500.0,E,1513008300,"[data structures, dp, strings]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Nephren gives a riddle,500.0,A,1512223500,[dfs and similar],PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Ithea Plays With Chtholly,1000.0,B,1512223500,"[games, greedy]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,"Willem, Chtholly and Seniorious",1500.0,C,1512223500,[probabilities],PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Nephren Runs a Cinema,2000.0,D,1512223500,"[chinese remainder theorem, combinatorics, math, number theory]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,"Welcome home, Chtholly",2500.0,E,1512223500,"[data structures, dsu]",PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Scarborough Fair,500.0,A,1512223500,[implementation],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Chtholly's request,1000.0,B,1512223500,[brute force],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Nephren gives a riddle,1500.0,C,1512223500,"[combinatorics, math]",PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Ithea Plays With Chtholly,2000.0,D,1512223500,[implementation],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,"Willem, Chtholly and Seniorious",2500.0,E,1512223500,[],PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Pizza Separation,500.0,A,1511712300,[brute force],PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,XK Segments,1000.0,B,1511712300,"[binary search, sortings, two pointers]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Square Subsets,1750.0,C,1511712300,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,String Mark,2000.0,D,1511712300,"[combinatorics, math, strings]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Eyes Closed,2250.0,E,1511712300,"[data structures, probabilities]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Chess For Three,,A,1511449500,[implementation],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Beautiful Divisors,,B,1511449500,[brute force],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Rumor,,C,1511449500,[dfs and similar],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Credit Card,,D,1511449500,"[data structures, dp, greedy, implementation]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Counting Arrays,,E,1511449500,"[combinatorics, dp, number theory]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Subtree Minimum Query,,F,1511449500,"[data structures, trees]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,QAQ,500.0,A,1511099700,"[brute force, dp]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph And His Magic Field,1000.0,B,1511099700,"[combinatorics, math, number theory]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Marco and GCD Sequence,1500.0,C,1511099700,"[constructive algorithms, math]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph And His Tour in Binary Country,2000.0,D,1511099700,"[data structures, trees]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph and Mushrooms,2500.0,E,1511099700,"[dp, graphs]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Pride,500.0,A,1510929300,"[brute force, dp, greedy, math, number theory]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Gluttony,1000.0,B,1510929300,[constructive algorithms],PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Envy,1500.0,C,1510929300,"[data structures, dsu, graphs]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Sloth,2000.0,D,1510929300,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Lust,2500.0,E,1510929300,"[combinatorics, math]",PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Greed,500.0,A,1510929300,[implementation],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Wrath,1000.0,B,1510929300,"[implementation, two pointers]",PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Pride,1500.0,C,1510929300,[greedy],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Gluttony,2000.0,D,1510929300,[constructive algorithms],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Envy,2500.0,E,1510929300,[],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,ACM ICPC,500.0,A,1510502700,[brute force],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Petya and Catacombs,1500.0,C,1510502700,"[dsu, greedy]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Restoration of string,2000.0,D,1510502700,"[constructive algorithms, graphs, implementation]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Maximum Element,2500.0,E,1510502700,"[combinatorics, dp]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Symmetric Projections,3000.0,F,1510502700,[geometry],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Petya and Catacombs,500.0,A,1510502700,[greedy],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Restoration of string,1000.0,B,1510502700,"[dsu, graphs, strings]",PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Maximum Element,1500.0,C,1510502700,[dp],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Symmetric Projections,2000.0,D,1510502700,[geometry],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Mod Mod Mod,2250.0,E,1510502700,"[binary search, dp, math]",PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,ACM ICPC,500.0,A,1510502700,[],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Petya and Catacombs,1500.0,C,1510502700,[greedy],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Restoration of string,2000.0,D,1510502700,"[graphs, greedy, strings]",PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Maximum Element,2500.0,E,1510502700,[dp],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Symmetric Projections,3000.0,F,1510502700,[],PROGRAMMING +888,Educational Codeforces Round 32,12,Local Extrema,,A,1510239900,"[brute force, implementation]",PROGRAMMING +888,Educational Codeforces Round 32,12,Buggy Robot,,B,1510239900,"[dp, greedy]",PROGRAMMING +888,Educational Codeforces Round 32,12,K-Dominant Character,,C,1510239900,"[binary search, implementation, two pointers]",PROGRAMMING +888,Educational Codeforces Round 32,12,Almost Identity Permutations,,D,1510239900,"[combinatorics, dp, math]",PROGRAMMING +888,Educational Codeforces Round 32,12,Maximum Subsequence,,E,1510239900,"[bitmasks, divide and conquer, meet-in-the-middle]",PROGRAMMING +888,Educational Codeforces Round 32,12,Connecting Vertices,,F,1510239900,[dp],PROGRAMMING +888,Educational Codeforces Round 32,12,Xor-MST,,G,1510239900,"[bitmasks, constructive algorithms, data structures]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Div. 64,500.0,A,1509725100,[implementation],PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Cubes for Masha,1000.0,B,1509725100,[brute force],PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Solution for Cube,1500.0,C,1509725100,"[brute force, implementation]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Ratings and Reality Shows,2000.0,D,1509725100,"[data structures, two pointers]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Little Brother,2500.0,E,1509725100,"[binary search, geometry]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Row of Models,3000.0,F,1509725100,[],PROGRAMMING +884,Educational Codeforces Round 31,12,Book Reading,,A,1509113100,[implementation],PROGRAMMING +884,Educational Codeforces Round 31,12,Japanese Crosswords Strike Back,,B,1509113100,[implementation],PROGRAMMING +884,Educational Codeforces Round 31,12,Bertown Subway,,C,1509113100,"[dfs and similar, greedy]",PROGRAMMING +884,Educational Codeforces Round 31,12,Boxes And Balls,,D,1509113100,"[data structures, greedy]",PROGRAMMING +884,Educational Codeforces Round 31,12,Binary Matrix,,E,1509113100,[dsu],PROGRAMMING +884,Educational Codeforces Round 31,12,Anti-Palindromize,,F,1509113100,[flows],PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Short Program,500.0,A,1509029100,"[bitmasks, constructive algorithms]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Teams Formation,1250.0,B,1509029100,[implementation],PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Tournament,1250.0,C,1509029100,"[data structures, graphs]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Magic Breeding,2000.0,D,1509029100,[],PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Numbers on the blackboard,2500.0,E,1509029100,"[combinatorics, dp]",PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Borya's Diagnosis,500.0,A,1509029100,[implementation],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Table Tennis,1000.0,B,1509029100,[implementation],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Short Program,1500.0,C,1509029100,"[bitmasks, constructive algorithms, graph matchings]",PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Teams Formation,2250.0,D,1509029100,[],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Tournament,2250.0,E,1509029100,[],PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Alex and broken contest,500.0,A,1508773500,"[implementation, strings]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Nikita and string,1000.0,B,1508773500,"[brute force, dp]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Slava and tanks,1500.0,C,1508773500,[constructive algorithms],PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Olya and Energy Drinks,2000.0,D,1508773500,"[data structures, dfs and similar, shortest paths]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Danil and a Part-time Job,2250.0,E,1508773500,"[bitmasks, data structures, trees]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Ann and Books,2750.0,F,1508773500,"[data structures, flows, hashing]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Automatic Door,,A,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Army,,B,1508573100,"[constructive algorithms, graphs, greedy]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Downloading B++,,C,1508573100,[binary search],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen Strike Back,,D,1508573100,"[binary search, dp]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Field of Wonders,,E,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lost in Transliteration,,F,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Orientation of Edges,,G,1508573100,[graphs],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Palindromic Cut,,H,1508573100,"[brute force, implementation]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Photo Processing,,I,1508573100,[binary search],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Renovation,,J,1508573100,"[greedy, sortings]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Road Widening,,K,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland.Taxi,,L,1508573100,[data structures],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Quadcopter Competition,,M,1508573100,[greedy],PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Classroom Watch,500.0,A,1508151900,[brute force],PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Sorting the Coins,1000.0,B,1508151900,"[dsu, sortings, two pointers]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,National Property,1500.0,C,1508151900,"[2-sat, dfs and similar, graphs, implementation]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,High Cry,1750.0,D,1508151900,"[binary search, bitmasks, data structures, divide and conquer]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Delivery Club,2000.0,E,1508151900,"[binary search, data structures, dp]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Royal Questions,2500.0,F,1508151900,"[dsu, greedy]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Trip For Meal,500.0,A,1508151900,[math],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Divisiblity of Differences,1000.0,B,1508151900,[math],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Classroom Watch,1500.0,C,1508151900,[brute force],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Sorting the Coins,2000.0,D,1508151900,"[dsu, sortings, trees, two pointers]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,National Property,2500.0,E,1508151900,"[2-sat, dfs and similar, graphs]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,High Cry,2750.0,F,1508151900,[data structures],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Search for Pretty Integers,500.0,A,1508054700,[brute force],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Maximum of Maximums of Minimums,1000.0,B,1508054700,[greedy],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Maximum splitting,1500.0,C,1508054700,"[dp, greedy, number theory]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Something with XOR Queries,2250.0,D,1508054700,"[brute force, probabilities]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,"[dfs and similar, dsu, trees]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Paths,3250.0,F,1508054700,"[data structures, number theory]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Maximum splitting,500.0,A,1508054700,"[dp, greedy, math, number theory]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Something with XOR Queries,1250.0,B,1508054700,"[brute force, implementation]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,"Points, Lines and Ready-made Titles",1500.0,C,1508054700,[dfs and similar],PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Paths,2250.0,D,1508054700,"[number theory, sortings]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Restore the Tree,2250.0,E,1508054700,"[graphs, greedy, trees]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Search for Pretty Integers,500.0,A,1508054700,[implementation],PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum of Maximums of Minimums,1000.0,B,1508054700,[implementation],PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum splitting,1500.0,C,1508054700,"[greedy, math, number theory]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Something with XOR Queries,2250.0,D,1508054700,"[brute force, implementation]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,[],PROGRAMMING +873,Educational Codeforces Round 30,12,Chores,,A,1507817100,[implementation],PROGRAMMING +873,Educational Codeforces Round 30,12,Balanced Substring,,B,1507817100,"[dp, implementation]",PROGRAMMING +873,Educational Codeforces Round 30,12,Strange Game On Matrix,,C,1507817100,"[greedy, two pointers]",PROGRAMMING +873,Educational Codeforces Round 30,12,Merge Sort,,D,1507817100,[divide and conquer],PROGRAMMING +873,Educational Codeforces Round 30,12,Awards For Contestants,,E,1507817100,"[brute force, data structures, dp]",PROGRAMMING +873,Educational Codeforces Round 30,12,Forbidden Indices,,F,1507817100,"[dsu, string suffix structures, strings]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Artful Expedient,500.0,A,1507296900,"[brute force, implementation]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Eternal Immortality,1000.0,B,1507296900,[math],PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Intriguing Obsession,1500.0,C,1507296900,"[combinatorics, dp, math]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Overdosing Ubiquity,2250.0,D,1507296900,"[brute force, dfs and similar, graphs]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Untended Antiquity,2500.0,E,1507296900,"[data structures, hashing]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Bark to Unlock,250.0,A,1507187100,"[brute force, strings]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Race Against Time,500.0,B,1507187100,[implementation],PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Qualification Rounds,1000.0,C,1507187100,"[bitmasks, brute force, constructive algorithms, dp]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Huge Strings,1500.0,D,1507187100,"[bitmasks, brute force, dp, strings]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Policeman and a Tree,2250.0,E,1507187100,"[dp, graphs, trees]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Yet Another Minimization Problem,2500.0,F,1507187100,"[divide and conquer, dp]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,El Toll Caves,3500.0,G,1507187100,[math],PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Save the problem!,500.0,A,1506791100,[constructive algorithms],PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Ordering Pizza,1000.0,B,1506791100,"[binary search, sortings, ternary search]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Buy Low Sell High,2000.0,D,1506791100,"[constructive algorithms, data structures, greedy]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Hex Dyslexia,2500.0,E,1506791100,"[bitmasks, brute force, dp, graphs]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Egg Roulette,3000.0,F,1506791100,"[bitmasks, brute force, divide and conquer, math, meet-in-the-middle]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Flowers and Chocolate,3500.0,G,1506791100,"[combinatorics, math, matrices]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Save the problem!,500.0,A,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Ordering Pizza,1000.0,B,1506791100,"[greedy, implementation, sortings]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp, probabilities]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Buy Low Sell High,2000.0,D,1506791100,"[data structures, greedy, two pointers]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Hex Dyslexia,2500.0,E,1506791100,[],PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Egg Roulette,3000.0,F,1506791100,[],PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Flowers and Chocolate,3500.0,G,1506791100,[math],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Between the Offices,500.0,A,1506791100,[implementation],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Save the problem!,1000.0,B,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Ordering Pizza,1500.0,C,1506791100,"[greedy, implementation, sortings, ternary search]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Gotta Go Fast,2000.0,D,1506791100,[],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Buy Low Sell High,2500.0,E,1506791100,"[data structures, greedy]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Hex Dyslexia,3000.0,F,1506791100,[],PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Fair Game,500.0,A,1506335700,"[implementation, sortings]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Polycarp and Letters,1000.0,B,1506335700,"[brute force, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Bus,1500.0,C,1506335700,"[greedy, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Make a Permutation!,2000.0,D,1506335700,"[greedy, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Fire,2500.0,E,1506335700,"[dp, sortings]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Cities Excursions,3000.0,F,1506335700,[dfs and similar],PROGRAMMING +855,"Manthan, Codefest 17",12,Tom Riddle's Diary,500.0,A,1506263700,[implementation],PROGRAMMING +855,"Manthan, Codefest 17",12,Marvolo Gaunt's Ring,1000.0,B,1506263700,"[data structures, dp]",PROGRAMMING +855,"Manthan, Codefest 17",12,Helga Hufflepuff's Cup,1500.0,C,1506263700,"[dp, trees]",PROGRAMMING +855,"Manthan, Codefest 17",12,Rowena Ravenclaw's Diadem,2000.0,D,1506263700,[trees],PROGRAMMING +855,"Manthan, Codefest 17",12,Salazar Slytherin's Locket,2500.0,E,1506263700,"[bitmasks, dp]",PROGRAMMING +855,"Manthan, Codefest 17",12,Nagini,3000.0,F,1506263700,[data structures],PROGRAMMING +855,"Manthan, Codefest 17",12,Harry Vs Voldemort,3500.0,G,1506263700,"[dp, graphs, trees]",PROGRAMMING +863,Educational Codeforces Round 29,12,Quasi-palindrome,,A,1506006300,"[brute force, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Kayaking,,B,1506006300,"[brute force, greedy, sortings]",PROGRAMMING +863,Educational Codeforces Round 29,12,1-2-3,,C,1506006300,"[graphs, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Yet Another Array Queries Problem,,D,1506006300,"[data structures, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Turn Off The TV,,E,1506006300,"[data structures, sortings]",PROGRAMMING +863,Educational Codeforces Round 29,12,Almost Permutation,,F,1506006300,[flows],PROGRAMMING +863,Educational Codeforces Round 29,12,Graphic Settings,,G,1506006300,[],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the MEX,500.0,A,1505833500,[implementation],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the bipartiteness,1000.0,B,1505833500,"[dfs and similar, graphs]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the xor,1500.0,C,1505833500,[constructive algorithms],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the binary string,1750.0,D,1505833500,"[binary search, divide and conquer]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the function,2000.0,E,1505833500,"[binary search, data structures]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the final stage,2750.0,F,1505833500,"[data structures, strings]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Union of Doubly Linked Lists,,A,1505739900,[implementation],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Preparing for Merge Sort,,B,1505739900,[binary search],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Sum of Nestings,,C,1505739900,[],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Dog Show,,D,1505739900,"[data structures, greedy]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen,,E,1505739900,[binary search],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Elections,,F,1505739900,[greedy],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,University Classes,,G,1505739900,[implementation],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Load Testing,,H,1505739900,[],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Noise Level,,I,1505739900,[dfs and similar],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Students Initiation,,J,1505739900,"[binary search, flows]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Travel Cards,,K,1505739900,[sortings],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland SU Computer Network,,L,1505739900,"[dfs and similar, hashing, trees]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Weather Tomorrow,,M,1505739900,[implementation],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,k-rounding,750.0,A,1505653500,"[brute force, number theory]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Did you mean...,1500.0,C,1505653500,"[dp, greedy]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Polycarp's phone book,2000.0,D,1505653500,"[data structures, sortings]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Tests Renumeration,2500.0,E,1505653500,[implementation],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Wizard's Tour,3000.0,F,1505653500,"[constructive algorithms, dfs and similar]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Did you mean...,500.0,A,1505653500,[greedy],PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Polycarp's phone book,1000.0,B,1505653500,"[brute force, data structures, hashing, strings]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Tests Renumeration,1500.0,C,1505653500,[greedy],PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Wizard's Tour,2000.0,D,1505653500,"[dfs and similar, graphs, greedy]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Arkady and a Nobody-men,2250.0,E,1505653500,"[data structures, dfs and similar, trees]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,k-rounding,750.0,A,1505653500,"[math, number theory]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Did you mean...,1500.0,C,1505653500,"[brute force, strings]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Polycarp's phone book,2000.0,D,1505653500,"[brute force, data structures, strings]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Tests Renumeration,2500.0,E,1505653500,[],PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Wizard's Tour,3000.0,F,1505653500,[dfs and similar],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Declined Finalists,500.0,A,1505583300,[greedy],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Lazy Security Guard,750.0,B,1505583300,"[brute force, math]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Pie Rules,1000.0,C,1505583300,"[dp, games]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Third Month Insanity,1500.0,D,1505583300,"[dp, probabilities]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Desk Disorder,2000.0,E,1505583300,"[combinatorics, dfs and similar, dsu, graphs, trees]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Ordering T-Shirts,2750.0,F,1505583300,[greedy],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Circle of Numbers,3000.0,G,1505583300,[math],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Set Theory,,A,1505050500,"[brute force, constructive algorithms]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Similar Words,,B,1505050500,"[dp, strings]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Eleventh Birthday,,C,1505050500,"[combinatorics, dp, math]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Masha and Cactus,,D,1505050500,[],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Satellites,,E,1505050500,[],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,To Play or not to Play,,F,1505050500,[],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Planning,750.0,A,1504702500,[greedy],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Jury Meeting,750.0,B,1504702500,"[greedy, sortings, two pointers]",PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Boredom,1750.0,C,1504702500,[data structures],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Michael and Charging Stations,1750.0,D,1504702500,"[binary search, dp]",PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Lada Malina,2500.0,E,1504702500,"[data structures, geometry]",PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Fraction,500.0,A,1504702500,"[brute force, constructive algorithms, math]",PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Maxim Buys an Apartment,1000.0,B,1504702500,[constructive algorithms],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Planning,1750.0,C,1504702500,[],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Jury Meeting,1750.0,D,1504702500,[greedy],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Boredom,2500.0,E,1504702500,[data structures],PROGRAMMING +846,Educational Codeforces Round 28,12,Curriculum Vitae,,A,1504623900,[brute force],PROGRAMMING +846,Educational Codeforces Round 28,12,Math Show,,B,1504623900,"[brute force, greedy]",PROGRAMMING +846,Educational Codeforces Round 28,12,Four Segments,,C,1504623900,"[brute force, dp]",PROGRAMMING +846,Educational Codeforces Round 28,12,Monitor,,D,1504623900,"[binary search, data structures]",PROGRAMMING +846,Educational Codeforces Round 28,12,Chemistry in Berland,,E,1504623900,"[dfs and similar, greedy, trees]",PROGRAMMING +846,Educational Codeforces Round 28,12,Random Query,,F,1504623900,"[math, two pointers]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Five Dimensional Points,500.0,A,1504535700,"[brute force, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a list of numbers,1000.0,B,1504535700,[number theory],PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a game with Mojtaba,1250.0,C,1504535700,"[bitmasks, dp, games]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Tournament Construction,1750.0,D,1504535700,"[dp, graphs, greedy, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Random Elections,2000.0,E,1504535700,"[bitmasks, brute force, fft, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Rainbow Balls,2500.0,F,1504535700,[math],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a research in Mexican wave,500.0,A,1504535700,[implementation],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and an exam about geometry,1000.0,B,1504535700,"[geometry, math]",PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Five Dimensional Points,1500.0,C,1504535700,"[brute force, math]",PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a list of numbers,2000.0,D,1504535700,[],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a game with Mojtaba,2500.0,E,1504535700,"[bitmasks, games]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Digits,,A,1504432800,"[brute force, implementation, math]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Neural Network country,,B,1504432800,"[dp, matrices]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Property,,C,1504432800,"[greedy, sortings]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Exploration plan,,D,1504432800,"[binary search, flows, graph matchings, shortest paths]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Casinos and travel,,E,1504432800,[dp],PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Product transformation,,F,1504432800,"[combinatorics, math, number theory]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Bathroom terminal,,G,1504432800,[implementation],PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Bob and stages,,H,1504432800,"[dp, geometry]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Dating,,I,1504432800,"[brute force, dfs and similar, graphs, trees]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,From Y to Y,500.0,A,1504272900,[constructive algorithms],PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Rooter's Song,1000.0,B,1504272900,"[constructive algorithms, data structures, geometry, implementation, sortings, two pointers]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Goodbye Souvenir,1750.0,C,1504272900,"[data structures, divide and conquer]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Shake It!,1750.0,D,1504272900,"[combinatorics, dp, flows, graphs]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Days of Floral Colours,2500.0,E,1504272900,"[combinatorics, dp, fft, math]",PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Odds and Ends,500.0,A,1504272900,[implementation],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Tell Your World,1000.0,B,1504272900,"[brute force, geometry]",PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,From Y to Y,1500.0,C,1504272900,[constructive algorithms],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Rooter's Song,2000.0,D,1504272900,[],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Goodbye Souvenir,2500.0,E,1504272900,[data structures],PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Kirill And The Game,500.0,A,1504019100,"[brute force, two pointers]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Gleb And Pizza,1000.0,B,1504019100,[geometry],PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Ilya And The Tree,1500.0,C,1504019100,"[dfs and similar, math, trees]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Vitya and Strange Lesson,2000.0,D,1504019100,"[binary search, data structures]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Nikita and game,2500.0,E,1504019100,"[binary search, dfs and similar, divide and conquer, trees]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Sorting by Subsequences,500.0,A,1503592500,"[dfs and similar, dsu, implementation, sortings]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Interactive LowerBound,1000.0,B,1503592500,"[brute force, probabilities]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Upgrading Tree,1750.0,C,1503592500,"[constructive algorithms, dfs and similar, math]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Dynamic Shortest Path,2250.0,D,1503592500,"[graphs, shortest paths]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Maximum Flow,2250.0,E,1503592500,[flows],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Diversity,500.0,A,1503592500,[implementation],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Rectangles,1000.0,B,1503592500,"[combinatorics, math]",PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Sorting by Subsequences,1500.0,C,1503592500,[dfs and similar],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Interactive LowerBound,2000.0,D,1503592500,"[brute force, probabilities]",PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Upgrading Tree,3000.0,E,1503592500,[],PROGRAMMING +845,Educational Codeforces Round 27,12,Chess Tourney,,A,1503327900,[sortings],PROGRAMMING +845,Educational Codeforces Round 27,12,Luba And The Ticket,,B,1503327900,"[brute force, greedy]",PROGRAMMING +845,Educational Codeforces Round 27,12,Two TVs,,C,1503327900,"[data structures, greedy, sortings]",PROGRAMMING +845,Educational Codeforces Round 27,12,Driving Test,,D,1503327900,"[data structures, dp, greedy]",PROGRAMMING +845,Educational Codeforces Round 27,12,Fire in the City,,E,1503327900,"[binary search, data structures]",PROGRAMMING +845,Educational Codeforces Round 27,12,Guards In The Storehouse,,F,1503327900,[dp],PROGRAMMING +845,Educational Codeforces Round 27,12,Shortest Path Problem?,,G,1503327900,"[dfs and similar, math]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Leha and Function,500.0,A,1503068700,"[combinatorics, greedy, math, number theory, sortings]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Leha and another game about graph,1000.0,B,1503068700,"[constructive algorithms, data structures, dfs and similar, dp, graphs]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,On the Bench,1500.0,C,1503068700,"[combinatorics, dp]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Destiny,2000.0,D,1503068700,"[data structures, probabilities]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,In a Trap,2500.0,E,1503068700,[trees],PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Generous Kefa,500.0,A,1503068700,"[brute force, implementation]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Godsend,1000.0,B,1503068700,"[games, math]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Leha and Function,1500.0,C,1503068700,[greedy],PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Leha and another game about graph,2000.0,D,1503068700,"[dfs and similar, graphs]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,On the Bench,2500.0,E,1503068700,[],PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Arya and Bran,500.0,A,1502548500,[implementation],PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Game of the Rows,1000.0,B,1502548500,"[brute force, greedy, implementation]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Journey,1500.0,C,1502548500,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Winter is here,2000.0,D,1502548500,"[combinatorics, dp, math, number theory]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Mother of Dragons,2500.0,E,1502548500,"[brute force, graphs, math, meet-in-the-middle]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Binary Blocks,,A,1502085900,[brute force],PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Diverging Directions,,B,1502085900,"[data structures, dfs and similar, trees]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Future Failure,,C,1502085900,"[dp, games]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Airplane Arrangements,,D,1502085900,"[math, number theory]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Convex Countour,,E,1502085900,[dp],PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Expected Earnings,,F,1502085900,[],PROGRAMMING +837,Educational Codeforces Round 26,12,Text Volume,,A,1501773300,[implementation],PROGRAMMING +837,Educational Codeforces Round 26,12,Flag of Berland,,B,1501773300,"[brute force, implementation]",PROGRAMMING +837,Educational Codeforces Round 26,12,Two Seals,,C,1501773300,[brute force],PROGRAMMING +837,Educational Codeforces Round 26,12,Round Subset,,D,1501773300,[dp],PROGRAMMING +837,Educational Codeforces Round 26,12,Vasya's Function,,E,1501773300,"[binary search, implementation, math]",PROGRAMMING +837,Educational Codeforces Round 26,12,Prefix Sums,,F,1501773300,"[binary search, brute force, combinatorics, math, matrices]",PROGRAMMING +837,Educational Codeforces Round 26,12,Functions On The Segments,,G,1501773300,[data structures],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Key races,500.0,A,1501511700,[math],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,The number on the board,750.0,B,1501511700,[greedy],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Star sky,1250.0,C,1501511700,"[dp, implementation]",PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Palindromic characteristics,1500.0,D,1501511700,"[brute force, dp, hashing, strings]",PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,The penguin's game,2250.0,E,1501511700,[constructive algorithms],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Roads in the Kingdom,2250.0,F,1501511700,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,The Meaningless Game,500.0,A,1501425300,"[math, number theory]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,The Bakery,1250.0,B,1501425300,"[binary search, data structures, dp, two pointers]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Ever-Hungry Krakozyabra,1500.0,C,1501425300,"[brute force, greedy]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Red-Black Cobweb,2250.0,D,1501425300,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Caramel Clouds,2500.0,E,1501425300,"[data structures, dp, sortings]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Useless Toy,500.0,A,1501425300,[implementation],PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Festive Evening,1000.0,B,1501425300,"[data structures, implementation]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Meaningless Game,1500.0,C,1501425300,[math],PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Bakery,2250.0,D,1501425300,"[data structures, divide and conquer, dp]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,Ever-Hungry Krakozyabra,2500.0,E,1501425300,[],PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Sasha and Sticks,500.0,A,1500906900,"[games, math]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Petya and Exam,1000.0,B,1500906900,[implementation],PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Strange Radiation,1750.0,C,1500906900,"[binary search, implementation, math]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,"Misha, Grisha and Underground",2000.0,D,1500906900,"[dfs and similar, trees]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Vasya and Shifts,2500.0,E,1500906900,[matrices],PROGRAMMING +825,Educational Codeforces Round 25,12,Binary Protocol,,A,1500217500,[implementation],PROGRAMMING +825,Educational Codeforces Round 25,12,Five-In-a-Row,,B,1500217500,"[brute force, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Multi-judge Solving,,C,1500217500,"[greedy, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Suitable Replacement,,D,1500217500,"[greedy, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Minimal Labels,,E,1500217500,"[data structures, graphs, greedy]",PROGRAMMING +825,Educational Codeforces Round 25,12,String Compression,,F,1500217500,"[dp, hashing, string suffix structures, strings]",PROGRAMMING +825,Educational Codeforces Round 25,12,Tree Queries,,G,1500217500,"[dfs and similar, trees]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Office Keys,500.0,A,1499958300,"[binary search, brute force, dp, greedy, sortings]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Cards Sorting,1000.0,B,1499958300,"[data structures, implementation, sortings]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Bamboo Partition,1500.0,C,1499958300,"[brute force, math, number theory, sortings, two pointers]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Singer House,2250.0,D,1499958300,"[combinatorics, dp, trees]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Perpetual Motion Machine,2250.0,E,1499958300,"[constructive algorithms, implementation, math, trees]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Unimodal Array,500.0,A,1499958300,[implementation],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Keyboard Layouts,750.0,B,1499958300,"[implementation, strings]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Jury Marks,1000.0,C,1499958300,[brute force],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Office Keys,1500.0,D,1499958300,"[binary search, brute force, dp, greedy]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Cards Sorting,2000.0,E,1499958300,[data structures],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Bamboo Partition,2500.0,F,1499958300,[],PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,String Reconstruction,500.0,A,1499791500,"[data structures, greedy]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,High Load,750.0,B,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,DNA Evolution,1500.0,C,1499791500,[data structures],PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Best Edge Weight,1750.0,D,1499791500,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Rusty String,1750.0,E,1499791500,"[fft, math]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Dirty Arkady's Kitchen,2500.0,F,1499791500,"[dp, shortest paths]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Restaurant Tables,500.0,A,1499791500,[implementation],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Black Square,750.0,B,1499791500,[implementation],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,String Reconstruction,1250.0,C,1499791500,"[data structures, sortings]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,High Load,1750.0,D,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,DNA Evolution,2000.0,E,1499791500,[data structures],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Best Edge Weight,2750.0,F,1499791500,[data structures],PROGRAMMING +823,VK Cup 2017 - Finals,12,High Load,500.0,A,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,DNA Evolution,1000.0,B,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Bamboo Partition,1500.0,C,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Rusty String,2000.0,D,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Singer House,2750.0,E,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Perpetual Motion Machine,2750.0,F,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Dirty Arkady's Kitchen,3500.0,G,1499587500,[],PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,I'm bored with life,500.0,A,1499011500,"[implementation, math, number theory]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Crossword solving,750.0,B,1499011500,"[brute force, implementation]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,"Hacker, pack your bags!",1250.0,C,1499011500,"[binary search, greedy, sortings]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,My pretty girl Noora,1750.0,D,1499011500,"[brute force, dp, greedy, math, number theory]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Liar,2250.0,E,1499011500,"[binary search, dp, hashing, string suffix structures]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Madness,2500.0,F,1499011500,"[dfs and similar, trees]",PROGRAMMING +818,Educational Codeforces Round 24,12,Diplomas and Certificates,,A,1498748700,"[implementation, math]",PROGRAMMING +818,Educational Codeforces Round 24,12,Permutation Game,,B,1498748700,[implementation],PROGRAMMING +818,Educational Codeforces Round 24,12,Sofa Thief,,C,1498748700,"[brute force, implementation]",PROGRAMMING +818,Educational Codeforces Round 24,12,Multicolored Cars,,D,1498748700,"[data structures, implementation]",PROGRAMMING +818,Educational Codeforces Round 24,12,Card Game Again,,E,1498748700,"[binary search, data structures, number theory, two pointers]",PROGRAMMING +818,Educational Codeforces Round 24,12,Level Generation,,F,1498748700,"[binary search, math, ternary search]",PROGRAMMING +818,Educational Codeforces Round 24,12,Four Melodies,,G,1498748700,[flows],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Boring Game,500.0,A,1498574100,[],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and PR Shifts,1000.0,B,1498574100,"[data structures, implementation]",PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Beacons on Field,1500.0,C,1498574100,[number theory],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Astronomers,2000.0,D,1498574100,[number theory],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Flight to the Moon,2500.0,E,1498574100,"[constructive algorithms, graphs]",PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Book Reading,500.0,A,1498574100,[implementation],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Angle in Polygon,1000.0,B,1498574100,"[constructive algorithms, geometry]",PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Boring Game,1500.0,C,1498574100,[],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and PR Shifts,2000.0,D,1498574100,[],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Beacons on Field,2500.0,E,1498574100,[],PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Future Gadget Laboratory,500.0,A,1498401300,[implementation],PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Banana Trees,1000.0,B,1498401300,"[brute force, math]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Boxes,1500.0,C,1498401300,"[data structures, trees]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and City,2000.0,D,1498401300,"[graphs, shortest paths]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and El Psy Kongroo,2500.0,E,1498401300,"[dp, matrices]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Game,500.0,A,1497710100,"[brute force, greedy, implementation]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Test,1250.0,B,1497710100,"[brute force, constructive algorithms, math]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Supermarket,1500.0,C,1497710100,"[brute force, dp, trees]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Cards,2250.0,D,1497710100,"[binary search, combinatorics, data structures, geometry]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Neighborhood,2250.0,E,1497710100,"[binary search, constructive algorithms]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Morning,500.0,A,1497710100,"[brute force, implementation]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Coffee,1000.0,B,1497710100,"[binary search, data structures]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Game,1500.0,C,1497710100,"[brute force, greedy]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Test,2000.0,D,1497710100,[combinatorics],PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Supermarket,2750.0,E,1497710100,"[dp, trees]",PROGRAMMING +817,Educational Codeforces Round 23,12,Treasure Hunt,,A,1497539100,"[implementation, number theory]",PROGRAMMING +817,Educational Codeforces Round 23,12,Makes And The Product,,B,1497539100,"[combinatorics, sortings]",PROGRAMMING +817,Educational Codeforces Round 23,12,Really Big Numbers,,C,1497539100,"[binary search, brute force, dp, math]",PROGRAMMING +817,Educational Codeforces Round 23,12,Imbalanced Array,,D,1497539100,"[data structures, divide and conquer, dsu, sortings]",PROGRAMMING +817,Educational Codeforces Round 23,12,Choosing The Commander,,E,1497539100,"[bitmasks, data structures, trees]",PROGRAMMING +817,Educational Codeforces Round 23,12,MEX Queries,,F,1497539100,"[binary search, data structures, trees]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An abandoned sentiment from past,500.0,A,1496837700,"[implementation, sortings]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An express train to reveries,1000.0,B,1496837700,[constructive algorithms],PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An impassioned circulation of affection,1750.0,C,1496837700,"[brute force, dp, two pointers]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An overnight dance in discotheque,1750.0,D,1496837700,"[dfs and similar, dp, geometry, greedy, trees]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An unavoidable detour for home,2500.0,E,1496837700,"[combinatorics, dp]",PROGRAMMING +813,Educational Codeforces Round 22,12,The Contest,,A,1496675100,[implementation],PROGRAMMING +813,Educational Codeforces Round 22,12,The Golden Age,,B,1496675100,"[brute force, math]",PROGRAMMING +813,Educational Codeforces Round 22,12,The Tag Game,,C,1496675100,[dfs and similar],PROGRAMMING +813,Educational Codeforces Round 22,12,Two Melodies,,D,1496675100,"[dp, flows]",PROGRAMMING +813,Educational Codeforces Round 22,12,Army Creation,,E,1496675100,"[binary search, data structures]",PROGRAMMING +813,Educational Codeforces Round 22,12,Bipartite Checking,,F,1496675100,"[data structures, dsu, graphs]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Crossroads,500.0,A,1496326500,[implementation],PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,"Sagheer, the Hausmeister",1000.0,B,1496326500,"[bitmasks, brute force, dp]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Nubian Market,1500.0,C,1496326500,[binary search],PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Kindergarten,2000.0,D,1496326500,"[dfs and similar, graphs, implementation]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Apple Tree,2500.0,E,1496326500,[games],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (easy),,A,1495958700,[greedy],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (medium),,B,1495958700,"[data structures, greedy]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (hard),,C,1495958700,[flows],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (easy),,D,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (medium),,E,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (hard),,F,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (easy),,G,1495958700,[implementation],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (medium),,H,1495958700,[constructive algorithms],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (hard),,I,1495958700,[string suffix structures],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (easy),,J,1495958700,"[dfs and similar, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (medium),,K,1495958700,"[dp, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (hard),,L,1495958700,"[dfs and similar, dp, math, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (easy),,M,1495958700,"[greedy, sortings]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (medium),,N,1495958700,"[binary search, flows]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (hard),,O,1495958700,"[binary search, flows]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Courtesy,500.0,A,1495877700,"[brute force, implementation]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Complicated Book,1000.0,B,1495877700,"[implementation, sortings]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Memorable Trip,1500.0,C,1495877700,"[dp, implementation]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Favorite Game,2000.0,D,1495877700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Entertaining Flags,2500.0,E,1495877700,"[data structures, dsu, graphs]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Do you want a date?,500.0,A,1495303500,"[math, sortings]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Glad to see you!,1000.0,B,1495303500,[binary search],PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Find a car,1500.0,C,1495303500,"[combinatorics, divide and conquer, dp]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Hitchhiking in the Baltic States,2000.0,D,1495303500,"[data structures, dp]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Surprise me!,2500.0,E,1495303500,"[divide and conquer, math, trees]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Straight <>,500.0,A,1495303500,"[implementation, math]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Summer sell-off,1000.0,B,1495303500,"[greedy, sortings]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Do you want a date?,1500.0,C,1495303500,"[math, sortings]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Glad to see you!,2000.0,D,1495303500,[binary search],PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Find a car,2500.0,E,1495303500,"[divide and conquer, dp]",PROGRAMMING +808,Educational Codeforces Round 21,12,Lucky Year,,A,1494860700,[implementation],PROGRAMMING +808,Educational Codeforces Round 21,12,Average Sleep Time,,B,1494860700,"[data structures, math]",PROGRAMMING +808,Educational Codeforces Round 21,12,Tea Party,,C,1494860700,"[constructive algorithms, greedy]",PROGRAMMING +808,Educational Codeforces Round 21,12,Array Division,,D,1494860700,"[binary search, data structures, implementation]",PROGRAMMING +808,Educational Codeforces Round 21,12,Selling Souvenirs,,E,1494860700,"[dp, greedy, ternary search]",PROGRAMMING +808,Educational Codeforces Round 21,12,Card Game,,F,1494860700,"[binary search, flows, graphs]",PROGRAMMING +808,Educational Codeforces Round 21,12,Anthem of Berland,,G,1494860700,"[dp, strings]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Bank Robbery,500.0,A,1494668100,[implementation],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Cutting Carrot,1000.0,B,1494668100,"[geometry, math]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Naming Company,1750.0,C,1494668100,"[games, greedy, sortings]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Labelling Cities,2000.0,D,1494668100,"[dfs and similar, graphs, hashing]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Choosing Carrot,2500.0,E,1494668100,[games],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Leha and security system,2750.0,F,1494668100,[data structures],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Replace All,3500.0,G,1494668100,"[combinatorics, dp, math]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Carrot Cakes,500.0,A,1494516900,"[brute force, implementation]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,T-shirt buying,1000.0,B,1494516900,"[data structures, implementation]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Fountains,1500.0,C,1494516900,"[binary search, data structures]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Field expansion,2000.0,D,1494516900,"[brute force, dp, meet-in-the-middle]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Aquarium decoration,2500.0,E,1494516900,"[data structures, greedy, two pointers]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Beautiful fountains rows,3250.0,F,1494516900,[data structures],PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Cut the pie,3500.0,G,1494516900,"[binary search, data structures, geometry]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Prairie Partition,1750.0,C,1494171900,"[binary search, greedy]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Perishable Roads,2500.0,D,1494171900,[graphs],PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Blog Post Rating,2750.0,E,1494171900,[data structures],PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Test Data Generation,3500.0,F,1494171900,[],PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Is it rated?,500.0,A,1494171900,"[implementation, sortings]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,T-Shirt Hunt,1000.0,B,1494171900,[brute force],PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Success Rate,1500.0,C,1494171900,"[binary search, math]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Dynamic Problem Scoring,2000.0,D,1494171900,"[brute force, greedy]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Prairie Partition,2750.0,E,1494171900,"[binary search, greedy]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Perishable Roads,3500.0,F,1494171900,[],PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Find Amir,500.0,A,1493909400,"[greedy, math]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Minimum number of steps,1000.0,B,1493909400,"[greedy, implementation, math]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Ice cream coloring,1500.0,C,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Expected diameter of a tree,2000.0,D,1493909400,"[binary search, brute force, dfs and similar, dp, sortings, trees]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,The same permutation ,2500.0,E,1493909400,[constructive algorithms],PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Fake bullions,3000.0,F,1493909400,"[dfs and similar, dp, graphs]",PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Fake NP,500.0,A,1493909400,[math],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,3-palindrome,1000.0,B,1493909400,[constructive algorithms],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Find Amir,1500.0,C,1493909400,[constructive algorithms],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Minimum number of steps,2000.0,D,1493909400,[],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Ice cream coloring,2500.0,E,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Expected diameter of a tree,3000.0,F,1493909400,"[graphs, probabilities]",PROGRAMMING +803,Educational Codeforces Round 20,12,Maximal Binary Matrix,,A,1493391900,[constructive algorithms],PROGRAMMING +803,Educational Codeforces Round 20,12,Distances to Zero,,B,1493391900,[constructive algorithms],PROGRAMMING +803,Educational Codeforces Round 20,12,Maximal GCD,,C,1493391900,"[greedy, math]",PROGRAMMING +803,Educational Codeforces Round 20,12,Magazine Ad,,D,1493391900,"[binary search, greedy]",PROGRAMMING +803,Educational Codeforces Round 20,12,Roma and Poker,,E,1493391900,[dp],PROGRAMMING +803,Educational Codeforces Round 20,12,Coprime Subsequences,,F,1493391900,"[bitmasks, combinatorics, number theory]",PROGRAMMING +803,Educational Codeforces Round 20,12,Periodic RMQ Problem,,G,1493391900,[data structures],PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Oleg and shares,500.0,A,1492965900,"[implementation, math]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Igor and his way to work,1000.0,B,1492965900,"[dfs and similar, shortest paths]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Mice problem,1500.0,C,1492965900,"[geometry, implementation, sortings]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Presents in Bankopolis,2000.0,D,1492965900,"[dp, graphs, shortest paths]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Problem of offices,2500.0,E,1492965900,"[constructive algorithms, dfs and similar, dp, trees]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Julia the snail,3000.0,F,1492965900,"[data structures, divide and conquer]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Oleg and chess,3500.0,G,1492965900,"[flows, graph matchings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and palindrome,500.0,A,1492785300,"[brute force, constructive algorithms, strings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and strings,1000.0,B,1492785300,"[brute force, strings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and gcd problem,1500.0,C,1492785300,"[dp, greedy, number theory]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and distribution,2000.0,D,1492785300,"[constructive algorithms, sortings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and code of a permutation,2500.0,E,1492785300,"[constructive algorithms, data structures, graphs, sortings]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Voltage Keepsake,500.0,A,1492356900,"[binary search, greedy]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Vulnerable Kerbals,1750.0,C,1492356900,[number theory],PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Varying Kibibits,2250.0,D,1492356900,"[combinatorics, dp]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Verifying Kingdom,2250.0,E,1492356900,[],PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vicious Keyboard,500.0,A,1492356900,[brute force],PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Valued Keys,1000.0,B,1492356900,"[constructive algorithms, greedy, strings]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Voltage Keepsake,1500.0,C,1492356900,"[binary search, math]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Volatile Kite,2000.0,D,1492356900,"[brute force, geometry, greedy]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vulnerable Kerbals,2750.0,E,1492356900,[],PROGRAMMING +797,Educational Codeforces Round 19,12,k-Factorization,,A,1492266900,"[implementation, math, number theory]",PROGRAMMING +797,Educational Codeforces Round 19,12,Odd sum,,B,1492266900,"[dp, greedy]",PROGRAMMING +797,Educational Codeforces Round 19,12,Minimal string,,C,1492266900,"[greedy, strings]",PROGRAMMING +797,Educational Codeforces Round 19,12,Broken BST,,D,1492266900,"[data structures, dfs and similar]",PROGRAMMING +797,Educational Codeforces Round 19,12,Array Queries,,E,1492266900,"[brute force, data structures, dp]",PROGRAMMING +797,Educational Codeforces Round 19,12,Mice and Holes,,F,1492266900,"[data structures, dp, greedy, sortings]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Buying A House,500.0,A,1491842100,"[brute force, implementation]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Find The Bone,750.0,B,1491842100,[implementation],PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Bank Hacking,1000.0,C,1491842100,"[constructive algorithms, data structures, dp, trees]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Police Stations,1500.0,D,1491842100,"[constructive algorithms, shortest paths, trees]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Exam Cheating,2000.0,E,1491842100,"[binary search, dp]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Sequence Recovery,2500.0,F,1491842100,"[bitmasks, data structures, greedy]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Amusement Park,,A,1491406500,"[*special, brute force, ternary search]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Significant Cups,,B,1491406500,"[*special, binary search, sortings, two pointers]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Lie or Truth,,D,1491406500,"[*special, implementation, sortings]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Big Number and Remainder,,E,1491406500,"[*special, brute force, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Pens And Days Of Week,,F,1491406500,"[*special, brute force, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING +A,Points on the line,500.0,[brute force],PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 +B,Our Tanya is Crying Out Loud,1250.0,[greedy],PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 +C,Phone Numbers,1250.0,[constructive algorithms],PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 +D,Alena And The Heater,1500.0,[implementation],PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 +E,Cashback,2000.0,"[data structures, dp, greedy]",PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 +F,Machine Learning,2750.0,"[brute force, data structures]",PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 diff --git a/ui/problem_ratings.csv b/ui/problem_ratings.csv index 1852c10..3024cfc 100644 --- a/ui/problem_ratings.csv +++ b/ui/problem_ratings.csv @@ -3271,3 +3271,488 @@ contestID,problemID,problemRating 707,C,1591 707,D,2188 707,E,2489 +935,A,590 +935,B,964 +935,C,1669 +935,D,1921 +935,E,2410 +935,F,5000 +939,A,859 +939,B,1181 +939,C,1595 +939,D,1591 +939,E,1903 +939,F,2570 +932,A,824 +932,B,1295 +932,C,1566 +932,D,2188 +932,E,2337 +932,F,2706 +932,G,3085 +933,A,1800 +933,B,1937 +933,C,2717 +933,D,2917 +933,E,3237 +934,A,1504 +934,B,1239 +934,C,1860 +934,D,2070 +934,E,2599 +922,A,1454 +922,B,1308 +922,C,1636 +922,D,1836 +922,E,2290 +922,F,2841 +919,A,901 +919,B,1155 +919,C,1411 +919,D,1772 +919,E,2153 +919,F,2707 +917,A,1824 +917,B,1653 +917,C,2907 +917,D,2629 +917,E,5000 +918,A,946 +918,B,1038 +918,C,1950 +918,D,1934 +918,E,5000 +914,A,1144 +914,B,1359 +914,C,1996 +914,D,1954 +914,E,2492 +914,F,2987 +914,G,2583 +914,H,3577 +913,A,1021 +913,B,1350 +913,C,1693 +913,D,1829 +913,E,2451 +913,F,2849 +913,G,3119 +913,H,5000 +912,A,940 +912,B,1448 +912,C,2554 +912,D,2092 +912,E,2554 +908,A,754 +908,B,1359 +908,C,1598 +908,D,2219 +908,E,2485 +908,F,2382 +908,G,2807 +908,H,3159 +909,A,1118 +909,B,1329 +909,C,1847 +909,D,2115 +909,E,2137 +909,F,2649 +904,A,1480 +904,B,1474 +904,C,1651 +904,D,2516 +904,E,2587 +904,F,5000 +906,A,1527 +906,B,2192 +906,C,2387 +906,D,2707 +906,E,3402 +907,A,1439 +907,B,1418 +907,C,1640 +907,D,2473 +907,E,2463 +907,F,2697 +901,A,1620 +901,B,2186 +901,C,2283 +901,D,2749 +901,E,5000 +902,A,1236 +902,B,1317 +902,C,1574 +902,D,2172 +902,E,2633 +899,A,955 +899,B,1453 +899,C,1322 +899,D,1816 +899,E,2104 +899,F,2234 +898,A,845 +898,B,1379 +898,C,1482 +898,D,1729 +898,E,1695 +898,F,2542 +900,A,968 +900,B,1424 +900,C,1772 +900,D,2109 +900,E,2298 +896,A,1670 +896,B,1992 +896,C,2680 +896,D,2909 +896,E,3301 +897,A,707 +897,B,1350 +897,C,1797 +897,D,2141 +897,E,5000 +895,A,1361 +895,B,1761 +895,C,2068 +895,D,2353 +895,E,2591 +894,A,907 +894,B,1842 +894,C,1923 +894,D,2306 +894,E,2440 +891,A,1774 +891,B,2034 +891,C,2328 +891,D,3149 +891,E,2924 +892,A,1029 +892,B,1357 +892,C,1682 +892,D,2045 +892,E,2552 +878,A,1461 +878,B,2322 +878,C,2700 +878,D,2916 +878,E,3456 +879,A,1118 +879,B,1455 +879,C,1703 +879,D,2537 +879,E,2997 +877,A,1314 +877,B,1579 +877,C,1631 +877,D,2159 +877,E,1998 +877,F,2558 +875,A,1100 +875,B,1501 +875,C,2174 +875,D,2133 +875,E,2610 +875,F,2452 +876,A,1088 +876,B,1336 +876,C,1263 +876,D,1521 +876,E,2204 +876,F,2213 +870,A,1322 +870,B,1593 +870,C,1627 +870,D,2356 +870,E,5000 +870,F,5000 +871,A,1004 +871,B,2074 +871,C,2233 +871,D,2679 +871,E,3078 +872,A,1060 +872,B,1349 +872,C,1391 +872,D,2192 +872,E,2427 +869,A,1360 +869,B,1266 +869,C,1781 +869,D,2984 +869,E,2339 +868,A,1106 +868,B,1590 +868,C,1646 +868,D,2211 +868,E,2718 +868,F,2554 +868,G,5000 +865,A,1799 +865,B,1966 +865,C,2209 +865,D,2270 +865,E,5000 +865,F,5000 +865,G,5000 +866,A,1381 +866,B,2039 +866,C,2427 +866,D,2354 +866,E,3454 +866,F,3454 +866,G,3596 +867,A,600 +867,B,1406 +867,C,1916 +867,D,2647 +867,E,2280 +867,F,5000 +864,A,1154 +864,B,1142 +864,C,1522 +864,D,1559 +864,E,2010 +864,F,2765 +855,A,781 +855,B,1591 +855,C,2055 +855,D,2504 +855,E,2270 +855,F,3048 +855,G,3310 +862,A,1125 +862,B,1406 +862,C,1953 +862,D,2057 +862,E,2200 +862,F,2980 +859,A,809 +859,B,1085 +859,C,1533 +859,D,2130 +859,E,2086 +859,F,2886 +859,G,3041 +853,A,1389 +853,B,1948 +853,C,2068 +853,D,2516 +853,E,5000 +940,A,1301 +940,B,1445 +940,C,1509 +940,D,1645 +940,E,1999 +940,F,2825 +936,A,1676 +936,B,2197 +936,C,2249 +936,D,2991 +936,E,3579 +937,A,770 +937,B,1473 +937,C,1715 +937,D,2253 +937,E,2576 +854,A,919 +854,B,1249 +854,C,1533 +854,D,1993 +854,E,2429 +850,A,1759 +850,B,2224 +850,C,2224 +850,D,2801 +850,E,2789 +850,F,2937 +851,A,913 +851,B,1516 +851,C,1704 +851,D,2219 +851,E,2502 +848,A,1455 +848,B,1943 +848,C,2571 +848,D,3000 +848,E,5000 +849,A,1197 +849,B,1683 +849,C,1579 +849,D,2248 +849,E,2798 +842,A,1401 +842,B,1169 +842,C,1992 +842,D,2086 +842,E,2829 +843,A,1290 +843,B,2127 +843,C,2684 +843,D,3521 +843,E,3124 +844,A,1067 +844,B,1411 +844,C,1457 +844,D,2146 +844,E,2837 +841,A,1007 +841,B,1310 +841,C,1356 +841,D,2144 +841,E,2767 +839,A,1096 +839,B,2040 +839,C,1531 +839,D,2163 +839,E,2612 +835,A,652 +835,B,1189 +835,C,1590 +835,D,1956 +835,E,2460 +835,F,2484 +833,A,1900 +833,B,2192 +833,C,2770 +833,D,2927 +833,E,5000 +834,A,1132 +834,B,1241 +834,C,1801 +834,D,2327 +834,E,5000 +832,A,894 +832,B,1785 +832,C,2673 +832,D,1960 +832,E,2650 +830,A,1908 +830,B,1597 +830,C,2423 +830,D,2805 +830,E,3458 +831,A,1269 +831,B,898 +831,C,1735 +831,D,1978 +831,E,2038 +831,F,2977 +827,A,1878 +827,B,1795 +827,C,2064 +827,D,2742 +827,E,2677 +827,F,3402 +828,A,1417 +828,B,1478 +828,C,1851 +828,D,1843 +828,E,2305 +828,F,2951 +822,A,857 +822,B,1278 +822,C,1809 +822,D,1885 +822,E,2718 +822,F,2679 +815,A,1913 +815,B,2203 +815,C,2386 +815,D,2788 +815,E,2965 +816,A,1246 +816,B,1437 +816,C,1767 +816,D,2329 +816,E,2552 +814,A,1121 +814,B,1559 +814,C,1655 +814,D,1989 +814,E,2783 +812,A,1363 +812,B,1653 +812,C,1538 +812,D,2653 +812,E,2269 +811,A,952 +811,B,1440 +811,C,1899 +811,D,2039 +811,E,2482 +809,A,1452 +809,B,2323 +809,C,2598 +809,D,2854 +809,E,3537 +810,A,1107 +810,B,1421 +810,C,1576 +810,D,2338 +810,E,2915 +794,A,851 +794,B,1271 +794,C,1799 +794,D,2477 +794,E,2741 +794,F,2770 +794,G,5000 +799,A,1230 +799,B,1409 +799,C,1786 +799,D,2126 +799,E,2579 +799,F,3347 +799,G,3642 +806,A,1710 +806,B,2062 +806,C,2206 +806,D,2665 +806,E,3009 +806,F,5000 +807,A,992 +807,B,1374 +807,C,1721 +807,D,2175 +807,E,2379 +807,F,5000 +804,A,1223 +804,B,1430 +804,C,2190 +804,D,2457 +804,E,2922 +804,F,5000 +805,A,1136 +805,B,1036 +805,C,1097 +805,D,1454 +805,E,2466 +805,F,2748 +793,A,1051 +793,B,1654 +793,C,2434 +793,D,2096 +793,E,2939 +793,F,3046 +793,G,5000 +798,A,1131 +798,B,1460 +798,C,1720 +798,D,2342 +798,E,2871 +800,A,2076 +800,B,1858 +800,C,2246 +800,D,2718 +800,E,3493 +801,A,1158 +801,B,1002 +801,C,1871 +801,D,1863 +801,E,2635 +796,A,958 +796,B,1392 +796,C,1979 +796,D,2067 +796,E,2781 +796,F,5000 From 07525966b3970ecb7a5725112066d5b5d60bc17f Mon Sep 17 00:00:00 2001 From: Aditya Paliwal Date: Tue, 27 Feb 2018 17:51:10 +0530 Subject: [PATCH 2/4] Fixed bug in ui/ui_functions.py --- ui/ui_functions.py | 12 ++++++++---- 1 file changed, 8 insertions(+), 4 deletions(-) diff --git a/ui/ui_functions.py b/ui/ui_functions.py index 1ea76ff..167079b 100644 --- a/ui/ui_functions.py +++ b/ui/ui_functions.py @@ -32,9 +32,11 @@ def updateProblemData(prevFile, newFile, force): df_prev = pd.read_csv(prevFile, index_col=None, engine='c') cur_contests = api.getContestList() - max_prev_contests = max(df_prev.contestID) +# max_prev_contests = max(df_prev.contestID) - new_contests = [c for c in cur_contests if c > max_prev_contests] + tmp_list = dict(df_prev.contestID) + new_contests = [c for c in cur_contests if c not in tmp_list] +# new_contests = [c for c in cur_contests if c > max_prev_contests] dflist = [] cnt = 0 @@ -65,9 +67,11 @@ def updateProblemRating(prevFile, newFile, force): df_prev = pd.read_csv(prevFile, index_col=None, engine='c') cur_contests = api.getContestList() - max_prev_contests = max(df_prev.contestID) +# max_prev_contests = max(df_prev.contestID) - new_contests = [c for c in cur_contests if c > max_prev_contests] + tmp_list = dict(df_prev.contestID) + new_contests = [c for c in cur_contests if c not in tmp_list] +# new_contests = [c for c in cur_contests if c > max_prev_contests] dflist = [] cnt = 0 From 6638614ebae2fadd140543c3376f1019285a5704 Mon Sep 17 00:00:00 2001 From: VastoLorde95 Date: Fri, 11 May 2018 14:08:12 +0530 Subject: [PATCH 3/4] Fixed this stupid shit --- ui/api_functions_v2.py | 135 +- ui/api_functions_v2.pyc | Bin 0 -> 7775 bytes ui/bad_contests.txt | 187 + ui/elo.py | 8 +- ui/elo.pyc | Bin 0 -> 4251 bytes ui/generator/problem_ratings_1000_to_1100.txt | 20 + ui/generator/problem_ratings_1040_to_1140.txt | 20 + ui/generator/problem_ratings_1080_to_1180.txt | 20 + ui/generator/problem_ratings_1120_to_1220.txt | 20 + ui/generator/problem_ratings_1160_to_1260.txt | 20 + ui/generator/problem_ratings_1200_to_1300.txt | 20 + ui/generator/problem_ratings_1240_to_1340.txt | 20 + ui/generator/problem_ratings_1280_to_1380.txt | 20 + ui/generator/problem_ratings_1320_to_1420.txt | 20 + ui/generator/problem_ratings_1360_to_1460.txt | 20 + ui/generator/problem_ratings_1400_to_1500.txt | 20 + ui/generator/training_generator.py | 53 + ui/img_histogram.png | Bin 31159 -> 8873 bytes ui/img_langTrend.png | Bin 48497 -> 2467 bytes ui/img_tags.png | Bin 65410 -> 51311 bytes ui/img_timeTrend.png | Bin 30606 -> 2467 bytes ui/img_userProgress.png | Bin 50848 -> 27230 bytes ui/img_userProgress_upper.png | Bin 2868 -> 618 bytes ui/makePlots.R | 26 +- ui/problem_data.csv | 21936 ++++++++++++++-- ui/problem_ratings.csv | 255 + ui/ui_functions.py | 119 +- ui/user_activity.csv | 1003 +- ui/user_rating.csv | 23 +- 29 files changed, 20542 insertions(+), 3423 deletions(-) create mode 100644 ui/api_functions_v2.pyc create mode 100644 ui/bad_contests.txt create mode 100644 ui/elo.pyc create mode 100644 ui/generator/problem_ratings_1000_to_1100.txt create mode 100644 ui/generator/problem_ratings_1040_to_1140.txt create mode 100644 ui/generator/problem_ratings_1080_to_1180.txt create mode 100644 ui/generator/problem_ratings_1120_to_1220.txt create mode 100644 ui/generator/problem_ratings_1160_to_1260.txt create mode 100644 ui/generator/problem_ratings_1200_to_1300.txt create mode 100644 ui/generator/problem_ratings_1240_to_1340.txt create mode 100644 ui/generator/problem_ratings_1280_to_1380.txt create mode 100644 ui/generator/problem_ratings_1320_to_1420.txt create mode 100644 ui/generator/problem_ratings_1360_to_1460.txt create mode 100644 ui/generator/problem_ratings_1400_to_1500.txt create mode 100644 ui/generator/training_generator.py diff --git a/ui/api_functions_v2.py b/ui/api_functions_v2.py index 3431216..2f75390 100644 --- a/ui/api_functions_v2.py +++ b/ui/api_functions_v2.py @@ -47,9 +47,9 @@ def getProblemDataFromContest(contestID): r = requests.get(url).json() if r['status'] == 'FAILED': - expectedMessage = 'contestId: Contest with id ' + str(contestID) + ' not found' - if r['comment'] == expectedMessage: - raise ContestNotFound(contestID) + expectedMessage = 'contestId: Contest with id ' + str(contestID) + ' not found' + if r['comment'] == expectedMessage: + raise ContestNotFound(contestID) r = r['result'] contest = r['contest']['name'] @@ -79,7 +79,7 @@ def getProblemDataFromContest(contestID): return probdf def getSolveSuccessDF(contestID): -#contestID = 671 + #contestID = 671 urlbase = 'http://codeforces.com/api/' method = 'contest.standings' maxcnt = 100000 @@ -92,19 +92,18 @@ def getSolveSuccessDF(contestID): # CHECK TO MAKE SURE THAT TEAMS ARE NOT ALLOWED!!! for r in rows: # for each person - if len(r['party']['members']) > 1: - raise Error("This contest allows teams. ELO scores are not well-defined.") - + if len(r['party']['members']) > 1: + raise Error("This contest allows teams. ELO scores are not well-defined.") + users = [] points = [] for r in rows: - users.append(r['party']['members'][0]['handle']) - - userpts = [0]*len(problems) - for i in range(len(problems)): - userpts[i] = r['problemResults'][i]['points'] - points.append([1 if u > 0 else 0 for u in userpts]) - + users.append(r['party']['members'][0]['handle']) + + userpts = [0]*len(problems) + for i in range(len(problems)): + userpts[i] = r['problemResults'][i]['points'] + points.append([1 if u > 0 else 0 for u in userpts]) # Grab rating changes method = 'contest.ratingChanges' @@ -112,23 +111,30 @@ def getSolveSuccessDF(contestID): ratingchanges = requests.get(url).json()['result'] ratingdict = dict() for r in ratingchanges: - ratingdict[r['handle']] = r['oldRating'] - + ratingdict[r['handle']] = r['oldRating'] # Create output df # start constructing dataframe array_out = [] for i in range(len(users)): # for each user in the contest - hdl = users[i] - rating = ratingdict[hdl] - for j, p in enumerate(problems): # for each problem in the contest, make a new row - temp = dict.fromkeys(['handle', 'rating', 'contestID', 'problemID', 'success']) - temp['handle'] = hdl - temp['contestID'] = contestID - temp['problemID'] = p['index'] - temp['success'] = points[i][j] - temp['rating'] = rating - array_out.append(temp) + hdl = users[i] + + if hdl not in ratingdict: + continue + + #try: + rating = ratingdict[hdl] + #except: + # url = 'http://codeforces.com/api/user.rating?handle=' + hdl + # rating = requests.get(url).json()['result'][-1]['newRating'] + for j, p in enumerate(problems): # for each problem in the contest, make a new row + temp = dict.fromkeys(['handle', 'rating', 'contestID', 'problemID', 'success']) + temp['handle'] = hdl + temp['contestID'] = contestID + temp['problemID'] = p['index'] + temp['success'] = points[i][j] + temp['rating'] = rating + array_out.append(temp) output = pd.DataFrame.from_dict(array_out) return output @@ -148,46 +154,48 @@ def getUserActivity(handle): r = requests.get(url).json() if r['status'] == 'FAILED': - expectedMessage = 'handle: User with handle ' + str(handle) + ' not found' - if r['comment'] == expectedMessage: - raise UserNotFound(handle) + expectedMessage = 'handle: User with handle ' + str(handle) + ' not found' + if r['comment'] == expectedMessage: + raise UserNotFound(handle) dictlist = [] keys = ['testset', 'passedTestCount', 'author', 'relativeTimeSeconds', - 'language', 'memoryBytes', 'timeMilliseconds', 'problem_name', 'problem_index', - 'problem_tags', 'points', 'contestID', 'verdict', 'id', 'participantType', 'startTimeSeconds'] + 'language', 'memoryBytes', 'timeMilliseconds', 'problem_name', 'problem_index', + 'problem_tags', 'points', 'contestID', 'verdict', 'id', 'participantType', 'startTimeSeconds'] r = r['result'] for rr in r: - temp = dict.fromkeys(keys) - temp['author'] = rr['author']['members'][0]['handle'] - temp['startTimeSeconds'] = rr['creationTimeSeconds'] - - if 'startTimeSeconds' not in rr['author']: - temp['participantType'] = 'GYM' - else: - temp['participantType'] = rr['author']['participantType'] - - temp['id'] = rr['id'] - temp['verdict'] = rr['verdict'] - temp['contestID'] = rr['contestId'] - - if 'points' not in rr['problem']: - temp['points'] = 0 - else: - temp['points'] = rr['problem']['points'] - - temp['problem_tags'] = rr['problem']['tags'] - temp['problem_index'] = rr['problem']['index'] - temp['problem_name'] = rr['problem']['name'] - temp['timeMilliseconds'] = rr['timeConsumedMillis'] - temp['memoryBytes'] = rr['memoryConsumedBytes'] - temp['language'] = rr['programmingLanguage'] - temp['relativeTimeSeconds'] = rr['relativeTimeSeconds'] - temp['passedTestCount'] = rr['passedTestCount'] - temp['testset'] = rr['testset'] - - dictlist.append(temp) + temp = dict.fromkeys(keys) + temp['author'] = rr['author']['members'][0]['handle'] + temp['startTimeSeconds'] = rr['creationTimeSeconds'] + + if 'startTimeSeconds' not in rr['author']: + temp['participantType'] = 'GYM' + else: + temp['participantType'] = rr['author']['participantType'] + + temp['id'] = rr['id'] + temp['verdict'] = rr['verdict'] + if 'contestId' not in rr: continue + temp['contestID'] = rr['contestId'] + + if 'points' not in rr['problem']: + temp['points'] = 0 + else: + temp['points'] = rr['problem']['points'] + + temp['problem_tags'] = rr['problem']['tags'] + temp['problem_index'] = rr['problem']['index'] + temp['problem_name'] = rr['problem']['name'] + temp['timeMilliseconds'] = rr['timeConsumedMillis'] + temp['memoryBytes'] = rr['memoryConsumedBytes'] + temp['language'] = rr['programmingLanguage'] + temp['relativeTimeSeconds'] = rr['relativeTimeSeconds'] + temp['passedTestCount'] = rr['passedTestCount'] + temp['testset'] = rr['testset'] + + dictlist.append(temp) + df_userActivity = pd.DataFrame.from_dict(dictlist) return df_userActivity @@ -196,10 +204,9 @@ def getUserRatingHistory(handle): r = requests.get(url).json() if r['status'] == 'FAILED': - expectedMessage = 'handle: User with handle ' + str(handle) + ' not found' - if r['comment'] == expectedMessage: - raise UserNotFound(handle) - + expectedMessage = 'handle: User with handle ' + str(handle) + ' not found' + if r['comment'] == expectedMessage: + raise UserNotFound(handle) r = r['result'] rating_history = pd.DataFrame.from_dict(r) return rating_history diff --git a/ui/api_functions_v2.pyc b/ui/api_functions_v2.pyc new file mode 100644 index 0000000000000000000000000000000000000000..f5e015a9ec830d7f3f67afe4a7549e9aed4ac195 GIT binary patch literal 7775 zcmcgx&vP6{74F`ZR@&81uO!Q|6MG#JM*$*P1_Brx<9O}Zlp|mymntgEGTs?Uv!0z< zP4~)DO1cojkz+1gsGW`b4RZHY+L^?nz61>6i*edeYIpbX*1Hp0v`J zPN-mvjm=3Fj7w!o1rt)4R>7oH&ZuBYDpjs*ZE+f_jQ)kc)kTe}9pkFQEx#MvAZl7$ zMf*;g*wEP9ahyIg>!IH^eQWWV_i>r?C_+pvwxJF%jFyRt%3E73;C7Qm@4CZ>CQuw| zb*NNB?7Jp9{1h2qxoawn;V)~ch zD`Lmjxzzv1N4#OG#wW#bUV?wf7GE0ZCywFKX*_!Q%XI@D+t)aE-wnpmdSt@v75ads zjraVx8_KbCjzDM|IR2^lJlFUJt}o#TqSZ?R3UP!t2l~BIMnA~!Y@1uXpe(p)$naOTvb2436TdJ)XasjI=1L3v4@R|fnoh*G4hixOY zEHQAd>nbLQ=&jN%i1s3bm@y(=M?&G$+tQU0jY*#@-0dP*HX_^(t?1b@Y2uL?g_!R7 zu?a=Ko^?aZaXNwJ?YeLMdl?tS77g2A6uw9eoNk<|o5eUAN@WsZh5Mbb2`v3EG{)Z! zy)*1PgF$ErA?Of0hI*hgGyomsUjzdjJb{do)BqAkBT^%9 zjH>-_E1a_W<7GwMz-dKqfCwOC0fPfJo(`$(V{Si?0TLq7$NX$;1J=rlWkv1(&W-XL zjsnPNxykZ@04NK@3Oud}Eq5DUsOjE>JUlflxVxEp>~3tc1r!MpmyKWoOkz6Y6HMS;QUV}eX#*2 zd4dSxQ)<7a4kt0+IawtvG7F`qL`|&j#_sR67-d@R|GBrKG8ZW;`lGA}Ac@r+ol%GQ zKwZGxKlSckH6afpVYNq9wf~92F>(f~KkllZ!XcpgEH!B%+eS`2rvQq9+p1*FFNR;k;cdDAa;}2Bb+Quy6uqRtl&RE8?b6TCWzie7EHy2 zYn_7RHbD3jA0$BB1={bVfvfua&BS^&NWIG}-eEz69&An*sg&`SAd|(h*#X@MB}v(} ze6Qk6*33;tnsSo9+J2V#2aU9AWzjo9>|N!U9H%8^N0w>Bc1LtW&ra8#GCk0{Vb8TR z-V4{T0^P@ zV1^VA6zR)|Fse&^~@R$!YfiSL;^sC-JU`ifPJDH(rF1(vQPJq6FW9(9_F6M9?f%W+|J3qxIH81 zgSxO4ND!DQ7zKidN!<3%gVf3P?1Majp}F*d@mvS;vtgz{Vg^N(6*2@cy2}AvbWZ}o z>r}i*ogs%kM<&xu2RJ%d1G?<*X*BAO6OE_=8$x0)i5DS<7;&M(dFXlp*K5!R&V&e` zcV2fba11yq?@GEmuY-%sK*&c4*e4%k-gPHQL2}l$&bro|Yk{PKOMHOCY?9HjO!mIy z?jxaKY5_q_EwIn08hUZ6nf_F`gO=zCVcs{m>?F)m+|$7uPQnZ(mwd%Z$gYsQ=~`2+ z^_FW*y4Drfns6=9Jyk&9!siflu~l&`1Y>NK(Sm7l91&^cu?ndkaTEyK(L3USGLGik z@Tyhek(I0YpLrLu7avr@Ecq8{%`Hb?Hw``cdA{|CydLF-oZ>oOukr1dOLd&&WV+)q zj}kQJdv?%*1oj=@m@rs}r4*!)FkgRTL!MYGDqUn9IgW$ib%c1!i6NK99_7T2B|UY954EN?J8iq z%FM0zUpPa;C6JQ|xv2u=pP~Z7C4}=OkArUal1J#4xdrkzGO2rk6B5UdK{wJi!aMqu zaPWJ5o`deN_mYRX8~8yGm&o9#8z?^n6yPqc{x|2|MNYkQ|78xjoCBHo#ZGo2aHR3% zyqt6-!i>|bfuP*toS(9nFz(E~#FGH~zMJMRkQ*L4g-EOKD2TACdXeW!oH@;XI+QrX zz{Tn7JfX63K{G%^;JZjUf9Vp(c$dLnK^?}seb ySR^buC(L{h0QB!lYqzKaS&({}-l`vpib<=Dz{^tx*gB literal 0 HcmV?d00001 diff --git a/ui/bad_contests.txt b/ui/bad_contests.txt new file mode 100644 index 0000000..acd9ac5 --- /dev/null +++ b/ui/bad_contests.txt @@ -0,0 +1,187 @@ +925 +927 +958 +952 +924 +926 +953 +923 +929 +928 +921 +916 +910 +905 +886 +889 +890 +888 +885 +887 +884 +883 +873 +874 +863 +847 +858 +860 +861 +857 +856 +846 +852 +845 +838 +837 +825 +823 +826 +818 +819 +820 +821 +817 +813 +802 +808 +773 +803 +775 +772 +797 +774 +795 +784 +792 +771 +770 +769 +761 +762 +753 +751 +728 +730 +726 +718 +720 +717 +712 +710 +703 +702 +691 +690 +695 +693 +683 +678 +684 +643 +642 +641 +665 +663 +664 +640 +661 +660 +656 +639 +652 +647 +646 +638 +644 +637 +632 +636 +628 +630 +622 +620 +616 +612 +609 +600 +598 +597 +594 +595 +589 +575 +566 +562 +541 +537 +532 +530 +531 +524 +523 +522 +491 +484 +485 +470 +440 +411 +409 +398 +399 +396 +397 +394 +392 +393 +391 +390 +386 +374 +345 +328 +323 +311 +312 +306 +301 +302 +291 +290 +267 +212 +209 +207 +206 +188 +190 +185 +182 +172 +171 +170 +162 +159 +158 +153 +147 +134 +130 +125 +120 +119 +100 +98 +99 +76 +72 +64 +52 +50 +45 +44 +39 +21 +20 +15 diff --git a/ui/elo.py b/ui/elo.py index 795ec1a..f4839e9 100755 --- a/ui/elo.py +++ b/ui/elo.py @@ -55,10 +55,14 @@ def get_problem_elo(problem_df): def get_contest_elo(contestID): try: contest_df = af.getSolveSuccessDF(contestID) - except: + except Exception as e: + with open('bad_contests.txt', 'a') as f: + f.write(str(contestID) + '\n') return None - + if contest_df.shape[0] < 50: + with open('bad_contests.txt', 'a') as f: + f.write(str(contestID) + '\n') return None contestID = contest_df.contestID.unique()[0] diff --git a/ui/elo.pyc b/ui/elo.pyc new file mode 100644 index 0000000000000000000000000000000000000000..54a2a8e2858c4abe6d46225f24192e30faefd273 GIT binary patch literal 4251 zcmb_fNpIZ96@JBTE!}GEmStJCLwTH;p2TW7gG?qt296EMivU?Op&VFfz-Z89wZs;i zq*&Ej0O{l`lU(uxa>y}2t~umi%qc%4K#+6ty+^hsC^-anS}wAx__nI|y~UM(OxC~M z{AW9$@;8R}BMh_U5QX@sC?;wbbBAI@eTUi(sq$Ne+La+)mD<(ee1zJg!}%Ds$A|M8 zwd*pkP&`5X2DKZI1w!Qgp@#n}q?}hHY9644-0kHAoYyjosX^98cw`EFb%Ut>S4b~ZQM zwCk39u1(#;fzD4`?qj#)c8~mcpqc1_8~AZBh<&JVvpjth>%N=&HcIx4+f8%Vk7G#c zLq%kxG%>BhxYRVDXmvFm*lb{*;^NH=HcAN{9jB%hm?Oj2yzTczS3&Etmr5yJGbvJ_ zDA2#iLRcZL^aIvq>-cDFn(L0u2iiQu@~b1AALo(PFjgN$=>S$jo*dSX5}1AU6!+bz z>*|xpSkr2bK!hE~!_W6JKR4P=VevTM8}xNzzvi9X^2z)#?0`nL;cvDh7kh+@Kba6H)}x(fAG=Gs-Hz`gJ=!+ z*2+#rXs-QmeQSZGutB66>Ms6nISm!CW*!WC!L5r4qg0jX1zZ6qVDko0yMPq4xUkb? zuxyv1@b{lZe7oi9^igpbrs(^2UrwB*$Hgvd!j;RbC+GU0!|`eMwCx;6Nr&-r2WtTp zsen<BMJ1A zG+6j}JnRi6~M&aC|?{2<7T zL&le}-+vSO4_j;o1~nN-xHl~KedH&`XOb1cI_OKXG=qTMWI4aT*xdFWzueq@R;(WH zmMa#J`w0-qo_q0lck|^F&lBA7CqK*LQxO^^RUB`peq?&U^)u=PC zrks07A~mP(h=18s9_tw93%K)izRV(kDML!pt7M(3u>YV=`7SA-R^dvDvIr3T{tiPJ zNbObGAq5*yDZS3Ckm%>Tc;Eo>r3m`pBB~&Z%QUvo zvDBoJ!iEV#5@*v#=%mf@v+>&F&_Ishv?$aZBb-Y>HAZJ6T$Go3Q>F2WH^z#MQI;ed z`Nge%Eqm0PhN5b_!f?JQWd7P6C}t!Q`}=W~gM0Tq%<_@OdkyWp%JK~U$D53S*WV0c{Q!()NM5a`18Ap_q5Y+ zCe@NNt7g@L6L667_&?WFkJ}=TohQZAo8u*?(jw?FdEY}zy7ic!%|=ABKRTU0+MrIy zaO9(bL#n#(u6EsS?C-f~cka7s*+HRIYPDK*anrH6dx@M8#En#xxP|-OJ{lD!_SQgV zR+u(P?NEGxR)rfzH_^vMcgLih_XR@xXk^e;F(jiT)F*~PxL$Uh%=TpKD`_=L=ecs8 zR^2d~pFxd8j5Ncd0X5gO>dpHspOu(XBdHr5XNKN|Z-k0l=L-?N$)KN|dbfGW?#=up z^o{pZUbB19e092mM4C?1Ir_|#=;X)=(m2+|zC?)UV$Z_Bcu zgMIiyqmeWw+Do{@^f*Tsj=RA#jx%oqkJ5Pw;;Pf}xGBAetcxBSi47J1O0#S%t~d97 z#5|v~D279KUtVQVvS|m+xJ2JebkcGsPyM)Tf00$zi~nP6A@=1?gD5OA2iMq3L1iR^ z2!A&onEeY7%j|tC7dz@pT-zYl55=Wh*l4I3^t=s}Dhy{viq|NjwpOcE@Hbyuu2oRR cRIM_N=OSXb7<0^_ZdK>i9q={Ol4?5t1}W%l#Q*>R literal 0 HcmV?d00001 diff --git a/ui/generator/problem_ratings_1000_to_1100.txt b/ui/generator/problem_ratings_1000_to_1100.txt new file mode 100644 index 0000000..d3b5faf --- /dev/null +++ b/ui/generator/problem_ratings_1000_to_1100.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/469/problem/A +codeforces.com/contest/460/problem/A +codeforces.com/contest/244/problem/A +codeforces.com/contest/318/problem/A +codeforces.com/contest/214/problem/A +codeforces.com/contest/25/problem/A +codeforces.com/contest/369/problem/A +codeforces.com/contest/23/problem/A +codeforces.com/contest/519/problem/A +codeforces.com/contest/805/problem/B +codeforces.com/contest/610/problem/A +codeforces.com/contest/387/problem/A +codeforces.com/contest/376/problem/A +codeforces.com/contest/46/problem/B +codeforces.com/contest/4/problem/A +codeforces.com/contest/579/problem/A +codeforces.com/contest/859/problem/B +codeforces.com/contest/195/problem/A +codeforces.com/contest/515/problem/A +codeforces.com/contest/777/problem/A diff --git a/ui/generator/problem_ratings_1040_to_1140.txt b/ui/generator/problem_ratings_1040_to_1140.txt new file mode 100644 index 0000000..04212d0 --- /dev/null +++ b/ui/generator/problem_ratings_1040_to_1140.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/263/problem/B +codeforces.com/contest/572/problem/A +codeforces.com/contest/611/problem/A +codeforces.com/contest/413/problem/A +codeforces.com/contest/387/problem/A +codeforces.com/contest/735/problem/A +codeforces.com/contest/742/problem/A +codeforces.com/contest/359/problem/A +codeforces.com/contest/43/problem/A +codeforces.com/contest/560/problem/A +codeforces.com/contest/205/problem/A +codeforces.com/contest/352/problem/A +codeforces.com/contest/82/problem/A +codeforces.com/contest/137/problem/A +codeforces.com/contest/479/problem/A +codeforces.com/contest/284/problem/B +codeforces.com/contest/137/problem/B +codeforces.com/contest/680/problem/B +codeforces.com/contest/234/problem/A +codeforces.com/contest/669/problem/B diff --git a/ui/generator/problem_ratings_1080_to_1180.txt b/ui/generator/problem_ratings_1080_to_1180.txt new file mode 100644 index 0000000..20090ed --- /dev/null +++ b/ui/generator/problem_ratings_1080_to_1180.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/379/problem/A +codeforces.com/contest/157/problem/B +codeforces.com/contest/876/problem/A +codeforces.com/contest/195/problem/A +codeforces.com/contest/875/problem/A +codeforces.com/contest/322/problem/A +codeforces.com/contest/608/problem/A +codeforces.com/contest/177/problem/B1 +codeforces.com/contest/82/problem/A +codeforces.com/contest/779/problem/A +codeforces.com/contest/53/problem/C +codeforces.com/contest/805/problem/A +codeforces.com/contest/864/problem/B +codeforces.com/contest/132/problem/A +codeforces.com/contest/955/problem/A +codeforces.com/contest/102/problem/B +codeforces.com/contest/357/problem/A +codeforces.com/contest/55/problem/A +codeforces.com/contest/368/problem/B +codeforces.com/contest/106/problem/B diff --git a/ui/generator/problem_ratings_1120_to_1220.txt b/ui/generator/problem_ratings_1120_to_1220.txt new file mode 100644 index 0000000..e8a43a5 --- /dev/null +++ b/ui/generator/problem_ratings_1120_to_1220.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/137/problem/A +codeforces.com/contest/66/problem/B +codeforces.com/contest/299/problem/B +codeforces.com/contest/284/problem/B +codeforces.com/contest/355/problem/A +codeforces.com/contest/706/problem/A +codeforces.com/contest/757/problem/A +codeforces.com/contest/242/problem/A +codeforces.com/contest/366/problem/A +codeforces.com/contest/483/problem/A +codeforces.com/contest/102/problem/B +codeforces.com/contest/357/problem/A +codeforces.com/contest/43/problem/B +codeforces.com/contest/556/problem/B +codeforces.com/contest/618/problem/B +codeforces.com/contest/196/problem/A +codeforces.com/contest/766/problem/B +codeforces.com/contest/719/problem/A +codeforces.com/contest/686/problem/B +codeforces.com/contest/379/problem/B diff --git a/ui/generator/problem_ratings_1160_to_1260.txt b/ui/generator/problem_ratings_1160_to_1260.txt new file mode 100644 index 0000000..8df7cb5 --- /dev/null +++ b/ui/generator/problem_ratings_1160_to_1260.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/357/problem/A +codeforces.com/contest/519/problem/B +codeforces.com/contest/227/problem/B +codeforces.com/contest/670/problem/B +codeforces.com/contest/63/problem/B +codeforces.com/contest/80/problem/B +codeforces.com/contest/219/problem/A +codeforces.com/contest/667/problem/B +codeforces.com/contest/544/problem/A +codeforces.com/contest/285/problem/B +codeforces.com/contest/402/problem/A +codeforces.com/contest/18/problem/C +codeforces.com/contest/527/problem/A +codeforces.com/contest/651/problem/B +codeforces.com/contest/133/problem/B +codeforces.com/contest/327/problem/B +codeforces.com/contest/545/problem/B +codeforces.com/contest/155/problem/B +codeforces.com/contest/361/problem/B +codeforces.com/contest/26/problem/B diff --git a/ui/generator/problem_ratings_1200_to_1300.txt b/ui/generator/problem_ratings_1200_to_1300.txt new file mode 100644 index 0000000..90566a9 --- /dev/null +++ b/ui/generator/problem_ratings_1200_to_1300.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/766/problem/B +codeforces.com/contest/363/problem/B +codeforces.com/contest/799/problem/A +codeforces.com/contest/467/problem/B +codeforces.com/contest/208/problem/D +codeforces.com/contest/596/problem/A +codeforces.com/contest/255/problem/B +codeforces.com/contest/180/problem/F +codeforces.com/contest/755/problem/B +codeforces.com/contest/387/problem/B +codeforces.com/contest/876/problem/C +codeforces.com/contest/433/problem/B +codeforces.com/contest/69/problem/B +codeforces.com/contest/178/problem/A3 +codeforces.com/contest/370/problem/A +codeforces.com/contest/60/problem/A +codeforces.com/contest/332/problem/A +codeforces.com/contest/347/problem/A +codeforces.com/contest/400/problem/B +codeforces.com/contest/277/problem/A diff --git a/ui/generator/problem_ratings_1240_to_1340.txt b/ui/generator/problem_ratings_1240_to_1340.txt new file mode 100644 index 0000000..2280d6d --- /dev/null +++ b/ui/generator/problem_ratings_1240_to_1340.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/740/problem/B +codeforces.com/contest/701/problem/B +codeforces.com/contest/104/problem/B +codeforces.com/contest/145/problem/A +codeforces.com/contest/930/problem/A +codeforces.com/contest/708/problem/A +codeforces.com/contest/456/problem/B +codeforces.com/contest/43/problem/C +codeforces.com/contest/682/problem/B +codeforces.com/contest/655/problem/A +codeforces.com/contest/944/problem/C +codeforces.com/contest/26/problem/B +codeforces.com/contest/877/problem/A +codeforces.com/contest/416/problem/B +codeforces.com/contest/292/problem/B +codeforces.com/contest/107/problem/A +codeforces.com/contest/129/problem/B +codeforces.com/contest/94/problem/B +codeforces.com/contest/426/problem/B +codeforces.com/contest/101/problem/A diff --git a/ui/generator/problem_ratings_1280_to_1380.txt b/ui/generator/problem_ratings_1280_to_1380.txt new file mode 100644 index 0000000..32f7606 --- /dev/null +++ b/ui/generator/problem_ratings_1280_to_1380.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/505/problem/A +codeforces.com/contest/682/problem/B +codeforces.com/contest/922/problem/B +codeforces.com/contest/58/problem/B +codeforces.com/contest/567/problem/B +codeforces.com/contest/217/problem/A +codeforces.com/contest/902/problem/B +codeforces.com/contest/83/problem/A +codeforces.com/contest/625/problem/B +codeforces.com/contest/740/problem/A +codeforces.com/contest/289/problem/C +codeforces.com/contest/508/problem/B +codeforces.com/contest/872/problem/B +codeforces.com/contest/913/problem/B +codeforces.com/contest/262/problem/B +codeforces.com/contest/755/problem/C +codeforces.com/contest/318/problem/B +codeforces.com/contest/236/problem/B +codeforces.com/contest/359/problem/B +codeforces.com/contest/462/problem/B diff --git a/ui/generator/problem_ratings_1320_to_1420.txt b/ui/generator/problem_ratings_1320_to_1420.txt new file mode 100644 index 0000000..c7d00ca --- /dev/null +++ b/ui/generator/problem_ratings_1320_to_1420.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/476/problem/B +codeforces.com/contest/469/problem/B +codeforces.com/contest/414/problem/B +codeforces.com/contest/186/problem/B +codeforces.com/contest/967/problem/A +codeforces.com/contest/648/problem/B +codeforces.com/contest/116/problem/B +codeforces.com/contest/385/problem/B +codeforces.com/contest/426/problem/B +codeforces.com/contest/573/problem/A +codeforces.com/contest/257/problem/B +codeforces.com/contest/180/problem/C +codeforces.com/contest/161/problem/A +codeforces.com/contest/780/problem/C +codeforces.com/contest/176/problem/A +codeforces.com/contest/862/problem/B +codeforces.com/contest/576/problem/A +codeforces.com/contest/413/problem/C +codeforces.com/contest/805/problem/D +codeforces.com/contest/699/problem/C diff --git a/ui/generator/problem_ratings_1360_to_1460.txt b/ui/generator/problem_ratings_1360_to_1460.txt new file mode 100644 index 0000000..8e44bc3 --- /dev/null +++ b/ui/generator/problem_ratings_1360_to_1460.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/493/problem/A +codeforces.com/contest/610/problem/B +codeforces.com/contest/631/problem/B +codeforces.com/contest/270/problem/B +codeforces.com/contest/316/problem/A2 +codeforces.com/contest/514/problem/B +codeforces.com/contest/752/problem/C +codeforces.com/contest/975/problem/C +codeforces.com/contest/475/problem/B +codeforces.com/contest/919/problem/C +codeforces.com/contest/17/problem/B +codeforces.com/contest/471/problem/B +codeforces.com/contest/383/problem/A +codeforces.com/contest/900/problem/B +codeforces.com/contest/489/problem/C +codeforces.com/contest/940/problem/B +codeforces.com/contest/699/problem/C +codeforces.com/contest/587/problem/A +codeforces.com/contest/262/problem/C +codeforces.com/contest/304/problem/C diff --git a/ui/generator/problem_ratings_1400_to_1500.txt b/ui/generator/problem_ratings_1400_to_1500.txt new file mode 100644 index 0000000..3fb800e --- /dev/null +++ b/ui/generator/problem_ratings_1400_to_1500.txt @@ -0,0 +1,20 @@ +codeforces.com/contest/363/problem/C +codeforces.com/contest/799/problem/B +codeforces.com/contest/673/problem/B +codeforces.com/contest/560/problem/B +codeforces.com/contest/152/problem/C +codeforces.com/contest/203/problem/B +codeforces.com/contest/526/problem/A +codeforces.com/contest/907/problem/A +codeforces.com/contest/128/problem/A +codeforces.com/contest/811/problem/B +codeforces.com/contest/518/problem/B +codeforces.com/contest/453/problem/A +codeforces.com/contest/588/problem/B +codeforces.com/contest/922/problem/A +codeforces.com/contest/848/problem/A +codeforces.com/contest/271/problem/B +codeforces.com/contest/584/problem/B +codeforces.com/contest/937/problem/B +codeforces.com/contest/614/problem/B +codeforces.com/contest/608/problem/B diff --git a/ui/generator/training_generator.py b/ui/generator/training_generator.py new file mode 100644 index 0000000..f871778 --- /dev/null +++ b/ui/generator/training_generator.py @@ -0,0 +1,53 @@ +from random import * + +def getProblems(): + problems = [] + + fname = '../problem_ratings.csv' + with open(fname, 'r') as f: + lines = f.read().split('\n')[1:-1] + + for line in lines: + problem_data = line.split(',') + problem_data[0] = int(problem_data[0]) + problem_data[2] = int(problem_data[2]) + + problems.append(problem_data) + + return problems + +def createSet(minR, maxR, n = 18, hn = 2, hard = 50, width = 100, jump = 40): + problems = getProblems() + + for i in xrange(minR, maxR+1, jump): + low = i + high = i + width + hardR = high + hard + + l1 = [] + l2 = [] + + for p in problems: + if low <= p[2] <= high: + l1.append(p) + elif high < p[2] < hardR: + l2.append(p) + + l = sample(l1, n) + sample(l2, hn) + l.sort(key = lambda x : x[2]) + + out_filename = 'problem_ratings_' + str(low) + '_to_' + str(high) + '.txt' + + with open(out_filename, 'w') as f: + for p in l: + s = 'codeforces.com/contest/' + str(p[0]) + '/problem/' + p[1] + '\n' + f.write(s) + + + + + +if __name__ == '__main__': + createSet(1000, 1400) + + diff --git a/ui/img_histogram.png b/ui/img_histogram.png index 24bf57e83f3140bc16e0c503efc4dedb1fa25dc9..0ca4ed1fa9ba3b880280c00ac25bcd559fb9960b 100644 GIT binary patch literal 8873 zcmb_?2UJtrwl;{OQj{*B(i9O0z4t0bP!uF?sSCc@z$H>UY%*=fL{P_zPE?m5Lk%fhYm6er^jg6h1or8np(xpq6FJI>5 z%>CN3^6 zAt50tDJdl-B`qy2BO@a#D=Q}_CoeCrprD|rsHmi*q^zv0qN1Xzs(S6(H8nLgb#-+O z4Gm3A&Fj~%YiVg|Yir-QapUIAn>so=w{G3KefzequCAV*-km#l^!4?jQ0U#ecL4yn zckiBofq|i+p^=f1v9YmHYin&CJYTFqpZyxrK#=rKP2nm6f%%wT+F9t*xz{ zot?eCy@P{;qobpflasTv^MeNu9zJ~N;^N}!>iX!>BR4m<$B!SoySsaMczAkxdVzma zP;YNFF66882VH%*@Pu_3BktR#tX)c1}*t>({Syb93LkdGq$|+jsBY<>loek;wP& z-{gwv6nwr|$+Pb>B z`uh5hA3ruUG<^E>35`Z$Fqp>1#-^sG&!0bk`SPW?xfzSawzRagwzjslwY9gmcXV`g zc6N4kb$$K%wY$3;hr{*s^nCyRy|=fwudlDazkgt0U~q5{kH-%U4Gj+ukBp3rj*gCv zjs5uXV|;vkVq#))a&l^F>gUg&)6>&4Gc&WZvvYHE^Yily3k!>ji%UyO%gf6vD=Vw3 zt7~g(>+9!fO!vJ%Y$_S2U&h=@r}3w#V{Rb~+{#9SuDEyo0_!s8an zR3nKgu8ZwtazC=cGpl*lBY^1B1tpO#GVT4O0g~Go(cLABAsh z-m9@TQJ~5bRmj+04y?-m?$*50mfv1ez3&XQDtVZCZzq*&(%MkMWV-sXfx1)BN&^#D z?KIt-P@odB3;6;2P&%V_skY@)3bf!LS1KUv@1stq7_GRpAu zSm|5iO>>oC$Uymh81fu{vM?!L?bFgy95n~&Gd~stWwGR|LHcLNqo`s*0UTHEjg+#H zp#pi|<^;U12R^E0DEKZtVR8`oar6@n#Xk?h9k8{x=rya@K&AeAKWu%lBO7=4@f=12 z$ewaHF_s+grbPtGJ%x~bHAV#DxX<*F8syrX2U_W&xOb6^|oU$9WZh9*(iRUp*w;QA&yQ3=e8eg(X68 zbB@mh@arq;E$^L+=&a1R>9{uv8d{im-6r|YGNPNG031G1^ePZawDMsSqe4+>5rgdn zN|lN?6krDDM`(6zFm}W-u#v&S*q{_BQE+~u$y!L_1ooPHmt%`4FO*O`awKuo(>BOu zET?b?rmK=N4+#-LoYFG;^)%R{TM-=Q1lZ`&G)n*E$~Td~phRi@%SMv$jm6D_PFl&fVP?aa+(Y{H)Hs{g$}?!OYh@~XYK`>WZ3(sh zW6+toYvj&1bXoI=U}1|=e@yznn#MC=doP3LTb1)2Njv|Ig5+Far^;Vn=-T+askvk} zO;5_T?YOeQK}4W!zhXb#4j8yM(nhNwA!gu0jmZ6%L+YjjOZpQ0I=33%fELGdL7Si} zi#MAYkDMk=B@(^Rk|?AMLF-;!kwa8fl}ea4PA%8Tv7`G11I)Hv6-Y2H3w6akKd_8z z?(TJY1oOOT%L2hPIx^2eZ`OXA&Jwk5fo&lSqLrzUw1&zD3Wu2vN1>K)3TH=A?I$g)2Q0mOM*us?t_G%|HC)awrMO9@j^TS0LOUP_!R_((lUY!%*IMBGs6MU9fMUi zUtV6n4jOa4pY#fZ#JIoSC)^X&(3GIjNy{r(Xu^%Sp%^a5iEd65>Z`HL^K1HGu{Qtc zTvXpsfnWyA1iAQ-Q+E|jMuEH=ZmBoFMlmD~Ve+>MqKv#kowsV{ z3`6}eRu2Ne^aDSj4|!?wjFhOfj-z1koIudAfq)pbeG3CRPU)!fC__YE3TI0^yR2Il z7!;VY@^rB7?PB*u3cN`i`@`dD+3ByWwQgx~uz2-!R(veDVe1eLQw$$WMKv@qX$9v9 z{>pY*708~X=u-ew1yw=9RH(2n*9jJI1_088WsH0PyO@~eK@P)EX_0`10&L`j&oUcy z_&Al;>rj}!2`hMoH=udOoSgx7BBmgEZL}@d`wk84nfrxo+-3~E;Im?ea3BA{>ju4Y z0go!RrF`N`Q^&KXm`43&uRL%FU(U~Z7-X8#^;sRosDm8kBj#q|VJ9T~#k-~{cQj{O zIk;yOu@%`e7EIq|xsypXQ02h@nCkS95b4$p`kkW83+`0iO@#Fn_ovrowP!@rBoUq4 zP9Q~DfTj|PS9g6FJA-2HUs(PZq+bXS{tImmu?JaH@i=H~px9;unJeEbyoTmmF}#w7 z>)ID<>U9eoYpLjXD2@jfPK#5(^%)diOiG^HyL<`98MQLJ6(wSyu|lGQJl7_pAM zMm4{3y>30Jc~TaIGctwXjCl)s1At3xP*0;ZKrMSf*JHXB~{*wVu26_LV~ z94qUCwDt#@Qm9n_blLIU#P?HuT@3&Y1WOE?x z76|`7s-8NBwoCgsAQG?^dQ?Ioc#Y*djkI3@S|RF2dFSz0xP2asI)ai z>H#bj#gR+{`|=;qh2Jt8ox zW+)(q-$*>8xXeegx`@aqYEbYd)8MdTQlmrYoT+qH6@m=o=s*=MK1FCxQSDGxUeya<2ANDO%JnSkDl2C)1vn>- z8ZzU@AKyGzCeqddvDDbJu(060x`uKqHUul0<}@#^qZ2-U5~bPzUrV6y_hmn{T@dEj zUdS7DXn6!MuXC={$@Qo!^~}T<`+2F6iP@~pcjptiuA1Kg$qU$d$Jn9@qOViG}$+_w{7({!sOn|I<68Ud0-wUE+&{miIsO3wMZP_JawDusIK)w4L8A zqzweg^$LrC;8w4DmBxzO=pZv)LVmSoHmme51X!dv0y;)iR7+~c85Xl$Rnf!5O90fl zBAH~#ez^^CqjGHIt;CUE)=Z@h3o4g8MG5|(wv#~r2?Sb{svx@ngFqL&f&QHfND85u zZxJ$k9(pRn#iiyaLWRyzTP;6P3xpVP8s1dGAe`-%F|o&BD*l0Q#_y zE*yY_98rk>6`{5v8x}QX%BluN#;%&9nY8{+p|z;@jH1R_F%|!T0>FU`#jSx-v;1fwV39frfHx3txr5bpm0#swOKrqapC(=UNHB= zr(XjDIX{tcBUsERVBwr3L3)r#`||)M%j3-<$nx@ku+RYcH1=V><$WGYCL0G5`*hfc zB)wTa0!BmU5*u`HMH#+kLMR^+cIuQmvbWJ<6tFPSuaiKIB7_MP0Kaqw(L0JGCH)J1 z35Q^6Ebze&F1XtLJlO=YQ~E2bIS7T9jua>=#`a*-64RB_8~*F!8`9)>JvTIC`T z7uVA5NCJRN&t=`FN|!;sL<=A3Abaww7BzICmQ0La5fa=Pu=xSSGF7QElWmxEq4h9%Eh+hQJI(a7V5|}LU<#hNX^ffCbh?SkYW)l&Zi%@bl z#HkGPzo_N^Tv7f|7rNIWnqo(iGBcu6F*vbR<6PH+UJ7dneH*|53HeKycPS#TzYYe8 zwEmZP0*mHJq9G&@r=Buctln8%C&>5&?YDNYkUi6pcj5Z7S7DLIPz}H2OJpDXo3GxC zUAbp7V+ai|(pTwFt~>TxBI@w6mJw8Wib2nQfihE;saq{BhXBf}T#h7FO%97u_F->s z$()Y3i2@)s3)4A_h)2Hlj0*X)^nc5h$r0FTP+Y{wR~r z`AT{2vY^*%4D6@xT>(rXV}Csl3r7BzbX|!Tf^kDShJPv7l-vkv7`@E{6yBs{5oZD3 zRYo484yg3zRi^g?euSIMi|h2m)^!MrTRt1tA$k72E*cdC;9@hXP>vGb z%aWhEVgkY-1ca#)0{QzE4A^~CoAyHg1;>3ru)=29MVHjzTIykVoS0= z^WJ%p)A8qHhz1zyNf$G{C2g$R)PcQ^h|u?NoWUwltj17vRF zb4GKnl1{n4M*$dL*2GIb5Kv&Bf_Z|W8+)1q7jTGZ8smPRCoL6yWy$hm!t>r{t6 z04CwE0Qnw^cT<`ufYT&7P_??7MTu@>E{t9tw|+J1dS_OZW;?JS8eqIu-28^f7$R^@ zNHK%g8Um)2%&(wOrNXBCyZHH=xjEoASP~nH&%rtkEJ2aA6$8$|c1F?V4G4m7 zyNFgszGkq$HqiY>9&!2Wn;_E&CvuplA+sJb9ryF0Ue-1cr=4}iPv`?5eB9Ai8#RC~ zs`%2=)aSC1Y{OsirqNP__-Wq|+nhApIyH;0Xg}6!HLZ4J;Y%H6xhToyQ**7uYY^i> znA1{Wr9?eJgAfPf?(R@G=cb^^yFFw6vy2T)r;A#<+u0qqe(l2@*xPzGzMn zfwU~YzAPQ1VmC+WT6kFXN(vZ3IrL!7T;3Q(;7@VLb*xc>AL@&*0)z8qZeBgtb8 z*`YL@oR8lh^BPJp7Qb}jxaelNM<|_we7?u?Xai&MPfWZQyoORyR9KoCXV4a{)mmy^ zFVyZ18=|6y0+nqX{X8ZL2KRlUh>VK@GB+XtxMdh#0t^^VuOTqU5L3RF7-08a{o5N* zsu3(B!TQ}Mc7+_lle`oDx})&xL5N3aGH^694v-g(_I!^%ko=KLH*p`ct8@LrZQG7t z11W)fC428yO8FB$@)IWX%=G8z++Nqn)iX283QGzMSz5COCsu2Bo?qKyVBO{Str}wB zW+QUux()exHS{|dJTTk&tM}n9ih=N0YJ7MexM}yE^_a*cN8OF@qpnjyE5WPdZ1`K--N{~GY?gRqWU3aH1s z=I_;I7wYU}hs#pzWnU)ksYRaj8D+@K^n-n@AO%(QG&^pXuV-j}BEOlbQj|+Kbioo@ zEF?nGcz3Wu_IA}}kxR^DB|W0o+&@tcQJ+LU1=<~i%iVrGt*kb03C$96C3);1c6I@& zA6H2oSyeLFEsVK4FFZtT`qc|w>g>B+2F$-p-OZ8e6m}6PW{ylczo^(ETU!j(oKO=5 zrE-eF>&^O`&owkia4Jajc;cX7Ocf88zwOO#iXkl0%Dl|7owdr)+dk343XSGF*?)si z&&anau8OuRV2x^Ke{vO%^^dMp4W`<}d##Nv6jOMA>w>q&aY@t?b*neM=hRv# zD*TG89#)ComqQzr5A7~mSLV5>@wbM>k9a42b7*M^@GeRW?dJc|0xvJ;tMxGC)AM

71E1gK8K zPs9fNcA$@QbL`EySlr~~f55ssvaq*hzQwil&1xq#`DUJ(5;6u3TT5PzI*YF1GJdYz zet>&y5=jO-jjXb2rd}c4@T;^8^IqYKa&ql4UhGwz5Muvces)t}a?bM0-D@)oGJ=|ax0Hbmd3L^32giC%?s7S2Z>2uSVC*RcB7 zJ?LNZ-FseMu=Bh;?rYtkkoUo)H)&g~`@+eg-B#zJne=@dDDp?6PRfC;=9#@~))Ns4 z)H8brvC>=W(dqF%GaFRojYacz=4I{p9Zz$E1#zp^S8k?Q*^FMHofOtI*{$!E-gP!D z>K|GgC@1z<_p^o$-q$o%Z;j>D?P%#BzcdF! zV^z*4J~0S9-ccWwLJ2RR{2oN~dbhZr)oy(zCc=vw@Qz3d1iQKU`v^*nMIkRMNYxfB z1Ut^iFF$tK?u+Ve_uG}IX>vZ#iO{U^x4|g92=ZTq^)!*e7&lBy4yro1RFvz2X=9LIm~}&ZdyBs`(J(o`ui_Je?JRex&(EZ z9X#eJ!|Y8`uS(CA#Nxf9SRS4xK?ffvLA@h}Z7Cw{0swicJZ8}Xz`QO#0-(f5o|_qB z`LgRV)-rI$H)E%~r9G)vKw-5lU0BY9&Z~3MSrGL$BWZzu>ro-l>$j>QGEgqmp5~lg zOM>Bf#2?BatuwUPtA%MhA3i~YHGaH$dnR%tZ6m4|zc5=qTcm z#S&|-xZ!V!CIW_aF`H{ocd8ev-CNfEtm{r>IFi%kDQvXwM2hsZE4cOz57c>mt62J4 z)MR~7(0XyhUFTpohub_|(5jQ6csDa~$hCc6Knba>z(IyOS3#tzEo~(*UQk$g(0J?`iVK2rbp;J+s<( z+N!v4eYn{TmEz-JrQ`A|gS{ytFh{{5yvb!m|8|0k6`skpcC#kZH7eEBekQs#{N&l( z!5P1+@Pwba7C#nQc+2X9)MsThkg;v!9V2r2rm-fg#&1_bUsa;}MERC*thIB#lQrgL z8-}zqIRk^M!Z0~e17s6}wV#iDaqskx{gHzyE7$qJJon`Dtkme{H9Za&k7$7mzb@AI zvD;^8?6X~^9(hEoLsRrOG{8V=<%D{T#QLw-?7HJcobj%8VyNv&D?>8aoQ#CK&w85o zw{Wg-Wsb+2TkdpTBKNg!Oaa|aGGtCKeNKfu?QFV& zr&>n0r%I<0%=WWCeblWF8c#Rxntl0v%a`1r9-6xn3QK*KuyY}=UZxK6?F(h|Bp^Mq z&7jcqPHmD9zSvMU)VmWI)e@}mZ?_^?Q3KsJU1b+@njYQxX0Gsh;f~mj)78dkpySrR i)sg?%#fAeC=cEy=<|E|`;QyQuXlXJx;IO7bCs)y-o>kJ1}tA&!rUZ+9yciF9)RUS=?NVB$3|Kt~N(< zXmD~&6rU;uTDLImJ|rvCMXpwh8G*Ug`^nH}U5b_|t{Y=(zwGQ)bFvVrk{-W&Cg4W4 zW9AW&!&it+J|%v#O*bt(vBN)0%1rZK?YU#r9OGxUyZ5lUl~y0yuz!%k@FPix77@xBqeI(tSvzv0c9IdzZDqlAflAn@lo`8tw#ZAE`H=SWox2 zcD{GPd9ysWiqx&HmT9cBaOuquq>E*TGsIM;JTK@c+K|!;*&NPlt!CnxnWM1PWYuO1 zy8ZYv%mAhAeNE_|rAWcM1d_P;PCKD_!3z4+?t#MGD5C~aQP(>`)a)sGpKosRsujbt zW{3FRY$UaQs)UFr6QMAm7;(oh>p7OuhSP$_XPYlEnEAu89O7o(KXEtT-Hm^R=e^#x zL{1kbVi*(PAu~l~75bUVzYo{ey1(+Sf4BbR=>DD{dk@1Lsn_?KByru_Tlp@1JwNcVJErHXCqhF9_wF-P7VQ8)cRe#!+2(Dw97X#e5tv|?@2~Z zM+imYFJLUx+rHL}9(RyDRz6leetIl-taD6c_%qB}{aCV^()GSpK;q!slEL1(m$T*| zt8AT)(!-2^a!qH+4k;FiB8jixk_VVDB@Oz>2G*zes~qbcnNSj%8wLjtOSp^PY9PuX z<2wrbGI5t#T#A_YN&84VA0NOfQ@4EdB_RgCpWNT&E3S>iU6bm_D} zKYiffAaIhR!pe^D>yv1%ca1KNcdRx)N;>zUh#o&hUqF4r(@7!9EDS-q@O$7R!if4N zH19D*Hj9O_;@gp6rUto*5J5R8$d_l5v?lapz}lhEbF2W#j9{ z4y=4a%bN%oy{v^$oZdg&7$}qHATW*PqIONJ{!e zL`8`kt>nSw6%;V#dQe?|%AKGXSuKHb-!AYe=hamuq~Q_r%kw$W1ApHY9D+LmdGoH_ zhQfd6gzZ7GO?RKPm#E}3Nf2G#4j>kS#Ri&xh zYOIUZYILnxKIPl0FMC-v>9D(5x1~{4(#1I*v!Ls`BQ|OfEI=hBG%drTU90RcY80&y ztLw7CQI+9?-BfrkOe|=-BnxJG*%@47e zYi$=enlRWMfOJ&``r*-byt&-F7t8m$@C5C!+^k5c&h~;^c@D7`Cz%Q%*ke~KnHt&bvA{`Yl(n<<=DJ_-?=UqQ7{%WNpPB2dhqp#62z*`$JX)_8koC!1&V z;ky;*AJ+4sPvV|#?3~ULHks~PFYbJRLx`nq=1_}$wzU2T;Uj%Y77DnvEd`?efyu_R zO>;RSpDgq4uq43&atU80c>xt-5)xS}CDR4&`}X$sikh0{mq|{GL}l|JiYySS8H(x^ zbsT>p^Bm838CX8=&y>yNl64tockEa4hvZjm3n zYm9qYo^e?HS@K+2Xx#!wS|`gNgJrhy&H4NZSvVI4lw!<>3nOpbbA4Ezedyt~BCX3h zj!w<`7HpVzXgGS_&mV%{oifzGI{oPavU1xQ!d<0CosS8# z*3f^Io$%(yvYB*1Z=vV3M4U!8&XD=TFvc8*M1RV9nm;ouVe6XrwsY=Nmds!d{@ri) zSzQia=H%wyYS@%2n(SL^OAwYvZ2Wb3mYT#woA?auVhHjvKE(#e5d8SuAU+p-NGu-? zKgPtuic4a^G_P~Lxhz+pc04gZ-Ig+W_T;Dh8O`g3rrM4`s3qbsCYdSNESM>XNOp`rdP|=06-U!1Z6N{K2!7@SdFp znwjvwjh(}DEfbFG6VC2USylDifi9Af00A0!@%+MKq+m-V{X?*E>5);36>~Z(aepU22>E?* z%vw4&Y6eSO86HKPe{iZtO=jz55>D1g*$}%| z^<_K9_;^SM0;5}Q{UwiA z(3)GJ&)$0s6H*=6fA)NJTSC$!W0>T7EZdVPMsjxJ$hvRse~=7_aE&e{46bH?d9X)>qhAJ?>d-$&T^wmo+WONSC{4J z(P+JONoNiQXNiR)i`aONahhzx?J4OX(fPc&PiJ&vUrYQF=DO*I5%Z&U-ADNk8q?A! z%iA_KHWr5|<5H?3hWovV^;XK7<+y($l}(hikulgU{lF}k8+@-CC3rK6LJ^{^=*G42 z?QXw`l*K+__RUa)@>mIM6DjR|Kf}{zGam`~F`0B1eIDwASJfL|N4nB6gs$1W2sZp!`4 zqP?q&<0!93CvRv-HI~)r13MR&w3AbfcChkQ;6TXX5TG}MdH9{Jo1GDZkeOXT#rd=# zH&+T|@h%or1_lP%ZdJJT5oFjWn(1d=c;F{}mZVL*9hbmq5jQX}AYo-yG{3au+eah} ztoZh91%A3fYj^bt z)HFDFRUGq3x5t03>-iL)yqQ?Vo%PAp@&ASkct!~LKa6eY=sKw6=HcN9i;Se!S&9z` z99}atF`3gBen$9`@nL+pwco~D*_R}OZ$4V=SEskpzNED1>-swWo~Dof1w9K33q4aL z+L*_ISNEE$QjNT&1qoqYdaWMbxX+Pdd7zy_GtC(E|M_KR`;#S`vh@nOzhpZltHNwV zFRrbtvoMlTADfv;G5Z3(x|Gz`=JRP6TC}MG?SnS(IZix_G`iD}Gf=gs6~!y7_p2a}{8_h=_AC#QJ!YK7JQJU#GSdwE5ZwksD-=Dft=| zQj0$l8L|>=Ka9G%xYPl78Mo6OPV1k<%*eoiC;MyasL`Ykn|GO<=WM-fl38wI!^p(M z|57&QA;qR`EH@i1?UUWzT~?dnxy`a#Ln9+e%fdCQ#OjmG&oW~H4N>I z6uayzryi=(y=$zjtn7%OQ%bL?QD=|o6ZVQX2;!j`P~M+)EV>csgGQA$SkW?bYa^`z zcWlj1wj9%fW=vFR-y=nr(F}xtd8{d(Y;Q_^Rn_oo&vy;wQyHt#nnGk{28q4a0?l!c z41Bcgx;Qe;%hJ*w1E4^qqN1Xxt83NxRYg_RcD23kP(to1o*$wk6y8t+C^~r^VCPJ8 zC70}1F@N$@%=-yR5^pzZ>FZ>M2S5BqEIVV!l3$bDNP5qZr5y>@V{9vsQ^QC3F3>Vu zpZyvDtH!)r=^K$BQ?07?S~M==SZ~-; zrL9ca_;n0J>s)t~vz-QIMa5ex3^h;bKF0Knj;@$(0&ty%IlAU5FxgJU#=yk%^{alC zRoeRc%a@FtoV2 zB!XPH`f?Q3R2pW3V;@!iI#`RCgGb&hmB^$CyXBks0M%4DAG}bnu{A<6)6|S-1WlPE zuOku$-ql^>K;QxDfc6q^kueOx-P?Y}e|D!dGm|DKFE6~cRXnGl0F(TF9W2UFUFk#4 zRvkeZK=B>oO(eRSIMeKr~f27gXG+54_P z)D$>r&Eng;ySb7%4yjqWRD#Fd&k}l%sw}`>x^ z@7vJ~`4+nse3t;ZZcTmMA4P5TGY;L1E6S71piSj`>10Jk7nX+ounE__F4otZ6WQ32 zApOxjc<_*z*l=Y<)Wp=x%tli0S7MGSP?%$=qW;}3|p&9ETc(0 z_JCtRV^_T{pR-_peeHivc3t`3f#|+vnh$N~eqZGai0%(rpZTwUBpTRYR6T0QuuHxN z8w_9G*XjD+Zy^*4`9JhyeWyyt%#0Q2@+b{E@ke_*ZqeR>{c-7Z5gNlj5OZeM0^2c(dg*t-*?&@MHe$y?;oMuxZ#GJ(uOoXlLu!GvREZ+ zCc7-juIYSyU!v{vIcJ4tYGTE4X$J>R&R+J%@g*rQ<@yjGzj-5M(fUc`_aQw!eOP0o z;L6HM2}?+74)M3+ofy(J|BNDpd{0k!`S`%atkB}&6X)7+Nn;;>QaSBnKa0;UbiYy7 zZ2Gp2Efu9MDdCiSC^NBMj%01MHKwZJ#UpRn6ADoCfHVK{?&Y711s==$+u)Jy>!HJ* z(47)E_@Vb`qp%NQa}j@o=EKQt&PsE7YQ;wOB3{IoZOI*!jx`$3zfsG;#9lU6>7 z(YdxbKVL@h^4I{%Z^)ja(I$`&>$q5$lCnJM=)6VRdl+?5GnO

71E1gK8K zPs9fNcA$@QbL`EySlr~~f55ssvaq*hzQwil&1xq#`DUJ(5;6u3TT5PzI*YF1GJdYz zet>&y5=jO-jjXb2rd}c4@T;^8^IqYKa&ql4UhGwz5Muvces)t}a?bM0-D@)oGJ=|ax0Hbmd3L^32giC%?s7S2Z>2uSVC*RcB7 zJ?LNZ-FseMu=Bh;?rYtkkoUo)H)&g~`@+eg-B#zJne=@dDDp?6PRfC;=9#@~))Ns4 z)H8brvC>=W(dqF%GaFRojYacz=4I{p9Zz$E1#zp^S8k?Q*^FMHofOtI*{$!E-gP!D z>K|GgC@1z<_p^o$-q$o%Z;j>D?P%#BzcdF! zV^z*4J~0S9-ccWwLJ2RR{2oN~dbhZr)oy(zCc=vw@Qz3d1iQKU`v^*nMIkRMNYxfB z1Ut^iFF$tK?u+Ve_uG}IX>vZ#iO{U^x4|g92=ZTq^)!*e7&lBy4yro1RFvz2X=9LIm~}&ZdyBs`(J(o`ui_Je?JRex&(EZ z9X#eJ!|Y8`uS(CA#Nxf9SRS4xK?ffvLA@h}Z7Cw{0swicJZ8}Xz`QO#0-(f5o|_qB z`LgRV)-rI$H)E%~r9G)vKw-5lU0BY9&Z~3MSrGL$BWZzu>ro-l>$j>QGEgqmp5~lg zOM>Bf#2?BatuwUPtA%MhA3i~YHGaH$dnR%tZ6m4|zc5=qTcm z#S&|-xZ!V!CIW_aF`H{ocd8ev-CNfEtm{r>IFi%kDQvXwM2hsZE4cOz57c>mt62J4 z)MR~7(0XyhUFTpohub_|(5jQ6csDa~$hCc6Knba>z(IyOS3#tzEo~(*UQk$g(0J?`iVK2rbp;J+s<( z+N!v4eYn{TmEz-JrQ`A|gS{ytFh{{5yvb!m|8|0k6`skpcC#kZH7eEBekQs#{N&l( z!5P1+@Pwba7C#nQc+2X9)MsThkg;v!9V2r2rm-fg#&1_bUsa;}MERC*thIB#lQrgL z8-}zqIRk^M!Z0~e17s6}wV#iDaqskx{gHzyE7$qJJon`Dtkme{H9Za&k7$7mzb@AI zvD;^8?6X~^9(hEoLsRrOG{8V=<%D{T#QLw-?7HJcobj%8VyNv&D?>8aoQ#CK&w85o zw{Wg-Wsb+2TkdpTBKNg!Oaa|aGGtCKeNKfu?QFV& zr&>n0r%I<0%=WWCeblWF8c#Rxntl0v%a`1r9-6xn3QK*KuyY}=UZxK6?F(h|Bp^Mq z&7jcqPHmD9zSvMU)VmWI)e@}mZ?_^?Q3KsJU1b+@njYQxX0Gsh;f~mj)78dkpySrR i)sg?%#fAeC=cEy=<|E|`;QyQuXP1U4px7u)*Cm5FohQV8LAncM0yU1Gn?O=TzOQ zd+Jnu|85sQx_Vmn+H374&w4iDUlpZ4yeD`M0|WCx=8MEP7?`)!FfeeMNN~UvXfQ|t z2IdotjD)DFN7nJGg`v(Yl;?bXb!p9;x@P;hohMLUtb5JOo)(KXN$hoUn*E6txjsoj z4%zIj7*ghE1bkB(N=nCLN;l(y_)Wf2Z@fP#7CZ z5b!{zx;e6f-ro6R4guk+eic(alRGyyzsS!u-wJdIN1l7ylH|0A0lNQ|rgA@Lf;+ z`5VJ*OG#xf|6_(wBaa-^xo~qlYT9%eG^P4aNTsErv*91Nst_iwLXF-YX;5g=5cCDD z1#gMkzhB-G{i^8V5Q#YBOS5Fv!0orF0Vfta0J({-X0)!+EG;W*?I;;fpd2z~cO5C- zXDpkw!jt;y#w3$4uzdh+{b7VxHhbv8@7<|NhV*0B>ceo8ZH*>g=)2)c3UYEE;oSKn zKm?tNxr~gAwbzfQ z_#KH%dFm9iAgBBjx7MQXqKgefrcSM^?WDvtjMm(lJry2?b&D=~s6GEAsHcti@#$?D z(U(=#xYKeF2&rnGFzF8?Xy?z1vY;gnTK)*_|7YIO(Eiy53`{WH|5ZKzf4Pl539fs% zL3n;bdmC$Bc(%d7+SYSbZai02+&<@&X?hh=M-LeWCa<;mwxlrEOQ*;?vSC=kY1XUI zJj`p$zxF47yT1)oyst^vK3-9x1EbxoY3a5*G&V~ITfBHWS-%B_3Kj+?fAT%j6{#C; zCk>C{qQCda%d*v>ftO%Ts=imri`gt{$I6qnwLAB#C+&0VUaF22V8eM~$(7gGf@f?= zy9e<0GpFDJ&a>D`ld8c1{rH`3oaEF=SgUBqdq?*nX?=43mr$RLN^QOG4E2@IYpLG3 zBQ45w9^)#F!}B^}?_eg2FS>*S6!C7s*>&vEDxoi{YrMa1yxQ$Mp|>Hp`uqO)Yzl+T z1IC0?&m7bSMiDyHx944e7QZf4?EV^2h?*1>y0OyPBG1%F48fDSisPe5I<$EDxHkS* z&?5C4KDjJ-6pKs85WXmShgc;fs+B1wynC{9xzE&R4+ci!CpKEfbhA0#Zuu@?rJ`bt5uWv2xmJ_isyM39^=_tpe{V0EvaYVK!ha4z7O2ksp2%x@YU)7k zF>uSw&V*P-5qkWp-PwPgZ_M_OTI-y>aL{)1+B(;OBTl5`KiA8ZT^_n`CMq(;NEp25 z#}~tqE}u_(`%)P`XkLdOIyEBj&uuT}Wm(2-15R*`tG~AV6HReMZ14KK5(sR z%u%D!y3i2?o$T_KmH6Osa>>DFKcLP%K{A#4{vR4E%_a+cgK;58=IJD zrKn*QGDvUjt$%5DZr$)W27Lz`%Oj} zt3{K^qn#VdpNThsuKZG`c&E(u0B1cjlk*37v^Ya0uST13vU+$G2Fu%)J6?OHwWQvQcf!10^ zcVCrkDj5tw=tV&HK+rUsr%oK&ySiD@i+`<81Tpq#`lVei*yr+JO-5g+!O>XHw#Y6v zIgPTfSsh%ww--fwD~dGSG*$}?xeMHeEqUS9-rfRP87L*jd=T-wUKW8KC_Rdnm?jUf zWx6iFlV9@99_IR#_p!#Flo-I}>`5x40FSfESF>aKhx5_4HfmSsS2fLBr5--$bOv3< zLjfK78wt_2a%YYS=T_ZC#=fKsIWUl%3sxO@i7=4-PL_H=t#w7Az_ng8t|*%9q2zS2 zI`?YlS#^P^C<&>p>#9TRe2hb~d=h)F9p(|0v4YeD&w1bwk1lT?e3&vby#mL~6U|!g z-iV2!J(^wQ$-(andEXu{)R-L2RY=s^EY>d8S=g_&J#2=Nj*pJY1FKVB-e%j3hgc*y zerkjQg?z1_Hlp_B{P0PAl?q7^T~ZOVzdXV)grpK0w8nK%Ozx87uLu>FZ_$4lk1ff^yP z9Jam$(C-+}`U+!VM?)NlfQO{f=iQ`MR>dp~%#`74&vIrKl%t^Q2e`7yd(f`=r{ST4_sKJ4g{fT~qqwK?8N5%;~dJC$Rr#}!cr2b&LE)M$7 ztlH=SZfl?C-yp7?L&e}(Jcl(N2&kswi&udl9zLj1s!^daLl1q}%YD5VAkC~O^=LzGt1TXesXkDDL`RHf7ybR(J@sMCg14#_=ffr{+3W|b7 zu(6=P?G;j}#lO7sk>Z~i(A=cSHW3isI&I;Y1M1W#;6);#%mu*jzyU-qqbHQH!Pm&6 zeMnBhM6*tZPMyk__d?-F;D8A$7XNcvs~c{=2@KL7XNhHRy|Jl1LD+TIlX;wyPI_po z@nq8B9d!|D$x?GLSMCSJ4JW+O|s{?FT_I+bN}1la2jf)7mUZ(zvBz7I-s@`;=W zP;u!bl`Q=@w2yLV4q8F1ubuD-m0kC3%>YH=7=)|K?HD{-`KyDz+{HO(=0E*M-=8%$ z@w;zp%*|Kk<15+;TQ#G!XziAsQNm~(VBo5w{|@*PFV^Ptv0QwE z*uJ)0Hn{7DgE((a9pOcXZ;Jj}E1<|JcKA$8`$rQ#9hoB|DUU8pkmJXLXq`eQrHbAH zf=xPFk{u(+XRedyiv~0{cpAAC6`zQ+mW>Ub)?RU#v%f}Tpl?KIw!OJx<-{rQ_LxuO~ z53<)momH+UJ-lkbizbC0Ej|xw;lBot_&If)4$bO$&kmDfiSfOM`5{}uo~4t#w5mN4 zZvtnmV4C~K*)0_0viN&3->Nc4NDO!!i4^MmHN9SEG}^#?&4P?voC7cByZ4J3Oh66} zmoz8?5>93mtjYbvmig+h!XLJ2`fu!nHxmKXe4!xFCOYze7Z~S$uAbCC5rJRzkdR;% zLmZtr(ZqZHZv4B1R@z-KVmZH0Vlps&cr7qmBloMH4&PlXM)1Tf3YV8~>Hzvvq_niO zs^hVAVvi!fYuN$~z3Tl_|EpoO*HU0S{?ovV$F2bXGV8}s+KAH9ek{|!HkmEoyI!%B z?Yy5jEXIih+-zd~f^&*IlFxRDVnht+AO2)sGbGX&lxY|LZ8NOf-BABG(tydJZ#GYO zF^=+ETFwP=v1Z4Z9-+ni5BZyHF6o2&sACch4Gj$H<;^#9Izxu!elfF6i(v5KcI5p=t5_eW>)*nhkUaM-KN4$G&9K#KYpu_`Ed zrA${4IoCo{-2Tl1k_-~k@&G9522|nro*~|UvUA@vU!>5*1npxv4J(TCPO=6Dx}I8Y z%IrS0q@s%d=LwUyV9w>`B{Pxs`k%>Ix?J6A55;5Sco5Mx?S(Pj!oWYXgK>zMto`rI z|Bt*}aJK!&r`u%2G#c|*BH!+cr`Okuv`fj3Sdf)Zzks({ag~UC<(u~YLOjA42C%4v zDjlIn>UUd~SE#a?Lg2TOlsWOLk8#emscKa zx`$b>Ga|}AbmBl2jHd4rl(X>nWj~-v3mjWl?qKfY!w!w~Sy#zim8kC&^LB1(tNT?E zE(M$Muv>k(p{-$8C?#S4%J{mwOweQuc!pP6I=Xkw&lH5Z45*$4>rCqpw$VQ>Ij-3R zuj|Vz?oUCNE9w*I#VNVDueZzgPnaSTSHexRD!Wr3@=`?Yia8pOdTQzXqy?Me2M9DQ2oASE&MH+fd|Nrhu2+00mA?Eblrkoqoh?E!tgJy* zKu*3#KW26xCor6yYef?*>OC?`HYFHaw~EgwZqMk(+q-*^zuO^r`G-&ZXcw#9zE+Y8 z1nQ?cf7P{|aQO7}Ly?y$J2tLdOPL5=FODKQdXEY2YA4k|F^iXtpC7z)Nt%Nx8mfH4 zVP5zi?$mPMq=@Q@WvmG`!Y1bf^AJW@ufrSi<`Ykdfs+)?P1$_ z`JMuqCU~#wzkH~#^V`Q&nbIj_+{-S~+c_RgDW{!&l$|yDYE~2tx=!aYXdH&#NRp!q zwG7=rm3Kx(w=BYZBsh69M85v?^HnyDixt4aYPn_*cGl;Zb{S%Y82GtpJYDNi(WB4$ zdjpn{yS(LT+#MdpJ3y8D6xw&`J)%mU5l1V?y}T4HeK~M*sxW{}o{_-#>{;YGOSX=@ zykd&R11)+qtJL1fil-OkY&Yt(exD@G-Aqk=5j$S%y4@8Vr0Tta;SSz+`r>M@6%0O( zFtdcAuggm$!VsWoKh>6PtQl%_`ym)Mh{pCYeEPU~A#Y++lUjiOPxANO^mxayk!hU3 zq3}wb<`>d{4is3UJxcBLGU*J(=BV#5w1amFTtbLNO z`((4Q+O|JXU6}7`^eAwAgC{2-=$WNQ5%15c54E@VD6jU&yY1x36|xx0FO!ZLiZYa2 zHBN};a(5rEF%0-hcZAH|$B8H{p`zlEYkq6h??3k}q3WJbnr3A?cP_vjPl`FgLIQ$( z_>b=a%;4hyd+J9HF2xoHP&kMiC%)iz(7=2dWcdw4gs#NXyKfTD&r-gM*u0bd&~$ZK zFOl&kTz>QR0pImNCGp7kETF-C5+TN{5>MG($bgmdvnJQ4AMMWhJAtv-a#un>yZYO}=^%C)vpq{pEv) zS=nO9GG);H-@LnFHLfOqoz{{s2Q?;dVfGP7=DaT6@7Ws6KRXu>OCUzQ#k zcLNTX+2Fv&y~rLW!0*7J;boG4e$R6))!lEPtwI9pD z6K3BREQ(rQLY1GoyS$7?qE763O3HIo#{PRzV%GjN1&AV0*G8GpC~Il1p(^9izTsGflm`XV=6`kg$NrH=CVlX2*j&zav2*{?`uAbXeT``@FmDptW!rxZx@o zrW%wnd2G-iS&g{KGTpEuuU1`(sU#J_XG1bfG`P?H-R#%?kaCgK5`0_r>+{x>*VC;< zu}IPj!hy6yno*d26>6$?dplp=;WRc_#(}mfj@g%g4rhx@w;3SnZfH=*7Z*|xyoCu^ z3kX1i`C+1-!OBok@scmmJChO<{^2Y2si8k?z#1+c8&5P_Q>$i-W{rY#(`}`=X=uaz zDPXUYOp{(8|6{iQuP9y;cO3uil+Er5y!%Xa&_?v#z2x!5?@S0-LKE8MOxL~{M^8Pf za&>`HN@FZLhyJ%-XIYjHx1g$Osi(2Ga&_=I4?{wnDfWEzl70<-J-Fie^6p{KH|k8;aG8qus~oZwS@L z?dS&K8vie;vugS3NxaOSNtDW0_4kiEK7YRtT zMWY8b<$DoqhBvM<7WaFN9x0~bo@z^tn1_Jyj5+wn>MSYuCOwWj zUb*^YN7%JSXk2TRc9W%oxsrz32*LVlG~_J1?*ym>5 z{m^HJcEYIqAxN;a0~%av_;?zZPuRaCW~Rwlbuc!e8)8$=po;Smi*Ue?$__f>v!3Qb z0&Da+R^;V=rbI=uW{7Efvs^lnrXS1R$unk-<}^0zTe6@Q-Aa@D+1g`o+ZUZ2U&G6v zO4-JYR8f3s?!S69w*1Sgs~rYni0{_@{m*>jUb+hL40fMD`(-}s58R2VO+M~}ndn_} z_fddTIn4kCR11`VFNQ=(#Yf9If7aGs7G>Ib9TcWM+Y?vLb%<#5&|Un1O%g+;gJYvH*n3SJY%n_y_ZabToxj4Lz z&Y19Z>#(N_W(b(7+u03(~xIu|S;*=#Y#pn31i2E#! z@BL=j(R|fe%o`MnkKuZ*qQCx3+is6qYiMZDjVp~upHEahm2Kj2HDz8fUOm903yz@0 z7kwXyC9U$e){Zzo@I)7s6BIiao?wkiNWkb}6(qQl<8mGxqSlH!xX92k6BZgClbgyf z3~kvp)1uDb+A@wg`if1~!+LRXA<`bvYIwpF5ksq+s?y02$ogj&%)xZ%e4@GNdWJO7?BsDH6U^ZG(~ zL2?=WwFbaMrAa({jcYvW6y0Mx26OM%C_2?m>a5J6Za32Q;nF-@`fHmGE1rAV#4F7s zJC9enuYz_f&33|;0bemof!5MBVR0eyg}S$XGPht#BNjtC`pTVj^3=t1HC~KR)d09_;oJ!xzvp{g1D_h%IX}U}#`E$)NWD%cS$;kN*Tvib*vVhl`=kMYqgp>= ze{#7=3^@NBa(kA$W9<~xAMQQUfa(|TFEEt9e?4Q~WHtGl_jK#$e#)B@TGyiq8%NaW z&8yP-r((_E#4&2S+4~a~e3^Hcge+~);78A#vz(!nl*D3jL`Oyy)w1^HvFu$#Qr)AB zR5Bl52|fln0vr=+@riKCFpAHLH!_v>)-^x$yCxBZ+7}g2DtKACN9RRW6#X@~Gm@z( zwOcTnZvUv3iRjHnhxxlG$)V$LdnKF{livW24T?>G{vmP`QF{Af;kLbc43my66_uw# z_|V%W=qbC7=puzWy_O{RY7k-Go<@r*=CZ7Tu;aI<>rdhdlCZchm`xtl?T)eu?YUUS zfgqrJmdavKdGx3(e1n(D+t->*76khE{tfD7P^s1v{3$j;%~7F@_{@rF!-5Sr4+&g_ zE#pXz=We>AqodHnJ24%RmQ;FEU%(r6iz+z1iWN6Der+*|`bk*7+04!vI)KJ9iEh_- zU-Bio&f(}i_E_GdtY4s6=<k=Gfuiq?^7@#`m@>8Mb}qOD-?%iJke~N)$i$~DH50EmNh;s{aWjoMew^sF9*4jRH$RORYDtOmf?0-U5I&?yo9-Pz?2Z& zBLLS=Lm+$O*~>wspLzj1a*(Y(zmberEUt6hdWPM?PtWhH`;dX2x6Mw@`wH*87fkIL z{bzc%q|n~4uE}w$*5;y|5#1LI{$lvugHc+dKu1t&A%hk($im~Ny|&<2UBT*yg=BFP z4{~tZ!3G-~;l^HxpDE*h^SV+=CYF^AoCr7BXYTI3O8tv@foIQ~NzJH7gvmWhO3LTQ z`A%x`AkcTVWBe%>a&YSJ9gyV-zsI>@YHVfh(O&z?SNSmgfDsg!yfbnA4`>(;#kU=P zB>$_?_}TjZ3O2qU3UE+~cgoAp#-~(Wz269UUSf_db-!w!Zk3y@LSlDx3vkbIR<&!n8na{8tQnSFPN#wIfZuI-soMfuFrD6;Cs90K8pu_qa$QFJAXd1 zcu1+TQYXD}bv)ZVSY$e#xN5trDp~c*KfQ+P76~eBgl%tkKDk32G!7JJVr6KZ* zMnhq<9bm90rE24KBBhl#Wa}pdjX7Tp7IqiamfFnsB7M%X*XKCPF6dm3lx*Gn-3E{R zAC{OWfDvr*VDpOsD|x=PQ(#Lc{m9qEJy9!)2e$;ZqT;(Q!^P!CRQ8jcx++~J-tF*C zVwNbGga6G1sGcpRCk8YX?Pa?wd}Ek z)?w)CLg6%0*zu*}W)}7b73Ch8k7wX2bv+05$%f@i&QOt1;p576rCtevwo3kB-Y@TVYdleRF5F@|9Aq@Y4oc+S)rgBc*&F zdWJaL_84cZf8tP)?8ys6S5S1!3h}*l@!lQkEt5`9F_Xg+CE*w2NNWh`*mTs@FT9;K zTA!sLq{d}(w6;d}abLS?m3}!BCZGQBpJ9n^eLom0Mhmtx!o*+G@uHdA&@rG z%+jyuyPrAF@#&*-QDo?hWROIXm4(WQD?9|tJJI;4cu(@25eU+`bwrLhx3`YeNm@#Q zf7lH4@rKy1Gs8dZghHl|WWOgS2G=f8tKH)SK8(GM6t}vs40H9IHd_7EWW2ynq;!a2 z-h4<+@2NQJyy z`lIlLYIgi6fCZ*c?I0i3A};wBGW1P5E2MBT>&-lC)L15uyYWNfRT!9St{Z;;T;*^l zUozTc|Nde-f5ETaJ6^8SxbP~lWRCAZ><|1)tCF8{)2LPf;kVo2s@!jrd7?@TuegVT8Td z0d0q5duXh(=AxS~i0Z)f?+(OLI-H*wwqm7y?`&C!bObVP8gp-u1696BGTofusIc(W z6ygzohGNO3OLv-vT!H^7)@^xq&A^k(%RRTvAt24rEF45u+R3B7^Wc$!QDNf(QOj5j zeHvCRHkMa>pM~4-i#CF>>4vu_)VQYtZ+m<3OSq|)I#yv(QBgxkS=+TjAls)O{R3!Kb<`^Oy1ECwUqO2Hj!yMFvN-d<8)i!h9tIFMRGExP8&U}iK6~ZcSDG*I##M_g>{jN>$fl#I>&>HIqDDY2E@0~ z;d=^#S7S!&TY>rSl8-7lPzttZIi$u99_x=skAelo13w*G_ox*8|i$s5PdL}=5E1kP5l*kBf_N}HfaZ?b8nUuB!@}oh-mV$_axJFL`p->G$tmn z&eB&72=44-?;EkpmLq0S5CymjPcwBj_PuQio@y2w8|On57aeqm92|xk|7hITV;PCt zdB!J6NdWPfnbdCB!9l`hjJD1{87ZF6IgXcJxW4Xm&2gp#`eeb^-^(~;g&~bEG4cF2 zrlH!*4tjH7YrEO`)CR!2#AkNr*AS&D{dRCPe0|wE75VPu-Ejskln&?uTH6|#96vm! zU4?_Zw~fgoKp>B^_PZtFfM+Y{=Mb=Az!wPsWO@8uYnexhP&%#bx(!r3Ggw_y^`yNi z#>rGBx=rTAFwmhikMW8xW3mZANwrQ&^x5RBl3q1@uy^W>^{T}6{c$L-sd=d(p6b^E zDot^x=NNr7OibqiV)yIb6p`oio}2|6e~j+J_f1xUZEFpba$pmmRSvQN-CxnI9w%%& zZCxKkUV&n(Dsv?jC3%{7WxdIpotV+@a497rVY-XTOu0;`Mu4BYR$X|rk|_q$tnvVi z(8G`FYj%NyL`Mgt92CngUygIl>($~DvHQ#xdUvG6t^Wo~Y>xGbN8OU>=Z5hz$GuowB66OW(Quc}1wa<}>zjTzNnQ6(Td zL%(QQ@u7u9#l_2^!dkz`!=6F(X^{6c*vMIXfSzBdwu_5JrOhcg9K?*Tom%{k=qmGF z@j~DDC+&t#bEgcxIgAZshDtTmBu@)7?v|%UqAL&)2Yt;@`}xw`@H;y5!>ihYW*%ID z1nu56lqmrVzS4GZImUK{tqF2dG=~91UwATY{>b;d3o(^hZ)pkcA-RKC^76MFGa;6* zYpYIKLIdf?R;m6>gf;L^Z#d>&w!407nUBwB{p7vOZ0a-*^KHkQ5Zjz6Bs=-Y!=MS_ zr%_u4KYE_qImg|)%-hKqC~AYmOds^B*A^^S2)~=1EaH) z)Rh@9$Ya{;=I@a`o4j``&fdl&>;A94N;Zum?=}M_yE&A`8VVN)Pb*Ob!WqsCyj~)s zaU+|ml_nZKfHo*&zS%TprJ=nHwg;FkDhWUQN@U1(zRYcWw0Qm3OJHFUX(%}4G9!VC zc$;Mo&OAn;PJ}zu-=S>2R=6ssA}cY9yDQlggG5*pbgXP#M(kpUm->z8qxk!b`9~%X zn6?-q|BNDI{c>$p^XzE48|*Q8NHKG_T}WTY`X*I>weJEmpOrB((kUBocb9w#pmqGL zDt%T0lqfc!0+r=XyZVRYE^7bfzVG+|$oql!v2U(Irw(ymSXiK7r`109z;Mb7c2edY z&TZ*m%(LUt_H95SOJ>=SwXSoVi0dQk}wI{D6}?jzOSQ9YeWko~l?9iG@jl1f8^b z=qTetnS-Muy3>c;>ovipiK{Gpp8WQiMn6;H}sDf#P z9$4I}_=NZ4NamCxPtMyGW-JsmBNBE>9RCGq~Cg!nK9 z&&2%AOTT#Wf~2_(oRY){s>j6Bf@fRfPZ8E_=N*aZll2+DW&?HC?aSnG+(u7wsv<{< zncD60~WZ= zw{HorJHL7TzNaJ^?%0vqlVD*RcdEenDO0=Ih0>C)yIXFD%8j=*E~0?_Am4%ss^V?7 zzu9q4Ije18HF zUt1o~3I2R@j9uFSsKhx>bDeLv0*}F|JrXe@MxA~a_OThWW*ga5xYt;>rAYOWW#KIT%B$><1QfD%%_76ziRwr_s?G4}rYT zzWpYp5^-M{l3;{qUiT1AlVixwy+blmtD)~{=H%owAHyb3$4@Mi(^}HsQlQB^GKVP5 zb4}lN76xW>%>s~cp<0asW(0ue0iehuXlRWrW8=O)b`nrV=aJez_&33G)Ev5kUxs6L z5xEX$xtRk2uR{#K)3~#@M=I=dUpvBlv~dYgqYm%;U!iCIdpkR1p9Hz!8C*Z4-zZN-WKqBTqa8U$bw1IUP%55Q5@%e3lW+La^6c-z%! z%`o*BXFE9dU?{yE+IniJqqXeQk>iV`f)+eC9z!Vu03RpgA|`0W&h+urr(Z+tCEDsw ze|vw6SX}vib$Tc`4|+>CzVx^I<#L2Yfm)?W7cZZd9R-3pui45QW1_`P+nVB|Sk{XQ zYT}WbuySF1<8|CTYVLgIZv`-kZ)_1SB;0W(u2wy=R$UX_A}D2Md^-t<=7X^PSJSSl z8AtxZ%#%s*@}DP(4f87Un5=x<55cdStWGf@Eokfw(#OU9h%A%Y}IP0tH1?ojHetpeosWSPhPRQFXb2(xV5PjuM8WbxMCzMu0hxXi{n z2SfJm=trT~LEUs<6=SOiQgin3)r*XTGU?hR@6?G~uHWOq>LvEOA86%Ufr~b~yp>^Y ztAK3<#Ng!`cbNOk{IFTRH@(V&os-_B8Xc_$W9e-Ht#xC@mGu?r5}Pt&8L*X}`Eb#+5$JwkeF40eF_4Ga=tfpn}N^k)7;flGdKW z%=$JMO?Io|`L_f_@(kzsY|ACb3h>usdmN)@F!up+>V|mEy zN!0GiiI4)%{^yVk;yy>l?Q8s5eIYSZL4p$|73sc zgWsi(gA}noxvth?V}8b(Azab?9o?Ps>9&(Oy&;J)FY{Yv=f&rO{v%9H3nyc(N<8YC z6F23z-18drjqs(D86Z({bI+NwH=rP4zEhN>g%3uEmu6#xgLKjBtXk^N zBSSyuN9S_J2xy)X zW&RQ2D~6y3yjaIt$i+Y2^u=fEv6b^ua?@m({GMG-Bx6UG=$I1_*c?A)59^i6Xnr3{ zeQ}H*WOER&V8wQfftxhs#EngdTInjpyUNa?=Hr;T*GkcGK==G;LXWN|yyCJ0+MP(} ztg~P50NPztaw+xgX~$6}pm98QfG+7N@oP3oLQ0da9}XgyFIO{V5Gs{4 zoH7UaeC^c0<^T=%;nycgzf+Va;`JFp!5)6DLQiCQBPLJ(o3opc;cL}E5J0nW^ST)@ zzxxYfo;-3gF0{bm`F`E%>2y7oSfIn~*|#trVv4HRL{c($Xo2|vK{+Z>qh1m2+EU5X z&=TbU0%@eqs4CFgI#iDSP6vmc+;1xsib>Hg zZORz3{1GW>k}BnKkL~j~&4W(d!iH7~AQai5%euy4Cf;8m$h}iHmnuagwfy)w^Rvxn zBd^@54ux@xQOzpO1q-d5aU$Y#=dKJ;?QF&~je&(mBW0p-%A(xjC zPPWUHQRk+BtBcBtxVsxcttj)>ejF3J?DR`%h#&Fm?DFtUrD;Z-JNc+;MS6TkcVdPj z9Nmajwlw4;4UpLk+OVBOCX~wIoc&@0%T%CI+!+C@)37*Bq0#_A1CV zof8#U_S>stw}T6(b6;k_?Bo&Lb$7mM&vUo*{>H)Kgg7kl$GX67r%7?Kk`M=ZK@sX4 zn*6XLL=s1?Z{$Wdkf5_l!k_!)<)=16_siV#EIUi*ymq=`G(UoI8(ZeFXps>>o!O?} z{l5pCyUk0;`O>T(No8&^9*2?oxGncZN>kl6rTo$9EG5f-%P=NyYpr<;V21-dVA4$6 z%(y{JWxK-1iEI)MB{?vca}Wuad!Fm*AMkoP&xD*p?L72&jg9Fx?0HEth**3}{)S^m z6aF?Ed6N5|ss7u?vH|u^*a@Q;9&8@x!Usr1Nrq-qH6QXQj0vN0F>H;iNWMQ#s&H|n zJMup2L>?hu*$~E-VJ;JTS^|xLWtkLZM_2rtIJ}p$s}uZ~No%S%BCmBn{8Xk#fj@~P z%t%t;J4n=TgNc(5HrS=zz^Z_|Gm}pD-tvI?b;13?K_#I=rdbE*qBSYSu(6fgq7iQE@C>q|#F+i?{RGV_B1B%V z>hNhk7)CGR#)06U7M_rhKdzdNj0gxG#nO4p&O$hPf7ZCVL&h;~T9|T%hMxcaQc0f| zmVdU-bytbM1Ufaa>(HN{J>7GCc0b9aJDoJa_a~_`E%swfS-1XmzZ;UM_sDCepSZil zkPhyBwk@;xp7L^Z;p@)3&SgFKcXwC4CT3#H!l$;PIyf?W7fL72v_ONhMi%oaKT>Z5 zpB-cw$qOFFKQS^%^0 z@&RplxORp80;uLp3B6|r8{r5oL(S4T*!%FD1p;}jEtPW2Tiso40Z`vD$5*-}!_>&$ z7AsnH7y*5ib!oaTjBx8T&G6RB)j+$@h80Cp_QU!!c2A+Qn#L#ix7N+8=~zcly9VACWv}&Vde)8u4nsBs7(7 zt-7yEeqJb69nntLA;e-r@VWbvoN&0YT)6>pF&Q&*{}oP*W1rxm3NQ8~PsG6_xu8<& znG`CFG$D8;Z)*A%9#?nLLxy7_%~AQrb0n2zVt80qR<@M9b@U4nOCesNTRfLa*_80a zmBg>O29N?CGj`e#u|o|ejiS%>lr$33&-BTUNa0`pf{Y?(${b(!mY6)NXOsRk2!@XqOqq&dp90s>s`SVl9Sq`D#*@4 zwzhO&{WP|^*1mJN?{mh-XWLMoLOIcPwM@`DICCF`Sga!=yq}#zpVWNQY3GDFHElyT zj3tY!X>h*bVqKTuoFA>j{)N$%a2eH}5?qpe1H(_>IgM+-T_LvNRlCh4o3CJqUwU&8 z#^6hVk?|L%)~a0OFeBZ_7JmcYW$5?d#n5g5vW3KZ9>u7f_(jDRK|y^lA3tNG=vvm1 zxp*Ojcq6=4_p`Zr9Ho<{?xUN3HRbH=EU~WNWS;29ux-`YN+nvA!u=K!uIj9sgrfyRP*%rSxdmk7jZV0D$P#3qqC?=1F5_0jL>X(i=v{e zkCILpR8)wv3Z~$|q5z2(Hr|!5J9K;a&lhI0x63qn{>U`}Um?*v?ju(meRFVPOzd1u z-<}Sur`bPU{{|=+f)-{ni@x_-6u(mq4xUVNokbhRNYQpvp4OK2d?!X18vWM4)n~wFSEa`9){m>TWnC zqNz#4*L^I2*10G8S-j(@qbefTAc2#kK%9wHeEZi=$G|%DcoVyf8NW!<0e0ltCokH4 zcVOet(^;p8fIw@|$iTpWKTu{7>ozwxdo0$PjXib-zYY5RQhd0482sE@uHokKGPz&V z-f4g5lLL_c0ixZ+1Ya_BYXO(Ge)7u+`q}9>CZQj4jqtzUvg{b&;T;TEU6;p|BA(TK z)Hp(|aMt7Nc3E^#`I8SCm-)xIfefL^*U^LJ1e3Bn1QR@>u%giv>^6&XP zGDHAnoK0rF-4_fs|tQJo3N*XOC~u z;Q&fP4O z{T;0@$G=?>5nCE@nJ`|u%ORZmvN;I~= zXA;pbGk8e90ysbq>BfEyZauhMGa>K!_RUg?psoCuiOf!;3n~!^;lH<&;h7?F)dOqX zgb8#Ttkmr6>=1FsCnn}OPkO{-oFlOs8kiG+sZpz zgq+B<>%b}1IdcbUh7JKei7E`88m_S^)4#=JY|n9NyJZsac5YT`=9JPB6_P=II0)H{ z;6O=3$`~VjehTr?vKeZs25k>vsOeoj3gXc>lt44k&yY8TkKo;!cVz14p{(e}^M&CS z=D*&D&&8y)QBayIg5x$fKwq}-$TQM-&u zN+QsDRD@s&ENpDo)0Vx)Te|`t>iWh}&kwILwpkr^tKdo^JeXke@Pf@6pDW8@R*4j2 zg_UwnvhmTlCJoe*j)(o(klULhci-7SwMx=x<*uhno&Gr?t6p{&$ihbUOeJZ6sc-uI%#uK3QWJfsGLzUxF&SUy>Ds5(I8%NGT;`?0LHa0Dfg zq{oI@b0=3umCU*AM6_^$Hq;f0V2oj8}v0>+Vkwl z><9S02t<{0>Liznvb*SLZj+7MIqSY!&wCsgDSsE14KhHWj*&7bRD(uekik>is|SJ$ zxNrayvKKh@Jlp!%&^fE4m**3|*XjVGGjyRmvavNyfh<4Q;KW+lFsX9}mA3a6k@uD1 z-+pv;JYiT{WawM4!aJb1SWwhZY}9mS5F z?pC^BzWP~C8Mc-mqGJF6hTB!d_G=64n25wcQYtDFfsMb5zS!L|)Coqgs9BWR+A#n|5Gx_>9(VU_<_Puqq(G<$W)r+SY z>?7RUU_Dp$6c_cBdVr;w+^S)~b$LA!Cg)SIwEF+>^p#O{bitO51a}DT8r%u)uEB%5 z1$VbVkRZXGOCY$rTYx|a?(XjHHvPRfGk5WWyMS)`o>O(IcJ10#gZM17CuvNb8B3IE z7w|=Oa=Ko5JAsp<96cLXM7U*;A;he2Z7en?Y4$*w*E9N~kqCnmm#ic`?OH@kAffLB z=g1^TuYC=+KYBxC28)H?V5G{%pT!##j%j)o1++<)R>|&yduWepEctO_cZPdFxT^aqBVtoq>bkrPICVBm}YwUKX(2|}k z^`D$V58`KeUVD&P>!aHqzk<-r*2~?RV~Ta(-oDjqA%^3!FwZaebX7iM%B6AlR&!F>6Q`~1j@rQ=)ap-T_KMJv~R)>vE z7pTVW_!{|_w$=(h!+f&`vxvj@{TK%t{ju^wnpc3LU(j+8MXP20L9l03#E1T2&>&8Z zk4XvAOBQ}Uk3rHk-b5_-!^XL}lzjr^urP%hK9o4O{$*ETk}VJ96PV%`sBRc!hDL3+urVgKma&HZ)i&nSr}uAzbR4vOL$^Z$00EDmr?|E8CtQq+Ih@0U;>RmwQT zP$LnC-&2R$=iX0+9{<^0a=`3jvqGM#mih(bK~c4$qLN5s9pyRV9UyA-X^WF9OdGY) z!ccpRe93>6@BORT zh@peTLf}SnM7qA28lZgK0E1&+MhM9-+fMfdiYec=!$3&pL=W+L*IDJ;elOCXP5wd>FGo6WgP*1!0$Bh*YV=#zf#0t4}OjfJWkE% z;fgoPt_s1=T81IAGn;~yNcez`?0Dw<;al_X!46)1K@QEISepUq=~#Ho4Jp^-*XVkG zyCq#5SWOx)UC`R8MtmgMhzCZp`08%_u(*AP)SUD#u#aj)IvqQ+#|Zvd;cn`!!i?g{ zGJW_EVWL?D=(Ef%fodkRfwQi?r~N}{#!o3tSvhk%F6u^q=DNOXk|D1oac2=d;hE0# z8h?CL*KIufLCkl#|Le!$O@;OOtnURGV>=W2mkgzmQTnWB>v=l|+(x2o3Ha#Lc(c2c zCC}^qiIk}Ks`o}=HgL4zcrZj6w6E$SJYth-zGk8c)jTRGC50Tx&aA|LB%a8Xi9=AtCAIsGEj^R@_O8{T;JzZ?DmBC) zVy<0<_e3E=LlY&*w)j6^Zk@J0A~mIOnoWL)3J(ludnw6Hppff9M{gBma=ebiKk9gZ zA38Fl4#AcnV$sD6kU3LMCx3lGJettGL*Bw-3*s)a>q-?cYSH>(_Q}CybwTxR-zmnZ z!0Ex{s!ibN)zeeUY8uL!rq`=_QN6trzG@U@Ev10Q@6otB(l`VIlQf-lJF;DLu~l=u z(bNK-Ew$wVci5umAKJO0)pem%SHMf(;`UJ|@7rO+BfXf3@9LU?qe~rYtipMf^7rbe zk21{grTUKgInB@22Oa)5OJ{>ANKSw?_?jVy4HAHtzAiYcENJ^-C#7ZXR%q__Tzo*x z@3s%dPQf#Y8W561lnYWg0FPFm8KS?=m$oHvwx+A9s;Z@R3&x%BsZK$sbQ@VhX{NwB zl*i;Z`PIcGUo3zcYp|kemGEF3th!|Lxmtet@?}`%5bOj2g%-r%Os)kRa;3#L#(pRO zK_h#|Ki<^pOaclkZ3exXa$=Fs}CEmt0x5zB((v8(1^;vX^Mln@UBqZpdTih zql4R{a5_FyPY}PeW0fcLHH+Rhl35mx)keNBa#Y>Kx1+!6Y+O1pfdV9{!_3%38cyp- zj#SE8JuUH^@c%InA7an$_3tAPmo>5knWQEK zLUe#S-8Fdf+87V##0l%@!UARN`(l(x-Q_+Dp?|TQbiI58v0D#J$;PG-MOjLfkO;fg z_JuDEyL)?2+Wu+7QIS%i2!Jd(N3Istd1P__#bo>cyyCEyo3qvtF&ENgg0`R`7?_k{ zCY|@2Q95;&4HyL-KY#wT8iTNl&}S41wWMqVfA`|OmK(Cv7H-E zxzv6$-XudN%;tFrIjk5apza0h+i#w$bGHldi>6Y~Zoy-9LPEw?vTxTF4Qb$!dQz8t z@WN?%T{%gOA5qopN^=3f%XRU9UnLO&ylY!|U3+_NBDrDb_0x5}YSvaNu4PBch(jPWO5^6qQ5J9Z6Z~d& z;#EUVN>Yi+B=dNGJ3jFWIa+7shMssA`6EoDtbY0F;Py{KTq6P8;kS%YNV5Zx1DAroVTC*_7dY@UL;g9)vl_v>1C?>#B} zx>s6lx!d4uKYdAq$6CI{-kW1-b-3|7bP8RZhry52fPR>)=f7!L|ezNjdGJeIRDm#n@Z5elN? z-=Y5YUD)mDz185sW$-Jq^lo}{ql@pL&X1flU-gMVt`SCI+L0o$`-IAAq{> zoQ6dgPos@vKO8llln7kFxy1d5j9joQMCx6pZ0{fM}&R9R;6@F9Q-LEXj zA^Am=LuG$A(Pn$#NlVj;|LW9WtM8$)C4%izAdZE6A@biE#Yocg1^)bEF0F7%!3#GQ zJ7Hmz)?1hucZZ_&V=Vrkjd%#e8FsU@sEjDINF_%YR4z)QSAQJyOJi;E#KPE+X^$e!2REx-1m*Ss8?{7n$b7hH|^P=6%Z#F}*a z40>zOYzYd)im^-?9W{>2EMNVXUw$`Cz9n<6W#2~7+gWqG1N^CH^Rh*%M!mgObjFlc z_O+$M8<#+O`Lfn;;xe-w(#2MpH4v%}M<;`%rOkgCC1jP|{`bl^2dB1-lG>AMWtDI5 zEb5aW9Ep+bHi!cYNlb$Q3JMB{c#?4K<%*)FEe&1?7H?$fQ7`R!`T8g8zRLZ;uTnBFdgIU%k1uM^m6sf z?V(y-Z>+tm=6$wj0`*zT9%K~brAzIi$p&evZ*F_N&WBMer&_BZ3Jhh)NDGxx;(@rz z{K@2`KO_IFH&cYaZ^E4g<)1Hx8K9N`Im=3Lz~0De=BxVcZC^g!toGB52xze@Pi8x9 zi3zwUssi{9;68znlw~d)ZR*8RR;PEoj~{X%Ar7&vEdbaWd=q8NMoW=m@ZX-2wne}H z-tcwQ_AgA(Ws_V{TKbNQkVo?D_AjIKCmc_kwyA!_XS84}A z_O@0r1i;3|=4y8Yxts+Wu-^QBvSxX;E!5R=yBo0e?0*tq*cs=ooqiRvcGPAwWki}& zUHR9t`e_$6s|iePd1fSO`mm_)&v8m8M*}?<6U!+3rlp#EKUU~?&Z?(L-b}=ATAtq1 z5q-`~o%^2G!AYwESq68eR^3Qc`vC>;)-r}Jzue(_SE62&SKh1H^ZN1>BfSL%N>D%N zPdJ<;Ta`~u4zJv>Sk>p489V5zft$FvL>MLjYM~B_9R3TGIX;&+^Sy*HueW?C`>Vh@ zSfpruxm`;Bry#Uf?axN+<=3t;-Z)6jG_XYQsh;b1-3TlWa?xFq${GEh7k>TqaLyzB z)BZOVd+Te5j3uKM>(JY8$cvHA;SoLk777XGxvVBwz0#Hu7O7tvohw$XtTOc5wi-yg zmJUx|lGMbO{f0Nc`OrOWT1u2=>2iLgGM^GEW0bLyht}1}Ikx>AF#o({pu>Pk*p1lR z;=0%Q`e+;I)qiye4PSAfSttB6N4?}&ubhPY@R$zvOrWGIcE{^0c?y#bmcDpoYqf@u z*Y&~=XW{9RaPo+E$heXv{h^}dn;B#Q_Zx{S!Z!N9ojhIxYZ46Z-&WB_dv{`XWLDvU z`S`bWc&&O}THn1nK-7;tv+!VNDAlun`Eni$9?m4`uk~}sASO3m$ljB3tj}>V-wXEN zS48RoiAJ>)3OXkge6&|KHeY*rG=xA&7t){eeU|j+>klhrDskz{S-KIr+U!B_pQ~FZ zH!Ztb`DUt$2VvSfXNoZsrQANb5>4mwfHT2Iqc8+S%i)erR z#dzD<`%(iS;|j0nZM5DE{QForC(@96TNA&?_mTuuyB$p4LUt_HZ&qSY-Va-0TLc<9 z`r6mK$znb1k`^U>*%^4gul9AX*&850a<=6Qsqt<;DTqCCEdbB7Q4XuhuvrC!z~w_% zR72u$#hpI^w!|Tzp{+D<$#n;r$H#SZnVQ;ZwI3RqGraRX8(L63^gHS4;4jG>7Af>! zUYAqvSD4}tDTgF&8!~#7^LJ_6M z({q+p#O^W>Cw8WFud?*s$3yq-XU&~a)QO5c0(K36iLI4W|Ihk4!|s4l52fg^V`cg) z{ffnJDtLs@Kc+1^DSD@EXTooXjT|cfrc3x(712kxjPKVNg_OgH{H6@#CVh38ukPeo z;Xd)+HG$UHs?TDMVW`^dFBl0EX~qjzqPE<7Ns0ATGk-N`f+tF8uKadd-=ZVF7m!B7=$glhpr0Ipc? zUr4vIUo>HfXtfeVqG+L*xvSkJ0TVVn2sY%RXNEYtO8ObhbQS?PKo z6+i>pn|0YuH`!D{YqQ)#ra_hR^>FA2Tnqu?$|!NKu^;wuDf5cT%a4QMNh3Jw-o6W8 zNPR*QdtZYBb-s<4n@*E3k3vHuKNytn>-s*C>)p+6s3hRUByL-E#L3W5v(mENLp>i3 z_Z?VYsM1?3`w@Hm%l0bMTpXgoO#4WK1gehM3KksaQ5FU z9;PLM=O7HU@e>y%qVEo(-jMi~0ZYFiYAGn!m9pbw1!Q(L$gHr z80!DPj-c38von=2$bo7vg*ZHsa zux1(d7Es+VEWj48fhf_n32*EFRGRMl7&(3?!~`8o?p2vBldQB*>a->m6A+6fkO(Ks zcn3XHT|W%r(9mi`z4HdT=`{G&kaqT(jP268Nzr7iaWMKUWE3~dIA{R!{+iWCTCy9) z=Cc&|&(E2;Y)V}0Dm)ad!=LtI9`K$@S66hJ%7(p_Vw3iWcE}cg53zO~cfBbHnNHet zSWY`(lF~-^8HN{5GS-qbc?=CrS^O)vJJ~;~w1tfP!9?;k`2Ew4FCGp!I5;>do0$P3 z&2*h*x~eZMP_=Z^N32L(9~pm@-*n2ShW7Z6x*3jRVN&Mus?)bFsU?iNtl5qUaIzEiqR0+0w zrwq^14wpyY-%4BAZD%9^A8mE@s9jj$Tv9BNweQED)#RdOIJ%Dv$%iE!c>%Yd;}a9F zKo!QPRNLcDIiu_@t7`sclJ?!ClW!vpj)FJmaX1sLluLC)wrc^;rxajD@Y%oT@e;Qe zUS)NLPQN%3Y>4=nfpkpo8Q?lBZan@`6-RFRS|l(n>ZpS?2A#_M@&PJwX`rcO-F(yE#Qgy(I78BH#gWMZI-dS2Od64LLK&v@oITWJBj>v*~v1AZG~e@GTQjZ)q)w1 zQ^kH%TC!FfGobgfOhs3d($v)OC>>p+Wt7Lub=t5U=3)(0&fPb{f5!$7khdd#1PO#G z#4{jdXtvDT)uwn?%~u7F5Pu_1{%pr<78vOHvd`pv4!e%~`CMY>9OYuu_8MHQRlZN$ z4Cy*KZvBeqYHEVKT#)G!77wHB zEikls3~?KieZz~?Ml=}&BAXqzodwhM%XJksKBsZLdyg>a;8C|pem4P_)tT}@4IXSk zbsuj0n5lWP`zH+j4*10T?3$-PHO#>GX((Uzg6Il%Wm=Z>r#n``w!#)Rl6t0}1>Lrs z`nLHSH6{SUS?+U_!Ey2*w}+nS5IHqTGHlfCuk88u@H1#Vq+C0xIXh$BVOb!@z>8($s*97@zxdlki^5{k<4wXGe@zGshRJCneSx6|aMjy=$~|LamiPzcFq) zB&N4sH8~2}j%RFdD)1%@;po(e9PRyRZk$LL-0DZWvI-EUzWWEH;gcKc)uetiUgHx1 z5#zLF>y0gZSY+mPe7AA%c@BhjSRL7AVeh|EV9Gp9;!NYgE2*anK!`G(T&rlg{dRO; zsBFt}^o_1Y^JigXA1UN6TaPLgl$9NXY>C(jW8l$A?YJ`yzgD&AP*B&v!+(Ef6v#=idnCMg@! z+F7N=)xYND!5PtktjQ~CV^&z6ASTdz{JKxpzT5YtD=^KUSl^^q5*ivARy8_IG~!RU zCIVu@g7E6Hr8)2GXmBZb*tFU1YggGyaIS+6!829hjfXzZ)EhxnILCSCAxe~-MdZb; zuk05M3|0n;44Ht(urV8X2%Df;UA`cC?-WfSY58I5hpbtNSp$VFd_fMysTZvNtM{9j z14+;1>TE2Zxx~xtC$gKvV?j6rL^^V9Omqw4)G!;)bWyRYOms+{YVaDqZ+8 z{Wan`C&6f0Je9FjnAW33S=WMD(SJ#QVcvnb0Dp~g1Y<0b&tJOTL2<5^x|y#XcROxs zA}c~6GgolMu&{*y@44t{y3ZKV(xG&|!nWHl?)yN2L;TpcrS1HRJ(4xDrp^HWzEgBb zu4j+Yi!Q7ug{_;{fC?!pLU#zdP+Hqo`&Ge67+(JY^raxUnU=It0zLJ7JnD=|1-lRU z&!$O7c45ddfbg=F%&|o>lH8j$62{mxWc5EIXOtpKqXG;S!}k8kg56e6MABCBt)Aj* z*wB~~<1z@r);;KS<*asn0e+4-q_;q0K&n1sK$vvhKdj_beM zp5{;xZ}~knaOHj-4DX^avYHym$=^W?3?ElCmlS1n*O)b&p2h0PqIdx*dwitaXJA!} z3MNr1oOJlc+0S^Hem#;+$Vj+j!Tg}Pckjv{1S+#tT|hZ&u<2cQ#KR~U^mOj?svW*? zWoLxNNU^IEbgEwax#z9q(9jaWWSH^IU7v)Sy40k%fS*{HYpW>`rl|SQ0PptKk_mnk zQ5wqGmH35A4IJ1!Mhq3WjV9a>96H*6gbmoK>9*Uvd=ZcheipBf94T0>*in2!5wDti0%cAW3Y55Ni4ikEVUqfl@EXh8Fd5nsl5tLpF|yDB zWS}3y$2(-BoC*LxOlaoNwDFQZD3k%+pa7L1#6#oYaO1al%-TycA1|B^gIIO)z9awj zEHX@_qf&&HDyUm*)n1un?~Y!gPD0!^s}-22PuJrNcny8l-Mv~alIJ^d_rQ)oZ?hLi z$tggQcOh7>M;HCbC2QVLjE! zK6i^F|A=VD+Tz_14E6VGXq77^Z`5P1Tr@3_2(DcGi8O595r#_B0hZZ;btH!|#;J!c zH818YdA;kg%4{o&{QNR`xw&8tkA|G{CYnV(>K&@#(_PX*9f6H>w2oC%#nmE`>;y>D zfap}3pUJCL@qN=-RHj8cIrdz zeqwzW(1+pRbavQ4RGs(-=w@lf7I3*dz65n4@g|plUBy_9n)u#5auyX9HdbjNNDeO? zRQp+!rqiqN?lyKAXs0k^puQjK5bWwP1pwme6SOOw^!}blSrlYjjMrVZmgZuV9#kS8 zKah+JtY>ica$4?(=LAZ>H4b$RzW!b5TwQ?@tv1UsK03R#BBNFK=dWV}{PcR(95#Ii z3`kt12M8tK2@*6qWfX#H01T-EFV11f7(VXwxl1;sInNB>rF9-@kv? zx;l2z#nr;=N=);O;c`Q|%lW60#D40GHDhPd(~(?cG-aidU;`-=+FRq-FTelLqIb;b z&-dAa-L5th=pJzn2yx2nZ6DTm%~X5SGFU)$Vdg-2m9EDr&L5p zEMDvD>)}bg$o~yrm}5AMk;=kF2EGW^Dv`W1hz*FRH)L3Q)WCs5&;Z$hJx$9TvshpkuJ zKtsby3KUtZ;c$bkT}eqv>yo4}Pmv4@FzDQ4V=(i|nnR8m?><5S&9U0+&Cvn71aDfm zpWnq#Awv${0srY+`TpjR)E~(b_Fp`3gJ35J;J8&r5jfm5#w}RZWea$Yvfz@&A@%DB zQjfs|5e;-sMM&!j*+9l=U8JSMbV=CVWY}CaBNHtMN#tk}zM6kOWln+)0(xgHuZ4~q zQL!0Mh|4Ht38Us6-?U6w@Ujs~e;ecT*v&7uxGI3~lXufu`nyLA!Lk@ zUz*QtnPD_BIYoQSg`s<(^EFIl%rMKndbznkp%*t`&Hs*%7|k5R1G5qAZ?l;y9Q~m4 z!R}83^*xE6q=^9Rvpzg*f9^k7UZoy)2LM2Z%aO0qClgtjd307PtQ6qXp~hm4IoEfK z`)`27jNm)U2UGu9HfQ{blFXe}vJ>|v25g^+gmCVX0EGj3gD@02S(Lr1ZjTAB63R+TL0tBTaf&>N z$KM~B%`d9=n#`3MP)xAV?EB;T@MreCp}-?njqJJK$gJXNX4R=oJV(A^Bt|`YLkN)& z@CrIenas3)fT2VMFz{2*rlVpP!QFtdx6f>q4M%s18>XH4JY&1|o7XUIUoRzrM$QG~ zH~WK#pt{g6le^QEiO?bm{RK9ZI;V{ukS#eALuQGu?xm>s{%s4H>2e%i3;`dKen-rGPK>+SVLpltOb z8eyPlu!k23s+**=Pe3Ck`%f_1rXI*MB4z#SthQSJM$mPBsYoe6n2Q%I>c-&zbV~w? ztq(^rGcY_p9##DsBU6DhVH5crGb4PKqd6!c=|T|;-$aPsYR3Y3qWNVc`?i){N)2=L zQl5KA>MkImYX(eNd-DfOWNiJeqH3BojYF2-VlMx?vlh;^@xG+P;EduG7_7Gn@00p33YSKGFZuv$XhAD!$b1>WERqK^*GFKZ$~SL;R* z=%!?m*9;q=ye65Tmy=Zz6K<5iuXzkVK^0^C+4;EjUw&^?EJDNp*o?A`yzPh@=9k(b zsA7_q2?{)JfzC;>ef1Z-exnLeDJ=f1!iPajE=0_LzxHnvU-C0r(z30V!}V_qP?JgG zgPx;gIg>m0-%Fd$Gh)3&|4bU_TWpiW%-(VMx#K8@ZDWo~nPF<;|IX?Tov$r0bqb58 zmr!pdi1R607!LRhA#<}_TXMHx=c`Z2SIZ;fq+?@JCr6Qslq122U`&pq6-NE67WW3} z-jGJ0&>S*p^8dT=5>*<-w+;_k__%%i${bsHgzuMpr8u(CrGeKJxACy(ikxX_?A>{O z{95#73{Aw-xS^pkkugHlEy;_7Lce@0fRBRlxUfxAu8Hw_;lQ+UOHQPnp8DQmgohZdW>9{OWX z4h8vQ>Of9`DT~z$54v~v!_A6y4MMLkB28*@4}zp#q;?1fJb>~vq1!ZN<86>b@=U>Z z54@=H(15uXsqPQgil3#uCCPPE9NpiGav(d2-v zZgkpn3!iC)^Oa+KfDRS~y0yZ+P24YPry>3yjHj>`Bwv{)QQPu`KKZ9>kW&YUE?zfNsxZ;~VFsi-upa50*Kg-Y;2 zvab4=5iC;egrNb7Om!2h=cU3?2rfN>yB>ay+@o5w+lVXyFrOhti=X(E3JuK4Y)O5J zm7e!&SX?uKbxpZV*Vv3B*jl+9 z?S&DKsZa5FqBz1`QD)k@C~8^z&0_OX>p>z1&d{QWTgrK`=$h}9;!43)F01ID(b~#g zrXZWq_Os$X9VVrA;DPQM)p`^2|MThM{iQm2CEFK2LsT(U{4iQ4BWaEg8?Yt(?6SL| z{TG?rtrX%5JmK`=vFD}sF)u7j|3x7)Rx0t_h!jIGOyw-3bgCVhIKo)|K{Ji5F&>Fu ze?m^`J9#AA6D5%fhul|e;vxC9@ACLl5C`L=5v!;Vbo&Z^@3?fF_aIZt`ShdSS>(%h zKH^d$$JZmKSjg3)Y8m5G!e#4!ng9nV# zO4q8Y5O`E?Tg&gXAcl}d&SOz6WTxrD7oBYCfkBCu7;$=d*YNsrkEHd!%40F@Npol7 zYKaz!WkI?=C*WR?TO=N5Urr2NSJ8|Y7*?f4!yU}f3jv%m#YH5k!C?oN-$nJM70Vqb zA4GtkpO}`m>Q9CUqNfE|kkg?}{^FCPor{ap0{W~`44;%fKOz>49dby^iBqW<14czR zYW0O0C_tdvzEqG(qOI;oWb>E!&AuqabY}DWD7bgt()9$8y=-MVz)2iR#E+kNscN?bu0#nigtW*CHjiS>ZFb`yPf$@p}U>a zw*Flrg z(-RijxdapG8!{dXF_$%nIKiCH)P7FZ2bqGazGqT7A`leuUq5~W;<^fk5L;t^#QdMD z1AdF2xWT9PAiTI}NB1(JL;2?&Eb_ORH~$FJwlco7hsT?dV2rqc6n=R45p3u&PSI!7 zj7k0g#S(V;7c*kjmj8Ri{=aI$A0HEaO05XkrSU&IB1^;?Li8LeFV6L|2t(gEG%K38 zVWrECiJwF@C+wtpjHq}k{2fXSZOhgYIh!9O=_QAZfjiqp0(*pD5R{2fh90<>o(9Kg zrAUx8!GE>RjJ6ac2%XCj(I-y`Oqk5xc~DW*#4b48A{}6D3|mni^3$A5Ej&D%e1b(c z%5oBbl=A7FUM+u^8;v{gL84J0Vkr8{MPb6QIDjwDA-$k_rY@NTrUpa`KUk*oN7QLL zO_*N5K#km!4GkY)6Et%25CN9S=cKV9Qj&56TZXzuEwY&@qDa8{RM?^B>>^ZsdD|yH zZO*mhwDaVW-Ht~WAgxGVzgX^yj?{T+Pcw^{LGAgp)^3dSLkt@NYxlXqLP)5yfb3H- zt$i#9`+D1lKaqC{m%8}lpNr)(E5@m8F)(p+#_mQ1&fKK0+re>`m8_#9P)rq7_^g^Y z`81$2hgFN4yO!u$opp+JE{yNVvA=n!H_vU9SoKHgeSW?glZhoh_*~Hoj&ai+1FQZR zHM9_vo;QVmH&FxAkL|DIp`ZtQ+=~Ra*h6VP*LO4rqRzEXs;91ZKWRjCj{@pvD@OL8 zzLn^PVY9O%V5TORCv?hW3rgp~28qyP%g80&zw=Z^>b0cDI`khV&n;I!THkIaEAKDi zP`VA+ z&Kx-uSl@cs*(GGA$7lMoq`5C0Rrr?+Ck$Re)B-8AiTEH)flHe~2~DXvS}Jc@2a6iv5>f}=Dh!T#o~MgKOKW`FAjtOqcpoj#fc-1rvte!DT2Y>)gdf;v7*z0 z&9|GO<=l;reDW_8sY=RmgE$?+bvdziA#f;pQKF{vFo!sAE@ZjX=9P<_sgii75lgSi z2I(2(blmT2Icqvac^8Y^2%MQYc*M&QW|zEJD6SSlhpQ!EMD&id(rkwa?%?HCfS*au zT}DPwz{f%NbbG!{wi?sVoZ%{b%EBc|j=ndT5oLJ917H?crqMWEG%gJ0w;+Mn)X>gO z6?40={FUKrACOXTJI!^}_{3JymT9#jxYW%-)kpG@jPMno`-{eZVfJTb*LK4*x*R{O zD^tvq5Q~KvqK}Z$53Hoij7Qcre;4IHVMtikO3;q*FXk8hw3c;LN>)|ZSxV=YBIlO} z4emE}JT!3rVC5?ahE?Sj*$S%SCKmxf#?~Dk92w~i_x8fBmH?Y2Kx!sE}d4kqo9~IuHnJPJvA@8-U4-&B}A0? z_%`xCkCfJ1dz`|or<~3I{wg6VDry3yAH#{5m5B+Y-aDP~(Gc_Ez@gdmiA0$kpB2HP z3*lsWUE4LR?#g@JZ>&o~_Wl!-oS(y=Fx0BhZ2)WgqaRw7egmvj7pe-dn;e_#ydh%> zrk{glNqI=60rY`0CtdNcR8$xUu+W&;_+by5QLOwW=h4v$>~EB@-OlYG=^5l;MR^bY zC6{#LjuV^b*NSxqa;CY&vtz9O1bvLO`etHLt{s~Q4X}R~4t#f!A)NVxl9mG4mu0}1 zCJl}tB^q!MBrDf;TRqak+*U4c6BpjQ{Q)=sDwPMog5X1CC5!-smx@p?9{{hV2}D3a1O;9P-!|gegwM52>dgn zEGaM|SYrPRzHL`?{zCnL=?5eETQ5@R;B~Og)YfXh(_yXiCFkwgYB;KcV;#zC-FX_f z*(KLTm!%6O(H{rt&()a7n%uX&-Q7mW0rX#TyX=E{KYSXr0Mt+TJle&_a$Gifa< z!k9!Ie@zt02b@>@Y3}oS{k83YuJsx009`x~4kxhIw@&EI^-cZPz9nfHd*c8YB#_>G%l^hr8843OlN7N;c`2!cq zrj^9pIG6x%zU(?CmGjVc*2#&F^4}Z=t7%w*(2A*WoLid|ukcUr6U19PT)+LTW4vV( z>>9EmU`Ux#B5~G%tnG5)MQl?nLiC7fQP{RE!mUTa;*0S8dPsL^RAIEdj*q>BY$N}- zP#OgPkQs@16ggP~NOgfXeXTN!a%B@V(91?rGT$&sdxnkFi(8xsMQ#+~=7SN@EGZR- zZE;9ifA3S00juar5n)46s0*lx;%!tOXC_Ow|n-77lM1{!a1d@s5 zxTGy^=}TOC#W(;Q05{t7+qO%pxZCS~)|Ny??wa?pVX0R*)g8=WjvkLAmHz0)dJ{*L zjtQ0xrIpAcP^WO5O3i?5TbbK#MskEc%^}Pt|MZsKZ=s40--^If`%)tTQXp|?Y z1Q%&;l!-bN!mC)ipJahl!XJx=seMtb4tcX zH1-$yPvD(xnrVvDCy4o!AFFn=$S+R76L}WLOEU2>g7!TCnX~`^vIqqb_(0w4mMkeQ zKKDFal5|T}Ug#(n`Yoh@J)@Q?vu_e>PKQpY&*bI((NXH{-?nyQ3(^o-PoFp+q<=R4Sw_PaC^G3S$%hR_x5x}p!$#&7F7U^ z?gs&0!pP&11MYw(rzO6Ax$Rg@Gy!K%$}ZMqSjWI*_>Vpy;9)1VF`EMHxWWuy_8<`} zLAcb5+Q60i`eA=(3@UKk;*2o~Y5cFApzG`N0|>|dBPCn3K@HB5FM=S8FxAC$tigRo3@|R7U8yL39zrRxXs1uP zv44Q)(8>MY(d{iwR?c_Gx@+RTgo!3D)|wF-C5M3lD9iYQ?7>pI*^GQ zjILgjCO*dGL9MUtX1F&#+7^5XyuR&qSjz0@pix#%vU#2O)UaYAjrFU>v{sQ*wGc6& zA8i}$R%PEPU#U$!IY}1DlEKZ5XvYs8mGFAr?8l$_!Wg^7`V!9XQsfxSy->@V&X@cp z{Ceb%`MI@=dpAG2@A=kinTrKGKId>N724-wNa77RG@Y%qHF3(HqI77%Qj$i(gnTNR zLM7xv0Q~T67TUErzbFbIvA?xu-m>wIW%KDw8st-24Ff?SwpL#yKT;tE0I}$ej|eEp zC=`}hf3ulb(wSytFQO7iL4b6(Ea5M*(1^sJOIEcj-zhA>OF#2Ah<~S6^I9Gj-N62N z!3ITz`rYd{1w(pR=!u4IsMq*qp?I8P#M3ilVpIN_&Z3usvupLva6zQrU;Oww-@R1$+Q2RRV-oyh+N@2F0k zX98bXJ-2O}Tf7gyL05?C>rnu_PMe3l6;70BABnRuhKHC3N32?GOSTqtH{NL&v*AD- z?7~4hwo2`(yWxP(kDKDL7wsD55NxAnLJ!W-n1AC{IRD+^zoR->RNo_ROw)IMu({JI zofiO_)r$iZGK#P60nu;q-L3?o>)?;?8S}~i9~WSd9jF$~4=^IEqqqN`3;cJT&BIWb zbJ1hXFB1qRzFvy?-m>|(L{oCS>7j|FiFK!IWmrbuJM1;FFy~Nb=)&>e)q}Rp|M&Lb zUrYMRDJ$bfN|H4n2HegEsG29RzgLM37Hc*iOc)^bRs4XHp;#DB>LXh=1Kka>g45H| z?(e$ZR;;-^&Q|?FOJW*=tMYhmPQ`@o?F(A)(h4(3YU=kQ1@Iw7Y>Gfy<{l!-)zVj* ztdH-CV1vx7z(AGo?J4&g3QO$Oc~$~B)X%;n`CMzLusXrBZ9anUWnlQkLI#fHNyxf< zxY~1XtrVC^gy%hM+?z`1UTRCYkaZRp3w0E~0(PPWVz5ksf#q01-B9Xr40e;}`wLhx zJ2rxRd`vxC41Q~jMZ3m7QFu9EMWahsU7gc@u^xn3pR~dGMHMq&K;4^q@FBrS85~}@ zJ_F{Dw^-0|^BO0c+kE60(Wrf6 zCfW{K$rU^2zt|U@_qsDGO{@|gU53TGXLfgpO22g^Z8^D&5-~_xm zXUZV;=`$QMAG`4GG^&t7mK652teqlx)Yk&f9mDZEi;)>IC<9Pft>9 zQI~oqy7ca@9kPk&8axN686ruIRq)n)O5{;V#^<4foR#LS%a>RZfm={e$I8lTES64R_>zZBmpR}}gop{+$ z6ckb3>es!joBoY8w%#2v0>)wbcTp9uczXUaDB@qqWorw_eve!cwKq~H5Q3qGFfF8? zfdiHjiw^pRSXRM_7%x6Q{R#-eZia&>U?H5PTFW5in}?3(?;2+>9QU#@P12WXlx8}1 zw&dr-0>m7H3q7Z$*jAsv^3HK~MvE1w?&5)w%VKGaN}3B0w|)Dtn&U-BBtuNNbm z-7pikR#%VP@yunhDvb{j{bRU)q;0b0j`!%)lb5rhAG}}hsTyF5xv`PegdPN?r!%BL)h_-MV)VK1IJ6LhU7i~JZMnX&bX#Ql z3nIMyXuVyR4n_Va2b+z^&S<<=^+0=oT#jRM!Jr>G#^iHAK!6qToH3i*4)RJOu1KyD z8CA=C(OapoKydUu?HOIt>M!L}s-%C2n{xJ#yf)S$)PP(<>IG?(93OtzpTn6IG}#1D zmfAgfv~xhWdEEXhc?2#biD#mnWL`ekDB!{3yi~s65cEHWhLFJby==jv7}gs$4U2jX zEd^jN)mi)1Xs7>^9Z#n8FDM{e*{W_qT!aQPE^JMp_ zlD;4^1mg_H(M3d}32~a%e5Oroh!cZ5Cr{Nsy$Uryf;!JrLj~4!V;rYbS#kdlPj3}f zN7ra5SzE~16n40jggaRb|HyVoV(t!4I&7q<_V28;{yZNz{VaI@cZX= zDSDXbpD}GB*eJBcKrF&Rf`AWDkfZPOx;n?#{Kaxs-;?K~@_-BQkO=8%T{Q4yq_#6v zG!NgC%$t%7Y1hSGI=+3vcK6@68b?GMvW+?Z5A#r9-x@F_zoeQ42@OSb>9V#u7f3{p^ z8w0(-StE*)O`|5WZfR((%!q<>Dp*kmSERHtd$Vud_a{7bDBT92NAW|z)9eqL^55g z_&1#BgF~3km#Tw+(Lh%Wa)?S|t-~r`L~$%Bq^#@0PU)!3N;Y&ZTNt zCWx5|7it81s%jLYR4i$Pl%5GeLJsTxQzJDV=}-DYY}V-e9r7zEwrro_=8o{CUK#Gq;E`2$*QjJm}n@x!$N4*DT6XsEl|Vt&Ty@ zEq`YTdR+_ud@d>7-HgCHo+?Z6W1c4*O-GKRLm;bvWKD8pw2Xk{=Y*-btbtbjtV%Rm zp7NpnSI8VHg04;b+Kf-%+i5H^Xs92AzXNvUdk=}{iWF;E2m&+K4a=nIb<3v-l4QhT z#CBUX-x9m_KLQZJ_gKhs0|1QKu&++7RJ*pJwVfrHvj+?u#IY4xtx=L_6U+)Q7TV#2l9H<XDrcKYO=f7Nd7XC6B7Q8YaN@{pQ5!F~Fccg$ zl4K;X-L?&GtyBQ4#Z$c@N(Q$}abe-$`8cRT?J}?DMgaN?fzinTu^W?C9aPUm`ojAF zR>vP;kc_qJb90RsDh3+EdDj|cUn%}cHnJ|!( zLqzPz|K;ys0^J)gK}-6RbH%;~{P#Jn=I9W5)XR0bz+4klu3{r4CH*=s!`QZ?uUMoC z+Rh>6qC-`IL=4H2|37^P5rEcOLzMRGF`jkr>(RZ@RIP-z=d%`2nB&f7xgLDdPNr1P zt_<05X=!KzRJ?Isvav81T1_CgT7M^L?ZZXlV#X(Aq%my`pi4~g(Kq>Ehe?u(MOJ#6 zr<{S|reKx;yv}Ag@-(-mk()}*lIFi3)%raJ+)~f6i*COTUA>su#xl~+P=aA>zvC*Y zB8Tj=s45)o|6N~p0cPNYZ38@1K$X$JlZHmACNo%M$ycb(Z*+h<{69XxKz^wKHYN+h z2~)gG=f7mCTH|vqJgyZi1bMtfD%++ry+3FAsStjhYo*E{0zUj3NElE0emLEB5a@@M z$^Q!Sqg?8hKWDSr+gocAt3Z+9x&wscM!=U0t4;B%EBr8*YP7q&>==`J)-f*pl4c?) zo1KO9$Zd7)@&PIIao^*r(5D;oEGW`(-))W&2nlGg{s-?0GkDqdpun|hO%pgR_#^It z1va9sd^bOZ(&ccfzF~taI+f4sj=*iDYTl%+;p%2R){(G?|GJjJXinr8I}(ELts2oa zMav-=V={RgnM!Tna%TH%GoB?J-H^u@xzw)~%}6Dpt?#9XxiR67@pK#yDw-n~Hv^q>*H=ziB3<#;OdNsBl&qm-+Jc(CJ$CFOk9vO$p10-I=9> zV?2pZ7o*O`6CO$Y@5or%9Sh5stDnun|0@WG^W)EthhiyT9UvLyY_hvXoyOqb4Ui2(DG0QZgT~L(Glsc z>#I(_xj3pTmKxAYMg5@)e17)uH?tbQ%_8^GoderU^q`?&)F#`HmSlNVba7`C;%I$R zwT}p1jN|mo32Suorw-cpEjHJ2Vbi*B zdH;=_uc<14A7_-z_KJ~Bx%<0#8Gsh%Bd8##{;M~f=IDI z@T0ukLbNmW5zsomg4#-#A0f1T1|i$NpZ|XAG5NonowskNQ7ysv3)Ijr-sn2EIU#wWe^t~^bhyVhDI>0$PaNDy(hOvdGLjaO^ z$1!oc5$^gmaNN|jIvIb+6x2xazzU(%Ccj)KH~YfTzp8FVqP>OdmQJ(7tp*Dql#|Q0 z4tR^mc3#!9a3rOt|EGrJdbaYJs@AUSUpK3nOv71Gj&Ff{x_l$SphZpT`j(FGQ!|7u zIb)f=pXCXPP(RmP1&sf6fr3IZ%WglO6@e0&w}&Zp%TZc(q!iIE?M64wha|FwKYOiy z;t<=kFU%y`@!ajCXo7hM920bpUr=o{ej{ZO!4hyg5B~dilS=~SKU<=~=~H4Ee_EXg zceYfWNnb(*Ytr~S#8;)jkI0pMw>VnF(wBW9ihww-zbI9{k{)*`_0r5)1VeBls-Qo3 z;p#_^?J7zd10erf1MM?cEz0EMFG~!0*ysNA;Mi&?=OZY^))}Z}^F$W8e2R_9mipE{ za#hmA`_t62rD^-t)Z@(FM3SfMZijH5bC!uB@zdTlc}{#a15TGZ_BY zoJj&f1hBbQzh?mxgP+j+e=@Tg@&dfq|5&49A{!quWx7oh^RNr7C8`#+gY@z)R%s1i z0!P?>s|9l&?P!kEnE(&W{G`!{zwsXzV_0XiE6G541G<>6OkVFQS(mX(-Ey)*C}3bO zBEtwfL*VEPZLUD3&odLdCy_Jud9s)a0w8WL&6Vb~61UTq9dec$sd!O=HR|#A!s_o{ zEoa7EkFy2^Wl!w^u_H!2u5lk9$e(hnH`1?Oj@6(e$XW^F;ebpHOnT}OazY>*@zYfa zE6B?O2go@TRF1Y+!(XBjhJA+kKJ;t5caZ2Su%fezugCgSZKTBec_;86@r$roPPC=E zB*5WLz{aml<3Rx(Ya6&uO##{InvRmnI6cs9o#X*erPY#h)96+T&l&r!39#j7txMOx zA=xO&xZ_OU>r+*X!~O8F5J!7qnr|$C&)I;#NMZEacf7iFTcoT-sIx7?VUn=tlRY76 z0!S(}U8{e)4TmIOf2yYrlYB035S|XLcyo5R`<_>Rc0OW}`05ug=5?~S%S-^#NfV~8 zkr+Au^T=Y4u|-Ov$_Y*$LG@^@+1We8TCE9F2NS(k&ZPBn zy$zVpO!=^0cCOt-K5n?qYwJ*;3wV71#QER!Z|2v9kmZ%)ls`XEsLFl7SaQXGFDM)4 zImsl}ke~Q@mCI^h2W!+wT<6CKP33H=gpjw0cKJfd6dbQt0QV=Wgp^@{z3b39MV8{c zM<5;Ri;^B!A5sB%fN5+J5ofvr{22ZuyKFxHR{eFTC3dMVt*TXsJt)`&g4jn>c`~oV zIvlvekRm4tdZIS#mE?b@pKv+Vdp_GbxEmt3Z(>*f!cIRcn}}3Av?{q!b#R4AzDk;g z1B4ju!~R;w+=zQH00`~sy;4n*dnAb9aYE@Pi4mlBMl^_8FRv)g1Rzqt;Xzcc0eCRNWx zh-cSLTGovu&_9FR(Khm};rofMoEg70)DBOW(=`S9$I3HONvE^Uz-L~8ZQsj?2Cz59 zJykw=WYYb)e3_!#5>mmBUnMeNN3F*+%UI|0)XMIj5+!C$FOyYSQu&R&St) zclnaStEumOCQkOsQny_*C8|t5Z;7tn6)1_q>(U7y(_?a4buYlbGE*k-m(#UM*+iO}gb>VmcX1Vu;nn(f_w-;h zev6FvzQv1ZjN-wd^($>@FVUe~URi#>-%CCDLAusmjI0mgzm9yO-um2Rw>y^3Gv7fz z+HcOLuBOKKbdb{?X) z{}#5`?q5`K^F_g(IdTfphaI-|!Xcj%rK3&&?0vUNSiF-RcAced~g#++?ERH!WLh``HXbp&I}^1@ZkfJ8V;>vhJuA=4K5RZbN-?vU-oxV5DP zCwk3;3dL|85yvyp+iuIUHSqGS=<&ErpAm#=zl>vKYMB)Q{#?Y9_cM;t6^E%uG1xLr zzM&)L!}+LCleqNs`u&YdM=u38E9VJt3O^(4N@TuKjXu(6$?%zVp@>>3 zg6HvEsaC_P>oVW{$~CAp>JC3^`F{BmYX^@-w1*jZ^Xa$|?D~sK6dm7z`zKAyh_3IL zB8pio{~{_Nshiq2`W(N{5xA(BX!H`!K3d1SiP!GnK}Qf?#d&Wa6lXTr@x9v}+)?vP zDcXLwXzj=8vKJ5j=#S8(tiTGL64he5rBh68Dlh5mmxpD9Q^FBBjU%Ep<|M-QBX&KP zx!x-BnNfqhVES=0gwXeX)h#0=p|G-eVK8YGhH>t%qR@PFa4CNB(AGN$Uf&+)3#6AY z(A*|)u@#5!JQQ~PS}NmkBly7%Tre(dWK%T1JN8@4dOKowdqg^Q#tJ%f?9k zp$0!w+Yv&%mb%XO+pc4iE`xrRVINq~{Kv=)&3*tqpg;w_rq8MKG(`T~B*Op@Qdo{n zG3Mbh&mBBrEvXZ_AP%Kxg*!03UAymRcpU1#q@FZtns|K0;v{dPx`6?)q2G#%U(PIP z%bX11592Or3#9fyA%*lzl8xGoh${UX9=_s_GnMauZNc__AzwJjK*RscK%eAMPL#Q{ zky(mNi#Zj@3NIaAl*w?`%^4LFd^7y&fJj59Ui6~CFG>JS>*8YOk3bc)ooP+_nJCPv zOJR>ClK6W_rKo+ITE>3w)XDDy?&u3KwM*O7Lu9L4RXw~x#;I!MuWvO;(Ju2tze`%- zshS7X^elDJ(L`ynccA-y?pGUJj^{vSK@cZCTW+ueZJbA^OZ{oYHVdbQQj>z9kq8NW6$ zWJQ?0&KAT6sl_}CiIk}z!2&4ENGaRQ8#Por?`)s!d!S7#P(eSk1XH?nmeknX%=K)WCAxRE=$gn%Z@JkKd+(^(HE(Ch`rug|*dY3MqCJ4-Ho(K6z)7P_ zd$#pF7=+*Nq(zl&ENV$`&Ym0Pg$7>VFmXAB%Lq$}lw4s00N5qs70`D=;Qi&l$rzrq zMv*f0|KRWc*0jBt=B=>0(@xv9e#BSjZ1Q990?!Sq?`>k-?wcjUdiqSDh8umtB<%N`JjaIB8&Pv!$OSvjRC0$( z<$GxhBmfqtL*3Oja;b9KbjgZSZt7>lV^$u83UQc(b zzoh~Cpl7H7TpLK8^Rr!@T@Mf2ecC!kSnvD?*{?mTW)~f&Pu@dXv{?FZ0`I-I3E_U2 z>E-k=&d1r)!lF0_j4Q@}sxs|s{%VRq@LUBWTpiao z&LC;6&5Q6Lrn;!u-JpXQH=J2YxQ;4~IsQdStF`g|JN@WMb@CoY8qPvqYE1s~g?2_Z zu#q&4J7y12fMZSn^|7Vwsin6T1ib1O*HMIO$@fJynBlyiVgN#Py&?<^vQK{Sci&1$ zTIv7Yl<>4G8SqE~HR_7QSJ*_@4ZJ(1iz`D??}|QLPU*JlQVvv9(xHX4;Ticmfd!cjC63S&1c31iN}t z|8`i9h>EX3J%k}0Kvd2p#Qk%-KPr{Upu5^+1k?ufxZ07b`V$O`OA%)vF_*-wKYY9$?nz2m!6mU=9{3Y8a(utVU%0<$wR57$}VZWKN~3-Ue2M)&$60^6Gp|V#bM}_ z&^}r10Wv=d2O<>CA(NOKwn&4tQcL4uV!Xm}emQHZV(?)`BiJUg(32hARC5 zSdyBz3pJU)+7}X8RPM<>QSKa^S-@n>;!QGY!gR$iOPg*Yhypd48{iE4A13XzKPDz2 z;RpI`gB9-i^}00-M#_+Y3T%VfhjD zZW^~BJFs0@7W;z$1N{2DO)JU?iBrLhq-Y7@ zFHRM!VdNiV@F{~1o7EYW&)sDiZk0{l2B!q+cV9>wo8yMbE+aWC$zQUR>3PSx9#UuY z0tf(c;!~mkSCBa>h&0e8`h?fdRjqK2Tzg(w){vc5C1)VXT(mJBcR!RAXCKc($Djug zdC$%g*Djxeo|~7KmjKiEPJe!%C$LLP7#0>bI$K{7qOZ$?7F?w!1d9k7*Mhr9&fx+) z9_On#nVBy^qG`o`7F9ST*gHPb5}>Cq%V1}e5eS-_M%?~!75!tNx_SwEszMQxQUTxs z5L($-$RKh2h$pP5dV*PunGu9gdf7K&R1PcluB1{X{D}{AHJ|iNvgFV_!k^YupES+! z_tBj%B1hg#Ju(oKrWwp`QG|4FEl*L(b(^lrTh1W;!BJ$8BmJD=b;jj!W$f(iJRQY5 z(?t_jbEOcedgyt%R8b<6fe?{MN;7}zoyWEhVPu_SoN33DN>;|4_)9&6iW>I=zN04h zAV#|xVJulGtA_J$TBFa&X1>%y?z|vb^tPf@kqSjvy`=7NNdyH-2&HT#HtW+po}neY zEg~rM81Jfx-+uAkEga33jGA75K;~sKpZF^l zfyI?RhINPtDVVjveO7B*rB3Lg?Z=TA4{r-FNp-vGxTwj%m_Lr#dV+bqybe2n@1$+E zN1$Uvb6r+Bt^I0fF&4R!QxX5?0vWs(@QqmTxA20S(wl~Q$;kze=~lH^R_Xm>8_FT7 z(517uy4tZf6cs~k)$_Ov9*ZuC%|aPIctCRRK`un zE^a?s15d>SJ27>c{7}GzOQm-66?4gC(qeVj5|G@)c*R( zeGLjlWk;XjtW)l)%P#&Juu1h(8cKtrqF!doq2N|RMXOnMQ7HeQ&kFdSo<|b2?Y30B z&DDgrt=#nyK--8)2ych8VWV}L@w&yHR4x|VY@AkS?UR&~NSlKVUbZM1bK)AXh-B`n z1{$={HvI1uAq20Ig*SSYt2Qhb|Al9qD>(VRe+nSdjsgjH`PJ3c8S$W=c8+opG$O9* z_)}IEnH-CdZVtHF3?u2WBFuC^-P3yMJWH@Tm+DL^G9hOUEQD-eO^Ih$f3FjECbUn| z7%=H|xbnj^v8hx=(m3SQrh(XataQzpAqEsF8t0Qn665yer-JRIPh4j#Ca0|>lEFkO z?c9})f$KSx*|x5TZN$VbgIF%ROI;P4v4rY@yxqw;oq(6KzhU6cbNlsEkFtA=6fkK`(2J_E-1zHi9cG+a7WF2t2nzR(b=?T^k z?crCqnV6Q1y@Q4z3XZ3yT58yNj7cMu%>ybqi$eZvwwEz1S|J~ImE>qGQmGAEB-)6t zRqc19JyX{n)z9f&e%-BB;CEZ7X=~GS+YM?s?^b?4@qtiqj@nhzIW$eg1bk=uX;D4` zlarI|v482R65r2QK6Gl^2-_&(Yh#9IzkvfzAe{Xrlc}18Isg1P({tDf`j+b8&*XI* zW+b0rnpv2M>$(6q%;Nlhkjjnp4K%six;B9gAcDAD@_$;MNA&rfjtN%nk?`y~?34Po!r6fS;%q$gUm!7@b$L@Eb?Z;VgnS<*f*O^#{( z3o|xWB%eyXGl)UJn|j28QzpAXWRUns-X}N1^lVh%(%RjStjDHWonJSJU9~7;{{aSp zS>tW0M>8I2(o>X{AuzM_V~ClyisE!X-un&?YtNu zNKtXed-IKRoU<1MSkmOsYIN^h$@-avblZPOr*nQVK%n*NG2@^HM448O{|wPjmW%h0 zI5+TD2g*9=cS%7Qt?Pjy#&4-upK-)R8V#uQ_q@dA61$FKE2u&)Ip~2t-FTfVH(<`=cp1M+DgWW~sI0+kE-&h_2-T)6waCxg3jTl>+(E=@fPI zVh-zSj@tS{yl*_#R&z-L(^LI^pVu$x{pi@v42-NhF@K5bIP|;RnFfwCGpKaP`#%zuOgZfE<{m?1A_ zFWgnHe~rB0=6B_DkorS96r?LVO zfww}-KSZC9aTD22)R?}j{<8c0zwiV#c>rdC5>dFfAWj6%GsSO@=_7KA-KCZY2A3*` zyJsfY_OWN-W54|H-RXG|Xy#yIL?`U{@zjAaGpkZ9_vA~s=FW3#_aVG-MPqV`IDN;* zTr@&6uCg%y7JA9gBQ<7<4(UBSKqlbtM5qU`_v~)FZb>|4+M3O?Pvp~`KLH1Bm6R^D zFswni*og^&M~BadTmJnQWFNmalX$h_j4ZEzEysidnUs1k6qbAL-)_J)rjhnaw_L(( z$Np~#!ACluh(I_RGzB?t-_P(G(}_t;obQz*32jcwdO~;#nV$6B#ZauGin@H1B>l^` zi|8KDa0Q{a^8xr?efP#){CEpp!OvNI-Y(>0X4B(#Sp5xr15D!=nInAF2^_A!Z#RDP zriHP~Sgz}l3$OV;&*9Cw)qpb`IQH}d;J4pC&Auedv8-pO!vKBVO%20@Q6?&07b0F4 zJ>Df{HQu}3V-80=I)%wlN{Op2ZeCmFjfe?Xn|^p4&Q+9gOtWx(7VloY`59VhvNg>#+U1^YZfwEc z2_EJDuvdv~c(9zW{Nkc0rCUH&jt<;tMBXm5>$;3E&63$M-k6T2<(mt_v&g8iknR7* z2SicyVgd`|zyYOVHPto}vX-jjpH6;WTBg$+aYW_*_|&4#{JKr(Uc%D`s@vXM{S2J0 z9Cp*N+24W@K37}KGqkKC0oi>Y0i=?V1l>UbL=o3_%+-8eou(#L(+;vZe|R4JKbUFL z(NOOSZy;8BT?pj^!I&w zu^s>jr0_48tzYRrXe^eKzL$7!a;)YM81n^u*~vZb3_l`oIQ$YXlq%(?OtW)dWfy9Q zcI&JOIlpFiE;Qf@U3FN!mJ#B0nu@k?Cr(kkm@37VvRSOty6j+WY2$Qgr#Nn%4~^Pu zaCeFDw|Hdyuaz%}yKb-d^ATB1*C z%Rq4#V?HZa*p6~vp5)_`LzE@*5#)T6R}3S|2vgBongAkv9@kRpXk8_xEJZehVf0UA zP@yku=ukpXhba7DzvUPIlle8@aBo}=_`bl zuhwmN%G9s<6{jHjrXv^OS6;j<6!dUNJpHoYiqicjJja zP8oLj2w>)wy(@l-Xq3O=!0IbbG&H94u!E@|QS#3%RS5FkNtYc|DQ+TW{G4>LXG1iJ zf*U2CGdc6l-DS-|8!sJRd@g$Pg)aahX@A3LT}H-CdHi7V5m}ZC!<(U1Z5g|RtsxPB4lW+Ax1=BvD+c7AC19AZQUT>yPm)Muy8AEm) zsG{z|9RC4{{@nKVLq0GdnGU4aU0pe@cT>e3XhadgZY^PW|GWTc{~*^yyYhQiwpavc zb65vb?)EISQdw0!oCv%mN?rs1qCjmH@CY>W2;czu=KCG(C!O3c!j)FT93-0JmVFRvljhc5}N0o&<bL6_sp298%cXMo zfO2D_({%qAD*lTWMc|T2$B>0*n=RWmc!`YsS2X_L+eYs<(&m4KDY$;%a5!a#dp5`} z0}mdX4AVMolF&DD&BB~^J9(R;ey2~_@s(1hHLBExT@=YaBOgy}>&I<^G*4DtjS}r- z$WY3Z>l$#S)D-^r(UY3sArAVUyn!CjyI`D37%~PMoR_4(c&B(rE!9q9ToP?gE$08M z|I_DJ;pLn68Ez>N{Q4|AR0d`rmi#4}gR2J5w})FrdBXevzO(ha+okh3$7DSQ{C@P; z`!olFQ3t~NxbK}3>0Z2i32;>pzl|g!I4V)StvvU4V-^LH1$?ud6YQ*W8B4xtslBRq z7FbvNKC52FHQR+knIzI>FwUS3oXrpKo!8l2#rfHJz6VWdtwpcf?J?@py$Vp)n>8V| zsdK!C8gT+?E(8@AGBvs(xGT^+_4wV(Vkkf-;#iJ*1HdrOz*_z?{g&FmO7|l!>fPak zRHod23(z~8Klhg!i1&b8`+grzh*U|KY#vL?q*l^}Pw2XjnzPAbxha5*X4LOlHGQr8QjMW9qS zsn;aU^_5lc{x@gVqsdTk4_+Q7v8p?Q^w1BZ`!Ph;rolupR%4_-@=&*cH7Vw?#PADEU!bhXWSHK8O#qG zglGB~w5%7b|B|+m>uYqBWcb9zgmPT0k@T7Dp*RTA;`1n{JvyxvXXuVhY!;iBUL_g+5Z!ZZLdy6Q9 zcnqtU=&59tG->VvXlR018Fo#rd9acC&nF!XbN2H7bn^h+emMg&_$nqFH2s#mK3~^-`v!=)3e?{^<)864*RDwkO6Y zA%GN7Jlx}&apeC!qKN8X(-q{P1K(>F*T9b1>2gC29S^vtz~m3>x*zryI*!w758T%| zsOWGIXr-w1XO!2JA^1F4Ar*faWb;f>WFX4&Z%7h`gMo&FC*X{=_3TtAhy=F4D=Y79grC5)D8x3&I%9tHuLk_0aszq&q#R2O6 znP|NccGLTVWsqj;dOP@#WS=)W3(8x+_dGc<_Q4{Gp*7cw2R$H&D`Sv()SGmM{DmE7 z_>{}~U{5E#Yw4|feL)S~2#c}4GWy@n^@bV}aX)XnSJ%)OPv^k~O^FYuL_(1M<1>#= zSI>#a;K9%iG$guQCm^V==H|{?=-%tq*IChzcwP0hwFx1X>04=K47!T?BXQU7H!7%x z<+1ecH`Qd&WI*BoT^)6qbrU+oM^hROKE5O`KoK3^6; z=WdUUpbNEQdRn)oxfh-j^z|ybEyr7xNU2zt`_~6@r*s>*nk(UcSKI@LaEDL2UV!8l z3%IF8Yfi6-I=ye__WXU8g$C|Az8j4qZA$I0gZH6e$YKr7dBJQ>DtIH(haJEL z(QC9B4{F{oiT#`j%*`4BsgYnMmFB-fzT;2go;}b1g|F;9FbT3|aKJt+ zC;?JaTkMkcqg|f8OmR@l=*>IsNgemVkeD&(c$kDCmasTSgkV9NY)5vQ@8y@#K6s$# zTM)`_fybanw}(HpHk3o%;Rom{YTd+d;iy^8Y`RJ~NZCcbRYeZg{tAt0%C3KqClrG} zMB9+6O@rA28ZqY&8CvXc+P*1_a+z|T64k-^=`0eg0gE%sX%IgOHHalYA=J7-dPTp< zD~J#ZPxZW>hY)o04b4EZ(X_K~ICVpXx75xgKGz|}B6K=CEx*_W8lu$CF#$mv9iSN)xh*AQ1_$l;#xW zs>)mPYof3;MOKkFR`T!q_bvQSQFS@7v-?C~Z_OzoOFOEt1e?$Yyv$F-3L9;Q69XW6 z5)k<@`cI?#0g=c{p;C_cuP^kl;CAXH%VCh73C2!dm*+z~@Wv<{nh|mA^>P#Y`@lS- z_o+~1)NEB+plgF@o)}7qt)Qag&2u1HMtFD9azc-?39j>{z>i8gCI7J;a;x%DLHZBz zWHI34O|RR?ME3LFm3dS^TBwnc5ypqM&{t)k z97=9O%CCN8j6_4;CwmjOPzt`l&RPpEf#w%p3cCuc!Uy zo@Ebhz^#0qW7hn*mUHeoaUB zSm1NSK}}NH;CTKn?~;mdaFDa|+@Ye_0&3ODX7DymrpoCyY4iLX=YOUH$jHcyO-<#~ zzM=yEeVD^Gq%L(m8b#67@{t?R89eGs&<&Smp0kVhImU~D+--6Gw8rj?hR|JWfUpoh zaR^ymSsQR)c)$w$dS1?R^9#Fq{OCXtp;2`3TGX>rIzNS3Or{SK+WgDXh0TW5D8%#J zIz27#GCV>Bp~J~zS1nz%+$SSLLUsl*K~N(0HoZqR7QtCG-}?e@7nwQqbN>U(A-Scp z;*m%2`-S8XF&9|Rul%MMDJ}Ct8S5SWH^hM4=qP*@fV!wV8>@BbFiD^1W)M>)V@$ z(d*GQ?|C)P3f`*4_2(gyPKq>+j`EM2q!RU;7hW0-+J03eBqY4=NVv|vQ+{AAn_8rV zn4NX=Uf`!LWpV3VxL&SE;n}{)PU`gbwu^Hc`6Jw+RN+@SKMK)q5K_iEdr8Vvk%=C} zM&WfuMe(;5y?ghtq=vbd-Jbr27t3~~J0gI$=yj+1+fzyaL_;xkq7O#S)`BV`0i-{o zv$4SLfjh&f6Lm$)h151RCNd2GYmyC~23a{T0zX7;NPL95nL^9Fa+!nWijC}+w|Iv4 z39LQ>U`R6j*bdyJp zV+Hsg{sPqW<1x>Uts<~IoP8g>71*b!Je4TS2Txz^rSIw`jv4a*j|-q`LH*t*{{fS8 zsj^5e(>oOd`X%^l1w6YsP6{O8C*6^v)aPOj4WtF-gyag87n~J-E*P7aKTKSGXn3rB zH!g#YCFcLr;!gWh#Bn`@y)H}3rfm2=|DIlX_OyB6!`W-4qd~IbP3WZ!mIIQtp04A( z<}JZ1M%lfyC|FfFUpdUpPoV(^5>dxd<@X5@L@zWxD-gHxLT|AzAC{=f9we5k{I#?* zBk+Y#zIk7Y0Vv8et5TRR{i60NNtiYbgwUN=ger$DViSRq+95tupC0X`oV)t|wSiWC zXH&Z@)i7loK12cbHKu3Zp7RN1N6;3K8jilG>xOoG1UiyC*ks~k>+a{@lfWh(yyN7{ zNzHgUIN%NPqhPZ@#LpHKR*k@-x6DZJP*Yb2XQBogdc~HJf~{rC&Q$(>J^W4w*MMbU zY*HfhQR1C{ILz!ddP7z5@@fpm@lD)cR`;`LcU8~8^{NR+D*Zu;4AEPQJ2&u;wH3`d zD=uaVK}{YC$WV?}8oyX|nR%SQDt?FT1haCoLRlM>zvbqksAKmOXs>&MUFVfe>J*TV}m$AE@^&v2h_uJB02`}lh@7W61czjrVQB0ULbY=&7dfDPQ ze2Sz_brc7|wB5NTyFd2WuSbnxc!grO23E7+MiTR|j{xT`UHtxmo|0BdhjNM6h-lEN zZN+%Wh~OW8?x{|k337u3DErL*kgY5cJ{Y7NrRqranF7wj`D3%ulwH>rh|YZbCCwW3 z5;4dqYC5dLD%pu4Ve{2KeY1>xJ%&W8rvXazcqAVGlzIE+2o+)woBy5s**)GuP+FSw zI|M+I^x$6qs&&r{vC@vI+3WBlTaz6JS~nVAMDeE`kvSu4`AXn?LN6BHnR7UisSJ!! z;Y>=VJ$js7qVG{8bpKzDdZe^QEHF*-y`9wnojO#hFaZ1K(*`$?_L|J|lbM+rDa2?f zhP*vUmn_-?f$-r;^+6T^ICK1tXn*G*UD-9=H!dy?{Uv)5A%xLddGX>SaKTH+CX4jZ znbKq3u}UyHVEw5$5aF^)R=V7t#=N=AYDMt~>)h4vXe(vbd4@9m4E^TtRB8NfqV{ns zRNO3Hb|CE;ns#7b-Jto*;G83H;jlS`cbQTbrntBI!(CZftH=V#_5)`Ctrx5F_R3xD zBr~GuEAY`q0YJS(4F#&KelEV>putd00RedC=RX|`206%_VyU0D9OJhG#`Ca)6=R#T zvH(R$kCD8@;Ors2qKIT+@hDsuD#ISetx11S(Lx$49Mo0;wcft)y8qrH+Qb|J*|5Go z?FzGJh(n$zn110882BE9YtN5i;ekl0qgZHYXk0MYn~jnV&5rcNx)FdND+-=n|85C& zkGsWy2F%F-3gCP^hnPjg$3_~S;(u16#qi;+`puI-vBGmM*TNIzfG1+;MLO|*1U9Dn zOt{m>EbBbEf3vS3C1THvuS?FVj*BCtIx9%}M@*p>izDg81pay_q9>49O%HFLU(td7 z7;@p7EKNQy19Mql_OR?;)FWz{pt6G_*?Wi+VDKc(sD7VKKT%v3N7b7%X z#~wqFU*e~6E{XYJ9NC&yi>m(@p@8qpBc3MA#oi#qDG78&rr=H|M?H^(n;9So^&?{d zBzA9us$lxH=6^m7k4sTP**D-VOR>%YfPCftrpl@9Smh5bu70l zHRSocdZ$cZ!r%2w;H9XKtTsnvY8M^y^b|y2QB^X^>mEbMY3I^uX7_UU5gLYyuY{2) zG4D)!BZ$e0L5Zble@Tq>U%1#2$}huw^IyWKd>CGj{`3sAe|uI78Svaw(b6LpY@UfO zY>1hnQfzz6A(!F?2Z5zAzZ0#>2-==cI17Ty@!M=H4k~6pGBGxmR7%-rNl;fMAk70* z&*lKF&zEgm5CPCz8-83oVu8lT4ixYy)XE46xu_qV;?yhZ5}7mx3g1@%nEH0g*JEf) zb+{vSH@Qd$DXAe4L_c!Uj3h&iU}N%4M1p8xHomnXpi_L!de{Nj+9_R_G2)@NbhbX| zP5d>O!LZweu1$+?M4fS_RrMp{=Za~rLqD3QvRSZxwGG@orW6s_puSC1tLUw!7K!Kl z(0QJKsZ&;h9qhAr@4<8U^jtHXXnK?>y}5LxIa++wa1yi2@Y>NvE|8RP+F%FaFA-^X zd`L0QIbA7AfT0LiT)sXsr|_|P!4c20yf??^~Pd!rp80MbNlUD|!Uy@jg9;IO}v<bC%p)Z{-hzu$J1;xRpXr!;rHe?vnv0nf+6_H&8kvYJH2dBF8kB z^xZ=4@<+7;^p5@4Z=TflweUvBVtd(xEA06T%qdZ^ZW(|$g#K5*bC3QBcumudn7y` zsCa2$i8g3+rHAoYFtZ4jk{vA}1-*UEtR>>+A>HL7Mz?fnA=FsC@AdEwPGI@3^sd0a zzbh)aiE#p_PT06I{k9{5WHVh`dCl8Lri9Z9*w?{t*#PbeOrI{ogl{f2@)mQ^hn3sr60hZpF$6TGFn<2f z*;Cybo5~u(Db^clspssBK#137)~B_MFPe>F<1}h+yqQd-bC;82c6r!`tPk*x1D_ zVv}|&BqYS$QnjwN`~=3^v?L$2j;y6|)^1l{c$~p*9>Z7jHUXYYFQ-=B^zTjt}V--RmDid4KK&;vJd%Z92|s7q58f2-Qhov&6rtWON~sac60 zdSWX~^UZ5j<*$t8zvet$n5=%q*H`sW`pmCRM0uQ5nb6o+M>6nd&PiKP%aaFDJ=g~i zk?E9i5t-Fy`;#u zuK3vPN1iNcQyYKF6$pO3xwefT@t%`m?kkUy&PC5!RsZS4A1zr)uwly`kBeE#e7;(c*;MykDVa-Sn-M}MyD z4Fry32zBmV1D$tfLSpZSs~B`X%s3Ld+@C%<-`W)M`i5C5wdi~B=7vM`lN#BFS@QK! zLhgT%Z3a(Bgz(jv2a%55+MDq+)b&@n$H-z!v9QVsI~!iDwj(y~$+Kbq_|^nVO()Ttw*Vpxsy zkBsMtV?PYd-#YKF+>CK!nKh_+jofe}Ygi3?&e1SaQ^~U+&rSQ!os$SDcS8H9*98wO zW4@<9c}O7D=jw{= z;=E$@>>gYxJswD_X~V;nx}pCaeG{C|i~I{gFE1Y6s)y^h5x20(Mr%g8+VHW{cpZ9D z0;CSG)#BaR7{6jWR$nk`uryu_PgS( z1gDHLH~c!q-+V*CjT9PvI3^mkk)PSg`6Y^x3U6ku>A{^TY4t4|&)?=JW9O49(@9

{#0KkZHW^1f9~f$cdI%$qluVl!KZ<6jrT@ESYR^ioKacp7NmMi)r#5uaK?`n zlAPrqNF9sVSk!CnZv7OVnyop)Avb0^rZd6$r}BI2`2nX=bm%bBqoiWbq+($N?Th>J z`oG-mfiY&k{`mTq-^L&YO=xAtr`ecwze{8k@xNvQf8QCudfF5yd5&h&i1Z-a_VWNG zG5x$!WYq(u)f*^?&VmBGI~*qLDAWL}Z)#=(oM#1IUUmyPZF|NotEGN5e^-Phcq3;oqR%oudL~DH0@mqNwLN7h)p8+@}7)^>zDW4SVc-LiHaLddjhBsgIc2HMP8Js`c#BB+SQi&K)ygiiqV`uN#~W16VY&v zJ=7Z!cPh+ICt%PyY#zWKAPx4a;o!Wn~GRn7K2x!qqAaQ)6%t*|3 zyjbw%GE~A`YdzCF#(N%9y)L=KbOY(5P|H`${-dt$T7|h2!cxMy3w^Ik412lu>XzDY zqo-$i{6C)=UAY`g(=+|Wo41>YQXY4R6gn)fD;C-QIpKGYPB%GD%c0q@_E*L;VFbt9 zi_X(MUxgLT5Och@S4^oF*=sZitF+JFPlJseR)Py1_Cw`2XoLj zGO&bQ&6^_MndR~SYPri=3V#jMPH9gyS{@P~muzRlEXngDFKS)ru+#X>W!yeyn&_b5 zfs1bM=#j9dOZT`&o4ku2)vFO*SRT7M?rid09*u0==mn=HFKYADzIb7=UgLLP!9Gx` z`0QE@T{ieOBH1=cGn0NchhN8m-rB0a$L*-Eudl4+8gR9?w)P%&<11j4`yI9ZaBWEA zYgtJI%5SF~Y2gp&^p5FWvWp*9qSh^~C)tN(54@x?UNvncm{Q4#7l89K?22jAdxG|( zX0G+Xa)bc_t%!Vl#o4k~HpvIw7l$P$9o7SPaVcr;)=bpy0J>HT&{s8yIQwir{f8PW zB__dYX?Uq+o4dI;!O}Zd@aku{0dKl(RN=k2pRHpaeSr-&dWD~dnJa$QNwsgc94fnS7bnH_c6D%N zA`qd0`hTort~1V{Ca+m+v0?&SVq)S#cjPTU3ZLUlC`fW$5C|c1b-vd()cA;+ssf#O zF*)!j_RW3F(W^DJ4@T}7IRZ>znE7B(i6rpJxj%~? z_+=B+?0|B2rEhD<=!GO+!YAs|<(KXXV=)xlWaV_adH02`I8Ir9H#2C7-Q_v*;Ikj< zFS_58`tNo=;^avFfI{9Xsr}u7e||P-eU`l=j@vmH+qf~R#EF40$ltq9*{C7Own5;{ zt}oPk=E)b`@Xkzt;t%2##$O9{a|)+b)wN%Bmp^_Chz`$4ilf^l2yxiQ;<(~b5U<98S%-ndE&bid6asyCCD z5M;v_N0WRl7F@&h*-|S*i^|}JC|SgBA~eUxoe3lg8P{VLFb@Ti_Dk{JAuzd_JfTO~IJ$zE|`(yfy>rEru@ z1Jkf-6vi-qo4tjk3x%#XX!PVagjPf|vn8@8zsP@3!FisF_FHG7LXI!@wfp%l> zS6qcg4ck^kM)xZx4z1m6tY}rxWN%C6%gg@~yJsPEpglM^?!%a2pJTB>sfld@zES=Y z+e4;|(+tj8@vp9fCqnDBj8Z=Akm~nQBNEB@rp9!I%f95uK%8ap{EwvT(4cq^^5C&{ z?C^Ow?c4Ep&S?I}{rmQ{8*h*1$xazWi@cc9lzU&KBm8`Wy_se243t9Yoc;ycf{n8s z-}Uvg?X)ycsCnaH;bwC02eLN43v$pcoHs;xwA3>G$yR8l=N;^?K6Mhk%lQ2|goqu< zhL(7gm%cRrK`#~h=5~s(@Y8{zk(rSrtr@L@vjzX>dNU&<+#}ul{TnCUA|H#2Hueg# zi^Tq%>bJf1zFOJ&WAOYmEW5&??yo`cy9r;0b9aeYgT`Jo6GKHZhJf?9i|o~1l#N76 zG)YOxrv@%@3#MD+O{|v-))VGa1$n>cFO}xH?J{E$U;AQ_9Y=mVe&u@FhWC19B;ft_ zw9@m5)t7p&wr175SR~P?Fa-Z@(f=8EymHB^FsDF^2eM^xx4k$nIyyS+gMWC@b~Lb+ zeA%(n#-C~{YCPp$C+x^|^3DI{WKMG>>xOgVbqTSSS&ib)V^LEwR~1}r5^_Tx%@!Yv znP#+{V$}YamNHsiAa7EvTuyKXp?`f%KzpZLw1$ghRqWQJt-DM)PF^6B=x{(h5u3@J zM%B9;Jahuqa_ZMH!_Wn87Pv;jov^nEkm{Xqneb(*Pb~fW%dv=jmHNf_l+ZmnWd~i;f zdu#tHrYD`Oxw^*lsgeDeeVqpnlQw!*_V4`xY7N~Usod52)n>VYU){G52;=AN4!d}> zrXFWqr~Ffb{E|fSJx*;8y7aRii^=te`@ASQIV`5G3|Jr%<~xuU{ZpGbVQ*eGq8>ZLKG%9QGRH?vy3 zSnG=EE=zWJPiUWZ_oKs;`R-*)QV3j7iYW)7@ z`LPd2#<<$N6vH+~Dn}N{&6oYWtE0|P{$d>_Utn(g)t5B9IL)m+*R**wBY~;pv=8B* zliEH@kg_V(MQMYHKp-@+-VpjxSB9?kdhm3~gi^@2ohs};C8d6nQ4$%h(M;Cl)}roS!Yw)@DJ*C7X)|hur4LaT{*CB?jO+})Lq%&NRrIXc z41;Rb?=D|2GlXFoo#c%l%^16551`E?Jy$8sJ#EL+!ky#3gO>F>qYgtaSvok;y0VaiLMWHW_{!0(bXnoD+H_5ylE-JAV74t@-dD3?oYf1t0jDw?$kJ{woGcdq7Z{Y(pYvU#E+?weQpPip)K|LcO0 zxQNQnAd2Skn7e^|0S z7wIZM-Fj+vj4ScAY4hs%X+-3>XlFUglcIyUtBbj|lRk&mc|DS9*KLQ=3l8=8OU;qo zFApiKPc~)SRxgxOaCT+I)>C~&w`VPB1J2jSj09Xa+IAa!lfCG(M%JpQ2!fPqUT_^0 zrAxIn~3+a+Spx>sd|8N75VK}bv=<6QA*W107aZ{T1w$cY{hmn@3D!D#;&F3R^Ne(S) zZgf<%MP@!k7lo-WE#tn2#|v{S6e|9x{6UCDMcS=pQ$`?NFlxw--pN7Q&7^RD=W*@` zUBF)vqo^E+MT|p=V;l|_WgCvh`O*1i3EdM>*x|eoDRy}>;A=<~s=DL#cY&klmt>(K*Vw=G1Q>C{WtyJ9NFAZ)5`*EI>)jte*G18>$R3wBbA0fzZaTyhN>P#sx!`jzPMs4-eOUM7 z6>Z_qC$vS?$Jz<$+7faG+sB$AZ@tY=>ygdr6(U_9OupB%XRw#}DpUEAW>RNTpFr6o zZkIpn8HQf4%3D)en0%1AurA$MtwJGS8iOuA145dn0YSJY5Vjfz|%An1^ zHSDfQn6=B*{AKwPq>z3?ygSvU1f?Lp3@M+*Dl93y6N&0OT&!6oX zEwd|q9jZ<_&Oaj|rIAwzqIxG0Tku_uWUiANiHer?q&Ve)m;%0Z1@#1{_alvh7DK`o zL-tVWhnqE04zY1Ue!bCs7V=A_73T8-5hfq*_&hF@jn28Vaq!UYe{%uIv!HU^8FK$# z^OK^I-jI0n2E#e4k|)W177wDU8AFTaIi+ic0G7a7Rn$+S65=TbK?lJstrxq*PK=-<&Nr^*;H|7PeRg zADT*h4OvvZO_f~Tv{6U#Z%l-ZZEnwM5^Zf~(ZOVY=B%x9q z(*=F!8m!DZ$yeU?A@^dgj{Lv2ZI89>_{|g3*wO`%a_P4{_G~vO+Ezs%a+#!bD$}`P z=;B-XRQesF7s+$R%~27JFH}S%(M}8(ht8TE66BU6`~Fxh3!{rws{eQ~_;=j4uWseb zj>A1ZSL<3I?tLazi|Y8qTZpgsHGIy>ooOYIo_$-B&7tw(s#=u&7*~a@D2w!sg=(>S zH#s<$Mjo%kM+H1+hATL%%n%3Pu(hp+9XA7TBL1oiF81~doy24LjF<=6-gVl4^;`D7 z^h{ffWx!9VY0KdOiZEX>y6#&e?A?oMC2k0WACAP^#EJv1CKPE~Q@fV$_GFwaC%Ex{ zVX%2LDvK|zA(MSEybsIh;SO2uCB2L9`aVT&=M##@gyv?AKj-4T~f z&)yTc2UYWI+vxjO_LVKkGlpH~aBq(u0x(Hq>x=ibI;{+>8A)hzPT+mC5bcva+h5ueXH|iW+aD>F&R_QYfZj(h2FYd0T4Ha6Od-A~Snd zhfST1TN~=IbBsKwPO4PD&!xrRZKxCIa6wBZ>iE3$Rm{WTMD`Es6`6Mml@c27q9IVW@gZk{jwJVvZQ@zsKgfTket z1eI}z2Q*?PiBuOi94TP>44g=Wx2%Gg`-5gI~`VxU*-^aY#B6qHuIDInlOV)?j zGfT)Fq)hFJ!C)LjhA0*%zv1_0bDhrlbEdP)m*0wne;|+bYMD3GkGH+>DGae4V0BMl zh`AG`Tzv2_BC??&0x!Mq$grDX|6RrZ41@#4W=De)E0ROJbtu+MYh5|@iel55t(W*0 z+wAV~4f{3*K3{UkQT(CtiRF3*VI{r$&x{m5Mnk)PI|#%$6H36p4~PwXq>fzks!44Y zLJU+odFlW#bW+rrx(ta*K@yo+6p>QYiAo>W8&LdEsY0`|nnf$~Y30plDe$FnrK517 z6>=*l?Fja6A(qtf=@ONOuh84RRW3 z=;olE3=8(TqvPMMdq!SMaZf+y<=v)gyF4gM_q{xsoSgi5CnhEa_InCId4~B^gXo;O z%fq_s#(vfjH;hXZ=wpCV0{7crf-POYei;i=U<7xhy3ZqP z&W!lPq@?e<7f$}93BI(ju_KxEYgHCjlp#{Tq0mW#ji0m7Lm?p> zu0%G7qIZdAF@75y99&&pZEt_H){TO2d95y!Fg`RC)n`%i#1_gCijdEhn@F+{(gX~a zISZxMPH(ZYvbr`IWDl8D>7-pH_|X;AJ!#dB$TSs)KdIf z2KG5kZ;h`x8yFb8q15D#M5qxKjVYiFS@E#+4wqS8HkFi=yrHb0*>3SX3hJEih#WCR z?ta1hjZO2dVVQ%qbHqwLR*$E97?jX!7RO%EZpC@J`yA4V**p< zPVR$J6eT6f*+ZmaJ}EerkPLEp=~MEAB&tuE7wot+o3k$-Bc(Q<%X;%$%FRK>I4J_~p`(X>M(9wOwb zxf%iQPfku|XAOTY{hOf1;gXN)d5Xpw9p*$^3{`j2`bI2Yqxxs&Fc(|KB7oKcu2$3HxNsXvrI7Qmy;Eh8y|c|Eu8=nL7vKOW!9V($>~S3+{xn-SJ^-(7OPlMB7(<^jKg0aXXDiFq; zS&S;Gs_-yZrYuxdRY@>{&N(OFd@|-s&P8rgR#k=a{us5lm*BZ|c6O5R*{MCOU2t!$ zsi`4mQivX%oBQM1#5u?Ve)R?Bh#60uf^@dJgd8J2p7e{GdUAOqanI`#leOQhxNB{t z!?rmqo`!_Cs3c*u@~}WESrQsr8AInCUzwP^R#9dO{r!z?$VE{-7J8rAI+rkh>*zot ztKw%M4qslr(%060L}I5+7;oNZ@$!ZOeFFox{KX~SJ}KfQ4u?e>@IF=8?FoOv3NGL?-+H1TCJ~R+)YJyIv(r~SpOjRsTQXyhjp`5A&~QSI7xH;^)ymS6p_ff}9=40$ z59{*q@Svxs$CvK$t|bl4;=rKk-Tm?7!=#;S(@X%4uD2$Sw0!jP%F2vAf4KTRLPDaT zis`LY)nP^!LPb^8$WO*^WwQ5+<03GUlaouH6fuTYPuajWeoWj_scd!Kn8ZGdXBALU zPtQ(SS{;TV!wRNEgNN?XBKnjr?YeTYrq6UgfWq*f%M`;w0?pTR5;M~TNn#4^v3hJo z1XfH>EJcVl4{_dzH3yOA^Y3Ol7DPeuWT`57V>V0fv!)e;uHNQJA3g{`WnzM-`nX|T z^b8EQsdy+wyia+k%qB_=oO$J=D<_L(vZH93@b6$^VL6emxHi$rdq8gAZ7QhW#RnN>sQNaJ}J=10EGt@NFvFw#!hy^rqz`+tuE><|S6h zJH1?F5NjweS989ot*vd^ZrlhnI{&@1&@FaQpqdJq6d??084fc}y{zyna0LOO|APP19deuLj=1C>4Go6SX2$gTM&kIZ5%|r zdskgs+uz?0ZML`=FnAJ``uh4vyC>~x3SST43#Sb8|n{f6)bH z>-tj!vl$h9ecMLXem1*vcfSC03GeUGzK6G^Wu9RfdzE2bOUsOX-AbBxu{mkC_fgYa zU(0uks-0IN_ZA4QyK`z3jJ6!j_Hrl*rOrYU)bqNT__JchP_fgY$ig)1>)XhGBXbAs zrg*t-$M33vtDyxJkBC8&!p3fFVztlU>7uH zC~;s2$Zz!%8A!N#uDfEU1A{y%isN&9D@7fE1Kwj!3!jb@YsE005^A6l*XWkmUJYHF zv10FV&FBSzQmBz~exMc3ZQZL8%`YTv4PB*97GuQDCI_tEC8*@ho%Fk@C@Z_Ty85gL z&j~`$2Lt7@i8*+SWi5wO(54~wtQgWN4{{neD|>70XHEwtu>&PC^(ToD`F4DYXiQ{! zA2pbQOsu2|8ADlm!^fET3B%k)$Rif4Mxnfu30I;Mt}zQCtWV|@!h2Z3d3kx@qwM3c zuBQZnZH{007yG8ITG$YUDp{vAK>3aswL(=z_#$#ziR@`;suP+r( zLOb4E=SeiJmZh|`x_$GGjP74B9B(K`o!k)PT#?<6J*pX|OjB@%Cnv3|CSiflM9DqF zTmmo7XZPd1EkC4=9-g}aopW<@6O8*_9gds?63>5vU+j#1-ZKWUno9Hwjsj>@QF64Y zD)+E3ViaW`m6&mbnzjm4?Pe@UE5UpYaf{ zonlVVBt$I5cor05nd{W19A@?E-i4nrmdE7g^dC6=tlsJqnNU_E>y4GScU{#iv@2r%9;|h_=Dk%wnQliHaufJj_ zt&a2>QR3-9`TEhX(Spa7EV9`{F!9b!boXH4C@U!~va91S!C%0S@%CIZmXs9$jj?!W zD67sip;=1G%5kgbg52CO=wv2cT#4@nRy%BcBLP))C5QgQDFZw7$D=&9E+|-eeR#0{CsI(JGO-oMJD=xIeRLFy6IYJ)E z5G5B|{6_Al&|vrGdlH2R>DtC6Rgj)m$UfD>erqGBmP3ctIt zwY9annz3N=C|eER+{Z_h2m`7WnsGHOo(@@!uI%xuS=LHXSCp6IV4$L>+v4+bb4!+O zr8o;g8=|bC)o)zyuN{px2hn#kF6SP|>w!fH_0Yk+$jZu=p4l_v!-ZC8zdNjf#a~u7 zu;r>4t!cr7en8i|3ntA9d2^VMkPy1R5r)gae#D8nIn{e$phV9$tHKVd!KL~UNX87s zK>>klT)@Z48AZaOhJ(^HlV;oUabn}ZqeUezIV}zDE#N%_QcOBRWIl0xhw;#;vKZq> zsE3xECbtezlk&mPj_`dqS6Qul){Uhl4e)=u(Pbl)9n_VP>1kmhA>uoMR?~7*<|;S= zkg*z)b^Hn2ha*u*mnD9D9JCoeA)%?CKQ~>Qz{N56wE6n@kQ)`%M4AxQO&h38$d)|W zaB4siHzuNYYnim;laD60U6zNd4;tj4o8ZlFXh_7Nme zt%0Q%x)jyDSx2Ldkq0EUL5#?PHYJ{bc=Q0wEHcNE|u z#%z6JOVP=3Pv22o&=%?#2z8oWHpi;uRY^HKhY6$239E)RV&NOpM}T14+xG7ms}5n& zs46KjhJt?VjM6zbm>#{<-@-NaH_ao(qM}&rl+E!0MuL31;qywS4sOT6Ld=ZER@v zL2*sZ*p@3d#xt(O-6n7QpY>4-^}}}+1yWVAhqOI5q5pZ_2*G&&(o3P#XxfVj-;0U) z&S3O8nEM7xbjrwovamtX+d1)qEdD6-#L^hydtjUz8r`(3XyuuO?x8(jg12j7VPSRe ziPk{76^{@%cjt?g=`FZW6O&I{uFwnaOj5k;0Y18-Dj%Ou%Qo%AkJe*Zn)T49J??hUs zeL&O6;qC2x1pT{|`DaEaCK4#z4-XDXxD4|7{6BFB3ww@fJtgo?FrVDs-acyi;~nrG z+JLSe?<^D&Y}YSfNqkMem`vY-s{5)}`>I!SS7*L=@7~4eTnzd<)8gsITZIi&A%c>! z_?;5{UI#imK5L$!Tp7(>NC(WnoVel+7crchB z$J_Cdgv-3#>+Le-Y@1U>lc$e){pb;|K_#s`SeO1Xz_)ip0tQxq7G*g7$D78{Py)<3 zi7+6s_ItP+#hpO-4FYK(Xj>Z_&nCqL-if9=*xA{^W-#C%t-!7Tf83@5k_^+LR~dM{ zF~^4ukO$>y@d`AVV|u>#^%0~N2;$#~BfmtUG~ysqqK^q{>AhBQwfaOUu!1>jfq@_% zW!skfao~kOC;3J8D04v~jA5ZhIoe9FP93V|T#12!f#-fUaZ}S!AbL(^Y)^1g0<)tr6w-}Y< z%_F<-qM;D#eOhvQLCP;CmaZ4wV+J5Y(JM!($4rC3a`~?GPPl{Dv+d;M9y3i<|$laiC6dwJY?SO+I4+UD%|is*}PAq4&m^%yA8-%ah)ItV!J7yh$< z;zb@Q8*d)5uqvUI44`7zkvD*h47wn1el;@XOZN2eSe3E?>oIq+?S?J}E$*O7{f~N@ zyX7o!fx8a-JoV;878Mfbrrh4h__-r%PF;Z#p;>a#IgMG+d@Uq0wxFiQWpBAJtOe*c zh5I6IxQwJxqkbuD$|?NlUaidnbyp>!EAs})-#D*4OnjUSG&mOfiTk6D&U zG*rcPZ&l9{m-q^96!=?VPzmsT$QRKfV3!|;*EocA|N2`Z{=doE3;&9w7a7{tr`eHq z6C5Jz7dtR#iNjz0_EbAH&EW$akIX@jh_mBs`r$lV$r9XYA|#&0(hFU{lKVbt6iiv* zFw4X*Nl}a24oGCG@g-}OyjRJCJ2uz_69OiR3&IP^>ak{A@_CoZsi{!-*Y0vK41j5> z3KXl6qvZmQ7}pFAji?e=_Fq z^_GtYZw5|yt@jb7nt&QZtg3pfCNn`~Hx$NPXDyouyY(PkLOmAh7xwhX3lTY-FsNKF zH~+hs0IZPVir_rB6!6UN=ML_N0T*Xg$A|I2$BB?fs^o2~uV+0A|IoJ#6NHbSADE@d z+w-7*q^J-3fDB6(M1m|vAec5aLZlJr2M|+b3{_TE-Z!U?dh~qWCO{%HDk=)*P0O0H z!#5-H$nKSu6&QRyj#E1x438Xb$9y@h{Jf(!e%G!T5eDi#TiQIN_Ws;;TIA1)&w4UFIZ4G2+A*=pktrpsA`Qtd&yJW)gucN9t`k6cNf zJ71Q>ewd>>XUwsP-Jv5O&cPBkX=e|b7Rr1k_?PMF*?2vB9%7(Sc6@qdd#FnzRy=?x zZjiavm6b)R5b0r+JZUOEfQvEi0wI;8`$a=2Wsr%c@)Vf4hg>&n9{=!s|BWKx?#)T9 z-|lHXy@3BT9crqpM`>isB^q?JMwNwevy04FN6%fm= zFO<6dJB)q%&mZ<3;aE9Z;OKX;f{WsnVE`9d^;oE-2=-4MKR77p+{btA01zoZ4^Opr zup`3n0QH864)h?MvoEgmc*fq%9wkshw`AO+YAJ{umXqJuGop_`?B^ZP z-VFZysW0GL5DFp=arg<%>l=t-%X*UdK=Vn^6S`(y1V}+u1IYl05gi|(!jN#dmG*Co z%Rw$pGm52~*NqjP#=S&A405PRqWu+Wn-k;Xi=SI{v$wbR@kzTB(heD&8j zmFwRlQZreR$IQ%Pw0${T$eYZ`_?ZKvxAJ5~5np-=Ra+fjKH4fc23*m6^|k8Wev(OL zi-!EV9dZYqW7%oiB#6;&KqEoH^tRTAQlT#!@PIf+4lRN#kQ_WJ09Xbikf#=(*EjZ@I9CS z&uzZaX9E+r<6AMb;Ylhjg(NBFxNkOd=jjg@-|vE-ru%m&Ep#Farf z|GtiRQijAEfGv9bYsPJ^WMqw2{&dq)Y-8`_T0!V{YpvSv9m~6>aBvh=6cTq>@pue8 zJi1N<-CsgyZ~o=fAbQfH3PP!;NZK&_gDCg^&ed+vx*0$pvj&Yrezth>dkcz)G`sIv zNPGnz)DI04PL~Q_VyUsh3kKlj(i?lsgvM^93?aQ835MkbQPs@82q;;E&y^(E#55foaUqZnuEC_fg z7I4O!W1>o$=lL_slBx3aR+4s)ZAd)`t;7nubs#iEa4z%opjeA9-J`{@XzYoZZLd~~ zlkx2uCUX3)7y7x|&$1W`<284W0Im-U9>H>kN3@o(PXmq`1Y?$73$DarlBf7|QF3rM zS$`CwKffTI`5K+9%LWyJ<(btZr~(F?47n0>?tL@8oAC6R#LFc8uA@fMHdqK z@T1HB{@MTL0@&4tu{FM3IXMsT5}o_}Ie>XBEiDbGmxpJ8VW~hw3~d4Nv>Oy%49?!a znF7-HADfyfs6ok%@p!B15%Mn&gXtXlx(JCe;UUGWHsYGdyQ_N}jhkHF{Tc~56DB); zCLan3u@y2RUopoyYf&U={w@6FZWx_&et*J7rf3XS)RdS(q4G{f{+)Pa^tR+U4757? z86iGCS17RxoUWIxNvUWo{*}C#)9N7AsVZdGWPSYj5#|VJn0*$HTL{9szI^%8*wnP9 zIJS6qba9ckx6(O!X9%qv-PFPa7+J}(Q-eiKyf(WJ@}lm9BK7pZ6rR$P0cP>9eZ(VhK^rB>&b~CPA04WK` zH^uXHb{++a(w1lp$JzPRI?T1g@{II7UjShjZYbA?&20hXP-71K5~|TP=j&H?{)agH zqcefgZ2*HQ7!N{+fBv+q(FKU#pdY9+w&r|LsC7*l5C}%i*Tfx>KKt4G6cG!T+kYYDd^m$-<-TUuJA=U_#k+R?pP2F00x!N7;aylz_g3YZM5SAuKiwP^*eMZ>}Q@ZYC) zp+G;JUq{hBIgFvb&!Y{0^cCQ)pl0|p#A%DG<7*A1H@;(V2JgjXZs-tAo2$Vz)mhH= z@E9ESujT;wrVCIxh&V#@Lo~hYTovTi%gakC>L|VF{~TtBRN?z>8+H8Lw(CQTFpRY} zqI&_tSYM^tqiGM0jt2Vr#+V~lsHD|VZ{6xm=^p+kqNhNF6Jj35#u>O2LU5t&#G1j@ zZxQ44X)6#h0o}QB`4zA=l{{|WuhgK3)=eu$I#rJkM!nZ4&LPA2X(jvPTfIbwB4NuZE8?sa7G&BhMUKn!-h=~D6 zCdKOB+_clvn-0At5U86aKI9~pJ7l%086YS!P-gcg=9F0oPeU}OCx_VBx+k(d`dix~ zpsZ~s zHKoO4vUEy<-|a5gyM|6c)6XsfA0C1bCqT+(iOv`(AxK;tGzbH;#N$1HwgQ8}s{|=m zsjjG?tU|a8{|>GMa8i(V{687Ld|5TI0m^sa7Bb*Gfr#vpNl;GHR&G;O%NyoWYY7az z%@Pn2f@lGs!|dkHE9xk;7N7hCBcI86$6{kFRqZNpY#%;Y+1r2Q9)Hy`tHwAwJ1fe^ z_vF+c08haC^Io9n{Ujm-b5H?JWWWf3d6Vmwkn84;GT)1ha{~MN`5*|qfy4ICJ&U0b zaQxNh;Ip?Pdeor54?(S=##?uIwI6BU1BM4Y7wi~Uq8u&U+UeODP-y>8850|0Ry-C} zf;eb6*V4j;&lT8d5Wq^fW6j-7O{odPfYPivHv+(Rad!T(b?EWuZn1PVQi|v<;9z(h zS2FZY1uM;KCFZVRjOz3Zj6)agcu@Z>~!8LH+J!W_)nYp<)Q++$~=Xr)8-=!4}n_8lPfXv~Z~d)uy`sFu_Y;tBGN zd9HF6#kTYY4dIi{-4s9`=W;$(rC`^YSFY7_m_PcMeEHW%0}jnQND}`({FkzF{qdiL z`S*X<$h=+xT41X1MvaV(zflnJL4J;by1KeBo0Kfm^U~ax69FKfyTIZElkwBut?%W3!4hl8IUNMb#6)v8@KxBa!#6+$oHVl?6yJ z259-J|0At@pl4E#*{V^z!Kn;YuM>4tzQXeLAQ?7r!QVDFHwOpROyq@*w!eP;dVbyv z$mP!;v8$}NdmsnF_BAD6U$O8vXjBldH8ySs)HB|E{5$OI>yo$)0Z!A>D~2vGuxeme@l(z_qTbXp3T2O9@K3r#C{ zczNR<_aPl*joB#E$8^sBI+>VOe@VLH)WAX*X441FOyGt6v{|_kWCBkP{Ng3_LI362 z1g29_vG@4+IGUtl(hfqBki79A;riCpZmy_i*0Ny$jx=W6*@hM2bTz^JxExQnq!xnY zzPJCG)IeL%Vd{X6F&ps?kB;W(Qlm+{e97%?3)r=X746M0XQ85K!RztziAQy=?*Zh_ z|2ua_!piPH(g3^xFXTFP=4}~-`|a&ZTiyM&?w}xnbKAcHSzlOK5$!gr{|RyyMDNNb zntsT&T@R~9j3i-Y9GZ1}aS8DgsQgm#VeZdB-`0O7^LN0PT*hzER*Eh`U&3g)-$5u9 z!0Ol3Nst6U3rlAC=NRK}X1|j_enzzX2A%D_dE$bA#M_azoGYAbW2g8XO@k4Hz5afn z=(aUe=SzlV6Q&ib2OeXmqUi%xJcL-}!ra`?_#g_nr*L>{mjj~;0(NIm2)1#flqLX3 zcKwWfyt$sP?yju+a~m5-Hv)(6BY3T^pe|K!$2Wv6_918|&)nqYPaorMg zpKmLBLj$@jgiSMseHap5_?U}#vPEqwbeW|5ub=ebBcSS38I7dp~~Zd#Vc|plHR|cnR+|#<43UDa9oEKyv%%jd>kD) zlKaM)BmbR@==G=1HisY_D6@oNfjFjBlfWMMl6e!A=tNDg(G*ik#eZiShd-*t7!EuPSU zN*8Jh^=^#d%P;*=nL?>UP3Ny{jhN$@o7D=Og_Lip>N?SY>)1yqBA5dw-Wiq|*)4$< z8P??(4y!@)Hc|)Ou~#d!-CjXzFy?p#El@!XRLDg|MZIDS3J$)7iV8v9z-Z;p`^3b=vWGa zbDe}j)LgO%pV^&<~WV9C=D=4TdpMGU)ERd_1^_T z=h9cs;(30&Q`dS>68PYs)gub}#EV))6>7RIn93OXhB9Zwy5xys`Xc!Lpn7X$gl5kP zAx=bOUOWeAkHxD3_l>glbC38k{NnWwV! zLMRn0n8ufA*inEbG;7jsdvjC&g++#;Re3_BD0;@LGzWk(SGF~}5bbM9DT#o@noZW= zPIZr)p$qjtTajb4S9xDT<(`eQw$|0t24U9rP)rPrdi~Pz@o@+jiHgob?C`*&sj;#6 zi7j;$5g8c}Vf|g#TL{Nip*f_Ev^4UPCl5li49isWMp$}F>4|e7&w-^EtjYHSo%rXr zwvPjG;GHBYO>G@&S)kg;t3wp{S=Hojrx-%}HB3JYR4C6?*v84@9Sra8%Z^<5LH-&T}1KIZF^It1T?*#6$ z7eYBJD9Z5gppW1YO=y=XSVc1~f)?(pJ+Z4j(+kZTPe56O1eiyZ?~5|}4ID_jGYN?i z;|+VPl*P50%+kWZykC+g*iu3y7?@UXWhG1Z!i$(5DNiQGP*_((!R4Lq%eoj^=Mk!Ns!tv4zP_g&nC_HMQ~gfoLo{t5t!F~$UgC<1v}jCK>BEA6-v z|79pi;RHY|YU(LKVnD--K_tA%eSz7L*RmKOCiJ9tYy+nLVP7kM&d#c=#1C5WIENwy znfwD0QE~w*?*5V%$WP%iY`971h+rVoF)^LEz z6Z;Bn6mc{Zr0d{2AW~LBMMy4~;le~5EFYb%EH8r;rEB`tG_o7kNn$cbI1U~L>O=AY zNF>^&kxw6h487~Xb;Lqp@^#{mz#K^GeDUVi%?WL4(K!(Az1W(&WKHduwd0e`RxcV$ z>azfA33~qC6mokbtXu+VCIiX*F`K5QCTubx{IIT7JaL?BBvFW(sv_InS7z!8*2~!Y zQEa6hxRR2Mnp?pt*1};5vu4?QbCaB0H}14s>G#vF3VT2BdYB7D2!C z!lF_kpK}2!+Bk(7pR+Cg*;fnKN_B#vM}dYsd+p@#WRcu(U~-=s7sYY=E&JA!WfJ>( z6JujPoZTPKB3n+}goK5=zkFeiuC}RySU?uzb?Ipb&*^C_GNJwN+ynT1O48BswANrD zc-8=;=SfKfcH8i-X#_I7sA%?Hm82;Af5p9NAeHU=HLOx0Mdl$xl4MSlWGH1O88cIa zkSS$O$xtLAkqj9#4pYM1 zIM%V&I*i+8T~=&N*829I9B=?F7%beNF6B~(*cwff@?`Bb-Si#CpANUE@gxh^eccUke@8*W*q_PQ5^uiDOgcLRBQ_4JHB6{EYqbu)em)@lRrH;n_ z{E@6Liu7?4`nQuJ%aU{sP1aRZ(h9QDaDfadFZDYV-)R&#gqewnr!?6@vFGRcp6{D_ zpG0*EIIKobmMR@_&zIyWi{icQmT4D)7Cb-S{G}g;f=ic@eB|F6Gug7%Jhv;IEE$h` zi>C5CJz*XLeipVcId<3fyZGNY@aAgSHfPnmS39=WTef~qPL^zKuBpX{&5hinkiyge zT1EY$&)&-c-rPq#XcbEx3Wk^KPrAl!0Y#n1Oeb&LsnwaS&6%YNLPvVWgY@8z9Xl|b z(gC@!Y?#jV*Tuz40n+Q2xx!a|xl}Tf5DQeU|0X{ zH5iE`B>sI68R5Dd_L=!U)RJOi%Y@$Z5$Tmiu&8HnLvZCfM<;7;K4O#35nq(33|ngq zQw(|dFzru1$L_M2@HBnGLy4$t-q_g4Fv@9f(=n2^ckg)q=)ftb1{Rmc(q%WZHf^-u z?C)aTs54owi**@ViCZcQpcyFAaoc0``+P`9Naj@wM)ZR~HT(YzS!oW7o9bkBtM2YuzTY}<@|UC?enMYz9t znwpMGzKoZ0{PM0r>Q6p~6oA=GopD%OX%&w~^RU))gC+RTS>M>=8)wQ?-M`Spn@ey~ z(jwKKJf9hMyW{zg)|;Lne!Z*h8U0_8#m9O6R@8o0$uaJ}vyv%7yzgeG>9)~uHK`RK z??BiF!q7=VZSFQRRKAe%+4hlK5;|kZ=F#}^eGKw8tGM%hN}SYP*4bL^vM1k~|KSO9 z9<@-56)*DMx-Ijbz=KB%MenKJ(-gNgRJ3!GYTl(jikT<+2L?Rxt*K;CQyAx7q8S5Q zL-u$IIf)`wU;x4?LfwMbrZrSgJ$qqkK+K;n5E+w;^Pv7^0+SuRIb15a+#A8~t zOJEC-Jb}hZe3oFSNI3W-QVcG%`%NLm?n=+qXa`wcbJ|RHpX+3}>!=^3W11;8Zyh2- zSS2(1#&}q!>vGt-vdtDvGHZhQUdv}BU-I6=@0I9+X&S=9iKQ_a3&8^Jg+aee>+AMyj^G>QvLM3$OSR$cyLdl~sMx9o*IA5v!h&o*&>|0ByAgvOC&k9Q@@j z&*aA1k~AEPA`P8TE)l4uSc}ReZksFP+R7QB3uBQc#!=3DFD#%L;k}T=*7bceUCAB( zrpY6P-B~0A%DDTnajd2D^n*z?K_yBlCcguULAFiinZNYSFjA@wG(+{#T)C7-w^&4V z!`0))=Vy9e@eR8Sd!d2Bo-NGbYj}HQ>_7vI^JfSu#otZ5qz7>zPW}8@HkI=h8$7jg zbE-1uzduTs>AuDJ_$@>AC)nHp$O>s>OV_amhbq0j0luY#2@Kdm=#Abki08w9UKe|f z>|moLPRPy8wX)E82AYk>jK}aA))N7+@m`7aPUmjIH{3(b6Fu6MY_Py7@T{2UFxHY? zm%y551s2?M%<00`^q4N{(RpfjN|8S2M)gkmviVvWv4+Job@*_s{%>4E5`=m3p%3QuEJR)Btl zZtxD{H>$|m3GwpQsKE1&-y0hn*Ny0i6PV-;Zf+Rf_$a#YM>oYlzM?KCemyzUaSy*l z+Zryj%`$yw!DX{>oQ_Fcj-M^>CFsDGC!GbE-zoas(d)cscPUbHe+_ZqD@V5 z@yQRu{tDzmH%?3Xi8c=oIXq=aR*Hilxi(xm2F>G}WG2M`nS>f&>l=yaeDFkMRBsdr zP1<`+8Dw;1@bK!SlZXomQ3lIh)%&EDrgTI)Zg|jXoX$Ux_TRL zHh06wHBqp9L8B{IF5=NGeo@`M2~Ev{mFw6R>))T-qa`fu^zA)tRsr^aLM`^`O1_l{ z)6=U2u1DX8OG#~6uMVqJIGxCB8shQj7I^&`01R$EAspaXJUQr0o!xZASLMQm-x4#< z;=Ey2kE{zS*T)1++$U4mHYVgt1c%U-BRgK;ZnF71QhIBprGwnz0ElB5PaZ3cit32l zBkfPsQ+SYkgo_K!!_2-hyf=V{vy{m0n_uzfH0cWCjJv&8i$R74Xj2V-2N6Sul4UH60BIhGP+Oa z>vHCw_Z9_`3$5q6map<1xu%i#?@nS`*KbP>VL6>z+Lx&%!L73TyIJt%A@4H88pO<_ z2fu;WmT|aCq0gd#mJ6H8tB&?kCsL891(cyL#Ir?tedul{WjZJB35QRMcV^!dkI_)_ zNcZT{n)cOA>zFC0+oBoHg*NH=HYAfP?7jqM24ON3SWvsAm#bl5Him75K14_SW+6KX zA@<;`{=G5dEe$2h_v7*Do#$E!&w@2u)mXC20!b|z2pIe`Yrpl!o-SxCeseN@;w|2a zVsj#7GmYcucg^d6FpUcd05)r?;MTbJCfbzaCYxg>TF>;#QP)UstyONV+2od^-3kWV z!^=_V#1Rr9S~Z1~Sti~i_FW3-bAfN0c3}a6hdG#78+$FHi?ga3zxo7HUXAv2Ev2GQ z1uasU;)}FyoT*9#YLWy_njpc7sLGHov5_&`0>aK}`!zXv%6-9VQ{d91Rb~!bUu%j| z@jluv*0y*J?e?xWespmY{TLknr{BKCL?gxCd9-blz*@8tQQCCao$0u~XK4aAV+#}3 z)aOj7~&u1mBaR+$Rvesv~2=w2T8^^Go{&RQ}m zAnriFYVW;bv7at-1BD9i7!!k&u>c=mr}tt`~*lt6ylk_kccX|`RbYIy3Ju^9n+7e_o@OC~)C$=ja? z1QLMl-kf}yAR{x;D#sYG$5vJc1fU|BUMhWbBzk(F5S;pGqda z=I*&mNg9fl!irTyy_EiEZ-LrBB%XXG2w;f=nvqXPzkiNyD+2i}Hp?!0$aR^2-0 z9AvhN8vGEnf|o|%8liI=TtJ*>ag>1i%tyZa>Ztd0QrgcXB~kbpd4&#P74mi{Yy({h zwaC0X$`f!NV`4tgGD6kx_bit1!rqr;Rr?tD0IdvID{=ag!!lP*jo!k;$;k;-45(1h z)joCEW{SToZ`sd$s*Nt~uA7@7c~41lT$q%USa`oo)b6W~6${gD-XGFjEbL+J?;G#z zm+~s>?)dDHRoACsAbV7d-6z|}M<#Fk)3XMd?561&XDIoU7-)`uA^Kb?-CevE$<^Bt z_tn_o^UQdzb$o-%5f960QN%hp#)*puZn{FY%X=vYsokUC-~_fcpPhSBFT}2{Z7HDe zwXxydp#RG+5+Y?h?zPQ(dqC~n!h#626yDBGP6%uep-qH9P-ARtjKFNuiamRR7N>eB_U+r;JP?R>RB-U#r&EM31yPi3T=F)EMZsEJwa1H5 z>ih^n%e$#5kcsWWGhx}Ktt)0WHa5$VTJ~M<-{1eSww(yfVU(S68=)9hZ5A{BtG}`H7QKskq=jRF?$cdGJ9-nY&1lf zl0ZDVdiC(3gv^W#kg^#`H&BA^BPSmT@xY!!MfQd8B3!4Q9^;_|LQ3K9ze`Sr?Ud6u zSY9rFm2#bB=jBz-?D|6Ch3e_cmn-Xzq&{Nao9jqd8A!bV!ox#Wm`a?NcM2)Q@>kIB ze0;VOUWDmYiMbx8Djk(5sl>$A$G6@?N(HbW-?}SfYdwCofQgy8%X$%nJ2*Wdr~;|Cz*)a2w53L^sp-cSV@==1|{ zOJ3j?y_3)rxpnIgfbf7*cxH=>i%|V5sH)bnt%6K)>((ulx%f7xoX)dTg6#CcQC?0C zJd+hb=ZuVum-h{}w>zOH0B7?ngm0s%*|EIr>g+7C*_x7)f=jSW_P|iw3lU0nU+07x zrhomC@?6eSN~s}S84z8g%G}7DAqMEo&Q_AnC$0 z?6Y%oqfRBu=bFcy2r7z)r?1t0_@I(-5q_ek_^!UFZE+kH7vtSJIy5<{^z`+=Q1C}6 z?c83C3iMcm=&@t!JP|oLIZXf2)LqchOc8>N6iqgi38>iv6eA)(g6 zK^E_&JMc(YTLVpka3_6(f`WAUERsFgX~>@aU?nCdMjuS&nUBZS=JxjX;oM1!nO6|$GzUM?nU~9 zjSA)Q7jo6GZxa(~>FGxm!*Iq`R8)waLvQ3|N(#t5>-}R;Z6n4sH#IGLO1+-IrxTyW zeDGpvuv34JH7ka7S{Fe`9xf%K7=|66nUnL~sU#{WD{r>n!qRG&v~cyno~fa74``bl zU0fQ5osaiM33a&_%v#ocYUNZkE_F^XEEM79CQ&<2wx{yC#ku3{&S2Kv+f4z?yhDr2 zT9}*!(7D)w3-0cv>FJXZyqAy=Sy*s=y2PRw2I3oGL`HjxGB74Tevv>(7No?)q8>kf z{QNmHHTAu0Rx?%AkN71jYU-t*pAS)z2zi=Aa|e2;z5Q?>;inXgLqD0h#v}2>yDPXJ^lEj`7Re zMgck?lI9wgBwpmkTwGC`Za&zP%xlYsnR|P05i0%OUfr04HbX6K?Jj5z(FlI^>Xq1m zPs_`1LP99A9gjj^1qs*w{riE4 zzG#-HlS#oQbzuK~$GI=E9}<8j-<%z(_Vpz$(r001#TS#aIX~D66(U!7{>({4!e!VVl&{dc_Oh$qNeNiWw$Rl=?ER^+1c9ZTGiFnC|>d4$LCz} za3ckbe*gZRDC&Os^61?iyLotcEL!4>baedr7kYbptEz~igT6osBIVtkrH4F+5Xu!4 zUaV=+JvqS4z_8qP$pm!Hk~eP_78hg195L7LVYggfVWG2?Ra$bg`O5DxoG2Wj@B8{z zzcq$$+qR8i->&m**qi87(F+en(BfS}nk>6v?dT8XE(w|9)=0~5BHrlzLk)RIP9eH8iN0?L-O^ z7_XJ$*YRn%a}OVS;#ohSK4LdqK>#tD&0nFzZErs#PdoO2jgpFZbaE1w5TLL;eewh@ zZ0K_Or%F#&oC^*PhK>M*z5baqRoJA6G^lI+TdmY_K)K+_$%nAY-cZ*}Re_|Ok%guF z#`q(|8P$ZF;bzzt7+g(QWKB&f66!h6Z#6YF0Ht>l6Q4hS{>AwTki?L7nUP$NiVT{TJHGr7 zq+duCg&!fQ&#OD^%xa%-abj$&2vqyhVJ7a+Fjb+QE=Hm`>!QR?hgPR5`M5Hc7 zX!)U@uC4+n)ekuU7NbU|E*mq(5uTteaR0u-Ygo9*AK{d9iJJydB>dH}gNm=p$_B8# z-@QvtNT`N)4Ocjnx5+6fAD^ET1hb^O)#~SU3kw}xU2qXLAdBGFd&LRXRKwR$&IgxC z^>azE-p*hXx7{J*UF#pEQ5#q_m=qK?rymy186qCBHIDlP19#j5Fsu25e^q7 z`ePq9>gOLO(8S^J15s~%-E&ZuxpX+f-|Z?xv|S;ICz5VtjTnSy*_ELU7b~PwV0|TA zY-OSkZn_XB@nA*nhS&ipGGD#Gc7eWR%;{7}!)dQoL@REurN~xBj{rp4UAy#kbqVC3 z^z?M_bqMpVj+yQ9N;vASYIX4dJ$SA>Lho^=g$nOUk&E7#wccBry^TZQB<5;TueE^>FVy@?iHDC ze_BLj0d!O`WJvFh`$yY>uz$Mx03{_Q6_w9rx)9gpuPpTR@=F6Jlw9nuUoUt3DrarY z(`QdjM<=(GW1m4<^y(E4KY!i&!^xCc!X%@Dg7DI|g`%Of?SJs#;@y87EsP~M=uo9K zD#RCUG{=fUH|6f#yBwkSD_-CTLKHij^eQhe4@cYw#m%o@zh23A#r`>N`3ZCHP(mQh z#LIDx6xQ<#3PviW;5g(KiLS7{b`9@`T57?M%h|e5Ii(#n)D;g^O*2zDJCS?Lic!|3 zSZP=nZRge8+)gQmAz8cuE1K|dY8L4qM?B7?y;Z41iGgT?^Lte(Kz-^2N2nDN1j1+Y zL_qz8GYm{TR5*w~47aYfCZ?%yojZP6Bx0a7*7t^^<5|+uPW=+R!5Q|EIag=j)Trmr zaUoe*d@y~{;z39x^~ozL+Dl5BFsV6pyPqSJTU=aUP&|9*1qMZ53!%ddw3ae&z1|TB z>Gku*@@X3$@{bPeCn3gK?+w!el&ZpY+F^vKw9-}l5vL*unh;z_o;Y!WgX0U@VMvr+ zrGyW)FmySCRMp+tIdMSAR|LFebzQBG5TVW{`AO* z!&EoFtu*hIM4C7}Ce5wLN8RY04U+X@WQx&iTgEuJo7=V35t5KawEfT}6|yxgaT*J} z$o-^w4BdmLjpo>Ny-d`dnqWH9kPzdMDXXZ&oOZD@G(0fa5O^_`L*!^B=$XI(zI`)i zV`D3&H@j)mx5uvrxnhg-)`40ZChgp3QeLHJFqb-sRPJP$Q15ZvOVmV%4P-KYI@pE%S&t2PBWP=XUpFW%1%bR+%G&GQn@4z6M+|=V_iAcPwL43P=PlghJ%*8@KuIZEfn&931Y_mg^xd zn6{~|zJJxeNWa{3{mNwJR1{_o1=H`Yf1q%`>5mhG0N>%ASu`5=K*)_yO|zJ7R{ z^dfOkR8$01v)T-Qkwuh~Bp+=%R3|4UbfJB~s!(xxam2~*arCF*a*twNzMQnQssa_Y z^;?6xRQHUgA70G!JmKNt0fA+-Pgvz3qxVE>0^@Ou7r*rocNxB)es&cwsC2|5Q;z+s z0BUGyX;o5)rL)ASt1zwc``=@S!p{{cO7az_g*3Q+#~n{RTVQlwW&;bOCvJ_Ws5I^F!Ec9pzmOLfJbk z$wF{HWfI;uH+N*;QC*Uwk{M@Q16^oywWkvM^$M>g6CK?xbcwcBbGN|PKFVIa%2@_ni9hlkAS8d#Q?=kbaeay61^n>PxsAmLH47 zg*I_ZW8;IMpxS3t5@KS#uwd-zX;5(F@_De~QK>1QAQ0J6$V_*3hkCi$1Sox&l4xjK zIkB+dEZ6?2?J2XgbmfZ|FAy34hFL5reU21AZxqCoKsX&DR>yNgL zpl($S(E(W*8|qTWul30EaPtk8W;GDPB$x+*FwzMcuY(T6XHwybgsZn*l+nKQCQfQ! zEC*wiyT1;kzv zj1|DE3OfkFXsgC=PpAG0;!Rt9w_;Xe;uVm7@PBU*7-EQfSCmtDxw&1zDcM8=cN~l& zG3o?Fbx6Djt=Q61@efCm9{BX=UcZBuC|@?VLaqvnZ_seyQlN)!ml^3a~y+}e1n_1*RCC11@ZM2M#|8r znfX-i31qMnsCt_0j^&R1pYS#ESfwZwNfA^Jy(8&7qV1Z(3uWGqI9H$m!`O)68-xC) z-0{JQ2DvKil;-B;>l*3KsF9r;y7*-Y=wXTme90BbAN&jDz(5qEa!X1| zte(;vD9vL3AOn9K9UWLA7H-T#qCeZ9S@06UO+vyDMV|ou`L1kOa-F|s1bC?0fteIVRb_dU+FdRpgT=6SpW}vw#g57#L_}G;e7=12s(kt5=DEA4rL}FZ`OA znu2-H&cRKF_?DjRIaX$7W@J~IhJ*FQH|U>;h_zB(7dVqkL4GsASy=-SjYZPE@ao8(ljpyFU6wd;z0Y~H z#t(~%P`7}HrUWGRTMoxL{wpK#W^s8m)qpXe_L|stU2Mk^s@0^QBoYiqKNaG{4T9bbVN*K0J00n9>bD&i-n5cbWf2^j+Y}0OIDyTV9Ih2n?Et z#PL9!$|WMAwM033|2~Pdv~*1W!PfO0C_)Fve7Msrmf+S$LqqcQ9;7Q?MYf-XW2RbgRTFJBB~;37{U5j@lqNS%Npq!{hz#~O-nKjq)WgNm zG2tja)qMduvisnU=ud|^*y6;`Pqm*^44a&s#8U!hVpMF$(pRV)-b8$7QBl#qekSQ!qG!n&4`X6CMqnL1nx33|zBo_?by3_cm0ZrQ z`4(xlrGt|GCz<;D*lYSypSw~8HN9Bc8wX7u%~>FONG*UfP7dV&qx=VR0y>Vg9@bHF z&R5@?xYPsd@o;lP-jAu~SJE!k^NA=pI5{Qy%b_$H9UVP*@Zdu5-J1m_Xb`zd#A)%= z=>-x=nj++#8*OFAYI{(TSVXd7Beg5C8CQH*XfshUEDMF8va%*O4bDulBQ6TDnsn)f zjmYB3+4Nv`1r42u2x_Qib727XS~H>DUpVgD^_2t!G=KsML&Z*5dy~ZkT(CD^pks3RTjFD>|+YIGuye7 zINODU?woSme^%R^KqW>MY+_=v&?kKS_*<75R{u{75##Y#MhHH)Y|)xZqK>-e*Ow0( zU0p}Ve21DeAvnd=`-;1%anrcFxm_QwU@?$>>@JTC^$M?|pNebJF)bb+!j0bzYXMVk z0hP@^3u>s-Gq!jml*kKqy8A8D^Xqqh{`{ceqZf)&tkrw>cEq<_;vv*7&H)x=q6+AP zNJ&Zc{wbgMReYA$40;TdQ~*RFjCIb9n3OWb`T_7pczxw)Yhaq4kt-lYB%s@y1*6&T zLrR4H04En0ig9^9Izj!y`@e>meRdr|G(t58Oi--&+yE$|Xh8ulxRTE>Ee)I$h#=}s z*yg^x=ffLc^0K?o@Bp+h?iKHAl= zPfG|0?5ibpMe3LSCwzID;Y~`)m^Ua+hd4O6TwX~YQV2ss=7gwdim+CG>~>k9xo-Bq zC>S;=oP_xUuP7UG-hM9r?d#V=R1b#Sr?TU3uac&;w=zX@gf}|RuVWuvGZJpM5^E1#)+o{z={ZZHy`}F5Rs>M$vZ0%DL|k0G_dL-+ZU#G+#_| znVv}t(C38{A285&&-@bKs?2=-nq+Xcd3czOKe=^xgq5;_f`f}o&!EBB_wRBxhV_$s zslGX#Qfhf2nr6&ngyHoO8&_;>n5n2_OxA+x69FUxp9coe%PM3oD{|^o$%_|vLOsb* z)nWgv{vVL_uR7h@YEpkqI>oRur!g||g%I&mJi@|G$O!-?;_ff_bzeol@A!0CULGvu z-lAUT=0=@LVz7o@39MV1yt|oq!2jmLFH%vt$Ca#}Y&10IC(P5ne14>iTl(VD3xhJ( zd?2IxGrzGK01uPD@aYL`zhrf>*j-gY;eK}Z^-Gr`i?9#1 z&AEIJPRFcISMvjt;nm549Gxico(i@Nh#FASp||2&GV}gI=Pkn@ZuQ{_N|(Q7Cm3*& z@>9UcvdLVy^kiEo=d~ztKspZ+o&^1R%>o(+>NxVZBB3b4(YpWu1VA4|fbEw~`|Dgu zN=yWp3{d>(UwdW4Qp>r8)w?(s& zQg}gk_b^o>8t;y&?doayR$g8kSYAUOGm_+c*^0vVj_CjpQjM1aNg=xXTqc*fjm`6@ zCXG%l3F%;AsOWv8;5-Se>Z4n9q5%geoeeOIg+xFp!=&rKhwy*<(xegvn72<*g4Z*V>1d8RCZcA#6w-W@et zyHf-K)&M;mEONpzTKaNco$<_}LrKU5N7Pcz^}j>A0lfLi+aD!#^7c}t$&UE=_<)pv z{wV2|;S*!y^GGAI`wuSMdZlh~(N)6O)Rf)J(VH!xcJjxMz(nw8hzOF+|?nflKBbs7j4n!z*wY4Q^@k|=fbOkZ*-=BYTsvGb%8Zr{Qhv!|(TBO!& z$C@GteNjCLx@)$!pdTTr!vW2yhQ|t>9 z!{o}!_|UKt3Y&7hA?MmVkJ+8uBSQ|H;-DmP_wbm@ikPC~4R0QEeN=he+|p9MOR@IW zg`The-DkJ!mqL$L8dQbG7>?ek@kEEzLe)3nsyq=m^hZC;2%Cf9K}q5&F_g4nsV=C* z6A=v)u3y55*Ph-@G$`(_tJ`TXcFrP!M;J+f)EmF1W@LJU(Aeqd&;`^ovavO2-Vcdo z_%Q6oQ2O#Ixtcr3BB02tUbv8YXkg}@=!p}5=H>t)R6iE?-S-}TS*VUWM^nT+xZDF~ zB!Mr3XjLc|lNU$EV=c4vHY~lCpHd)_H@s0O{`KDMrP``H7p1*Ql9Rtxf+1}AG1@Po z;<0i5E8sb$A(b8sF)vR`#aS_NQi>~|L2VsxH39W9U!laSM&ev^o`H26j*!&f#$U1 zm-8|*HBXLeTJ8OKfm4x*tF1M*a$c})srv;(+`@~C+(KEmnd|qGk=5iCZ9ANfjv5vO zfQf;Dfy2sA(Kj49Q@2!|=vF3CrsIy^3MDk+5dV%FZ?_aZ1t2ylTE*m%_j7K2DMb>m$spoo}z> zdmx<^b76#YQ4Es(o}PeFA(LH`u_=r+H1Eco@>vF8Or1{Mh{6zDlrLYu9*3&~GB8Dx zXN=M!3Te5yI4%z`Fv>zAp1PpcQBda-l7&sY(Xv#MgUkq3mjP0ZAfZ; ze1{yPJ9Ega%8zETQVNGvWbN_J7rqm2=jLoZt&r3<>sqGx`PanF5pboTdE5M_u@e9gRwH^j^TbTN63 z-xWXO_KMC?^k)^$aNw+f-c?s^&1<(irV;J(HrC3EDsfIub0>P<9m@%^3@EJ7N=65j`}nr`ZB5IJPdV-f z2dAu+Z;Cx`G)HAxy7SA#Q1FZAMCbU$)K<-&py7^em>Rr>jn$jX%+CR1b$G??mZ6P_ zI(38VJM+g2DtoDVA1GPCw1w&c@wi0L5LYQ0!y99Q-p^2k4k~86J0E`fKj6L`_Dy#l znx`u4RIScijC@R#Kj{2U@|gm${y0)}*+7oSb>i1MD3gX0WrIM-IkLgS=u<*mV^#y{ zou}tIJa?Vx@1K*8au7REPR#J+m#|)lx=g>?h^E>QRWWuG!mzcZY9@{Li_^uY*_Y zAPpIk|6>DIC(IlkSIJC7?aug6555$3=CKb261LPvYHAd5%-6+&U^ywjWTXF|w52hh zV+JE$PHOBj9UGSUR%g--XohNPd_pxxwkc0&m*H@F21`s-jTEn`NXQf0KcS10oy~ui z5>6#38c~NW(B4maB!mQU0|bvnDpPb{n~Y-2TVGih3<8`!-U+T?Mw9dWb&lFx$ZCIGc8MI9g_;-a?x z-O|%TzjfhZLldV|9r1MW3S?4gg*Q+XI(wsrx|SWA?3SMWU5htm17^f%`crx4tDV3k^aW>+5 z@q?rKC`}*~o5U>hcPxuC^73XOs(`x@I)GRx)vq5s%E(a+OU9s_!op+^Itti%Bew(# zG*;Ax?vsA%&+{zz$~;$`tV*}U==PGdsq~_^MZh9{|JHQ^t+vYHH;Qb6-KBTko;%wV z!!Yn0Ysxs!bX&x&UsF@cOF7Pk*YW@i;K`;}R6NKZHu=A~#TZ!vc%o$jD2Y zn$(fab*{*|2X& z7cmms+RkpMvl9^D&X{ZCovGF6=O7`)qC&*ST|&4kIJnK9r^*3m(#tsaz+aklZI>tT zi-Ezx1ov|#C90sh58bTKvru8Ou!zD?m;a@qfcz0R8Ma3{fY{0WI0OaNIH?l0o1%Jg z<$3eNEDPEUA5Kx{s9T&-@bvx1GEXTTG22l?y`SsTQMrn4f z%r1iG7xK)&prE-H-)$$(^ivtTjnN7U<`QPGb8u|u+TxWWT+JIWea=Ieoj|gd8lTuzNNuv;YVS2Y$`6FBg1`c`EE} zY{1$?>B~Y%Ni=+77dG90;XplM>HkT4LNh>tvkz{bas0HXy>ViXx5S&gaUkdnP!_^> zSI4Ns;qVCofk%hyit`f!?WOJHnOFE{31!WMi}=+E?bdCvRDgKsX=n-or=+HG`N{03r*BxenU5nY_zXKYdUbpEriflV zckW(!xui7+0LM+x7XcNiwLB#e7!j&kki5~=$Nfq>$v{hc)y(Xijp5*pE3k(C6ruaN zjlaT3Q*&OI<>-?6vk%y61rI^QEWc70h(@nj6zPtvn(=uIacO()`!6{1>pCeBb4K3y z`pP``Q2GsL3}}SN*KT?o2e1ZIZ4Vvaos7@UX5)I%QIoM$T#?Nvx;W{Au=Ji)h;--w zLlJn(_w?SqbC~O4C;;jS=#@I$gdk8T$4P?AZUeXYFNZjcQ%_5a;MahxwnMTq$>l;; zWF-CTf3AD4eAC7euJJpwmn|8M-rnMeNo}nPgDEYRCrFVo{ZvG(Rvpb~b%DDAHjw(& z{W0=4Cl@XLfH_1>y(6OOm}#wE^ao*ykG7p40#pAhH=v><^8Npw8e3z#4b0Cj|~cp!qoZmt22`uePbTj;Z4xjTk=%!3by{O9P=qlNV{M@G83yAf8+kyzjm zK&zzbNW3Q%`1I}KFSZop!O;R<1ZkBP4_F$!LKP@YHNZ(#E-yS=fBn2Pv< zRJZo|E~43)qx}4YczHUSVC9E?N-$h(ckljMwkxKbkx1yAm)Jt8#i~BhvKlb1^7&7v zfuaUIdW0*z4O;;TNy)=hir^P^MAnl5l*4C64Y!5Yn=?~Vi3>6e9y{1Uzmv!{>@k7t zN>JP2+f{C^PGP6wR^Emr|DX}|9r;ZBUQ*HyjT_bB`^rV3ou{`RT*HZltqpFw*=jq{ zau3(&oyW`5QIta>M0cbK?LTx74N>uc@0?@w7J3)pG2cJMHZRXJVptgTLnlX7dOQ+$NalF=XWAAV8uDZ3MXubb*JE2<;(@ zOFiHg@i69wF!CM z#e1-tAPq!Af&hXc*R0#6c6vv=e308a7m56IpX z6(d`yfXd|*6xUqtxC!eOSbYfoKt;?BE~?!+28>k~qFR84@DXT%;**J9?R%{FqQuM?^-#AQMM4I-2a7f33r9 zO+PFUgh*y+Icb0waN`E}1Mu21#xek@1Hj~QufOxah@z^<4ieod2R|1~`-2PW!6Qk9n+D++Zc;}hK*Hrr&Hcwin)mOk{5Tu2 zU(i3m3GgrWf};yL8MdN|3De*Av%7eehNy}IoS3C0LRKo1(E9na+s5i5!ZWfap})4- zM5n6>m&Q-FXAh{kcs5j2R0OZEPt3r(|8qwZELDk!c2z-DRYiu=06%D4l%b8ko6R#1 zR#-^Buq}aF9ryY>I*jPyUBaE`U07Ivl_w~-3s^v9*k0x3&no`804{>8OQ;cfE0U5d(0srihamd6 zsA%jlGk-0ftE;7d-!y7BRAE(|FWanu)v+LHIdA~+)a3TcRao6)F%n)RL1#*FkjOMF z=>C0f0Re31cv7Dc2Qj1-maBn(--VT)a07)_FfZ&^Ur{rf8+?4WaC%iS`RfQ-^>zDy zQ1mkRRe|s%li+|nD^n*Mb`CRG>u8T7()r0; z22-!2hj8KR2kTW#@F&r16!dyjT6gVHjKyd6WFr;ob30fOQrmJa9!YED`45 z@L|7?F`D}V?rrA6fa@%!MtUJ=Ga&n7@4&{gv6-+3H--LD|4{&ulcPM3v|mZ734Q@p zU*{nA0GbYL4FH9Sr0eVm7;H$uIY_Qxq~TO|Hp2N3)Nr~+M%i7~&nj-=-9}9A@gxzx z**p9uT0kg9xfSx zr-}G)~Qb)#AK0d)G5-G}FIG-b9>hr$<6kz2R literal 51311 zcmdSBbyQv3_9l1|B0vc4?(XgcIJiTCTW|~Ro&dgG+EHxLa`d;82U)_o{xQ zyT%*URo#E|9wT=g_T6Xiwbz zsrH=adN$8yfpBLmZ=$fe+Tw#9orRW*C5ABu$}=oy5n?N;9&y&>-r|eJ(|bE7e5!s~ z*4P1~jhic&jYW?Go)*6T-n)f$?JgcFFaU5!3W^lN{PWRw`i%(e-;Yr_QOJ)2gh0q? z$o>9)fJjNB?LwMICMGz}!b7rpuw%*1w^Ab*!^PWq5{-E#KSHI8Ci*Ihsiliyg5%`# zPOm)My*ennl2nV%-J8l0$(2752W4%YUKtQb=KM15#BSygu0gsGR6~B2Jz`cl z^LRr?-gMO>IbR~!`eN75jC9|>^oMY5Rs4QkUtEhi$4Ey_(m|2^uh*c3H-%LzRxh`j zVg3BGmB;7)YV%@mM&<2W$8G|bo{HPc)ySHvs<*1DjJl27W~?X9PyT+97!@U*q-t)z zKapvv!Z?(-&afLXb?{Hi!%Yj+@%Hk#M61Tc)Kuv9sQvu>e1R$(neU(HL5Z{2{4hg} zJ3}y#1kR#(ug<6R)YR0_MihLmRY#M;Fq zjG`3@dgnym8t|_C&>S#j1>SEDFd zS{6-MyiR$mrcrDA^*XD%nj<9IPm17ymQtZHh_OrEAj~Is!UE0kmhSVNnVYIiEK+^!oM8|SS!i%f+u#0tO+6%~^w=3M7#ti#61>#+_V#}N{{1f_^ttDMzv25N zsEs1~V#%lFTBK-#QLmZbb|i*E=C)K!2_fy-KbK77{vo6MXW?60iAnxBE2%6A`_H); zbX1XlE+qH&L;m}TSc>HT>@r_y**p7^3#ap1v(h!|&5G;#&;4>C?0$AnAaArqA2((c z?4sk`eM3>*jVIADAAY!xUHV%pBBvj^Q*QKSt!%^mtG3($q)-SXNGL`9<>RQ7Y-?s{ z?H0Y76Q)ZC>L@;`rfYvu5Rfp1qdz+7XBy5Bm@{I1EfxoXAe;W(@Z_HyDN%RbM(Fol zdKYPMSCOBCH*bH!i1W|P{eL?FV7$Kn?@i}_xEtC}T8UlV%%X0w2IJx323!~EgM-i% zjBT<~!zfW0-)G~+l94=Gb9J&%B3A+r3Wen?q54_gy3y{P%)0$UUcMIseMTqMYu;r= zy`640&m(#kAMAci*NQ-2hg3=YIa94b(*1qtzLy@tfAr=Fg!rDA1pm)`n$XC|Wk&zx z>gWXF&6MCpw*ZCrp*ye7s+GBFjxZuJ1aIpr=y6ENGf8DeZ(KJU^N90oN zO?mElivocJ(8v|T_)6kn->B&tU`E-#=Ptj3R z)Yv#uhJbOY*DKIoaK<9Pc-)LV27OXxjQ3)E^uB&vcZWQS#juMQkNjT|mN_4jQM=Z5 zrA^W@*%=YV*x0zbriLyA)xXR)h&dnO?^E84h9t82xi@)l;Z2yaeDYzsHdZ9N&8Q1 z4-3bS8&H>571`#VO-K1{R|Ew)WI*s@Bz07uT1mFuj-r`}qJHa_PSSI4vx24Q&{ak7 z*$%OTeX=JGw)a)W@-$+s9XG3m}_i@xn zJMFlHQkT~kuQZc@G0K5c)BPc$;2-0>=zl;d@c&wmH!&jr3C#Tex7fM19AIVjc-Q( zICE=cj~JPnUYPPhUif#fn%meQY3#jH>Rl^_zK4>dG<`iDjN`aUd!E3OBwI?Y6Wf@B z`O5x{B0M+SDIw-LH6Nc=_Rj;Z4lGYH5cdLb#FV}_9Pk3vG=1SL+JLEdknTMzQNu)~ zK}p)ZFSLPs9KQ6BdpKLAxetTHzntmFz`f-4GY#v((*M^8&f8J1ZMW}krlk!RPfT9v z=Gb%N4-4K{y??**<_A2nJE70*v4YUu+q|*!cR}TU@*X5E))`M#m{6l*Vn5s*t`{x2 z&mH}|ZdH~JnfcRGx_Dz2emscuiB=J7TWDVYdedVCy6)Ui+I+oJRN7qcg9pRh^Ead+ z2nlA|obOCvhOT?C@wm|1&+bg@}_kofT~$YRqoh$$Q)l9)ubVX&LJs;0e$x z4`vE2tsb8h@%a8+K6XuD(E6eO^HX!^{slLiH06f&y`fWu(#gi6LyE1!(RMRtZ=zGT zc^konW9bTk$1V+*9QE}~g>9DmUU~Ns%tvlN4*(nVmo1DGO7_B4Kg^MvekMJy%~y%W z_&s7leLU`(b~rnS=$cNs(jX&nF3SvmcQ2aBXz?vsnakO!s{d!Ee~4-{daFWnUf88#IekDI#I{XmZRFZlaBd(aeZx-syL~WF~)n_14w}6PwxzU84BH z#0s|b6KZfVIXe?R$`PO5bRo^Z|G&Zh-nvz5#>Z?DqXt>3s^YGw(%rhg_G#<0jQ&+ z#lQQxe?>3_w*#$(KT7n7GbRseQuTJ-Ul0C>}Y04Z{+!y3^19)W;z)|0Ts4plefA1`cPN(#qtD1=9!%}k-Q7*{=MVo-%jq&h&M16WpLnNzHg-dYu%2I~B zlYQRWebKIwV)EyT3p=&c$l6%C3toAv6DOzA&8R({k%`-vYIE5`)cjXm+>)I)X$?9X zw|=Be%hp1~Zr&E94>hF@))EVXy<^=W`yuR=cEh}SSSSM97B{~vkt#a}1vmMYn*U*h zQC6rVBvs5Sj^QJuL0)kMu}uvW!!HE`dFy(os{0H*?t~5>wiSF%5@%@Ymd+i2&{lL@ zarUmS{hU%q8)50J8Jb!rVHDrw8Ca_9-1Y2S80lMQ5Znwsh;ZTm^SQz$a#$3qoH^KZ zRMQgg$oskj{kM%9uO+!n5`*_vwa|)1D8K#R#m0_6U5ObH5x%jM(Oohgn$(aV!972d z({-w3Ikgb&a-Wk2K9R|xK+x&?kb%illoENS{qhX9>WyS`3Q{~j$EYoM(Q70}n&eNe zUm1-nCX@Qv)sCu2g>M{Us}C{K2TQQLHTXV2IZ(W!bV(I!SMKy2BJ$>%I{!XAiX6-V zg361V1N5vn^d)&Y@`EpKI3;I@QQ)A-pYl1CI;x;K_jAM2*C-hoNzKD-MgM%Q6^t3| zl*a=b^52Q`|6;76g@;=S!JwPBuJNh(_HCo4<&FWRx8imyJ95$Eu!&CX`<@`&Kld&N z49=`(E|E#E*|;C`0e|S~bXcggd9mKf(%Jb>JCcyLo}Lfjq+fc2vR?fCif@ou9I_^T z0tTI`Y#R57&}OWHU_pMqqTbZ_cwAy4nv#Zw2H=6ejL7%@;r(yc*rSUF{>>6~OI`M7 ztGN~&$7GnApit)q0Xn+Spkmdc1#2Y0`>yT|eSDT%pD3Xdd7X^}{V;sPjvG!4Yi@2X zy5#5x_X&_!5bL2z?8&m?*(^XR2w_P`N$KN>bRtH1AI8#!y6n-3jV8wOgcFMF2g3d@ zV=;N9xUV+svY4S1lthex!J^GE$`nm> z7)(uqaI%qVqwBije}DVy|3Xgt2Qmaaz?_7Yw>BULhGkKwohGpp=%hLP#UZkkvBR6O za@MX>WT(y-Pd<&ww4*OE7b4H{6Lh zxQr*kN5rURRz7xLjC#Amqhe5G&J<|1O5H4(!vZHAWFx5bfw(sLxh;H^E{ix z4qI!odB1X}2nKd|FMQ3N>VA+^*A!Mg4=Fh*Td6eoIq|_KG1{{0yAt*Yx~f0*-*qw~CUr6CCR(GwdQ}rljk1jyu_{jF7Y|6VP}0}JZ?1mu?Aeofx#YCV6TG}aWU8C+Q`}{bFjlEl z_g3_GXMI;TRzYn;T>~~EakAJc0!gc_%jqDO7QH}5aYL+qaFFMGQFhesWOo9z=P?PP_#ZF4&bx#Vb7W&8JrD-?FTXy41`e9= zIc_PwEmW4M=PTfOf07d%5)g#`jrx-U*{ zU1`zwC-pK?kjme}tq&brZJ_`8ycwsLPNq%Ji|k26%QSgXni%2}rd!4w)>OoAnKfSN zPlva)Ty&Cs>W@b|y(ZXKbKHd$_mIJKoAW9C`s>N4;QbZqv6MC`Y;}eO5%AO?RAwq{uBPDa`b3W&C z>6EeC(Gr9-3=I2f`e4M-q9WK5R^#>YKFsMlIT;OOG4gA(FL=qLlDfq+`i6Q9$-?N3 z5%?CQ#qO);$2(7T?kvpkQ&~d7Bkj+at#TE=xvMgN-jqij>dTI4?oZXQz>$;AwjwPw z$}?6WsSw5%r<6@9^SC&;FB$t9?Ihyv?*7Y47`b*Jvhml%`2?2?f!@e5qiG=zgHim; zhrOtUc|B8SXJ>0`>xV30L_sge{p^e?PZo8XIplg$+J>mI>e{NIXC7Caq?)w%$FlFg zYVJLKZ?~+ONpsl$Dx!zzY_-;&rYJ&nAPO>s&Zwe?ootM#Ls-%HaR4irtDsb(+%9{% zRu}=1c$TqlEk=g1&WPAj7nz?-Kwx3p@z0U|HQftk0SM%cEHOzKnJIkYIt|6@G|or1 zQj9~48~mG1^p#=)qCG6Hl?d;DBH9-bFo9u4$>eD`>}*uaJHH5Xl{kx}a#22GVuJYv zo0pp3`Jce_zpS%S=!oh+~K|QkOvC|r4eucu}L=e*GfP#XuQA4GondAomxMy6Bfn##$jRp@eT|(S0F;3(A8;!TFkLnA|PlT#a9flSs5{rQ9yw zIu9kciA0-kl=Z*l@q|dK6EwQfJ+uy}P?c9+Hyp6=9wnT_scXJj%HVX>@J?#p-*q4B zoxA_a&l#`7tW#@Ci~{rKt+^DJS}iB-I~IfcOdpOLlb2m@Hl`0gKOs+jrT`mQAaB8^ zqMoFX9UO$lgf7mo(E`8OVdAn)Z%W(n*}oCpq#dQDP%CX@EVarE%*-Att4!%1}MVYRZxq+1(OXn{S10hr^PrKlGj z+54V@?(65W38K)~w~yZE^;@p8Lg=V07NabcB@LeGx3{FTS&c2qZi-EwaY2i!8TU0O zQ)Xg_kY3_=R-E!D#ndt1LgYveU3}at)P)K0aO^wFtu*2BB;g;`F0Xc+HdprebUjAd z(b(W1`>oC`y6>fFb5kk?4jmi;DE}7D{;Qbw{}i(RM`T;@ObWJX&09}nW+3wUP@L3a zdrhs|)Ps=cf7N9;zXi7X{t`ptAyz9GPG{&LQx!_VRA9 z*N`F+z6P`Wq&3;U_|{-$gWZHfsqa@8wikRaVnwd9iOuubf^Bk}KI2Zo6Jy08#V!D? zMZ3szZbz@xKI@Z`!muqQo<61OESTny<&$Ka?V?V?VL7jk z*ghXfB0)T`Yh_*VLnrZ4Og-Z3LMm3dcMF^H98kNHYi{Xg)zQ%bqKo6wxo7W`*O$gG zQKMcXaJ;uf>sK(h{XN;wA=tX8YY6Y{aR(_cds0XHaYWE^<*^tII_$4t`794Jm_h0g z;T15)qK?eXQCI<-?#g6=1Uuezrk2~2EV0n*{7oz8PRIAnzs5$6JXPI;kH!pCanggH zKmw4+;o8+H`%{M)_dd{&amJ^YHiPxUZhnS(S`Zf$q9I0pj-52~W@9l0yR%C|nFq{F zJa=N)KT+UK%YRPF2pdD1Plxypx6ZGBtp`LsqUOJvVN@9^70Fx44Jc_aNJ%#Lkgp2B zEs;g?qwXSq!a)d75B$41;OJ0L+e+hKQ*8w$YP0qNvk))eP_>w*Z*lqI>YqG1&SQO` zUDD`T&&(AW4=w+iKi&3lT5vM7|ND?5hb-%}XSa8=S4+i*Ps}o+^^ScR)B_PtVaL`d zYrR?6dRM1_h!_z3eGl?ts3a_b(OkO_pG>VbB~3lYoU0{+7e_qfB_oNEPW9P49yx#s zwtisLAyh=X&wI7x{f)|P%)9wRmaWMXIxn!d=3+fbet|bIC|5Ti=)4%n6cU>Jt4P0T zllJqo4X_lc32Q0Nqt{IaD?A=8ir?4k{_*zBjO`jMZ!`G&mmGcvH~30Ruk51s z#oRiV)^0edOC^*Q2$t^rJSE5`t~M`YTU&wXKS}d&S>%~1YfnD-vuv5-!m{sBNadcO zV$Jd-JM*Z<`B>rQIG8~qoR#O}&!))pi(Hi{C zMg7&Q=L6X5wKqsQs*$AI6{IVUyfoqsXe05=I;vJ&(Cpwuoq1y3^zV9y!NeWgy?9N! zL`6u6EGDeU+?y=s0-D#=i5NP9nM`K#jklU0qZ-hxq>+Fj7A!R;Txk9RC0bU8JxU*4 zEZTTxS(+!(8~XiMypf{!i**+_!0U}#zPLNDBrX9Id)}lB`NwQIW-LDQT<$fY=|U)>c_BtiMje-qTcB)>`2 zA`@-7#_X8tUaIEFj;i&!b2*_zi&R85qWC{LM5z}*plnr)lDdw)J+1C55>u_#MH?Y;!$bP7R-7l)q3s-JT~}p%oC6W_x(y7V?xX4!=8%H zz9d`VFpUAAK8fY@j}LPiW2sr# zlQ_HrCXqJ&hp4H~)`r9Df$^o3$P<9@?`@-PRWxd}QX!Bm8PX-bzOlX}MEkRA{&!qX z0u)OE3bkKj1z)@2r&)`2|l5Bt9QPkI~^UlJWU)VIy!#;N3;_C5)Oi_+@pdQ zHVw-uPW~DtzFZ3T`zvktAGW#vqc0hFeV-H-74doBUcOV)!C+s?b0V_5s`!#K8Stw*KTL;j5dfgX|A;Clc>c?O8>{Cw~1Zb3eBLxbPPj zxnH|zHM5)-i+}o*7Y$!h%wf@_4(jC3HezvU9vO9XC0ht&WhBb^>yb~!`~~^B`=_Wg zqk7p|9WR0CLCQZ(xo9(cKM|1imq8H;$aGGR#aNnYWAA33-1RmG1l0$01z?O0rSqwk z>Jq3bK_m@o1OK-xD_r;fR&2cCw{KXeS@Le64gt}A8kDSnxC?##Pwj@UYX{Ha&Q6FE z`cEL?6^r_siHKYh$frFQc#8A5oruNH-0w=g&x=k@PSjtX2t@LqNIqUAJ>Yi)wl>u9 z^W_^{d?SWzDLF0Z0kFeH7A z3LA};INGY9>F>B(fh7>v{4CD*d z%S$!N3iJxrCj8T)iJN;W3(zn!^% zQ5liU7?)q|9XOmMWlYxA%6c!df5#v>V)L#FY zjj}X(^XwO|%|CC*opnw%SMf+ics`j*98fvUP>r8MK`hC;TR7rKY8 zTToC!h|gYgK3(ZH#=0meEgB_GGKK9(<%v&xg&lxf-X+CLybNa<9=U z&T%Bl6--ATM>r_=6mmJ)&{vsjrANDiU(z~Gm(P=Bo#Jl}P5mHxbI8?Mw4 zUg~7TN+{EP5il_~+66a8w_WuGU>`$e420*(CFDcap6;eDx(dZwD4*+VoPC;PqDa{r9KL*zCB21$h~o z%E}_pkQs`@vcXigkH=f{I30Q}k!K-fub^%^R9qfI)c6vw+Huc}H;2-d;2^~HsB9#A zqWYX$@-@e*L{yBi9YF-E9G!1TDw-G3l4ZK{za_m38u8ve(J=2}6)T>i>)~K**LIeQ z4DBi#o4|Tu!usn%{@7IM35v15H1z!?Z?A&7dVR#T*TABLE}qTcmoUP_`kuuug|&)k z)tI{|>?ZV(jmZ%Xh0*s7&=aY(TkV?C^eVzc3~J&7!YC%3PO*yBS`W-C<*ZuC$RA{^Jv9Ftm9y zKCr8N+ri)Rrr}_-FHr09X4A{9e;Ng?o@pV=^N2!EtF4Q0!^4*3F`L>~D|R zb)bC2_*8*52iP-47~f!KVLM) z!YzoWzgFSZ=yv^v@&HO`RA`D0QS3;L9i5#S!Qy~C!aa{(->%SEGrKOEVTSXux7$tX zqR^7Xr5tTPc@|n<^rparm%q1Efg*wYI-$My!Oa%>poU3;G*nM|SMaQ?Nw3a?Yp9?G_J@#RLiPvhQ-S|o7g#iYk1#~7n32T4Ys7Hw7W z%P196a-^joxkp;tH>nsA#@i&xL(hM}tYyD-&@5zhsyr1soPBV%+$asL65w|h$s1b< z06L4WBw(r7(5G-h!}p)HwhI$?XwUPWF$fIX56*0e@qUYxvVuhGcN`4e#|kqS1hR>5 z7fNh5^Wh{hn&>4q^WV;b6NyFwDJ54XzC}f&36cdd*JDZgN#6~xpMH>H&jxJY*9HJw zY;7C^#NfEn{rBh^;s`Uu2zurQ@nLBD~m0t289jtLW~;vFEKX3?l_57Z)>PV(c##Ttc%h|7$6&dct~ZZ_mF= zFeRam0l%zkKmyaVKY?Lq%{0@C(_|oN>2`xFH#ZlL(`x$vp35|Q_6Q5X0fPn7pXKVR z#p*0}zoAa7LP9#^T`M z7(Xp8-tju5OY;v;Des>Y($I*9EAeuAG^loD_$al$59zahNIVtYfuY z`cLf|hdDVq`qjO*uHhSq5gph(^>4u#q3Ew5mwJ35Wo2cMkWL9iD0f|KsF>Slxw0id ze2GE@ zeKFyAO@EBB+tH_Bzp?EwkRHv*Se%)`8D7xmekLp_Cl}u9kxw1cYXqN$MoKbYW1}Z0 zC#S1Rh{D0nJ`d`k`CJatcpOY3;Z~?JJxN1;gPPrOuy}pIiLwoGXMg{0-4%x8-Xv(N z%&>~#a4Z1Ymbd4KkNLQM};f}{sMrd2>aufy(S$zuhxl#~>xVAj>u zT{d#$B8%!?LHn+0%hD$25iu-*o4rahi3kLG zhljh1A|~sm^T{t0cc!m`sgKrHzJSWG*RNj#BV}V76FLPo@os+)uy{N?JokRTR&4hc zn?PxJV}8CFtidZZ!(w0pk+B}ah=ly0!JsRW=rA)jI{NF>?u}pqraIx^}`?~xm`H)z5q36-nYly74#2lR6=zdDVD&2 z9f2Zw1UXxn*!XyGdGQxEZ_{+AgcQBOBo?xxKiZ+4tbm!>I?Dy9w>bNH3hMomqX+ez z`>zj9{O>d5KYeFy(W7A@sDA?A_*S zg_I(LW)-#OyC&fF)O6i)A22n1jW8WM7;Y_z9C>vVBVPmOsf0yJ(s+Np%g4)mtAIwl#~>}^*$j+5%D<} zXJ?bKv9VE6QKdC3>^V1#ZSQ?}`(nrqRGmmmhww(x|Gg)9Jo1H!Y%*&u*v)1lQkq%R z-@bi&VeCQ}nb*{`0IEDNR0CZF+)j*=BKddr_N=U}4?Y|jizxvgb-hRV_ZE_zBtyv3 zF>l|!;{ew^;N);Ec{&_rOEYFszj!?_4aE%21?F;N2A?e+uAJF`x?w)|>C-1*O^epE zC}MVd)8*Kee?=5x9)C$#pFfqEcYCHncqxj+l96t>hQ)enM*;MayC45v6Qf!Rw*u(( z`P|a|pI)j=gcKnF3WX8jKs`mnLIx-izPI&+j?d2a@ziLRSl7(09;?%X?U?|&8C*Te z2qEOD2?>~>i(_h6OH&gb9=`s<3V1!xm9f6Q4jrGIG$~gH?tz|E?pa7yRduzoiAeze z;?(S{G*nphgTqj2N(w6*TLaQDt(3B*rKP+);&-|y5J~bTO21GnCV2&gmg6qGKvrBu zP)eN1ZP#YRdTyE6v+Y=T0S~tQkD8jqgoHxA_jZ?YVh~B%2Iu_>%@W|afExh+UC4|9 zUSel=x4*9sU2LY@P(oN(7?dT;ipW6-2nfK{fD6L&XifuQ9c(s~#`BR)hjD7L$wML> zcj8VrU~+O2n8(ifH3(f>T|fk88MhR11^qT?BZcpZGC()d!+_=Yx{Y~q>~fq?-gXounejZ${2 z9Knx9K%l9>7uoP&~XCRiQj&$ z=bK#WI8O|@|LMyYq*SnNkUxR9YVXZK<&wB4wCBYWV#1_BlXJ1F+uJWQG%+!;;aD95Q_T;i`Z0M5yu)LahS2E%+kG+!F`}p#f6WnsP_KLVO6^cU ztJ>n7q2cNZC{ZL5^gLP?)@FLl?*VC?S%lyD_m4SitrqXQ-0n&3**!H-B^J;X36Mi<+*5qsi42%l2$?&M&{m(Azw*R zh6FJt_UDdmk0W-k+i#z{3nMq`+L)S}{xVA_TYa+{`#Dqh zLG76kz+pagdW{ukSJU ziSt@dbaHaCd>)(a zUSC#LR_l8uK%v6K$pQ$0>Whs4d}SzOy&2%2AmMff0wUmWMjC`*fk7|@hng2dhyf_s z5EcF0YozQ#W5t;|whhAiVFRi#@@+gmpR;V~R3ML{7Cvh-s8*Bm`oN40|LWDmR2a*{ z7|rc-;$$9tL}BEoEeHVM@um+6ZFx#a1a_|;Kd|49XJWtj5=eYc7{H>cten+6x$P*R z%Onj29*{Ka3zPCM!vl6)IRpGcu=YWsV5HqdKDS#V+5Z0iAao7@YhoGo9mT@R z>TRiD-_Q`|v#-s~&42NB=?xr0%}7l%q%x}Msg z<4XhJP+rbrRNm@=>k%6h^V_*$f=-7lXKcG(=p9bIiVqDi%!^@jD=S$UnNuo1aCuXc zz}6pzAvY~8Jg2$HM=0;Rl3VKcYuz3o)_ji%Hq)Ur&JVL);dnAKGJ&)|K7vj<)>MG= zgpr?-7J{__^*I^g)FBms*aH_2pknJ42v^mbB>+#Pa@i1aS*J}{oHGHD@bNDWi??gN zT{{y+HP#Eb+!93-y0$-`1ADVHGuu*oClP^9!^pT;X*$ez*ob!j;bT}ikHZFV=Ae|1 z>1h72(d`t(;Uq0)c{S1Zhhj3+A2#2l$(t@KhjyNTg3kzS7Se&)7*)^;_)8(Xu#onsM+6{1a46z* zO#`9g_kP*meCC-Nh(ADsum^2|$V$e>>qPfQfq>1|fkh}QI|A5A6nhb3&YsdrKlJeB z5Ai4BxVSh+AH|9hv$yCJ3=AJSf>7>H$!VK(^|ZC|<3kgFSk1(wr0|-Ll0V=(UDOvA zS^!!5uFzt#SVOY}*bVUVY`4{q-G-om8hF|pQ}44839#+A)I`*^wde2nEs%$*;0 zbN|wkitMhmoMJ3dom-`vFg#NECOZQLA5A9l=WvNB#6WQnL>X>3jEI98r{`YJnvA`G z-v!Hz`lgg`=>mj>M_powXS4D0cPN;6Z-9@n7`2nIhYexJSK$;MyqFfy*t*mKTdUF( zIv-bIYC0P=o4~{XYo&yqt5>A$^@ymwoZf1-oKI?{%jfYDTX5fE@iGF`L;E*=L&)QG ziTFkq7rhVaHbb&p_p7JC%su}9<3|+rXmUoAmLmDUmEs*$X)PqigP&d zfiKIVzMpbMMgMyq6ajINRLxj@G_=3e3lxI=CrPQ`ya53LGnJ->L0^nkPp{-N_|2;|CpXI9gMniR+#}eOH%Dz*)R>r<&R`4fT2yORn^w+&z_4$TywKqCQa}_G|D9_c24$LcwY#TN7z%X|Q^~3{j0W{$#QZ z3=MIn4)(l=jcQ*3VdRH8y-B4;x*_P^a&7=gMNhL$-|DI=FoV}b&z=T%Z=RNDR6c67 zJ8K=mXpe3caE+1Gb6%|318bOg8$Y(j9Z7Gog z-`BjE;SscTw9?Mhc=Sm#fCVTh#NVyvYey`q6XN1L0l-noljlg5-JL2O?(Z)G7^&{y zBg{+gO@LZNk*Oe;09Q`rd9Qwvmt|*XpSJn|+Q68*CQJ1)Q&YiCnr?jx_PuZs>?cKS zZCNO2C+18o0mYFl8^fCbBm$nuVLqDkHJIqPw7Yvfpv#^JcR?s*R-9T@L)#eW=xZAr z;<>az3b^6l06r@#Q%t9)rw4eG9|Tq}5RN}A)V~v;tF>OJ2LbBj#J+TD_uPG0;6l4= zIxo{(^WD4L14P{LE`U=qz5dMHrvU!33j!LL>VkLA0q8Ey&p$dO@ILza5=2Amnj5fB z-)-V^+v=Bb;X|%-8ymGtr}`^op*t;r;++wN?%_FeKQSN$Hn8Zn`N;g#be!UW5pH55 z1pJJo-5wtwzw{K8iV+9I0kF2AGgp2p`7~hO2q^Ih34i_!ISfseXsKyyYpbe?LxBUI z*ggM5%+A5_oFH6APL6?*v5ULBH<$%8=`|`y&fha>t$_?R;CreckOM(4Qk(xPEP8ch zZU^AIMhbmEj|YtUZh1Fh``|vruG6P#c1b75s4_)?0a)hm?*gdP#}Aqmm6U`x@&Fg}CCU_54|p}O&-3RE*r!3?yKbq_Up2to z#u(@sqN1WeC(zW?yvPM$wOl%3JZU2KBMh?ZD>?3|Ef@$i^shu=U#AUpHWb~1iN!@- zJw4$3t=MsIr~zUJ_E!!Z^zS23c==`xs7#Lt``A+xzi(gwL|e_J_UO&EH6s%f3w8l3 zjz{Y4{woUxn-no{6=V)}1oc-TU^Ru2fjWoc_6{1Ck#P?g6v9Oyc?Jl>cEFoQ`_y)J zc7i?|0q2pA(lRoDFrrjE=9B%%I*8tusA?%GJxW>+0)95lR~yR`9B)>_GK94MkQiwk z?CeO($?Z4yw5;YL3eZZSZfYkOpC`EkXnSD?HP-0r$&$*-%{2z{m(cxjr70uRu|HB9a_6^48_?Y9Jy3?|#)7a676%1LOX(RqwQWa(dbwhEwT%=Uy~1 zJ34B>nc7faKg7FBUpm#`b@K;UTkEcgm*5h>>!|E#s7bv>^!- zmH^!l+#-g20d#0txD`#*gKoNN%c*OLS$+`Zp9^0ewIekIvbdjZIRN_r+L21;-5V%y z?e)Jy=(1XVLheRJMvhxykS-$?2GjY#&oi7Qn`Qtw*1Y`b6%c(ckGqMALV+)1Y`**r z(i{(9=YsZLEL~R;lt*m?s7XKsI4w8q4haqQIf>2O0~BV)H1l<%_SPf$X z}OTf4;LxqJu0{ywMK;3J!322G9;T80j z)w5uk-`h4!0B zRFId!ofjKk=%r2VKIUQbS}5(%dHH**ZkO&a!u7H%o$^QPy8-#NKZZv4t&Fcgd_^YUZ6~+}VP>?|U z1Ng*{tV*T*~wRCi)@+Mm28|Ry3E*nTU)Ttp87?-A+`k*zOu4{Z_3UG2LEt> z$CyYbnnF*+2!2omuqx1_ba!(R86Mub;o{;##BB>b}8Q5O#^WgoSt9_-ce;ptTS+_`xaB+XW!nIO>!huQ$FwNe5b6(yi(3C-M zzmW5u`gi9iAt-WV<>l(?2?V&fK)?{sR$@$4LC>Aq9mx|x+;#+{rBI_v+5nq!Qjr-O zAtF5d`DbB~ASfwIvaCq<@8|8OfEjm#k+m~#zc@hw;#4DG2XNJgLzzNE9+01>o*o`I zzkWq69TE``y!ID?qXWsEiHV7sGve2|B*?IPOD#S?D#q-;z5{aSg@UXsvIvkq0q!<+ zv_XdVmrvtn0kJn!4hDi=ZGIrrd>n35tW|Sh<8y=8Ujgt7P)`2Nn01YZkx_?5wFzMl zH$`kOdAzh~eO&)K_*s^UiqU;%BqXHa?+mIHX6(EyEI&^h!LQ#CerVe~4G#;0)o};I zX6NLjjO@V=hKfr_IPvP(o07EI4g>ZNe0O#eUr%m|hC>wVK_Kr>k- zdlTCmm**M(O+B_hImG5gG5GzMz~J{uAZD)9`)J_d;i=HZvnJC!pXB7cr3H-ocTvI- zzYsUKx{l5V&Q$+M{BAq^ys6!q4|C#Uj$n)3;`a6Tqiwt~MAMR4Gj(c4-6z!fRCgZju9uz{xBb-EO^^@>Uq0*1pGcQ zC}a_!wX`z>NDA@@xVhBQ*jmA>+|iQc^GXz@^A^>U64GhS&GyZ{0%WuxuetDM&;_Xw6rGd zM+Mr9ndjf0KteQUeUJXk+359n4gjJpA$Ym`dB7Z$Ts=x=kD1KwNFuBaMfCF?vdA=E zr=6*mdnbE$f04&P)_C`4?%`DEA=Yj1-Me>>E(nnL6Hu_+F{}sTo~$$J2(Txh>H~FZ zbYZ9Se%b&I1UfTjY(K_2pmzZ=z8*w;$6ZtGF6$cLo&gi0Tz9>IKwd$R2=w0%P~$#> zs1JbY7BO47xXEg5BM7U@L&%GZGJ_*Qsa!p%mMjqguqa zWDfVv$du(8ADs!bRx8EL?Qd{1QvEmL-aMSjw|yU7X)>i1LWV*@h!ql&w91enL&lPs zC}nI=qOuS&WhR776+$HqgoI2<10l(r3dxjdpO4<}KHlGd-@T7xAA9}r9zMNmc%J9J z@9Vy<^E|Kf{*YAFGlmA!7Dwc%ks1ecX4V!9zh7f=?*ng5V{15o$liZXPHa`aBFn|R#!tZGVx$J`qkKqX?vZSI0kC~08GLO&r+`@LB*`Hg093Y$ z<{`Utr*&~VDulkizWLR(jEoH9dqz2uS2f*m8Dy8lD`WWir>;HM-ul*I94KW9DsHF~ z*;Mt5hm^J_fB$|mRBdZi-O*#mc5=P!{P6yLytZ&+)}YG|_2PDkKf;f!tJd705DiWY zSq$`m`-FvsX(?+&goQDWID||{5j+Z`s>Tu=Orz;1cAlfV^N`g0jPY#!M#gGy7XsZ0 zKK%LE)6vVLmuO_Vt8Kjy7??s3^H|P8j9}^UxYgG>1HQ{k8D|1Wm{aLwIyd|(N zQZsW_?9%pN15x(sFZ9>aMT66S|K?E>jHD?z6~rDpQ|eEyoR}XeDEC2gaIAfaOSeyd zj7igxCeU56+nI`Q3DO=&BrRCb4-ZPocx+$^Jn?X=f)GcDUxii0=5L!AR?&IQZd!Tu zWu=R(7Szg8E7A@M>Wi|^D&Aw7@=kGz#AZQ!uuwkaK9z<3gyG+f7b0UW>uq54AJ`>R z{MxPah9sHYY~pm5s&R$Ik2F0|OZx(C;fcA0)pPZBL0L|@hKU8;lnPm0zOv~TqkEBl zAaImnAt$eOFYUA`w0b+c z`fY3L0eYv?ryKQR9Feco{X8TXSvxy1h!{^hbBSqFeGv+Pt+e+aKG<_LEn?~eOT}(7 zF4K&j0y(+Im*>t!6J?s7rm%>}mJ466ni*<*0i1`dc6I{j?5*$*;pL%Zoy*lXOQGnkKog8Nn36Z&^oqJ{~AsKr+ z**YEtRA5z4gVe1&<5RyQ7*Nz;GrSH^G5GzfR|iohmU)bCsH&=}{^Ca;9Z*+Shb#z^ zjtf~#$Rc9x%V!&195mP%{lVY5j#qPf@N$N#?VB!buI|=R&CpL79DO>H-?thzW?kpI z8{Im+SJT!bYyCSp0=QF!e)iY-@;$!EZ%FJRpgzr{k_7HZ$+o}Wn_p0%o04mMFGO%? zHR(z;*rHIVN%nS^Y7juN_lXr($W$TLI(*GUa!5G&s7zzE?24Z9#gTHK>1W+9zTdq! z@Fc+t!#eNdizKyjUQhIuo4I$~$L->yzm@jw+69XrT8<(+5J^{8(E=C7SO4zo6KbANOb#PUD=FPK6x+qUuD(dAc`e-vC3})7g*8a1bV}W4 z+w{%UP%FyNxo0OzRKt2Z&+OJ|buU#a+p+NK6-_f!bLO(r=5T}DhJk)67VKZw_~Xy?^m=AybN9M!3@A(4gv4*h zjvX%L3y+WHp#i^cn-ZxZ3c(b*n6BBTYIWqZ;vkfgS_Bo7i8+O z<-e_|7B4P7vMAsjn1^dd;*xozwvkcH(Y(WDCOJTLs(onWLQ`kygl{#zH`Fo?XBQ)T zEiG-gqP&X5Uz(;dZ!g#WP>fw=YNgcN@pH<1kdA{d=wK0mC(nYlsLbYP9FX%c_)h_I zXAr<12B`;RBT;pB%vFXaCie`*QU*7yqkDOy6U8^Q&~x`W2j!c3$Mx7hbar}ooGvMp z5WkUtt(eGKX09X*dd1bB1sd3ir=w82TSZx$jr;|QqDuNne{IRQ?B}b2bd7IO71W<^ zb);U$jJUw2LBByvVjG~V1g-j=SN!kjiEf4u1hGHU2AXD@RyRCj-na*(U#}(mvAmD8 zRn(nl9vy{H#>VIn2yFLMEz*_Yx3bBd96{upN;#~m`h_LJB-N9NS6mUN%4e#jSa{{h zp=#JaEM_VMNY@XhQ&0W+F){l)d39~M#9WFh=Oe@=CMWFJACI}5mFGoGBCe{ht2}Fm zR31nKr|^joGg0>MqoZKqWp$?i{K2ECIr;RrQumiH`JYCBUid3qzI?gD$`w`gnUZHE zC7+z-kl7PCPM1#1TkA7NjvO&DiL16bG^@t0d5prP{Y%d2s6_oc*<@D>e`;Fa22Ozr z6g*%o5=PCvUnR(#_!dZ|tIhCiOew&s&=9)W_z3w0*7s-{j`uIbq0@I5>;J@31L+wf_9DtNiDV z4wHQIpwH3?e2Sigb6R`$(zNf=d1@`tmuIIt9^cD<`W>J;z?;8QCFRMKqHVL?XVybT z>Xy_f*J_@&{=6u8d(vJlp_|xp;_72`LWZ)kgwqby7TMP$KjUOxGe|gYZo?ox04vzz zN`JigMtFG5bPL@C?8$1LzVCpG=G)BBE9p7lMMag}?jP9q!a_2$fq$CdZp^6rnT=s^7wR@To&HZ_Rf0U?i1dNikzefD#b<-O`-zQaJgy-xlQ07iF>`p6q_;6h&UA$jg#^xCEUA&_d9+ zj7*;Tl)pntiqqh*jt)a_j__CcrZXijoliDQE^zn(U-eXMz0AYtZ{Q<-L!ikG<};R} z?1?q=M0%>S$j>jqFHuhfRTN3B=PvBHv5CwQ*wN7u7#Mg~G5IZjM7rpsqkN}$34@eh zzs^`E4tf=Q62ITxJMMY@Jl5dtO+7YNB^|oSiZS_zZop0A>~}*U)}T~OV_>9x?xoN+ z;1zIzm3SJ#pKt7uxH{X~(J|s)N-u!5eE+`l=Rd4Lc5q-l`AG5jHKTjRhlE(IFWT6A z1FV4Oj;())!~L^Kq#m~fM+hXDqU_ttk@0bQ^0Be$hti8f|)?LN_COF0huMAO@<2 z5UaxZU*-YU$aZ9WDoRdjD;=k+m@C|iBX%R!gh%gjUrikO+XFwdLXd>)c+2`!QG z?tRkI(!J(%q-Ywe_W@Dn*86&*YHDf__7pSc%ZKp*MVVW`W6a8OD3f8()5F)+*Vn_f z7YGP9H^>m`o)2~aa0y%?u6c9#2|K$xNbERPI?$2su(1U4v8V$xHkWJ`e$nW_!^hWE zcKOo%)6c7VhDJvV?%&roNv!7K<$c)k6OtX#H@8X1u&Yace3h5vWjP^VXcoIJuu4{E zLP=NOP?VkZ>E;Fj**#)AGmXa>+>$kf7}xj#nzJdiYoD(hnM~Q|YmsZ{&bzxiVU?&X z5Lb@P$L#p6vqldTwrzRLIFw zry3nR++${%jRCv9O||0t14K z_WsdF-;pjlm>JV=@G!^?%o=9S)4x3weY9P@_2Jl+h(WKYI`$C*`=i{U4zQd%`RJnZ z-BWbzPi8Jtq_^aBkNSd8 zZ{1PpX3kG`Jbk*~YcV}U@|%~>=$98XsE0?U=lrcRN#A0Qs%R`uPerHa{K(k9Uykq6 zvM8@FL__F}`ReGb;Te{mu}+RG{}SuvX+{cRr>ms0hpO4OvazudSQ^A}v1iNnZf<_q zRkWIJg>{ZwNyiH?TPRfk0p8B2t=`TZ3h-Iyz|waV@4?SRqYs-@dKzTMOT!G5zbEsDDjk8y&`> z?m2h<{E5S@pFW-c{(gH{??J&x(7SuCRGYx#4Wuyi$ry^Y`ju2EcZwgS-tE#RRxC1GGh!>PPSDez`IJN-M zEz~qtYDP};r0bVc9M(&rm^Z$}c+@aQwAQT?`Lv76s8T=C)D~B zx;0Y6S&>YCdve7~Y9&u)dP{frJ|(5+XGe?!ta1H~4r~F(l%P_DCgw<)s^_yVETv;l zJ#(vVdb}2qD99`qh{&6$6Mzr*@J04bKhJ>IFnEiBWK>#T{=Tw@M%xn{y_j-rWO`H&rWJO_q=}z&Dw_24A!?A(v^zU+1&{?fLZnLjSR*yq=~tn< z<7tm4%HZS2A^q4&L&p35J-{jk0mWp5p5424G04P8m|b%ulWt$vV}E28Fyl{KpxHO#TU@! zgL^oG2Hx?Ol$I)Vt$WSeBHIO!d5;mOM`ZkOk0OgR%linla<)y9bcc53fulyIL9QWa z*XR~ZI&4qF9M)V8bvL&ah8H?0U?(Zu9n7v8bWnaBMvejb?A}Skr!HP8;Bf%cxy0`L z@(VoHkM^j}Tk?L`A#x1~4pGWyJfvO9=rbmIKB#*l3;%I$4j_#3NHw$w?(qq$#-&L1 z(q{LkS0!d))(^ToBSkPrVtS|?N)tUS^5vhQn&o~CegKN)Z;vuH z^U+ma``FU5Gh?a~QwEAX%%(caLWxU5Z_{wGSZ^rC7Z-gpTDUCN{u571-xfV-aq37j zUGoHpZ4a}R_=?AFy=rNk2@-&6GVggcQ?xPoZ!5Gh-LN{+_t)NpJRVFUFm^*Rqj~R? zL68x!T+9wKpLH~^s#qao7K=Ig=(DHav5QKZ5lA|R z-DJ5zFaQL>4sRXlDt|+{5bZ@3$OoX6-bPH@^6v7pBOgoer@g1EEGtuvwZ~RE?^E9B zfL^JFvYP0tS6BE|ka=$IN$4IOMQY>d2$094`J^cO=V#|fVWlTKZDbGWFA5t#t3E?- z1;TnogFip_^3c_7MppmkPjBy2IU^J||Fi(Tkc`bfcVN&|6Ji}68QDq`GT(4GyVari z!^e+JN2Wa^II-RRt6%FPvJl82CJ5dAMPu?u2D4bc3kPaj`=qBgnr%*A_QAgp7uG(VP&CqiAkdwIHN)COdM@Ia3MI9=Q9=9to! zpo5S`$%oy`&o4ufa3pKCYRe+OHV_K!!-tIx4R3^oGDzJ5p%KtDgmCSC&y%haIoHHs zbAeg0+R)KPJLwoeP?p^WPrUlQln+2VTMYMq>xRte=^7cqNDUC0m~I~#w)h|WZo0-X zkz)Wx&=&M=GHh#dbyE(t%GMX5Y}=gf!CT@n*hGwbtl9&#=1^-1rd8n=XWwzeW%sed z)ok>uP}G{zI~2D&%4S{4Kd5i$p4{9gTR4mi1dU1o*4TPPgO5U{cjN9`LaHmLDZ-DL z4M=zK^4A+@_#6|Va`KQHl_egJ!kGrvDhg6r^vrc73Gz%}%u7M!wcb`Sn-!pB*a3G=o z?!;fHP-vV%de4zV^6;R(Vpw6}Y~G4IHRz!9`f6n+Ub zX4j^@W1v?RY~j7fYTsTLtSy{WZ~X4i1vdGN@o(FMKR>WO@WxS2AqCxrh*!beIBYaJ zbK`Cxa6(crU}uDpy=S@bov`4JdbEE#!y3Qd-d=-T*)E>)mKOcE`i+;~$!?{d{oBXU zz<`>S!h#x#>M<70g7U$^2Of*Yd7n`r_gwa)mf_u}LRzNbmFbks~}O zGL8`o45MGY!YT_T_Pb0i8KsASs*u^8t45Zv-6Y>27y13$z0w$jGdsRqiLf_AG2q(_ zx?$ZKKd_D5p%Z_&vA4+Dc}S&^^Pu$J9$eJ!480%Z8=CnB(Dz8P27w?%(u)QGiy}r+Nc+sp%+L_d#Bh{N zY#b=P{~c;%>^1;P72a@zPq2yeyE2v*xcMn`Zg$eZg_p*+EbUZQ{_^gfJ2W5mi}KSy zg?r^CxkC@{X)>yNU@C!6Q%lw%7n*lb&mBLYv&wJ(qoX@GLj09GA)ua0j-w;>(bO`= z=N4!YPW6M1vTrEb0bd*m7FAaOyTk+106Py@XKd|bxR}Zs?51&XaRfd`V8ma)f=gBj z2nX|2+##x}?~7mnN-(PYXvvx64<|1VXT}+X-6_Eaj!qi_W(z(jxap&%vGHRRuAqk$ zlAC^b^t;N7iHjHOrf!S1k5cdC-n41_;tOQ{2vf_GG}rJhwgAm-%@dIteUK{T-n)0K z$S$aLSPAu}t!>8GsV)0_o);GvqfEjct7Cw)$%wd(5X&9@YaAyJ_52m>%E>AORffqN4_<+bng`$l*1%6fSxJJdWORyG2on-=Jbr zmAr0R$D>VSYkep-c_2xpc6(m`JU2ZxMQnx&W*yr0zaA!&(*bOwI81tpWCU=QK(GaR z+m7aiUB>w(;L{HZqG%w0B$$DkyC#sLn&y2pwH#xv0$C;Y%~td-RWgPe z-)k(3RGrFLAw>zWcJQ?0JRKRcLRDX>Iqv0y-P?}X^^Z&5lMTM#=OgOTeoH&oknw{A zA4?z_2j}%o`yhs76Xs=6XYsh1sUcKZ^y9|efC0Vxes4W-p-+{qY}TvN+@x)8ihmQ9 zeH^r96U3y>sFCW#r{@-C|LOp`=pId-irenJ#;>B^ePitb;};gA({sH`UlDbXG_UcK z)j^h^bNFzUx$DW3!DLonY5E=d6K5|rBrY?0!{-@psRn5DR%F71csPLc*hjFN3#hHM0zIO=ERF#a-I4JwZ@B{Ja@% zcAN3~25V)AATM6J#2|o0h&!z6U6iNl90Rd-IQtGU&HTo6+uUS#&!2lEgR9#Z2d>UB zF>Lf^jk6q}*O|L%+tC~gEZdfz=q0)iII4W%r^^z$`Um%H-2z6HfUHK%NzoFoR&K%0 z1Qz<;WpUP^-y8R5o>CT%s$>1U?oI!1XN#B8%ts#V_)1i(QbgH+bf(|V2$adx*x1;K zeRJ)%?l(Hi4chHRsjxzTxPCGrsc|}a@=e`c07eTwzWE>5kS4NS*R~S>FUnId|9>DO z$tsenVk(Nnn9`|A;kt29aNH6}L3mA6gfg&Jp3Mk>c=7X~pio5y085y=0F3f;^+l!W?0Jp8zD!z`5xz6*Z3}QTg^kNHyCWq;q z#BriNRuzo=vG((3^r~&y!kJ~eavrIDto`5)KN88GCHW0|FhpnQ6Vzvagu|e)c`wC$ zI2jsxwxZ|<>YAEfz@Z>1H(lJzw|VogkrAAjgw~sQ8F~4(uC5nA1JZo;Q=8T45&uv+ zq@2SDSXm^aLm4?VN*gobk0X=V63NmE3hhAlS%Yvtr@(ul;!?;akybOVuuhAp@2_;d zhNGK$#4`=rKYtd}4mp_q@uP8Y`pqbUP(h3+bc`U|P`Hq0Iv++QYkUt%4TTQu{8#)T z9kB;OpzU3^E$-FpO>$h!m85csdT!rCASE{oPekMOP&xbNNWzaudIklj?+;=f? z)dPt=%E~Ee3tzO`e@ zIuKG+p69o)g=qYemStyz_~Kbtn2+WE{gD`bi1@lWBztU|w#U3daGn|P@<8w7>mrHz zBIc@B4tGC%2MmWflXlvgE@jYmoj?)zPt?^zg==nGwL3r76BW`vq1+?mD-LCfwAt^r z9mTeVrf=7?vGeyt4n16AO4HMj;HXg)OPYL4n|!r&Vg*UUowr7xeOK!osOY+^=qBJX znnL{Ma6QXpem785i9{XALG^Uh6euM#iCA!!!rA4nJyc)cC5UnzJU8Fk=j-F>=$NIo zqR+q4;Td$M{-1hn3TJ>2DnnogBj&-rXu>lcvR;(ZNfe8E3Gfl#v-OrfeUa)me61o- z<#sGgckioNx1#SB$h=Z>z|ot2shY#B%wbWKPA;~ zg4`zbpdchs4emzZEf@YyV$GzW`@RuA>mY74;}aU3{**K=#`+&vG3Yy6#-0oBDvE#9-JP=t6)>o zailDEba)s`W6PE;sdHMF!g^sx%oR}gKxYG3-3Qd1Z z&w(bS3A+R7P0@-0j^>X}1Zd!J?M5ahsmsiA7O#;L#sRuxaJayzWsa72{4B#rp(`xx zHxs4&{mDsifW^Ay7*kJ6VE_J9ut2C_@?T7S{!zlD#}7e)T%E&vkrRrH{^{V)evPaE zf+ZL^M4XaUch@lyolofO6FHT%6;K`|d(Z_R5<;U?qUWSnVp0+^D2H(a(~K60V~?2+ z>_8MnQNT=BNk`R>e%q@Ru-Oe+j)rVfMr@<$)bhN4kaJsM*=CCLQt-dy4Am- z|G#>`^bYwy?bZ?oh>y{fH+Ih8@)YtZ{oLPR5zZvs75{jZ$+nmC*B2NZHjiu~S#79% zz~+y_i%>qJml(MuEdt$>Xg`3)Zvz!R9bdm%X=yQ4QR81yxgSpU0Mm~_tbEu!2!bIG1`CZrH51-%c3(xOicKMX zYh~&^^y1Y4w%Xjn|B?<`C)_s@(pm8UYxrjnstIodkQmM4?p3P#ipeY{yV=Xo5jc|n z3|OE@!=RUsyZcRRuEeItVn_JNL?hU_(J#plHpkUN(Sj{zxsqiG^s{eo*!nm4V0wXf zzj!gvBq!{JPn`H2?U9naUZzsI?KY*<<8Im#86`o2e5OMUfNord@akVD$EO$UG0H&-Ru!*8s z4|Eas(FL4xb?LziYN2sXAV;@jO0PVc{jOYENea2%J=$DW@!>|I z!?;p-mN~w7V%-YsMK@lN=i_V_1mkBMBB0Ys{3xe1B#A<-&_8g5u-$ay zjVn6+!c^k$&~0dOj0_D?l=Ni0ZM;oQyKX7Q#f*~jVZ5c#g_La3lN?OQncA>BF@_6J z(;^NECUh|h2zPBvMrnBY-8al`zX^)0{}@PoM(pd z)S+nM2-mz?hTyN!WXfPp2*~k)z z;w=OADQX!J@&V~NG!`+;9V{Q4uEu)1BHE%Y#94&;#joN4AZ4#FGPUJ^hM#rie>mxs z$Z>cxl4oUQ3utp^^AmfYAVj!8gN*$@xhX9zZD7D5QiBkH$#N@%c_}c z$6ioczlU8CmHmg4n*xGV&+yg&sdrMJPIvl?gu4{&DhvXeneVJ9pmGzl8Xby(LC!5e zK-$G4l9;uNTW4zYnr0h3cE*7|(GsK+ZrI~QEz!98O#!IA82tsw^w`l|d21-z6fRUn z+NNV@qzA!9wX8ts>URf79duBz;L|ZPGiZgR?W%gmYwe0mr>oJSRPSSW05>ISjktbY zTbS)A^J_JJ=)ViE3Synd+VjaoYDCX6JUyHplEIb@ zkT(mx3a!JmTSk_OTO64Kt1x~z!L@$MmfSme5k4OP@1!3NG5J$5JJ83O^Ra%y+t(KY zwglsQr?J_bJXzUHjH<%bD-;(3!$9+i3V($C-@3X(xrW~-FT#@cyZ7tZz2|L%URHD#7e6$b13`GdZEbke>{z zmqIJ41Ke=H)jH5B+dLsrk7T6uj~Y>Qkk_xU{sPX|8toY#W>rYWXt4b=Id<$4q-H`w z8abSa_B-~QI^QvHiX9B7vkTs32wjzYhC_{`Y%CDrUt>pb@~Ld1=~ofY0k3bb7{Y7( zB#rRJ{DEWf*oo8ZW#(5}tiTJqb29l$i^(Ml=c2pk7f_)SbGKm3?}k+5WI``fIuNM^r@nD zML@zNq^8xni$l}RQ6aPZJJBh)z@(%kxNk5B@YWzVLtwBkjt0J!n0T|kA8>GXYn@$@ z=XP{KxwsUJg`IJCFM^BE;7%iXUS*Gg8?D1gSrwDv(f8W-7+`4Wgqv{yTP+Go3JY7D zQ(GT`@z2Srb;!m32iX1ydo@M-?Ab?# zVmfgKI7j#6$KYxk>UE@|NsU0yOcFS;-qBrTD3)p9boT5n9pApUIfi$m$L}taujocN z_bfR*$64;qKWW(I<$<_TtsOne+?R4RuSq(ydocJY zdfs;nnX9>(8JsI%q7w^7o>kz&8se(2sOIa@Q8Nun$9U|y0w5b)yK{!VyZ6=p}6d?BFDs7&CJ#ASJ@X@iRFw}Jl`tXzrUb5pf3M)MV0X% zZ1DeP0c>AI+jhP8352rC-xW;yCuP7^OW|YmC))Lp&P(pBaWlRbgT|2zux&#_uFty0 zoe-g5q(K4HwShPt0I&Tjrt!cl&^Sr3UP6FRtE{aRGgbJl9v$s>FCEhti$U&#@+UPQ zUDWzo?-QaBym6!9*q7xWzwLPack&923THX!W(9Iu9c6JKboTJWv}XpnO6bG&@+uvR zw2lW`Lz4x78h_jAX;BeEca!exf1i&h(%Qlqod^MLb|hdwOrRBTh!R=8Hc^F~|D168 ze-;27j46YIPV1o6^{Y_G=hak`;beVM$wQExJuc40Qca=kA)KAG{`XB)uDC z@_;3U%h|-!TYHIV~5TLrC>j2oGsodDnYQ9SS_I-O3O7(_837qlq=krR}x zm6b|7QmJ=ezBElJ)wscj2)(1qGS5s8X0(7$bUsRV&k)^7MV{RN2oOII8>XhFO4)@; z{#JH&eSd~q&0fRq z7|od9;@Guun$?>0E7d{iqQ&jJJa>d-{3^x>V0S_*7biLhcw_7#6 zKu21$=3%*2N6~(|-w{$UbbTKbbT9S(oRULgyk#zl*7m}kQPM|p4WT^})c<^pyQkl4 zz)CmIxK%c}pJN3{lYy>sDb=++DNaW#^Bv*P5+z4MX%Q>bJ=xU7b{hMYd^v8P7 z4oG{FPzIvXJ~wjJ6LRfNEfN*`_C3g6=Pr^M_oK!LnC@Y?V*q^wPCyuD#ZK>3APrvA z_}+;KRnip${Z8FTuaqskynklBJFIt92zHsEE@K@n$+*FVk4#o>Vt>!8XD<9@ z%Im;y^IN)Zp?km;?Jf(S9OAW!|G#Qq4#n(N*iM+m@@?7#@d1q-*1Iet3e`pTnOs-% zzmL4aqH@HJ1Q@`^rgC&TJUpC90B5B=>iEfUz{c^>XE<@8pvu0r90OFwxBs$G)55>N z&IWsktPTobLkSKxDu4*62@G;?=nkKI*75l>?Ozd2YFAM)9m4dYY+#xa4aRb2s7nX0 zwRg`y=#p&sp98W@ACk!&H0+i=J=OqGQo>WAegU~!ic)H08K_XCW`&X0(Ef7i(j|T} zKh2eQH-!>WTAToDoTSFsGvXvt!no4t#H_>d0Q$@J8>sSO6Hr~*noUN$mSY1;H+5ZG;*vxGzj9_=(ui# zE_u`9>c4Yyr{y{-?PXbN+{Pj@Dskr2sgM^++I1ik?cf5nJ;2)i zi8_!I(U>>D=-Xs+Hv#X2cG__}^gKX<4+;uE0t8bmq|0FwPlsA$Ps?)qE7x%a;K^4m z)n+SC=0fSmyhMkkVY#${$`45b(UFLvM&~drBjJF>GbfMEPI>t!pc-k)ZSSDRyajsb zG(E{`98*Na=0&9*yV3FEI`rGc#kJy|q^DEk0rA4LMq_qV^!~}uKaqU4cQvday_L=T zG;*TkzNrMq=0Jwl@x8VT_WXUfa4eq=PpFzTHKPS^2J<5|+a-A>sUBawG`%}>mN?)! zT=_5Za&~1@G>DNS@u!bsN>Tf{0o$%w-eB2L5G0T9+}+UZE50`&A+ z#*n?5$r%rdafd4MhM}Z!logBA5Df;Eae_+?jc7l2Np7U33LZD=~ZvA@b`KmvY zKmR;e(xKD(XK2U~dN_-M@Uv}b%iJ1S3v5##Qw1+8eQd2o=)*=Fyr1V^XLqyC4ndc> zD(3@;jLyzZUgkBBw!U@ZN#9SrpSWP_I;4l=p~D2*b@{y&h28_v6M`b$0pcB`+oZ3V z%R1%dq~XDPyM2yQ%m0UjJ8CAPqX)~#`N?bp3QV-zQ@XmlrI>s7JTpRAK~Vdq|80de z=tPBglFbv4_V-Lg?Tys9)8cqDup2rKGQH4`=uab1pH@Dkrs?Gxj&}!Fe*?@#5*5w) zO4_!SOy6*MTe~@na_ai^-YcxaG)s?c%5GJVl|4ugz)??>ecTfM2a%DeJ*o6CKLg2S zVlpTa=LB9o+OO}axg^SNgIp{&f1OB}E#U?*zHs_9M(2!dIR%X={uoxSiM#?2gd|+AByzSJv<^ zb^nXx@#+G#j2Ped0O~6f``1Im|_Yx)ht^1mS zk)rIu=<>RCe;xE6suK<{A!O7<@6hOI_(8#9Q)9tMphMZt^*>$Z4U8Xp$n!$@5~h|> z+(w*|btkI+3Wc3^?LtLpHYmb&8OXcxbY!(G3L+5+C z7k_rc3NdlUnT=Z6GX~fP$}3vO+yl4!#ow0I^Tz(^zWXB$HpOL$<^B?HlP!eFwlV95Hb@l z*dX0>DBx6+=fyA&(^WE?{Dn~CJggwdR0s*YBe&i0`a7I`S=sV8BNUFv$#%(`Q^xlI zJZAG*>N_Q*pmVj>+^%|{CQRdZ{>E!gA@^x?VqGZ%UD^en1`$jAc2D^ZN#6c#YG)ri zOSe5CDXMM0EyjZVlg97S)J8rnf%xH=lv@tgebW4JztuZ(q!q@~9HDB2@(rLe;u_(C zhQ!s?mC|F&Qj%0bSU$NnCsMM@%gc+4C(y`IwzN2h9>x{aS_pzLezSy4?QnMLV$=Du zV#@4|-AYQGA3nsqEos9|mro>*!UPtCSV;$go??~tW$#;XlIXZ5l5!zEJ6k=zX)f%J z?9UB|0-!2<0M8P;pZaDm8hc$BucD_YYY<^#Mx2TT1r=tuOKCrcwG?5?E}s7+9cdit zypXjN(HuvsCmgEID<%`huehVl-edczwa~v*t`OrT9H%sd{u1Zy!a0{|Zrl8TFD3vw z1sAnu8q2316>Q^;^B(-WHEXXRA@xJ-S%MkM;@7qNE)1mwYTSKcfh`|9+K#k($%=<2 zPpN57hSEb8(TXl(Y*+nm$n$CR*{>f?p4HK5q%+y1Q#%DsN%YtpApm9gq~V@OrJRo3 z))2nL)((H>%KZMWhnyM^j!{>{oY9>)^_g$>r;BfrE62vK`{?Uz)Ny)-qKdaE4OZwtSzeK9GtUY6EGhFRdUU%*h=xXQ2NXoj2!EJW5hH5Bl9^MQjujf zD&zVl5_s|h#e+rGa zEiusBWjBS<*SK*W_uNolR04N*7_Khis30I}eJ>;<9L1_)Bn{`ZMT_3;h&exQ_P4D@ zS&cquVNq7crQ`8WEPl87T{k1LT&K2qM5^8ltA&+;4?K`wjUG)oe}#N=oG#7jvlT^% zU60`sHxF(5sPqr|<_RPrR2>{aVi-?^W5E&IEpw*S6-Ml;#+6R+JkabNI4BlFbo&3# zAT!~(%fp9-%@?ap?XZTBaL8M4=LoEqE|27uV60n* zg=lDS&uEDsgANIM6sz!nw6U(kRTXH=L0)caM$reB>E1oiA?UgAQc6+bN9KvP73e{(`9z;GGgCzlLAZ6$B!QE+P(W( z*Dvst8bUV3?ZGzcSd~8tYlv-n%ly~1ID6o$*B3&)Fx_Sw{sJ!E)WpipNajH!3YYgl z!U>ReDcCMhDI9-x?l?FObQa?^zE*?lRVLXS--0p-hJt1=a$SbSD_s^5-=OXS)$!VA zVy4%?QJQx{STE9|`Xa)m%;nk7$GVrlA5jnAtn+0AAnj-}zff-sGRG9JfdrbMc$a|} zXX>`_8a#KKa$it+$V3udL&3?-$l^mgA_9dILhchb)eP!FXaJyz{K9`D8{91``-+q3 z7#zQJR6g4{fDaE7kS_GBsjB|7>#14dMQ5J$1OUOAp}Q*@e4oYy{Z)Z!VLA%-HkZSu zv4q9XAGswj9g)WCKBBv=fDZmJZgowISfp_zx8^Y|&W{L4a7Be9sVn7e=!nzqoUm~Q`uWlQe(w0HKIb)BhbQ;1uI~ z<>P@C#JNVcFf9QsWkDSEREv|J#0iDdhKnADzKo>1;#V*f-3o8s=wipEb?=+yK6LoV zm75{=(H$OOxmwrsnl>c6y}YVcD7eoFtA z(Ql`TS8Te`uN&)Nd%&9iC;f>U>#w~KBK)p1zM=Y&aK@n#3#hWTpQjRA*S@JXTl^c& zEU7|sb`_-ogdo(iIEWCAjc|JCCG>3``p1slGssn*Yj1`nbjFs2>tyuf#)AF#{>GL{ z-rTgYven-XPYR7?q4sk~Ri9yFFDM=0rq=HIWKLWWOjjV%;9Lw7nych2a|PvU38|^9 z4qL$qjfNpUr2H2b}w6z6tg)6OE6##NQC zFhYeXk5@rRC34#xN|QG>n$0%p8xuzcbews%V{w}3%%A;G;InHH0}?fAo*iLsw-(l1G3C(qUhWOu&Dgi=@bf;tQfwM!WByXF zurmIQ)PVz4)8$JG|5+KW1L*l7e7@o0Gig(q-sjuz*88ILtZwpj%Jg%B^HMp0BWj3(ob*;tgMPU* zC&{w^JA{oyTIc_t^Jj>+-PtT~P+dK6M0EM>SClpAjgB8X)=|}b-}&@uNb7{FC{R*8 z^BgvSP7s~psEX(XbjANsLbq92sWEEwr2vZHrFUTQMnVFD@X9I*nm>RUDk>_vm);^@ z`_Ip9X2}c?3$5vej3;nu6KV)}U*bS`kcxX06m~LK4Nf3*rK))^Ux|v${r{+N97Tm_ z%l|~;{-48-uLMx3|71J2(}oVyBke@ObLry6UrX?NIn!0@apIltH>fDFh(#7sW9sbC z?qhscD#u(BBxw2h(G-Jyj_9aGUD7jX`tQaAZa=FZ`udeWX&uBx6Bm@K3&8E8fe4ob z3;DqLNeEIvrDpor006PH?B2S^SL_}R00B~k&hX|z-LV2R=A1uw4t?Kdrl#8SYtfp6 z|CDC7wXs3HGJVPBAJ}?!|9Pq-ROa8lrRU}CmE(al5YM}{^@!HUhLKbN&v;i;iBU%go0)Sy1;;nEjmpp*464n*wI@guX|%e;oy< zFebEUhD(>zO?rYF3P*uvXYW3<(bLN63i5enAG*{yg3C0ORp;b&BwpD?f&E7{J)>9|I0c3|JB=! z-hcgi8@)4se5Vf014Xfv(9YHsX{sEcx}@GM4`!)=S!5ep)9w z-+Fvi#A1L&Yxh|qZ3kxj!*_aea{J;x6{*S!yfH#E6Tl`ewtR9en#a%&{P*u)tSB^o zA^|Eaf7jmbh58TR8&v}iV!*2Aai}z2SKRLw1?s5>`e{I!ftUPj%XBdgzG-Rk(y-+M z9*u>7K8MZWyML8HsB0(P-e#`?<{B*wz~}<3L8yW(2sR(sicrwX`n_s+Xb7_X{EQ0{ zxKC#F=7GLoRwC! z7nNucZsqA>3<4raoo(6FbyJ^E$AujexDyRV0x_{_+Q6Wqt?j~v3#RM79EYEGZpC0Q zIURjgYdEjrn{fHtag(4Y)+w9dKGp?D82JgDdS|^}V0jGxJJLn`?*iig&u#j<(Hh6g#r0J&xMmlH^1x&8F!7IwJ79Au zcqbjR+1)hcD;nj?yA%lTZ#Xi(uCCs@ zuw`%Q;bg`BA3u0`c^l61hmRorDK0D=9~=9s7*P`gAT~a}wl4c3D~@GB-wk11V!rnG zlYDdynwri)bn3xZ+iQ>{013^TmX-|%V!!K!3lNPtd-lL5W}&;3rO(a!-&|W4aQ{$t zi}-&wrNkTR^gW7en&$BxXiWe;Gl(Dj(AEZK%<;sD8sb`z2PZ0?y_=A*>C;uEd|(Xd zk{B5tcH^tHErk;`9OqZk(LKR0OioRqUh=wl(H&P)xqQR9?EfAIasLK}Cu`pg{mUg}e1oLO>JCy~BRSL~)IZHypaI|*eMCLVV2UR+qFTy@(?S9N*;2%W`^ z@53)*P%*Y9U5+zd?)^a6SL#;=eLoknTBx$gcTWMVT66WC42FYYjwrweJJnvM;qXNC z1j5Ybn5n5NU%f3XffrHm?nKAdT`3w_T3#MOUY8!d`LIarS4{85F;-Sk3B!f^@ZrOM z9;+HB?QutF1ZGzT4=5TLyc6Q(*@NX#7tQI3R(r7bHzB-9O7h@qveggYQ~8x@7|z|G z`+k6jrk~LqL%fZEOX1iqFj+=9&u^;-{Kpu3a?OfV(*in*q2zVXO=+pXc7myBI*w<95qQA^$f6HButM06N`#o|K7Y& z;LejLGcT{M1c4hTc|83u740{esXUyVaG&R8Wwo)gdU;l_Jdlyaj605u+zR2aV^@T36w-|JbU^^JFptgeHDD3w!$ZJzVjLM57z`~n+(5wkt%bb{ zdU?}TLvVr&7CWT#PgryqY_%+sZ{5N%jQdCVoX(snyD*MNWdrFfy2OuS)O!6zHv`*K zy8PGk;wYXgj90b^3Gphp)4t3GaeHU8Q2~t(_Vl!LcHW0)@2_8nM+bwgaRyT&&=%l^ z3W#2_vyj&6T@=6y?CR>mIZ3!U9KlAMd}C$Be^w#wpGw<8CPfAKEf2HAPz`_6`A#^ z2*7-S8Gxnl!X(bC78DfBc^2We{(4Nz#?12vcb?*8^hZ$de(oi+!V$&QKP`Yv<^&tm zdRTUM%UjzsKds5+W!YD8pZqth|L``|2(>B+O)2lt0gr1E-W@mc#3vjjk4}QLzcm-?2mq)xKyscwO~e95MFn9jaL|(w3Vr+b8_u}} zM<3lSDT!O?LQCvbm6xY!Y#5{_$(2OGCM1MY2S@$ZE2Gw6U}XHJD4QAjESBi+1!Tj# z?Ytev7@8E2&6wNhb#`}i!-;utCmDum51Lz5otUB^ltDbXefu^rkUaC!qKpi`d?x*e zet?jj$2+hxkYWW5GfxE9uQ((zLbecX>PbbG-p?=3 z`@GNb9`A9y{WEjSP~E@Z_j@hpbzbLr`sEReSyJoF*-G_0uY9BUbiQ8z@s`7szmF&MooUEqNBF^iKZqhkXD3DPHYP zyKW~9tU92trw2%0`}Xbc8#k6w!h@>8KeGu~UzmR2%H_*=OoW?_hR_aKthY!sanhvM zGYwUdv6L9S0`Fqyd#vWp--n(94n{5oTTDJrfZb*?><+`}F+1kUD<}-=SB&UyY+Rhf zihRq(rCMKT8+d<={G2v#j&0Pnd-(Yw-Un<9aC^12k-S;0G1yi7r;A8=(#bn_?=}dY zL&V+7SFX?%Fns3~WXd_lmYXahrjjGMT!NDdr2!Hds6Drk68rV5;rC4V99Ccz@u+0X zI>eutIz#(tYHOok-Qw)rgg+GbEhA)$5hPlSXKvNBkhOF0a@c41;Mp@g$8Jr$!wEa@ zWyZbE(VZZes?g!p)U5Q^zpbee z92qfIlZ0_<;nCv&Br7Y+?^zNM5b)z`ZfC^zZz=ah!R;pcN@3fpACu-Rs;`fd6u%z-r zjgi!wl8gR|Mb$FpFE#bw*;S}tWAfp*#oFr~jBh2x9=7rDNRNnE>EJLnc+1^8Cp@OZ zH~9VOE9ab>-*oj->c>r;>QR~IVC#D>6E8}Xhvv8s8qsq4PiKxFA;w1LRk_D>RL?!B zGTPd5a-Sb9s%A^x*w`4_)OK-woPJ94Aon?gmCqz4H8Pv!1>tbFalv@+-Me|Yb1lD@ z)1{Ixi~g|!(zyM_Pv;FqmJ!nHpY0elV#GC8ZWVK%6s50_4=f)7N$UGXg}eIDW75enx-KjxhXPo1V)qiF8Aow%S9aJ zGBC8AYKlk+KEZbH0{i&ct%g4`-Qfl?7A`9*v)aWq)l=HGwKJ7-271NqK!MIxTqRNe zvk|(HFdH2`ddIF^mlcdnB4%^`=?4)hN;=?uf*{Wm!hmlw^#e9Eu*^y8d3i>rrbzHf zvWEF9ZoTSN{2`knJGPJIawe14`}yT%GzavbgpmdNp_ZPeg;5%cRHD>H!-p@h`&hKy z^XAQ)ZN=l5%y606ln=f35Qc7aSoMSW9 zB>i??se`2I?xv8JG&IONRGl>+mBY(5&RrDCZFyGh&6rdG_0eL370ellDa@$|4h)Q# zym66G+FgzNcke~uruNarj)wY|yM;l7rsln2haNtDEFLl9Qc{vol#wY>VGaumdx@V_ z*)MYW6QSNwmUA%Z-O{Gztg|rO@Z$277q4|Z)Ru%k@~qf4r!AvJ7#n<=HA;quhsL3O z(ReB}#blGdGUnxZX9dSTR5csTz*_?Y`;^6u-RC{GFvtH&p=Qq*uVZ9F;U9foZ zdv4#oEF25avYHyjH6^xHhmU&gBn?eX#;0Q&ju%ff=QdLRLNLC5?HXpi3%2d^-&H?u z$(^C9^0#O{2X1?P?fUhKNB1-3oQ=wr7jU{T4E}WQ`N_Sfq7o8Hu)F9aF}b?B{ZFVLa z1wn_s?TtP}Oi#bzg02-MOC?Th>QUDx%d(1fDKW9^(hBOl{G}gi-oCwyEJ|G5oZlxH zM=2PwHmadfUNOjhg7J#_(psv5=9ZT6W5>ocCqkQ*^shYPIwj7`z=)+a?<=>T6at2K zeEy908j$!tLuWDs)f|-wZGo%!v7VLaT23^crPuxKqd$H7_RZkit9}GBD>sWXPHl@s zpe0(+RL#t$yS(v>oxi%E-vrARN!XW~Qb|_3UqH+FgGMowfWlgoQ4H_W++3C$i$@nkS?fYa;e-kNf@c;YzN%Ohe zOjc7&Wc9R*XOAA3(D{^P$+}mDUYL4tL3QQhUOjpU zlAd&Lke(@DNfVN<(Vu8*rt0V{_B2I+2)vWqN978?CTC~MhH>w%*GBiBBs*u>6+0s{ zhJaKRI=FUH45bFYq!mZ`lz7Dl*|_!UMYeD8GNX*PoMvi0++K}PY-U-8)|Gi#gq?|_ zId_=$#BfwodwX(H(xQ3uVx06h+nQ!jJ!L|QkCm20*#sx<+Chbk8Qo^^ucX`aRyrE;ypTWQWYKmgH7@Xpr`S@^>+ki;C(aBZDU^t;>vdPl+%! z&XC(2JJ9N)P!mKOthVe~gWy?pb4EyGJ31KKot;H}`?j{UPdnWRUkI=~Ghk z9QLW^Pb4D%A)+5hHak9HHKi4O$-9~AXM>~apFDnyCd%GEefyqG&^qvCGwYaZXD z3%@5w!YH~nLbJdFz%Mj(Yptbdgnw(DpN&9v_TCX z1zKV$wZ`cB%dN6hxRKj`Qw0g#>KL?GoeJ=bYCp@;(1M~O-1QcB1gRg}Ok8SdX&IZi zfB0=|`G|p(I(#as4M-ng8t0rUR_HJCv4(vC^oY)LTywayQE~9_X|yp#3q20(-~WEs z!_%8grUF%Tg|ki1LjP{lr~oI-{r)s}tVe9g=XK%3uA~+Njnuww3ks5DoJiMmA^KD5 z!3A`Apfdc5JlP*Veh|iOO{XdA8HviYZ*;UQy;a|MSw^sRBp>CW(p77TmLz0gEUy>HN1(4f!<&{QFx^MVy) zewvSu6j5Ojdn7CmFIgh5{DynX@s>S!UzDxdN~uDx!!uzYfJ`s6s3!NmR%L7l37NBU zB^6oa&6{W9<2Sa|SJ+BVQO34AHB}f63+y04Ka)z9Z@`&xTbQVnfX0cNTX{KGUS z;040DuJ@nC)uv0?vu6+R88uBLOXYY>{Hsf2m>C-Lt_WAB^f8*cw;PJ&}!ZYAovL}1!o?28x9i-;L zN=mC%teE$qRNOm8rh?89z6AjcV6=ScFw*+K#}?y*vcs@pw0YuKs&w{LL+IvS^8?5FxuVK$hgbpjU6)FiG-LAQBQZ^y2P#KNWaZ>gQ3JXJ zKMWT;oR6pv5u>-XGJWe8Zt14T`pf9{I|HvHrU*94`|a6hux#JHmY-%F)<1Xu@#862 z-C>B0`S(^h5l}PBBg4pkOVPu#v%Bv6Dh~*Qrn&QTXy<9CsADvcf|<-*;8EDSf~g3x za?|dIK7Uvq#VXZy`En3LIHQ-;v*!z?T>hC&Wl4<0TR(VgzVqyv9&E9~pkYkke?TM3 z&&wmhXUNq)ENmnGjiyBiUwTwM=;Fu-ZTmy$4wTIvyDzFo*GN_QdCQldfEAUS zYd}jNrxaRNQX)TKz^gZJZn|qIOmgx~p`5&~W>^wZwS}_(DrFr7C`dF#8_^rYl9?WIz3E|*rhuzqaG|jk`3k#+DlcCP@eGJ@RQTAHEP+w9T%4+Z_w4|b?t`x zMXTv1e%|T~cY=ctB*2tPRBv8JT4y1=+Cya3oMif4y{*#3*!X5)p`hvv*=&a%`P$xP zR%7W+GL53=v($LWUMTTo!v8J=cauW3wGT5I5Kg4WrA~U- zz*>l%>${dOZr3;M9aURWnR>*|#B-LbYYR38u#K4Yy89^lMtyK%D;y73#A-Af8k|cF z!DGC>F^>KfACmu#*&iER)@{*1Wnj9h)gSF09T(bn@Pl8yeS7rCk?L2ku#AIp`L4Q} z|8>{h_U{?aFAa&~#5HT{QlzcM>Yv-TRd+GzRL zo&U8Xg%5nF{}Rj+sbfK1-__JyQH!PIw9WPiF0^TqPTvw==cc=O3L%uqALSs&6`R-Z zPa@A>9BCEl&S@x4Kh?=#5P0Byb+v+6OfRPxaD9M4RmTmP*#QxT1F_rNn;FIXO1INW zu-;L(@ha{S5w^v_!QVI*-XrOQV%=5zQj+3dgzp(8Fm98(g064fSW2<Owb_qTt7xa5{R-thW|YkI}&Hi@K1?UVaOnl%ip-eO47*4`f9_`s&;Xh|eZfe@9J zEct`f^7`6rlnQHCwWXBC+36<8d1%*iWYFay{TRzWfP^#k#ky? zDa#w(Yx=SqJpyFOQ&eAma_X~Tn4%)@z^O8=_s96POVr0D^GM5UQN*CyyzqMRxYo%| zAw!v5utO3(%X_AZN*?5XSWijSrKNLejmaT+jl$bwu_i)+`4Yd|!DHgQ%^T{){(gQU zk!Wak*&>z02|sSO@AEH${riaJ>sBRP~OB{>xerRcKobVmR zMHB!isO6|@w3`+SjXtLZJHFO) ztkhwTO3}+hzlVufWA+q^r}~O3HH^?HhpgOYTuo0u#l)v9#v$SBS8ZbxlZR8pmIgoj z{eT<~Vpdwch1KK$xnU$0jRsH2U43Rqdy(VAx+g~{hi}fg8}u|Goeo2A{G}##J9=$W zyZFu;CQPCjrx&Mx$#z}oc+7P zzHGZg!i&lTiaX8P%d_9*3|USK7+crF?9f_XBcn$_eD_IC>Wr9~3m1j;pQRe`?j<*n z-fMcA_~kwfEAQ8|K%PX9<=8PHZ8|%rRLW*p$EA%tP&qWa>IT5_+Mz&~HHYsAy39EDTJhHoewLN{lpPESd-;g2aw7pzz7+GRq)c_+u>v6zAXY|__tJRoy zG^?a#P8P&wfjLFt)e)XB(xcl(0OX%=JE7ACww2+imw?se^u*<grlK!EN&>C~ge)X$c)A>C=Av=UpLY7pD_Uw5>is<(ERUZP9zJlF zXJmJC8KYusO}QwHsbG0f#D+HXinQv>nqfCsfU~P>oYVLL%Ilq-AMmH`n#0US z)6Z;vGWx*W>ZuFqRH!Z&fBFC=56e3w28Q?>Q-uF#_jT%D1yr|1rQfaE`Fv2h?Se=4 z*G%fZcrTM}3V-e}6e_YH#R|N%a!L0a6J?dp@OY<9^JJXPXr;EHVT!i)iYzyWl`Dsr z#dLFK_U+Da%eUW1!Zt$k%|LDQ&r&h9HaA;F?vS&PR(?aO5tQGkCYP=DM%D2$`%NM&pgTQB|>pa+wI_J!j!U8y8KgOzd5f<~%Z%grP0R3xUlzLVs5pfucWW?sa`V z>`0@B@qzbi$OE09t3&BF?t{wmv-U87q=f(a`7``SXK|Fg(scJ_AEkSYmsl*N%IY%O zWbF&Me_iT{hH}^nfmYs9C$zm}>3?W~kyrDl0s7V(&_#5(!431&|!@2Iie@hjPE11IXNNBj1m!P`+Ro)R$(8mq+}8V zCYm{9b)%x}mM&$AJ81CWLibI7j~zE|(!_~y(%3_tZ*HzLaiX(}3&!Ft|NJL2*0;zH zaGZd#LZY(3UZ(6ZOz~~%&0tVVQ#07l@AJEeZS2+=q-YicjgnI`<@y?`20gV;;W>tc z$OSw<^ow3^YE{n0o0c!AkFL($bKP)MhUdps3}^{bbQN5JG};-k6Yr+Kr0La3Cu>&* zxroDEhBqYYNWF0L=PBfLW@g+jfs zQQI#tFuz3FhdaWA0+@)|S}U)L7ceXOS9}AOS_vZ&5rTNti4zQYh1nGB4jNv#FDO3I z^_>a}TWn{S*xSl;wB*Rgt04+p=)mA$O?7pVFan<|b(CET2pX3BC~NCCb#)7>rb*v8 zlU{4wBqb%?IL~;t^{bnBvownqbO9(awa`QG(=mseIUaa(jK zYm$zRo2x6v<3v4hYbclkMJgYaZxrf~uex*RQd*iDw~_QHZ^ROR=!h9KJ^vyG2%BkR zju5Nxw_e^5->5z;N~iuWWBO@cKSLBRmLTDl@Ym2SJIds7$CU-5*~!j6sr)CxV#Ss8 zZaUA{J%bYPXL$I{nigTlwV@KwZ{wCNUl~_z7b`AK#;SpDR$HY%a(Zdkm~@7o-Uvn+ zW#=vHw?#+W?S zYFnc+;sc@&3bO?|5^1N}LxJ8$bkHa%u6wIc^+W!!-)QZlwomMZ?tay?XN)+EjEn$_ zz$Hl4!cggUN3`NRhaj5oOCZk?wPcirK_WRmNFRiBen zBXa*ZSWWTxB~)PS`3#qYA>LKMF;7Zr2drXnJ9m*ts_6{X7DFb9uP+Q@jTM*Q0N*|? zm-i-iLjip-ofc^8>TKd7El5%qeS=Q8gdzI4qb_2xlut)sNXWhW_j7l)jENWw4FiJX z@w(F)`vxHceJ4#s`7TQi>-qyyQWnuXNz@JI&kxwJ;ehN?VNc=I zIUo!8762+nW-y7IoRSC(iHQw7%L4aJ=o9$Eo8qw;9)LwLT2=M!n>Qe$WbIsn6AeFk z)3yk@w4zKGKhwejAdAAn%#6LFFEnB_UJF6_k`6$8zuUD3@zQ_1mR1sqG6s8RWt*x_ zn2-!@`2PI~U8j&A6xX#%v17kTnUKa@z-<2fO6Vmt7RxnQYKIWTdRxuRnY=2u_kxyC zQx68`duYCmVjh4Z;--=9(ZIZYvbOf@scbD=kox(n&7VDcHaove$cG++0CLrE6lBa! za1zcMF`k#Vwu{QEr%V^l7tJLDrNF_OKZ~y5uDXXm)%la}ZE+LK=$!emG8PQ=5clY(i=YUjrA%LB>I@n!WVkW!Y!JN^}{|f{^!fq6mnD3gvG)~n0S)W zsuz?B-ovcu7nPM+kaQ6_zZZFuupzt$sp=2TV*cS{!=x8Mmd@ql82XBmE^a3eShpBMhm z=F0rJ{0F{t{_hgY3dPko8RQdf$y}$^v7&aRnHVIqgv0d zm(VYL)5BPJ7J`SUB#a6TvCb;8EGtZGL%3vq!wCz$D%`og)vfOApm~0t@C<7 z>I0Pw_C(f|^JB&s`_>7+g0(dWu9;aeh#qN&Y|0)4BuHbGOh_jnQts}p)Gk!%ycqWW zE3RF;M(IPZCpOsgjcq64HTd@9*WR?e>)Q2zszffNi4w{lz5zjt%H3k#Jm$6>3Ce>t zL-Dq*WmpJRAtpUt@FdNYL*{mk(a*z^2c?6e0o65nVd|LtiAX9IRj1}&Oia8xG04}q zh))eNN3Hh9kt3P1MC~BLi*0N= z8nZv{VZEL)Hq#-_xQs}|^bHmK&ZN(&Ow4U&pU^nkj`b~ zrNsBILFT{X8T$5+dIsV4oXG>QqaS0QgTLOR94TO~LUVI-rJS<-dD|f{ucigW(Rs<; zFByFF^r6YoQDZmp#u?k%H#8sISQ|sLS;FarPdc44XfWG9{N4_5C6H3Z|1vzRT#WT6 z2<8QW%@k6n4|O|H2xoby5fCCU@q`~EI8liQ+h&RnOqRy1NuElJ1kJz24CzIC-8clzFdSw!@Qzbr&;j`9tZp! z56RTF22u1>9w~`S2GDR%_>G_10zG;h@P-{q4Lzt(ml7Fa3-3@y6~I$7V^W^umU2jh z?+tyI2w{+W!NCEYgY#Gnrig;wY4Cdo2FAR_XXoY~iaQErhH)`uiw8auJ?y17NY}1r zD%DDY1Ox;`N8`HV24pHTtBWS^r4PZ5DqZjgZ-<;&?y0&c0%+sN(fRp#LDok}Ro4c6 z#fg~C*OT=e^swJ;()6S0fU9RI6T>TNhMH4xZC@q&Va={Eni#{Hk4 zADEk)Q}i&la<`D&iaOfw_#dS6GEvV@t}plY<{PSi{8;}*VwAyce1GJKUOMulon2{B z(e~!1c8mAPT3>t^%R$iXWoYQf_>|`Mcb19PHElKSQ<<$5>9=n z^+blC%i+7ZfR(^l^)X~zwws{Krl2(a>)Zt=k@gT0D&cmbc(?-oj2_yMNV^fi&C&L zZ{Kz24K^m??oonh?Uc7WG#E7X4{mqX(9k_@zdup@?ANgCY&a@qPZu^~FibGlvNuc;NUPZ|5jhdV63&^-!d8+H z5=w!qT2ZM+CHIt3?!AC!f9Fy25L5V5HubM^ae$^USEzxuOJ4DT*o=sALwfJDB3D$_ z95HTpdhh-3{rCDB(8#wZo}5~X;nZj zj!3Gqk;WjUi28(nNZBj2@?zNw@(wgw*hJ~xFR^>85W5K>s{-z=tf8_*Qg?uq7eHc@ z#RV1FHjI53KvS@^2gpDK4Q2q%m$$S425yZ#)OC+ct+ z97DghB|!dEW9X)DQ7w-}o}07==mEO;SM$`&i&zF$QtT>1K1o&VM}d>ImYTSSw-bRz z^XOl4_J1+n|4%0EUpIME(}*^@?!~^~eb0%muPV{}w~LV6*AmVz%8(Eu2ryy;PT1-I zdMCiXe=~6tbOojYlHcrOvQaH{J05fm`a~-woFUPj;@Jz^Zz<^I7~~`aCe{UlVSN_# zdilVfbet?vSe=eRv?=;$^v_p*z#Sty#VLAz!xk*)rM?3u!I@&!IhMV80um@53}BMd z=TA^LndtwjlK*9>-fWMF+b=YpG{7LjK4<%1X(jBN;I;Q2Ji;FpMb00c!?KFmA}NJW z0n}p7UTE^*(yJ}0tvxNN9!>-Kw=&3$68{4SlB}oo{Cs?3$G;_bEQfur&tU-8K|hYt zxp~>y!B>7oBy$c_@u{=WlypX=!Quhl+*9J ztQP-HHnQcM3I@*(R)IGBSX`_$mC?~jor9MZ7REAcEr(Dqw)x*w75#mMiRk>CVASNE>wtf(x2#*u=JglkPexu)?gHXw{I zU0(9!ZOhp40op`bObvlOJ|WDc!Mp>p5oIq=h~+kF#mf+|DE;)9_igq_Y}RR$#Eb%H zSe{5E&uj=pLr)bY6@zdFc9?(J31=$jj}@}?_fY#^9gnGuWP!3)>o+zws;a60t6kIF z>@!iM5kbObSo2X;K_Oyn>pk_lb3;J;w-H!G{qJ>W4J|D$gT{o=vig;9Hl_^wel|s% z9w*$8z|5HVS$}m3-$6%ROeQ%w?h}&eys8z5d8C6O6LvXH=Q> zJv}MMB4$tFwb4{iP%tz!l#vN(tY~R5z(>y?BXgo9z#-?`jq$(AX>8t#P*La9yLj^C z$?WW`nNBT0E`XlHj&uOdL=}@?S{juZ_yNGARe_kE)f4Z3QKs{&E1z+d*V!zM`kZ;& zJ5Ha5i*54So1i(qjJPXKN(0M@*+rDfrkHr-nEwj~FETnSL%0swU0 zTwM5?6k8YQBxkZhl6l^&3pc45vu*tX0-#=YU}dLBFb#hFUhCz>$qsVbG^VgHGt?bE z`$LJ9K0N#4fr*sVuWQuhL=Xlp1q&P7ssQIo$FU*itHBW1d$=*G((K?=#7zT1WQ zOo}PorrnVrvF?l)&GYC?+M7qDt7Sdor22GfJ&x6P3_!J~p8tQb|K0UHpI#y=0qS5& zx=KafT_2+0RDgZgG&92g-6U#zO-xP)n4{R|8`a)3fLnGmHYuH(0`2THli%j&GE7hR z4u>t?@yGXSPZPHPnPq?qzhK9njR7X-mRnj@vwC@n%j5vFOALtm?x31U9UHF9*HoP_ zPYB8GDGg6`LMU#CN%g~-hQl(JI2!cS)E^9M&Q26P!?4U`1}W8m&!2#cpY{)6^}SMu z>)@hKr>>~5vS6O0#1$-OO!(^~T1$!TGpnCr!tJ^g^_KfsUmc0l(H(kAQcH}9ztRAB zZ0r>M1!)>?96+1AAYXh&d*t`&y0>L8Ln#{WPC5*iFtZSn6;G=F#&CBc-mIiW04tY5 z21~e@1#Zo){Kckj(Rlr8ccPHULViH)t*Gfg zBmDn^YYZ<}y6!w=h+r7dOcEbiW{|3C#23QFd+2Gh@uJHXAo8)D61cy%oj18PKq4y9 zJ|^qovyyklN>G0d_K&eLt82vXk$o!n^x?x>3pWx!Bu&ACqYIcSR1Gqp)Q!s@@PiTE2!7L?h@q(;DLKnOLcr|JQ%>=J1Vp^GT3KbkmY%6aREAx ziGCj-GFUxMA|nHXgJv|C0N1{gI$8^5P9mw;&=l*D@NDiA^CFff!thk+Mdgfb6}#RX zWF}Li8^EM`H^4WWndwuWa}&y()C~R1AV*0_xw{*2$69yYg@xB?yKfyjz!$q?T7a8I zBn7Z6N!*Z}oSe>WHNYne1E>~YCPsEC3KZhH-e3OXW#CEzUWPin$D*1wykq$Dmx1*- z^VGsq3hYNSkIA=HD*&mSWV#s^HUuu=d}#Kh ziR8mAgZPBLb=2s6*<-3wQzr10VAJV8u`#So$ttQTmFgSt9Q)hWT{>j7}3xff`>=;YOQw8o}Bvw z8UcK<1q>KCC=_a$={9+Fe#9szZ~bq8oL~|IHZ@(9z!QD#vM~r?x!-t!Y6LL{9i2`R zwbxqg)>!^6H)?IYp3pKuJ0;lkI^R zfR9z@u*50%XS`5dL0;ZsIHSR0=(*bv`mN9SNdw!9a)$DgI4f=<8OZOdKs9H4PS|}H zusbeI3vO<1z}?=H{5xyuB5|geT3oyy;$Om7%@XrP7nj{h{4sQRe-l8&_gc*Xirx_-W9zpQ28w5m zB%i%a9ymFfGFoyO5tV!mFtx3mGTF~_*$!5RbK$?orUK-X&gHIpAI#{V}A<@rk!NgEp*4Gj$$nV#*5VrCVHqGT8s zI-oDbH8UIC2KO5}@F!yzz}NsiCZakG0bLoNY)@P;aN!)7MhYd4Rno+K*k+k z9%2y}bY4F-DhT=h%3BeYpd$HC^x0(HBpPXy!{tBmV~()HbUpq-?Ey-`2ZFob9Iyc4A888&^E{t}{z6u6)&5gGHM-q#2A>wl z#Z|rY`9Y8`3xEA8ViNVZSibQwzvLlj5X|fv+|`hjG{p0QcMYN|+1?uBDG4QZ-`YE$ z@yf@V&#<9g9thL0#0^Ms#7(UKb`oHTnxTPd@^LX|TgM2-8pO%Q6->nb?&m1O#2P|5 zFMCzZgr?3M$=ok>904dT3}gytV9XFVB1`FLA++PmM^; zGEl$L9xn(w&2CAX9ATDP3Rt37M11r1Pte)zM@U~hnAEGZkGUAx4nX^KUL@)=BoFUP z<9XbPO;g>NE%K(eVw?@LB~GloxbDCJ3(Z0m$vj<`+xfdVz#6>*-+R7Ye$yP|6MG8J zmSoq^_?NvOl}nFqj{`I{I#A5wN;=lpg()*M7{iJ7mKeD1tc&)~4lGr*sZ#zFwRj`V zBsj{KAaUS216{=loE;MpoOnY%lPKYKUnlrBVDp>N#Cp$8+ zWpau4mTXXa_Th1)69!w*9;Bl4K3au**J{$XMZBc~e7(&IE%$*a;zK2=Tua@F^XGNv zVi?{lTAvIjhnzio=4|;Gb%O%;M$4PA*a&)Sv{xAIl-jxQ!pec*l9x3?uN$bi4)`09 zuY(2Sm9eu@=8Jljjp?nuN67Et;{*tE=O=r3h^q|>)kFxuDAnG^s5Wm?Z$|~EYQ1Z| zHyNyqq#DD1no(&s_=!#;9~_yuYJV3%3?i zPL*`T?yLcCQ_tklbF~#px^1V3v;}oB=7|bHiNA=KM^qL!{L9nNuv+c~2%BlDfyvy~ zU$=38Oa95l^EJ(ZN>9!*(^7l7`oX&@_4Qn@h8an|6y-C51V`ZC!k6!B-5W95w(O$IK&ny*06-gRm z5Ys@9-xDCYMK9sF{%+fx{1QvN78*<&SdTD6s5~?)j+*q`yRJLljYO*nFM!=e-}KWd z&m}wC$hp|QVS3NU#m`=NIta~WXec(`c($C0z~L$X2KgfxM}tanlOU0sY_(CFlb>e` zd%n0Nsr;eWU;}YXBLm>Qwn1=jEyc%L$DKHahxb3*Y7X=4!7+_I2iD>z$N{z(*k1CC zi4%yoBQFUHv-YQcw6b&_Dj7`?j-HA8(v?w=1fGn|%vb>tYJeP3^vu}uwJl{`t4rA! z^qExq$;XJ2a_=1p+!p%`}*w-_W$5U>RPd8_NwqdB(}DFXc*yJ_QU6a%8$npMtmIZ5Y}#lh z47gG?A-5ygZ!E9PDVya55F7_9fA@RUZ&BS>Me!tvo&7@I}uJGzq-V7jLo4J&qqkI4;R?uwaTpFWa?-Zk>J0y1ALV zz}#KbTfN_9HTA*f*<$@TB&qP?mbm`vNc*u2{sL^1TpNWcqJht@13#TyoItd~73$Ey zi;Qw78NMAYda4aY<(^L#0}=cOZgO#ws^f+Ue)&Qd=y;UEzP%OILz0(T#aj4)@AK;T z+`0Q|F|v2rkzv9w`|*vn!WEXn$SvuO8~^-8xAMgp+vK`)->ol%`zVkMr=L=6>2o>K z-TmwWPi$13)H1is`@OAvk9z+!4&t{d!oR9v(=j^k;*F>tUS!QcUl_N^JvHQmoxlfVx zx6HF(RROiYaT%f&skr8JkVmh)|zpCbgxC> z(~!Tz_=KQAf%*``A2L+O-f+_}mNu8_YfiJ-Bvcfa{TZ?rzSDX09%%mFO<#ZvnuTh=9zNjYkF=KS5}K;dE;TPtIZ-e6+I;t_h_=S(A82YXwV7h628XI24U z6}%4jNytsh_Yvtg+q;{dPGhv4hxtpW{=>aw{i2VuN_Yb=(VV^yN%SwCZ?8_XvEK~k zEa~l=+F&$QfBUn_eO#aK;(9Oj+t8AVB$FW#<6k7`<~S~~4F&aE<^WxvyB*n^3btZg zU2o(CZ{&5SQ5sQ9KR@}audW3a!1^J7uSo+N?Y9l1^J#5bJoo;B{`YrRVO%lelL;E{ zExvQ7S&!)3aP=l?xhvZkcuW=^3+(IRuO0)jrrKSHX4DU*filXhjWPE#A1wdZd!0}l z?13z=l~}Gi-;1B|ZFMuYR`zr{i%A^{e;)ont#;cddU}%w3F*O2NBen1nBG>m1o<#G&A#OetL0o_MOqv z{Pgef>ED0Ge<%J*f8Nq#U-Ozj$ZSSk`~ADyzcp6&Ln7j5o=+k!6L6@!tMV&))!*;3 zvcK3TdPYQy+KMkzKK8%bXbmpi>*9QqRdvW=Bc|$*{)#tV=T@9hmWhRVkG}GX`ei73 z!fbX0rD@V~WUNV+kkxK`&8g!#eyE>Ze77H z^qY3mLHM)xPWX!}PvX2jmwKyC47E-UmnjIZ&-{{CX=K*WqMpCmHZqE=>@d<4b6J?5 z3%^Y0*3Pfa>74tsW@mp|`+ADHu(Z5b)d8HIK7OO8o7OTkgmdD?CkJ$5gT(U?OXPeT zN5xob$xk9AYcjtiTgA%D?=$n#Dl0oD!LPH0tBWMfR~GWSf5kQq_dr@ut)^loHtAQ- z0>IH>q6UNEZs2i2^zo+csAK=<4?gH{WyteB??RHkt-2aoTu_R_Vfwlg* zrtbN|*ILW2L>D~77=L}ZRCN6yB;}oEe2TDoYTANn385Gyf0jop6gjv>^or<--MJ?! zpPc_SF!8J$pw$c)6=7ff{*fe?`=8&ej(Us#jgXi3g79ByWX*;ZKzXzmG7#pPARmx2 z7cT({{tKo|&YSn+hmHbFX2*JG$9h~~aef*f`w>HvXxle#po1*?$E?LHtZXA(`^Rt) z&Hdg7zzV=Wxd3h7D!vKlfG-j>%r^TAy&lNaODkI~ooaTq$)jX~rS;`|n9Tp&Y)xV* zhk0gR+P-xhVZ3mCYC6k)^6huYjy+mMIe&=TpS(z0LuFDyLOB}zv!n2Qh}Q}Ms-p>E zRC5v^Gq~_O9&hpTtlFP0yF2H^$fx#4b*Gl0SI2&A{?Xg{vsnqV>Sf;+Ff1N#sjkwx zw03QVF@njEdp#e?)qhBasquvdX!Ayb7j1WV5|-Mv998KK9djf->>w0fKjXvoV31Iv?E3) z{`6d=DW!L_@GJWimDqbd-_8AY6f^{HfMoaGQC`8U=8 zaq0aNdczkHht|W5pM|aBs&*b6P7-i^-TeC~Q}wkq9YJ03uy9Su4xJ~UTHAK5#~9C3 zAGTAn2MS)s1$0t{%EImW6%RhYG>9H{BGZtz_7-pE-4jz zucdBRJ@Z0&(`dBLNNS1j0%(jyhv4=?xyRnwL57V9iD%cx+C1_hHfHbZi$-#8td;dM|*;>XW0aFmy2pgH4l9`}nCq;b;zV2VTAt7nMh+7ang0ARTU}C=T%-4Bu(G78d?1th;9Nmop$8)9bR?rO`oytY5Qam|3nXf!Jkv#bNu+1J zB~l}zTM<c*hG!RJT!QBoJj9?cH7X-F%hC1fg`))K~Ev_ciG^qz>yoC|i zP)=$_jy|lQq>76mF(ENu2g2-sGyI7#yu9AkHEkrG2KCG1cmT(Uf&lilZv$6wX7_rl z8^>vCX8&4vtd&Qit!vqFmVtGvqf+v5kb4`9D4a3)+c0+FEsHcJ^w9SaW%2jdQv(jsTz84j)Q(*7&JFI{`=i~wO6)lvZG0Z{7{DY-cs!*@W8S(oZN3< z`4OFN<$-p!AfJ!PukMA5rUk{T>t~_pbpBI>i>*E`YxA*##OZS}-3G8Q3=*+}za3p! z>Wrb;19pQ|%k$^w&G^g^dH0Zo<~uXntYCIdTtoxxn<#}#H|tyvtmAk|?1SSmat$FhFDd51FL}R($0jRX zbYjz`0dv?H7m7F9CXF&x;-Y#J^F3yFJaP7OXz#LOOY!dUz0R^s0ZkA}>V`Hj-_UK{ zU+YG6NX>4(>SmXRZg1?q-_4QAwZ%H2$~MVx%Vj?QydPNYz;~dvfMn?$xnT`IJ+4d) z#wAMh)3Pml85m)bz)|*&rN-v+6xD?6HaJ@Rp}?7XU;wx0#y^JE5yURo!vxB5=nqev z^z?KS-j!f0NoG<~UJnZ-PvHb5OeQ7O2iZExLG5K$^3qQatoJQULig|u>ppzacBQh zQZmuY^bv_texU2whfbX2Vgfd4i74VfRS()TIW9)Dt2pRgnr4Y42RDOvsaB^u_Z{;L zpVPmi{qU*T{u_(@$@K$P(AB|?{cA;Ct*ajY>$C4S!n#_>zD7(_A1sCN^k_bY!@m5tH>+7v98E?r5%8T)`MUAGX)fU52feuFY?9){Z zPRf=dx_ZciStxb6!R5g$9{OjH*IGe6`E!1&?CY|Rgh!%Obj|`4KoGzu*7CL1l$?%v zCSrcQRZc&P0Ju0)`eFtJ)Re2F>9?zVpqKS(w6#!WVqzxL= zpAqq>XF8qXFl^fndm?BY_mM1o*{|*6!Cd(@&#BPraHi|YykKw;iQlE(9_nzpRqEIB z4!|YEnpb89t}T;{&yRI@EPX(ukE!|Xt~cNh@;!pxE;vyWH^G3JYvjMV91p}}JiC%B zw2%DlWjjf=v6Csh8s3HN?e(m z?+<5~Z<7dsANm3Kfu64%*{FMe^r-` z67d=@P?wHjXL-?xXvQ)D?Pq1#bFy+pv_vz=WwUVl!d?F0q^NpSyKp|gT9Ao)z%eeF zZDi7~)d$P6HN4(jr7nlJ3jIlO8E*9+Mvi3pS?yv_U0d9A%;D}iK_<9t!Q9bDF)as?O@=z(M|!5M6lLuC=XBz)te)OIyDWpET|v_QfEMWP|Du8c$u&gel6 zHe(n&*#2ogGsi|^=R2-y!UUqI?qM%=?*VKF9DaSO^D~hWUD7QZE!z5?WLq(1K^2)@ z+u@BxK8f)x6DY#{q|E!O$d9yk*JiveNmAMLp{$OIok8&U;(!KqD5$X|d+G7Z>!Q{Dj`#38n?JX>sqT(skgh-E^MiFEB-Mo z%SeAVgyc(oP}teS?@M^ab*s@_Dw@7ZcAnN#?3YV7!gll1s+JkF7=c+1i&qEWJ^vba zc$wXtilFatYW#@*->v-MEHR;2Eg4Bh^B*_J!9C)uLkI`8{l}8>J$2QW_A6at&$g6j zQmeMBfCNAu?U}Y4Q~!(A9sl#4V2?%A-zfgD%>V}jzLO>`h({lz&a}4!ex>PapVlZ_ zlAV;AfTnB~j|I0WN{{)`y=mive`TE2^+Z#GZ%|0W(c6V34n0jhJ@BNC(7XCYZvhOad1F7w#04HRMiT3)o?VWH6t zJ_{B0K#X&hl$IJadpbEey(B2q(N9{Jq4K)Th+FNB0w4A<8~L706qmOOt#rILl4B~- zu2umJ(y!F$TqMfzrwAXEICwr1a?kkSEhC#`Rj!-1HrA!Y1nHRHZ7qg9>OS|Rer8Ack(HCj67mdJy5W#395edNX zk*r)h>V}4DhKu>x%_=%NS>cCqRflnhRf;~f0-L#a%-Gc_G8Xf|SL;#89?qFmhc|iLI7ndU-`R{mY zXtve2i9t?1UzssGmB;e>w63k?V!N20Q*l+pO#bZeE18_gn=*ig*R+ih2Q6RD>$as=j?lVsqgp~ z9%ax@$v}CV{Y3SEsfaZIGOWl$rj^_=jk#jI9or83*}^_{1|!(;s0E!R<8ni&{XB23QJuj!OU8CdS6|{_i|4v?@&PJwN^*&?!t@?4f8lLL9_+-_`#_371nZt zFI2jCDp$lBmR0KvonHx8=P~Gk7RrNoILleHOyxP!7yVj+q{%jsqY`(<90f~5-=Wev zY*F|)I#v!#|6;kjt#nW=g2fj)Yf0{UElNlv$;E*>61 zNi>c-iZ4LCi=-#v2!a7qc_1GhbVGt1Y}%b0)vSjv24$1N*wSI=e}L6?LS@p|w%TV# zfuG-)qDC9HJ7spF$0>#89oKqqpXqZG*w{INgHzVrT-Dz%w!Z!&@fqW~x$lb? z@&f~x@82I6vh1lFa?W&?SIA4g2W*wi4Js?wuq3~L1@*kRz(CxX`leMzb25P(h8*Yd zxQQ35o>l4JP!d$VbccWs@IyMk0~r~>!jy<`5bdKyu2;yl@&7()^k^EoqtB_uO?rIp zLqGzMq1(lKAh}TTwZmewi>023=K$P2OSIW!wTyl?PC{lbOcoWp979df2(Mb6%^DBN zX4za)RwWAE94=N?F>^VUz3jSg5b~}n|K8Q<3D=3o$q!yBAo){mCuAy6_igo)?pdp+ z4^wvs6~t9av+AicLOb+K5tAz5_LzuMkd)-T%bDSgsO`5|u*lPUSc6g^Mxz0z5l5eWF*Rw<$H@oK?B2HO!l92G}hV@Q7kPmDjW>Ih8=&JXzWu!1{_q^@w ze19~jvrPu;$rHnC$At+?mGCoLklt0VR}a&D57DOZXn(h7{=PZBhHvBRK2lid^BiVi zah-Lh-<&VjU=lK2Z!OfR0BYKm)$hLh6#3{EBO^0}f_98BwynCl@cXi?(ok&Y1VE^^ zfjnXOrT4%E-cGU2HXfo-^p8nh#541Uzfi%68k$L(nh6@3r{p5_HQ6g5e}hEN_R!6Y z2(B0Wrg3gy^)EqUsWJ=m2Db-1thN{e z(z5!10+`0Ce-*$GkUSj)@@rbH#+cj$v5x9JTwOm_7h9|6d}Q>$O5~X3I^6E~z^#pl zt=Z8*4{Qf~j;9$T!X_bEr_*MzW!#$s1*6&Hk;_Qo7%*K~y0%>7R0?k125XN9qB0dY zwu`46kW!R|4s)7vp(_4@3!XaeoOn1D=f&~6%WMATJU2nBJ+?@1OPu1)D$^J-EoP>v^3>tWwC{YzAKL{|@tk$fNQVrkAvpP6 zFNNb3)2Es?^F4aBm$i-@gfFwPZb|LN3AJD2a*iE2Kd{0PEehK`0!p@I@aC8Nd-3JZ z?kg4noZ%Yj(bjUbjDhqyFb^4-^6&k6Eurl|rJTHTxKq}0)o4@7+3TdQY}NZsOybdr z>YiruLOE(He`<*o9#Fo_d39RH+2AeR1zMLR56&Pw5Mfb}HzDQ;1k#>8_uDamf+B$r zKR+cK`FVAP64=*)fi2)30hvJnnb7-JZPLnHJ}bf~^}+G79~kg}Z+fS^Om2sM?o4lL zYFkbZ1utnNY7p^@^JUI-n+#9)ILTi&ek*W1{_>c_XQzr9wTBAKiQJJ5&oB76+vW1d zA40^yi{o>aqvlx>HZFQwTxld++?fO8qF)JkQaiQj~Xm$pw&Jy7|E(Z#p`U3tQc5ccvLLgIbn#?29#=d1e z3G9~?)R8MUFiFw#_`Z?Hkon6=RR`vjwob0~lrvLat7~j?PtV=0QO?#CVTaZ#q3-Gv zHiXLrnWYN3VBS76zl=WZ&<-(el|*@*y`xcs^AGp*)p`ZahPAi~8;?xaKXS9v$Z4#Z zN+&H}76uy+dPFT9;)!}n#;`LP2ZWELb@`$&0gLwm8q*Wj1B{}^d4!^^(A9mmwEY1{ zk5XTlnT`6Phc(2n)ALip^|0m*<44SXn7+^G`50H!%gVu{y6bueV*&!zTI+AfUfrDS z^^`RJu|X;%m5Tq{2diN`SMykIVe3&U>C04TgTJmneHNDp={B;|zH*B***wjYZ4iNO zu3p(<5I9L*S3XuUOJ&1eA}Fsjbki~P2=VTEbQ;0zM~RJIwCF8-rNYHoU+phPt&`Mw zgTD3qxqD=w+BcR;<{B1T9FAg|;ndw_5xl3||((X~HF)lk=#+J9{T?h0c>PvlXi{8%& zG!mqIgPQ}cWHiePbgy&x4X@T(7BI$xj)tE%eE9QGO9~mQU1QCkVSwYLa|TxKdd2NG zjsMam|MxRtSa$neM%@|e`pm`>I{<8Ei48v*jn;+R<25A|P8vd|evKC-vS;LCq0J=k z9bD~yzVvrlLIF$wHWl;3=U_Or;|PbqZf5F?PXXLquO=(C%xuos8Xq$$L3XLyOru|( zVCcWVC`t5Hg75nd_IRx+8^g(qX^}(psO9)y*P)poaRfq6A3R4#7IfpXK4Dx6Gr3rE z-L9UoHKDrFTLc3fYwQkL65GvGzWZYlL_hA3Nqt9U*Jy~mT8kC*@9%gcFP zbQRj)x$&RvTg2J_Y%fWMGTQCSG63$jI1JfXkDNFQccW9sElW+#J?wj zvU;(tpgDD`+jcoTSvFgDp8<3_fS;peqM5@eMXXl&!Op4e~Z55gNMz_TC}+SvzC*S zOP)GNlIob1=2BMT!R2Gt68(;}RRQ1}!MN5ukG0u!3+WQ$LO-BLf%3d{*rFIKyHgFQ zg6kF3hdvl4bDTc=MPXM?O0+|$&%+zuIVw)cB=$Y;aAe2EK_2l(wu+%IZVijcb^Se^ z&}#=$g2Zxt6-kE-P#lo8S6mhVY9kl9POtboGV+Ua;=5PpI5PuKSoik6|5+Xn>*6p6 zu$J^x>SePW{wR;l4!s{N{X~kmb#yj;nBYq}y7>N)CS))_|2E25dE|vRYa5;oPz5vU z0*5a>X~mB@zPi+#=^)ltUWbL^uoG4)CFOqLCZ*yl=@6d3M+=n4Sn$_ZTkJr}+(j-V z!S1!5t2I8n*7+(oB3#W|El#?AXYu*e_(LyBKMVFHdXW{0_8MGX8kUV9E-$6w^%^(1 zWfZ2oc^^|HT4HT|R5YiK(vhrVPX=#mcXEaW#Cse`leX$uSE$5dGZlr_OIo%l;C75h zi|W3~gq!9U>V)92b+)M{kmwspyL@C_Eq4n}0Ql`VrHoRbq9iX4T=KmtyBSCO4kPqP zEuzIuCI5Rt@Gj&K_n;A@iD^;QrZa&ahY(N8S)tr_8DB!Jl2waNcngSw$q~1n(R*l@ zMAkN1b@+>rIi6+pwHozFZ|_rryD}sFp!?2D1M~c&zt<&0_aas4h0VwUz&^y?tet** zLE~jlMi8tb-%o4wkgiWm#%e|3alHhpkoa<|uM?|e>U^IKsvl|G`%rc)%uX8n_BcOf ziIqSdY^~Qv0iEjGR{Lb$v-k!RAy>#kJg)2^D3F@7E8hau=9)Xs3Q#0SN4+^4?5};dQN+FoAVN+*Fr-4PNZ7) z^N>SPa2&(b0-J4~mw(KjR2qo|SlJd3e%c+g^pF@6IKE=mkq>=C zv7BmjTgC1w)&+weUqKx<^Zt_yiJ*Og#0qzBNUGvuR%|%ADNU1<1I>`87H>$I0zdXO>`8c~6G(+TJ8t>4?AuKM z1Y(-ECa%p3-V?w!qxgz?J|Mrp3Dlar-jeV+i{HuO8|f>)kry#>YTaKrI;69IP3J3D zBh*DjhDLh4^%+ux|3CJB_KT;Z#t{Aec``Z^%{cNL3zq0&tS zhUMTMqU?JS$;YU`^o01pYE_xF0MzrkyE+K8uYxr&5oSK#l&t8u#Ldf9c%NK3UdkHd zQ;D1-u*kp}6igBSJjO%D<+@KZnNF(3PM7Mnb1_YQPrjS%PDnxpg^+0iJcz&L`rBK{ zxZXnkP+3Z}_`f{GDu@HmWn@h4`(93-!MpT78;TTb zLjn5;Gnc@^+0n9Yq<&0ugQ4FCiU2UX?&fPVWQK5^n!j9LsC3rHk2i zlUNP^wf8K_K)6md#uH-aZAU!&r`|EES0e35MVaqp8;|*G%6I-Zjxka=P20V;rRAbC zqvyaZjR)yTYS=zvy@IG#-ekO%dZ`r*#*JmXX$EGszmB#_@f*2*|XAF-X7Zi z!US-kP3CM7W)Nx@(c-m|{#Rgl*^wofjhk{VNt}4G-*uZ=BIO0%ZKX8DcfagaAcmN3qb|6Fpbjmxn zT=TBpx4&`Rfhdz?1#xh(q~WfnbTp-#j|8o95_e)l#DT!#_OyTW?ujK`f%MMg00e?|}SGskRdUw8{> zJrFH*y*dusHV<@m>J7PgT4Q|i!mXl}kGQwQuJ9xWC6*pB@eoZ^EeWHMG*6?i!I%&2 zClfkSpk^m#oUs5vEsewI1>X!RutOKSzYI^+KHpMZ}dTI0YrC-2kpb`$B{w|JfdQ4uB zQMtVo?U;s!x`-FW%WhkiPZ@C$qkY3rzZ`IJ6(ifGJldx#l;G;BbSWzn_w{WF(&KvZ z;?TPV?*^to*9h)^hozA1+_V6c%Qq>x@_MSLg39mpdKkH5Hxm z*@EU*oMuA{fP_f0I>Hd5B~kN_a&mH}ru4$F2nOx{Q{7ibRoQ=g9t%(qkPvA>q(NF5 zB%}nS8oNjC~82uOEINJ}d%60?u*{oR>$=ia;KpP9AhtoL>4;o+R; z`NrO#{n>kez9N&KU+T)p1XbUh@P_*7s~KfwKcOf0pT;`qQrg|!B_Sn6b+!V(Fgt4v zCFT=bP64fh)6zG=nW2{?`HxEWfJl_pUN%S_A zkO#-jTteKT8$H!;oG-1LoQg(>mVB$RN_I6`_!2Z0=La>Cgj>8{2GA)z-7|9!`EAVD zvI7Oph<=+IfTV}FhsCq4UZff{9L&t>k`Aaa^p}p!Et?vcsL8nUuv8TBSWR(RjL;X| z$P%;N$uYc0C_A&oymd`nR$A#b)r}LATI1zqG{jw2k7ttZz) zKbUpIvFP~YP+C8~q*>2B{%-G%p^9 zlOZ)ZOndIg$!0!^`13OJ%~ahzMOQZNFGo}HIG^5KrBhg|HoL8T+!9vcu@V2ad*%~z zEL(N&&(r2>ri5twb(0#%Fcv8tjgkQ~XGaQWOiXc%?OSSFR=gwAlcfV0GdcP(GowUB z`VKPWoSd09kB+Y;Bkl^ctOf*4L=~7g_t3Ql7aOeGtV%c?X-vPj(Oav{{LVB-f6Ytf zmHu_KNw430=xS2}&+|j0oaQsmZf>EIc&uBEF4Q`)b6e8lzft0Jy`VO`pw8=nesnh* zUc*bz!aTn}S`arpC46|VT8I8|Tvrekm&G6U9Kve`zaM*zzm2Cn>c-Hz?JBrm*OBSO zR|%gxkr&r)Qg@=vyI*<*k$|jPXg%RJw=tbSs8sVq2^)TduVH8ad#KsdjQCXYlg}Lzjr7$4wNLnLbWcP! zvf{}_aX!yT-~8e$JM9+nDky)F=!e0QaUs4oOUAjAMVlO3MPAJ2qQYlP1OuA~Ge<&q z!i?L^Vg^Q+Tl&IyJfbI{d{cO-t>l&mrl10;N`cVub{dB&WvM(Mw0MN5#7nav_Ls~Y z#!{uh#f|H2myPiO+zcPtDv~K%ZtZj2sw{2t%M~5xMTqk6x0bq@1#_Qn4hS$^`s9GI z{doP3^A-{t)rAm zeQB}~X$Z~HP?2`yO<=j^``+tWA`Q>h=`SOm_jhwT}2431g9wGBXxyy(#S&#f4=&s#z`Y>ZX9%nh%q!*oCppu6-*ptZV_2=81 zKIABa9z6L|ov_wq6S42w`1x66AdK?9K)-wT1rz4kbUof{`8_q>PSa) z3j&eAbnxACIaUL2(ElcB)%}0#inYP{mzD>rD>mNlIfpFyf%Qob3j*;hHidMNg7uHl zbhR%vRw;T}a3Wn^O;r_ds=`6d|0;*IF{~((D&Wj|t2g=KPMnT4d$}b8Ju|baO`UE) zpm`TY{CTOziSdVv$HnD;3}y;v8!rU1Ds>UQ3x*qBP6NZ*1otZD#0%QEOM(w)bQKMGaSObYqZKt9?fky(k%6z%Ba$B!U|b>QUY z_TesuLLTR@HxgWSOJ9K#4G7$H`ZJg%CC{w0Fv6$vSFA_FEH;R~yA9fin@>9OPVS5R z=|-!tzAFnEWEB;a(34J%+HW&sW2WG=Y{@iqbuHDdga@L$+-H!E;$qv!zx}s)9Fje7 zxpG9;k2k7%tQzp$_5Fz)GSOt%QlJAeLg+4hHUky~H!9`meT`qThgyIOrDEDDEP|cm zFjK!(G@}6LY>jzaUI`^jD=Y4o-O9Z?Z^jfyzS+&zmE@#fG)rhF(Fec2>%hTDp548? zz#E?04;fn^EiPXIS)w-Zr(zkFRjXfk$-+hNg4Om*ctC{KWAYT5t#!mwr^>@ zSlfhzgr$v#Nv?nXr!H4y;MGU;^z={T-5T}ryW@Bzm8wXmw(b;}NL95M*WdA%*Qs;7 zl6xb|uuu@%FSYUhfozNgyC}0>YE|UfKE0Wyb6|8FlSywk%RBUd>!6yxBjGq@&>^mW zxP~N4(0F}S&Ps0ze|J`1+ey)wY4Ux#L|M(n^J34y@_x6+8+5xP%0bl@dvY;lRk^-g zcmDSt+>{Zq+Y%pH8DK}URR{VsFPLuC-9PSnI3x6>;~Di=E@a~lLI~&2A9PM%nDzfe z3@q-swm5(&={*Z~9K|iZM=qY#=jo$umk|Eh0;;CVU9l%0=zxO;T`{Z;nx;s3izod- zWhG~Zk@z{+5MSx757p*B$N&0m+=AKD;;6s;@uh#b(-Y<^^{hlkIL6iyZaAOpW^X=7 z_Ur_wu-5VWSr3lrgInw(RH{B}OCMjZKez*6R5!-Rio-I=rB4oTz=YJPFzgP!l?{p8bA;y_XISH8b^5YJdsxRYP& z%6#&lZ{aPzeHR~hdY<`k3Y)3EdH`PKjvEec`xI<;l0t4HQz+xa)U zDqKJO16s_%cN|zph-g)sHS;47LZLC+GC$iN<&KVwXp&B|tFG`~H&qW+g67;Z^>BsM z>yg-i)JJY{1TpvI{`9@!5C*N%;T$ipVoBzrrZVD1Z6Bg=wWDfJHohD!HpAHCuVtd? zBT-YA5O?#4D+K=Ji6c~1RW)@Gpe6Txn?XFjL||favcTZ0^lK@7bOf8yv7rBt552U0 zj?X3~iS(-A>7lORz<-n*!PzF#;S+41b@@HE-MX{jGJu z?SBKryU;^!eB|M_)Ss97ezwW2Ye2(>PvsB3vH(J~-**HXG00|ja9=C}G;LH+P27l3 z(FkaQ66N_GEslt!{i{i09Cv$il$7@#K0+Ca)1h-5>&A|`)VKg58|`0$7i9vf?ORS@ z9@17*70l=fDnP>sqz9*NutS8qY{w962>8BCUBuY&3eU4bPu}o*BZ>}!{dQJG9 z5J_WWYU&lzznV&U!=3-=lw5_>N2Lmd;d@UIkfRR<39CRT4FCfU@{WeJ-}u5o^9jV= zzHNavWIMldc2N3RqRaKa;YzuRhy^Z}?!bT;YkWw-;XRq?OnM*DPoRbX`RW)GJ}0=t zfYw_WS3%wBuZr8xKWAh5-a)axj4+%O*Yh$jduvT>p#(mD5Cc+tL6=S4arEqDIQ-XR zaoWEkg2rTqx)Ejx%+iIwg=QVt$o;!evz2{K#a+zlACA%M?tkyiTU{Nbl&j@iuT2%)JYPT_6Bfza? z)US7Z)E4G3cSUB!h5cfs^NlgyT^~PBkCkExg2+=VVpn0yIIA06RH5NLGyiT*9FcG)E#Q2MGrsgMoPT=uvrj zxh`vM)<$NSoxS}%YHH8p`GD|}z_^nguM4;DpL{?U0`-Oz2)IU2SC`(IA4M1N^N<%`9oY(eKd%NjW6_Q-<7E86&Hy#_Co#wMG8*)wb zQ@cWUkkq_+^Cr0-=2mQSGSlr4fri`KaK{gAX1_C)Q&UILKX_1@^&+E@goNY{C)1l$v%9@((AKK;*gwt(IOhyN*2lU(9 z+i%~#jk?SGxEQv!X3tGcO$`l)P(O-`i+lX|F}V)?Fg-Lb0pZcCdb~U-a;=}uYcA5>ev|RRoDCwn`XAd4PEiIApJN)>y*rCfh-qvO^m?`PxRip%*j5#-d? zM_h~BJ)ga|&uh zU%p6~E`kv8+6L++H)m~bZhn>rns2?S0vb*%RDLkG+cN^3oH4)m!1Es-9-^V4^`u|F zeqAn(IZ@cd_0_B6P)-4p-j}IRqxXg4Oow)vK8CQiEoF zxDBX=gwZK8?u`C(wDaP9JwIsZpl9oH##Aq4lcSc7k7I2 z%?7?}(6U=CYw%cAUHvu@kzz7W@7UPb^tAi=>2Dq$o}TL?@87?VWzs-HN0*Y6Wbf~i zR!~4mF~ZjIef^r6nmQpOIc~uGEm*O|g#{j)SwXucX^^EcGh02_7~lJSdVKs!Od4vi zDonax`}%?%oS2w6?xahXriu1C-%CF@IM^b)T0b?v*S5MB78(jwv2-9Ji5$v?n3c0T z*_mpHSvLvC+s+Cr%E!kiEsY|*-%NjLb(LwxXs=b>j67ZKI`*(vcHrx@djvN`E>8E} zy?gib=TDGbG;dlfvTfS)uWSQw&^Hg+9;^O6mBg1l*tk)YH=g-hfQ-6&n}V zKCJ&&yGt^5cDpOR$$Vse;|5+VLY@xqohaOa1x!m#mB)zs_9iJn&f}(4Bai=ASTj%s zH$OiQ-VI_>7-{3V)almSYuStTa=zjO`($EYVM%}p;~jkb#r5?D`&ES?iOiMUnz&r? z>>s$a&Rm{{n_AY^C2=&{TLUgre0-aNK?3RhpnI5uJb|4B_5=1$4t-%o1wbZF(mNz1 z!4jDOJLAO6lg>d~3AhpJBP~x*2y6EEQ=`djdbqH))yqtTaTOl@3L4hH@Gw5c)t;Y4ksn+H2%lw6}GkS-$CO0DkwwN+pogzd(p2l&rOm8>#s!b z1JC5d)KtT}cXzqD9eWbkVgA7DQc+Q9zj6~5z!3&-+ryw-uO}_gI@*rg2&z(`Z#D~` z^Pu^Z!+Bd5obcgHr;ufo0>5w(UW((!*tIi;`}ZXWzYl+K-T~Ld>8l7-1Pu3z_6&6r zc2uT#!t`KWc{w``O}5Qk6Uhr}%qsC!?+z)c zTq(i$*qB|t?pm{K3D^l%y@vg@VX19xe0+R5y1a|iRS|IK;I?78_Smt;yZzo>hT8W# z#KgZ|37QhQ3(vK+ErTVIl$4yEoh1ubcb6K{4V0CW15`nnIvXQIXJKvKH$9$doC zb)gHTY$&6$(tFQuWMoA5gOe4=YgUj-i>oRtQ?ooOvc5a4>z**_gQ_88doBjjZ=*#T zA|UupF5pB!NC?IEA=gQ${95NBw80g#w6sjP4-OheIXhcI&h9~GC;jBagrNIzS!YXT zCbfWoz$6AQA74S<{q@|nUs~#tlGpZ_?P17Yw2sE%&U|zko|&1MoJ_=B*x3Q~k!V65;#7&tgk^J%P)dG$5OfEIEbzm1KRv3b5}OL7wiTyt*_>T5Ki z@Ov#&axEuUKv94$K$~Ea$1v9so1EVP!pR{~SOsYU&fzX+>!VCypAJ>H!8A~EnqqaM z^<29JBRyF}ibNtolMZk~Wl#`m#{$4gSVmQUd;D<%dHl`E%5Nh)+=J$U5YX~?o*utk zY>$nPj}bxlSTp$&9gWA$BZ1FFLRPMs5*JtVa`Ca7o156zjqy^zozw(3fa!Lq{HYlX_Q#bG{oYzEdDw@J@x#vRSV7zE(4$BPJxNb`L9}l{Xr=|+#reQ zn3z_qKnVJJNZSlwDk()Bo=%58&Kdz%0&W=an2cHX09R^cN_Vhf#M6G)EhxVMM$fT0|e88^p!snU4kKg|&%SnYt z@dv5lO-@l&V)rHes~hwrH*a-Qz5i{_j2Be3u45qJKrz(RnW3J7rXCU+iWMZm0fVxz zumC%+r9~`AVqtw7LRfRdE-4|vMTx1V$u@9;a&ck{sZ1~d85^Q>WC8G|aj zu(0dXCs6}~=FH3m&>wtaL+ghH+PPq`;38tSXWslt6Y3;4mB4W*D=P!Ej){)$>Fw?9 z>A|{rGhM_BH9cUp!CaUZs##BfEXz#D73V+oVTY73JdvN_sty~ zxHxN8mX>rI911Ebc0sqes;q1vZFq|$EIKt+PgL|1UAlX8QW6k0V4qrH5d}+7dwF?L zQl?LjYBUS3{FX%N6$U%H5h$BBbj;52JCy)JoC z7!?Ure8QIHKs<*95l`!Bul^D}qMi`Dy*;Jzj{H(0xR4iHYmMR)MG@7Nu|s zaTlQr{8XC8Fg@iiE(V|;DuNrJYM6rw!oD`sb>+76Vs37Kv?@(OAo>9VL+AMTIM^qc zalIqd+4BeB2pK#s;7>BFZuBGzXKR%OJrVK+{ z1=T&UTSE`_2_#)yUG>2p!H(?}-yhSlxrUBzGg;9#FfcGTcLA%y!pfWp{5Du^1NUET zwR4_sYeV-lo=(7*fvhAOx;KQR9!E3IutUJH#|jHi0xaR=+=DyW8O%cI`{{Umcr%4` zCAfi&T~k{d5fTE{G)MF(hJ!)p;8_6`oZfEK_D=&PwMFD|xD3&Wq4=7X64Fw9%e z3bxpUOZ7g)p>}LaO3GNN!Q2OD8!-qUT=rOL9_o^pgi)=-S3w+bhn!qbS$PPMCAf`F zPu8S}emfkU!YAVExFk2jb?w}+sf@w3fyqI6T>zPcw{8t0(I^jb8TkFcsUWw^nMZ|F z^Mqo=W!)&g4lqbcNb~@t`Wi_Eq3HlId@$>S2hNU;_x+|Juz*MbxU-EPvdCL2uNUD_ z1sbRk2ruNFFr8wS&gZL%j9FIe8ygpU=@(#xZj$kqWo=w;$Zlvj+3Oc6&Cds9&Fgjk z@xuoQ2R;Y$<}AO z21+l7uj--$hX$8ba1ko<95#|j49-B-5a~gvK0`Kq95(skdFMm&P5JkWHk5KHurGH%_YUVj~ z`;!5gp0WZ_9Bx$Lon5{|o-d-!Sugg9#D=LA#3_)>_xvJRP4PSgf=`MfYO8N9m`RR~ z-lP^{&HGTFQGK01+YS_9;e{6jfmLEcg2VQz(PeLC-bL(G2?vLLz`fV0+S=L(B$roL zyJtc@tVo@OkV7=GX?v^vMK7HT-!T<_iC2*{Adk_Ny+x--)IrN-`Rzgd%ZR|XLLxBR z6+l}6#v%rT)6n2~FsgwUB+*b)QNh8*62 z)SV&wh3#dE=HI)El{gBsE^6At?+mYB9CwIh7k~ft3a~TqQMnN-yaoMG?WD)welxRVVj8HA&T9aydKU zc1yG(4gm}d1O@m!W6aQykSuyediucMF*(i*Cpd)@;@Tro+CupiQaJp??#=-U)cpKY z6BDn16LS|9VP@_b7h#SoO4e5B8|YmggoQRztr@Vr*m63|jFJ8s_BY0;F%KsIUWu z!7ma_B#Jw8b#=Ws8E-y0+)9p(t%g|q`1lx{A>eb4`^Lt`WH7G~Da*^MljK0)Sysk2 zS-ZbJ8iI>QOzZ;S6aqhNGTxs6Ls4r3I1pFY2FB+X%kc)s?w+u$kjMf6Dh@71Or5U_ z`<8B}y!-9Zd2w-5?ow~%TC}sYC1)}Z#nMf3mz69LLkqBbr2@~lEP;X^vt(eLPE*+gc63GiEi}|?Pc{Eu4iMigdJQYYY;j= z*y&F6Z76hF_W*X})~#E9kx5BO>7FM@Xe|SF3c}jE!Hb_}$>J1BToIEZ3=%KBOf@t# zoPp{9;>YLv1$tQjDiA@k^aT8TeB3)&y#>2`YT1r@(y>B3IDw$NE0<_R8R9244_zH_ zHV_pHCo5}7r@p3Z{Pe~5caMBkgCf?STXw&@;l&_5ol(io!2#WQ7Bf>k>%)0CdjP$Y zyO)6hF*ld8q^VkZOxsZ|fOL{c#k(W7Et1LH!@FG~8!}n;+!tVrtn7{SemcKUN)hnI z!qn7;aOwh_Pf?^^3`8Xin6YQ>OK?^YHSGQR1;5h@2S+5}!E*y?lH~1;fCrk4j(yzO z-k$qgEGZXI+6lC5v1*oi<8nCsc&ez_4~xUZ)U@Hlhf1P}fdN}s?clQE6pZ`A!f6Z{ zVX>l-M3vJ>)`KOpHDBWCGeS~$)kOfTxbVR7UMJgq`OPLzJk@`)aAUrqbPdDdO?gey{SxJIU? zw5K8=D@=F)ep^QeXF+TxF9czgTmd;TMHHfkiZ_%7(kBPG&S38W;8LjEnE*-&mY2J5 zGps(@Zlz`WLg|f$NJckHr0A6JZSd4!5@qn6qof_qPhFrAI zf$@qq6(8T^=;#69Ou&`u>gr%MOW(gYR-b8f0}wS1@xag!2kc@keFFnUr4exI(=#&< zt)`ad=c5u6`2d3ghZGkdui~ZP?*dWammqwwlDc|&Fx;{jQ6*Mu6q3{+XbBuHu&~_h z?7t2V0g|&*NjQx&-_)(QGZ7W_-tTX|INOPeieh#Iyl+tU%m;|E*w|5^MP67~sD{#< z?S?I#x2|Xj_;L^h8a^1LzU4**1QP`RK$^4LXB(qH2rL9hEdwP8EZq}T)wi1wMLOEr z*55!Zv9y_$iODGLy=Hk!Pmd+gi;QEs1<*RXxoNqU4$(J|so2=qvU3Ru37Y!)!d~a6 za2`a8u!pu&>=aXHK_AV@3}JE30XgqzqAX@2yHPt}NlCBsWSHXdVx5PIii$ZlTyQrW z9EQ7XHP3=H<+y|I&t(h0NUP?2rK@nVH$?Y_rD;r2=`9d8nKGB<7w*>bZKmqBS>)$L zt}rq(!Vw%vW?NWSuJ{JvP%@^nWi70#hH;fkRfkFfIR<@T=H|!EF3{_a1a4B?A4{o9 z<#0CVIyra#YgVxZ>?vwGI7NjC5*uB=* z*0#VO0I>@p52Jb-Rg|>EMMy3(I1{SY4kyjh;aYNNc1|P^fa>tX-Z*Ku$v_w?xD?H3*wOJ z>1k#b7Kj=XMEcW&Hgz8|4lzp2;CypT6n48YEyI0u~%>3lKYsDZIa+sxeP7 zy|1^I@Wz{rj0_a%#%Gt^+L)NgXzaK#LbjL@;}us!>P zkaVmAFA4QGa2xY$YkaVa#RIUxUKPEPO3JQD`>C1t>DMa_eh{v_&ZL)I>xKog zwYiy8I}VQu^ziS!)uH>)yO<1lmS93AZHE+yekpgn8sU0eJlMUYq%TZN2yfqpnmjh! z@1N4W&SA}iF#z7NXE_`SX!78pJ7*k=i?VgOSZKR)-3R<|wL6=K#>SkW>kyJ}evz;k zAx{I2wQFVv?^ySMJ7*3!N!~!8#1(9@e|Czbu{bg8gN{45`nMg4P z%2#H6DK0BL#J~|nMnc&BID&%3xspL8myN0c*bK;Pz>^C9UWyr0)$?b(r9y5H@$GBU zb1qq$$0v+4R@_GISh?k>6B$@pXDiJj_Olt}$OyOt8e@tk_|Re3!~DR8_RLS8KEY(j(nLdI2NGgD7oz3=>!d)6v5LT6w&4AH z%cZYTfb#)1K#ElbERBho8_+YAZwKIP9M7>rLbtc6W|PWbh~Zo%I0#WrM&|cQvW@2Y zUA!PLb}{gDA7s~5?w&_jX`Gzwyv=F(I-tg#T@-CY4k7=tE$`aeS_Pdeq*(!;Uvxic zuB)%V{-y=8N=jLeJDZr;*`r$L;k`~)2M32!I200w+w)|NE_S{2yLuTc5Y!1?Jq%9R z0gLe3+DeUy!6zmCcDj_vyz+Bpe*QC=KTvN_4lOSq78RwW!&ngbWtUQQ#whc9)E3u_ zw2u7K9I};34v2BUDxaU92Uk?lJ~R<_*_DW`Tm&F2mhsdn=qWv%dC;>e85>y8H{0_r zv*z=x>in08im7&r6-J?DnZv`+w3-X=@=<Nh9w3#Bw_pZC+(Ls#xUWVT*)6 zs8e2|TT$H(86F-^90x|du%O_jlaqq1tRcq?L

y&N;*UCVT<{knr3YB8>($6?|gi zf?ZIq>v(l3<8w?!%Nun^cAF985ML_cpdZPn9R#h_nI8k z9OFB^vi9E+m^^z{21E*2wQf%&pZhUed^b5HfPjshvBIG7bO;-Ra0Rw&ng^Lg z!M*VYRv>79747nwtX(h8caoDrQ_FwBykJ+alKTXJQs}e`2YHD&n%aO8gw#{7GxGu1 z!+mQo-{$Op_R`iCm5y|A`3>&^@PkZXIHia%5O8o{*viB8m%J&Po1444c5BhF+W z>wn~>p`l@6*~&}zG|Ww?wT^Igy|Kglc6+L)Cp51i^Q}cT8>!z#u`&1~8io zWLNIrzYkd^II&K3xxCj8w`F-(ot0oqNX&IAhV{bUJnzLi@0sh%=^27XwK13iASgZD z-NnSj;1+;|&dSV$gxsf;alU-Lu1; zIWI8T;6BqJoeSFyqu7S7W_R_iF3m|VYcA$qoBE}ywBlgNUTAoSx;_Bwo}QkJO>K~7 zEGv5o1sSe)uipcH;h!_a0C|oL56ekQAMbWQh#(hutQt50Fx=!q0Dc1LGeK-~Z^i z5eLoqF*u$^Mp;1Z78lDlO0WHm+Z93{qY)OoV7`Hc1=Qk8m|r-bPe;`U<+2`Sptr>8Jm&Og6DGB7aU-i|UE4}Ox!@g_4LJV3>`Pi8(~FFt;LRKWs# z6>I`|&zVSa6Qi~>+e^y>VXXAD)s7C0ktOeQ4VGV`9WEZbGSxdCC_=CTL4_~cO;j-- z;4fB#CNgsJ-qZG*R9^-Me}QZEy7)5(SzFl2O<=E~3g96pr^?`nqLSEzYt zydc{9k_P#mQr-Gppeuo1fy_Ar3ky(V4o*&{4D0YFu+VQkwn+n86CpbQ5GMJQ3n>S2 zJ|a4v~lP+eN!hK$j5wLMKk&QzWQ<@0k96rQBPlTYH3Ip`38HDf@7$I$34 z48#o(8ZaL$kOLljuLV{aU<({_$ErkS_`zu_`fNNudTDL1&c}D_qpOx6!+X{utNa(Z z8lxfl@uP>^7FC=B#UCv8jI||5&<|J2ob3o1SR|CZOwEjqxhyBxRxY7^lXDWA-9pN>v0U3M&vKTv{t(x5d?Tx_`hT6BwH;UkIA&0+Y-^@tGO>X4fJ2CT!h8XUG`xn^(2twAel_NIUX z!7uY$H8HML(rJ_-opD&q3*KXa|BJm9*+p0VlU4rKEB$v=D8LL+x81;mSYP<$gmug;Ynh)nyun;V7{za$$IJ{1QqNTl?G5%k%&)%%$ zdhke3E1~iLZnORJ2M8i^FvE!u2y(0|>@Mx^JLHHIYwPL?nh)HCG!r-zr;RZd$le36fPLKKIXR9e2Bk|Vynwkm zT14dLp{)mBvgHRoEC>uG7Uw+V2?TDy!>zr(hKWH1anr&6{wADzW@?)I;e)^*w}+M! z&&us9Y(d!A(*nT{xHE_&wY9a;u3b}8SH}|r zj|mPG@@`uzE2btU++OGIrhHV{aJVTHdq9B@m{$niN(%~<8VxNH2le&zSOiu(#>RMn zF#7!2=S=T^@-H#*oTmM0jeziigKr#G7ndk*6v7Qwqsk}qhk>CffA;w`&c!?nyy}0!0>IEFl}Y4=f;X zwkQG!rUH)L+?wS752U~n04KjlpliSiRyMN>2Y>i%s<*Iif}t8 z23+!$BYC50*AN5Rz>6W?DZtPy|9S;=Db-a~4liFOav`H30ZFS?s#DuHJ|2&YN*w(7 zVJ;TSw=MKUkG97`qN+%=nNR>WH8j7I6^K-f#S^|j$&Lhs5kC%6V zOHWgizF2S(1_FvdH(!8%lU;1ac!59z0u;Dj4vwM8 zNxlaUBDC%c_#`W-tMh=o5ad&!zQhXf0kBZP!EoX(YzgY9e3+-Ba|a+`SNqdBU5Xi1 z-L0`gU=vICYufXYL5dpyC#3C}d3fS*GxPH32yU3vLTMqi-gGYmE{SiQ2Y#Tt1k%Y{ zbIlj9xhKXsyf_}_bq$S=n-$==sa--i+(M^As4Rj(+uS@|Xu}j27nef4I#30^`i)5d>T^~K zvk(4>BmfCiU@`;)HFnPrs&lh*a=>qV`vlo3sH%Zcl?=IUHTzNP(0U30i+%kxM33dA zR(c*2D02|<*BqqM;B_`QZUCz!Bq&&-Td%CD3hOS{+{j1tDX>3aADo?!;IqNP07081 zGsh6D4aJ%Omf8$|b;UAWxqO+7jI6tltK79*ntB-(liuN*>-21b)ss}7P$a{oMBj5+uu${-0a{kNfn z1+xA`MDdXQ9^jgpn2^Q*BYnNH7d{z6l*F*s)>bIO0NM%4^#IlxnwX%{JMa`hG{SQq ztqpfTNgF`g<>lobHz)*zm<j z_iadh7kl&l#}xG^Rbqs99~x@+@ZX03`oHqRlyIcy4@+J$?)0}xZa(0tZvZ4gT`Y?J ko#qDWFaP&5;@>YW#q5cPF4<-OZ61)3RFEhUd-nQ&0HU(Uxc~qF literal 27230 zcmc$`cUV*1yDf?Wil7uhibxSbkSa)T5$Pfzy@N`V-g}9lNCyD{r9}Zjy7bva>wRp*J+Bser2^CEXB$uTAXy zLFKi*`frJb*JLXC4UIO$`o9aP3H>94oyp9I@6bRao}^aXXJAdVW=;LZ&{5~&$7zvx zuyk=z!53~3onaB}WqV#@go?U1xKOFwSL@;ExK;ULi1+#E+DOiF&)1m5L_Jm2IcMQ` zE~ASPEh9ykcyf?F=h*S?Jlq@E8wt4(Y?NsmA4rqc%GZ~d67$>_yjU4X$F>s78CgS~ z_&0v@#l zujq0La3 zdc3QUlPJ@#+-?0Aobuqdva|2f$YD#X@G8z*LW!=uN0Awmhe~T`7@rjnCqTr}C}e18 zsFBxZsgTo>=w8PIK0ZGFL`5`L^$aZ@&a|!DT)1oX%%Y>sbVXE9lG5@G9i6=3yx4u? zLVCPwZNy5%IP#VwiLs8Sh_)4$yE|X$(j?!uXn@guK(#!?yJ{Q;a}Saulg@W_oy$T$ zZaY3nr)N+ht6YP4LivS5WKvmfE1%15i=xuyh;bB$jyoe~VJ8!<`*Xj?DWkpZ2x&!s zvUKgX)7cej%Y@(M^F_JW!(p+pckbe56%>v1GLnSQ`gPm{`lP2_{=HV=ncR1_|D;!-FkVgVF5i}DhoL|`PNjqvfXq&6e=Nc#h87! zZPW%2*frKuy*LxZY_;3AMvmtB@q8qh`hvPsO9uxqx6;zmrKP1-WBCW}qM;OAw4&~h zNtk9Y55p>C)Tw|uc0HPJkAxmhnA=sYK7{qVb#s&xN3n!FG3#-k4;QelKwQfl60#ir zNzR9HBCMzEVKB7_21@bv+WdS%r)lHP&Q6C)ebft)c~(eRVNz03b~Y=pCa`$>LR%vv zBQn}FbQBB^>qUH)`=lNl-~DXDI=Z2kDJZxD z@!6ko*C|y%>*RHqP*SwfA`|T#JMag=Bvtwj1<@8AUq<<&DJG41CR&CfT_%+!CR*tz zGU-7|u3cdF-O=egML1tm<)Rt6qvBC3Ib9v%hT`nGn!%T@&<$K+nw?eBwK_dJEa&1L z9xDmbZ&e9I)E#Y~a~_X2n#ApYTFb-9=MgJ$~yZtUH7nvRKHXfFs!|_BlChWD{vHfBlwslbv;hq6KlqU(F-|?)&KkP3sBi}}-&iev|9>qBm_=ee&4}*>DT*%` zH28Qv+VfKfhYU!3=?)Jnc znF;u~&626}jWaPsjZBq{VE`QS5Rb8&(JMS+-aO=4w3NTK^F0Wu^lj`TgF~;3UB6=I_jk#e zDwpbmQ9Tj2trt>9vtHX}HdFi8_g9COzX#GXq$Z2F#eM$#IWCTn^6{&|bor3f7E2t= zLcIGKeb1pFH#Z5SiIssgBj1z7*;+5iZVRcWmxaaZ#zZj%yY{bFjs7BA74L)8H9$Nb zWs28V1uqqqLX*yD?QqO#u!t3+1I|YC^s1d#dEWk}ubvS%>-mCxop5+`^x9RwwY9aa znQ96$%&Wv|ObMEv$|4y^*xTPv2NG(?9kw_B1T%T1*wwKDqwU$+gQ=-f{9tF|_2OHZEFNfs=5K|N18}`16cXq(7k-%Op>Awc>eF)=lw3BN@Ea2adB~*1BvY5b?4M}HQZi@ z8_X&0sTmnRZ%PQ_Ua}Vqi&N>MOFrQb*G?Powa!GeD2)>`97^kvWlq7VZ>^z9zHrw{eI_QR#l^)VI28RTGwB%y zwYYb*p5)NR4D(Jc*YY`X87wR{ zbaiz#Fi8F+yCoe^6yDG?cBE> z-FTf&6qqZ_dr!XBk~x(|#PvhmXAr)Kaa70%2ndcgr!ob$;Pv(2zP;lnFD-PTzD#Pr z8qLgo~~xjRJ$oB333nbt>qLPZcI3#j(44w`|`50g^@i^ zwyV}T8E#8Ew1rWD4}G>OmqS8BWy9~@$sxIPpf|5k>`Aw;I88S@@Li98+%CrH6XB(y z5&IWCewnAG`w!{)@=xJ#i*YT4{aa2q9o`#fE zA68Uoh0gcj0@P!fKCG;J9M?Owd~y7e#PJ}z&++F%`JsYN+m7IMt4{;(>)Q6c&y15)w)9Oo57OKLPm^+GyDn1B}n-fbp{}vi=I>?KUa~bhP{&k~S-fd{7pkR?fe|xYj~a?MI+eDrC}8Fs{^p#|9|xs9#f?+1ZXG zFl;|80M#z?#>X$hvUo0i;NgFt?EV}r3@6Yq-#yuzm~e4%K_w-vEw3&JF}x8H;*1Z4 zA*Cq<(vm_fZ;`u?B6?teeZ|HE)nP9D7&$Dv2gsqen> z`@8K-)r{wQ9!TvE|BL)y^7C(8Nqz3vQd?ByxYYACO*Rsw_js?Pt@9RAW#Xvp>|(Rt zs)cBU=g*(Bva-gp>kOvKTrNZqQ)iRU`e>d(l`|FZ+fOsLbfEn3!@h25WmRrFlg-iv z00$C@l#QgVebb769(9BNU$w}8nZ8X;O~Hu!wN@j2r!p=n)u%& z*}wHF^xcdt5zbZHa*Y0oANQn69N}3d}<3b1A6>X4H&gl`x9oYQcA^}w4#+Uh# zF+C}T4wz$$o^Mdcs`Fi%XTTbo0jRzYDFk(_PF#3I>J``tVwsm?b}x;nQ-_@#gPq%( zM=q44YVJ_$ADGWQ0_922Wj3wbuF}tsj*i~j+dJE?M}JmRx(_l1dt`eW+78tAEFt`f z9J?|M!iW!~885y*lcEuJwx@F}H*41Iv@Q3#gxCP;lS%KMc+1ERbRg{AYYi8eSK%gBk^m(8syB=%&U8(p`a9EN5;@e5MS1)MeL!el&2r~l0Xqak8{}-_!ggz zsxgXYv`EOv&IZZhmo|Gs#%|1|FE3_}|I!8d=Jebb+gPs1{^;zSNc{K}Ox!0!8ODis zi*ykrM7Yn9!TI6E`56H|KBaN6z-@q)*f}{zr;av7qW3j_e8|p5Z76_IIQ<#Iy?Vv> zkSTvJ&CLwd0)2aFblk_mfr8zU5jpOd0n$nkgZ=|6Z5!oWur!(UToyzj`m##^CQ({N zU1O1%_FRt+AU^{?=dGt$*R zOdt(HS5{sgAE<2n={t%x4m`mxK@AkmI5IXy4LUF2dzA(AwSa$XAM}g_RnORJX@D{a z^R^kWb9UZ#xXeg!bn_{KHX^6V|7AscK$Dm_+1BoN`$(byFK?FVc}WB<9sbd=JIi!T z66I#IC@rA;gRyN9kUP*L^ZRXw96~QL$yp~?ePw61jsax?0N5F1e?c{MN_N0A; zFMr#i_%35GLofs8f1SJ*O4+k&_Lz*zE6pfncWFThaRgcU?-A~u-P-D>boft=f&bgF z@+pt-yDwzY-27NNaiBTI|B+aN_@=U)VA~h=?t~1G8n7|J-~pkqy&xt>Tm?a4HIN2V z=&F#N1j|M<=Ff7qQQDm#Sb=Tt8>En?vhcKl_ElXyGKN8dn9>;KU9o=V^_Y_P(lX?t z8)Ki;2YAsFKjy~*#-+grt|%XkxuW6_uzzzSFz23#zRQdWJYAa|)gqa+7#L)tv&2dZ z9E+k0)sjXb9K=knLI%<@Gp&4dMTl&>vS#k_D}JN?qsoy zGPebGgQOUuA`{(nSug8u0#JAVc}QFR{L)$}Us^BJ?kTMt7Fu!Ip@;&X`;GtvLh`pE zlxn28sknWY@Nc6F%gxkN?O(_`bv`>m_HVa{c!n#Zk~(}oMh(*z8=McgQ++@!pzj`C z7=;CiFmMvmnqOCZeFo+MMTMRNvtNg8!1D}oL`KE=3tJeQ| z<3>Hj@b=bh$bo$)#g<-~wN9nuB4}At&T8xG3WKt=rbd)u(8@tW!@M_v&vSpJ&gV=V z6e9|8?3HWTIjQ_*jtZa!k3H?;vJN@7K04f#8eaUYb`9kk)V#_o%pzBiVLbTL`O3{G zZ$zEd7-wkfn?mhp9DYx~RaI319O3_45ZfH!gpkymG{T>QWFl$LBcZ7I?410N$?=dp zfSz8sqYu!czRN}ocQgAuQ6alycW)D6H55GG3pl%@r7t11K2|_f`Z+$HEo2Y0O1G!V z3&43vAHL}5@8@D;TOa%pdhssbpgJx#)*^wtG>Y35ARhs^cT5l{pKQdG6n%?z!@120 zwRshvJpO183Quc(O!B8J*3IiszIW*smrd(7fB<$$iAaJ|f3_p%hWdMajt4S`-1kz> zB4XpwCw^2^cru_eB|h#XGJZkSd0CNui9mHYezv?Hr8RI?%o36n&TJ9QsKUn2ytqIA zoxS@jboJ-{MYA%L97h5)%R+9|GE+~%)J|sAwX{I5<0hRr3KXYgIIlr5D5b8ZMmkBg z;R-^9ef5kAwHoCOEUffVx5WAg-O_b(@q_(Zffu=1*aRi;z}=?oyMOU-$#4~%=^{g|h4+Y>Q}j`k76~S6!usPU z-J{J)bq_9_HtmE1%Be@vOms$hIf(Hn_tq3A{>T3MKYc-^#h|kY8j)uTU7*d2sbm5I z0?rOMhp3OX;YKfCHc*C6erb{emg+w?FXZ^=sgI3~BlKcmt~}AFXQ_XzH$j-=k8%pwR2fqI>M#buL9LZPUE#QRstob^wXnV0AA+oyfq=GAB;0nU z$U$wc;CK?P=QvT3qesT5NzIF^Z%Ni*9|m)Bc|a-BE+!&U{oi!{SyTE3!7c!3wI}!e zTaO0QY~KXvdYA5S8P_PlHvYv1>H2Fr4&QZzUS`WFd_Z8<{_Fu!U^$M4OMgT%+-4Rv zqm@`cg*wRJoDy-~QXekgwy5 zIBDL{$OyJ)ZY$g_7F9pz8c_}4YQsGMb`s~e>;-Sa=2Jiz#KP)$x07v9PhIM&h3zM( zAwp8STR?H~__hC=Qt$ecbsHm_3tQyUCfqwmo4vMAJZEgee8#b}7QAJvHV`>q7@j@v zm;Yt&M(!-As~ZQe`zB3|E848gfR%))#$I`pC#oNNyfuQmRHBn2HuUhH`+kJ3hsv(?(R-0 zWV5l!4>|7bao%${`4-B>Bm7ealOTE+-&BZ2U{@zVT9G|huxZbhMITKbyiGWrUy%2} z#f?;|6pOkJ7jm8MW{ZOj=9n`O)ghW<43FKld`1S|jm>v(5u4(sRf?Yd$!V4<@o+Ou zve3oKP}7_DMDzqE!zmBI(GiX>_($zv98#{4ZBXU za5GNdKcfV8=c`k&IrJtG#3yN_)Tqat&@%F3v5sp@%E)RDcnR4)vC=v+bihYLMP1tA z`kQ>#;|y^e2c;tU8#CdfN%i<;Ef&Ydh_n8n{k`>w$wQD;$%O;dYnpSz3)c*aVbljKFI zKdfkoyvxeEQd(D*5+v%9@(x0*{@#Vpg&HzTi7w#J8*gd8y@oOT$=uWnY0N3Ew~LMM z*FWs}^7zeM(5R?KdyEMG8RdGXkK4Un^;jr+H4#QT>vgQXTIkwdF7mzm#->O)*M|P_ zL3Y7B`XrifAmkq|z%re;p;PWdk;qV|CMaoE*cJ91KA4Q^DJ)X8d>F2!b@Wc0P_O%kjo`?63GXjOYs0U{epJ~{w4mAk3 zh4fv&Z6JxnAvH(8dS9=*C>4at7)bTrI!o~=`my>=sFE~V^3rOe@rI3G8Bz-6frz$OVC`SSmdu?N@G;; zt*?)zvSq?--P-6Ip49}S1-KWLr_$^qUqkPeZIqf8(*8apN_(J7mNU3Itdy*@nGT;h zJDy-B->^6lpY7r{&*uJIlNr*G7W9Bg>(0%ZSsA7Hk za}-Zip9Y0GwRwyHM;Zq|0m+YFVP%tf(F`~I|8%%Y&7fWw3LRuaj1J(@?nBeEGs3Lc zuXzbD*t_KE83lxB#y8i^!9Z~);b@fCXZ%EMOSH}_@>p5pch*Tx&PT1y@B*)9V_z70 zu8>0Dyud0@$jJNX?P8tSX6>v`sZzHC^NM)}h|8s_szqG7OZYSV-P8*Q?gtEl>bKT8 zdf^ABK^^Odr#0fRYD7M;8PA#&&q(+>(RqPkfLhFz)t9U6dM2U0x7YLEsE{S5!d=Ro zSjnXeSwl1mwK=5H;iGmdKRk|SlBVy;N7WeGX)0+B6BL%dPRk67Fsg{Gw0Y6yAB>H; z8^+G;4m73XZaQiIWU=k$caB@;jY}y$zKysKl<)pVsV9MnKiq0^i}6}zekeBJCI_!M z^gx8?vyLe|G14u1CI54A1D-UqSf#*KadpgoQOSKosWU}*dXPt$67RI8PFTxem`6C( zR>^}(QL4|iZ--}c>DMDoX^oMerp_z2ZC!7xXY#YN=QMbBbZa^}I(*DlpSazuf3SuY zKW`kW#I2+ve8h^ehfhCu5U$A$;}4)Tm2W2kBs6Zh*M`ib92Xy~OwI36b3&H`+@cB0 zR@oHV6=^7{^c*VQjP@4S8J>rd8VVFl)_9C8(ZDz4+D+~U?aWonYSc#tT@{B1UBM^8 z_4a!QdAXczr7MFzPL@45QLk49|G;2D{Iv_4nsOE#X?d++g|-`tUZm^>7~tQ!$$k&Bk^h#%CzsdzH*cd3aSU2m zM`Ps3$P zUwmThe8a>rVXIbjFImYU-Ne?JUDJogO@M2?0^1J1noJ4mdrAYXp5K{mmU4a;PrAR= zMRYmKcM-Ur{zJ5kI#tM35w4oGrXL0Dc|y9yuTMTYLEUWO_kBcMwt3G(R(H{5*)?k& zvkx{!O3klMRd^etOux{e$q*^AAy52a6`3z1 zOG1O0PC50}4}OZ~-BNd0yKiUx@gmxo@p`qr6ZgKFkpE08@bF&MDk{<25WY(jp}g>H z%&QLWq*@TOKlMno^(8TmTe3)=QyM9x^*6#3YR4 z%D$I-h|QYFq(Lh$l4mUXyE+GD)4nz&3H5y=e{qr?vA`0-Ag}7<<71VQE^Sm5?YjBc zyyaW94td;_$HbRr@^$Bp0oPo!UaFFxTvN$%MsJF!NFO$5-RT>KF0P(_uAXi8=j}7_ z?FjS-H&Gv17{O_JSs1A8z;30$-W%nm*p~SG-&BMuQ;Fx2SaM0PoI&;f>iMP-N|bj$ zKG;*JBU#V4I z^H8<1v1xgLBtY7E?UmIlpL^wIRw2-~a!$YM844};M~!ZbgpH}DymPe%VjdZnK&%coe4D+V^w2ECJ zs!ut1P#%dka8;NKH!0LPJuid#>cuT;Z;y3Q%SOvU>qUxOx1A(lBCtwiMbo@4 zsU*8UJ>vjWH4!%2PI`OU#%2_A3iJsZ-ADvDjl1agJVN;FPTSA^-+SRff#vgnFOxG* z)H)6iZ@Q$!u-x6<@#Xfl9Ky?4*P=dN)65xJM&iD2T%t=LDPli6_XV8+lk%w*4+Vbr_0QQ}QK| zXC*-79~w{G;&2=3!OOT~1w8-X`;CG5n{?d0wa!gXPZyip3`~?|-=wvX4(5NG8F4e9 znZ5lI`*WFbrTF1!YOnR;R1|=6Qx%~bWUeIBI55^xojl)qBeGW9ZCb?z`7+dk7;>Q_ zM?Hi8$tf2WYGb>I-73M%`aY#nG^2*bNhc8rW&JN7RQJIX)J!Ha_?b+ z08wxQ$`MO^S7Z)g*(Ax@lq3$w`5RV+q1R?Z7M^@e&%d1#^-B&j{yD>bit`t&w3I5{ zz!fkD*JYZkdUoFJbm#k&vSNg9f?cjDgK_Zj;cb_cn^;nqy6^Ylch%*tugrQ0G}cS9 z?j!l|aErT-o?!t*`{)$yWlu!t2q7W7s+XiLVf zyX!D@GU(5D3v}J z%FB%&DR3-Nl`D(eBsdlIQ_nvgQALq&VL5yd$C5+e1P!}=JdMroQ=X+W>h5RXY(2mT zD(u{q&uxz-L{P4horGAyjoCb}#1YreGu*CVxtrw|e$?jk`~XHICCY=c^_R79GQHM7 zOz99<_G;-me8xe7!q^zkhljh(x(pjiJ3KJ%{>|pBH5WT5ykAPO`gnL0ZT;md9qo0O zZm;w1_othd<&gG=vOeP_p~^JeP)R9cR4Rl?9_zSN0zvrc>i0<4SiPvbOFiiUxi_JN zu+({LaC0BO*GUBUSg_2lSzx?JcAQs5-!v<>(Zq4R?Ql~N+Dm(0W?0QESpQ=p(BU8g z>&sPqw|B#Mx1OKZa}nbCKR(?c4GX_cpH~u3K}tdmH62ESE58?~(uH$@<2&?btS!GL z(fuU)LE+M2dl>b;YEin!LD^jYp2ex_w;ajSZ}xT{9T#8-H=h6jsyjDY9MDX)YinWp zO!Vrdf#rY3Z#|;mjv4ODunrs=FRUVxN_w9NA3*SuC=(O)rbV&Ygnkeyqkw$t-I|vX$?!;RhITX!pr2Y zmL611*jpqo(GCoj%&*$nCJC+E9OR+z_)6m#gWYSjCT@~<1bTJM44aFsi1%B1L?bH# zS0%!I>!iQV*rfT^+C6E%WqX}#^2Nt16#FX+tr8mPPW`g9=sxo#jDsE2HtBZJ}>s@Zxq`jw)J&i=<)9&L#nL3Z&Q?8Vw-xhuguzvY%GeD z(Pr;n^GAfA-Z=XB6frA0ybjt)rPUFuNRww8UP}~l7Q}fbW4(rTX+I@hSIn;@ZNGLc z%-&Rw&A!$rj1|OGGc|Ui&Jg{fO{FqOSUd)UoW95(i&7=uU-l{5)skVqMI|2ka86g0 zSOR@NzF*}#4u!sQ=eDRPGu1FhdWO0b zt?gaW4Vl18DXUOVNN$7)k#UdZzm-bJFg;fNjR1F*9(FO&M(Op&x^AHGX<{q%JE`z{ z{`6R*Cr!%>IOG@c4~>Qr%-FYYfcT(D1hZhKr01Xmw8A5+JcwPV^<{fD&VduBLzCf&yrUm%(sWM6* z=)zRpUo{1iW2KXqYxIHWe$6ns#o0aa53P8SI9R09Ym*P^Tpg!i2rZ^m-J$D~2a9e( zIwia(Sv*?$4!9(FfG;&l!5}*>qx1siCa?xZr@0LYa;4~viFD}+7Uh#;g z+t=Vqa;&1L053vHCB5Qg0D4m&Ii$iMyuIMf@Vt|oH6m_FmiWWH#Cr+%v!P2qb=5qT zj5#17tbu;Pc04^EN0;(WOQ#egO@geHA7S~+BD!Xh`Wu0#?^r?r=VSpKi&PfktO?*A z-G9K|Xvhp`i6IVim3Hnu1Xt7F)8pm!C|iOpBEYV&z-*S3&jUWSXMEoR+wB3m{?+}- zjB~`$w8-)Vll2=9ml<3}8IeDn*;^82+1}%ebede0~&?Mx1BIP=l$OE7IH~fF6Mt%O8c3OL} z*r?ym<%%y)788anyRmgr5FjA<@H`l%f(`b+a$7Skl3m@b4Ar-+8}gB@@Lu*Ji(CSX2j2&94jBntZ2aOH8AMyH_t?z+<-!< zjQJC7x;&UO(wEaefKQl1-T)rau{8qFJH6=?! zfXy*BR=%PvyrkX4MK5ab8vaOz=rRXdqhiTJnTYYgJ{>bs)B=!eTHoC8aW#<{ zjvsQeD%CaB0Tfz!h{uo`jE#-0naJTZDGmqz90TC@J!|FLV{~1slQ9%kK-0^x0R6O+ zKr<;#&A9Ars;zzp?L5tTctQ5p>f@-XP1*{x9~Zt!zWy;mDOqQ`HAvqyw_~7Vf%Q{l zzq%FG)l~cI*A9qLBX-;W;;6>C8{;7sH}g z5=q=|wY(V@>p%IiQu`+!6feg+3JaTZT;~povalM=N0g+1e1(C5Qe=o;Kwxaqk;=;< z*IvK3ktr30LUnaL?{SC>Y0lySs2eu#yT79HmuEcJAm@jEhp_^=Y@^TOKKGfp z+kL{_-(JADX=rEbNJ(-TkF*v3l<)sL3E+f0Nc_ z%am=oLe`+Nf=|8~Y)t{)ZCy{lLuN%_S{Z*kpr#H!=lU*K?`SDCqBO9y7-)6MEf0Z( zOb*6JoT_7w<=!lqxkXlLsjMqJdz68czT#^$e$3V!$yk$Y5QD<~0yHPY4{NP&u|Bgk zZv}B*5-qFfslH;nas|tV768o^*g&CF6X5>8JNfd{kSO?$Q_HdDPwwD&JTZ;qBL43P zSMeA#Yd$)a&~@{xQjFQFxUDBWj12`>WI)YN-@4y<)D|LG9u}kfB=yCz{Y~2DH7wC) zjFccn50_W&pUz4xENR6xNGTE8OglZ~WJk&{|3WjWoS|D_%Iz>=oF^R^gP z{WA z=C2OhJRO$S4a0vZ(JMn)byd{CTS)$$(G5(M_mI?l_E`&)@8<_--e0bfE*Ec?j5}Un z*_aUvuTi%zvx1@WvrOL~3_79Sr&h4tva@EyB9`EqkfdPP{A^`a_Lwi-b@}xls+>q> zX3JR~WHOE&@zY{3K;Qf7rR(L*+gGuO0PJe9=_~y@uu{e`I`uiCJ4;4?^@fJXQ-;TL zgyAnUu)h!xjR}Pq17stk7|d^Sup1WsB2!8so;d_6G?Gpl>PhoW8vJx%v%q;B{bFAT z=l9aBwYafIW8|mi&Vt;);9tN-NUL_)NUTf}1oHG#Sk|6L$DizdTZR4< z-wq!gUwPcbOU=0RD9Uu^O2gAH^Mv7X)6LaTGW>#_R);YIDgZY(ae?>od zcmJ`*wbUT(;hWb@v4SKE#+vPvsi8j*NH+HhJhFaW*sTRpdgRLrNoPR@?59?gUN^Z- zXxy;gIXA0Qfv%(BvAq`x&`;koffff1VW3|DC!T+=8Ns#p7(HT~sWItoKW?+~DLzGv z+z8O4!nPVn{?SYU;s%Z%Mv@q3dTtQfmC2$q6}xW@hy)&4dQHYaJsJcj|p#3A-?3S(ts1MI@68QX$_f=J}MjQMqtp)By*0NEyQ z6gaLK-Gp=53*n_sJpWgP+S9g%oY2?*%2EKNJmtax;w}sobZQewv<}@cts~^wIrxg6 zjZHyABmcA*zOAJ(0Sm31)|~9{j{+>LZ_+o7`j{F6)PThAL%dOe zpdSwn*0&$~yDmP{2K6-DSD#%Q>17$c@+};c;8<9Xh!bevlMrLQ<88z&9C-bYGCHUq zjLqeeTJ`}1R5{NdDT#^ej+Iya-VGpt@~#J1Quvpp2+Z-HFX_^cK0c=b+kC)wFsJ(8 z)95t-7Lf2Y+8O5|#i2}P$jL%XIN=914Db2kWEl{a!C$g~mb)=t2(*{vKt!kQ?hN=u z7DE}er)xPf*PF7o0Vk_+Ifd=fBW_`0B_D8@LOiF>{(vmzM0DOejTlW$d_Agl<*DGo zq*Z~3Xv%s)JrJ-69sqhrsU7@+2zvZ}z|Y zFCYoaX=tRS{rQ|>0m!Z`T65Z0{TdL>f#DJUM&d9a$Ld*OIbL+F2EZu{d;}Du?GZGX zBS(gZhcWz9-1_Y7Y@i|IQw1HlT3Y@p7xOf*qD+@4Il2Rr(JsSi9 zN7z$RV`p?>)(2=O|3!>{?8nciVb&eTK|sMN>b&w25W{V24@LoNjr2cL*V2F6nIvS) z_<&+;+Mzv|86+S(@Y7JPI?4-cz(EH}Y%TZD42u|MWq_u2O5R3MF^8n{K>&eGr@|fq z2yHAOZ~9Zj3hFOT32B5)?B`V<=IIRbZWi~8pZ$4HbhtH>2!mlXv*=Z2Xb9hT`-P4u zySkHy5HSv)uUWad_aMHgmS9q@dX!_W=}?9u=IVe;o>JLsRa$bGRA}73M(Sj$vo)GG zRXS$q)kbA*Vmqap&i9BRl?Z~`fuhfh6crU!R0cjjQgd{2N~`Nyj5n&YM?4!+%#^os zYzwDecC38nmZ!N6vsurhi#a6anTE z)f2Ot-8Sme_h2&C&0#)=MctfJ_0alRRV^*8)8ah6a-}4}f%#pjnijAY1+|BhU`)H+ zT=hK*89$_Sk!jg$A8wEudMw5Q1sk1+t2Lr2pnTTT>M>;x%B)Pa%4>kFpvG~=Wh~FI zwyLCLAJE>R$B00?%0=>mF>1aqBoAb8uKGFK+7hJmJppD}joRx5^5(U@JutWPZQ($C zXlEu+s4+O>1S+3mm-W%f$w^RiV?>GI-X;r;Wj~e|#_E1e1+2C3dqR7_f5crk#%nx~ zX8kEN>j78plX(5Z1>mgSD0(T&6Y9*oj3E{R;-4DzLrY2+kXxxKi^Z1Zy)e{8Ist!< zdLU~E#O~kcZ5~r5J$~I3t7WL8tDDf6XB~TU!{{N0-=yKPg@~GIneEKv4~2M%_t$_z z4b*1$1ns{8Vb?z#MqUU6y1z2OrkVSjuIAqek5Jq4DFWX^L?E4^Q!gI^ougN3Ir69R zJrtP;&o!*owVMFE%Hb@v#970_H?6?Xn3a-_JDFiGfEuh;FXc+l&y|q7<;5j!_oRDsb7EFo(r{{w#XFKV;k6!Gs@R#%j+Gry_x%-(xvh>*dSeAhunnb#E{$u0{5VNR^oNCM4R`c}!P0^h3}! zfc&=8cpdQV6$NG%cHMcBKKvZ4g~~_sf}jUIUpG=T@&vNcn1_mYf!!IQPsadBjKOo| zdms>*WT3YJ;~w*Xg#2D5?Q0Pb{={B{JDiFV7B(+992eJLjq&Nt_ z>$E`D${D{7G_7=CI_KvmVP$0R$p0 zYx|goC2WGHAZTj1fG?Jl-Dn{cq#gE-V43fyg0OG^mJWOY^p(Zt{e;)vKbjp*H=&2T zzjjNv+BMJj4A~E%1K#N?qA3fcA!FYq0|m1bADur6(YPvo&b!PiRO6E3)F-qILfbIi zFW>W1;MAqgp_57&(XOMTBd_8V(3t?I@&M0G;AsPzSD@s*!20I_7)i_nyqf_OhF=67 z-VBwZK;Ewg(h;y&uB(GgAPgXvdJ9ubMzS?144hSfDI)jw@@w|GM(uQ;r;9)^?sImu zjqVfKe(~io0*I_ZV7pFYGg*@5wmrL?3w3LSQ`u*+R>Z+9i7KA;0u zQ&DN`&z`mDRR#8hv4Gt_{{H?TL;`KKzI`JuQ0ua=vnTPG;s<74Pp<}&u2m=V+mu#(Z|+t7l_rG%!Yrem)7k6FgaD5>E*DpQ+{-_-m=ho zZZR-U6(b`k$lCze06Q-O3pw1G#TlQIo}OM)gSt4|h5%-I5DRF?sN(<(1cXtZIjNIn zHi?Y#nJJ!@Lug$Plz~PqzxGg zi-=Bqdi$tAw{#6)w6EYHBOV?n8H$Pf=_Ek^eX1UKxH+}X0Uq)}Ms`ok^K;Ck|KQgj z;4}12GZ9HRfJy*g;q^DjGbeve;E*pZ*)pn{o0|hb0`vNjwll^57xJ zA%hBB0d)v~3VLkI1JR;PA#<{HKKlTB2;U>riIY@LOiavyX|+#HxU4Ef*scv{0qY&H zGdDNq(kWt$dhY~6+6tMN@edJ*QYJDzM(GszBxsrKA(2z1R+;7PYjU7WiEh!tjU6Rx zW%Wz&O#sIt1PNA{Yn13EJ>x$f@nez7BciMP90!m?j&n0$2Y{|d@zpG&=dji}zP z%Yn~cJ_AJp^*tB(wE-|;#VHL9FqTb8BC%l*tQmyu|1^M*xOU(f%(AaA2cD*LK<(k- z0jA^B#y5W_eiW6fQ@jKqnJ-{#gDP&3fU9N)Sl2|Um6oBQVZHA;K;^Uy_}AV8OgJFo zY+;dg5tyAF7axyws{B-9mZeo-2pksRAn4n&unY?TOV>d^t$&%oC6>Kz`dTY#CJ_kPXpQZdO47So%=#vUHM6pfyE~B+Xw@Rp=rFqXu{_6 z*sw*}a))`D^Lgeq&e41W5kia`rNcJz;iJ5HKnVe!uu@Xf-1GHG;4Nx?kXymu7^yc< zv|%#BgGf>Ecp(S~%)h5u#eeV#Rn^qg?C^2k77~;_kNQna)j@PFifCMQ{@8CAG!o^0 zHWv?8;}K>xu3xRB7`WO39^Gtevm3=Ib>j=EW%$)^C0rWA5qcuyo= z0T2t&R$|tuu$`6w=jsEQFiJuDKj1p2z#M3W98DViaRFWZ6lU*e#`;6(2_gb`89?kG zN3+>DISoPC0TLmg^JAtO?CY%1-2fhDgt3^J>V8pV51GxI9FSIQ%K=M1A4HOKP{D!L zJb3JoG$yfW&va_%y-@kdT%n&IZ|Io?FxU6j91LsVwz^{3zy^mn0Aj#OfcC#qpEGB~ zvQQfY7r589SZ&82P2Ct$jokN0Fmo7PD!5H8LysRmXNTW+)s0ObLcmDi6%O-NF6+YKGGk^bm%^?a#~{7{2@e;LB!Cqt zpK(oO?*?I@7V(i9l*8b;5!VRs{e)fcfM@_v{{;wSO9<4kv-!hm;A)4fnXt8Tpis4| z-Yf&=1D@ot(etFg20Yc|;1EEY$<0GBH_0*IlW#68gYh#l=)@@tucib1`)46W`C%$p zrHpFr;VqL2&5WO5udf`S6Hrw|fQUM2kqMgYK8W^k$oZ-=#w->(V*mh$xU8wSjeoi? z37+l*s)i5XG7+G_0!9t&&w^p-)6J;S1*tow%ftg9z10I3q%d^#<#w?6_%Q%?7R2i* zAq1W!RM)|TfN;Ue%8=TdD1hFEq7#LjG6p0Zq|l8kTh-hA!hkY^C3joAHwIJ!C7>ic z1!5qjIlHMobt+%*bd|oZPco~jCYO;wKjsCNoKKhmQ>H)u(msCzRs%$Dpr=Zneo~U0 z#e>2COEA-};E5zp+5pgN@7x~7{QA{5aPj^`0Xv|jmG4Kk{L|NI_~*_4VPX4U4dOdA ze73fo&mqGHyPo;}{itGkS%>$WSGy#naaCR$JB_`MymyX?Li1b;BC2%*R%gmYgZml_1dnNuaaz` z*h!K|lFXC_Q7dGYc@CK=lqnf2DN~Xu3L#U5D08NEB}2$m=3!@^GKEDr_o}_Gb6wy0 z&Nkc?fIU) z+sZE8U{kNXE7hW~94RIGWY|C6mDm_9pHyGPiryXeW2y*i z@0z;FB}R&aG@29=H0~R}s_i(Ueb zRGV+1qODKadyBMhoBTjrh##CROISXh|5|q}@$%ksYQ(k&%(>>+6?tj~_T- z3QYdjDmOGX_T^bKumdQIA38Jw>iChmVr|M^sp!;gt9-rrdhd*hakqU3)?c-Ljw$y% ze>iJLrc%n}Wg1GiAIn$IobiDNqJ>3DU|`*y-F$Nk2M9av|K9l*qOk z&*e)sDYxnt_xzlQ)3Jo*Ns7dzB=TJV>!9}7FyTNbpFz=s@g>eC()@^hd(KUIV#@-s z+?OnUCN?&2s9KhiEZ?0w_Z!%F%#GdYD!2R0ND}hyV*iKODb@Ajl?{fIHqG{vLECmR zFubzsIZ3>y$aU(*f)$Z?>+anTkRSZlm5n8LMTT`R_nK}fu&?}l5O+>hW>o+22Zw-w zy+c-GbxTVaDIp=@X5$E)e`c9Fcbuwk^R{09wmmM(xsURu&!MX=tp;BkX%C8TQh5j{ zkc1vLOnr2CxqLsyo$jiyzXI}>q5a~Rn3z%7jr`lU&q+&fna^p|ePscaM4z3V9mZ2& zbCL|~yu6oDe?vnYc*F_S0a(9t^GwLE|@oVF)!xSjYaLA zxohLA208&34&2q94m)-^WWljO=!dVy`Sa(eRDJ#Ypr7Dz3Eg>JuAGyXXLjO07xhL1 zqMPoVIpO#@o`{u|6_}JQlSn6yALr!aa&cK-W?g|aZ29q#iK(fny*(QXOC4`i-4LTR zKn0(mpabFwT3cpTmXfTjtb&5Ay?v_J9vYPXSi}fqM_h5=NvC`CiB~*3Pe0e-2}lG` zv}|}{ZEk+lyf%Dg7iVeH~l~H;_(xrEUZsH8~*yv~x;0shh0NY2; zV@>SsDwAl`NqcfjJ2c!tLkWKLXY8} z;sQgs7aVMuXQis76kJi^4LW$2%`5GSCQrn`z`(I%$H4Ev#1s^9usPkW>U23YN+cG` z#<++Yvya*Xo2E-DMn^}1hg@7;8Hm7X3-w}s@7}-99n1lRC@3fZry*Gl(G9YT$$1kjqiBaaKMBX?#$c>-NFc&r9i*X|+P9NL-p`+u3sAyhZUO0Vo zQxkiHd{R=RA!Z|1h=)Sp`|xT_p0tSY`}vc z`anKnNluRRm2G1;1H)USX-PQQ?GDN5)|TI>*vreyfttQa&Y03;g=gP0)}P$z zr?oR~V7A-$!TUg__~TcJNlmbB(AU?$>*q&X)Cu4bji?xFM(#uQU5D6C$KhyLI?%`1#$?W*Svmp{0wIdgVW)s=Ii1=s+F88&uyIPA8v(4wMy z?LxXnTwEN|P>E9K>-^pQRw^YW_mb8de`hs(*KsBdkY@gRDY_m#8KrPn0Q38Z0LSDJ zBek@%^LN;1Iu|}qOY5J#j$K^x+rgbR@#_nzK|w)iyX=Xmh^z5{DKx3hX#Ed^OCz(_ zQLeFffSP#u_}XH{Ke4Ib2P_CZJlAUDY-^jL$n`2`xiM|xEN40$pVPtd4G!_L(~9X{ zpQvJKw9_Sf^wA_r$;`YA!NcN4x$KyT0P5T0Dg#y~>O0hTh_3#`1l-BT_#mNJi_$w^ z?`|}%(cX;HFF4W`BhBE)!f@X8nhhIo?9*@LobK6YzhI(Bk5v@hnO(HW!Cx;6VP)Y} z?m>E~$Th#Xn4Otv#?!N~uuxff#v-UFw6v_O0vdR4@5Nzr4-XF)mqme+^DamS*NQ!0 z9s)GcS=YR2xF6WMwN=!tn%*BKE3)Gg6PN?F9ZWNq=kBjxJH7U{GECPx-*03@TCThO z_C2Y@p}HstPtr^06iiIm;~SwJmZYXynwgo&$W)=1Gm<@%m6e66fHv}^cSb!D(Jbjl zcejD*+?NlXoh3y@MUA{$0ul`j4Rs5UQqfwIMLo&NDkHlw+I|7M?`&zACwB*B{o*vO(!}Rad7A z=H|&!QBi013zoM8iO!0-D5)&mZ?LhMisN)kaaUSQo!T7vGX->q%H4vCIq-OqZ( z6O@&-Hk;vnyvS16gjV+Ul8(cQ#>V|MVTVHYp4ho(PbaFncjUg154KiT`12Qj|9}8J z=u@ygRZ~|NxLAsft7>tN)W68hIL=p)_qrh8{BeYpot*@P1t96ck&#y;f)I7Ceyu|E z3y6so=I1-(kzj^l+Iy3I8ENy%!~1Nbelo&?BYkvftT%IwxB$Wzsr@zEBh!r2MT2ys-_lbQrtS7|V z)xOBEkIs3ivxMQ+d78qbvm)mCv6WuDlZT2!X(*XzJirA7+ur=6RMg=;5;$T=>`G@i zY)aYK*ccf#baZ5?w$afwR#)r5NC&VNLLoe67pIV^(0*JKQ&CjxCPy6WsXT>umuAr! zoJSLQW@ZNJm=^}Vkv#+l_UXE0H6jrn4$v#TF62(jD2?8aJVz)f5*`A-K~YZQIsOh+ zB89z-;Lu2NahIa2OVhP2Jv~a29*V`UA0_jBJ#k_;!@D!uicM1!|6w>h9)zwv7OD=lib@5((v}VE8zq|2|wQ$wk z+I8~C`OGBg1NRc6)6As~9IB<2?|qiL=f%F0firP`dI%%aQv~{MOMvZlGT{^ z&WnHyqoIfp&CvWNvNd>gwMJE++e`cy z$jywR|I?U#!6|R&Zyn`7c2I5ZtQjKAG{5blBb0LM>FaNh8ol8MZ;vsRicaOjr&wwm zs%CD?C_KHMXSI1paOD`LYiSR=i_D}N4kVe*P%`4OhO$p0XZg8nb> z@ynv_|0anUFP1XkZ5Sq|rrNATxoE5`@Z-1i8^LFUX5$_O;o>o#2>C3n$AbGq?!K_3 zAjC=j5coMH_HRpb7gc|CJQ`2IbW(5^P6PWGJ&{jNTkbzKxwsyBr;%W%rr`T2vx_8v_^3Nlk(e6N4Y-z8`qh@v#Vx6InUq`p*QOT1XOiYF5b&>b)(=L8KJ0em<{^&a7 zNL3ue1cIxYS~FS`&(y3P92_oR&XiBS6eBDw3@8q5-72P`wwA;9lPK$s9VXE0F@ypG zXDv-lAc#QS;@sS;=)!<;0Q`a&*F_0fel`NB1+GPd9wSyR5R>rMYcc1~tG1#mB)QyA zPW!N*gtoqehy=Trm9<0cvX#|^jJ7v#-jw`y6N z4<67DkM#E&hstW8%a3UakfM~@L%vp`d+rdMy1OTbhZi$g_y1%iASQc)frKqk<)El= zgmMcDKQuoAu95p(h4v!OSwcaj_B4S< zw6m>V=zu6Zc<=xyQZ9@uA~JF((U+J&O!#DIlyG6@y0}EVB(%eQA=-w9SzTo0g4wbs zlHPG;5pFe#%5CO$b`1~d+@BK&24r{7%JAB{I&!a{o<0ZC5U|(%`}Z+G=Xpe1OAA^c zyxWpfQ@2u5LKm@p+-j3w@SyB(+>UUuv$5GDY(_RYl;!;X{X3k@ey7^ZRnz_GW$!P< zoRT8r$}X)6!0$`X#ug8t*esgm?t@M`&YN@YZ$E3nT%J0z4ETSWw+`jhLt?a-V*fWfM77IyySW^K{qL_#b3jM6x*U zkJ{1FWF?A>=j`YRjc93h_An1mqP1SS#!jMLZ)r^?S<5EVp&?A-w0CqAmz1QWrpCi; z7Al~mWW~#u%~e&y)u9K#DdCMjJ39*n;$s0gH2JGsPCBK9g{j}TQDVUVE&jG5*MunN z{2|IOn55C*X6)?8$HZ6xH7#vHPL9L1YcV30%23S;@)78tGj)-GUghRugsm35!I{B* zrvEI2Xekb6VKdn?XDTt*f+!Hm0v%iHtH6vE>!L@y`W8a}-hj^}WmM6No7K`qg@s?1 zm3cZm##TY2nqk<~&W@jvT4^_0h?Eqj|6J6`K%=sb65=c2qI?ng6#l=g{rwb*1cCs| zzQ%V<=8F4%Uh0?eB`^q+D)~SCk6`5g11QXFP*kUf7Vxckye7Y$oV2o3HqrRje*kx| B&0qik diff --git a/ui/problem_data.csv b/ui/problem_data.csv index 73811f7..4b15889 100644 --- a/ui/problem_data.csv +++ b/ui/problem_data.csv @@ -20559,3 +20559,15 @@ F,Cactus to Tree,3000.0,"[dp, graphs, trees]",PROGRAMMING,980,Codeforces Round # 1,Codeforces Beta Round #1,12,Theatre Square,,A,1266580800,[math],PROGRAMMING 1,Codeforces Beta Round #1,12,Spreadsheet,,B,1266580800,"[implementation, math]",PROGRAMMING 1,Codeforces Beta Round #1,12,Ancient Berland Circus,,C,1266580800,"[geometry, math]",PROGRAMMING +979,Codeforces Round #482 (Div. 2),2,"Pizza, Pizza, Pizza!!!",500.0,A,1526308500,[math],PROGRAMMING +979,Codeforces Round #482 (Div. 2),2,Treasure Hunt,1000.0,B,1526308500,[greedy],PROGRAMMING +979,Codeforces Round #482 (Div. 2),2,Kuro and Walking Route,1250.0,C,1526308500,[dfs and similar],PROGRAMMING +979,Codeforces Round #482 (Div. 2),2,Kuro and GCD and XOR and SUM,1750.0,D,1526308500,"[bitmasks, brute force, data structures, strings, trees]",PROGRAMMING +979,Codeforces Round #482 (Div. 2),2,Kuro and Topological Parity,2250.0,E,1526308500,[dp],PROGRAMMING +978,Codeforces Round #481 (Div. 3),12,Remove Duplicates,,A,1526202300,[implementation],PROGRAMMING +978,Codeforces Round #481 (Div. 3),12,File Name,,B,1526202300,"[greedy, strings]",PROGRAMMING +978,Codeforces Round #481 (Div. 3),12,Letters,,C,1526202300,"[binary search, implementation, two pointers]",PROGRAMMING +978,Codeforces Round #481 (Div. 3),12,Almost Arithmetic Progression,,D,1526202300,"[brute force, implementation, math]",PROGRAMMING +978,Codeforces Round #481 (Div. 3),12,Bus Video System,,E,1526202300,[math],PROGRAMMING +978,Codeforces Round #481 (Div. 3),12,Mentors,,F,1526202300,"[binary search, data structures, implementation]",PROGRAMMING +978,Codeforces Round #481 (Div. 3),12,Petya's Exams,,G,1526202300,"[greedy, implementation, sortings]",PROGRAMMING diff --git a/ui/problem_ratings.csv b/ui/problem_ratings.csv index a75aa97..1ccf0fc 100644 --- a/ui/problem_ratings.csv +++ b/ui/problem_ratings.csv @@ -4011,3 +4011,15 @@ contestID,problemID,problemRating 8,C,1759 8,D,2342 8,E,2258 +979,A,1153 +979,B,1892 +979,C,1657 +979,D,2251 +979,E,2781 +978,A,845 +978,B,852 +978,C,1159 +978,D,1568 +978,E,1476 +978,F,1561 +978,G,1803 diff --git a/ui/user_activity.csv b/ui/user_activity.csv index 8880a96..f70c3a0 100644 --- a/ui/user_activity.csv +++ b/ui/user_activity.csv @@ -1,498 +1,548 @@ author,contestID,id,language,memoryBytes,participantType,passedTestCount,points,problem_index,problem_name,problem_tags,relativeTimeSeconds,startTimeSeconds,testset,timeMilliseconds,verdict -Mindjolt,859,38101536,GNU C++14,11366400,PRACTICE,35,750.0,B,Lazy Security Guard,"[brute force, math]",2147483647,1525985966,TESTS,30,OK -Mindjolt,859,38101432,GNU C++14,11366400,PRACTICE,4,750.0,B,Lazy Security Guard,"[brute force, math]",2147483647,1525985559,TESTS,30,WRONG_ANSWER -Mindjolt,579,38101258,GNU C++14,3379200,PRACTICE,36,250.0,A,Raising Bacteria,[bitmasks],2147483647,1525984630,TESTS,31,OK -Mindjolt,46,38101212,GNU C++14,3379200,PRACTICE,30,0.0,B,T-shirts from Sponsor,[implementation],2147483647,1525984406,TESTS,62,OK -Mindjolt,46,38101205,GNU C++14,3379200,PRACTICE,30,0.0,B,T-shirts from Sponsor,[implementation],2147483647,1525984406,TESTS,62,OK -Mindjolt,46,38101178,GNU C++14,3379200,PRACTICE,11,0.0,B,T-shirts from Sponsor,[implementation],2147483647,1525984205,TESTS,30,WRONG_ANSWER -Mindjolt,387,38100934,GNU C++14,3379200,PRACTICE,47,500.0,A,George and Sleep,[implementation],2147483647,1525983085,TESTS,30,OK -Mindjolt,610,38066137,GNU C++14,3379200,PRACTICE,76,500.0,A,Pasha and Stick,"[combinatorics, math]",2147483647,1525856911,TESTS,31,OK -Mindjolt,805,38065728,GNU C++14,3891200,PRACTICE,42,1000.0,B,3-palindrome,[constructive algorithms],2147483647,1525855764,TESTS,31,OK -Mindjolt,805,38065664,GNU C++14,3379200,PRACTICE,2,1000.0,B,3-palindrome,[constructive algorithms],2147483647,1525855592,TESTS,15,WRONG_ANSWER -Mindjolt,805,38065639,GNU C++14,3379200,PRACTICE,2,1000.0,B,3-palindrome,[constructive algorithms],2147483647,1525855538,TESTS,15,WRONG_ANSWER -Mindjolt,519,38064453,GNU C++14,3379200,PRACTICE,65,500.0,A,A and B and Chess,[implementation],2147483647,1525852484,TESTS,31,OK -Mindjolt,23,38062029,GNU C++14,3481600,PRACTICE,45,0.0,A,You're Given a String...,"[brute force, greedy]",2147483647,1525845416,TESTS,30,OK -Mindjolt,23,38061949,GNU C++14,3379200,PRACTICE,4,0.0,A,You're Given a String...,"[brute force, greedy]",2147483647,1525845236,TESTS,30,WRONG_ANSWER -Mindjolt,980,38036485,GNU C++14,3379200,CONTESTANT,88,1000.0,B,Marlin,[constructive algorithms],2854,1525794754,TESTS,31,OK -Mindjolt,980,38028329,GNU C++14,3379200,CONTESTANT,69,500.0,A,Links and Pearls,"[implementation, math]",630,1525792530,TESTS,31,OK -Mindjolt,980,38027462,GNU C++14,3379200,CONTESTANT,4,500.0,A,Links and Pearls,"[implementation, math]",507,1525792407,PRETESTS,15,RUNTIME_ERROR -Mindjolt,460,38022154,GNU C++14,3379200,PRACTICE,26,500.0,A,Vasya and Socks,"[brute force, implementation, math]",2147483647,1525786979,TESTS,31,OK -Mindjolt,460,38022067,GNU C++14,3686400,PRACTICE,6,500.0,A,Vasya and Socks,"[brute force, implementation, math]",2147483647,1525786771,TESTS,15,WRONG_ANSWER -Mindjolt,460,38022007,GNU C++14,3584000,PRACTICE,0,500.0,A,Vasya and Socks,"[brute force, implementation, math]",2147483647,1525786645,TESTS,1000,TIME_LIMIT_EXCEEDED -Mindjolt,952,36884908,PyPy 2,0,PRACTICE,0,0.0,C,Ravioli Sort,[implementation],2147483647,1522689332,TESTS,0,COMPILATION_ERROR -Mindjolt,952,36884870,PyPy 2,22835200,PRACTICE,4,0.0,C,Ravioli Sort,[implementation],2147483647,1522689243,TESTS,77,WRONG_ANSWER -Mindjolt,952,36884750,GNU C++,3481600,PRACTICE,15,0.0,A,Quirky Quantifiers,[math],2147483647,1522688971,TESTS,15,OK -Mindjolt,952,36884740,GNU C++,0,PRACTICE,0,0.0,A,Quirky Quantifiers,[math],2147483647,1522688944,TESTS,0,COMPILATION_ERROR -Mindjolt,518,36437840,GNU C++14,3379200,PRACTICE,3,500.0,A,Vitaly and Strings,[strings],2147483647,1521562932,TESTS,30,WRONG_ANSWER -Mindjolt,518,36437826,PyPy 2,0,PRACTICE,0,500.0,A,Vitaly and Strings,[strings],2147483647,1521562885,TESTS,0,COMPILATION_ERROR -Mindjolt,518,36437814,GNU C++,0,PRACTICE,0,500.0,A,Vitaly and Strings,[strings],2147483647,1521562816,TESTS,0,COMPILATION_ERROR -Mindjolt,208,36437725,PyPy 2,22835200,PRACTICE,71,500.0,A,Dubstep,[strings],2147483647,1521562528,TESTS,280,OK -Mindjolt,208,36437709,GNU C++,0,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1521562490,TESTS,0,COMPILATION_ERROR -Mindjolt,877,36294078,GNU C++,2048000,PRACTICE,2,1000.0,B,Nikita and string,"[brute force, dp]",2147483647,1521104242,TESTS,0,WRONG_ANSWER -Mindjolt,271,36231394,GNU C++,2048000,PRACTICE,4,1500.0,C,Secret,"[constructive algorithms, implementation]",2147483647,1520876378,TESTS,30,WRONG_ANSWER -Mindjolt,271,36231349,GNU C++,2048000,PRACTICE,5,1500.0,C,Secret,"[constructive algorithms, implementation]",2147483647,1520876249,TESTS,996,WRONG_ANSWER -Mindjolt,271,36231276,GNU C++,2048000,PRACTICE,4,1500.0,C,Secret,"[constructive algorithms, implementation]",2147483647,1520876060,TESTS,30,WRONG_ANSWER -Mindjolt,689,36224508,GNU C++,2150400,PRACTICE,94,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520859511,TESTS,15,OK -Mindjolt,689,36224471,GNU C++,2150400,PRACTICE,9,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520859437,TESTS,15,WRONG_ANSWER -Mindjolt,689,36224412,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520859294,TESTS,0,WRONG_ANSWER -Mindjolt,689,35974480,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520274604,TESTS,15,WRONG_ANSWER -Mindjolt,689,35974459,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520274514,TESTS,15,WRONG_ANSWER -Mindjolt,689,35972031,GNU C++,2048000,PRACTICE,24,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520267804,TESTS,15,WRONG_ANSWER -Mindjolt,689,35971993,GNU C++,2150400,PRACTICE,24,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520267713,TESTS,15,WRONG_ANSWER -Mindjolt,689,35971970,GNU C++,2048000,PRACTICE,0,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520267654,TESTS,0,WRONG_ANSWER -Mindjolt,689,35970872,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520264949,TESTS,0,WRONG_ANSWER -Mindjolt,689,35970804,GNU C++,2048000,PRACTICE,8,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520264788,TESTS,15,WRONG_ANSWER -Mindjolt,689,35970717,GNU C++,2048000,PRACTICE,1,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520264556,TESTS,15,WRONG_ANSWER -Mindjolt,689,35969713,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520262236,TESTS,15,WRONG_ANSWER -Mindjolt,689,35968528,GNU C++,2048000,PRACTICE,8,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520259756,TESTS,15,WRONG_ANSWER -Mindjolt,689,35968464,GNU C++,2150400,PRACTICE,8,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520259623,TESTS,15,WRONG_ANSWER -Mindjolt,689,35968230,GNU C++,2048000,PRACTICE,0,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520259073,TESTS,0,WRONG_ANSWER -Mindjolt,689,35968205,GNU C++,2048000,PRACTICE,0,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520259034,TESTS,0,WRONG_ANSWER -Mindjolt,689,35968187,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520259000,TESTS,15,WRONG_ANSWER -Mindjolt,689,35968143,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520258934,TESTS,0,WRONG_ANSWER -Mindjolt,689,35968134,GNU C++,0,PRACTICE,0,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520258917,TESTS,0,COMPILATION_ERROR -Mindjolt,467,35808431,GNU C++,2048000,PRACTICE,43,1000.0,B,Fedor and New Game,"[bitmasks, brute force, constructive algorithms, implementation]",2147483647,1519899945,TESTS,15,OK -Mindjolt,467,35806478,GNU C++,2048000,PRACTICE,5,1000.0,B,Fedor and New Game,"[bitmasks, brute force, constructive algorithms, implementation]",2147483647,1519894315,TESTS,15,WRONG_ANSWER -Mindjolt,467,35806454,GNU C++,2048000,PRACTICE,3,1000.0,B,Fedor and New Game,"[bitmasks, brute force, constructive algorithms, implementation]",2147483647,1519894234,TESTS,15,WRONG_ANSWER -Mindjolt,467,35806222,GNU C++,2048000,PRACTICE,5,1000.0,B,Fedor and New Game,"[bitmasks, brute force, constructive algorithms, implementation]",2147483647,1519893568,TESTS,15,WRONG_ANSWER -Mindjolt,257,35780076,GNU C++,2150400,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810543,TESTS,560,WRONG_ANSWER -Mindjolt,257,35780018,GNU C++,2150400,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810394,TESTS,592,WRONG_ANSWER -Mindjolt,257,35780009,GNU C++,2048000,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810368,TESTS,592,WRONG_ANSWER -Mindjolt,257,35779982,GNU C++,2048000,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810298,TESTS,592,WRONG_ANSWER -Mindjolt,257,35779940,GNU C++,2150400,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810212,TESTS,592,WRONG_ANSWER -Mindjolt,257,35779908,GNU C++,2048000,PRACTICE,2,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810146,TESTS,30,WRONG_ANSWER -Mindjolt,257,35779895,GNU C++,0,PRACTICE,0,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810105,TESTS,0,COMPILATION_ERROR -Mindjolt,257,35779889,GNU C++,0,PRACTICE,0,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810092,TESTS,0,COMPILATION_ERROR -Mindjolt,257,35779871,GNU C++,0,PRACTICE,0,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810055,TESTS,0,COMPILATION_ERROR -Mindjolt,257,35779737,GNU C++,2252800,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519809712,TESTS,592,WRONG_ANSWER -Mindjolt,257,35779651,GNU C++,2252800,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519809504,TESTS,654,WRONG_ANSWER -Mindjolt,257,35779525,GNU C++,2252800,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519809219,TESTS,592,WRONG_ANSWER -Mindjolt,257,35778811,GNU C++,2150400,PRACTICE,0,500.0,A,Sockets,"[greedy, implementation, sortings]",2147483647,1519807374,TESTS,0,WRONG_ANSWER -Mindjolt,257,35778779,GNU C++,2048000,PRACTICE,0,500.0,A,Sockets,"[greedy, implementation, sortings]",2147483647,1519807303,TESTS,30,WRONG_ANSWER -Mindjolt,257,35778772,GNU C++,0,PRACTICE,0,500.0,A,Sockets,"[greedy, implementation, sortings]",2147483647,1519807277,TESTS,0,COMPILATION_ERROR -Mindjolt,116,35763851,GNU C++,2048000,PRACTICE,71,500.0,A,Tram,[implementation],2147483647,1519738510,TESTS,30,OK -Mindjolt,363,35763684,GNU C++,2662400,PRACTICE,51,1000.0,B,Fence,"[brute force, dp]",2147483647,1519738250,TESTS,218,OK -Mindjolt,363,35763643,GNU C++,2048000,PRACTICE,1,1000.0,B,Fence,"[brute force, dp]",2147483647,1519738178,TESTS,0,WRONG_ANSWER -Mindjolt,363,35763595,GNU C++,2048000,PRACTICE,2,1000.0,B,Fence,"[brute force, dp]",2147483647,1519738107,TESTS,0,WRONG_ANSWER -Mindjolt,363,35763569,GNU C++,2048000,PRACTICE,1,1000.0,B,Fence,"[brute force, dp]",2147483647,1519738061,TESTS,15,WRONG_ANSWER -Mindjolt,363,35763553,GNU C++,2048000,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519738025,TESTS,15,WRONG_ANSWER -Mindjolt,363,35763524,GNU C++,2048000,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737976,TESTS,0,WRONG_ANSWER -Mindjolt,363,35763500,GNU C++,2048000,PRACTICE,1,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737928,TESTS,15,WRONG_ANSWER -Mindjolt,363,35763468,GNU C++,2048000,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737858,TESTS,0,WRONG_ANSWER -Mindjolt,363,35763404,GNU C++,2048000,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737730,TESTS,0,WRONG_ANSWER -Mindjolt,363,35763376,GNU C++,2048000,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737687,TESTS,0,WRONG_ANSWER -Mindjolt,363,35763368,GNU C++,0,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737666,TESTS,0,COMPILATION_ERROR -Mindjolt,186,35763135,GNU C++,2457600,PRACTICE,53,500.0,A,Comparing Strings,"[implementation, strings]",2147483647,1519737247,TESTS,92,OK -Mindjolt,186,35763118,GNU C++,0,PRACTICE,0,500.0,A,Comparing Strings,"[implementation, strings]",2147483647,1519737224,TESTS,0,COMPILATION_ERROR -Mindjolt,186,35762988,GNU C++,2048000,PRACTICE,4,500.0,A,Comparing Strings,"[implementation, strings]",2147483647,1519737006,TESTS,30,WRONG_ANSWER -Mindjolt,186,35762860,GNU C++,2457600,PRACTICE,31,500.0,A,Comparing Strings,"[implementation, strings]",2147483647,1519736820,TESTS,92,WRONG_ANSWER -Mindjolt,143,35762723,GNU C++,2048000,PRACTICE,52,500.0,A,Help Vasilisa the Wise 2,"[brute force, math]",2147483647,1519736608,TESTS,30,OK -Mindjolt,143,35762681,GNU C++,2048000,PRACTICE,5,500.0,A,Help Vasilisa the Wise 2,"[brute force, math]",2147483647,1519736537,TESTS,30,WRONG_ANSWER -Mindjolt,143,35762628,GNU C++,2048000,PRACTICE,5,500.0,A,Help Vasilisa the Wise 2,"[brute force, math]",2147483647,1519736434,TESTS,30,WRONG_ANSWER -Mindjolt,143,35762529,GNU C++,2048000,PRACTICE,3,500.0,A,Help Vasilisa the Wise 2,"[brute force, math]",2147483647,1519736315,TESTS,30,WRONG_ANSWER -Mindjolt,143,35762462,GNU C++,2048000,PRACTICE,0,500.0,A,Help Vasilisa the Wise 2,"[brute force, math]",2147483647,1519736174,TESTS,0,WRONG_ANSWER -Mindjolt,34,35762060,GNU C++,2048000,PRACTICE,20,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735499,TESTS,30,OK -Mindjolt,34,35762037,GNU C++,2048000,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735457,TESTS,0,WRONG_ANSWER -Mindjolt,34,35762024,GNU C++,0,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735432,TESTS,0,COMPILATION_ERROR -Mindjolt,34,35761999,GNU C++,0,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735389,TESTS,0,COMPILATION_ERROR -Mindjolt,34,35761986,GNU C++,0,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735363,TESTS,0,COMPILATION_ERROR -Mindjolt,34,35761963,GNU C++,0,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735307,TESTS,0,COMPILATION_ERROR -Mindjolt,34,35761946,GNU C++,0,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735272,TESTS,0,COMPILATION_ERROR -Mindjolt,43,35729455,GNU C++,2150400,PRACTICE,34,500.0,A,Football,[strings],2147483647,1519644161,TESTS,30,OK -Mindjolt,43,35729261,GNU C++,0,PRACTICE,0,500.0,A,Football,[strings],2147483647,1519643778,TESTS,0,COMPILATION_ERROR -Mindjolt,43,35729242,GNU C++,2048000,PRACTICE,0,500.0,A,Football,[strings],2147483647,1519643730,TESTS,0,WRONG_ANSWER -Mindjolt,43,35729199,GNU C++,2048000,PRACTICE,0,500.0,A,Football,[strings],2147483647,1519643655,TESTS,0,WRONG_ANSWER -Mindjolt,43,35729184,GNU C++,0,PRACTICE,0,500.0,A,Football,[strings],2147483647,1519643625,TESTS,0,COMPILATION_ERROR -Mindjolt,43,35729164,GNU C++,0,PRACTICE,0,500.0,A,Football,[strings],2147483647,1519643568,TESTS,0,COMPILATION_ERROR -Mindjolt,224,35678415,GNU C++17,1945600,PRACTICE,27,500.0,A,Parallelepiped,"[brute force, math]",2147483647,1519560697,TESTS,30,OK -Mindjolt,224,35678385,GNU C++17,1945600,PRACTICE,13,500.0,A,Parallelepiped,"[brute force, math]",2147483647,1519560645,TESTS,30,WRONG_ANSWER -Mindjolt,224,35678235,GNU C++17,0,PRACTICE,0,500.0,A,Parallelepiped,"[brute force, math]",2147483647,1519560393,TESTS,0,COMPILATION_ERROR -Mindjolt,488,35677924,GNU C++17,1945600,PRACTICE,35,500.0,A,Giga Tower,[brute force],2147483647,1519559866,TESTS,15,OK -Mindjolt,488,35677872,GNU C++17,1843200,PRACTICE,0,500.0,A,Giga Tower,[brute force],2147483647,1519559772,TESTS,0,WRONG_ANSWER -Mindjolt,488,35677829,GNU C++17,1843200,PRACTICE,0,500.0,A,Giga Tower,[brute force],2147483647,1519559698,TESTS,0,WRONG_ANSWER -Mindjolt,488,35677800,GNU C++,0,PRACTICE,0,500.0,A,Giga Tower,[brute force],2147483647,1519559653,TESTS,0,COMPILATION_ERROR -Mindjolt,389,35571129,GNU C++,2048000,PRACTICE,34,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297825,TESTS,15,OK -Mindjolt,389,35571086,GNU C++,2048000,PRACTICE,0,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297718,TESTS,187,WRONG_ANSWER -Mindjolt,389,35571032,GNU C++,2048000,PRACTICE,0,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297579,TESTS,0,WRONG_ANSWER -Mindjolt,389,35570967,GNU C++,2048000,PRACTICE,0,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297406,TESTS,15,WRONG_ANSWER -Mindjolt,389,35570890,GNU C++,0,PRACTICE,0,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297209,TESTS,0,COMPILATION_ERROR -Mindjolt,389,35570862,GNU C++,2048000,PRACTICE,0,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297148,TESTS,0,WRONG_ANSWER -Mindjolt,300,35570341,GNU C++,2048000,PRACTICE,20,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295744,TESTS,30,OK -Mindjolt,300,35570294,GNU C++,2048000,PRACTICE,1,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295639,TESTS,30,WRONG_ANSWER -Mindjolt,300,35570265,GNU C++,2048000,PRACTICE,0,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295550,TESTS,0,WRONG_ANSWER -Mindjolt,300,35570248,GNU C++,0,PRACTICE,0,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295507,TESTS,0,COMPILATION_ERROR -Mindjolt,300,35570193,GNU C++,0,PRACTICE,0,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295379,TESTS,0,COMPILATION_ERROR -Mindjolt,300,35570148,GNU C++,0,PRACTICE,0,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295232,TESTS,0,COMPILATION_ERROR -Mindjolt,114,35569733,GNU C++,2048000,PRACTICE,64,500.0,A,Cifera,[math],2147483647,1519293823,TESTS,30,OK -Mindjolt,114,35569710,GNU C++,2048000,PRACTICE,0,500.0,A,Cifera,[math],2147483647,1519293772,TESTS,30,WRONG_ANSWER -Mindjolt,114,35569702,GNU C++,0,PRACTICE,0,500.0,A,Cifera,[math],2147483647,1519293751,TESTS,0,COMPILATION_ERROR -Mindjolt,114,35569681,GNU C++,2048000,PRACTICE,0,500.0,A,Cifera,[math],2147483647,1519293666,TESTS,30,WRONG_ANSWER -Mindjolt,114,35569669,GNU C++,0,PRACTICE,0,500.0,A,Cifera,[math],2147483647,1519293640,TESTS,0,COMPILATION_ERROR -Mindjolt,114,35569660,GNU C++,0,PRACTICE,0,500.0,A,Cifera,[math],2147483647,1519293603,TESTS,0,COMPILATION_ERROR -Mindjolt,353,35569529,GNU C++,2048000,PRACTICE,59,500.0,A,Domino,"[implementation, math]",2147483647,1519293201,TESTS,30,OK -Mindjolt,353,35569518,GNU C++,0,PRACTICE,0,500.0,A,Domino,"[implementation, math]",2147483647,1519293175,TESTS,0,COMPILATION_ERROR -Mindjolt,353,35569480,GNU C++,2048000,PRACTICE,1,500.0,A,Domino,"[implementation, math]",2147483647,1519293037,TESTS,30,WRONG_ANSWER -Mindjolt,353,35569467,GNU C++,0,PRACTICE,0,500.0,A,Domino,"[implementation, math]",2147483647,1519293008,TESTS,0,COMPILATION_ERROR -Mindjolt,353,35569459,GNU C++,0,PRACTICE,0,500.0,A,Domino,"[implementation, math]",2147483647,1519292972,TESTS,0,COMPILATION_ERROR -Mindjolt,353,35569409,GNU C++,2048000,PRACTICE,2,500.0,A,Domino,"[implementation, math]",2147483647,1519292735,TESTS,30,WRONG_ANSWER -Mindjolt,353,35569338,GNU C++,2048000,PRACTICE,3,500.0,A,Domino,"[implementation, math]",2147483647,1519292508,TESTS,30,WRONG_ANSWER -Mindjolt,353,35569316,GNU C++,2048000,PRACTICE,2,500.0,A,Domino,"[implementation, math]",2147483647,1519292466,TESTS,30,WRONG_ANSWER -Mindjolt,353,35569303,GNU C++,0,PRACTICE,0,500.0,A,Domino,"[implementation, math]",2147483647,1519292440,TESTS,0,COMPILATION_ERROR -Mindjolt,353,35569284,GNU C++,0,PRACTICE,0,500.0,A,Domino,"[implementation, math]",2147483647,1519292395,TESTS,0,COMPILATION_ERROR -Mindjolt,353,35569233,GNU C++,2048000,PRACTICE,2,500.0,A,Domino,"[implementation, math]",2147483647,1519292245,TESTS,30,WRONG_ANSWER -Mindjolt,353,35569213,GNU C++,2048000,PRACTICE,7,500.0,A,Domino,"[implementation, math]",2147483647,1519292170,TESTS,30,WRONG_ANSWER -Mindjolt,353,35569184,GNU C++,2048000,PRACTICE,7,500.0,A,Domino,"[implementation, math]",2147483647,1519292022,TESTS,30,WRONG_ANSWER -Mindjolt,353,35518962,GNU C++,2048000,PRACTICE,0,1500.0,B,Two Heaps,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",2147483647,1519124592,TESTS,0,WRONG_ANSWER -Mindjolt,265,35516579,GNU C++,2048000,PRACTICE,19,500.0,A,Colorful Stones (Simplified Edition),[implementation],2147483647,1519118039,TESTS,30,OK -Mindjolt,152,35516497,GNU C++,2150400,PRACTICE,44,500.0,A,Marks,[implementation],2147483647,1519117780,TESTS,15,OK -Mindjolt,350,35505536,GNU C++,2048000,PRACTICE,45,500.0,A,TL,"[brute force, greedy, implementation]",2147483647,1519073882,TESTS,30,OK -Mindjolt,350,35505519,GNU C++,2048000,PRACTICE,0,500.0,A,TL,"[brute force, greedy, implementation]",2147483647,1519073827,TESTS,0,WRONG_ANSWER -Mindjolt,350,35505474,GNU C++,2048000,PRACTICE,13,500.0,A,TL,"[brute force, greedy, implementation]",2147483647,1519073727,TESTS,30,WRONG_ANSWER -Mindjolt,350,35505437,GNU C++,0,PRACTICE,0,500.0,A,TL,"[brute force, greedy, implementation]",2147483647,1519073638,TESTS,0,COMPILATION_ERROR -Mindjolt,350,35505423,GNU C++,0,PRACTICE,0,500.0,A,TL,"[brute force, greedy, implementation]",2147483647,1519073611,TESTS,0,COMPILATION_ERROR -Mindjolt,189,35503222,GNU C++,2355200,PRACTICE,58,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519069874,TESTS,30,OK -Mindjolt,189,35502324,GNU C++,2355200,PRACTICE,58,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519069029,TESTS,15,OK -Mindjolt,189,35502309,GNU C++,2048000,PRACTICE,0,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519068991,TESTS,0,WRONG_ANSWER -Mindjolt,189,35501998,GNU C++,2355200,PRACTICE,37,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519066885,TESTS,1000,TIME_LIMIT_EXCEEDED -Mindjolt,189,35495071,GNU C++,2355200,PRACTICE,40,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519063043,TESTS,15,WRONG_ANSWER -Mindjolt,189,35494196,GNU C++,2355200,PRACTICE,8,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519062715,TESTS,15,WRONG_ANSWER -Mindjolt,152,35454676,GNU C++14,2048000,PRACTICE,60,1500.0,C,Pocket Book,[combinatorics],2147483647,1518979834,TESTS,60,OK -Mindjolt,152,35454635,GNU C++14,1843200,PRACTICE,0,1500.0,C,Pocket Book,[combinatorics],2147483647,1518979698,TESTS,30,WRONG_ANSWER -Mindjolt,152,35454617,GNU C++14,0,PRACTICE,0,1500.0,C,Pocket Book,[combinatorics],2147483647,1518979667,TESTS,0,COMPILATION_ERROR -Mindjolt,224,35454177,GNU C++14,2662400,PRACTICE,1,1000.0,B,Array,"[bitmasks, implementation, two pointers]",2147483647,1518978401,TESTS,30,WRONG_ANSWER -Mindjolt,224,35453882,GNU C++14,2662400,PRACTICE,3,1000.0,B,Array,"[bitmasks, implementation, two pointers]",2147483647,1518977615,TESTS,30,WRONG_ANSWER -Mindjolt,510,35453051,PyPy 2,31232000,PRACTICE,24,1000.0,B,Fox And Two Dots,[dfs and similar],2147483647,1518975235,TESTS,1232,OK -Mindjolt,510,35453038,PyPy 2,22528000,PRACTICE,0,1000.0,B,Fox And Two Dots,[dfs and similar],2147483647,1518975212,TESTS,77,WRONG_ANSWER -Mindjolt,510,35452870,PyPy 2,26112000,PRACTICE,9,1000.0,B,Fox And Two Dots,[dfs and similar],2147483647,1518974804,TESTS,218,RUNTIME_ERROR -Mindjolt,501,35448102,GNU C++,2048000,PRACTICE,40,500.0,A,Contest,[implementation],2147483647,1518963087,TESTS,15,OK -Mindjolt,501,35448055,GNU C++,2048000,PRACTICE,5,500.0,A,Contest,[implementation],2147483647,1518962992,TESTS,15,WRONG_ANSWER -Mindjolt,501,35447982,GNU C++,2048000,PRACTICE,0,500.0,A,Contest,[implementation],2147483647,1518962829,TESTS,15,WRONG_ANSWER -Mindjolt,262,35447872,GNU C++,2048000,PRACTICE,34,500.0,A,Roma and Lucky Numbers,[implementation],2147483647,1518962624,TESTS,30,OK -Mindjolt,165,35447750,GNU C++,2048000,PRACTICE,26,500.0,A,Supercentral Point,[implementation],2147483647,1518962356,TESTS,30,OK -Mindjolt,404,35441872,GNU C++,2048000,PRACTICE,47,500.0,A,Valera and X,[implementation],2147483647,1518946818,TESTS,46,OK -Mindjolt,404,35441790,GNU C++,2048000,PRACTICE,6,500.0,A,Valera and X,[implementation],2147483647,1518946638,TESTS,15,WRONG_ANSWER -Mindjolt,404,35441782,GNU C++,0,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518946612,TESTS,0,COMPILATION_ERROR -Mindjolt,404,35441765,GNU C++,0,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518946568,TESTS,0,COMPILATION_ERROR -Mindjolt,499,35441545,GNU C++,2048000,PRACTICE,41,500.0,A,Watching a movie,[implementation],2147483647,1518945938,TESTS,15,OK -Mindjolt,499,35441524,GNU C++,2048000,PRACTICE,0,500.0,A,Watching a movie,[implementation],2147483647,1518945889,TESTS,0,WRONG_ANSWER -Mindjolt,499,35441481,GNU C++,2048000,PRACTICE,0,500.0,A,Watching a movie,[implementation],2147483647,1518945774,TESTS,0,WRONG_ANSWER -Mindjolt,499,35441468,GNU C++,0,PRACTICE,0,500.0,A,Watching a movie,[implementation],2147483647,1518945730,TESTS,0,COMPILATION_ERROR -Mindjolt,233,35438169,GNU C++,2048000,PRACTICE,30,500.0,A,Perfect Permutation,"[implementation, math]",2147483647,1518936129,TESTS,30,OK -Mindjolt,404,35438164,GNU C++,2048000,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518936114,TESTS,0,WRONG_ANSWER -Mindjolt,404,35438095,GNU C++,2150400,PRACTICE,47,500.0,A,Valera and X,[implementation],2147483647,1518935879,TESTS,61,OK -Mindjolt,404,35438083,GNU C++,0,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518935857,TESTS,0,COMPILATION_ERROR -Mindjolt,404,35437988,GNU C++,2048000,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518935596,TESTS,0,WRONG_ANSWER -Mindjolt,404,35437981,GNU C++,0,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518935577,TESTS,0,COMPILATION_ERROR -Mindjolt,404,35437928,GNU C++,2048000,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518935371,TESTS,0,WRONG_ANSWER -Mindjolt,483,35437788,GNU C++,2048000,PRACTICE,42,500.0,A,Counterexample ,"[brute force, implementation]",2147483647,1518934927,TESTS,15,OK -Mindjolt,483,35437719,GNU C++,2048000,PRACTICE,2,500.0,A,Counterexample ,"[brute force, implementation]",2147483647,1518934672,TESTS,15,WRONG_ANSWER -Mindjolt,483,35437692,GNU C++,2048000,PRACTICE,2,500.0,A,Counterexample ,"[brute force, implementation]",2147483647,1518934606,TESTS,15,WRONG_ANSWER -Mindjolt,483,35437665,GNU C++,2048000,PRACTICE,0,500.0,A,Counterexample ,"[brute force, implementation]",2147483647,1518934551,TESTS,0,WRONG_ANSWER -Mindjolt,483,35437651,GNU C++,0,PRACTICE,0,500.0,A,Counterexample ,"[brute force, implementation]",2147483647,1518934513,TESTS,0,COMPILATION_ERROR -Mindjolt,255,35431176,GNU C++,2048000,PRACTICE,61,500.0,A,Greg's Workout,[implementation],2147483647,1518900487,TESTS,30,OK -Mindjolt,255,35431143,GNU C++,2048000,PRACTICE,0,500.0,A,Greg's Workout,[implementation],2147483647,1518900369,TESTS,30,WRONG_ANSWER -Mindjolt,255,35431115,GNU C++,0,PRACTICE,0,500.0,A,Greg's Workout,[implementation],2147483647,1518900276,TESTS,0,COMPILATION_ERROR -Mindjolt,496,35335336,GNU C++,2048000,PRACTICE,19,500.0,A,Minimum Difficulty,"[brute force, implementation, math]",2147483647,1518780868,TESTS,15,OK -Mindjolt,378,35329485,GNU C++,2150400,PRACTICE,38,500.0,A,Playing with Dice,[brute force],2147483647,1518766146,TESTS,15,OK -Mindjolt,456,35329375,GNU C++,3584000,PRACTICE,46,500.0,A,Laptops,[sortings],2147483647,1518765704,TESTS,358,OK -Mindjolt,276,35329224,GNU C++,2150400,PRACTICE,35,500.0,A,Lunch Rush,[implementation],2147483647,1518765092,TESTS,122,OK -Mindjolt,276,35329206,GNU C++,2150400,PRACTICE,30,500.0,A,Lunch Rush,[implementation],2147483647,1518765032,TESTS,92,WRONG_ANSWER -Mindjolt,276,35329186,GNU C++,2150400,PRACTICE,20,500.0,A,Lunch Rush,[implementation],2147483647,1518764984,TESTS,92,WRONG_ANSWER -Mindjolt,276,35329162,GNU C++,2048000,PRACTICE,2,500.0,A,Lunch Rush,[implementation],2147483647,1518764913,TESTS,30,WRONG_ANSWER -Mindjolt,385,35328695,GNU C++,2150400,PRACTICE,32,500.0,A,Bear and Raspberry,"[brute force, greedy, implementation]",2147483647,1518763299,TESTS,15,OK -Mindjolt,151,35266842,GNU C++,2048000,PRACTICE,27,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518622345,TESTS,30,OK -Mindjolt,151,35266809,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518622295,TESTS,0,COMPILATION_ERROR -Mindjolt,151,35266790,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518622270,TESTS,0,COMPILATION_ERROR -Mindjolt,151,35266785,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518622254,TESTS,0,COMPILATION_ERROR -Mindjolt,151,35266716,GNU C++,2048000,PRACTICE,1,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518622186,TESTS,0,WRONG_ANSWER -Mindjolt,151,35266476,GNU C++,2048000,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518621918,TESTS,0,WRONG_ANSWER -Mindjolt,151,35266429,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518621867,TESTS,0,COMPILATION_ERROR -Mindjolt,151,35266384,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518621809,TESTS,0,COMPILATION_ERROR -Mindjolt,151,35264745,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518619161,TESTS,0,COMPILATION_ERROR -Mindjolt,515,35198151,GNU C++17,1843200,PRACTICE,0,1000.0,C,Drazil and Factorial,"[greedy, math, sortings]",2147483647,1518522612,TESTS,0,WRONG_ANSWER -Mindjolt,750,35197619,GNU C++17,1945600,PRACTICE,52,500.0,A,New Year and Hurry,"[binary search, brute force, implementation, math]",2147483647,1518521217,TESTS,31,OK -Mindjolt,750,35197538,GNU C++17,1945600,PRACTICE,7,500.0,A,New Year and Hurry,"[binary search, brute force, implementation, math]",2147483647,1518520983,TESTS,15,WRONG_ANSWER -Mindjolt,462,34982037,GNU C++14,1843200,PRACTICE,32,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517948200,TESTS,15,OK -Mindjolt,462,34982026,GNU C++14,1843200,PRACTICE,1,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517948162,TESTS,0,WRONG_ANSWER -Mindjolt,462,34981989,GNU C++14,1843200,PRACTICE,3,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517948031,TESTS,0,WRONG_ANSWER -Mindjolt,462,34981883,GNU C++,1843200,PRACTICE,7,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517947730,TESTS,15,WRONG_ANSWER -Mindjolt,462,34979892,GNU C++,1843200,PRACTICE,0,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517942153,TESTS,15,WRONG_ANSWER -Mindjolt,462,34979871,GNU C++,1843200,PRACTICE,0,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517942113,TESTS,0,WRONG_ANSWER -Mindjolt,462,34979844,GNU C++,0,PRACTICE,0,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517942037,TESTS,0,COMPILATION_ERROR -Mindjolt,462,34979755,GNU C++,1843200,PRACTICE,0,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517941940,TESTS,0,WRONG_ANSWER -Mindjolt,441,34979412,GNU C11,1843200,PRACTICE,26,500.0,A,Valera and Antique Items,[implementation],2147483647,1517940967,TESTS,15,OK -Mindjolt,441,34979373,GNU C11,1843200,PRACTICE,1,500.0,A,Valera and Antique Items,[implementation],2147483647,1517940878,TESTS,15,WRONG_ANSWER -Mindjolt,441,34979362,GNU C11,1843200,PRACTICE,0,500.0,A,Valera and Antique Items,[implementation],2147483647,1517940850,TESTS,15,WRONG_ANSWER -Mindjolt,441,34979310,GNU C11,1843200,PRACTICE,0,500.0,A,Valera and Antique Items,[implementation],2147483647,1517940724,TESTS,15,WRONG_ANSWER -Mindjolt,441,34979270,GNU C11,1843200,PRACTICE,0,500.0,A,Valera and Antique Items,[implementation],2147483647,1517940605,TESTS,0,WRONG_ANSWER -Mindjolt,296,34720451,PyPy 2,21401600,PRACTICE,37,500.0,A,Yaroslav and Permutations,"[greedy, math]",2147483647,1517343496,TESTS,124,OK -Mindjolt,296,34720424,PyPy 2,21299200,PRACTICE,1,500.0,A,Yaroslav and Permutations,"[greedy, math]",2147483647,1517343374,TESTS,92,WRONG_ANSWER -Mindjolt,296,34720416,PyPy 2,21299200,PRACTICE,1,500.0,A,Yaroslav and Permutations,"[greedy, math]",2147483647,1517343320,TESTS,92,WRONG_ANSWER -Mindjolt,75,34720287,PyPy 2,21299200,PRACTICE,43,500.0,A,Life Without Zeros,[implementation],2147483647,1517342952,TESTS,154,OK -Mindjolt,918,34707433,PyPy 2,124723200,PRACTICE,6,1500.0,C,The Monster,"[data structures, greedy]",2147483647,1517313727,TESTS,1000,TIME_LIMIT_EXCEEDED -Mindjolt,918,34707383,PyPy 2,124723200,PRACTICE,6,1500.0,C,The Monster,"[data structures, greedy]",2147483647,1517313630,TESTS,1000,TIME_LIMIT_EXCEEDED -Mindjolt,918,34707323,PyPy 2,28876800,PRACTICE,3,1500.0,C,The Monster,"[data structures, greedy]",2147483647,1517313486,TESTS,1000,TIME_LIMIT_EXCEEDED -Mindjolt,918,34702561,PyPy 2,22220800,VIRTUAL,28,1000.0,B,Radio Station,[implementation],817,1517300977,TESTS,109,OK -Mindjolt,918,34702399,PyPy 2,21401600,VIRTUAL,18,500.0,A,Eleven,[implementation],332,1517300492,TESTS,62,OK -Mindjolt,75,34667168,PyPy 2,21299200,PRACTICE,0,500.0,A,Life Without Zeros,[implementation],2147483647,1517236998,TESTS,122,RUNTIME_ERROR -Mindjolt,822,34585046,Python 2,4608000,PRACTICE,59,500.0,A,I'm bored with life,"[implementation, math, number theory]",2147483647,1516991422,TESTS,62,OK -Mindjolt,290,34447319,PyPy 2,21299200,PRACTICE,36,0.0,B,QR code,"[*special, implementation]",2147483647,1516625105,TESTS,124,OK -Mindjolt,290,34447186,PyPy 2,21299200,PRACTICE,5,0.0,B,QR code,"[*special, implementation]",2147483647,1516624856,TESTS,124,WRONG_ANSWER -Mindjolt,290,34447172,PyPy 2,21299200,PRACTICE,0,0.0,B,QR code,"[*special, implementation]",2147483647,1516624824,TESTS,122,RUNTIME_ERROR -Mindjolt,290,34446394,PyPy 2,21299200,PRACTICE,40,0.0,A,Mysterious strings,"[*special, implementation]",2147483647,1516623450,TESTS,154,OK -Mindjolt,290,34446175,PyPy 2,21299200,PRACTICE,31,0.0,A,Mysterious strings,"[*special, implementation]",2147483647,1516623081,TESTS,156,WRONG_ANSWER -Mindjolt,290,34446147,PyPy 2,21299200,PRACTICE,7,0.0,A,Mysterious strings,"[*special, implementation]",2147483647,1516623010,TESTS,92,WRONG_ANSWER -Mindjolt,393,34272631,PyPy 2,23756800,PRACTICE,40,1000.0,B,Three matrices,[],2147483647,1516269940,TESTS,499,OK -Mindjolt,393,34272615,PyPy 2,21299200,PRACTICE,0,1000.0,B,Three matrices,[],2147483647,1516269893,TESTS,46,WRONG_ANSWER -Mindjolt,393,34272569,PyPy 2,21299200,PRACTICE,0,1000.0,B,Three matrices,[],2147483647,1516269725,TESTS,46,WRONG_ANSWER -Mindjolt,393,34272485,PyPy 2,21299200,PRACTICE,0,1000.0,B,Three matrices,[],2147483647,1516269388,TESTS,62,RUNTIME_ERROR -Mindjolt,101343,34228713,PyPy 2,21299200,PRACTICE,0,0.0,H,Give Me This Pizza,[data structures],2147483647,1516124202,TESTS,46,WRONG_ANSWER -Mindjolt,101343,34228690,PyPy 2,21299200,PRACTICE,0,0.0,H,Give Me This Pizza,[data structures],2147483647,1516124142,TESTS,46,WRONG_ANSWER -Mindjolt,101343,34228681,PyPy 2,21299200,PRACTICE,0,0.0,H,Give Me This Pizza,[data structures],2147483647,1516124111,TESTS,46,WRONG_ANSWER -Mindjolt,101343,34228656,PyPy 2,21299200,PRACTICE,0,0.0,H,Give Me This Pizza,[data structures],2147483647,1516124063,TESTS,46,WRONG_ANSWER -Mindjolt,339,34173980,PyPy 2,27750400,PRACTICE,29,1000.0,B,Xenia and Ringroad,[implementation],2147483647,1515931314,TESTS,216,OK -Mindjolt,339,34173958,PyPy 2,21299200,PRACTICE,0,1000.0,B,Xenia and Ringroad,[implementation],2147483647,1515931207,TESTS,92,WRONG_ANSWER -Mindjolt,339,34173929,PyPy 2,21299200,PRACTICE,0,1000.0,B,Xenia and Ringroad,[implementation],2147483647,1515931120,TESTS,92,WRONG_ANSWER -Mindjolt,339,34173903,PyPy 2,21299200,PRACTICE,0,1000.0,B,Xenia and Ringroad,[implementation],2147483647,1515931039,TESTS,92,RUNTIME_ERROR -Mindjolt,257,34173772,PyPy 2,21401600,PRACTICE,40,500.0,B,Playing Cubes,"[games, greedy, implementation]",2147483647,1515930629,TESTS,124,OK -Mindjolt,110,34173768,PyPy 2,21299200,PRACTICE,0,500.0,A,Nearly Lucky Number,[implementation],2147483647,1515930615,TESTS,92,RUNTIME_ERROR -Mindjolt,200,34173661,PyPy 2,21401600,PRACTICE,31,500.0,B,Drinks,"[implementation, math]",2147483647,1515930192,TESTS,154,OK -Mindjolt,200,34173649,PyPy 2,21299200,PRACTICE,0,500.0,B,Drinks,"[implementation, math]",2147483647,1515930159,TESTS,92,WRONG_ANSWER -Mindjolt,141,34173604,PyPy 2,21401600,PRACTICE,54,500.0,A,Amusing Joke,"[implementation, sortings, strings]",2147483647,1515930037,TESTS,124,OK -Mindjolt,141,34173571,PyPy 2,21299200,PRACTICE,10,500.0,A,Amusing Joke,"[implementation, sortings, strings]",2147483647,1515929936,TESTS,124,WRONG_ANSWER -Mindjolt,110,34173519,PyPy 2,21401600,PRACTICE,34,500.0,A,Nearly Lucky Number,[implementation],2147483647,1515929766,TESTS,124,OK -Mindjolt,110,34173512,PyPy 2,21299200,PRACTICE,0,500.0,A,Nearly Lucky Number,[implementation],2147483647,1515929744,TESTS,122,RUNTIME_ERROR -Mindjolt,110,34173500,PyPy 2,21299200,PRACTICE,0,500.0,A,Nearly Lucky Number,[implementation],2147483647,1515929717,TESTS,122,RUNTIME_ERROR -Mindjolt,915,34154559,PyPy 2,21401600,PRACTICE,10,0.0,C,Permute Digits,"[dp, greedy]",2147483647,1515858305,TESTS,62,RUNTIME_ERROR -Mindjolt,915,34154523,PyPy 2,21401600,PRACTICE,229,0.0,B,Browser,[implementation],2147483647,1515858254,TESTS,77,OK -Mindjolt,915,34154512,GNU C++11,0,PRACTICE,0,0.0,B,Browser,[implementation],2147483647,1515858238,TESTS,0,COMPILATION_ERROR -Mindjolt,915,34152246,PyPy 2,21401600,CONTESTANT,5,0.0,C,Permute Digits,"[dp, greedy]",7073,1515855773,TESTS,62,WRONG_ANSWER -Mindjolt,915,34150404,PyPy 2,21401600,CONTESTANT,5,0.0,C,Permute Digits,"[dp, greedy]",6499,1515855199,TESTS,61,RUNTIME_ERROR -Mindjolt,915,34146431,PyPy 2,21401600,CONTESTANT,10,0.0,C,Permute Digits,"[dp, greedy]",5075,1515853775,CHALLENGES,62,CHALLENGED -Mindjolt,915,34142003,PyPy 2,21299200,CONTESTANT,5,0.0,C,Permute Digits,"[dp, greedy]",3596,1515852296,TESTS,62,WRONG_ANSWER -Mindjolt,915,34133409,PyPy 2,21401600,CONTESTANT,10,0.0,B,Browser,[implementation],1172,1515849872,CHALLENGES,62,CHALLENGED -Mindjolt,915,34129020,PyPy 2,21401600,CONTESTANT,83,0.0,A,Garden,[implementation],285,1515848985,TESTS,62,OK -Mindjolt,915,34128824,GNU C++,0,CONTESTANT,0,0.0,A,Garden,[implementation],260,1515848960,TESTS,0,COMPILATION_ERROR -Mindjolt,330,34069064,PyPy 2,21401600,PRACTICE,42,500.0,A,Cakeminator,"[brute force, implementation]",2147483647,1515588846,TESTS,216,OK -Mindjolt,913,34028532,PyPy 2,22323200,CONTESTANT,6,3000.0,G,Power Substring,"[math, number theory]",7754,1515430454,PRETESTS,2000,TIME_LIMIT_EXCEEDED -Mindjolt,913,34018630,PyPy 2,21401600,CONTESTANT,13,750.0,B,Christmas Spruce,"[implementation, trees]",2508,1515425208,TESTS,78,WRONG_ANSWER -Mindjolt,913,34011303,PyPy 2,21401600,CONTESTANT,49,500.0,A,Modular Exponentiation,"[implementation, math]",679,1515423379,TESTS,77,OK -Mindjolt,230,33958066,PyPy 2,42700800,PRACTICE,68,500.0,B,T-primes,"[implementation, math, number theory]",2147483647,1515224037,TESTS,1872,OK -Mindjolt,230,33958008,PyPy 2,25292800,PRACTICE,0,500.0,B,T-primes,"[implementation, math, number theory]",2147483647,1515223790,TESTS,184,WRONG_ANSWER -Mindjolt,230,33957949,PyPy 2,34406400,PRACTICE,35,500.0,B,T-primes,"[implementation, math, number theory]",2147483647,1515223553,TESTS,2000,TIME_LIMIT_EXCEEDED -Mindjolt,230,33957941,PyPy 2,0,PRACTICE,0,500.0,B,T-primes,"[implementation, math, number theory]",2147483647,1515223533,TESTS,0,COMPILATION_ERROR -Mindjolt,230,33957911,PyPy 2,21196800,PRACTICE,2,500.0,B,T-primes,"[implementation, math, number theory]",2147483647,1515223430,TESTS,124,WRONG_ANSWER -Mindjolt,912,33948529,PyPy 2,21196800,PRACTICE,58,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515176440,TESTS,62,OK -Mindjolt,912,33948519,PyPy 2,21196800,PRACTICE,0,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515176416,TESTS,46,WRONG_ANSWER -Mindjolt,912,33948513,PyPy 2,21196800,PRACTICE,0,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515176393,TESTS,46,RUNTIME_ERROR -Mindjolt,912,33948452,PyPy 2,21196800,PRACTICE,47,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515176288,TESTS,62,WRONG_ANSWER -Mindjolt,912,33948432,PyPy 2,21196800,PRACTICE,7,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515176258,TESTS,62,WRONG_ANSWER -Mindjolt,912,33945893,PyPy 2,21196800,PRACTICE,47,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515172426,TESTS,62,WRONG_ANSWER -Mindjolt,912,33945390,PyPy 2,21196800,CONTESTANT,0,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",7176,1515170076,CHALLENGES,62,WRONG_ANSWER -Mindjolt,912,33945140,PyPy 2,21196800,CONTESTANT,0,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",7088,1515169988,CHALLENGES,62,WRONG_ANSWER -Mindjolt,912,33932903,PyPy 2,21196800,CONTESTANT,8,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",1600,1515164500,CHALLENGES,77,CHALLENGED -Mindjolt,912,33926374,PyPy 2,21196800,CONTESTANT,38,500.0,A,Tricky Alchemy,[implementation],479,1515163379,TESTS,77,OK -Mindjolt,451,33838240,PyPy 2,21196800,PRACTICE,0,1000.0,B,Sort the Array,"[implementation, sortings]",2147483647,1514751648,TESTS,62,WRONG_ANSWER -Mindjolt,451,33838230,PyPy 2,21196800,PRACTICE,0,1000.0,B,Sort the Array,"[implementation, sortings]",2147483647,1514751602,TESTS,46,RUNTIME_ERROR -Mindjolt,490,33838163,PyPy 2,23756800,PRACTICE,41,500.0,A,Team Olympiad,"[greedy, implementation, sortings]",2147483647,1514751133,TESTS,171,OK -Mindjolt,451,33838134,PyPy 2,21196800,PRACTICE,28,500.0,A,Game With Sticks,[implementation],2147483647,1514750928,TESTS,62,OK -Mindjolt,337,33838108,PyPy 2,21196800,PRACTICE,18,500.0,A,Puzzles,"[dp, graph matchings, greedy]",2147483647,1514750708,TESTS,124,OK -Mindjolt,337,33838105,PyPy 2,0,PRACTICE,0,500.0,A,Puzzles,"[dp, graph matchings, greedy]",2147483647,1514750678,TESTS,0,COMPILATION_ERROR -Mindjolt,479,33838077,PyPy 2,21196800,PRACTICE,29,500.0,A,Expression,"[brute force, math]",2147483647,1514750451,TESTS,62,OK -Mindjolt,479,33838037,PyPy 2,21196800,PRACTICE,7,500.0,A,Expression,"[brute force, math]",2147483647,1514750248,TESTS,62,WRONG_ANSWER -Mindjolt,479,33838034,PyPy 2,21196800,PRACTICE,5,500.0,A,Expression,"[brute force, math]",2147483647,1514750217,TESTS,61,WRONG_ANSWER -Mindjolt,479,33838026,PyPy 2,0,PRACTICE,0,500.0,A,Expression,"[brute force, math]",2147483647,1514750191,TESTS,0,COMPILATION_ERROR -Mindjolt,443,33833971,PyPy 2,21196800,PRACTICE,0,500.0,A,Anton and Letters,"[constructive algorithms, implementation]",2147483647,1514732590,TESTS,46,WRONG_ANSWER -Mindjolt,443,33833955,PyPy 2,0,PRACTICE,0,500.0,A,Anton and Letters,"[constructive algorithms, implementation]",2147483647,1514732561,TESTS,0,COMPILATION_ERROR -Mindjolt,443,33833810,PyPy 2,21196800,PRACTICE,27,500.0,A,Anton and Letters,"[constructive algorithms, implementation]",2147483647,1514732080,TESTS,62,OK -Mindjolt,443,33833789,PyPy 2,21196800,PRACTICE,0,500.0,A,Anton and Letters,"[constructive algorithms, implementation]",2147483647,1514731978,TESTS,46,RUNTIME_ERROR -Mindjolt,469,33833760,PyPy 2,21196800,PRACTICE,29,500.0,A,I Wanna Be the Guy,"[greedy, implementation]",2147483647,1514731851,TESTS,62,OK -Mindjolt,469,33833752,PyPy 2,21196800,PRACTICE,0,500.0,A,I Wanna Be the Guy,"[greedy, implementation]",2147483647,1514731819,TESTS,61,WRONG_ANSWER -Mindjolt,469,33833719,PyPy 2,21196800,PRACTICE,0,500.0,A,I Wanna Be the Guy,"[greedy, implementation]",2147483647,1514731704,TESTS,46,RUNTIME_ERROR -Mindjolt,476,33831226,PyPy 2,21196800,PRACTICE,35,500.0,A,Dreamoon and Stairs,"[implementation, math]",2147483647,1514722628,TESTS,77,OK -Mindjolt,476,33831217,PyPy 2,21196800,PRACTICE,0,500.0,A,Dreamoon and Stairs,"[implementation, math]",2147483647,1514722602,TESTS,46,WRONG_ANSWER -Mindjolt,230,33830933,PyPy 2,21299200,PRACTICE,54,500.0,A,Dragons,"[greedy, sortings]",2147483647,1514721648,TESTS,186,OK -Mindjolt,230,33830859,PyPy 2,21299200,PRACTICE,9,500.0,A,Dragons,"[greedy, sortings]",2147483647,1514721350,TESTS,218,WRONG_ANSWER -Mindjolt,230,33830828,PyPy 2,21196800,PRACTICE,1,500.0,A,Dragons,"[greedy, sortings]",2147483647,1514721217,TESTS,124,RUNTIME_ERROR -Mindjolt,313,33830819,PyPy 2,21196800,PRACTICE,0,500.0,A,Ilya and Bank Account,"[implementation, number theory]",2147483647,1514721179,TESTS,154,RUNTIME_ERROR -Mindjolt,313,33830814,PyPy 2,21196800,PRACTICE,0,500.0,A,Ilya and Bank Account,"[implementation, number theory]",2147483647,1514721158,TESTS,92,RUNTIME_ERROR -Mindjolt,313,33830705,PyPy 2,21196800,PRACTICE,47,500.0,A,Ilya and Bank Account,"[implementation, number theory]",2147483647,1514720702,TESTS,124,OK -Mindjolt,313,33830670,PyPy 2,21196800,PRACTICE,1,500.0,A,Ilya and Bank Account,"[implementation, number theory]",2147483647,1514720568,TESTS,124,WRONG_ANSWER -Mindjolt,459,33830629,PyPy 2,21196800,PRACTICE,74,500.0,A,Pashmak and Garden,[implementation],2147483647,1514720401,TESTS,62,OK -Mindjolt,459,33830609,PyPy 2,21196800,PRACTICE,8,500.0,A,Pashmak and Garden,[implementation],2147483647,1514720338,TESTS,62,WRONG_ANSWER -Mindjolt,459,33830558,PyPy 2,21196800,PRACTICE,0,500.0,A,Pashmak and Garden,[implementation],2147483647,1514720195,TESTS,46,WRONG_ANSWER -Mindjolt,490,33830553,PyPy 2,21196800,PRACTICE,0,500.0,A,Team Olympiad,"[greedy, implementation, sortings]",2147483647,1514720180,TESTS,62,RUNTIME_ERROR -Mindjolt,490,33830439,PyPy 2,23756800,PRACTICE,41,500.0,A,Team Olympiad,"[greedy, implementation, sortings]",2147483647,1514719754,TESTS,155,OK -Mindjolt,490,33830430,PyPy 2,21196800,PRACTICE,0,500.0,A,Team Olympiad,"[greedy, implementation, sortings]",2147483647,1514719722,TESTS,46,WRONG_ANSWER -Mindjolt,490,33830421,PyPy 2,21196800,PRACTICE,0,500.0,A,Team Olympiad,"[greedy, implementation, sortings]",2147483647,1514719698,TESTS,46,WRONG_ANSWER -Mindjolt,466,33830385,PyPy 2,21196800,PRACTICE,0,500.0,A,Cheap Travel,[implementation],2147483647,1514719543,TESTS,46,RUNTIME_ERROR -Mindjolt,466,33830320,PyPy 2,21196800,PRACTICE,19,500.0,A,Cheap Travel,[implementation],2147483647,1514719305,TESTS,62,OK -Mindjolt,466,33830312,PyPy 2,21196800,PRACTICE,1,500.0,A,Cheap Travel,[implementation],2147483647,1514719262,TESTS,46,WRONG_ANSWER -Mindjolt,466,33830295,PyPy 2,21196800,PRACTICE,2,500.0,A,Cheap Travel,[implementation],2147483647,1514719199,TESTS,77,WRONG_ANSWER -Mindjolt,466,33830264,PyPy 2,21196800,PRACTICE,1,500.0,A,Cheap Travel,[implementation],2147483647,1514719109,TESTS,46,WRONG_ANSWER -Mindjolt,466,33830220,PyPy 2,21196800,PRACTICE,1,500.0,A,Cheap Travel,[implementation],2147483647,1514718939,TESTS,62,WRONG_ANSWER -Mindjolt,466,33830188,PyPy 2,21196800,PRACTICE,1,500.0,A,Cheap Travel,[implementation],2147483647,1514718829,TESTS,46,WRONG_ANSWER -Mindjolt,439,33830098,PyPy 2,21196800,PRACTICE,26,500.0,A,"Devu, the Singer and Churu, the Joker","[greedy, implementation]",2147483647,1514718563,TESTS,62,OK -Mindjolt,439,33830091,PyPy 2,21196800,PRACTICE,0,500.0,A,"Devu, the Singer and Churu, the Joker","[greedy, implementation]",2147483647,1514718545,TESTS,46,RUNTIME_ERROR -Mindjolt,439,33830086,PyPy 2,21196800,PRACTICE,0,500.0,A,"Devu, the Singer and Churu, the Joker","[greedy, implementation]",2147483647,1514718512,TESTS,46,WRONG_ANSWER -Mindjolt,510,33829599,PyPy 2,21196800,PRACTICE,28,500.0,A,Fox And Snake,[implementation],2147483647,1514716732,TESTS,62,OK -Mindjolt,510,33829578,PyPy 2,21196800,PRACTICE,2,500.0,A,Fox And Snake,[implementation],2147483647,1514716656,TESTS,62,RUNTIME_ERROR -Mindjolt,25,33829574,PyPy 2,21196800,PRACTICE,0,0.0,A,IQ test,[brute force],2147483647,1514716641,TESTS,92,RUNTIME_ERROR -Mindjolt,25,33829524,PyPy 2,21196800,PRACTICE,32,0.0,A,IQ test,[brute force],2147483647,1514716433,TESTS,124,OK -Mindjolt,432,33829516,PyPy 2,21196800,PRACTICE,0,500.0,A,Choosing Teams,"[greedy, implementation, sortings]",2147483647,1514716398,TESTS,46,RUNTIME_ERROR -Mindjolt,432,33829492,PyPy 2,21196800,PRACTICE,0,500.0,A,Choosing Teams,"[greedy, implementation, sortings]",2147483647,1514716273,TESTS,46,RUNTIME_ERROR -Mindjolt,432,33829420,PyPy 2,21504000,PRACTICE,35,500.0,A,Choosing Teams,"[greedy, implementation, sortings]",2147483647,1514715977,TESTS,77,OK -Mindjolt,432,33829407,PyPy 2,21196800,PRACTICE,0,500.0,A,Choosing Teams,"[greedy, implementation, sortings]",2147483647,1514715943,TESTS,46,RUNTIME_ERROR -Mindjolt,208,33829336,PyPy 2,21196800,PRACTICE,71,500.0,A,Dubstep,[strings],2147483647,1514715644,TESTS,124,OK -Mindjolt,208,33829258,PyPy 2,21196800,PRACTICE,2,500.0,A,Dubstep,[strings],2147483647,1514715365,TESTS,122,WRONG_ANSWER -Mindjolt,208,33829249,PyPy 2,0,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1514715339,TESTS,0,COMPILATION_ERROR -Mindjolt,208,33829234,PyPy 2,21196800,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1514715290,TESTS,122,WRONG_ANSWER -Mindjolt,208,33829217,PyPy 2,21196800,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1514715225,TESTS,92,WRONG_ANSWER -Mindjolt,208,33829215,PyPy 2,21401600,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1514715202,TESTS,2000,TIME_LIMIT_EXCEEDED -Mindjolt,208,33829187,PyPy 2,21196800,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1514715092,TESTS,92,RUNTIME_ERROR -Mindjolt,208,33829151,PyPy 2,21196800,PRACTICE,71,500.0,A,Dubstep,[strings],2147483647,1514714948,TESTS,124,OK -Mindjolt,268,33829106,PyPy 2,21196800,PRACTICE,31,500.0,A,Games,[brute force],2147483647,1514714747,TESTS,124,OK -Mindjolt,908,33793887,PyPy 2,21811200,PRACTICE,46,750.0,B,New Year and Buggy Bot,"[brute force, implementation]",2147483647,1514576613,TESTS,78,OK -Mindjolt,908,33793445,PyPy 2,22118400,PRACTICE,6,1000.0,C,New Year and Curling,"[brute force, geometry, implementation, math]",2147483647,1514575715,TESTS,124,WRONG_ANSWER -Mindjolt,908,33793347,PyPy 2,22118400,PRACTICE,5,1000.0,C,New Year and Curling,"[brute force, geometry, implementation, math]",2147483647,1514575564,TESTS,108,RUNTIME_ERROR -Mindjolt,908,33782480,PyPy 2,22118400,CONTESTANT,5,1000.0,C,New Year and Curling,"[brute force, geometry, implementation, math]",3947,1514565947,TESTS,108,RUNTIME_ERROR -Mindjolt,908,33776719,PyPy 2,21811200,CONTESTANT,22,750.0,B,New Year and Buggy Bot,"[brute force, implementation]",1991,1514563991,TESTS,77,WRONG_ANSWER -Mindjolt,908,33776517,PyPy 2,21196800,CONTESTANT,0,750.0,B,New Year and Buggy Bot,"[brute force, implementation]",1946,1514563946,PRETESTS,62,WRONG_ANSWER -Mindjolt,908,33764061,PyPy 2,21196800,CONTESTANT,38,500.0,A,New Year and Counting Cards,[implementation],187,1514562187,TESTS,62,OK -Mindjolt,911,33760496,PyPy 2,21196800,PRACTICE,67,0.0,C,Three Garlands,"[brute force, constructive algorithms]",2147483647,1514553270,TESTS,77,OK -Mindjolt,451,33756366,PyPy 2,21196800,PRACTICE,5,500.0,A,Game With Sticks,[implementation],2147483647,1514541247,TESTS,46,WRONG_ANSWER -Mindjolt,451,33756356,PyPy 2,21196800,PRACTICE,0,500.0,A,Game With Sticks,[implementation],2147483647,1514541232,TESTS,46,WRONG_ANSWER -Mindjolt,911,33741761,PyPy 2,21913600,PRACTICE,2,0.0,D,Inversion Counting,"[brute force, math]",2147483647,1514481244,TESTS,124,WRONG_ANSWER -Mindjolt,911,33741721,PyPy 2,21196800,PRACTICE,0,0.0,D,Inversion Counting,"[brute force, math]",2147483647,1514481177,TESTS,31,WRONG_ANSWER -Mindjolt,911,33739078,PyPy 2,21196800,CONTESTANT,0,0.0,D,Inversion Counting,"[brute force, math]",7186,1514477086,TESTS,30,WRONG_ANSWER -Mindjolt,911,33738158,PyPy 2,30822400,CONTESTANT,8,0.0,C,Three Garlands,"[brute force, constructive algorithms]",6934,1514476834,CHALLENGES,186,CHALLENGED -Mindjolt,911,33734965,PyPy 2,21196800,CONTESTANT,3,0.0,C,Three Garlands,"[brute force, constructive algorithms]",5592,1514475492,TESTS,62,WRONG_ANSWER -Mindjolt,911,33734798,PyPy 2,21196800,CONTESTANT,1,0.0,C,Three Garlands,"[brute force, constructive algorithms]",5531,1514475431,TESTS,46,RUNTIME_ERROR -Mindjolt,911,33734644,PyPy 2,21196800,CONTESTANT,1,0.0,C,Three Garlands,"[brute force, constructive algorithms]",5466,1514475366,TESTS,61,RUNTIME_ERROR -Mindjolt,911,33730894,PyPy 2,21196800,CONTESTANT,1,0.0,C,Three Garlands,"[brute force, constructive algorithms]",3996,1514473896,TESTS,46,WRONG_ANSWER -Mindjolt,911,33730212,PyPy 2,21811200,CONTESTANT,5,0.0,C,Three Garlands,"[brute force, constructive algorithms]",3740,1514473640,TESTS,61,WRONG_ANSWER -Mindjolt,911,33729283,PyPy 2,21811200,CONTESTANT,4,0.0,C,Three Garlands,"[brute force, constructive algorithms]",3434,1514473334,TESTS,62,RUNTIME_ERROR -Mindjolt,911,33718608,PyPy 2,21196800,CONTESTANT,135,0.0,B,Two Cakes,"[binary search, brute force, implementation]",932,1514470832,TESTS,62,OK -Mindjolt,911,33713985,PyPy 2,29798400,CONTESTANT,140,0.0,A,Nearest Minimums,[implementation],214,1514470114,TESTS,93,OK -Mindjolt,909,33710903,PyPy 2,59596800,PRACTICE,5,1750.0,D,Colorful Points,"[data structures, greedy, implementation]",2147483647,1514465196,TESTS,296,WRONG_ANSWER -Mindjolt,909,33710887,PyPy 2,21196800,PRACTICE,3,1750.0,D,Colorful Points,"[data structures, greedy, implementation]",2147483647,1514465168,TESTS,46,WRONG_ANSWER -Mindjolt,909,33710841,PyPy 2,21196800,PRACTICE,0,1750.0,D,Colorful Points,"[data structures, greedy, implementation]",2147483647,1514465040,TESTS,61,WRONG_ANSWER -Mindjolt,909,33710828,PyPy 2,21196800,PRACTICE,3,1750.0,D,Colorful Points,"[data structures, greedy, implementation]",2147483647,1514464999,TESTS,62,WRONG_ANSWER -Mindjolt,909,33710809,PyPy 2,21196800,PRACTICE,3,1750.0,D,Colorful Points,"[data structures, greedy, implementation]",2147483647,1514464953,TESTS,46,WRONG_ANSWER -Mindjolt,909,33681059,PyPy 2,21196800,CONTESTANT,102,1000.0,B,Segments,"[constructive algorithms, math]",1955,1514394455,TESTS,78,OK -Mindjolt,909,33675608,PyPy 2,21196800,CONTESTANT,64,500.0,A,Generate Login,"[brute force, greedy, sortings]",442,1514392942,TESTS,62,OK -Mindjolt,910,33625891,PyPy 2,21196800,VIRTUAL,63,500.0,A,The Way to Home,"[dfs and similar, dp, greedy]",1115,1514224055,TESTS,62,OK -Mindjolt,902,33435031,PyPy 2,21196800,CONTESTANT,1,2000.0,D,GCD of Polynomials,[math],7015,1513704715,PRETESTS,62,WRONG_ANSWER -Mindjolt,902,33431142,PyPy 2,21196800,CONTESTANT,3,2000.0,D,GCD of Polynomials,[math],5174,1513702884,PRETESTS,46,WRONG_ANSWER -Mindjolt,902,33418815,PyPy 2,21196800,CONTESTANT,55,500.0,A,Visiting a Friend,[implementation],1254,1513698964,TESTS,62,OK -Mindjolt,902,33418057,PyPy 2,0,CONTESTANT,0,500.0,A,Visiting a Friend,[implementation],1115,1513698825,PRETESTS,0,COMPILATION_ERROR -Mindjolt,902,33417125,PyPy 2,21196800,CONTESTANT,3,500.0,A,Visiting a Friend,[implementation],957,1513698668,PRETESTS,61,WRONG_ANSWER -Mindjolt,902,33416656,PyPy 2,21196800,CONTESTANT,3,500.0,A,Visiting a Friend,[implementation],880,1513698591,PRETESTS,62,WRONG_ANSWER -Mindjolt,902,33416277,PyPy 2,21196800,CONTESTANT,1,500.0,A,Visiting a Friend,[implementation],823,1513698533,PRETESTS,46,WRONG_ANSWER -Mindjolt,902,33414649,PyPy 2,21196800,CONTESTANT,2,500.0,A,Visiting a Friend,[implementation],579,1513698290,PRETESTS,62,WRONG_ANSWER -Mindjolt,902,33413232,PyPy 2,21196800,CONTESTANT,2,500.0,A,Visiting a Friend,[implementation],345,1513698056,PRETESTS,77,WRONG_ANSWER -Mindjolt,898,33352745,PyPy 2,21196800,VIRTUAL,2,2500.0,F,Restoring the Expression,"[brute force, hashing, math]",5931,1513512411,TESTS,46,RUNTIME_ERROR -Mindjolt,898,33352717,PyPy 2,21196800,VIRTUAL,0,2500.0,F,Restoring the Expression,"[brute force, hashing, math]",5859,1513512339,TESTS,61,WRONG_ANSWER -Mindjolt,898,33352436,PyPy 2,21401600,VIRTUAL,10,2500.0,F,Restoring the Expression,"[brute force, hashing, math]",5226,1513511706,TESTS,77,WRONG_ANSWER -Mindjolt,898,33350308,PyPy 2,21196800,VIRTUAL,64,500.0,A,Rounding,[implementation],262,1513506742,TESTS,62,OK -Mindjolt,898,33350234,PyPy 2,21196800,VIRTUAL,3,500.0,A,Rounding,[implementation],46,1513506526,TESTS,62,WRONG_ANSWER -Mindjolt,260,33239423,PyPy 2,21504000,PRACTICE,25,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513254714,TESTS,62,OK -Mindjolt,260,33239401,PyPy 2,21504000,PRACTICE,25,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513254655,TESTS,62,OK -Mindjolt,260,33239383,PyPy 2,21196800,PRACTICE,3,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513254617,TESTS,62,WRONG_ANSWER -Mindjolt,260,33237989,PyPy 2,21708800,PRACTICE,6,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513251076,TESTS,171,WRONG_ANSWER -Mindjolt,260,33237916,PyPy 2,21708800,PRACTICE,6,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250939,TESTS,187,WRONG_ANSWER -Mindjolt,260,33237874,PyPy 2,21196800,PRACTICE,0,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250867,TESTS,62,WRONG_ANSWER -Mindjolt,260,33237861,PyPy 2,21196800,PRACTICE,0,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250838,TESTS,46,RUNTIME_ERROR -Mindjolt,260,33237829,PyPy 2,24268800,PRACTICE,6,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250784,TESTS,155,RUNTIME_ERROR -Mindjolt,260,33237800,PyPy 2,24268800,PRACTICE,6,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250737,TESTS,186,RUNTIME_ERROR -Mindjolt,260,33237788,PyPy 2,21196800,PRACTICE,0,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250712,TESTS,61,WRONG_ANSWER -Mindjolt,260,33237538,PyPy 2,26112000,PRACTICE,6,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250224,TESTS,202,RUNTIME_ERROR -Mindjolt,260,33237378,PyPy 2,26009600,PRACTICE,5,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513249896,TESTS,234,RUNTIME_ERROR -Mindjolt,260,33237337,PyPy 2,26112000,PRACTICE,5,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513249821,TESTS,218,RUNTIME_ERROR -Mindjolt,260,33237318,PyPy 2,21196800,PRACTICE,2,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513249774,TESTS,62,WRONG_ANSWER -Mindjolt,144,33234599,PyPy 2,21196800,PRACTICE,39,500.0,A,Arrival of the General,[implementation],2147483647,1513242376,TESTS,124,OK -Mindjolt,144,33233866,PyPy 2,21196800,PRACTICE,0,500.0,A,Arrival of the General,[implementation],2147483647,1513240265,TESTS,92,WRONG_ANSWER -Mindjolt,136,33233466,PyPy 2,21196800,PRACTICE,101,500.0,A,Presents,[implementation],2147483647,1513239210,TESTS,154,OK -Mindjolt,136,33233446,PyPy 2,0,PRACTICE,0,500.0,A,Presents,[implementation],2147483647,1513239167,TESTS,0,COMPILATION_ERROR -Mindjolt,122,33232554,PyPy 2,21196800,PRACTICE,36,500.0,A,Lucky Division,"[brute force, number theory]",2147483647,1513236162,TESTS,124,OK -Mindjolt,122,33232537,PyPy 2,21196800,PRACTICE,0,500.0,A,Lucky Division,"[brute force, number theory]",2147483647,1513236100,TESTS,92,RUNTIME_ERROR -Mindjolt,266,33232482,PyPy 2,21299200,PRACTICE,44,500.0,B,Queue at the School,"[constructive algorithms, graph matchings, implementation, shortest paths]",2147483647,1513235926,TESTS,124,OK -Mindjolt,266,33232461,PyPy 2,21196800,PRACTICE,5,500.0,B,Queue at the School,"[constructive algorithms, graph matchings, implementation, shortest paths]",2147483647,1513235860,TESTS,92,WRONG_ANSWER -Mindjolt,266,33232443,PyPy 2,0,PRACTICE,0,500.0,B,Queue at the School,"[constructive algorithms, graph matchings, implementation, shortest paths]",2147483647,1513235811,TESTS,0,COMPILATION_ERROR -Mindjolt,266,33232274,PyPy 2,21196800,PRACTICE,5,500.0,B,Queue at the School,"[constructive algorithms, graph matchings, implementation, shortest paths]",2147483647,1513235352,TESTS,122,WRONG_ANSWER -Mindjolt,58,33231921,PyPy 2,21196800,PRACTICE,40,500.0,A,Chat room,"[greedy, strings]",2147483647,1513234304,TESTS,62,OK -Mindjolt,58,33231778,PyPy 2,21196800,PRACTICE,37,500.0,A,Chat room,"[greedy, strings]",2147483647,1513233971,TESTS,62,WRONG_ANSWER -Mindjolt,58,33231048,PyPy 2,21196800,PRACTICE,37,500.0,A,Chat room,"[greedy, strings]",2147483647,1513231702,TESTS,62,WRONG_ANSWER -Mindjolt,58,33231007,PyPy 2,21196800,PRACTICE,37,500.0,A,Chat room,"[greedy, strings]",2147483647,1513231557,TESTS,62,WRONG_ANSWER -Mindjolt,58,33230959,PyPy 2,21196800,PRACTICE,2,500.0,A,Chat room,"[greedy, strings]",2147483647,1513231363,TESTS,61,WRONG_ANSWER -Mindjolt,58,33230913,PyPy 2,21196800,PRACTICE,1,500.0,A,Chat room,"[greedy, strings]",2147483647,1513231240,TESTS,62,RUNTIME_ERROR -Mindjolt,58,33230904,PyPy 2,0,PRACTICE,0,500.0,A,Chat room,"[greedy, strings]",2147483647,1513231203,TESTS,0,COMPILATION_ERROR -Mindjolt,58,33229971,PyPy 2,21196800,PRACTICE,0,500.0,A,Chat room,"[greedy, strings]",2147483647,1513227857,TESTS,61,WRONG_ANSWER -Mindjolt,58,33229960,PyPy 2,21196800,PRACTICE,0,500.0,A,Chat room,"[greedy, strings]",2147483647,1513227806,TESTS,46,RUNTIME_ERROR -Mindjolt,58,33229940,PyPy 2,21196800,PRACTICE,0,500.0,A,Chat room,"[greedy, strings]",2147483647,1513227722,TESTS,46,RUNTIME_ERROR -Mindjolt,160,33229673,PyPy 2,21196800,PRACTICE,29,500.0,A,Twins,"[greedy, sortings]",2147483647,1513226629,TESTS,154,OK -Mindjolt,160,33229648,PyPy 2,0,PRACTICE,0,500.0,A,Twins,"[greedy, sortings]",2147483647,1513226550,TESTS,0,COMPILATION_ERROR -Mindjolt,160,33229603,PyPy 2,21196800,PRACTICE,0,500.0,A,Twins,"[greedy, sortings]",2147483647,1513226294,TESTS,92,WRONG_ANSWER -Mindjolt,339,33223398,PyPy 2,21196800,PRACTICE,21,500.0,A,Helpful Maths,"[greedy, implementation, sortings, strings]",2147483647,1513191511,TESTS,124,OK -Mindjolt,339,33223380,PyPy 2,21196800,PRACTICE,0,500.0,A,Helpful Maths,"[greedy, implementation, sortings, strings]",2147483647,1513191443,TESTS,92,RUNTIME_ERROR -Mindjolt,339,33223353,PyPy 2,21196800,PRACTICE,0,500.0,A,Helpful Maths,"[greedy, implementation, sortings, strings]",2147483647,1513191365,TESTS,92,RUNTIME_ERROR -Mindjolt,112,33222645,PyPy 2,21196800,PRACTICE,53,500.0,A,Petya and Strings,"[implementation, strings]",2147483647,1513189180,TESTS,124,OK -Mindjolt,112,33222497,PyPy 2,21196800,PRACTICE,1,500.0,A,Petya and Strings,"[implementation, strings]",2147483647,1513188733,TESTS,92,WRONG_ANSWER -Mindjolt,112,33222475,PyPy 2,21196800,PRACTICE,0,500.0,A,Petya and Strings,"[implementation, strings]",2147483647,1513188656,TESTS,92,WRONG_ANSWER -Mindjolt,118,33222350,PyPy 2,21196800,PRACTICE,42,500.0,A,String Task,"[implementation, strings]",2147483647,1513188271,TESTS,124,OK -Mindjolt,118,33222313,PyPy 2,21196800,PRACTICE,14,500.0,A,String Task,"[implementation, strings]",2147483647,1513188177,TESTS,124,WRONG_ANSWER -Mindjolt,71,33222210,PyPy 2,21196800,PRACTICE,20,500.0,A,Way Too Long Words,[strings],2147483647,1513187843,TESTS,124,OK -Mindjolt,71,33222180,PyPy 2,21196800,PRACTICE,0,500.0,A,Way Too Long Words,[strings],2147483647,1513187756,TESTS,122,WRONG_ANSWER -Mindjolt,4,33221218,PyPy 2,21196800,PRACTICE,20,0.0,A,Watermelon,"[brute force, math]",2147483647,1513185170,TESTS,156,OK -Mindjolt,4,33221101,PyPy 2,21196800,PRACTICE,1,0.0,A,Watermelon,"[brute force, math]",2147483647,1513184927,TESTS,92,WRONG_ANSWER -Mindjolt,32,32756324,PyPy 2,21196800,PRACTICE,3,1000.0,B,Borze,"[expression parsing, implementation]",2147483647,1511887863,TESTS,216,WRONG_ANSWER -Mindjolt,320,31176707,PyPy 2,0,PRACTICE,47,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507578999,TESTS,124,OK -Mindjolt,320,31176690,PyPy 2,0,PRACTICE,0,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507578946,TESTS,60,WRONG_ANSWER -Mindjolt,320,31176608,PyPy 2,0,PRACTICE,12,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507578629,TESTS,124,WRONG_ANSWER -Mindjolt,318,31176601,Python 2,0,PRACTICE,0,500.0,A,Even Odds,[math],2147483647,1507578602,TESTS,92,RUNTIME_ERROR -Mindjolt,318,31176424,PyPy 2,0,PRACTICE,25,500.0,A,Even Odds,[math],2147483647,1507577976,TESTS,124,OK -Mindjolt,318,31176342,PyPy 2,0,PRACTICE,8,500.0,A,Even Odds,[math],2147483647,1507577715,TESTS,124,WRONG_ANSWER -Mindjolt,318,31176294,PyPy 2,0,PRACTICE,4,500.0,A,Even Odds,[math],2147483647,1507577591,TESTS,122,WRONG_ANSWER -Mindjolt,318,31176274,Python 2,0,PRACTICE,4,500.0,A,Even Odds,[math],2147483647,1507577543,TESTS,92,WRONG_ANSWER -Mindjolt,149,31176087,Python 2,0,PRACTICE,39,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507576864,TESTS,122,OK -Mindjolt,149,31176057,PyPy 2,0,PRACTICE,39,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507576759,TESTS,124,OK -Mindjolt,149,31176037,PyPy 2,0,PRACTICE,1,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507576679,TESTS,124,WRONG_ANSWER -Mindjolt,149,31175933,PyPy 2,0,PRACTICE,3,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507576344,TESTS,124,WRONG_ANSWER -Mindjolt,149,31175820,PyPy 2,0,PRACTICE,3,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507575978,TESTS,156,WRONG_ANSWER -Mindjolt,149,31175684,PyPy 2,0,PRACTICE,3,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507575573,TESTS,124,WRONG_ANSWER -Mindjolt,320,31171580,Python 2,0,PRACTICE,12,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507563320,TESTS,92,WRONG_ANSWER -Mindjolt,320,31171455,PyPy 2,0,PRACTICE,12,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507563043,TESTS,124,WRONG_ANSWER -Mindjolt,320,31171335,PyPy 2,0,PRACTICE,12,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507562694,TESTS,124,WRONG_ANSWER -Mindjolt,320,31171275,PyPy 2,0,PRACTICE,12,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507562511,TESTS,124,WRONG_ANSWER -Mindjolt,320,31171197,PyPy 2,0,PRACTICE,9,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507562342,TESTS,124,WRONG_ANSWER -Mindjolt,320,31171037,PyPy 2,0,PRACTICE,0,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507561908,TESTS,92,WRONG_ANSWER -Mindjolt,320,31170980,PyPy 2,0,PRACTICE,0,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507561745,TESTS,92,RUNTIME_ERROR -Mindjolt,320,31170903,PyPy 2,0,PRACTICE,10,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507561527,TESTS,186,WRONG_ANSWER -Mindjolt,270,30657110,GNU C,0,PRACTICE,3,500.0,A,Fancy Fence,"[geometry, implementation, math]",2147483647,1506230605,TESTS,30,OK -Mindjolt,363,30231013,Python 2,3276800,PRACTICE,6,1000.0,B,Fence,"[brute force, dp]",2147483647,1504977853,TESTS,1000,TIME_LIMIT_EXCEEDED -Mindjolt,363,30230715,Python 2,4915200,PRACTICE,6,1000.0,B,Fence,"[brute force, dp]",2147483647,1504976809,TESTS,1000,TIME_LIMIT_EXCEEDED -Mindjolt,363,30230643,Python 2,0,PRACTICE,1,1000.0,B,Fence,"[brute force, dp]",2147483647,1504976612,TESTS,46,WRONG_ANSWER -Mindjolt,363,30183493,Python 2,0,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1504794274,TESTS,30,WRONG_ANSWER -Mindjolt,363,30183141,Python 2,0,PRACTICE,1,1000.0,B,Fence,"[brute force, dp]",2147483647,1504793111,TESTS,31,RUNTIME_ERROR -Mindjolt,61,30175904,Python 2,0,PRACTICE,102,500.0,A,Ultra-Fast Mathematician,[implementation],2147483647,1504772427,TESTS,61,OK -Mindjolt,144,30163239,Python 2,0,PRACTICE,2,500.0,A,Arrival of the General,[implementation],2147483647,1504721361,TESTS,62,WRONG_ANSWER -Mindjolt,144,30163077,Python 2,0,PRACTICE,3,500.0,A,Arrival of the General,[implementation],2147483647,1504721021,TESTS,92,WRONG_ANSWER -Mindjolt,144,30162851,Python 2,0,PRACTICE,0,500.0,A,Arrival of the General,[implementation],2147483647,1504720535,TESTS,92,WRONG_ANSWER -Mindjolt,144,30162734,Python 2,0,PRACTICE,1,500.0,A,Arrival of the General,[implementation],2147483647,1504720260,TESTS,122,WRONG_ANSWER -Mindjolt,282,30158041,Python 2,0,PRACTICE,36,500.0,A,Bit++,[implementation],2147483647,1504712899,TESTS,62,OK -Mindjolt,282,30157725,Python 2,0,PRACTICE,36,500.0,A,Bit++,[implementation],2147483647,1504712625,TESTS,61,OK -Mindjolt,282,30157675,Python 2,0,PRACTICE,0,500.0,A,Bit++,[implementation],2147483647,1504712577,TESTS,46,WRONG_ANSWER -Mindjolt,841,29614476,Python 2,0,PRACTICE,114,500.0,A,Generous Kefa,"[brute force, implementation]",2147483647,1503211638,TESTS,93,OK -Mindjolt,841,29614428,Python 2,0,PRACTICE,1,500.0,A,Generous Kefa,"[brute force, implementation]",2147483647,1503211438,TESTS,46,WRONG_ANSWER -Mindjolt,352,29369156,Python 2,4710400,VIRTUAL,0,1000.0,B,Jeff and Periods,"[implementation, sortings]",3322,1502516122,TESTS,92,WRONG_ANSWER -Mindjolt,352,29369032,Python 2,4608000,VIRTUAL,0,1000.0,B,Jeff and Periods,"[implementation, sortings]",2836,1502515637,TESTS,62,WRONG_ANSWER -Mindjolt,352,29368651,Python 2,4710400,VIRTUAL,42,500.0,A,Jeff and Digits,"[brute force, implementation, math]",1381,1502514181,TESTS,124,OK -Mindjolt,352,29368608,Python 2,4608000,VIRTUAL,0,500.0,A,Jeff and Digits,"[brute force, implementation, math]",1240,1502514040,TESTS,92,WRONG_ANSWER -Mindjolt,352,29368535,Python 2,4608000,VIRTUAL,7,500.0,A,Jeff and Digits,"[brute force, implementation, math]",1031,1502513831,TESTS,124,WRONG_ANSWER -Mindjolt,352,29368462,Python 2,4710400,VIRTUAL,2,500.0,A,Jeff and Digits,"[brute force, implementation, math]",762,1502513562,TESTS,92,WRONG_ANSWER -Mindjolt,352,29368397,Python 2,4608000,VIRTUAL,0,500.0,A,Jeff and Digits,"[brute force, implementation, math]",528,1502513328,TESTS,92,WRONG_ANSWER -Mindjolt,352,29368376,Python 2,4608000,VIRTUAL,0,500.0,A,Jeff and Digits,"[brute force, implementation, math]",464,1502513264,TESTS,92,WRONG_ANSWER -Mindjolt,263,29336276,Python 2,4710400,PRACTICE,25,500.0,A,Beautiful Matrix,[implementation],2147483647,1502389199,TESTS,124,OK -Mindjolt,69,29336065,Python 2,4710400,PRACTICE,81,500.0,A,Young Physicist,"[implementation, math]",2147483647,1502388493,TESTS,124,OK -Mindjolt,69,29336009,Python 2,4710400,PRACTICE,0,500.0,A,Young Physicist,"[implementation, math]",2147483647,1502388314,TESTS,92,WRONG_ANSWER -Mindjolt,69,29335920,Python 2,4608000,PRACTICE,0,500.0,A,Young Physicist,"[implementation, math]",2147483647,1502387993,TESTS,62,WRONG_ANSWER +nimishagarg_ng,978,38212280,GNU C++14,3379200,PRACTICE,42,0.0,E,Bus Video System,[math],2147483647,1526296911,TESTS,15,OK +nimishagarg_ng,978,38209976,GNU C++14,4198400,PRACTICE,39,0.0,D,Almost Arithmetic Progression,"[brute force, implementation, math]",2147483647,1526289150,TESTS,46,OK +nimishagarg_ng,978,38181227,GNU C++14,4812800,OUT_OF_COMPETITION,6,0.0,D,Almost Arithmetic Progression,"[brute force, implementation, math]",6465,1526208765,TESTS,46,WRONG_ANSWER +nimishagarg_ng,978,38172881,GNU C++14,4915200,OUT_OF_COMPETITION,16,0.0,C,Letters,"[binary search, implementation, two pointers]",3559,1526205859,TESTS,638,OK +nimishagarg_ng,978,38170046,GNU C++14,3686400,OUT_OF_COMPETITION,13,0.0,B,File Name,"[greedy, strings]",2680,1526204980,TESTS,31,OK +nimishagarg_ng,978,38168915,GNU C++14,3686400,OUT_OF_COMPETITION,28,0.0,A,Remove Duplicates,[implementation],2360,1526204660,TESTS,30,OK +nimishagarg_ng,490,38151129,GNU C++14,3379200,PRACTICE,2,1000.0,B,Queue,"[dsu, implementation]",2147483647,1526180044,TESTS,15,WRONG_ANSWER +nimishagarg_ng,30,38150770,GNU C++14,3584000,PRACTICE,50,1500.0,C,Shooting Gallery,"[dp, probabilities]",2147483647,1526177812,TESTS,62,OK +nimishagarg_ng,30,38150560,GNU C++14,3481600,PRACTICE,3,1500.0,C,Shooting Gallery,"[dp, probabilities]",2147483647,1526176363,TESTS,30,WRONG_ANSWER +nimishagarg_ng,384,38150284,GNU C++14,4096000,PRACTICE,42,1500.0,C,Milking cows,[greedy],2147483647,1526174257,TESTS,62,OK +nimishagarg_ng,287,38130204,GNU C++14,7168000,PRACTICE,30,1500.0,C,Lucky Permutation,"[constructive algorithms, greedy, implementation, math]",2147483647,1526107688,TESTS,92,OK +nimishagarg_ng,237,38126819,GNU C++14,15667200,PRACTICE,55,1500.0,C,Primes on Interval,"[binary search, number theory, two pointers]",2147483647,1526096612,TESTS,78,OK +nimishagarg_ng,314,38119938,GNU C++14,3379200,PRACTICE,3,500.0,A,Sereja and Contest,[implementation],2147483647,1526058389,TESTS,30,WRONG_ANSWER +nimishagarg_ng,314,38119811,GNU C++14,3686400,PRACTICE,3,500.0,A,Sereja and Contest,[implementation],2147483647,1526058035,TESTS,60,WRONG_ANSWER +nimishagarg_ng,314,38119681,GNU C++14,3686400,PRACTICE,3,500.0,A,Sereja and Contest,[implementation],2147483647,1526057601,TESTS,30,WRONG_ANSWER +nimishagarg_ng,788,38118654,GNU C++14,4915200,PRACTICE,52,500.0,A,Functions again,"[dp, two pointers]",2147483647,1526054411,TESTS,46,OK +nimishagarg_ng,704,38074813,GNU C++14,187801600,PRACTICE,99,500.0,A,Thor,"[brute force, data structures, implementation]",2147483647,1525876974,TESTS,904,OK +nimishagarg_ng,272,38070588,GNU C++14,4096000,PRACTICE,48,1500.0,C,Dima and Staircase,"[data structures, implementation]",2147483647,1525868079,TESTS,716,OK +nimishagarg_ng,578,38067046,GNU C++14,3379200,PRACTICE,31,250.0,A,A Problem about Polyline,"[geometry, math]",2147483647,1525859627,TESTS,15,OK +nimishagarg_ng,980,38045496,GNU C++14,3891200,CONTESTANT,82,1500.0,C,Posterized,"[games, greedy]",5899,1525797799,TESTS,77,OK +nimishagarg_ng,980,38044308,GNU C++14,3481600,CONTESTANT,8,1500.0,C,Posterized,"[games, greedy]",5471,1525797371,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,980,38037469,GNU C++14,3379200,CONTESTANT,88,1000.0,B,Marlin,[constructive algorithms],3152,1525795052,TESTS,31,OK +nimishagarg_ng,980,38031806,GNU C++14,3379200,CONTESTANT,4,1000.0,B,Marlin,[constructive algorithms],1518,1525793418,PRETESTS,30,WRONG_ANSWER +nimishagarg_ng,980,38026130,GNU C++14,3379200,CONTESTANT,69,500.0,A,Links and Pearls,"[implementation, math]",353,1525792253,TESTS,31,OK +nimishagarg_ng,922,38021274,GNU C++14,3686400,PRACTICE,90,1250.0,C,Cave Painting,"[brute force, number theory]",2147483647,1525784850,TESTS,46,OK +nimishagarg_ng,745,38019929,GNU C++14,4915200,PRACTICE,61,1500.0,C,Hongcow Builds A Nation,"[constructive algorithms, dfs and similar, graphs]",2147483647,1525781584,TESTS,61,OK +nimishagarg_ng,599,38018249,GNU C++14,7577600,PRACTICE,61,1000.0,B,Spongebob and Joke,[implementation],2147483647,1525777141,TESTS,124,OK +nimishagarg_ng,599,38018202,GNU C++14,7577600,PRACTICE,19,1000.0,B,Spongebob and Joke,[implementation],2147483647,1525777005,TESTS,108,WRONG_ANSWER +nimishagarg_ng,731,38017757,GNU C++14,27648000,PRACTICE,70,1500.0,C,Socks,"[dsu, graphs, greedy]",2147483647,1525775732,TESTS,483,OK +nimishagarg_ng,782,38016934,GNU C++14,4608000,PRACTICE,46,1000.0,B,The Meeting Place Cannot Be Changed,"[binary search, ternary search]",2147483647,1525773002,TESTS,77,OK +nimishagarg_ng,782,38016844,GNU C++14,3379200,PRACTICE,2,1000.0,B,The Meeting Place Cannot Be Changed,"[binary search, ternary search]",2147483647,1525772663,TESTS,5000,TIME_LIMIT_EXCEEDED +nimishagarg_ng,505,38004257,GNU C++14,3481600,PRACTICE,29,1000.0,B,Mr. Kitayuta's Colorful Graph,"[dfs and similar, dp, dsu, graphs]",2147483647,1525716678,TESTS,31,OK +nimishagarg_ng,322,38003054,GNU C++14,3379200,PRACTICE,40,1000.0,B,Ciel and Flowers,"[combinatorics, math]",2147483647,1525713412,TESTS,62,OK +nimishagarg_ng,322,38002940,GNU C++14,3379200,PRACTICE,9,1000.0,B,Ciel and Flowers,"[combinatorics, math]",2147483647,1525713147,TESTS,30,WRONG_ANSWER +nimishagarg_ng,527,37998596,GNU C++14,6963200,PRACTICE,57,1000.0,B,Error Correct System,[greedy],2147483647,1525703492,TESTS,31,OK +nimishagarg_ng,697,37986349,GNU C++14,3686400,PRACTICE,42,1000.0,B,Barnicle,[implementation],2147483647,1525673595,TESTS,31,OK +nimishagarg_ng,697,37986255,GNU C++14,3686400,PRACTICE,29,1000.0,B,Barnicle,[implementation],2147483647,1525673263,TESTS,31,WRONG_ANSWER +nimishagarg_ng,697,37986151,GNU C++14,3686400,PRACTICE,8,1000.0,B,Barnicle,[implementation],2147483647,1525672910,TESTS,15,WRONG_ANSWER +nimishagarg_ng,498,37985609,GNU C++14,3686400,PRACTICE,51,500.0,A,Crazy Town,[geometry],2147483647,1525670718,TESTS,31,OK +nimishagarg_ng,498,37985562,GNU C++14,3379200,PRACTICE,2,500.0,A,Crazy Town,[geometry],2147483647,1525670476,TESTS,15,WRONG_ANSWER +nimishagarg_ng,793,37918236,GNU C++14,5939200,PRACTICE,66,1000.0,B,Igor and his way to work,"[dfs and similar, shortest paths]",2147483647,1525580227,TESTS,46,OK +nimishagarg_ng,271,37887659,GNU C++14,10035200,PRACTICE,42,1000.0,B,Prime Matrix,"[binary search, brute force, math, number theory]",2147483647,1525451240,TESTS,218,OK +nimishagarg_ng,689,37887315,GNU C++14,5017600,PRACTICE,54,1000.0,B,Mike and Shortcuts,[dfs and similar],2147483647,1525450086,TESTS,93,OK +nimishagarg_ng,689,37886808,GNU C++14,3379200,PRACTICE,5,1000.0,B,Mike and Shortcuts,[dfs and similar],2147483647,1525448402,TESTS,30,WRONG_ANSWER +nimishagarg_ng,689,37886615,GNU C++14,3379200,PRACTICE,3,1000.0,B,Mike and Shortcuts,[dfs and similar],2147483647,1525447679,TESTS,31,WRONG_ANSWER +nimishagarg_ng,958,37367425,GNU C++14,7372800,PRACTICE,59,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",2147483647,1523867251,TESTS,124,OK +toxic_hack,958,37324952,GNU C++14,3481600,CONTESTANT,1,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",16274,1523705774,TESTS,15,WRONG_ANSWER +toxic_hack,958,37324814,GNU C++14,3584000,CONTESTANT,36,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",16069,1523705569,TESTS,46,WRONG_ANSWER +toxic_hack,958,37324745,GNU C++14,3481600,CONTESTANT,1,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",15942,1523705442,TESTS,15,WRONG_ANSWER +toxic_hack,958,37324717,GNU C++14,0,CONTESTANT,0,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",15884,1523705384,TESTS,0,COMPILATION_ERROR +toxic_hack,958,37324231,GNU C++14,3481600,CONTESTANT,1,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",14397,1523703897,TESTS,15,WRONG_ANSWER +toxic_hack,958,37323263,GNU C++14,3481600,CONTESTANT,1,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",12515,1523702015,TESTS,15,WRONG_ANSWER +toxic_hack,958,37322951,GNU C++14,3584000,CONTESTANT,36,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",12104,1523701604,TESTS,46,WRONG_ANSWER +toxic_hack,958,37322397,GNU C++14,3379200,CONTESTANT,6,0.0,F2,Lightsabers (medium),"[binary search, two pointers]",11392,1523700892,TESTS,15,WRONG_ANSWER +toxic_hack,958,37316187,Python 2,6041600,CONTESTANT,51,0.0,E1,Guard Duty (easy),"[brute force, geometry, greedy, math]",4621,1523694121,TESTS,124,OK +toxic_hack,958,37314807,GNU C++14,3481600,CONTESTANT,36,0.0,A1,Death Stars (easy),[implementation],3484,1523692984,TESTS,31,OK +toxic_hack,958,37314638,GNU C++14,8806400,CONTESTANT,16,0.0,D1,Hyperspace Jump (easy),"[expression parsing, math]",3360,1523692860,TESTS,498,OK +toxic_hack,958,37313762,GNU C++14,3379200,CONTESTANT,69,0.0,F1,Lightsabers (easy),[implementation],2682,1523692182,TESTS,31,OK +toxic_hack,958,37312899,GNU C++14,3379200,CONTESTANT,1,0.0,F1,Lightsabers (easy),[implementation],2005,1523691505,TESTS,15,WRONG_ANSWER +toxic_hack,958,37311424,GNU C++14,4915200,CONTESTANT,27,0.0,C1,Encryption (easy),[brute force],886,1523690386,TESTS,46,OK +toxic_hack,958,37311258,GNU C++14,3379200,CONTESTANT,9,0.0,B1,Maximum Control (easy),[implementation],748,1523690248,TESTS,15,OK +nimishagarg_ng,962,37171045,GNU C++14,24985600,CONTESTANT,26,0.0,D,Merge Equals,"[data structures, implementation]",6136,1523377036,TESTS,389,OK +nimishagarg_ng,962,37169046,GNU C++14,3481600,CONTESTANT,5,0.0,D,Merge Equals,"[data structures, implementation]",5435,1523376335,TESTS,30,WRONG_ANSWER +nimishagarg_ng,962,37162729,GNU C++14,4710400,CONTESTANT,70,0.0,C,Make a Square,"[brute force, implementation, math]",3380,1523374280,TESTS,31,OK +nimishagarg_ng,962,37161843,GNU C++14,4403200,CONTESTANT,9,0.0,C,Make a Square,"[brute force, implementation, math]",3135,1523374035,TESTS,31,WRONG_ANSWER +nimishagarg_ng,962,37155503,GNU C++14,4300800,CONTESTANT,93,0.0,B,Students in Railway Carriage,"[constructive algorithms, greedy, implementation]",1561,1523372461,TESTS,31,OK +nimishagarg_ng,962,37148679,GNU C++14,5222400,CONTESTANT,106,0.0,A,Equator,[implementation],247,1523371147,TESTS,77,OK +nimishagarg_ng,688,36887958,GNU C++14,9216000,PRACTICE,56,1500.0,C,NP-Hard Problem,"[dfs and similar, graphs]",2147483647,1522698292,TESTS,93,OK +nimishagarg_ng,495,36704625,GNU C++14,3686400,PRACTICE,37,1000.0,B,Modular Equations,[math],2147483647,1522272027,TESTS,31,OK +nimishagarg_ng,496,36703295,GNU C++14,3788800,PRACTICE,49,1750.0,C,Removing Columns,"[brute force, constructive algorithms, implementation]",2147483647,1522267306,TESTS,30,OK +nimishagarg_ng,92,36701030,GNU C++14,5939200,PRACTICE,51,1500.0,C,Newspaper Headline,"[binary search, data structures, dp, greedy]",2147483647,1522260096,TESTS,124,OK +nimishagarg_ng,92,36700593,GNU C++14,3379200,PRACTICE,3,1500.0,C,Newspaper Headline,"[binary search, data structures, dp, greedy]",2147483647,1522258846,TESTS,30,WRONG_ANSWER +nimishagarg_ng,104,36698248,GNU C++14,3686400,PRACTICE,47,1500.0,C,Cthulhu,"[dsu, trees]",2147483647,1522252926,TESTS,62,OK +nimishagarg_ng,104,36698012,GNU C++14,3379200,PRACTICE,2,1500.0,C,Cthulhu,"[dsu, trees]",2147483647,1522252297,TESTS,30,WRONG_ANSWER +nimishagarg_ng,204,36696001,GNU C++14,3686400,PRACTICE,62,500.0,A,Little Elephant and Interval,"[binary search, combinatorics, dp]",2147483647,1522247140,TESTS,60,OK +nimishagarg_ng,948,36694195,GNU C++14,99328000,PRACTICE,50,2000.0,D,Perfect Security,[data structures],2147483647,1522243995,TESTS,654,OK +nimishagarg_ng,955,36651568,GNU C++14,24678400,PRACTICE,20,1500.0,C,Sad powers,"[binary search, math, number theory]",2147483647,1522090909,TESTS,811,OK +nimishagarg_ng,955,36651461,GNU C++14,24371200,PRACTICE,2,1500.0,C,Sad powers,"[binary search, math, number theory]",2147483647,1522090575,TESTS,1123,WRONG_ANSWER +nimishagarg_ng,955,36542374,GNU C++14,3379200,CONTESTANT,34,500.0,A,Feed the cat,"[greedy, math]",2327,1521825227,TESTS,30,OK +nimishagarg_ng,955,36541836,GNU C++14,3379200,CONTESTANT,2,500.0,A,Feed the cat,"[greedy, math]",2124,1521825024,PRETESTS,31,WRONG_ANSWER +nimishagarg_ng,955,36540733,GNU C++14,3686400,CONTESTANT,56,1000.0,B,Not simply beatiful strings,[implementation],1750,1521824650,TESTS,31,OK +nimishagarg_ng,955,36538676,GNU C++14,3379200,CONTESTANT,2,500.0,A,Feed the cat,"[greedy, math]",1118,1521824018,PRETESTS,30,WRONG_ANSWER +nimishagarg_ng,955,36538297,GNU C++14,3379200,CONTESTANT,0,500.0,A,Feed the cat,"[greedy, math]",999,1521823899,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,954,36533532,GNU C++14,7987200,PRACTICE,35,0.0,D,Fight Against Traffic,"[dfs and similar, graphs, shortest paths]",2147483647,1521815423,TESTS,31,OK +nimishagarg_ng,765,36506190,GNU C++14,10444800,PRACTICE,43,2000.0,D,Artsem and Saunders,"[constructive algorithms, dsu, math]",2147483647,1521728933,TESTS,93,OK +nimishagarg_ng,626,36441944,GNU C++14,3379200,PRACTICE,78,1000.0,C,Block Towers,"[brute force, greedy]",2147483647,1521577488,TESTS,31,OK +nimishagarg_ng,626,36441838,GNU C++14,3379200,PRACTICE,6,1000.0,C,Block Towers,"[brute force, greedy]",2147483647,1521576992,TESTS,15,WRONG_ANSWER +nimishagarg_ng,146,36381262,GNU C++14,9318400,PRACTICE,99,2000.0,D,Lucky Number 2,"[brute force, constructive algorithms, implementation]",2147483647,1521360101,TESTS,92,OK +nimishagarg_ng,146,36381087,GNU C++14,9318400,PRACTICE,19,2000.0,D,Lucky Number 2,"[brute force, constructive algorithms, implementation]",2147483647,1521359720,TESTS,60,WRONG_ANSWER +nimishagarg_ng,685,36370183,GNU C++14,41984000,PRACTICE,49,1250.0,B,Kay and Snowflake,"[data structures, dfs and similar, trees]",2147483647,1521315170,TESTS,935,OK +nimishagarg_ng,949,36207411,GNU C++14,1945600,PRACTICE,36,1000.0,B,A Leapfrog in the Array,[math],2147483647,1520790987,TESTS,607,OK +nimishagarg_ng,949,36197463,GNU C++14,1843200,PRACTICE,6,1000.0,B,A Leapfrog in the Array,[math],2147483647,1520768142,TESTS,748,WRONG_ANSWER +nimishagarg_ng,949,36175350,GNU C++14,11059200,PRACTICE,71,500.0,A,Zebras,[greedy],2147483647,1520703780,TESTS,93,OK +nimishagarg_ng,949,36154343,GNU C++14,8908800,PRACTICE,8,500.0,A,Zebras,[greedy],2147483647,1520694349,TESTS,62,WRONG_ANSWER +nimishagarg_ng,949,36153929,GNU C++14,9216000,PRACTICE,7,500.0,A,Zebras,[greedy],2147483647,1520693414,TESTS,77,WRONG_ANSWER +nimishagarg_ng,949,36153878,GNU C++14,9830400,PRACTICE,7,500.0,A,Zebras,[greedy],2147483647,1520693312,TESTS,77,WRONG_ANSWER +nimishagarg_ng,949,36153838,GNU C++14,1843200,PRACTICE,0,500.0,A,Zebras,[greedy],2147483647,1520693188,TESTS,0,WRONG_ANSWER +nimishagarg_ng,949,36152950,GNU C++14,4915200,PRACTICE,7,500.0,A,Zebras,[greedy],2147483647,1520690802,TESTS,15,WRONG_ANSWER +nimishagarg_ng,931,36077952,GNU C++14,10444800,VIRTUAL,90,1750.0,D,Peculiar apple-tree,[dfs and similar],6545,1520529245,TESTS,46,OK +nimishagarg_ng,931,36076060,GNU C++14,1945600,VIRTUAL,64,1000.0,B,World Cup,[implementation],1525,1520524225,TESTS,30,OK +nimishagarg_ng,931,36075679,GNU C++14,1945600,VIRTUAL,40,500.0,A,Friends Meeting,"[brute force, implementation, math]",458,1520523158,TESTS,15,OK +nimishagarg_ng,657,35977849,GNU C++14,2048000,PRACTICE,72,500.0,A,Bear and Forgotten Tree 3,[graphs],2147483647,1520287837,TESTS,46,OK +nimishagarg_ng,657,35977843,GNU C++14,1843200,PRACTICE,0,500.0,A,Bear and Forgotten Tree 3,[graphs],2147483647,1520287801,TESTS,15,WRONG_ANSWER +nimishagarg_ng,657,35977798,GNU C++14,1945600,PRACTICE,4,500.0,A,Bear and Forgotten Tree 3,[graphs],2147483647,1520287522,TESTS,15,WRONG_ANSWER +nimishagarg_ng,657,35977693,GNU C++14,1843200,PRACTICE,9,500.0,A,Bear and Forgotten Tree 3,[graphs],2147483647,1520286931,TESTS,30,WRONG_ANSWER +nimishagarg_ng,657,35977585,GNU C++14,1843200,PRACTICE,4,500.0,A,Bear and Forgotten Tree 3,[graphs],2147483647,1520286374,TESTS,15,WRONG_ANSWER +nimishagarg_ng,768,35931476,GNU C++14,2252800,PRACTICE,87,1250.0,C,Jon Snow and his Favourite Number,"[brute force, dp, implementation, sortings]",2147483647,1520178790,TESTS,2090,OK +nimishagarg_ng,768,35928607,GNU C++14,2252800,PRACTICE,87,1250.0,C,Jon Snow and his Favourite Number,"[brute force, dp, implementation, sortings]",2147483647,1520178128,TESTS,2105,OK +nimishagarg_ng,938,35358518,GNU C++14,1945600,CONTESTANT,24,0.0,C,Constructing Tests,"[binary search, brute force]",3879,1518797379,TESTS,15,OK +nimishagarg_ng,938,35351949,GNU C++14,2252800,CONTESTANT,48,0.0,B,Run For Your Prize,"[brute force, greedy]",1917,1518795417,TESTS,31,OK +nimishagarg_ng,938,35346604,GNU C++14,1945600,CONTESTANT,49,0.0,A,Word Correction,[implementation],815,1518794315,TESTS,15,OK +toxic_hack,934,35336657,GNU C++14,2048000,VIRTUAL,45,1000.0,B,A Prosperous Lot,[implementation],760,1518783760,TESTS,15,OK +toxic_hack,934,35336651,GNU C++14,2048000,VIRTUAL,87,500.0,A,A Compatible Pair,"[brute force, games]",750,1518783750,TESTS,15,OK +toxic_hack,934,35336569,Python 2,4608000,VIRTUAL,84,500.0,A,A Compatible Pair,"[brute force, games]",558,1518783558,TESTS,62,RUNTIME_ERROR +toxic_hack,934,35336502,Python 2,4608000,VIRTUAL,5,500.0,A,A Compatible Pair,"[brute force, games]",426,1518783426,TESTS,62,RUNTIME_ERROR +nimishagarg_ng,407,35166409,GNU C++14,47820800,PRACTICE,51,500.0,A,Triangle,"[brute force, implementation, math]",2147483647,1518399243,TESTS,187,OK +nimishagarg_ng,407,35166348,GNU C++14,47820800,PRACTICE,10,500.0,A,Triangle,"[brute force, implementation, math]",2147483647,1518398837,TESTS,217,WRONG_ANSWER +nimishagarg_ng,407,35166320,GNU C++14,47820800,PRACTICE,8,500.0,A,Triangle,"[brute force, implementation, math]",2147483647,1518398686,TESTS,187,WRONG_ANSWER +nimishagarg_ng,407,35165796,GNU C++14,1945600,PRACTICE,1,500.0,A,Triangle,"[brute force, implementation, math]",2147483647,1518395113,TESTS,0,WRONG_ANSWER +nimishagarg_ng,121,35165662,GNU C++14,1945600,PRACTICE,42,500.0,A,Lucky Sum,[implementation],2147483647,1518393939,TESTS,15,OK +nimishagarg_ng,121,35165652,GNU C++14,1945600,PRACTICE,29,500.0,A,Lucky Sum,[implementation],2147483647,1518393834,TESTS,15,WRONG_ANSWER +nimishagarg_ng,53,35165320,GNU C++14,1945600,PRACTICE,22,1500.0,C,Little Frog,[constructive algorithms],2147483647,1518391438,TESTS,30,OK +lazycoder1412,922,35071989,Python 2,4608000,VIRTUAL,4,1250.0,C,Cave Painting,"[brute force, number theory]",5103,1518122463,TESTS,62,WRONG_ANSWER +lazycoder1412,922,35071971,Python 2,4505600,VIRTUAL,4,1250.0,C,Cave Painting,"[brute force, number theory]",5055,1518122415,TESTS,46,WRONG_ANSWER +lazycoder1412,922,35071532,Python 2,4608000,VIRTUAL,52,500.0,A,Cloning Toys,[implementation],3581,1518120941,TESTS,62,OK +lazycoder1412,922,35070906,Python 2,4608000,VIRTUAL,21,500.0,A,Cloning Toys,[implementation],1710,1518119070,TESTS,62,WRONG_ANSWER +lazycoder1412,922,35070596,Python 2,4608000,VIRTUAL,4,500.0,A,Cloning Toys,[implementation],926,1518118286,TESTS,46,WRONG_ANSWER +lazycoder1412,922,35070592,GNU C++14,1945600,VIRTUAL,44,1000.0,B,Magic Forest,[brute force],918,1518118278,TESTS,31,OK +lazycoder1412,922,35070455,Python 2,4505600,VIRTUAL,4,500.0,A,Cloning Toys,[implementation],538,1518117898,TESTS,61,WRONG_ANSWER +nimishagarg_ng,375,35037603,GNU C++14,3993600,PRACTICE,58,500.0,A,Divisible by Seven,"[math, number theory]",2147483647,1518041896,TESTS,93,OK +nimishagarg_ng,375,35037514,GNU C++14,3993600,PRACTICE,36,500.0,A,Divisible by Seven,"[math, number theory]",2147483647,1518041623,TESTS,93,WRONG_ANSWER +nimishagarg_ng,375,35037367,GNU C++14,1843200,PRACTICE,2,500.0,A,Divisible by Seven,"[math, number theory]",2147483647,1518041152,TESTS,0,WRONG_ANSWER +toxic_hack,822,35004892,GNU C++14,9216000,VIRTUAL,2,1250.0,C,"Hacker, pack your bags!","[binary search, greedy, sortings]",6411,1518020631,TESTS,0,RUNTIME_ERROR +toxic_hack,822,35004808,GNU C++14,9216000,VIRTUAL,2,1250.0,C,"Hacker, pack your bags!","[binary search, greedy, sortings]",6243,1518020463,TESTS,0,RUNTIME_ERROR +toxic_hack,822,35002428,GNU C++14,2048000,VIRTUAL,113,750.0,B,Crossword solving,"[brute force, implementation, strings]",968,1518015188,TESTS,15,OK +toxic_hack,822,35002325,GNU C++14,1945600,VIRTUAL,5,750.0,B,Crossword solving,"[brute force, implementation, strings]",754,1518014974,TESTS,0,WRONG_ANSWER +toxic_hack,822,35001996,Python 2,4608000,VIRTUAL,59,500.0,A,I'm bored with life,"[implementation, math, number theory]",149,1518014369,TESTS,62,OK +nimishagarg_ng,364,34990327,GNU C++14,2867200,PRACTICE,39,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517985618,TESTS,468,WRONG_ANSWER +nimishagarg_ng,364,34990148,GNU C++14,2867200,PRACTICE,39,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517985211,TESTS,468,WRONG_ANSWER +nimishagarg_ng,364,34989810,GNU C++14,2867200,PRACTICE,39,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517984274,TESTS,499,WRONG_ANSWER +nimishagarg_ng,364,34988562,GNU C++14,2867200,PRACTICE,11,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517980644,TESTS,499,WRONG_ANSWER +nimishagarg_ng,364,34977910,GNU C++14,3584000,PRACTICE,11,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517937374,TESTS,483,WRONG_ANSWER +nimishagarg_ng,364,34977691,GNU C++14,3584000,PRACTICE,4,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517936836,TESTS,514,WRONG_ANSWER +nimishagarg_ng,364,34977551,GNU C++14,2252800,PRACTICE,3,500.0,A,Matrix,"[combinatorics, data structures, implementation]",2147483647,1517936494,TESTS,15,RUNTIME_ERROR +nimishagarg_ng,487,34976648,GNU C++14,1945600,PRACTICE,46,500.0,A,Fight the Monster,"[binary search, brute force]",2147483647,1517934287,TESTS,15,OK +nimishagarg_ng,487,34974628,GNU C++14,1843200,PRACTICE,12,500.0,A,Fight the Monster,"[binary search, brute force]",2147483647,1517929440,TESTS,15,WRONG_ANSWER +nimishagarg_ng,150,34958277,GNU C++14,103526400,PRACTICE,53,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517880170,TESTS,405,OK +nimishagarg_ng,150,34958212,GNU C++14,103526400,PRACTICE,27,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517879878,TESTS,514,WRONG_ANSWER +nimishagarg_ng,150,34958133,GNU C++14,1945600,PRACTICE,53,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517879496,TESTS,46,OK +nimishagarg_ng,150,34957886,GNU C++14,103526400,PRACTICE,9,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517878148,TESTS,2000,TIME_LIMIT_EXCEEDED +nimishagarg_ng,150,34957855,GNU C++14,94720000,PRACTICE,3,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517877971,TESTS,2000,TIME_LIMIT_EXCEEDED +nimishagarg_ng,150,34957721,GNU C++14,103526400,PRACTICE,14,500.0,A,Win or Freeze,"[games, number theory]",2147483647,1517877176,TESTS,1715,WRONG_ANSWER +toxic_hack,485,34876030,Python 2,4812800,VIRTUAL,27,1500.0,C,Bits,"[implementation, math]",5723,1517604263,TESTS,717,OK +toxic_hack,485,34875605,Python 2,4608000,VIRTUAL,1,1500.0,C,Bits,"[implementation, math]",4237,1517602777,TESTS,46,WRONG_ANSWER +toxic_hack,485,34875461,Python 2,4710400,VIRTUAL,3,1500.0,C,Bits,"[implementation, math]",3815,1517602355,TESTS,124,WRONG_ANSWER +toxic_hack,485,34875326,Python 2,4608000,VIRTUAL,1,1500.0,C,Bits,"[implementation, math]",3385,1517601925,TESTS,61,WRONG_ANSWER +toxic_hack,485,34875273,Python 2,4608000,VIRTUAL,1,1500.0,C,Bits,"[implementation, math]",3237,1517601778,TESTS,46,WRONG_ANSWER +toxic_hack,485,34875204,Python 2,4608000,VIRTUAL,1,1500.0,C,Bits,"[implementation, math]",3062,1517601602,TESTS,46,WRONG_ANSWER +toxic_hack,485,34874655,GNU C++14,1945600,VIRTUAL,23,1000.0,A,Factory,"[implementation, math, matrices]",1539,1517600079,TESTS,15,OK +toxic_hack,485,34874507,GNU C++14,1945600,VIRTUAL,20,1000.0,A,Factory,"[implementation, math, matrices]",1119,1517599659,TESTS,15,WRONG_ANSWER +toxic_hack,485,34874339,GNU C++14,1945600,VIRTUAL,45,500.0,B,Valuable Resources,"[brute force, greedy]",736,1517599276,TESTS,15,OK +toxic_hack,485,34874291,GNU C++14,1843200,VIRTUAL,6,500.0,B,Valuable Resources,"[brute force, greedy]",591,1517599131,TESTS,15,WRONG_ANSWER +nimishagarg_ng,920,34856908,GNU C++14,3993600,CONTESTANT,139,0.0,C,Swap Adjacent Elements,"[dfs and similar, greedy, sortings, two pointers]",3633,1517585733,TESTS,62,OK +nimishagarg_ng,920,34851129,GNU C++14,1945600,CONTESTANT,8,0.0,B,Tea Queue,[implementation],2169,1517584269,TESTS,15,OK +nimishagarg_ng,920,34848400,GNU C++14,1945600,CONTESTANT,21,0.0,A,Water The Garden,[implementation],1569,1517583669,TESTS,15,OK +nimishagarg_ng,920,34845346,GNU C++14,1843200,CONTESTANT,1,0.0,A,Water The Garden,[implementation],944,1517583044,TESTS,0,WRONG_ANSWER +nimishagarg_ng,242,34828601,GNU C++14,7884800,PRACTICE,43,1500.0,C,King's Path,"[dfs and similar, hashing, shortest paths]",2147483647,1517552547,TESTS,248,OK +nimishagarg_ng,242,34822398,GNU C++14,17817600,PRACTICE,10,1500.0,C,King's Path,"[dfs and similar, hashing, shortest paths]",2147483647,1517530202,TESTS,2000,TIME_LIMIT_EXCEEDED +nimishagarg_ng,242,34822333,GNU C++14,11264000,PRACTICE,10,1500.0,C,King's Path,"[dfs and similar, hashing, shortest paths]",2147483647,1517529842,TESTS,2000,TIME_LIMIT_EXCEEDED +nimishagarg_ng,242,34820543,GNU C++14,14028800,PRACTICE,10,1500.0,C,King's Path,"[dfs and similar, hashing, shortest paths]",2147483647,1517520613,TESTS,2000,TIME_LIMIT_EXCEEDED +lazycoder1412,205,34779564,GNU C++14,18124800,VIRTUAL,90,1500.0,D,Little Elephant and Cards,"[binary search, brute force, sortings]",5372,1517427272,TESTS,530,OK +lazycoder1412,205,34779213,GNU C++14,2048000,VIRTUAL,13,1500.0,D,Little Elephant and Cards,"[binary search, brute force, sortings]",4590,1517426490,TESTS,30,WRONG_ANSWER +lazycoder1412,205,34778523,GNU C++14,2662400,VIRTUAL,45,1000.0,B,Little Elephant and Sorting,"[brute force, greedy]",2855,1517424755,TESTS,46,OK +lazycoder1412,205,34777526,GNU C++14,1843200,VIRTUAL,4,1000.0,B,Little Elephant and Sorting,"[brute force, greedy]",727,1517422627,TESTS,15,WRONG_ANSWER +lazycoder1412,205,34777281,Python 2,14848000,VIRTUAL,45,500.0,A,Little Elephant and Rozdil,"[brute force, implementation]",239,1517422139,TESTS,560,OK +nimishagarg_ng,919,34760468,GNU C++14,1843200,CONTESTANT,3,750.0,B,Perfect Number,"[binary search, brute force, dp, implementation, number theory]",3859,1517407759,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,919,34759588,GNU C++14,1843200,CONTESTANT,3,750.0,B,Perfect Number,"[binary search, brute force, dp, implementation, number theory]",3643,1517407543,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,919,34756007,GNU C++14,5836800,CONTESTANT,51,1000.0,C,Seat Arrangements,[implementation],2843,1517406743,TESTS,124,OK +nimishagarg_ng,919,34754644,GNU C++14,5836800,CONTESTANT,12,1000.0,C,Seat Arrangements,[implementation],2573,1517406473,CHALLENGES,93,CHALLENGED +nimishagarg_ng,919,34753072,GNU C++14,2867200,CONTESTANT,6,1000.0,C,Seat Arrangements,[implementation],2279,1517406179,PRETESTS,31,WRONG_ANSWER +nimishagarg_ng,919,34739818,GNU C++14,1945600,CONTESTANT,43,500.0,A,Supermarket,[greedy],326,1517404226,TESTS,15,OK +nimishagarg_ng,246,34584426,GNU C++14,25497600,VIRTUAL,37,2000.0,D,Colorful Graph,"[brute force, dfs and similar, graphs]",5792,1516989992,TESTS,560,OK +nimishagarg_ng,246,34584147,GNU C++14,1843200,VIRTUAL,2,2000.0,D,Colorful Graph,"[brute force, dfs and similar, graphs]",5139,1516989339,TESTS,30,WRONG_ANSWER +nimishagarg_ng,246,34583616,GNU C++14,1945600,VIRTUAL,34,1500.0,C,Beauty Pageant,"[brute force, constructive algorithms, greedy]",3652,1516987852,TESTS,30,OK +nimishagarg_ng,246,34582725,Python 2,7372800,VIRTUAL,30,1000.0,B,Increase and Decrease,"[greedy, math]",1743,1516985943,TESTS,154,OK +nimishagarg_ng,246,34582027,Python 2,4608000,VIRTUAL,21,500.0,A,Buggy Sorting,"[constructive algorithms, greedy, sortings]",315,1516984515,TESTS,62,OK +nimishagarg_ng,214,34578091,GNU C++14,3584000,PRACTICE,101,1000.0,B,Hometask,"[brute force, constructive algorithms, greedy, math]",2147483647,1516976104,TESTS,92,OK +nimishagarg_ng,214,34578051,GNU C++14,3584000,PRACTICE,11,1000.0,B,Hometask,"[brute force, constructive algorithms, greedy, math]",2147483647,1516976013,TESTS,92,WRONG_ANSWER +nimishagarg_ng,214,34577998,GNU C++14,3584000,PRACTICE,12,1000.0,B,Hometask,"[brute force, constructive algorithms, greedy, math]",2147483647,1516975898,TESTS,62,WRONG_ANSWER +nimishagarg_ng,448,34558229,GNU C++14,1945600,PRACTICE,127,2000.0,D,Multiplication Table,"[binary search, brute force]",2147483647,1516914686,TESTS,187,OK +nimishagarg_ng,448,34558086,GNU C++14,1945600,PRACTICE,5,2000.0,D,Multiplication Table,"[binary search, brute force]",2147483647,1516914111,TESTS,15,WRONG_ANSWER +lazycoder1412,448,34557483,GNU C++14,2355200,VIRTUAL,12,2500.0,C,Painting Fence,"[divide and conquer, dp, greedy]",6853,1516911853,TESTS,46,WRONG_ANSWER +lazycoder1412,448,34557391,GNU C++14,1945600,VIRTUAL,3,2500.0,C,Painting Fence,"[divide and conquer, dp, greedy]",6561,1516911561,TESTS,15,WRONG_ANSWER +lazycoder1412,448,34557343,GNU C++14,1945600,VIRTUAL,3,2500.0,C,Painting Fence,"[divide and conquer, dp, greedy]",6432,1516911432,TESTS,0,WRONG_ANSWER +lazycoder1412,448,34555637,Python 2,4608000,VIRTUAL,36,1000.0,B,Suffix Structures,"[implementation, strings]",1458,1516906458,TESTS,62,OK +lazycoder1412,448,34555242,Python 2,4608000,VIRTUAL,25,500.0,A,Rewards,[implementation],291,1516905291,TESTS,62,OK +nimishagarg_ng,354,34501747,GNU C++14,3072000,PRACTICE,23,500.0,A,Vasya and Robot,"[brute force, greedy, math]",2147483647,1516761971,TESTS,31,OK +nimishagarg_ng,135,34499464,GNU C++14,2252800,PRACTICE,97,500.0,A,Replacement,"[implementation, sortings]",2147483647,1516754512,TESTS,124,OK +nimishagarg_ng,135,34499430,GNU C++14,1843200,PRACTICE,4,500.0,A,Replacement,"[implementation, sortings]",2147483647,1516754362,TESTS,0,WRONG_ANSWER +nimishagarg_ng,337,34499224,GNU C++14,1945600,PRACTICE,73,1500.0,C,Quiz,"[binary search, greedy, math, matrices, number theory]",2147483647,1516753445,TESTS,30,OK +nimishagarg_ng,337,34499108,GNU C++14,1945600,PRACTICE,15,1500.0,C,Quiz,"[binary search, greedy, math, matrices, number theory]",2147483647,1516752902,TESTS,30,WRONG_ANSWER +nimishagarg_ng,337,34499075,GNU C++14,1945600,PRACTICE,6,1500.0,C,Quiz,"[binary search, greedy, math, matrices, number theory]",2147483647,1516752769,TESTS,30,WRONG_ANSWER +nimishagarg_ng,300,34483463,GNU C++14,17920000,PRACTICE,32,2000.0,C,Beautiful Numbers,"[brute force, combinatorics]",2147483647,1516713759,TESTS,996,OK +toxic_hack,914,34460307,GNU C++14,10137600,VIRTUAL,141,1500.0,C,Travelling Salesman and Special Numbers,"[brute force, combinatorics, dp]",9459,1516654359,TESTS,109,OK +toxic_hack,914,34460239,GNU C++14,10035200,VIRTUAL,13,1500.0,C,Travelling Salesman and Special Numbers,"[brute force, combinatorics, dp]",9127,1516654027,TESTS,15,WRONG_ANSWER +toxic_hack,914,34458484,Python 2,4608000,VIRTUAL,66,500.0,A,Perfect Squares,"[implementation, math]",2735,1516647635,TESTS,62,OK +toxic_hack,914,34457857,Python 2,14540800,VIRTUAL,91,1000.0,B,Conan and Agasa play a Card Game,"[games, greedy]",824,1516645724,TESTS,171,OK +toxic_hack,914,34457638,Python 2,4608000,VIRTUAL,2,500.0,A,Perfect Squares,"[implementation, math]",193,1516645093,TESTS,62,RUNTIME_ERROR +nimishagarg_ng,424,34408765,GNU C++14,5939200,PRACTICE,50,1500.0,C,Magic Formulas,[math],2147483647,1516528878,TESTS,280,OK +nimishagarg_ng,464,34290219,GNU C++14,1945600,PRACTICE,73,500.0,A,No to Palindromes!,"[greedy, strings]",2147483647,1516331093,TESTS,15,OK +nimishagarg_ng,464,34290161,GNU C++14,1945600,PRACTICE,5,500.0,A,No to Palindromes!,"[greedy, strings]",2147483647,1516330915,TESTS,15,WRONG_ANSWER +nimishagarg_ng,343,34278438,GNU C++14,1945600,PRACTICE,53,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1516285798,TESTS,30,OK +nimishagarg_ng,343,34278284,GNU C++14,1945600,PRACTICE,53,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1516285409,TESTS,30,OK +nimishagarg_ng,235,34276735,GNU C++14,1945600,PRACTICE,87,500.0,A,LCM Challenge,[number theory],2147483647,1516281663,TESTS,30,OK +nimishagarg_ng,235,34276575,GNU C++14,1945600,PRACTICE,32,500.0,A,LCM Challenge,[number theory],2147483647,1516281310,TESTS,30,WRONG_ANSWER +nimishagarg_ng,235,34276451,GNU C++14,1945600,PRACTICE,31,500.0,A,LCM Challenge,[number theory],2147483647,1516280961,TESTS,30,WRONG_ANSWER +nimishagarg_ng,429,34276248,GNU C++14,7065600,PRACTICE,35,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1516280410,TESTS,93,OK +nimishagarg_ng,429,34264710,GNU C++14,2048000,PRACTICE,1,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1516242666,TESTS,15,WRONG_ANSWER +nimishagarg_ng,231,34257589,GNU C++14,7168000,PRACTICE,55,1500.0,C,To Add or Not to Add,"[binary search, sortings, two pointers]",2147483647,1516208009,TESTS,122,OK +nimishagarg_ng,283,34224692,GNU C++14,5120000,PRACTICE,46,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516113483,TESTS,342,OK +nimishagarg_ng,283,34224575,Python 2,10547200,PRACTICE,42,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516113139,TESTS,1029,RUNTIME_ERROR +nimishagarg_ng,283,34224391,Python 2,10547200,PRACTICE,42,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516112655,TESTS,982,RUNTIME_ERROR +nimishagarg_ng,283,34223927,GNU C++14,5120000,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516111441,TESTS,327,WRONG_ANSWER +nimishagarg_ng,283,34223656,GNU C++14,5120000,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516110858,TESTS,405,WRONG_ANSWER +nimishagarg_ng,283,34223513,GNU C++14,5120000,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516110546,TESTS,390,WRONG_ANSWER +nimishagarg_ng,283,34223383,GNU C++14,5120000,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516110209,TESTS,373,WRONG_ANSWER +nimishagarg_ng,283,34223274,GNU C++14,5120000,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516109926,TESTS,311,WRONG_ANSWER +nimishagarg_ng,283,34222843,GNU C++14,5017600,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516108872,TESTS,1500,TIME_LIMIT_EXCEEDED +nimishagarg_ng,283,34222490,GNU C++14,3481600,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516108010,TESTS,1153,WRONG_ANSWER +nimishagarg_ng,283,34222393,GNU C++14,3481600,PRACTICE,9,1000.0,A,Cows and Sequence,"[constructive algorithms, implementation]",2147483647,1516107791,TESTS,1216,WRONG_ANSWER +nimishagarg_ng,348,34197749,GNU C++14,1945600,PRACTICE,34,500.0,A,Mafia,"[binary search, math, sortings]",2147483647,1516022377,TESTS,92,OK +nimishagarg_ng,348,34197600,GNU C++14,1945600,PRACTICE,7,500.0,A,Mafia,"[binary search, math, sortings]",2147483647,1516022059,TESTS,30,WRONG_ANSWER +nimishagarg_ng,348,34197223,GNU C++14,1945600,PRACTICE,5,500.0,A,Mafia,"[binary search, math, sortings]",2147483647,1516021149,TESTS,30,WRONG_ANSWER +nimishagarg_ng,18,34195715,GNU C++14,2662400,PRACTICE,45,0.0,C,Stripe,"[data structures, implementation]",2147483647,1516017323,TESTS,62,OK +nimishagarg_ng,18,34195561,GNU C++14,1945600,PRACTICE,14,0.0,C,Stripe,"[data structures, implementation]",2147483647,1516016883,TESTS,30,WRONG_ANSWER +nimishagarg_ng,18,34195162,GNU C++14,1945600,PRACTICE,14,0.0,C,Stripe,"[data structures, implementation]",2147483647,1516015659,TESTS,30,WRONG_ANSWER +nimishagarg_ng,149,34194857,GNU C++14,2662400,PRACTICE,47,1500.0,C,Division into Teams,"[greedy, math, sortings]",2147483647,1516014625,TESTS,92,OK +nimishagarg_ng,149,34194827,GNU C++14,1843200,PRACTICE,0,1500.0,C,Division into Teams,"[greedy, math, sortings]",2147483647,1516014513,TESTS,0,WRONG_ANSWER +nimishagarg_ng,264,34193307,GNU C++14,7475200,PRACTICE,57,500.0,A,Escape from Stones,"[constructive algorithms, data structures, implementation, two pointers]",2147483647,1516009235,TESTS,171,OK +nimishagarg_ng,414,34185805,GNU C++14,1945600,PRACTICE,84,500.0,A,Mashmokh and Numbers,"[constructive algorithms, number theory]",2147483647,1515970757,TESTS,31,OK +nimishagarg_ng,427,34185521,GNU C++14,15257600,PRACTICE,137,1500.0,C,Checkposts,"[dfs and similar, graphs, two pointers]",2147483647,1515968636,TESTS,249,OK +lazycoder1412,913,34036369,GNU C++14,4300800,VIRTUAL,0,1250.0,D,Too Easy Problems,"[binary search, brute force, data structures, greedy, sortings]",8466,1515447966,TESTS,15,WRONG_ANSWER +lazycoder1412,913,34035906,GNU C++14,2048000,VIRTUAL,86,1000.0,C,Party Lemonade,"[bitmasks, dp, greedy]",5802,1515445302,TESTS,15,OK +lazycoder1412,913,34035810,GNU C++14,2048000,VIRTUAL,3,1000.0,C,Party Lemonade,"[bitmasks, dp, greedy]",5401,1515444901,TESTS,15,WRONG_ANSWER +lazycoder1412,913,34035748,GNU C++14,2048000,VIRTUAL,3,1000.0,C,Party Lemonade,"[bitmasks, dp, greedy]",5165,1515444665,TESTS,15,WRONG_ANSWER +lazycoder1412,913,34034471,GNU C++14,2048000,VIRTUAL,31,750.0,B,Christmas Spruce,"[implementation, trees]",964,1515440464,TESTS,15,OK +lazycoder1412,913,34034265,Python 2,4608000,VIRTUAL,49,500.0,A,Modular Exponentiation,"[implementation, math]",463,1515439963,TESTS,62,OK +nimishagarg_ng,912,33941552,GNU C++14,1945600,CONTESTANT,58,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",5048,1515167948,TESTS,15,OK +nimishagarg_ng,912,33940636,GNU C++14,1843200,CONTESTANT,8,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",4565,1515167465,PRETESTS,15,SKIPPED +nimishagarg_ng,912,33928500,GNU C++14,1945600,CONTESTANT,8,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",758,1515163658,CHALLENGES,15,CHALLENGED +nimishagarg_ng,912,33924664,GNU C++14,1945600,CONTESTANT,38,500.0,A,Tricky Alchemy,[implementation],284,1515163184,TESTS,15,OK +nimishagarg_ng,908,33808538,GNU C++14,1945600,VIRTUAL,15,1000.0,C,New Year and Curling,"[brute force, geometry, implementation, math]",5505,1514635665,TESTS,15,OK +nimishagarg_ng,908,33807664,GNU C++14,2048000,VIRTUAL,46,750.0,B,New Year and Buggy Bot,"[brute force, implementation]",2777,1514632937,TESTS,15,OK +nimishagarg_ng,908,33807613,GNU C++14,0,VIRTUAL,0,750.0,B,New Year and Buggy Bot,"[brute force, implementation]",2639,1514632799,TESTS,0,COMPILATION_ERROR +nimishagarg_ng,908,33806866,GNU C++14,1945600,VIRTUAL,38,500.0,A,New Year and Counting Cards,[implementation],295,1514630455,TESTS,15,OK +nimishagarg_ng,911,33733284,GNU C++14,1945600,CONTESTANT,67,0.0,C,Three Garlands,"[brute force, constructive algorithms]",4902,1514474802,TESTS,15,OK +nimishagarg_ng,911,33724084,GNU C++14,1843200,CONTESTANT,5,0.0,C,Three Garlands,"[brute force, constructive algorithms]",2016,1514471916,TESTS,15,WRONG_ANSWER +nimishagarg_ng,911,33719032,GNU C++14,1945600,CONTESTANT,135,0.0,B,Two Cakes,"[binary search, brute force, implementation]",1003,1514470903,TESTS,15,OK +nimishagarg_ng,911,33715803,GNU C++14,8499200,CONTESTANT,140,0.0,A,Nearest Minimums,[implementation],463,1514470363,TESTS,124,OK +nimishagarg_ng,909,33691685,GNU C++14,1843200,CONTESTANT,2,1500.0,C,Python Indentation,[dp],6500,1514399000,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,909,33684090,GNU C++14,1945600,CONTESTANT,102,1000.0,B,Segments,"[constructive algorithms, math]",3066,1514395566,TESTS,15,OK +nimishagarg_ng,909,33674615,GNU C++14,1945600,CONTESTANT,64,500.0,A,Generate Login,"[brute force, greedy, sortings]",269,1514392769,TESTS,15,OK +nimishagarg_ng,907,33570092,GNU C++14,1945600,CONTESTANT,20,1000.0,B,Tic-Tac-Toe,[implementation],7041,1514044941,TESTS,15,OK +nimishagarg_ng,907,33568297,GNU C++14,1945600,CONTESTANT,3,1000.0,B,Tic-Tac-Toe,[implementation],6620,1514044520,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,907,33561630,GNU C++14,1945600,CONTESTANT,32,500.0,A,Masha and Bears,"[brute force, implementation]",4644,1514042544,TESTS,15,OK +nimishagarg_ng,907,33549812,GNU C++14,1945600,CONTESTANT,6,500.0,A,Masha and Bears,"[brute force, implementation]",1839,1514039739,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,907,33546677,GNU C++14,1945600,CONTESTANT,3,500.0,A,Masha and Bears,"[brute force, implementation]",1331,1514039231,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,902,33425984,GNU C++14,2252800,CONTESTANT,45,1500.0,C,Hashing Trees,[],3146,1513700846,TESTS,93,OK +nimishagarg_ng,902,33421431,GNU C++14,2560000,CONTESTANT,50,1000.0,B,Coloring a Tree,"[dfs and similar, dsu]",1850,1513699550,TESTS,15,OK +nimishagarg_ng,902,33414364,GNU C++14,1945600,CONTESTANT,55,500.0,A,Visiting a Friend,[implementation],544,1513698244,TESTS,30,OK +nimishagarg_ng,385,33391755,GNU C++14,206233600,PRACTICE,27,1500.0,C,Bear and Prime Numbers,"[binary search, brute force, data structures, dp, implementation, math, number theory]",2147483647,1513628606,TESTS,919,OK +nimishagarg_ng,371,33390497,GNU C++14,1945600,PRACTICE,31,1500.0,C,Hamburgers,"[binary search, brute force]",2147483647,1513624650,TESTS,15,OK +nimishagarg_ng,217,33385868,GNU C++14,1945600,PRACTICE,76,500.0,A,Ice Skating,"[brute force, dfs and similar, dsu, graphs]",2147483647,1513614871,TESTS,30,OK +nimishagarg_ng,350,33384612,GNU C++14,2662400,PRACTICE,35,1000.0,C,Bombs,"[greedy, implementation, sortings]",2147483647,1513612173,TESTS,934,OK +nimishagarg_ng,898,33307952,GNU C++14,6144000,CONTESTANT,51,2000.0,E,Squares and not squares,[greedy],6383,1513430483,TESTS,93,OK +nimishagarg_ng,898,33306330,GNU C++14,3481600,CONTESTANT,8,2000.0,E,Squares and not squares,[greedy],5745,1513429845,PRETESTS,62,WRONG_ANSWER +nimishagarg_ng,898,33303505,GNU C++14,5836800,CONTESTANT,7,1750.0,D,Alarm Clock,[greedy],4589,1513428689,PRETESTS,46,WRONG_ANSWER +nimishagarg_ng,898,33302259,GNU C++14,5939200,CONTESTANT,7,1750.0,D,Alarm Clock,[greedy],4107,1513428207,PRETESTS,62,WRONG_ANSWER +nimishagarg_ng,898,33298717,GNU C++14,2150400,CONTESTANT,59,1500.0,C,Phone Numbers,"[implementation, strings]",2760,1513426860,TESTS,15,OK +nimishagarg_ng,898,33298473,GNU C++14,1843200,CONTESTANT,0,1500.0,C,Phone Numbers,"[implementation, strings]",2674,1513426774,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,898,33291512,GNU C++14,1945600,CONTESTANT,100,750.0,B,Proper Nutrition,"[brute force, implementation, number theory]",591,1513424691,TESTS,31,OK +nimishagarg_ng,898,33288902,GNU C++14,1945600,CONTESTANT,64,500.0,A,Rounding,[implementation],228,1513424328,TESTS,15,OK +nimishagarg_ng,350,33244837,GNU C++14,2662400,PRACTICE,4,1000.0,C,Bombs,"[greedy, implementation, sortings]",2147483647,1513266729,TESTS,966,WRONG_ANSWER +nimishagarg_ng,350,33244748,GNU C++14,2662400,PRACTICE,4,1000.0,C,Bombs,"[greedy, implementation, sortings]",2147483647,1513266538,TESTS,904,WRONG_ANSWER +nimishagarg_ng,339,33243653,GNU C++14,1945600,PRACTICE,40,1500.0,C,Xenia and Weights,"[constructive algorithms, dfs and similar, dp, greedy]",2147483647,1513264164,TESTS,15,OK +nimishagarg_ng,339,33241845,GNU C++14,268390400,PRACTICE,3,1500.0,C,Xenia and Weights,"[constructive algorithms, dfs and similar, dp, greedy]",2147483647,1513260181,TESTS,264,MEMORY_LIMIT_EXCEEDED +nimishagarg_ng,388,33212714,GNU C++14,1945600,PRACTICE,36,500.0,A,Fox and Box Accumulation,"[greedy, sortings]",2147483647,1513167666,TESTS,15,OK +nimishagarg_ng,388,33212000,GNU C++14,1945600,PRACTICE,20,500.0,A,Fox and Box Accumulation,"[greedy, sortings]",2147483647,1513166233,TESTS,15,WRONG_ANSWER +nimishagarg_ng,903,33188040,GNU C++14,18124800,CONTESTANT,28,0.0,D,Almost Difference,[math],6906,1513098006,CHALLENGES,296,CHALLENGED +nimishagarg_ng,903,33187067,GNU C++14,8499200,CONTESTANT,9,0.0,D,Almost Difference,[math],6611,1513097711,TESTS,2000,TIME_LIMIT_EXCEEDED +nimishagarg_ng,903,33185924,GNU C++14,8396800,CONTESTANT,9,0.0,D,Almost Difference,[math],6233,1513097333,TESTS,2000,TIME_LIMIT_EXCEEDED +nimishagarg_ng,903,33185183,GNU C++14,8499200,CONTESTANT,9,0.0,D,Almost Difference,[math],6001,1513097101,TESTS,2000,TIME_LIMIT_EXCEEDED +nimishagarg_ng,903,33170939,GNU C++14,1945600,CONTESTANT,24,0.0,C,Boxes Packing,[greedy],2112,1513093212,TESTS,31,OK +nimishagarg_ng,903,33165723,GNU C++14,2048000,CONTESTANT,17,0.0,B,The Modcrab,[greedy],1191,1513092291,TESTS,15,OK +nimishagarg_ng,903,33160976,GNU C++14,1945600,CONTESTANT,8,0.0,A,Hungry Student Problem,[greedy],435,1513091535,TESTS,15,OK +nimishagarg_ng,900,33133252,GNU C++14,2048000,CONTESTANT,33,1000.0,B,Position in Fraction,[math],6449,1513014749,TESTS,15,OK +nimishagarg_ng,900,33130162,GNU C++14,6553600,CONTESTANT,51,1500.0,C,Remove Extra One,"[brute force, data structures]",5267,1513013567,TESTS,62,OK +nimishagarg_ng,900,33123149,GNU C++14,1843200,CONTESTANT,2,1500.0,C,Remove Extra One,"[brute force, data structures]",2867,1513011167,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,900,33120811,GNU C++14,1843200,CONTESTANT,2,1500.0,C,Remove Extra One,"[brute force, data structures]",2244,1513010544,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,900,33112076,GNU C++14,1945600,CONTESTANT,71,500.0,A,Find Extra One,[implementation],254,1513008554,TESTS,77,OK +nimishagarg_ng,463,33104109,GNU C++14,33996800,PRACTICE,23,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1513002427,TESTS,1279,OK +nimishagarg_ng,463,33103984,GNU C++14,17920000,PRACTICE,8,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1513002008,TESTS,780,WRONG_ANSWER +nimishagarg_ng,463,33103937,GNU C++14,17920000,PRACTICE,7,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1513001842,TESTS,779,WRONG_ANSWER +nimishagarg_ng,463,33103780,GNU C++14,1945600,PRACTICE,3,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1513001335,TESTS,15,WRONG_ANSWER +nimishagarg_ng,463,33103643,GNU C++14,1843200,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1513000829,TESTS,0,WRONG_ANSWER +nimishagarg_ng,801,33068127,GNU C++14,1843200,PRACTICE,7,1500.0,C,Voltage Keepsake,"[binary search, math]",2147483647,1512849462,TESTS,15,WRONG_ANSWER +nimishagarg_ng,801,33068087,GNU C++14,1843200,PRACTICE,4,1500.0,C,Voltage Keepsake,"[binary search, math]",2147483647,1512849338,TESTS,15,WRONG_ANSWER +nimishagarg_ng,801,33068020,GNU C++14,1843200,PRACTICE,3,1500.0,C,Voltage Keepsake,"[binary search, math]",2147483647,1512849129,TESTS,0,WRONG_ANSWER +nimishagarg_ng,801,33057557,GNU C++14,1945600,VIRTUAL,35,1000.0,B,Valued Keys,"[constructive algorithms, greedy, strings]",2216,1512841076,TESTS,15,OK +nimishagarg_ng,801,33057284,GNU C++14,1945600,VIRTUAL,1,1000.0,B,Valued Keys,"[constructive algorithms, greedy, strings]",1465,1512840325,TESTS,0,WRONG_ANSWER +nimishagarg_ng,801,33056946,GNU C++14,1843200,VIRTUAL,63,500.0,A,Vicious Keyboard,[brute force],571,1512839431,TESTS,30,OK +nimishagarg_ng,895,32692158,GNU C++14,1843200,CONTESTANT,0,1000.0,B,XK Segments,"[binary search, sortings, two pointers]",7178,1511719478,PRETESTS,0,WRONG_ANSWER +nimishagarg_ng,895,32689413,GNU C++14,1945600,CONTESTANT,93,500.0,A,Pizza Separation,[brute force],5842,1511718142,TESTS,15,OK +nimishagarg_ng,895,32686227,GNU C++14,1843200,CONTESTANT,7,500.0,A,Pizza Separation,[brute force],4103,1511716403,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,895,32685458,GNU C++14,1843200,CONTESTANT,7,500.0,A,Pizza Separation,[brute force],3707,1511716007,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,895,32683571,GNU C++14,1945600,CONTESTANT,7,500.0,A,Pizza Separation,[brute force],3353,1511715653,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,895,32680959,GNU C++14,1945600,CONTESTANT,7,500.0,A,Pizza Separation,[brute force],2126,1511714426,PRETESTS,15,WRONG_ANSWER +nimishagarg_ng,895,32679028,GNU C++14,1843200,CONTESTANT,0,500.0,A,Pizza Separation,[brute force],1435,1511713735,PRETESTS,0,RUNTIME_ERROR +nimishagarg_ng,894,32568943,GNU C++14,8089600,VIRTUAL,56,1500.0,C,Marco and GCD Sequence,"[constructive algorithms, math]",7109,1511423429,TESTS,15,OK +nimishagarg_ng,894,32568796,GNU C++14,7987200,VIRTUAL,14,1500.0,C,Marco and GCD Sequence,"[constructive algorithms, math]",6647,1511422967,TESTS,15,WRONG_ANSWER +nimishagarg_ng,894,32567340,GNU C++14,0,VIRTUAL,43,500.0,A,QAQ,"[brute force, dp]",908,1511417228,TESTS,15,OK +nimishagarg_ng,888,32183018,GNU C++14,0,PRACTICE,25,0.0,D,Almost Identity Permutations,"[combinatorics, dp, math]",2147483647,1510269593,TESTS,15,OK +nimishagarg_ng,888,32182222,GNU C++14,307200,VIRTUAL,51,0.0,C,K-Dominant Character,"[binary search, implementation, two pointers]",6066,1510264686,TESTS,30,OK +nimishagarg_ng,888,32181672,GNU C++14,307200,VIRTUAL,18,0.0,C,K-Dominant Character,"[binary search, implementation, two pointers]",3232,1510261852,TESTS,31,WRONG_ANSWER +nimishagarg_ng,888,32181036,GNU C++14,0,VIRTUAL,25,0.0,B,Buggy Robot,"[dp, greedy]",652,1510259272,TESTS,15,OK +nimishagarg_ng,888,32180908,GNU C++14,0,VIRTUAL,14,0.0,A,Local Extrema,"[brute force, implementation]",225,1510258845,TESTS,15,OK +nimishagarg_ng,887,32025298,GNU C++14,0,CONTESTANT,48,1500.0,C,Solution for Cube,"[brute force, implementation]",3646,1509728746,TESTS,15,OK +nimishagarg_ng,887,32021587,GNU C++14,204800,CONTESTANT,96,1000.0,B,Cubes for Masha,[brute force],2158,1509727258,TESTS,15,OK +nimishagarg_ng,887,32015171,GNU C++14,0,CONTESTANT,98,500.0,A,Div. 64,[implementation],451,1509725551,TESTS,15,OK +toxic_hack,757,31986284,GNU C++14,819200,VIRTUAL,134,1000.0,B,Bash's Big Day,"[greedy, math, number theory]",1071,1509640371,TESTS,46,OK +toxic_hack,757,31986101,GNU C++14,819200,VIRTUAL,11,1000.0,B,Bash's Big Day,"[greedy, math, number theory]",696,1509639996,TESTS,31,WRONG_ANSWER +toxic_hack,757,31986038,GNU C++14,307200,VIRTUAL,107,500.0,A,Gotta Catch Em' All!,[implementation],551,1509639851,TESTS,15,OK +toxic_hack,673,31961009,GNU C++14,0,VIRTUAL,48,1500.0,D,Bear and Two Paths,[],8526,1509563646,TESTS,15,OK +toxic_hack,673,31959460,GNU C++14,102400,VIRTUAL,35,1000.0,C,Bear and Colors,[],4257,1509559378,TESTS,156,OK +toxic_hack,673,31959148,GNU C++14,1843200,VIRTUAL,51,750.0,B,Problems for Round,"[greedy, implementation]",3429,1509558549,TESTS,77,OK +toxic_hack,673,31959145,Python 2,204800,VIRTUAL,5,1000.0,C,Bear and Colors,[],3423,1509558543,TESTS,2000,TIME_LIMIT_EXCEEDED +toxic_hack,673,31958818,GNU C++14,1843200,VIRTUAL,45,750.0,B,Problems for Round,"[greedy, implementation]",2589,1509557709,TESTS,77,WRONG_ANSWER +toxic_hack,673,31958620,Python 2,0,VIRTUAL,2,1000.0,C,Bear and Colors,[],2121,1509557241,TESTS,46,WRONG_ANSWER +toxic_hack,673,31958403,GNU C++14,1843200,VIRTUAL,45,750.0,B,Problems for Round,"[greedy, implementation]",1580,1509556700,TESTS,78,WRONG_ANSWER +toxic_hack,673,31958029,GNU C++11,0,VIRTUAL,34,500.0,A,Bear and Game,[implementation],671,1509555791,TESTS,15,OK +toxic_hack,868,31902107,GNU C++14,2764800,VIRTUAL,143,1000.0,C,Qualification Rounds,"[bitmasks, brute force, constructive algorithms, dp]",9278,1509386679,TESTS,78,OK +toxic_hack,868,31901269,Python 2,0,VIRTUAL,133,500.0,B,Race Against Time,[implementation],7263,1509384663,TESTS,62,OK +toxic_hack,868,31900496,Python 2,0,VIRTUAL,4,500.0,B,Race Against Time,[implementation],5450,1509382850,TESTS,46,WRONG_ANSWER +toxic_hack,868,31900329,Python 2,0,VIRTUAL,4,500.0,B,Race Against Time,[implementation],5075,1509382475,TESTS,46,WRONG_ANSWER +toxic_hack,868,31899829,GNU C++14,0,VIRTUAL,4,500.0,B,Race Against Time,[implementation],3952,1509381352,TESTS,15,WRONG_ANSWER +toxic_hack,868,31899813,Python 2,0,VIRTUAL,4,500.0,B,Race Against Time,[implementation],3905,1509381305,TESTS,46,WRONG_ANSWER +toxic_hack,868,31898359,GNU C++14,0,VIRTUAL,90,250.0,A,Bark to Unlock,"[brute force, strings]",499,1509377899,TESTS,15,OK +nimishagarg_ng,884,31808534,GNU C++14,0,CONTESTANT,16,0.0,A,Book Reading,[implementation],5176,1509118276,TESTS,15,OK +nimishagarg_ng,884,31808091,GNU C++14,11776000,CONTESTANT,27,0.0,C,Bertown Subway,"[dfs and similar, greedy, math]",4832,1509117932,TESTS,61,OK +nimishagarg_ng,884,31807539,GNU C++14,102400,CONTESTANT,5,0.0,C,Bertown Subway,"[dfs and similar, greedy, math]",4432,1509117532,TESTS,0,WRONG_ANSWER +nimishagarg_ng,884,31801379,GNU C++14,819200,CONTESTANT,66,0.0,B,Japanese Crosswords Strike Back,[implementation],975,1509114075,TESTS,46,OK +nimishagarg_ng,579,31773743,GNU C++14,0,VIRTUAL,31,1250.0,C,A Problem about Polyline,"[binary search, math]",6675,1509054375,TESTS,15,OK +nimishagarg_ng,579,31773685,GNU C++14,0,VIRTUAL,3,1250.0,C,A Problem about Polyline,"[binary search, math]",6430,1509054131,TESTS,15,WRONG_ANSWER +nimishagarg_ng,579,31772751,GNU C++14,0,VIRTUAL,3,1250.0,C,A Problem about Polyline,"[binary search, math]",3270,1509050971,TESTS,15,WRONG_ANSWER +nimishagarg_ng,579,31772207,GNU C++14,3891200,VIRTUAL,15,500.0,B,Finding Team Member,"[brute force, implementation, sortings]",1565,1509049265,TESTS,140,OK +nimishagarg_ng,579,31771869,GNU C++14,0,VIRTUAL,36,250.0,A,Raising Bacteria,[bitmasks],659,1509048359,TESTS,15,OK +nimishagarg_ng,879,31767979,GNU C++14,26009600,PRACTICE,30,1500.0,C,Short Program,"[bitmasks, constructive algorithms, graph matchings]",2147483647,1509040377,TESTS,140,OK +nimishagarg_ng,161,31061150,GNU C++14,424345600,PRACTICE,30,2000.0,D,Distance in Tree,"[dfs and similar, dp, trees]",2147483647,1507281588,TESTS,1152,OK +nimishagarg_ng,859,30972766,GNU C++14,0,PRACTICE,70,1000.0,C,Pie Rules,"[dp, games]",2147483647,1507047357,TESTS,15,OK +nimishagarg_ng,486,30758594,GNU C++14,307200,PRACTICE,40,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1506446870,TESTS,15,OK +nimishagarg_ng,441,30744794,GNU C++14,102400,PRACTICE,44,1500.0,C,Valera and Tubes ,"[constructive algorithms, dfs and similar, implementation]",2147483647,1506415585,TESTS,31,OK +nimishagarg_ng,478,30734203,GNU C++14,0,PRACTICE,42,1500.0,C,Table Decorations,[greedy],2147483647,1506359153,TESTS,15,OK +nimishagarg_ng,478,30734133,GNU C++14,0,PRACTICE,6,1500.0,C,Table Decorations,[greedy],2147483647,1506359051,TESTS,15,WRONG_ANSWER +nimishagarg_ng,845,29663716,GNU C++14,1638400,PRACTICE,58,0.0,C,Two TVs,"[data structures, greedy, sortings]",2147483647,1503335612,TESTS,140,OK +nimishagarg_ng,114,29533920,GNU C++14,0,PRACTICE,61,1000.0,B,PFAST Inc.,"[bitmasks, brute force]",2147483647,1502999148,TESTS,62,OK +nimishagarg_ng,114,29533588,GNU C++14,0,PRACTICE,5,1000.0,B,PFAST Inc.,"[bitmasks, brute force]",2147483647,1502997829,TESTS,30,WRONG_ANSWER +nimishagarg_ng,56,29444448,GNU C++14,1945600,PRACTICE,33,1000.0,B,Spoilt Permutation,[implementation],2147483647,1502663291,TESTS,60,OK +nimishagarg_ng,279,28402282,GNU C++14,3379200,PRACTICE,35,1500.0,C,Ladder,"[dp, implementation, two pointers]",2147483647,1499674988,TESTS,186,OK +nimishagarg_ng,137,28401329,GNU C++14,2764800,PRACTICE,75,1500.0,C,History,[sortings],2147483647,1499672379,TESTS,156,OK +nimishagarg_ng,279,28401264,GNU C++14,3379200,PRACTICE,20,1500.0,C,Ladder,"[dp, implementation, two pointers]",2147483647,1499672178,TESTS,156,WRONG_ANSWER +nimishagarg_ng,279,28401145,GNU C++14,1945600,PRACTICE,5,1500.0,C,Ladder,"[dp, implementation, two pointers]",2147483647,1499671834,TESTS,30,WRONG_ANSWER +nimishagarg_ng,363,28390178,GNU C++14,2662400,PRACTICE,62,1500.0,C,Fixing Typos,"[greedy, implementation]",2147483647,1499614725,TESTS,46,OK +nimishagarg_ng,382,28373839,GNU C++14,2355200,PRACTICE,59,1500.0,C,Arithmetic Progression,"[implementation, sortings]",2147483647,1499533814,TESTS,46,OK +nimishagarg_ng,382,28373742,GNU C++14,2355200,PRACTICE,56,1500.0,C,Arithmetic Progression,"[implementation, sortings]",2147483647,1499533423,TESTS,46,WRONG_ANSWER +nimishagarg_ng,382,28373654,GNU C++14,2355200,PRACTICE,52,1500.0,C,Arithmetic Progression,"[implementation, sortings]",2147483647,1499533110,TESTS,46,WRONG_ANSWER +nimishagarg_ng,459,28344031,GNU C++14,5939200,PRACTICE,41,2000.0,C,Pashmak and Buses,"[combinatorics, constructive algorithms, math]",2147483647,1499413047,TESTS,155,OK +nimishagarg_ng,220,28333731,GNU C++14,2764800,PRACTICE,96,500.0,A,Little Elephant and Problem,"[implementation, sortings]",2147483647,1499363622,TESTS,46,OK +nimishagarg_ng,220,28333407,GNU C++14,2867200,PRACTICE,35,500.0,A,Little Elephant and Problem,"[implementation, sortings]",2147483647,1499362615,TESTS,31,WRONG_ANSWER +nimishagarg_ng,220,28332789,GNU C++14,2867200,PRACTICE,35,500.0,A,Little Elephant and Problem,"[implementation, sortings]",2147483647,1499360798,TESTS,31,WRONG_ANSWER +nimishagarg_ng,220,28332007,GNU C++14,2867200,PRACTICE,33,500.0,A,Little Elephant and Problem,"[implementation, sortings]",2147483647,1499358873,TESTS,46,WRONG_ANSWER +nimishagarg_ng,220,28331675,GNU C++14,1945600,PRACTICE,7,500.0,A,Little Elephant and Problem,"[implementation, sortings]",2147483647,1499357897,TESTS,15,WRONG_ANSWER +nimishagarg_ng,225,28327317,GNU C++14,2048000,PRACTICE,36,1500.0,C,Barcode,"[dp, matrices]",2147483647,1499345470,TESTS,60,OK +nimishagarg_ng,225,28326129,GNU C++14,1945600,PRACTICE,3,1500.0,C,Barcode,"[dp, matrices]",2147483647,1499342658,TESTS,30,WRONG_ANSWER +nimishagarg_ng,225,28325847,GNU C++14,1945600,PRACTICE,2,1500.0,C,Barcode,"[dp, matrices]",2147483647,1499342004,TESTS,0,WRONG_ANSWER +nimishagarg_ng,254,28307994,GNU C++14,2252800,PRACTICE,36,1000.0,B,Jury Size,"[brute force, implementation]",2147483647,1499270887,TESTS,30,OK +nimishagarg_ng,254,28307969,GNU C++14,1945600,PRACTICE,0,1000.0,B,Jury Size,"[brute force, implementation]",2147483647,1499270784,TESTS,0,WRONG_ANSWER +nimishagarg_ng,254,28307942,GNU C++14,0,PRACTICE,0,1000.0,B,Jury Size,"[brute force, implementation]",2147483647,1499270643,TESTS,0,COMPILATION_ERROR +nimishagarg_ng,254,28307872,GNU C++14,1945600,PRACTICE,0,1000.0,B,Jury Size,"[brute force, implementation]",2147483647,1499270363,TESTS,0,WRONG_ANSWER +nimishagarg_ng,99,28282694,GNU C++14,2355200,PRACTICE,200,1000.0,B,Help Chef Gerasim,"[implementation, sortings]",2147483647,1499177892,TESTS,15,OK +nimishagarg_ng,99,28281798,GNU C++14,1945600,PRACTICE,17,1000.0,B,Help Chef Gerasim,"[implementation, sortings]",2147483647,1499175429,TESTS,15,WRONG_ANSWER +nimishagarg_ng,99,28281775,GNU C++14,0,PRACTICE,0,1000.0,B,Help Chef Gerasim,"[implementation, sortings]",2147483647,1499175369,TESTS,0,COMPILATION_ERROR +nimishagarg_ng,99,28281611,GNU C++14,1945600,PRACTICE,8,1000.0,B,Help Chef Gerasim,"[implementation, sortings]",2147483647,1499174980,TESTS,15,WRONG_ANSWER +nimishagarg_ng,83,28280574,GNU C++14,2355200,PRACTICE,50,500.0,A,Magical Array,[math],2147483647,1499172136,TESTS,434,OK +nimishagarg_ng,83,28280389,GNU C++14,2355200,PRACTICE,31,500.0,A,Magical Array,[math],2147483647,1499171655,TESTS,374,WRONG_ANSWER +nimishagarg_ng,83,28280245,GNU C++14,2355200,PRACTICE,31,500.0,A,Magical Array,[math],2147483647,1499171340,TESTS,372,WRONG_ANSWER +nimishagarg_ng,83,28280137,GNU C++14,1945600,PRACTICE,4,500.0,A,Magical Array,[math],2147483647,1499171070,TESTS,30,WRONG_ANSWER +nimishagarg_ng,225,28278750,GNU C++14,1945600,PRACTICE,70,1000.0,B,Well-known Numbers,"[binary search, greedy, number theory]",2147483647,1499167563,TESTS,30,OK +nimishagarg_ng,197,28276837,GNU C++14,1945600,PRACTICE,80,500.0,B,Limit,[math],2147483647,1499161402,TESTS,30,OK +nimishagarg_ng,320,28260779,GNU C++14,1945600,PRACTICE,24,1000.0,B,Ping-Pong (Easy Version),"[dfs and similar, graphs]",2147483647,1499100031,TESTS,30,OK +nimishagarg_ng,197,28258778,GNU C++14,1945600,PRACTICE,80,500.0,B,Limit,[math],2147483647,1499093780,TESTS,30,OK +nimishagarg_ng,268,28258093,GNU C++14,1945600,PRACTICE,47,1500.0,C,Beautiful Sets of Points,"[constructive algorithms, implementation]",2147483647,1499092022,TESTS,30,OK +nimishagarg_ng,9,28249752,GNU C++14,1945600,PRACTICE,36,0.0,C,Hexadecimal's Numbers,"[brute force, implementation, math]",2147483647,1499071720,TESTS,30,OK +nimishagarg_ng,490,28237183,GNU C++14,15462400,PRACTICE,71,1500.0,C,Hacking Cypher,"[brute force, math, strings]",2147483647,1499028858,TESTS,78,OK +nimishagarg_ng,490,28236719,GNU C++14,1945600,PRACTICE,6,1500.0,C,Hacking Cypher,"[brute force, math, strings]",2147483647,1499027309,TESTS,31,WRONG_ANSWER +nimishagarg_ng,152,28235767,GNU C++14,1945600,PRACTICE,60,1500.0,C,Pocket Book,[combinatorics],2147483647,1499024679,TESTS,62,OK +nimishagarg_ng,109,28205580,GNU C++14,1945600,PRACTICE,51,500.0,A,Lucky Sum of Digits,"[brute force, implementation]",2147483647,1498981415,TESTS,62,OK +nimishagarg_ng,109,28195202,GNU C++14,1945600,PRACTICE,2,500.0,A,Lucky Sum of Digits,"[brute force, implementation]",2147483647,1498926841,TESTS,30,WRONG_ANSWER +nimishagarg_ng,550,28194525,GNU C++14,2048000,PRACTICE,73,1000.0,C,Divisibility by Eight,"[brute force, dp, math]",2147483647,1498924205,TESTS,15,OK +nimishagarg_ng,14,28171037,GNU C++14,1945600,PRACTICE,52,0.0,B,Young Photographer,[implementation],2147483647,1498823942,TESTS,30,OK +nimishagarg_ng,14,28168700,GNU C++14,1945600,PRACTICE,3,0.0,B,Young Photographer,[implementation],2147483647,1498814997,TESTS,30,WRONG_ANSWER +nimishagarg_ng,61,28168387,GNU C++14,2150400,PRACTICE,43,1000.0,B,Hard Work,[strings],2147483647,1498813909,TESTS,46,OK +nimishagarg_ng,186,28075837,GNU C++14,1945600,PRACTICE,36,1000.0,B,Growing Mushrooms,"[greedy, sortings]",2147483647,1498564836,TESTS,62,OK +nimishagarg_ng,152,28073768,GNU C++14,1945600,PRACTICE,34,1000.0,B,Steps,"[binary search, implementation]",2147483647,1498556832,TESTS,92,OK +nimishagarg_ng,400,28070961,GNU C++14,4198400,PRACTICE,34,1000.0,B,Inna and New Matrix of Candies,"[brute force, implementation, schedules]",2147483647,1498548973,TESTS,171,OK +nimishagarg_ng,215,28055204,GNU C++14,1945600,PRACTICE,31,500.0,B,Olympic Medal,"[greedy, math]",2147483647,1498472600,TESTS,60,OK +nimishagarg_ng,469,28023523,GNU C++14,1945600,PRACTICE,31,1000.0,B,Chat Online,[implementation],2147483647,1498400471,TESTS,15,OK +nimishagarg_ng,621,28020974,GNU C++14,1945600,PRACTICE,68,1000.0,B,Wet Shark and Bishops,[combinatorics],2147483647,1498389297,TESTS,93,OK +nimishagarg_ng,621,28020918,GNU C++14,1945600,PRACTICE,68,1000.0,B,Wet Shark and Bishops,[combinatorics],2147483647,1498389103,TESTS,93,OK +nimishagarg_ng,581,28018545,GNU C++14,2764800,PRACTICE,53,1000.0,B,Luxurious Houses,[implementation],2147483647,1498380174,TESTS,46,OK +nimishagarg_ng,78,27989090,GNU C++14,1945600,PRACTICE,34,1000.0,B,Easter Eggs,"[constructive algorithms, implementation]",2147483647,1498235789,TESTS,30,OK +nimishagarg_ng,227,27982309,GNU C++14,2355200,PRACTICE,34,1000.0,B,Effective Approach,[implementation],2147483647,1498212898,TESTS,124,OK +nimishagarg_ng,47,27966259,GNU C++14,1945600,PRACTICE,50,1000.0,B,Coins,[implementation],2147483647,1498137827,TESTS,30,OK +nimishagarg_ng,102,27963135,GNU C++14,2252800,PRACTICE,51,1000.0,B,Sum of Digits,[implementation],2147483647,1498129180,TESTS,30,OK +nimishagarg_ng,102,27963121,GNU C++14,2150400,PRACTICE,9,1000.0,B,Sum of Digits,[implementation],2147483647,1498129112,TESTS,30,WRONG_ANSWER +nimishagarg_ng,463,27961075,GNU C++14,2355200,PRACTICE,49,1000.0,B,Caisa and Pylons,[math],2147483647,1498122125,TESTS,31,OK +nimishagarg_ng,16,27960264,GNU C++14,1945600,PRACTICE,49,0.0,B,Burglar and Matches,"[greedy, implementation, sortings]",2147483647,1498119595,TESTS,30,OK +nimishagarg_ng,680,27959536,GNU C++14,1945600,PRACTICE,24,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",2147483647,1498117097,TESTS,15,OK +nimishagarg_ng,476,27956522,GNU C++14,1945600,PRACTICE,31,1500.0,B,Dreamoon and WiFi,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",2147483647,1498103607,TESTS,31,OK +nimishagarg_ng,50,27955792,GNU C++14,1945600,PRACTICE,35,500.0,A,Domino piling,"[greedy, math]",2147483647,1498099755,TESTS,62,OK +nimishagarg_ng,50,27955772,GNU C++14,1945600,PRACTICE,2,500.0,A,Domino piling,"[greedy, math]",2147483647,1498099600,TESTS,62,WRONG_ANSWER +nimishagarg_ng,38,27949260,GNU C++14,1945600,PRACTICE,50,0.0,A,Army,[implementation],2147483647,1498060579,TESTS,30,OK +nimishagarg_ng,284,27949039,GNU C++14,2457600,PRACTICE,66,1000.0,B,Cows and Poker Game,"[brute force, implementation]",2147483647,1498059654,TESTS,92,OK +nimishagarg_ng,90,27948864,GNU C++14,2048000,PRACTICE,43,1000.0,B,African Crossword,"[implementation, strings]",2147483647,1498058935,TESTS,30,OK +nimishagarg_ng,312,27904572,GNU C++14,0,PRACTICE,31,1000.0,B,Archer,"[math, probabilities]",2147483647,1497875435,TESTS,15,OK +nimishagarg_ng,408,27879734,GNU C++14,0,PRACTICE,21,1000.0,B,Garland,[implementation],2147483647,1497773409,TESTS,15,OK +nimishagarg_ng,357,27879483,GNU C++14,409600,PRACTICE,63,1000.0,B,Flag Day,"[constructive algorithms, implementation]",2147483647,1497772514,TESTS,46,OK +nimishagarg_ng,416,27875840,GNU C++14,1228800,PRACTICE,26,1000.0,B,Art Union,"[brute force, dp, implementation]",2147483647,1497757664,TESTS,187,OK +nimishagarg_ng,251,27863781,GNU C++14,819200,PRACTICE,39,500.0,A,Points on Line,"[binary search, combinatorics, two pointers]",2147483647,1497716622,TESTS,404,OK +nimishagarg_ng,110,27860095,GNU C++14,307200,PRACTICE,32,1000.0,B,Lucky String,"[constructive algorithms, strings]",2147483647,1497714731,TESTS,30,OK +nimishagarg_ng,66,27857687,GNU C++14,0,PRACTICE,80,1000.0,B,Petya and Countryside,"[brute force, implementation]",2147483647,1497713639,TESTS,30,OK +nimishagarg_ng,366,27841731,GNU C++14,409600,PRACTICE,36,1000.0,B,Dima and To-do List,"[brute force, implementation]",2147483647,1497689191,TESTS,46,OK +nimishagarg_ng,366,27841697,GNU C++14,409600,PRACTICE,36,1000.0,B,Dima and To-do List,"[brute force, implementation]",2147483647,1497689054,TESTS,124,OK +nimishagarg_ng,58,27841385,GNU C++14,0,PRACTICE,50,1000.0,B,Coins,[greedy],2147483647,1497688059,TESTS,30,OK +nimishagarg_ng,289,27838291,GNU C++14,0,PRACTICE,31,1000.0,B,Polo the Penguin and Matrix,"[brute force, dp, implementation, sortings, ternary search]",2147483647,1497677404,TESTS,62,OK +nimishagarg_ng,155,27817339,GNU C++14,0,PRACTICE,39,1000.0,B,Combination,"[greedy, sortings]",2147483647,1497589849,TESTS,30,OK +nimishagarg_ng,155,27817279,GNU C++14,0,PRACTICE,30,1000.0,B,Combination,"[greedy, sortings]",2147483647,1497589604,TESTS,30,WRONG_ANSWER +nimishagarg_ng,155,27817229,GNU C++14,0,PRACTICE,6,1000.0,B,Combination,"[greedy, sortings]",2147483647,1497589415,TESTS,30,RUNTIME_ERROR +nimishagarg_ng,133,27792610,GNU C++14,0,PRACTICE,67,1000.0,B,Unary,[implementation],2147483647,1497527321,TESTS,30,OK +nimishagarg_ng,122,27791912,GNU C++14,0,PRACTICE,42,1000.0,B,Lucky Substring,"[brute force, implementation]",2147483647,1497524802,TESTS,30,OK +nimishagarg_ng,352,27791593,GNU C++14,4505600,PRACTICE,36,1000.0,B,Jeff and Periods,"[implementation, sortings]",2147483647,1497523488,TESTS,654,OK +nimishagarg_ng,282,27760707,GNU C++14,2969600,PRACTICE,54,1000.0,B,Painting Eggs,"[greedy, math]",2147483647,1497377062,TESTS,4086,OK +nimishagarg_ng,4,27760216,GNU C++14,0,PRACTICE,15,0.0,B,Before an Exam,"[constructive algorithms, greedy]",2147483647,1497375120,TESTS,15,OK +nimishagarg_ng,4,27760102,GNU C++14,0,PRACTICE,6,0.0,B,Before an Exam,"[constructive algorithms, greedy]",2147483647,1497374642,TESTS,15,WRONG_ANSWER +nimishagarg_ng,377,27743175,GNU C++14,10752000,PRACTICE,89,500.0,A,Maze,[dfs and similar],2147483647,1497291753,TESTS,140,OK +nimishagarg_ng,489,27738067,GNU C++14,0,PRACTICE,81,1000.0,B,BerSU Ball,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",2147483647,1497271743,TESTS,30,OK +nimishagarg_ng,489,27737958,GNU C++14,0,PRACTICE,21,1000.0,B,BerSU Ball,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",2147483647,1497271320,TESTS,15,WRONG_ANSWER +nimishagarg_ng,522,27736457,GNU C++14,204800,PRACTICE,36,500.0,A,Reposts,"[dfs and similar, dp, graphs, trees]",2147483647,1497265439,TESTS,15,OK +nimishagarg_ng,500,27735942,GNU C++14,102400,PRACTICE,34,500.0,A,New Year Transportation,"[dfs and similar, graphs, implementation]",2147483647,1497263555,TESTS,46,OK +nimishagarg_ng,437,27735224,GNU C++14,0,PRACTICE,29,1500.0,C,The Child and Toy,"[graphs, greedy, sortings]",2147483647,1497260645,TESTS,15,OK +nimishagarg_ng,432,27722504,GNU C++14,0,PRACTICE,35,500.0,A,Choosing Teams,"[greedy, implementation, sortings]",2147483647,1497191443,TESTS,15,OK +nimishagarg_ng,797,27716463,GNU C++14,0,PRACTICE,126,0.0,B,Odd sum,"[dp, greedy]",2147483647,1497164968,TESTS,124,OK +nimishagarg_ng,797,27703256,GNU C++14,0,PRACTICE,26,0.0,B,Odd sum,"[dp, greedy]",2147483647,1497086357,TESTS,140,WRONG_ANSWER +nimishagarg_ng,797,27703248,GNU C,0,PRACTICE,0,0.0,B,Odd sum,"[dp, greedy]",2147483647,1497086327,TESTS,0,COMPILATION_ERROR +nimishagarg_ng,115,27688995,GNU C,204800,PRACTICE,106,500.0,A,Party,"[dfs and similar, graphs, trees]",2147483647,1497011561,TESTS,60,OK +nimishagarg_ng,115,27688730,GNU C,0,PRACTICE,0,500.0,A,Party,"[dfs and similar, graphs, trees]",2147483647,1497010570,TESTS,30,RUNTIME_ERROR +nimishagarg_ng,115,27688664,GNU C,0,PRACTICE,0,500.0,A,Party,"[dfs and similar, graphs, trees]",2147483647,1497010323,TESTS,30,RUNTIME_ERROR +nimishagarg_ng,580,27683909,GNU C,8704000,PRACTICE,40,1500.0,C,Kefa and Park,"[dfs and similar, trees]",2147483647,1496991631,TESTS,77,OK +nimishagarg_ng,580,27675515,GNU C,614400,PRACTICE,11,1500.0,C,Kefa and Park,"[dfs and similar, trees]",2147483647,1496939615,TESTS,15,WRONG_ANSWER +nimishagarg_ng,160,27671533,GNU C++11,0,PRACTICE,29,500.0,A,Twins,"[greedy, sortings]",2147483647,1496926065,TESTS,30,OK +nimishagarg_ng,265,27670367,GNU C++11,409600,PRACTICE,15,1000.0,B,Roadside Trees (Simplified Edition),"[greedy, implementation]",2147483647,1496922443,TESTS,342,OK +nimishagarg_ng,431,27631777,GNU C++11,0,PRACTICE,54,1500.0,C,k-Tree,"[dp, implementation, trees]",2147483647,1496836043,TESTS,15,OK +nimishagarg_ng,431,27631698,GNU C++11,0,PRACTICE,6,1500.0,C,k-Tree,"[dp, implementation, trees]",2147483647,1496835750,TESTS,15,WRONG_ANSWER +nimishagarg_ng,35,27629877,GNU C++11,204800,PRACTICE,20,500.0,A,Shell Game,[implementation],2147483647,1496829487,TESTS,30,OK +nimishagarg_ng,35,27629214,GNU C++11,0,PRACTICE,0,500.0,A,Shell Game,[implementation],2147483647,1496826949,TESTS,30,WRONG_ANSWER +nimishagarg_ng,49,27629032,GNU C++11,0,PRACTICE,35,500.0,A,Sleuth,[implementation],2147483647,1496826159,TESTS,30,OK +nimishagarg_ng,189,27583180,GNU C++11,0,PRACTICE,58,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1496667392,TESTS,15,OK +nimishagarg_ng,189,27583149,GNU C++11,0,PRACTICE,7,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1496667283,TESTS,15,WRONG_ANSWER +nimishagarg_ng,479,27540399,GNU C++11,102400,PRACTICE,53,1500.0,C,Exams,"[greedy, sortings]",2147483647,1496482738,TESTS,46,OK +nimishagarg_ng,479,27540263,GNU C++11,102400,PRACTICE,11,1500.0,C,Exams,"[greedy, sortings]",2147483647,1496482282,TESTS,31,WRONG_ANSWER +nimishagarg_ng,466,27528747,GNU C++11,3993600,PRACTICE,30,1500.0,C,Number of Ways,"[binary search, brute force, data structures, dp, two pointers]",2147483647,1496423422,TESTS,1169,OK +nimishagarg_ng,466,27528719,GNU C++11,819200,PRACTICE,5,1500.0,C,Number of Ways,"[binary search, brute force, data structures, dp, two pointers]",2147483647,1496423274,TESTS,109,WRONG_ANSWER +nimishagarg_ng,455,27527413,GNU C++11,1228800,PRACTICE,47,500.0,A,Boredom,[dp],2147483647,1496418871,TESTS,187,OK +nimishagarg_ng,455,27527331,GNU C++11,1228800,PRACTICE,41,500.0,A,Boredom,[dp],2147483647,1496418617,TESTS,187,WRONG_ANSWER +nimishagarg_ng,455,27354499,GNU C++11,409600,PRACTICE,10,500.0,A,Boredom,[dp],2147483647,1495797597,TESTS,156,WRONG_ANSWER +nimishagarg_ng,489,27344017,GNU C++11,0,PRACTICE,65,1500.0,C,Given Length and Sum of Digits...,"[dp, greedy, implementation]",2147483647,1495740816,TESTS,15,OK +nimishagarg_ng,489,27342794,GNU C++11,0,PRACTICE,2,1500.0,C,Given Length and Sum of Digits...,"[dp, greedy, implementation]",2147483647,1495736174,TESTS,15,WRONG_ANSWER +nimishagarg_ng,489,27342781,GNU C++11,0,PRACTICE,1,1500.0,C,Given Length and Sum of Digits...,"[dp, greedy, implementation]",2147483647,1495736118,TESTS,0,WRONG_ANSWER +nimishagarg_ng,192,27342098,GNU C++11,0,PRACTICE,85,1000.0,B,Walking in the Rain,"[brute force, implementation]",2147483647,1495733652,TESTS,30,OK +nimishagarg_ng,219,27340834,GNU C++11,0,PRACTICE,102,1000.0,B,Special Offer! Super Price 999 Bourles!,[implementation],2147483647,1495729319,TESTS,62,OK +nimishagarg_ng,219,27339552,GNU C++11,0,PRACTICE,92,1000.0,B,Special Offer! Super Price 999 Bourles!,[implementation],2147483647,1495725324,TESTS,30,WRONG_ANSWER +nimishagarg_ng,219,27339532,GNU C++11,0,PRACTICE,0,1000.0,B,Special Offer! Super Price 999 Bourles!,[implementation],2147483647,1495725265,TESTS,0,WRONG_ANSWER +nimishagarg_ng,233,27332286,GNU C++11,0,PRACTICE,48,1000.0,B,Non-square Equation,"[binary search, brute force, math]",2147483647,1495701876,TESTS,30,OK +nimishagarg_ng,233,27332248,GNU C++11,0,PRACTICE,3,1000.0,B,Non-square Equation,"[binary search, brute force, math]",2147483647,1495701691,TESTS,30,WRONG_ANSWER +nimishagarg_ng,437,27317629,GNU C++11,102400,PRACTICE,33,1500.0,B,The Child and Set,"[bitmasks, greedy, implementation, sortings]",2147483647,1495618852,TESTS,30,OK +nimishagarg_ng,437,27316700,GNU C++11,102400,PRACTICE,17,1500.0,B,The Child and Set,"[bitmasks, greedy, implementation, sortings]",2147483647,1495614558,TESTS,30,WRONG_ANSWER +nimishagarg_ng,129,27304197,GNU C++11,102400,PRACTICE,70,1000.0,B,Students and Shoelaces,"[brute force, dfs and similar, graphs]",2147483647,1495552969,TESTS,62,OK +nimishagarg_ng,401,27232863,GNU C++11,0,PRACTICE,81,1500.0,C,Team,"[constructive algorithms, greedy, implementation]",2147483647,1495273480,TESTS,592,OK +nimishagarg_ng,401,27232694,GNU C++11,0,PRACTICE,12,1500.0,C,Team,"[constructive algorithms, greedy, implementation]",2147483647,1495272980,TESTS,592,WRONG_ANSWER +nimishagarg_ng,401,27232015,GNU C++11,0,PRACTICE,6,1500.0,C,Team,"[constructive algorithms, greedy, implementation]",2147483647,1495270865,TESTS,15,WRONG_ANSWER +nimishagarg_ng,401,27231847,GNU C++11,0,PRACTICE,4,1500.0,C,Team,"[constructive algorithms, greedy, implementation]",2147483647,1495270283,TESTS,0,WRONG_ANSWER +nimishagarg_ng,359,27230836,GNU C++11,0,PRACTICE,30,1000.0,B,Permutation,"[constructive algorithms, dp, math]",2147483647,1495267273,TESTS,62,OK +nimishagarg_ng,151,27230219,GNU C++11,102400,PRACTICE,38,1000.0,B,Phone Numbers,"[implementation, strings]",2147483647,1495265280,TESTS,15,OK +nimishagarg_ng,234,27220084,GNU C++11,204800,PRACTICE,8,0.0,B,Reading,[sortings],2147483647,1495217449,TESTS,30,WRONG_ANSWER +nimishagarg_ng,234,27219891,GNU C++11,0,PRACTICE,0,0.0,B,Reading,[sortings],2147483647,1495216772,TESTS,0,RUNTIME_ERROR +nimishagarg_ng,234,27219843,GNU C++14,0,PRACTICE,0,0.0,B,Reading,[sortings],2147483647,1495216620,TESTS,0,WRONG_ANSWER +nimishagarg_ng,234,27219800,GNU C++14,0,PRACTICE,0,0.0,B,Reading,[sortings],2147483647,1495216497,TESTS,0,WRONG_ANSWER +nimishagarg_ng,182,27219371,GNU C++14,0,PRACTICE,40,500.0,B,Vasya's Calendar,[implementation],2147483647,1495214728,TESTS,30,OK +nimishagarg_ng,143,27217381,GNU C++14,0,PRACTICE,100,1000.0,B,Help Kingdom of Far Far Away 2,"[implementation, strings]",2147483647,1495207265,TESTS,30,OK +nimishagarg_ng,69,27215830,GNU C++14,0,PRACTICE,81,500.0,A,Young Physicist,"[implementation, math]",2147483647,1495201947,TESTS,30,OK +nimishagarg_ng,443,27215737,GNU C++14,0,PRACTICE,27,500.0,A,Anton and Letters,"[constructive algorithms, implementation]",2147483647,1495201599,TESTS,15,OK +nimishagarg_ng,466,27215140,GNU C++14,0,PRACTICE,19,500.0,A,Cheap Travel,[implementation],2147483647,1495199645,TESTS,15,OK +nimishagarg_ng,466,27215051,GNU C++14,0,PRACTICE,2,500.0,A,Cheap Travel,[implementation],2147483647,1495199319,TESTS,15,WRONG_ANSWER +nimishagarg_ng,313,27214767,GNU C++14,0,PRACTICE,47,500.0,A,Ilya and Bank Account,"[implementation, number theory]",2147483647,1495198458,TESTS,30,OK +nimishagarg_ng,116,27214376,GNU C++14,0,PRACTICE,76,1000.0,B,Little Pigs and Wolves,"[greedy, implementation]",2147483647,1495197361,TESTS,30,OK +nimishagarg_ng,116,27214116,GNU C++14,0,PRACTICE,10,1000.0,B,Little Pigs and Wolves,"[greedy, implementation]",2147483647,1495196592,TESTS,30,WRONG_ANSWER +nimishagarg_ng,157,27203204,GNU C++14,0,PRACTICE,44,1000.0,B,Trace,"[geometry, sortings]",2147483647,1495134150,TESTS,30,OK +nimishagarg_ng,157,27203155,GNU C++14,0,PRACTICE,0,1000.0,B,Trace,"[geometry, sortings]",2147483647,1495133946,TESTS,0,WRONG_ANSWER +nimishagarg_ng,493,27202813,GNU C++14,3174400,PRACTICE,57,1000.0,B,Vasya and Wrestling,[implementation],2147483647,1495132511,TESTS,421,OK +nimishagarg_ng,493,27202593,GNU C++14,1843200,PRACTICE,19,1000.0,B,Vasya and Wrestling,[implementation],2147483647,1495131753,TESTS,374,WRONG_ANSWER +nimishagarg_ng,486,27202079,GNU C++14,0,PRACTICE,47,1000.0,B,OR in Matrix,"[greedy, hashing, implementation]",2147483647,1495129515,TESTS,15,OK +nimishagarg_ng,486,27201453,GNU C++14,0,PRACTICE,30,1000.0,B,OR in Matrix,"[greedy, hashing, implementation]",2147483647,1495127361,TESTS,15,WRONG_ANSWER +nimishagarg_ng,432,27199833,GNU C++14,1228800,PRACTICE,38,1000.0,B,Football Kit,"[brute force, greedy, implementation]",2147483647,1495121678,TESTS,467,OK +nimishagarg_ng,432,27199565,GNU C++14,1638400,PRACTICE,9,1000.0,B,Football Kit,"[brute force, greedy, implementation]",2147483647,1495120791,TESTS,1000,TIME_LIMIT_EXCEEDED +nimishagarg_ng,514,27199199,GNU C++14,102400,PRACTICE,7,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495119486,TESTS,15,WRONG_ANSWER +nimishagarg_ng,514,27195569,GNU C++14,102400,PRACTICE,7,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495108300,TESTS,0,WRONG_ANSWER +nimishagarg_ng,514,27194996,GNU C++11,0,PRACTICE,7,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495106556,TESTS,15,WRONG_ANSWER +nimishagarg_ng,514,27194330,GNU C++11,0,PRACTICE,7,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495104141,TESTS,15,WRONG_ANSWER +nimishagarg_ng,514,27194248,GNU C++11,0,PRACTICE,23,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495103884,TESTS,15,WRONG_ANSWER +nimishagarg_ng,514,27194065,GNU C++14,0,PRACTICE,5,1000.0,B,Han Solo and Lazer Gun,"[brute force, data structures, geometry, implementation, math]",2147483647,1495102158,TESTS,15,WRONG_ANSWER +nimishagarg_ng,451,27183406,GNU C++14,819200,PRACTICE,76,1000.0,B,Sort the Array,"[implementation, sortings]",2147483647,1495037883,TESTS,202,OK +nimishagarg_ng,451,27183376,GNU C++14,819200,PRACTICE,73,1000.0,B,Sort the Array,"[implementation, sortings]",2147483647,1495037716,TESTS,202,WRONG_ANSWER +nimishagarg_ng,451,27183346,GNU C++14,0,PRACTICE,0,1000.0,B,Sort the Array,"[implementation, sortings]",2147483647,1495037599,TESTS,0,WRONG_ANSWER +nimishagarg_ng,136,27182281,GNU C++14,0,PRACTICE,101,500.0,A,Presents,[implementation],2147483647,1495033131,TESTS,30,OK +nimishagarg_ng,285,27181971,GNU C++14,409600,PRACTICE,33,1000.0,B,Find Marble,[implementation],2147483647,1495032023,TESTS,280,OK +nimishagarg_ng,507,27181599,GNU C++14,0,PRACTICE,37,1000.0,B,Amr and Pins,"[geometry, math]",2147483647,1495030851,TESTS,15,OK +nimishagarg_ng,507,27181378,GNU C++14,0,PRACTICE,7,1000.0,B,Amr and Pins,"[geometry, math]",2147483647,1495030226,TESTS,15,WRONG_ANSWER +nimishagarg_ng,230,27178727,GNU C++14,102400,PRACTICE,54,500.0,A,Dragons,"[greedy, sortings]",2147483647,1495022602,TESTS,30,OK +nimishagarg_ng,230,27169001,GNU C++11,0,PRACTICE,9,500.0,A,Dragons,"[greedy, sortings]",2147483647,1494970391,TESTS,30,WRONG_ANSWER +nimishagarg_ng,230,27168784,GNU C++11,0,PRACTICE,8,500.0,A,Dragons,"[greedy, sortings]",2147483647,1494968696,TESTS,30,WRONG_ANSWER +nimishagarg_ng,230,27168636,GNU C++14,204800,PRACTICE,8,500.0,A,Dragons,"[greedy, sortings]",2147483647,1494967828,TESTS,30,WRONG_ANSWER +nimishagarg_ng,58,27166933,GNU C++14,0,PRACTICE,40,500.0,A,Chat room,"[greedy, strings]",2147483647,1494959521,TESTS,15,OK +nimishagarg_ng,339,27166629,GNU C++14,0,PRACTICE,21,500.0,A,Helpful Maths,"[greedy, implementation, sortings, strings]",2147483647,1494958260,TESTS,30,OK +nimishagarg_ng,266,27166290,GNU C++14,0,PRACTICE,44,500.0,B,Queue at the School,"[constructive algorithms, graph matchings, implementation, shortest paths]",2147483647,1494956969,TESTS,30,OK +nimishagarg_ng,118,27164453,GNU C++14,0,PRACTICE,42,500.0,A,String Task,"[implementation, strings]",2147483647,1494950181,TESTS,30,OK +nimishagarg_ng,118,27164412,GNU C++14,0,PRACTICE,2,500.0,A,String Task,"[implementation, strings]",2147483647,1494950026,TESTS,30,WRONG_ANSWER +nimishagarg_ng,4,27163237,GNU C++14,0,PRACTICE,20,0.0,A,Watermelon,"[brute force, math]",2147483647,1494946490,TESTS,30,OK +nimishagarg_ng,4,27163141,GNU C++14,0,PRACTICE,0,0.0,A,Watermelon,"[brute force, math]",2147483647,1494946208,TESTS,0,COMPILATION_ERROR diff --git a/ui/user_rating.csv b/ui/user_rating.csv index 5340108..df86b29 100644 --- a/ui/user_rating.csv +++ b/ui/user_rating.csv @@ -1,9 +1,16 @@ contestId,contestName,handle,newRating,oldRating,rank,ratingUpdateTimeSeconds -902,Codeforces Round #453 (Div. 2),Mindjolt,1421,1500,3161,1513704900 -909,Codeforces Round #455 (Div. 2),Mindjolt,1469,1421,981,1514399700 -911,Educational Codeforces Round 35 (Rated for Div. 2),Mindjolt,1448,1469,1725,1514477100 -908,Good Bye 2017,Mindjolt,1393,1448,4550,1514571000 -912,Codeforces Round #456 (Div. 2),Mindjolt,1368,1393,2425,1515170100 -913,Hello 2018,Mindjolt,1319,1368,4376,1515431700 -915,Educational Codeforces Round 36 (Rated for Div. 2),Mindjolt,1298,1319,2483,1515855900 -980,Codeforces Round #480 (Div. 2),Mindjolt,1383,1298,1262,1525799100 +895,Codeforces Round #448 (Div. 2),nimishagarg_ng,1459,1500,1762,1511719500 +900,Codeforces Round #450 (Div. 2),nimishagarg_ng,1537,1459,522,1513015500 +903,Educational Codeforces Round 34 (Rated for Div. 2),nimishagarg_ng,1595,1537,483,1513098300 +898,Codeforces Round #451 (Div. 2),nimishagarg_ng,1616,1595,638,1513431300 +902,Codeforces Round #453 (Div. 2),nimishagarg_ng,1671,1616,415,1513704900 +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",nimishagarg_ng,1616,1671,1674,1514045100 +909,Codeforces Round #455 (Div. 2),nimishagarg_ng,1587,1616,1300,1514399700 +911,Educational Codeforces Round 35 (Rated for Div. 2),nimishagarg_ng,1576,1587,1078,1514477100 +912,Codeforces Round #456 (Div. 2),nimishagarg_ng,1542,1576,1745,1515170100 +919,Codeforces Round #460 (Div. 2),nimishagarg_ng,1486,1542,2823,1517411100 +920,Educational Codeforces Round 37 (Rated for Div. 2),nimishagarg_ng,1516,1486,951,1517589300 +938,Educational Codeforces Round 38 (Rated for Div. 2),nimishagarg_ng,1598,1516,401,1518800700 +955,Codeforces Round #471 (Div. 2),nimishagarg_ng,1594,1598,776,1521831900 +962,Educational Codeforces Round 42 (Rated for Div. 2),nimishagarg_ng,1640,1594,499,1523378100 +980,Codeforces Round #480 (Div. 2),nimishagarg_ng,1684,1640,627,1525799100

4Jcg>3D~R z_uWh+v8Q!lY>c?laPR2px_BKulBntHa+{J7-YU@WoJPG{bvPJf6BAm!LLjlcq7DDf$ijk6=$|Mk&&I%DK46jLIEyB| zavA^X3+|II3DF%yp5|=k2Ikbev8l|XqobLVU#9epf1qi_+vE`2+1jRqNEq;?P;5TA z86-nGNhd%vf})G8wl-W;75T`>44|Av5h#AH6k)ck2KCn34`mQBkBsr+C7Xs(XF6y2 z`w}w7v$L~|ygY_lVIxN=nu=J_Tn(@Ho12y(^GF(2G_&M+eg_@h)|7NfqqWV4hugAY zq@q_@qX_KZdIDOZtDlHk?@=U&i=q=xdNZJT_N%|aW+(iOyEt}aY;P%W)(EgB8Y%7^ zbn1}L_`nIMSw1MmggqK^8L${Py`I93n=#?#aBEY)ak^6DtnHI#ZBFE6CL1N=Hk5P; zh1Dr;zLz_C_*J7&ez(b%{J^Lzi8sKm?go=aS{8nRlWS?PpXFNkprbIH=WWy;uSf)C zPFP16%LFRT=t1`s3`U_N0px}-;21x@ufk9ItIJD8v%kpT6pv>ERG-^VkCdqE$~dV2)5UW^D8Sk&CJX~0r%YNo6KsM2}v7f|5{h^ zIBi_&)rq0`169GDL+a7`Tk0&awqNTuJejr}JKJhyALrZaGg)=M<~A$Y#f@c47*t0A zUn?Qe98Q-1FBnTU+k+7X3{lhLJ!l2g0KcsWc;AeS3@FvOvb-Du2qusg8UV?0r>x;< zN>h%1M^yfzoR$gTY5*nH%o;1dpDXxm+b%3DNIF!~?!0!ad^+cD=SQ!HfTpt{op$m? zyOGV4bmCLmqdmXSC*K$57Vr!-cT|ZsoY1yR5=f$H>Iv)DQeb*k7AK`^lW)D1-U$}6fAG0V_$%PMB9jipb6^c?8@L(4 z!n^-CVJ6SKxGy|J@xBKn7YXpPlwg(RP4`ZlkGZBCMF3PLKh4gQ45w)aiK)vqF^StI z4G^;`yu7^ggU@s^3$pIdwFPq#ra3q`bU2J#m@EQCL()b{G3Eup*v6(R;i&wCJKl;NZKF$(-hKofaaWJw6cxcaSDLyw@$n zA}cFfYBMK(a!~Y!35qiY^PWkIh- zb9rg1@ub{j^>{8g8c&W}n7QfP_T;GP7n7z{Lxt->o^Is*AnwNwBhPQJxqqYZ70u^* z_1L8n015_|^%7sSDW4xE#9)mjL_L(=`I(k5BA`0bKQw5)S+fwOnGSFXR8#=9Xt7++ zkz&7ms-S9$-Z?({X!?z=oZ!j)_ULD_H?w}U^TnUB!hvL_$BnK)uB0{M;3gI2c`1 z#m~J=%@EU)EKTtV-E)9+KSr>PQhGpW(3U?k?GxMt#XPore4POSH5~$JLRyWk zN<|b<6A_CMhx2U4SpK?;^vtu!*a7E%foq1UFvE2ZTzHo4?>HyNZ=cON#x^DIbpRTk z>-D}J(UXra$8`3mWSr-KeE=p8oN7`w;L^hc7=U=$HpJcpw16y>+~V%SvT~5%To;q- zRbv#h zO+mLHXc>A`uUdxvx2>aPCelEhjEIbseD*AwQLVU{v8t1~?%Pk_dt@4I{#G*c)!-vF41_?50yk03*nb9Vks0oIPq3~%BVzOl@cocm?S*IeeGQJCK~ZnjB2#w|qMuRuUlObnwqyiue7F z#_ro+o-B3Rbqkm@)>w=bQ>5uRpDI`drhJZhWFQk9RR)ok_Gepd&$HV?x9rF1DiC0= z7Oms1GJ`Vve;9fTO`)Umwj|hXnXv?t$=Aqw-QS&lw#11EU0a(L&T61C`F;Z;SXad} zs4;-&A`@rKd=S_IKwc01_dEkoY%J!Xip|46ijAg4MWnKdilm!c!wK?pP!(53(ch8r zUBi4eBrVM1PgQTguJxwLl8vVU1o`5Ra;g6M=r_RBUr60k!ZSl)+m{pxEHw zWjhIK>y93C34U$%|y)YtR3cXWJeMG*bN z4?K7f0*C+@!wqfi2=Vb_yJG;r_)Udg+&r9f$@z_b6c3A+vJ-ql0r$xhkTIc|4yg2U z3YWwp7nhJ)rpTzMS^b}bTu-5F1Odr!SthJ98qifMtE;83zR?_~7oGz*t}$ZM_fKV-wF{uWYPnDk4Y4JGJ<1y8dl+|M>j4cl+k9FCa> zYAPv(gF=2qIG_xMU0jKN@JIoW!f`CX{)B^K@MT{|+qwnWc<dy#VN^Z;_-zkdcvp{}Bi*DjCdUIv^i!07{)6@D?Y;T4ugTBIO>H zv1w^(%S0bz`uh6~x+V|cr0rq_-DrTXW`Cq)-Q3#3CQX21ux_DWuBMGT zbqfnA@b6Ry#wyGkzH>6|_Hn&7F)`7I80>ufLO##^*o=h{R#=Gn9P*c!bU=a)|FTAl z0ODM!$KYdSwAu~JGmRGc!5OKhY#{Eycu%g$SK&Oz%Q=rX3i?peiV6w}Xny_sWCTdh zm`5UoHH*YVpmR}HR{oYQ8J>Q{UT{2%jEoG6jwVFqcR+yUkYcoIGCd&JxtDG=o=E}I z6p*~)`LFU)-}pF*R2ja{Ut$#%p)i?J`L=-kD$=u`5|!oKCjnP|Cmez>4k$tRNOume zfxd()=z-OFhOV=RKJX=c^`Ibvef$46CsbcDe!6pVlVNnt7qYat2pm+L*vXXxSj+?w zU6QL%CAnz&^I_OALnJ3&ouDJjsKtO-usk9n;_ozZ?{jo`csOUyPYTurgfh94kK`&JIVz={=!(Z1>F?z46nZOY6X1!yH0ZTcfx6R63npk7&HM*a6O z!^3>Iwa8~Wp-y{?V)<`=T^w}=yYGLzGRXW%=%VYiSVEz_dkIhO+Ptd=)+nfBPQ6%9 z_}e%JRtSyj))|b>FW*xxL-Sx6=@$*~8z-w{)!r*r$`~A|@Ur_sG2=AzRWC*AMx#y{BNm6(^;ny{{ zQinZL5v#Z5|^Nx09#^aYKpV5(|7iwE0&E`pOohMHptO#GBl4p z_a&W&X1_1)!^6X!fPf$g&BSx2IENbToWuKomSyLE1GDh2N@d~vxuc^aZHW4MzoLRC zhrl=(sPnda9Ih~#9;;NeHAZ; zik*I(HH;(hfHrV4&|$N` ze_?4EwYzHzJda%fL|e8VBwR2aL`!{7E$~#k+c0GjYB=C55RI#Hr%XBm=CLPAxAGO`R z4A=`+$w12 z!&Bi^P2oFHTOyIYsjhY@YC>~yl2|t30an9|dRC%&4no!^tZU}^J`T8vA>cAi2h6=3 z?+Voku>7$&WB5QfbLq>`Qe4BX+-ns25E*RRjJm?tdO|=@T?piwdPrDbq*n5HfA%$$ zIrxK4JtaJ!ALy;n1LMRl*g%u#&f8sF(>EtO>22*~uD==eX59_xHv*2J=O!t6b3S*k z6ePV)@E|>|c_EKx9Oy5Fnq0bF7uj~b?wvR1yC064bV4`SUhxvexWO%04g2N@J=fVw zp#jh3xTm)lw^qr;k$3L;-ZL?7t`Rc|kY;0B4*5@D^Q}KruXqv3&dK>f&@SY9>j9-n zPfbA0`5xm1{!d_HG$4CzH)fXA-t_CjiVldu6U5gN6C46-J{hBZUtO^|D5h6z63Dc= z&_bepF7*I__>*{pFTB=%5k)&4c;%)q7u&MI$ND*xED zE~ws&|L+Y5CIOet0l;hr_UEw0bP;%kF(?uR5vR!E@NFvJE#kxc9{He^3gcJTDs&SN(Y?< zQ~O%?CYQ2W2(-*jxW$&UG}0Kao+b_|Xh$H*_pjS2_glafu4JJ=01G;(YD%6Png}Z^ zLO@nM$>Dr}0ZYJ8-4$o>o7`15?2!yKl5=H}2$+nD0F+z&_b&`-ucE419(3aFxtJX= z$;T6PKqp)){EPoJ}C0oei%Fb=_}&!Z5A@cqR6cfjAHj#mjL44wiOz zZzLSeP$7HaCH*Qg$G+P(E#J|##o0}VUdg{D~@u{Ojs@E?2uU|j`S&=}`46<+&IK#u^;)r|K@~g30p8kZ% zfp6(&+UXwO2%hN(ow@!SBeb(OlsLqM3y=GNr&HAS=!w7=L<&cC6;l35I38RGjl5#qzzSz|cp9z+Yy;H5(o+9p zxIa;bmCcQui@DcvH7qf4!#ut>mupPsl}qpKi-caz&p1rL`oYq%afX}0M$`bwnNU3!lFPC zDH;!Gn9q?1W|hE$k%94X23RAHNF?Nb33_==^Docfhnkx`DnfFk2F`(h;VaM$D}*d9 z2?^^mYmX<5%g4&5wbwb~P6u9@vgJH0UII6_#j3Go zrE_wyRK6N1u#mxd08MEsw0vGyxxgLdmt7Gi1z24}jQ}YvB{w_~wzxv5*6}Dp0|-Wt zW<<}g{)C!#Jiy_Tzw*abO2q=f{vS9-9UVRt113>JLj!6H;@9Ijp)AXcMktYEFeBow zm^YFQA%w;Wgcr@R&kLHB{_=<`^CIdnB<=YQnIEnAKf4VSgn_S3?APhpnTT1yHR-s* z2m=4p;h_Vl2^?~N5{4S^NaZ~%iW0%%`I3GQCaThb-yByL!q-sX*R(Huw@L@CSqf)PZl@pr?hAs+w(RDco=Kv3_sH{u{ zJWI0ns%BMgnD2pSX->x^V|c)5EaisR`uh5Nosr&$?_XbN<~#dU$mK8KO|oQlQPt|? zFBC=a>38j(mr)uE`#dsOA1TT7ZOqFvzawojL}^(So3af2ro!b7`}_MyM$uZM!64Lu zABU5(@MTX%;Fr@dXhPVicwup|HQf6r;b3n>q41nWgH~P20LBU8NSMIOI~Rk@18ht> zoEBqLpqochTA9#)z<0H)Ujj`I&U~!gOcD5)n2o!;yQlS2)nLrs?+eJ`@>LQR$|Bu>RX~sCZ&1^VbVK=qjb(^NDgP5^=~jF}fjKDp;MfFy~{zwME)Ue@~Et}hWm z2#m}?cY_!bq;{&v{eYp@VhZrzww+8>F<&`C`kHEMdH2RZhk4KaICa8htHJn^#HyZR zaB#2>(A7|<+`aRe8>|l>k_YqezW-g5Nli%PEogw<6|#B2J;(xusow}RtGnJTt}QY`C-dR9Q%+0mBG>{{WyW1$ zVA4qnsD9^*Tuo392oF@X15FTtTV+Gp2A~MI*)PFv_C8cctmm;?{02f%jQ640h7p8}8f*G}kLGODSFc`u0~({1bJFGIQB(Yk6h_)nd)>j1W(Md( z6AI73xY+ZKqaS=*-+<>)On!LMrj67VAfgV?@LS4lm{~8}1j`f0M!csYPqDfpOk3TD z3`ox9o?YT~vxiw;NolV-a5Oxigu)D-r@W9GIW)PtlJ^V`o5&rQS*Hv4Cb?|VL8n2` zOaVclXP0Za)o>Iga5(Zg!l5@!Y!@h#o#!WevfBs1-`yF+w`q!yu|3(lRt?pA3bWAV zvF{D9m9T$9zsEk)0d#)Jw!3x#rbTgB0BkQtz5zejL)OE*_$7Th1^B^erd9*b8h7z| zR?@>|tQT&J_P-uAB0K@V-O9OoU*Epr!R1#%-3aLL8At&09~cTBW}#I9WQUi&BDTr9 zY_A3eXKI$eZfg?nD;pkrZwsA`c7NgV&W0ZYs#S-#U>bcr?bb#2crtott}R}>PxoBgww;>QYKkAqCa!dy9#%D3 zv{sdO1LIgK)B>J1Yzj(4I}n8p5bCm$oTV&lS7_{7>dP=2RHciEeseoM=!O=J%XZeL zv!=3pjGubLXmyd^GNcgJ6A}>6)O$G>L?>kqcmzQkq4&TUqyBDR@9VAmK#)hE2$8YQ z;M>%CjgN{1B`o;~XYyi~<_+J&KrXFx5)J)<3Q_7w6R?7N>m^#~#O+)u!Pn*IB zx)||Q)+P`6fk1~=yzh+I@OcMt2m!MHLcV8~5gJ`h*uW!IJ_reeTLX|jJVzo^2R@jwTu(QojPjPJlH=4LXwsdYx%y6CiYvLywF0kC(~ z{Rd6YNgkkc~h@Z-S($jd8PYY>(|Y< zvgQ7nGq=XS%Eps7uuQ%xS<5oXtzF)sld#_qmo@c>l(T3Zgp+Q{Nd$das|`q(nOQIL z3M#|?7-YBtGfGRt3gx*ph{vz%7dlWIy|)(rIlC3JDVL;hPyZh}U`UuQZfhxJ^#^JZ z-m7>)l5FmWW00_3hqbiiIMSf>McrJvF3({Ab4q?HxsI^^Gfp5k!gdLYd|tob*VpG* zrkxxeAJ1^QWZzi0C4tVF-5vOanwXP?MIP*}V!uq>E6FZ4A>nTO54r8Lb&a#bxBHFh zz?!ZWEDZ*a7X^%<&BMV(#I}oBM71lvp1p&EbBBVOnkjL~m5Dg>-fXq#Tx3K<3>Oz? zFXtcn!AlrmfminSql6LT@$VI1UHsy8!;QT99ghe5z5d2_+8BRXa(4}-b7 z`DMkwosQ7f*0#Mk7>+k`n09;3bGrOdoBr!IC(u^z*VNQxGJe*)Zx;nD7@xl?POkpu zr*4wC>9PS5H@>%<_(IxL&0LpPqSf`s?|=ZDpCU*u(7~2Lnx99C9~wZrSHJ_<3R1@z z&(arz^iZBS!M1~rrXMsRcv>r8=G()?9YrjIlrNDQx<$;+q`mcK(=Ar^M$4jEwIdX1j9R=BcmR^#1-Sst2IF9Cpi%nTq zI-Q7e35Rh{i`5oUcdzC%GMB3?E++cPT)2G5D;fa3G9?`) z9-5rYGC4U3)hT1+Ya~yJKH7L`Zc$fJ9aQU)Xf>fg2g6vi;0~Z;VP=TE!(jF_{0%UG zMMOuBcRc=^A5h_kU5bsr$50Gw*#!m=v55nxzF}XwB$PxxI5=1&d)U~a}2e5G*H>n6a{z-pGQZp+Ss%;a= zpW|r1CbR|203#dzM6FTxRd1pf0rr|WTGGp_E09-%?bK4Bd3f{cCd4Jd6hXvHJHgfQ zTL!Ru{`CT`2MnM3`V{4f0Pi98>zeh*#|5m%X^O4e?c3MM=65`gj-t6IYnxB&I9Cds zv8=xxG+sZ;u81*BT(QZ?&i;1#jmIVLTY|Ei5cRnZF*O+w76Fr$#0s3JapLRtjY*q^ zVX-SW5Wv-`si_yc0(t(b789q zD8Dh6b|xkP<`EyHCdE-s;p^4+_}`IXz)M0f-oLz-nNguw?e|pupJlKX26L{+qMX;Z zn0KH-^frGObcO9utD!Ur0%bfbL;jnj3xWqW+$Fm6k4cL6ul^?56sWw-1Qa#k(k1VV zVhU#{tp4QquQRDVH%ITmawqv?axVQ2Z$B`lQnOy#2}~tDNXldJgFQXuptS;X67*#z z-BCe7Sb&oc2W}E4kicXMc@vY9w;rSUH2FcRRYynIgw`;Tk1lF5b8KQ_pnrzt05S>2 z_eCl#{km#1y!37cF75TxO9|QXAJB2-EYab;wyDg*+pA#!MjU*b{emaYUi)7Tb#bKh zLDtUqy16>Oo?Yh@Z(;s=?O@DjVH-%U%?q4cY@ zLD^n2nt#lEY2h`$Gs$mI1rjxl8F;bCE-?Q27+3uvWP7Ec13nez!_J}F8Vjinf&b)V z8--V*5n-s2!(m;mUvnDD#|ADRd<@nX)ww^mx}0DC{IgHMae^dxFeBL;pdOpNqHoQr zdEub~Y|t;yl|@1Lq6`d-G~o z)m>OkUEQp<6EU?7CI!GD5WptE!U82^Wdmzy7`T_l3+g0)OTx_$Q19;44L-7S(;rHY z*^BW6o?Pf`SWybnv;PAJJN}10F6#^Rcajkl^&d+I2m{=5j7V}aEaQ)>;V9x=@siV zBmwyCV1Iw4Bc_yHtk(+dde&agQY%gPAbxpfhWvW03~E0Bmav*3V}J->^?xn=H9gSF zDb4;1@PraTf-twBNs{I5+FN_Xr;43Xr7gaq93BB<+i@hIGhLG0s@IMIedy?27zNA( z{y%d<^Rp&O8QXhmfU)N%I95L->g93p)1rGVniWpz+weQzpeQRfxf4@pI!!zflQ(7@lJ+6H49 zP-@eO=9!Pi-^pAGXnzUb=rR8mgE<5wtckYTGKG=Z^(ErLh(zt&L}32v!?-2h#99E9%D; zU}`>i$-cO2Omr3~K39ZSxf2mM)(J$Y`Proa0qjX?tHbGr^NOzJN4D114~;m&3Q2~# z^(?sDiJe_s3clJ1G?y;kiptKyOhh~ae$n~dyh2vH1I!uw?kF;<3PzBmo>LntBLgQG zbVOh8CTIzmYsaKb@>M5R#?etAX)HT&k*_u`*4eAIfg2#vPQ$;RH> z_!W}6-8ZXicZ|P7NO(ME6wy(iVKwd-M_pTAIcqrNXL+%i^>VDdJ-jsV@RBy}7mz<{ ze0X{fCUR4IJ6=mK48t*SaSexamSvQ_>%Iq?R(Zss;o*2)9931-xD=Xt>%VP_@GS{- z?0?L*J$h=AFVU?Y_1mE9Igf;X$u(pT(K3n4UhW?sVZt_VWqsNyqb(?&<@ACZwNP=c zL-i_Xn{}ZRvzKG`QZSVRHC>$CC<|3dNvra=2pZCk@Z|i5`zmv|?8xgk0JHrM#xMXn z_}4iNEw9Md$S1wvO+I@_L7HbT7B|>k0wBcTN|8R1;-Rn`nFhP(vhbc1Y;eQuK{MSa z_I&ma0gz0LbH=lq3@wp}uhse`WwgkLHgJ++z9xRh8#WA-xt(%@0na?q4K`dJ0p{N` zBBBFfV^=ij$E&xW15zo=KIE#g{e#==?%Vjag7-g!=jZ1Kl*IPiOR+yrxZOP_6WxGg zvnOv%>cWYZ@gm-j>kH%Fn4>v0CyOze4VOWaL2dlF)TUjlPN8GntZ}S?6@x>Kevtu7 z1z9w3{!<-vZ&gI|^zM!wQF7#*x_A7L3vQ(NgB-yW;vG#UMn?9)ku_I?+ilOD@*<}f{FCzY!uJWiFJnRSl{^Z)s2mVdArsw zR@$-x(c#|fmjvL)%?^lm#?Q{a<1Es(^ao?>c?_*p89iZBLCc^~{&M`Sgh}czu55w>8k?@cFWjbw3F-6*c zkEltS{=oY4Yh{*AJL9Nr(VmCHI&o z#pw&LY~(UsuE#D_xu%XMjP)W;p+_c1fsS5R9$(})>?+TzTm~g(W4?4 zKI4sGq05p6Q~8l_Ho=1xi}fm3?tC7*t#f&7)z&5^@S?syok10#0VW8HTwsZK z2Ym1MW11O3$akfu@ny67sb^C!Z47~~b`^UMbY?Lv>Aonv+ZDll=N{*(GJI zQroGbC)iO(i}NsA6CMhc9g)jm*PUqqSo&Z7`@at4f$B@dF{Czp!^WZ~Tg9)PJJwm! zI8n`IWwBC!;irmozMEgxuF=Gu zNBD6P#)&;0AK7n}eJ49`{rX+V=LwMeMr6ilXv=>26@D~v0>g8+c*ny{$#&?Qi^lu9 zr@$-?(cQZN%7(c$jcKQAU5OykR*WE#8#> z_q#ck;ejgw0<_J4x`tgw%gw@nzv`!3N5B${9;ZJa0F@@~#aA#Rx2=UQP7;g-Iyc)c zj^TI4YaANC+kL3u2tPc1t||Gh4Hbk#XQe8q zoY#I5JTi#t*A;NmzPI9$C-kM~-iu{>Zy0^N3RdKiz!7k#*o8S>hbLub9L>jL@$v+9Sd!SA6TTnn{7=AF1Zrd-*`33ea5}a>H z@VWo!X zLz4Q9;`e}R6lt%_BDW3m-!GO-Zd`3#gWnl$x~wpphbl~Wfgxb1d_PxCicb;V0?&EF zYwzI_kV=*11P+vW){8%XM|2?}ArZsQ7U{nP&Rr?sf?6&c1n*z5fWG9TG?c*iz>PVD zOFjv_muVfi6jQ?*frMxa<^yB86QB~;zV5~9v!@#$Q&TDE13B^ZZ?3<0uQY`ec7Gb| z#@pyBtw7d{+o;A@%Z6K56HlNVfLjZFLWX-00_LzHL7V$Q&_l%+v`uzWZBYasr$&Ug zZuej}04yC0@=4i5MdK&&&+y>nC>s*3+2iL`% z^DDhW2}H-vNxqM>v(IT)Vgu4*2>0Lrz(*gyaj35x4|j)_ir`Q`nR4G_p6VW*fd7yi zy3NXz#@(uOHQcW`{scDs!mr{Iay?y+N|Ux40iD9Tt6!J+9qu%V_`k3umFwG%sk!v2 zH!JGdU7=29_vOC}lnaj~*6U6qzNXj%qUwuf35-aSNjYc1Nms6~H%pW&X9WMregoaz zwQt8zDEas}15t}_pQVJ$h0`MSOh*S0X00*LPLz_41oNq>s~Zlt{65(gLi(J4vVR2s z4k!(SM(da2pL!-LY6MV0FlF`;1n1HsMQwdM|DVGz`9h2zp-W!AsUVM*ti4~U)0k-Z zxextS0T)*vjqRAe?Lb&O=P=*c7Vt5;!Xl=6uF;C6boQnmzr)`6AnmI(yEhLKcf)Vs zX&pQwzWU#4r;j7ue(@5=*q-0!znTh3D0goDC9g*I4-Fy|ngO6F*p(}dhS z=92>u+tw%u>rZZ7?-MIdMDPIg0uc7(48mP^v&|dddeA;4-u;k;SrYMZ19!7Hr$HTT zg~Q~Zn^2Cd2M-yN=hcPUL?H17KRP9fl=S{>!=H>Vs=@8_Zyo@mzHS^qR&<+C?H^?- zX(WZ-jvTrAUjG93A!4daRW+~7078jvwXcFHKEvQX%z@CTfm@t-!=-i5eOv;By(!%u zeRE~zYyF@;w!lwAOkk~RkDX1Objod$^_>PZQ%0m#iu;}c{eXk0m+;p0UWJ(XQe-0j zMl%{U0+>JT*jL{WAxDKJ2HXc1{`87(KTkooU^+EUUmr_2*<2hkoKkYv~NJ9#0a5m#-Hx-b(7w@2kz)?h9rU7qr$&c9zsV0PnVwH z4&J*pyyX8PA&K_YUh(gpP)fYANXGbWemZDdX7!-X#FIDVjG*Xz(Os}lc6Bf|l<-d< z(n2VI3GC-S#L2K|rp)%NES`?txgj)sG0pePUELaR7w+0FHeW+k8P*=}3Rc_3mW^*< zb`}RXT6+t#>Vady2_y=oDrLk)2_FcFG)ZmGv?`bwU@jo^C?NuRhOs7lhoD<(q9hodSda>hvA>9_{-MS`qdJ z*WPYr5H(v1OPC6FK`WmYIi^V(kpq34$N*3VC<@G1`1+26v^fk6XWODS!OS>DBV076 z);c>YOAzn93Sy{j3!Ekr>#;&pqJ7z?!V(g?YI?S*3tdhqQD)2g^0ujNO^a5HjJ8eO z?@tOhplTfr>Zaj1wnwBZKY*v=GeHV%q9f7gq;Wpos&!L;V$9`t6c&pm@`u+^0U&O5VDWko>|zfQhFHM0n2oE7(I|m4L%~sr z?yDkT9;)0gs`p?XY-0f2$ZiiXAeBhnSGl?T@3zA*M~%GG9jXCCbBVa^*jym70S2zR zQ1la#e5|gne%LbZ?AZZz8|{rlgm@LjWBg=u>_IJaXJ=SHQwWGk+8y5tg@S3?mQ3TekQ$)uSU^b4# z!_m3Vd3geC2IQ;&hl}UymqAe%-NJ$qH#+GFDjP@hM1r#xH(I^s3?cls%8YdrQju1K zVD`iQ5=hEYYBT#!e*<9{t#0?)6^o67rM!x%n>f=$lUGLFS4XYzE10jTxA8FEAUyPwwmK>6uB~1CuIz-eElaE7beo z8gBkFYgGR*%zj6&>cjvx%}peVj^-wnmJWIpk&}Ne7Q&t!t|29~FBd%5>(AOx`qQ=H z4ly`YuXSIR*2I(TYeh^Fbp`;&(@c3hQXy{PUvaV&+1OgnKD*J}sZ_vzLL0 zG;(un&1-1%K$`qKx<`PUnD zKsO<`Fl68oZ)Q6|Hr$x*lK!lHw<9Hla6fEPTo$2i3>ay91!@f!0qFUNb+C_E-U!;ytqdp{ZtVj zz21|MjPgw|a^0T{=)}`KorqAiw@c@9*q(RAG3Y9vK6NYxS~OYnu0SvErNlF&j09!^ z(O&yf0MIu-u^iv80gA(SV1V+i)#7T1ON(2uv6i{vpgU7`Jc7*p=Eq^k9F@CUVM8?e zp&^XSoe9*#3*kToVV%^btX)PkRejKoaIM*RZC#{V{)r|Vm;@Xcu4i3wwb*7+2-t~z z!Jn(0p*?F4d&-AC7sl;X@VD74$@5f3Z0rZ&bO6#FZZBk?#Onn$thvfL|2tpZ*dH_1 zK%V{l5X8@w^Sj&9)>(4r^tT3s9)AqkBKJ`R z25<@&>vdVYV>M^|NE?soi<`B$!`d`$Hjg5-#eJZumKhwM8mf~fFDyV;Hw-y7@6_RN zBVt2pS($vH-K*74(>|oM6c-abVT#-|WBAMBDvjqnp8PdRmLI+ktJLoiI$b?2FQb&9 zv?A|$zk`#r?eSxRdRVEI7Td`q0V(djZ1WoWIiJ3GbOE5Oumr9xt^{N!|~FtrwL~M9DV4VVH(zz0f6j_(Cj{MQVK0Dfxp;Ies^s zParlIcssZt>D2DE2AXK6@6F9&V(0w{wR!22m#6UA(nv@LA%u1~i9TzkXe7N#Lu#b0 ztxY~UKf>b>C!ky0YM;Sp@HH~bpUCp{+z7Bvlth9z@{5Z45Z0+R(4_BhVE^hWsi|vJ z8{Fauv43r{fY4c%1I{xIYq@oL2^AVoD-aiYX9+c966V|yUjO0cMv>p-VIq5avr?Xc znf~6qsDY`n=Obqb)N%v!7(jNfBkxK`N)jA?Ew6vSyOUWb4w4(?`mazI$Pv+sM%V$o ze205$W&ULCco@+2K98T0p?&ePR;NFVN$mLz?Q;48{mGj8w%OBTADOgmB*?Lb*-GQW zC|)TzRz$&rCRaD|61D26SB2K6v$n{swMLUC0#nITqn_?Lw^}Y& zQl1aq=iCnrj{cU#nX7Z+z?5y**nnc5R4NvSNJ1QCS?7&sy*6GQ8jtxXWK$}=Z_*wevqLiL^C9B8GrMCH<&knW zjTX02Hqq`0M3QC30tr+}VE3Y`AAWFfJ~NX9x?f*buguyB%Be*yYW($NmK4!-{-kuV zBZ&1+iM8!_|GSr{U-QXeQC0cEQxQnRp061RND`7@7WHmw!b7V3lSc=w2S-=HiQ2MS zVZQWpH(|3L);-v&_W3(f_5A`2^Idc78s4c58jqpfnoLx(8Bodj-sGE1A9;==!?i~n zw$Diw{SE=V_@xS|^`myfF<$q1G?kR(e(PjWo8O09z#`pK&Q$ zilU8zmaZ2atV@`2DRaFf|B*^jA@fJ=W!)FoL$K(HI=mt!1D7$U0_?fG)EOy~i{(_)oEPw! z@tU5xu{%=ZU!`RA3YgHDdf7&?A#M`IGp>ENVyYtBKFTWi_L)5+%;juS_uXYK3H`{l zdu=rFR6KOt+WMyz^Yk}jm=ff`irTQ9Mli&Ccro+`h`qVb*ObwT)Z5 zShWcUhv76ir_jdJt@(wg&V$^(Ns-cC)9DXw9g5{b0kP{A=LIDA2p+Pr67pP)UCg4!PxRc4sRT5@ zq_-s3kWvEO@T~e4rwH1I+Hc&N1KWxG_Oqx;{nBTorqQ+(sCm&Pkadz=V3%)EIt<++63^rn1kxsnr)Qn;37CPi} zv7Rg@Hv7y+AO-oQw_8D3n-X$T{xcAl{$Oyc`HQrrj*4l& zn&TKGKPNwiDYKaU6P5<zTlbQZifsKfX%vNcjF*{++C^ zQCt5rF}o>0zFp9`m9X{K7%X0SK=wh_&0!2mueS}-g%DdF$$FK+IMop7g(YuNw2ywRf33L#kR3x* zNWZ?1eX@vU zOAsU#+zhlAMQ@umrZDKF<4IApnx1WXCLyN1@3LAkH@sC9toznO2wGmNU(N{w3a)IC zy5Ti2Ev1Eu6tQ2F(b36k!8x~oJ$DbcEk^LHe$j=u&-;)OpEnZD&M7fW&KCzO$7@aD zc7L~jW?$n*)f@IZFcV1P2cC&7m!k2qA1o)`&8R2Iw;mJKyI!F(E-()aqU%ev{?>N5 z&Nz|2G3a$T3mgSB3Fw z^rzl4%%hITL#vn(z|HZCh$i>*&CWZwtXq*6(pxDhF@yv}0Tw4u1u` zA$;RdgVE73^(r_ys&b;nzl{GdU-lMkJ`Y&EgPU=&*8Oq9e9jUnN(I6xW|PbSkV6GV z6`__IZH+&B*5vFGJ+VeXopiZ^hgUwd51VY4xuwr6Wr9a(Jf>ljQ+3euES5KD-85QnYrLTOzK@PAYOI zUureTPnrxuvhkPsSPCUAuHVO30{YGo}t4`VXLNwhY8z%PsvmK477_`A=Tv>L~DT-%ZRc&1~ zv(8PgX|Rj&;%=LNJ&>=qvt^2-6?ptY_~9yXDvi*^Kcj8yxSgRVLhUqz8Z*Q(=0g63 zp*tbBxCjP6y$N{qXs}>$BcM`Db#M#&y2=^ko-b!Ls`m@N?bA$471kfxbzbT7;?>a! z+nM{F`iY_y+53Y7B}siaDAym5Z@?*COfqjMR!O}EG&&e{;W!*VGE|{o|3>yc6OsiR1eX;<|+S_dcpEHYF{~@^jkL^yh~Sm#voGcp!htEkpxL#mY9H3Bqx%3M!F33fWBT&a^vL%B0OmItc?_!DC zAeSB?i*2_|KUq^X7EVfQ6SZ<#8E&fQRv!to`+UnI~XnAjW9o8Z3D-BaJvYM(L{;uqp zl{%l(&kflmv&bedB&*U!h|3ZiCzJG=7r=Gxo@3lnDPRx~znk6J~iX?CQLIExYQ z3)H*IT0)rBH2EmSO^g>6b&9`^z%AY94oS)5|870yPujD!U!xy(uDehe-6*?`WNw{@g{P`}LV$3CvFZ zfnI*n_5hHT&S!{H{}+_A5@d#YQ)g!?dSeCt3-F|g*cGHnwCwK>B>#)u)tmskYZ~C+ z!u&HHSymBU@GE1%E@*`^XSx-e$`Ed-0_I=g>bty&CX{>3?&giHvjLs`M7!-}gtZ76C)x5&68R z_V2~Nh{8BC`SD_F|NS;^FToJLU)Bux-@FXKI5nM!dyfA1ZDwHh9{gWZRfjvplNlzK U^6*ycDfszIUgd7C?9-S32gAF(qW}N^ diff --git a/ui/img_langTrend.png b/ui/img_langTrend.png index c35ca8290e0b5dfd8332f30480125a5bd72167aa..2c92f80c5172d5ea5e83f8d7ce1dd842a9f04b4e 100644 GIT binary patch literal 2467 zcmeHJdsNbA7$#+cn&wi$O68}fY4c=d>Aa9oDw#J5Z+VF{kJp?fn&L!9Yjd-ucGDzF zauv4FrKV_<=3HV0O5REfkwP&=@q!mrbU@qA**W`rf9sIRYYU|?WqXb6MB;BdH+kKIWyk*N4V`F0z6BAQYQv?D50Dzg9nYp>S zg@wh|ty?WEEv>Aqwr$&HZEbC1V`FP;yL0DGdwcsmd-m+zyVt?N!O_vt$;rvp)fI_E zy1BWbP$)DS?e6aG;o;%w>50K$yu7>)9XjOg?d{{^V`Jmu;^O1u6A}^<6BAFKJeib~ zl$@NLl9ECo5K>c9)6&w?)6+9DGKfTCW@ctqRu+jw%FfQt$;ml;_UyTH=W=s%^YZe} zpFdwvP;lwerOTHuU%7JS>eZ`7MMcHM#n-M~D=8_VP$;FPrDbJhR4TQ+yqrd((dqQc z%F3#$s+yXb+S=NO4PjF9x<8B$B!R3H8nLiH$Q#)w56q`wY8PS zVzJrmj*gDb&d%Q6-oC!RH*enXcsxFzKQuHX5D0`q;qdVA$jFFDBpMwZ9UB`PA0HQs z#S;?~5{YDLYHE6VdS+&3c6L@OmCnu0&Cky-EG#T8F3M!GrKP3i<>i%?6}eo#y1Kfy zwr0Z?F+dF*v<&&Tnn31S@!poc468j0h%~|(#~A-E$*)X%;?0s9{k*acc1P?avA;3>_PVP0 zXs-GabXfo6D!;#3e z$ze-nI%RS2hKTiPcm7L#&buJhX3|&XB|IxV>oHW!nF3Q27c*r@sb$gdNvebS!GoIM zKJadb?35sY8wjb9zW$lv(*)>Q_tDXmXKsVjk;-#s#wFQV{7yS9aGrA^Gy6=7xk=`d zx-7F8MIGHB^p8*@M{#!am2AsjbhJzDB^zJQnD41Nq0FKMS>0@sCxE5H+Z94FChgtK zn3y)-YU&A&x%`d=>?0QksS*G3?f%gUbs2A=c(PFdS0k6}M!%J;of;}r;ELjAy998U zgSL|W$$})#%Q*qXfyf|$a|_@&^`6j zSm^y8@|V`<0>@Cs2ET1j14P-ftm`PMf^%k&HK6h$-xBiOgK}Nr#qPEEx=^JC;Z$yY zy{3}2vi5F>5}VA?1PAqy#m%de&!2m#tO-?lT6OcLv#9Mfw=M=g{?AU7CLL3h*1ym3 z75giFs6iTF&%_ku-_TQroc<5pzdA$6`Ku_`Vc3!s^4^BQrQM9;lwDhCBWSBMxZvfS zFYv?=WyM)Fq`5^&g;IB;oOhQP8?GFo-AH+5Wv(tyN>#O^afd>ee|1rZt6&#b;cm*w z_x(6#zN(ID+1(PtY{F=WU7@!cIp4XEmd;`SbUg~qqIfKMV{E%_(R78+zj%_aM&3&n zyIAOjD4IVpp3by`Nqfi*b})JuqMZq8mbMddwxb_6L`#sJ{5m|q?MAfgz$xhtnqb9X zG*-(8%=MHo?tbrpSQDp&4=RSGf#{NI$<-~W7nSK;`~z$bsn7 z!ZzP9(}p+l9%mz(XH*fI>3OngH6%!#=ye~EWNjz%WMscka9fofWOJ2HVs z&RuM-Q+L|uysMg!z-=Aif_J+g0)qF=_a!n`g%^-7$v%jP)v#7-Zrv?Sg$&5$1Yp8WaGAs-d5Es&RopL^B*<7fW>^E#m) literal 48497 zcmZ5|by!q=xAx31z|cd>P(vdn(#;Uksep6|NGYiz5<_4*nK|w)BRY3u%qi#|LiH^!Hh`#fFe&L5ZwXC=gCrKU(4FyW2L zaU7xE7rxSJH06Wv^@J!-cUmyD&x_)I+rII5W>EYdi}jtn^FwK0hJ6QgQn6$O336WP zZ147h+>d>!C3-&ga6>Dvlx3byK{`efu?Jh6)+tf>Gj&``Y+YA^ch8&&59tEyShRV! z5RF6Ly3c>5TTK`?YU|vL3cH9H?|biW9;~s)Ej7hWnZM}$0{5?QYEbRE!}59Ul!o1( za=)d=lr6^V4(cE+{Z)R)S-&XN_JdvIe8eZm(~x4F&-TMf?4O>vzZ{V%3C(nB6pfS) zq9$D^nUqghXF(;~d6Zd%zuJze9&6?Q&8x9y>_@eo$M##wCNdx9ZcyUaq1$-MUhV%4X7pl^jNYlKu{+%kU%*+38(J-cD4oNsUHp%(J>A zbh1WGkh;50*3(6eTF=cM9m)ueaWB&c4K=(|vY^;4do?ju>3?)W<#dsd>A;=kh1=Fi z{2>)<|Gbj#s*3xdTAr`@Rqgf`nTAwxYw`EuKVR^FmloHBC!9;yg|_OeJbG#uKQ1Ms z6dy)Ch&1oC_3;^Vy}^3^{~VYxq~6c25vzZo7i_o)#QaF*<{L9g4JgC7bb7M zKUY1~J2g1fJ=HojKc%txndoYCs``o9hs8Ad?bP!6qr;sbZ<8qj%_j2)`~}e;OuSVG z)b6NMs&w~dec>fieKf)FWoKUMqgS&RFHUA#%hc3ywOD1KF_soKrI%b7uUPGqYXzqX z^-vY7?_Y>(jh^1^%1ou4L`J>pCUsMxd;BRm>l5xXmQU;T8gH*t@$I82D?N~@5+bET z-b`aJQNG^a9#j7+`jzPxGuwD)_d(Lks*qnvk!jUYyPuJurnt__8g=O{zOgN2)h@C% zm$9h*gtz+8oAq!3N9>4t-bj>r))Q;di6r}?PGvgm#Zqk+*i>3M;7 zT3$x88a=yt#e6a}@U67Tdv~+t)rLqdNk)KGt$*v?q2)B1=#|I&mtir{4D~mlK^FCt z@me0|T3GaHT7s7>w0<9pz{_sZvNjx7n?E|Opy~b0mTzT6i@U|VxF~lCvmgsIivWut zi(u=EFXU;WPk+2x_Q(@h>YDu^KrIgj!$JT13Lu8VJS_ z6;}Ci`wveAK9ivg3=Fo|?H@962nz_v*VfiPAFdk3g)Z%jtscJQqQI9)B`UO3w%ndB z_dHzFl;W9{J7||_I2(xb=1M+jcjm{IguH(Jn)T$Pvxw6S;e`*%(#y-RJej00@U{?= zUs_u8#qS^O>KizjjV+RC8tM2*{`Rfo0ZX6%qr6*42polDU+q@%f6hMk1o*hI1#*iK ziUR%5g%b{f#)FNWGr9h^=3t%~=*rBo?z2J7gg)kj(O+&)dr&4WuwZ$n#B6Z5;TqBC z^Al#RN1WH}$Z_v3QnTxv(+qT30(2>U0Y%|Y9xvP>7}7eUlJ)iyXP^ateASb=rS4BM zXi0>y@=_!)tTK<((DtWUcq4*n_a{ z_gVK&+XO?jso&cfM<~kAmF`*B;zW;rHf|XU#!DHc!k_#<&J*Cr4md;BL+W*$|6_O= zz(=|s69jJl9~VK%lA}Qrqoq+ESpVDoz*(ed&{8dSyXXH_6)HOm4+Yv>pXzQ1_}_kp z9)+Pm`?Gl;wC*C-f9#0*2(zCR2D4&=^G%%4ZgSZVph&c5q)^X)^;N}MRRInF zS@**vQP~#2AvWJ6cfI^qL8v?AXgq^El?-ddkP6^$ZXpCQa{qChZ*rCjScy-SPd3P* zs5WKb#;5jo`6>VP!&`cgC9L~vufxdCv(3R`yK>ARuuZ%H?K=LyCXr!7BH|DB_(^?G zK8^CJR4^}P5G4Es&p7#ig|CGQIB>;j$K!zWjRM7pq28f@65kndX;A#@yXSAv_9!)S z9yF3f<%UmSgb+FnNZDTS-*_K;1~Fz=XR}8&ekM)@!8`+j8))hD-1@JM>!Ct-+XHdB zQb?Z%qFUjAe(!Kc9R8b!0?gUtM;{6y9fE)UTD9%^A=icn*hq^rhv>f|Ucg*o=H-U@ z2YsBGW8al&q=V2d7*80!Z^`^0Pe_G!-Q>{`KX8b~jyH`h(nDy##hl=`;Fu7#$#F~n z_j`*EApF|Pi=tb0sY5`17z5*%rzuw%ahI+(tRKtg6 zB~$DRouB&Cwul^i3JCR0^VU_+f1LX(8NVYc92;(<@Uc7OEpqG-kml%;Z0SGQBfA&x zmM_XOaB4X!VlxQ!2>3lhP@dpF*(gAStjHd<58vpSm zoDB3hw3IHc6VJEm4sPZZ2(W_yC@T8Fzh?oIz4mTarv*Ors{rfV9;|Jn{G6_tZB*78Ad z=~kV#2OQ}%*W3d_dP5fSWE?GZ^26h(oy0F5|1ytxwcw3;?&EhaL;Vh3XBGKhg^@l6 zlFdH>GDZmAztLg)u&?!j#}DxGr6-{rv0%WJs`h7ok2}XP%2otNx4b&3IPp5(G4kFj ze!tO|z#=3fQg40-5^1lN9~~Qe-;)<_+&c(|F|Zx!kgmkk8D|irP}QUkwJ9ISy|289 z2RRT8`Ezh`zkeagK2`GS;$zY@Ck^)l)S)P&?6B7F2Q}tz&ADaoR%Jw`T0|7GP!PKa zz20?}*4^5>YN7RiK+6%M{S>cnL9bZP{nf2+7ijc4q;EV=S@qg?LxIs)R+<#0^;Y8E zsLTaV_p;l0pR!EuF)uG~`Nvm-CiC+C$B+H%{h}vH4)SDVWPX1T|Mn~b{R3UFm{YG# zu;^~M90hq3misac*0+#!`Fi1tR!Zx&UA*6kCR?Kmi8-g(D&I-5jX=bLEP-V~2=)L+ zXvyzY@t3!62bzTK?lPklnMtG4a=&RqS5CCe&GSw(P<(F$-)65v!e==dulK^HH1G4J zywCDWuP|+pmwfR%KOzF}eDvmW^pC>RAD^nPXZvx_5^mAZTk2dQ3tm!6JW}vc6EC$P1QbV*}#KRW(1XN06Jg|ZE96$vN$FVt7 z0qa&7TZSua|dMNSWI4S{SGtQQ6va)gKJs%S5MIYQ|9j`N^XuXfB5g<#>qhvd*WBQiRLn zTr9QCp6~)$&$sD=*xkS1PeDHoOuplo>HGEj=kf0#a{hiS`AobPx)^4%X^;h#*q>_* zl4_lyevFGr8t+KqU>jy5R!#2LsgD2^QbRQ~t3EBOvGP3EQO4vSNyw+5qq)STU`(dU zmWFmgox}`sbL=DH3G$_*ajR$408(JCSY1G#D0btSsSX%&g#z>_TgE){*RB#M)Pa9E zC^6iX)7%~F;Ghbbb^$u`4bNuN?J+i~-0qQweB(e9|qesHcRDVWvuBITOW1dvmP8APPQ z$jh#Ujq$S`n2KUf+m2Zid&)%;=zak>0564&XUA2mjR!Z}Pe{3)In{Dgs0usaGv;R& zyc}9Mn4gv5*)Q#7+%Xibnq`56E4C#v%OFLmT`#KIL(GWr^faor6!r#w4nVnMq>#kA zxiqjN3h)m(Z^s6HBaGPg@6a%$p7BqA9u?@1+il#4_*{f(t|b$R%HcMeMHHszj_wlS zBFxgG;IT&$D(;a&&%@A7k~%k;q9cF911Ab7SBM+(c7=?r7rws-cMicEo-^2jyo&UNbIzF-cFi0eAVb@+9Nh@DkoRK&LV* z*^)zdpl|@2(cvc?m^tRU&_MuCu)rXUCXrMcOm6d1vNQuZ+{a=@kVxaFtbqI1gt^{G zXD~=0bRcS=>OL%H6|RITF)s){5YrYIEdOvY;`Lu7P5{ZoQq09qHUf>CI-(T6_EAB& zE-Q{02;LNHAPU_1J8QCI9N$BC4$!WQY9KjQp7%oI|34m1=g1y16syiS0H-}7=b_#r za6`p~s8bjb{NN+?VWYTHlOx*7AXX#aHVuu+NIFZWykYx`Pyk?_-#ShH7)ahANFkJ! zps`t#FD@GHfN+S4D*QFX6~pB9=PKD0`6*;Ws_IEBij5@vCA0h{DI$LD(-J3qPZIn? z`tq}UD&t=zpit^=6g++zJOx6xV>d<=_6-u@1^^O$5TQK4-#%ew`CTX=5{K3CWpksQ zk(UxCYuv#^my@)c2qwBL)v}j@&0kLLh)`4xfNQA0>bp|y3kd{@?*pDpLfz@?MD5DK zOvfhj6lH~*ODOmrCZl~eLue3UY~Re1onfgOH$dt;-GHMQvKXW9gj&Q}n)^oRtUb%) z(9N9OX{8S3Z?91dqDPKRV!-Utfz`p^u#QGgpv!ECS#> z2Vj+%hwwvOOtMmfvaaJwUJP_*CIO8`SO-^P{f93bDs}#BwAnUqNy1Yte^M>Mkcc!4 z*mkBHJ1dIBfxbj(fOE;9-l?G94ARYBsS+6Th%sfCR~)>iBVcMQmwrsfqbWwx?L-y& zFxRqx2`$zhCqf0KOS5EyV-G?YOXRZOW1@0%wQ~j2^|gV)s`6q&imbPXX4KM#tAxTD zP#T?kB^n!mU0+&nzeAIua_@e}N}lF>V;f`kj6&plP!*;(Jb{Y*R{EU9#SZ(6JOS95 ztZc;#N%3o*G)3O?`#rc~6RRW=lrTCT0TJFUZ-=1EvJg2JvtyxlhoBZkgY>m{B9Qn zc8N+4j1EGzy$5b{>S@K#i?P>UBsvnU&w*B9E$iuru|cL?o98d@k&za9@V6g0#^6*l zCgbKO-~_iP&5{Ji6WGA-kY;)?k}ndXu5Tk+H|-0BUYQC$`kA_h*C%0Bp1wZQ&r+@R zHh=D$q1H4P5&;)!7pUjeev;evW3EJ^Hm%GqNN9+(D!Ny#No+lqJ6U*u3PMpj9-I0{ zaN}7=Wy;Ss!G4=!DUtb90w)w?srSo@V4%r}A;-tA#u*0xhjWh>w)y~WiA>mK1M$|B z|CUYG0H{H_Lbvtnu5^H_myu}4x*84{HO8?+NoCm)aq5VMFoLo0=(Z@ag&e+x4dlJ7pl9uT#E2pDSNo?(~Z zJ;42ZJ&Sbjz+A%cMUHu{XOD{ViQ2n9^07B1ZmC>9TYP6c+B!@%rTv zz)8--4Q4eC1X-)mC2PU#GsCNPI0^3vA+@}6iC{-$zzQ@;@3#sZZ5c5pgl4Q&w%P9DS>BEJyZ53X}Q?Wle}Dj#SEN+ksk*E99G-gy!R;t zuQ5Ov{03^+HpV&=mR3x#PI@~o#>h_bP3Qg0UsC;r26p#qayoIlq6xPUWIFP9FZ^#M z5>(g-oxjhDnWitvwG{t?&Qu*9Td(k~t{~9^PI4Lr5X1iExORUl**h|wYer@tL)P|M z!A@h_U!hWrk%gUQthu@1pE#Vz#YD6bY@U|D>U?%qEZLDyl(JouZkj%6xwLZZp^N{Z zoVpOEG_eD!n#+%?#^k^3VQATra6{{IoZ#)u^MIjsYR3*F-Y4u5S*J%o=54k@PW zYVt-SC{N4b#FwN3@Y%3 z#kEAn));>m#rtxT{K7-z7A@v(sI~_X0B`Ct20moW7rLwZZ2(_ar1W9A%iC1T)hNU& z!FCwHVu~?avI94!B}_8Hy8kG!TN;4mxH8D4oBeMIVH?T%Fk~zhBnFkO4xHN)Pb&0p zbEO5hXGO!;tvKVN(;elKaJrbGl|#~W)`vbZELQD=rR3_f4rnmOa6XdY z=Q7BNf}JpsH5PT#5T1&m*=tV2@4bg>2>A3;f8CEF9?CZk9$t~eT_-4l2^baN{nVIx z%Irh9$$$U6IwL?sht z0@gs6C&l)t9nGpPurISvAu%OU-)+T?lJ4+biU;cFOmrW45hEJ*9`^~UgKt_2AgLh_To?E)Qx!kZU&!;47*g9 z-P28qktD99orLvx?CqtQF(;3BDq%WcC(m>Y#Y^7n_4gTa5Cn&hlT9ESB)qlL)Hm707?e7)Ew%?={;YyemnPz`8^Q8662 zj9gH`Mf_kR`@#Np`MnYa01;7xHfN1LV4bBFE)(7M&3zD+XMFK$%pExFhC5gSpV`qW zvSG6%P&-3;2sZRmIlH~Q+n>BA8e<0#G?Ns56X!10fhXBPL{cQ&IkBK3D#1_8aikPp zwGfSxQMOfJh*#^Xi)_eBwc;%-Wz^18Y)^m07{4#f2&Xwvv6gj0jiklIN&tY8kG$xb zVE4d=UkXzK(C8OXE>#$stRzWbs^R~K#DpNdQYBh1!dK(P@>u^_S*F;<@FG5pucT8Z$j$zmIY1r;U0O+v*7U*<9E zR!xZiP(!$NToXYMPIsfP8EYP=ReoIg_NUMXVV55>Lw5##}NtYI=7>JnaZo+NWp{k)2@H6BXrd?=^WDLSYD(V9EX#%an zIUj<}9GlK|FU`^|xKyctER!IwzAKia z-nta-habBU2>6K4J*16j#^9SflXv{j)Cbv>W9gXAFqj!5vI1mh=Q}5E-+39^IPJ~k z+Ims5LoFF9Gu_gbAX6~dHd%@3)l6?kSOB|aAy`*y!wIshBA+=Xda2-PNJ#`ExWmq7 zG4P-bq9uP8q}-+fQgvHWH(N}8^6qN9K+7lk$odVz%2U60)&aNJ0;hBrh--0H+}98V zk(-Ua-mPB&1m*b-T@E_fZoS@Sy%~8YtxkQ%JU{Dlg=1R~_(xXt@d&bcP6F-&Ko<}& z*n>01-A>ULr(hjPKmNK}je?~YEB7agOa~IqgsUP_sap?U z+%B>{ptf0dC6%W#B1jB3(12j;iMJyp2pHqP!3-t7=2!+kSNvGRa{jW>|FpF#I8KT{GzbZsW(|EGk(5PAe75t(1rkWV>o7 zor~oRcAGxo80TRX|pXOTj zE8YX)weE2b?9p!e=;kruYHhgF(T#^dA|F81umqZamRb?Em!911=!f0Iy00(xJ|;!r z1gxtHbD|sj^C*th5M&h69Xf(#0^h?5*qR}r62y0dAn&$%Z<{QrQS+H*cZQKnp0wWh zp86Z^$qQp#;WPl9!D%R9Ax$0LoDi$5Mp5$ex>kZ?4m#*4yCv7Af*Q0FBk2pZ8yWiH zq7i~QH{hKq2>3|gQx$o8y2@Oz93Py8+y^J%DUipu>(eyF=n7x`ZU_rKEAJ-PmI5Dg z(;9rm#^~4&iFApgS8iXzd&9x5Pf=zY>zVFZbQOO{Va3+XZUW%IU{p8WTfv-4N>Ws) zQ^iLh{hX)Qs4E&~1ncaY)B~Y**Eda|psX5^1z^BNmF)A%?{>_)-ZM=buNE#Ce3xk# zvaPFCc3+OZ+BjR!`X~-*`X^mCDxv+~*ZF9P|CV^GAfCp$^hT5W#pE_=L?#^pIS)tD znB80S0eE%{oqEsofeccZ-Ov_~{K;zY)5KsMMweiPLoH>I$=NT_<{|&O5*bP>OGYy< zFYl;W+c%QTIq2oa7}NRCV;L;Qc)mLfp%|tB%ndPiOdd!~WvSUOoGmG@Hors}7=cvX zDVX15vm0uu=DdZEiIG~(#)s=Tpd2ec>K=oQ)bwR@zlQuw<}`dn#cn9D*0K}s=S~^B z(Sa#KD9nMal@t^dl1A4{kKakYh<(00Z}vYVj^gVsLB}Gsh-{<)5(Te(?Ur<#eK?R1%s#dS~p@y<6rEUN-i! zzW&#}`n`(;K%kz$#K=&r3%$KE$9EfjFGQ{`T5lxjC7(yjoHUH;X8yWc9+~=tUd$B@ zv4*tWi*0dR#-W$?*0a_7C_((^pI~NyTbjI7{jpXLF#D^aN|V9>JiJnYh^s1wLm;uR z758T^QI5h$mdr2r6Uo=aNOJDVs-*D>=y`1#V|3QT+p#y0sfgt+@I>|;EId3Rq zvkkb>!DoMpOdl5784Aa4bh{^{L~++6;v@EMX@+uaIG+c~@YDl`HDg^=!K!(&YfhF$ z(vN*maK|^|`f~Ip)9+B!|Mm5X_O+sTKJB{y<*D10R_yrT%;#g_^QhKS0?Lk)PR46~ zU^q7pYi&{4kL#muJ-s*Od~VftJ z7L*B3t|VuhD82-Ku=VtA(XJ&?RwkYdS)%l2Jwwkv)#q?pId|!)5#6!p0G|;hz0z+m zeY(!S(R2?|qh;5f0Aj{f!*%glrd7R^t9MzbV78V%T?~2#44e%6TSoa)r!bhNRoa+L;*jQc2>b#fT)nF%v z$K*yPf7QrS<($y(BqYH)qx~mnK&%y)R5l)ExeR`wQ5AmpeWRCPKV*qn^Bz0G+`m^T zb}S-!vi_INTUUA$i(bF)L9N`aMGhrT1ex4@yIEi0ZHpw?8 z)iy$*iQ?tp-W&h3H`}=3ap4(cR+JUZV2T+0$X2}Y{&$M^Cx;I%rN6hod)urF3?O?t z6G!i0y)5NxEjYMvHpnG7+$oY&Yhd?dd?Qaz@%a$KtGO$%-B?l4MH0VhO4r)`%!Z5d zz`$(!cE&yC=C&Q4?z2WSvnD=j11t)BR?au(Oa4=!FlNMDbH@6%<1!*Hghem2N&RK# zGhf?HL=27+aJE-LO&b>kvNcaQ`cqaC@Y4{aw2;|KRSQl5uVU8e4`eV|;3cgJ6TgL&<;v* zFlAOnpbI`GM{hiSKwZ=(!@?voi`j(RU;rya`hc;2X|B1jvJlEhu?wc)2k0#;JtuiKItT*gFjaExYE zNg})k>%8h-S6zZ)0^g{?#c+`+GKxUIYmI;|aE2X{GVk@kCNVTfm6B*%$2#jD2ty6~ zijR~%ACKFp&AKXE{qW9v>$dknKZoW?R9gvHl*)n{JX$sebNjRJkKG8zt~#aAQ#AIEob?S;Kw^bFU%d#ju~6RytNB!X?JgeR9g7 z#1pqi!imB8_)MSCs9rqa+00_$tzr7&UVGV7e3RZV#zI3KJWOGKM-EWkKi0vzB*B?8 zEUtelO2s2KDcu7;$%~}M2m%v?CxQC3feHN3by6s0qS1!M7KiYnF z`uB{;MJ&hxnq9unxX(jW@V*SPS|FL7-H1Ry{ocszN`4m$Fw*RB82cU$x{shY>qW|u zJl9Smz#=o#45Z~L3=|SKO^{C__co*8d91Y|u#vK17m1zg$>b4o-2I|*6brMxBB9=v zfTKv(5{{Qr-S;ARQkbm$G3La3xM0dcy$_6+-+$HjVdXR@@M&u{xGQQ`(Eu#Pj|qmh z;{n{RB5-wVAe*NmK}}yj?9Y9zz3K^E4uNUl)WIUbh?aTBSE+T#rSMqH$UqtrD}-E% z{@mE8rY*G(l|KIZ$aAR+&--}xvHsKe-@KdSP75#0MCs`cigl|xnKwBkie z)b&Q(b-4M(x0#7w-#>mA6+8kw5-|K21-L(uul`_|;wt9DE23~Q!rDU#eArhwu=u66 zQ<${o)Wb!Z<0*)Eqth&GG)R==wSGt-)U);wJiNb5NDufqaX0rja?C98H{A7zn)@4Z z1p3*{)yd?-)!f3k;HXqya6AA_4(EVf^1rMvyoyyvRsNIJW0%=6n_m2|3C$Xj&K3*> z2kUf_r_k4j0w_-LLXM|4vbI5=MiuCjx0ESY!#@{--L`L-mUqIR=tBlqcZ5r=bV+~% z*g>ZJr>KI=8a*TCFV{pL0NucPmcRK~Af1d)YKm#F{f7<2)IV{|KyE(`RloFJjrrg% z&&bFzu&!!iycw_kl5c;Cvz_teXq7H-pif_$!7O5`e#0!Z&uZoy%K8q^~7~?>on2| zh4FBERJIX^=iOHPz0U05FUc_D)qT9)geqWUo@yynZffy3^<{ z>6SFLIZ-$^%tCfEA)7LQ5%DE+F~q-T7@7rab8-CZ2!p-m_d-R-WG_2qU7^i{S5p>O z$!cm}-#R?f`zModLxvquU6+ojo$t1~V`x%fyfk7t+Z$EFOjYmNrRa2DB{yWnU^NN} zOrcdoJk78=AS!~0_|AwcpfM>UE!n{{)v(A}4HPV|^40#j%}H2k>3#Y$Y)bZwXS}it zO7M3p0oCRYO`k%4`JBL~2~1BPCsZwE@>l3gaAwSKIzF1*l{HS)?S-kp%p)x8>^ur^ zrK)Hxgpj3WY2=3}>2ggr+Vc_#jm)v$j4|{NNzeG}wTZ_&p*=G2B9=XW^K%Mm0e9J} z_WFhL?_u~apmYwXAI~DD|1swrE7B!>m1+11PzH9;71W}Lc>dNAd|Wo##u&NQ`MdR4 zs%;xLOdv;Wb3x8rBZ7n1k>jK-`W&7#j~{wUQV!m0Olh$a;n_m9CAEbd*?RkJvQ7FH zd15wECC%;svb3K$Fqt2QJV0?0Z+PoM`gY2$>wZ!-pb*T64V*fNN_m?T_G2F1eC*`t zstI7apjvw8Fk~%rOnAD3PHiXewX5RCj@WYq#G~v<#`5;Bf~nU@cPJf?mr6|_ns`X; z=gbO!R{-F9w*x#&ilvZsF8Oozs9;4lGAbdYObb_|3@;m6h5fMZKKI_%pE?uD$eH-) zs?2Z?_9LLso=IJxg{%VE9?@9|mOXG)tn7~2rGnZ`yh&PfW){-oFwi#nAYbey1$r2Y2-w^EN|G2~*+7C}eH<;Y>Q*d&auOV!1A?EWj+G5yY&u0Zfy{lkfT#SV8) zbQP9l=2+?8&!_-k@6(kyo@hAp0Xfe&nuo?0#Y%XG;M-t`{y_4f5E-3F^wQw%@d8P6-U`P z*0CGjU+*C`W2S0{su$&?k^<1hP|TdWH1P$y0q@?{Mf7)LB3QSz+MsBw_X9k}pXlXi zNYB&TMcA8`K6f}+gJ}#XZ~5G1<9`j1>(9IDCv^DRU)s3Nr3ShiZmNLfnB~KS#{aHA zG-_ne(jf(YNs#kYlmdld6%v4F@P>L}x09POJ`%@9xKy{8CxGD8pJ)K)grb@Z?WLUl zoooa%GHjXCBa>ft4YLZh?FtyBf*M4YdWy(v+x_w6)t%TFiiKpi!RjI z65L}Z^B&OZr$gEPQR7-{QAY`Utk*2CW{uz#>Z;Q+j; zuz@(mUP zu{Vt>CM=T_BnA}=VM>d*)_8+Ii2-zcc_}4*(8uDr_2o9uQkdVo8C<0!4zl|vGXSf~ zWjKoSD&z!A)=IWK1;w}5WspA3>BEiywHu92>8~I_+O7H7^{Tu*Mf23+CbLjS;ik(~q}-t&@NtvmLRKnKfeuxS)qD zx1z#$t>y0iL+*B_XK#!Ng4TV+KK!#o zZO;KrTc(xrnchD#QewpqE0z-2QXybY8w1|2xV;Z{e%yyulZZDF9|Uifk9eI@OO>w} zrQZ)D7aC0~=I9t+1&wb;VO_L$F+As#DSc=~0C@)G19*F1pmQ)(BmgEyETk{8=<$$j zvA6w!mD2OK3upA+8#!Sc0k{l0H`f3gIX-9qPeMhG89;{9Ez7Gm^~!I;WOU!#8LB82 zk#|lLYPJ99~Q*^9q4hmLBu!HW6Q^6 z%R*#S8daw9j8$vNQbOt9|*uf)XmoRZfw!p!TF)TLYd-85ij1boxc z&MuUgUP2LGU!o~dip_(t$mn46ut=ZeqBs?nF%m&`)x)H22R;NeBp=L^* zw)pn8iBONmTG!5?F-v|}6;>m=RoOIz=BvYxAv7mryfKlANH;{q36Ny^`cyh|*(%mo zjmjbQ2B=vq0RZuRE;H^e)n;cnT1zwScg!O1rreeQ5)ctl`b)lh&wq5WFr(-CH#n40 z>Y~)x>I|^=%J_xk4`;{bRv=av*Q6(YdxekkYGh%YHzXr$J8RJVm zXybU)u<)8w(#6Xyv}tGjNw-*yspM?6Z3Fw%Km(uJ7)vqZk(-g|ndMb?Mz4 z0G!Uxa@zkTsF7oS5FVucrS_=EFFVwC(Ftdf2U^6E1l_a%RS@gK`?N5;URnc%hjbE0 ztq65#jA~N+tx+9&BTDWXU=jWiPPyrIWbV zRXdJyKd~%s@VT8IIUwli3$%T=9wb?Qx8BD-1K4AQ1pqS7#f1KgsGhI@e6GB6A#))g zpE^s%B|x+iAYafPN17suNQvyQ6o}(B%pbJlhnkAzM3MB7DUVDHnu;lt&&KR}`_=-x z5N)I_M&4JiOe>P|XlK8F=#|GJ8-wiNx@)9a{kaozoS6n-S9|+#;oYf{6OZ+g@!xZ6 zB5uFZxV-;u4OoEIU}GL^cAg|U@!U#RpOpvK57~!p{ZT%sY1AHA>Ux?fY|BJ_5M-J` z7yY_&Qti`ZgJmc-oT^^DCWU&{(wcE@1$VgMvW9vtCr*aRHQ>-cI!x(_=9OjW)DLSH zFV9)J)#HOSLf6@9} zLM&Hu4BZATeXTw(_(Gt7ov(cr)hub z*dB3vM*1@4qU*px0wJT)O{F}*Za0^uk3~BNC%%yJXbRLanAqqd*$GjVG zG#=-dN)SpSm2Qi?godnrvE|3Mp>@g!$1R5*d{PlK;W=!tL&434IQnz=*S^*$>psC1U~k{@J^_YF=Duy0z#H4g;};;jX45rfPau2s66b?#p$9D1c|K zf94I4*gSUrjwbi;JFkBc!FaWyd^9`iH(m4b{X6f-cRmNIgI7;qbS?je^x}%Y^Fp@O z=kvvRNZ$G2@)pfnnN&CN+OU3}#TzJShCI_FzsEn~LRs-rE~RPwZ&)EIB2uRM>o!HE zw-xhtB&>Hze}DQVsbXT7{fRY~Qu#%cKnme_K@-!(XP($!GmdA!qN>v3opI}+2iRPd zW*M{ANj-__+fFvthIx8S1HGiY9#lsy0j&3C@8<7}3$|U6D{n50_Xm??KF&}j}i{K;ke$7h&wDnHCQdjfuISGa$fwp;M{XlzQXNSl4`Y`K#S{jY_WX8N=>mQTW zd%z&n&R4{YgE}#TS=8bR;^{&6?fE-&b8#|l)pz0Fml}6-F)JuH+bF*;t36Ja8Tb_y z_g`A)mW=eL@l>ST?uUd|->F^hA}sa1prYhpAAVliXwR9=OewrISQ8}kBZmMPG{ide z8PV;kX!a;-r@s18?%1ApX$wW@?Ac|HPeEM652+aJ=ejR#yPwI{U2QF}P!!HZ(0f{M ze!wp;nR&Er0lc*|#Rp#T*@6&ZlL_Ur(V9QP&3mPKnOIR~{=R&C_!@gHFHL*`xAH*q z7mA&E*>!}rk97<2zi*5+ zDg!&!zenC^*)?^Dqn>N&t$Pbd5^%(BaFM_Sax#9>ZZwuiA&J~a3Jq z6P~xs0d^0fl4F{myu=mL%c0K@Pxap5*=cDK&Wf`>{bxe<0Gbi7buxG^I(!A|taA0u z@bjFJV01aoN|@{=lkfRtmO)rVTea;Vl{YYzRhg-@c)0e^;`-o?W}_moZ->dAqOcEw zgq4}v4vvu!qM97#PRf3TL|Wo|Od+1j5_`+3buUqgceR{;*AUjmXYxWflpGV}5z59< zF&?+(U-P}HcDXKDk!wt9kl(ZpU6ND8`tW{g;nib-Hyi$QM+@{>E8{r|p4>0Op03+D zc-Rc=y9Iq4GXRNuZoqvPu^6jtSafSJge-7f$^o-Vvfp_pV!kY9b{w8h{N9P>Lf;pP z#5t2KhDQw$Mh!c&)==TYI3cq<%JxyZ@9yA{GN+Sjb^7#2R8G_-3u%V-77xud!sg6V z6888dNwp`_j-qQePikC_rX-<}WwuS34Zz!qO?284WZ`4gE2POJE3KNJyZ;I`4R!in z|Ky0ab)R-C%U&iWC1oS4yPe7KKmQlN^=6ie5KD&0lU(16VKFlrxOzE8k~6;r^L+rrhoycgVOBDsFqITPM+v zyYQ_$NC}lxJi8;9v+W_?frqDE-a)9oemC5t-;u#Kprf39nQ0aGU;@eP;X6_fg!so7 zpAX+2&F%WVnct6nQ8e}ugQHZ3{-eT1ZPaUcGhKRSuI|Iv{ccBxbgcvzPj>?~fHnIf9wle+;lZ%C^= zDXasZ@xFS!c5o=vZWqWojp;d9e_EuwJndm#=)O(=Z{@~?ex>?6lr}I&^&Z%iZ;fTP zDmF#NKE31p@$2zjup5f{hU7N$9=pjGG*3a`05pnOx8Tp=H$tb!&XQ*R=DW+3?Zv{( zNYbhw!HZKDQ2>v>J0@o@=ZO?CQQmFtnl()%mD%qi$KdPn2y%{%*~eMHi>86;{h_?i zF>mmodSOLjRd$!MU)dLiv2tL@pUcOsS9l`rYVFX{M^3vZ0bHb2TpezM?1p7v)w#$C zY3D$;g3Md@V>ecRT8;AWL_aN%JZlOMUj2VmorPOeVYl{a1`ruSkRC!px*LXW1nExc zkZuH|ySr1QrCYkYTS~gS&-Q)KxxVZB4`%l4d7ib_ec!)@Ke=`&C09j~?V+uV{Vim) z%4g72!!FxRS-Br$NH|Jg$$OV?J-4C#y4>kxg~#Jx>a#zZw0LrIQg|ca@;}|LKDIe0 zT+%cVi3f}fc{K|d(|}j&ex>Io&ZBVOGt&1KDs8i|GRw} z>Zgg>qe#=@&@GP?Xp_!g#S!&IWD{3qGe0lLSQXEduTHyH>OYIXY|;ITCvS5+s{47Cbqr&a+T7KD%U))AAHLYCBc5Kmmo<&^It%|PlU51 zW1z(el4r_Se2Lkj+ z_St?2k%`ak51vcy2HTQ}mJdxEIseW&z-AK#1X`Scij{waYX%xq+lwfR1RVGo6Abrn zR-)cK#yEiVXc^KCs*wUNjNg%h_hTyED;@o$8ip_eM62`Okifo!4Zr+muH_i}gjFWY zHxfG&^KSKJ$-V$KH7iSv2TIAZvC$n&OZ2u>?*mTd)Bnyf_ZVRdVWpcJz9(}{Y4@$P z0YhPX%CZ*M5^h05k13QWhlI@)avBH(p_RQejz+`JC@u)zN)STsTPqFkkjep}`7Q|+ z|7|(-BvbssRAUqQV&U%a`lGege>@rpr~QD{Ax$*&EfKe(dNAsLhTMK**fGIXQ$-f@ z@GX)4AK>?5tHK^fPhmIV{rMpk$$54d6WnOcBti4#<4Oz(idABPzgZC-;xlk{<*LNs zKNA<$+@zScpN84w>(f8~Ock}4iw52ppp&Z=hq*thdmYvY9OpnFK!v9yIRn!?r`7%A*q)1vNHB`pFvPP8o~6@cxrb0Y?cRGZ z-wAMqB%zhE6B$Y47e@J(M?Fmy%3k?lctKG}Zr8sF3B25G)iyS2%%l8Yt1X+eC>Ah8 zwf@DZku`X;E(q6vQFUs+bY5a@{$K*Wz*o_p$aOoyrqb6~*!m*siF^G^!i2ToySeVU&@Z`HCyUKY+UX5}~7)md&ZzD6W4)ur;+)&eh4WQM&zG zR>$7+=Ft5HUYLd2fX-LyqSJ)6$!ELsJMwWLL?&8ce#`|w|feZ?P{5EC$ zl5FU<6X`^wQKYe;6H}Gu?j8{T`#fc7D$XJvvaXp&78-yE+k-RVt9sxLO+#^043|NO zaibRv-yhnNZDEJ7o+!A8b;Jo%mMwAY?Vhsj57#oaFUKo;8QjriDrDxXOg=(TvgE3U zGud&VS?+)Fm#U3}A8zX^y(8CNUv4YEz4lNGPVVd*yZu)Jilc#&2lNKve9+j<;Z>07yv#m5sN{cqElQ;MKMUeEpbO~Zt$ zAuYoJ8qHybl|NENi8rw3U9?Jp7ebrlSC&Ad@kK$bk#%=%r4l#A9NM=KVYS~EgcQI% z!W0_ZGJM!kf4X$qVzj(pxTtPfdfpa|5`r>E*hg}H^u}2zWtP02VoPXH0G!@Hbb&RXx54rT()vvw~${6 zb(?SeZ$)bi6iwp=!o+^eQU*O5MZ`ysTdM8`ckeSb1Vs0Z`brrei%3Bbf#w7=JBhuXx*re1 zr<2ORYXO@gKY5OWFQBmxPYuE6W}&ZIN^QeclW%oA=y(MBq_s*j>At4!#$zKp6&4zh z^$-GHU&uKbY7N>zGez^AUo9Eo!~5kk;0A2YYTM_*a{{muc&y1haC2`_E#AG7GnsN@ zl5CkxPNUAc3F}abOD)}*(w_i0f78$ zHMf4fPA)5iq)F>ud3AY!^!6Ja+Uknr!PHmwK0gTMaV(@=0nr~O?m`eRWW*g$LRzjf5ZShgnFkGMv$9APAZ^&gsQDc zCHF5N)W%TTd|ABm!m{>H3_?kwCG1euYjpI_|ACpww07oYsg=|%S}AU3CB9Yk$-25x zY%5oZ;EUvyCAyR+0ytoEcJTI9P2}t((i0nYSV|Tl=2b+(i2~~yA5MxG>s38u_0ahS z)_u6Gl(Ia=W6JYoF9F zrh7g{ZI**tS*r`XeqHp(yx9TF;~2f^2Ba~Z7SNATd-H9({v_U#P;vwJMED*z2VjQM zdV#tl!()8?`&-{?E;5s!)g{^W#MkwcH=%62BSaowFwHgz@TMr z1yca?3$+s^`PJ9N<@wn+R)Qpi?&zx_UuffX&z&GBow7v!>Qggiza+{Qe^{~7zVlCh zX7#tuXCjFCAb@Yk=jc~O@v!p-0sM&xHQPmP5Oz}@kcnt*!{nxt224HNuM?_0{s@V} z?03pSM=D+9|Ek_>X0`_6t6?yb7rlWa!7^8apE@A4;FG*UV26-Yd?jod+TGW23XM8( zBeofo*xz)vqcBwUf*O6aOiXc?cB(ZE7yC_Md`U+u10Sa+D?uX&*}q9KI0pVtrpcwn zQQGwMwCL$~Pqq1b_t2$D*UB5<^+Q%yAes<|iFGjGMP@4_(GiuyM`)!4qPjjHM`f8O zA{v4)6SUM48$|F47Z7o`O)8+X37==0PRu1bCRzRTc(LWQQPD8zQ7fl*@4NTc#}D^& zcL|qYRz!%UDoH6FG|w`BbRNhDwSwWX{`5b>NnUvr zfuRSfckL1g;7Knjo+@#Km^v}J_H3Sixz`C?xTl+jqt7s!JCp%&S-FW^Q-!oq0be%Y z0R?pceky79rgnOGUa#Q%a{`5I z?8;}HSV=?hT}o9S$=tMYpbH4H^S&zLotDP$^N7I3C8oWO)A{7F=JIX|K!y`;5vS1$cvY8 z>GZZ4BSgopyBZe}JozuX{Z5r!kL5#Iia}jJvY5e9giRscSFzix<}+L86a8@NB-M+u#5 z*(E(CFn$b1M#)W^FpA*WweGE&03U+=XYIRk)K)A+;5Q4||6`s}lPgQ3XD{-}lbU@t ztCfcCB zB>3PH74X4dnseQsrC|;KpC4F29Qq^#+_%Fh2ZE6DENgL?Caa}L)ZTC%NRhRdlKU~L zu8hggUqYwD(UZL`m2R8@`4}NwR6xWeMDA;Vd@LRhjvX*k0LfafefaBZLxYueErUxC z!?ynw>h zLeJ!Y0L@?l{UVOiLlm@y!T{e-^}^5XhatPmnsGKCa9jgc(yI}+@rh497ueU8{qOHh zn;RBj1$yW>Q_IxXk0rVF*2}PgFkI%pg9_;EO?B2pik#DkiIN6>)y9VIEF6bPslEoDc11tNxyG)emkYdX`rNqkF>;Xn@G zC=vSRIBQXq0?04pyNbc^c;3(pT+b+9t=+aKzno#bDv}avCnHp>pqEoa$^@=*K#+!| zQo%A}>~)}iX#SM54CE2!e9Zx$3uS)@C7;+i8SGn~uUVoeC&X*&98Cho!F#RAu~l;j zF=~iwDlGDg4pD5m(PiVVDyaslB*shlD6+=E@x&RJ#6FP2y~hJlGY-Hip&iPpP(-lJ=e12O6aLij0>4iUedhd^!O)FR+IU%jrNNH(2jB`J4;X0Z;seT zDv7&eCz=uCMlMV%?yndeAbVe50GuR46>pPzJ^zg)M|64E>GbU`l}O=m^8SjLAIXw~ z{;a^xi)e>}Is1-7AlKbFB?7Ap2W@%X{0+spdfTPu zv9HTTFsm6TXHVS;q{M|Zj&B>E_%u$fkH7OPi;-V5UEV~mh+b|KepIXL-}E#?8DRUv z{d!ZU#rU^k>RCH#a@+hd`vbK_+-9+{6CbN&B>~UO!HnnTomYDtcZfmN4<~NCP;Pmb+$;x;``58NLI@_Vt+$Zo5r{-B(HKU+%peoof;TGYCiu z@yuAAOg!tNrF6F#RR%CTV%Hl7g>bCkI=G1o?Sx2+8rm#FMGJVprBt0vK9gVyBJJ1> z2@t;$k#$J|KD@3cekE=Z{N#@8@Ddgu__`shRV`a2GOWMB9W%Y*Dr?m>sEXX+;`=X= z{pR{nK|f)=AH)Nq-vFA;YKV5`&9_!=86hFjE4))Zmlf4NM;5$XNyV=pdb<2JmO>?{ z%^Sf5*k<1(9$f{F8il5VyljH*8(znZlEOaVDu&bXCs_;!C8{S^mVh++n)>_=({znq zu};_r1R?iLEh?5SzIFHmvQxFvV&yg)3{IvS{N)iG?r`YiVDuF%@CHRMPlybbZ_Xfj zS{-4kc5Nc3`ZF>6VrG7K)Q9MaaXX<;E%38{qodxQbV``QwPi?1BE(dB?a*EQi(s%1 zah2#WN{WgmszX>y`bj*kiFYFjx#ooU?sGbn@ThNnm^L3>0F-TgQ~^yo$G4F64jxhJ zO7mLRp>O;%=~_wtXhg0gy=lJ#wOQ0gu>@Qd^5==oKZ)TTPIBE0tkc%267oOYNw3We z$!2a|uqFbd+Sc%O;d=qiL311wll$9(`}Bsf56mpmh%e8K)=OpTB{uBuH<5e5(HkA> z1wTXU@59Xn#qP|Jky-51wGHJps>M3e3>gM)9`IC5i}9MA{1|O@b2B^3oiCS?iSui? z^l~z%J4{`EY&HMBzzWP`X>Li_^+m`?Va+ZyJ%wpdu3^U|DoL{X!FMI!q+AO?x0PoVGQ!H*<{Sm-_s0_DO26B*ZK_S?@rT)aVE9P-y7W4)VtXw`cS9uycaG{Q` zw480i7NoE!oq_^dIqOe#?;gg&yQ7eseRkhaU!YC>9Z*?id8{2}ui;l#KW!EPAV+y5 z;=eZm_J}m-+C2m#gpxervjRY>@*!NSARh!V0i>yxGnevp8Mv-hV&Ye+O_)rX%;UWj zAEGh}f|y`ZpOk+h&GpT)4Aun&k$10B1!I_Aogz@_^8-F!ggF}@ zofG>Jbr7_U+J(QKFq^yk7=-6VL z28{Rg`)Q6Ta@Gm;Tp{A?o-ESEc4B)Ib4XfXPEDTdCb>s?tV(IhGQ7{_yKu4K)>>Tu zh8-dZ2WC~k4@yq@3X99WdppS2N3~_>DPXf3K%C-iUp;7y2V`DH{)~lB|4AvJpol(U z87PKJHe~nR^{BvfNg6AtF;rB+{0c_|x3F@mWV{c(`*(};T(ng&ec3Ov0Rz2+YI++kmS(CXj&4BADojjhMNN(!>O1#5hZ-}3l z%GYV<=)qj^nQD43fs*cFF?~{Ev}!#VA;QY*_2kX-0Tu$7lrjFasDK^9C|}h&Flc~~ zD_14w;1_~Knb~dAH!yTKo(DUruh8~l5N695u(!hSn5^h$rM`b;dV^Q%cDB^rPKsw- zs`8QZuv&>nmO*(CcFGdyg3CEka>tZLs&KjS4O3r{*s*u*+jL8pAsr=aB&#Cotn*sO zsQr&2&<_Zw6;b1R0~5knukpf+jciu~2Xq{d0c}WP3gY*ED`gmD3lzmX6VvRdklW*- ziIPL5A*l#eAcjIV5rLA#4-UHzQwIVC3mYl<5h~6o*kvDyvcAQxBcEfebZ$5miY@$j zIF?l3=VMxU^heNy;o-{2ZNnX$FQRf$ZY-FbU8dGfXG=FoT;yr}*SFiJkJn&GnU~oL zQe;FZvO~T^>CGwtS#ymiXoblt;&4ei^G7dHi1yIr^%298@ww~7SSSf#Q;ml|0SexN zO!X8=@AVzRH^|(%qtZL<*?A~?!ulQ za&ba=c1LWi7^MCzaWsRqs%Cr#WUO|zQK4E4 zhLX@Tc4HJ^e$+o6ud#OjE>G=3P^*J+q%d6xMjuu`+-?~xt58hsKL7PSv$Vv$95%Ld zbfhXTmlb);KnR>-*rY{T92xmn{eeXZS7Oa)rVlTmJ9{;w11erFrcIH4-F;B+sY+RP z>3nVb(TNnyRMBwnFV^|<1~#@S;un&M5<6rFq10Ot!kT0v+5x!Kg(vaEM=EbLQ^@Kc z5yasgs06x&aR@pzY;Sd%XN3@AY-3$nDnQs5oGTW>+e0l18jIuNB2$Bx*A+|JY*x(xZ8qaP* zjN-k`Opq?CJ7(eNTCQV0zR%fG{>6aCsHMIW-ssn$J+-i;chpV_ID3AB>#bq_|Eh3c z*zmSj8<0UKksP`b)rzb=j}$)m{zmS>{fu#p18Wj3PTA;^-S^)_38hwwFayA%G1#fB zO4D^^bz;@UgpU2j=t23oURwf6osH`g`z5yAhwAk7F=NuZM$so-%5t{uJ~5-qfoiV= zNKa@EB7U~<|8PBo0T6Ex0(X1m;K{#-NY82Oe`tqXV^;fH`#8I32aHy_ERLB)i*-$% zEYw>xPRAe@yz}D%BJn>HOi5#6o5>Q9C{-unl0)PCS}cuUJ$khiVWhJpNI#~5>V^<(Ez!3=xC-IKH7}0 zBgN9N1;hj~fb9wqU=+XsIsfA(9Wgc!tLi1|Y3`}?=&~uEb_|^+?aUKdo}5n!=AYoF z;|0>A?J4Ow&#g8j@*aI@vh#8MNk*#g6I&Ugkhl7jRk9^D;D0q{MJNJRwedGr+9qh_ zxXQH}e|*ts1U>=A($X3-x5$YTVk1~e=P?Zq#cVR)JFg}nT$eD4Y>sBu?5xEZi6d=Y zxs!`q$OU>2G&^QqLT2JZJ{&UcyTf+;MA?rS&<}8G&!U?7(>Gm|MJ{h-(LoM=GkF)= zj~p-F+3!F842Ux&mcg3t*8tty%IkqqIz1Vy0V38Ba1K-7#x>Tj|B2Wi#g!IILC2`Z zx3Ch%`1n`-`h}FW(it7}P0a^l<0OWGEK-{&Z&m@J@Tf@+u!|Z_M*WxrZQy`>Ckn%Z z3$c448lfg%iay?QpT`f!jGE6VCbjw?GEwL56K}D(%hro&%UJ_;-z3O0ythAY7NmAx zaKML^{acoYRd*(_bkwR!v(}49Ufs==0N~Ra2;i|k2@bV&9&vRq+-slc7AkY)Ic0v+ zzrt$ui8QTkL6`pokeF}Gf)AP=q7|3z)!nOsbJ1?Hx1alv5?V3g(M0B$;HNKF72Vsu$q)tLalr90X zdc^oxUtBmDGnYC?IyW_i96%He3&qpVSRtf*bCJG4raK#dtXVu0db((U5+p-+uJf;VmQQIaBp6>zyyQGAvQaE zMX*T0>T#==Pl3{dAH&+aTcJYtvw*2^<9?);<#W4iuG z9F~gvpYp=`EFY@DU|yDLG>VbkEMGULhi_&q6ElP`otI})?V*8W7G;yJu49NU|D8bIv8Rw|j1XW=b!R=d4LD%j3 z3CuMZNtHZOe#<>L%!`~6REOf4C=ySS`M$42AoX#%NE)_Y((Vg;GX0@b=)q+b+zgZ` z9QB?tDSr_Xj1HesgSW-^`Tb_gB*xp11ZQj{O@C%gtXlLhZTMDXTUl8C9K$45s&e98 zv+3QIVlOuJqqCHZomjK`vmLPRNh|Gl2;BEhIl1?VYyDZV&w#E_|1!Ip)V*QZOU{tY z4+bngMF3n7CG;OCCDB{#68${r!l3LraWu43+l_^7?|Dr$ouf_k?1 z!ijri%YCIbKQk5ZO@SD{b3@Jg zRV4`kB}#AZW{6%Univ9j8@8H!PUqQqjF8gqInw?6k%tFg@V589L&AxUtmE65GDldG zX{BbcZvEksL$-{_fDa|z{Z~MtcZ`GYp+w0QyfgQY$8?}sbK%P!cEbw88w5FDw6y@1 zLoVV8XNL*jJ<6)$>bWDOYieTRr1 zLqK&!*tYwjGq<-=E@g)7!kT6d)p_u(r2vLZsx{XCn1cIm4bB%+UEE8|Rv^7^%;M`Z zLQ=aF;ph|w`~9}7PBFjyuvW7KD%E+`e-c4h?Bc*OxK3z*Xg5KVogJ{Ls<3Bs0}I4T zWYCC$TnifyG7z;M!hB6gI}(}>Fkk~XfUKZkNa3L5vas0fy`!y3+O)ZZ47>x~5XPrS zEu(J@pp|Xz7p3}sQo>)!^z{xRU9oPl3hQSZqF)>SIGgKWLS3q&$9RNLFXgvkElN@5 z3V`!pK>~zLf6AodY*%$o$VPZh+)^>kgpDzw>N2-B4MEBE@q)b1^Tq<+iAO07EPr)4 zY`0u{WraO5KGGNtbP%$zc>{_XB{+9~fC^9`nBquQ^hVcm+#nM18|M|{K6sL<*nWGK ze!4U2k4q_z%}o6UF9I_0gx6 zqbnxx^(~<*e7OyPOSv6LDox`44PCg=XF?g1^rO+>MYpR@=4tv7d$*Z zc{aMP6g8uOv8J6?kSc!5c>qAW)Fypv;}CWKHvJZa7`squ0OCDRcZ?E%Q^&`Cq!^-` zZjM^Y@ z#(kWaDvD?^EQL|WK;8<`x>Kc%S=u!|{R(-Rn( zJxc}Dy5ow>$@q&F6gf7|?(u7_hT#|8`5rlyz{Vm3+{(R16eYdzF%)JX*Dl~KcE(mQ zwq(^O?O4Slf|(HXTEqfatN-P8!K7eL$(he(?iP+fI(}G6V!?Fi`0&Lmjd+6C5_Xv@ zJTeP|j*T7!Arw0+DFxWmX%E7yf`3mK)Q<~35HUSLElcipTli;AGMsQt4En|VC|g(% zhQ`XXpN>Ol^SK{wNoXfVGQaL3*|En_>cls^QQF0bpDJYSG|J701dOP-$X_-@u_{7jJdQ^U#|Rg1$|0Qgx9u*C=;e5EFm9P*y2 zG#ng^I33>&f>!mh1$jg)pk82D*?xQA6{l7w`!~}*X7!_UG{nOGsrIXXh<2bmo+;C; zWn>lBjTrgzF!|4!DRIWeCvj>y)h@W>+t=l&8!cyu` z#R`B?hNIFhy&de#acaBD8h+PVIoZ;PKi-fQ>t{sQSmd&m&t%D0=Ap%YsA04@>_G^h zldGasGN=(JY8TC@G2u2LM)gd1-eSFn`9dLDu=7im%6Bx%$~7Y_01-Wem|Xv~fJ3W?0%lGB(6*-gTy?xTfWe-qqPteL=j#!Xc zd^h3EMWlp>FTljvHrJ41UJOw=d=y7>H{%iWQKngrDAwMw|lfE+<-1t{VBjE9axBjp-l+uxl&toR%$X`Q5iY zZ1g=Jh)=|y{7(+hhSAnRoc?LWD!JW_`RSWdiGaw}c=xcf-meS&{sV=J%sZKyBX!tng|AxIvS`4f043pXUe7l@i+k53B z++D$sB!v~p1szLM?{}3a>*V6Wn((j|`BaL**wnL!`4-;NX~kSCw%XjlF9Lwc)9usG z%>!B_30dS{1zh9rW=UX0L5X|fAj90Hx;rHxFYAg#U3Po^t+?LaS(^!RDg+nv$QDUi`~sL-@Lzj z>ZJWwO2cn)$s}OHmwU%-USadC&KGR@h7Q8b*Xk-`?7{A*iUpT6qw+)VC%%j4t+9%1 zZ{Wu5>cVd+nLRazHKFAe>1IgLmoB~pE-?UdAXxR}%~<#WpG*?fx(11oBw|{{&HovS z#N_mItVO*c&UeD%{eePOK6hRRtAP&$4CQqXbr8=uPm3a_>DlexT@y{&dPd)> zInxy?pr9zh1akHt(E-Ks*cYZNtpE_~=Fe|O)BtYt@x`haG7AnM(XHzSiH&mOFJ%UC z^Pa9|6tkVdS9i}$db`dAbjmXV5GoXz35r6*rVw)tUhK+-yd7|7+nkH;#eojsWfAer z-pI_1;x}n>60vIl;%4VElx2|-d!aOPRZg7c*6B@L=5%xg<@D1{14g>rq(CNSa33Mq zv>xy6t=w8^lq;JnL;4q3lOJCkJHk+su>V;l%3$|RSi68bV()Lt4uGGen|Pamwo)qQlqVbLVrTrh;h4%$E#bhIlT@ zt;f)-RJE|SDi1ih>P+KLP5A#&>+-0%{Y+5-0@Z|OJ!XykAmR2BZ02ZX*fM2$(|x)= z@Yv5w5YR&Av|^+vgP?pZm>@f^VURk*Caq4h(Nn6 zdOts_oxDxtrkk7_sAbx9*SPn4qaXs%DFs{Ju(=<<+MV+MS^jw<@RDqzxfXTY6Iyf3 z%}4fK9;*vfO3R=qgI3G0B_pey6L`B<(Bf^g|NVwVYlwzl&%*DsTVVn|4VZ?{liH;| zlRNY_u5RtsHQ{jJ7vlsR1<%z(SXN40G+QH+ftAXbYer2zb`+HVSY)!gM zWOhNzww%NQoXFg#0l8Vg6L9`mEC9l z%vkYf#vuV;&?bE$j;^lR{I*>@`}c(7h$++L{)t&eb_6xkV+fI z2p&le9^;aBGxdUDWYR5=IVXmlhr0thTC4potReLk9z4?Kyj_8Rjv_m9OQ z=BzHMr!haV2_JG1g_%R?Ifo^@;f>JyS&JyDd3oLle*ewfz9P$<&-(f3={QqpkYQ|3 z0wU4Kney6Ayb*64tfCm~WSZaKMPlgYyba5<@Hc197FpiRG2J8?DqUjPHMdrw_Z@I4 z+8YP7I6!v?tUbcu-|ppqENQn}_XW4c9&r1xVr59o#r%0XxJXsmwT^V!&oKsd%DTJD zz_8@mTU|O=L9lbMB(164%i%xV`&iOe7_pUkIm{eSyrn*Nh66fVQmLuCG)?>D%JelG zZE>?G?$HrT`Et5s$E%rbc~gdgGv@9%YX6dk=<}f&(V%CJI3=p+gM3^)Ux-R>!WE{X zqjg;LCuRb*D{;{WiPThvmPKT=zxJR8!qNiW^Z~vR1TryTx!6zL`;6P%WQWhOZ$oU# zo_G4m4QWYZ-Ybk%YYdwS!!FP2D(*TP8s@>7*X2m2B+ubI`lRd@DX_d` z>y5H%_hI?zL|K;w`^N@yRe7qJG5SPIf%`5;kxaJxyu0>UDz1;S;#3p;NtnpX+(V&b zx)lR;=z<5^f&JUDXYiP8Wt~o+U3=tU5mK9C2OD$60ZeF0r^n4P6l)@{b>M|mi*SOf zOP!K(vEfEZMlbRH-6=EnjDdZUDp8fe1|_b}XO)N1s>U`0oU*&ev^+*rIW{Tsa8G%= zHOSq!yFRjT_id0yE=-uFr($=yiq)+cXZO%JUG90Cdu@%q&E6Nxbvop$Csdc4FZihx zIUlq(uU{t)n08no__?kp_6ao>qEn*)e0q_BN`t^hwxhz_=X+9Ow(Y)Po?}QrU7@F& zSQqf?1={vMw|1+ly{~2Zq}D)5WcO>JPv1_Yensi0{NQFVb&j(@KAQNhV?upTUxfUF0r*7q-*&E%-$!41rw;LIxD(DFu7fzVc{y=6mRC z@cJQH)%hipt38-iRBsoV;k0`m7*aRIDa#l{=S0h3EnE}nke%AR-QQ3fn=d?e(x zg63S46~`0t9o9w1UGPqFBxOzz#(i#3u_W;$(Z^_8eId)_Fp70gq$(*&4Xmpz0nB}r z8;O?rm<#alTBM73CYPjI_N8j0(BrqtiIAH5jf+{3h$lqtOUyN}qPTFRyG~=*;k63g zP{)>&sDuEvOUyaX8r*Sz28yjik)jd+{~~@X(dECGJWbXF-OQ{!yYzyk5TGItXE$RZyT}YvjrIZS*~~$g*p7J!R29qxHAuT0R_+_Nqli!tmvCbSYgM zndv{emo0LVMjCJz`nN7?0Ar(#lFPQptS8-x5x> z`^iM|>S*47;N#3T;i{Cg=>wA3p(Nv}ufits$lG)H&>)(U{&+GIBUk*f-mk1laom0n zqD=wdmXHGMPkuR{`w3zwE9~-IL@l73PEg5(-M%@ZGyy^97t%d9MVMF}h!V9@KXNEP zArg1a?x(O8j&}>>VG?!CUP!Y$wQn?&M^|Nu%bJ+6V9_FJNWr)!n+!uJ&p(iQg#6^k z7G8#{J=I&2sh!ru21ByI4Jx|Zf5l?$>f2<^k{J|K`*@v^K{PZP zIBn|{-ckT3WxRu4egx9l;&{%|W$%{w=H1}SsBIk;>8+&XWymxgGIdpSYdut`xdm@O zj_y+dd8%uawV3*Wvpz5Q(n-TmNR%8-6t$36nYf(E{_R)v$Dym|b^;`w0V*NE_Ia}0 z#Dufcv`n}gk-vOTBdW}j_e2D^9ey4Fc0-|Jw?^r>(Mx~@IV3GD#Ik6DWE@pX%ieP3 z_Igv3)5A0|Jj1;=1MF&GXEvWDfgbFcNUN{s6Y&`OZMVfywxqQO)3pU&8}(&YSXX8E zUUJjBFPiv^@v)CodVe+)QG3xWu#W5;cSNc6ICtzIPkKg7(n%NFPJg>~0U>6RX#C@L zIAHG;ydsdN&5)axRETs5+ld-y$`&nM<}`g4_(BU?ke@F)AL&bqO3jzH-=?5WLCcFT zJu1U(ojbbRxg~9zA3x-{zmFmFc?catAH%Hg+QWH?g&I$M$g0wAsQ7Z%C~9 z(;n>W3LZZ$vb{kLRb5+C6E+*|62N@I=BTwz@yzj}3b2irD`2x2zrzx2n-5S!=?rS#4~DL;&>HtW^OJw zfTRBkKjC&Ef5v$Y(cU=t43mjYMQi81IN#DiNj|$^yS=NJ0#O_k_OWwA^PQFP<>{k- zUX2Xie%dq{p~3|UN0juH)UrP7&++OQvE>OI>@tm+&v%O?3JSqA)Fm_=i6n(K`*Dp= zCBIkKk-BzVex1tCf*b=e*kN{!xbgeL45rsH-PuB5*kf825YU7Pt`eNY6VW6(36@ZZ zg)zXoc4KbOX!-&~d6}gm=OltWQ>D8{OO6M93?|1Mr{=zQxua<=pW= zeF{{QWa&=Z#23DnD&XHTuZ82CiUSB8YJ=uQQClY^GSZ%rD^iE=0t;NCga?+W7R&4yR0&C=0kj z&oe(sD#cbs@#e`g#`KuNEZMigg|t=s!F~Bs%l9?q4^51p=b6AHLajK5L+C>OZ3+W4ZeF6V=cKHwAOzk{*2+{)ZU_*oYLj!tVW z$8m^F_AwXTSgn(NDQ+ifufM%;>BkPo4uaQHOI-)YJr7g_85ai{cX&jyl+{YTgvQoF z`K1Y2UyM6lKw+c`t7(2y9{OI7E3T|iG^N4$R?#4YM#F|E%8AQrH7Y$u0@lO?5e*`V z!}-O3)=VKL;LLqsu7f2QymXajBLZ_y0q-%M)hK!v#HPbs5}YH9#x%P#T{1RFmsIsz z*ywfH%9{IGO?;f^j|ppU6r>t8*&(@7+up1ogWFnPS7glZ0;-5)Vz&+3V)ERHKYiX5 zyI`RdmL!kEab{{@_qu4?>2~jUS;NebI(!r+k7fBpd`tymE}=h9F(_Y*mmI*1&rT<~ zq&owRBIW_8#D3hMlI_G2n+-1G70@%F@jTwfN7wkx-yRjE@!x!x%7Hr88&-x>d_`|{ zyV%<@xAVbpf5=0|26oZxkFpfN3S)H{Nn-LGKh%bQBz%}uZ2h^*+?^(n>=0)j#Nj7; zeqyLkNIOS%rq^#tuu~?b0rTlr$`n^_N3nHzYBjQ;p6S!~g3ZXv3l(~~Zcl&lL5;B( z?fHbIKxH?fpyBnecXr1v6Wj_SDIx2j;s@t4abuPZH>d`)v@_| zLzj5|NSdEJyw@|ss>%Cg;^}=3kMbew<(4kZ(8t;1fiKPg!xS(!wYZXA-%ULdW*OXW zHCz8_V6TwfrmR7sq~Ouz_m&IZm*RgO>T_i7XU>P#{xremChXqV$TRHygx}R&%MvOX zN}zx8#Y|WGfOYb=X)uT%!r}$x^|UFQ9aKg6xJ4Zsz{c~6n321I498&C0PGy|FUvyb z9pyYmCZJXPEYt4KztlZ8$-(=tyaK~nQ?ixOdQ+I2MM!BJ>m{ezsR>f*cjxH`zOCmjj`^vR zZ=wCkdvBx6!|u;6St)mcGxNfZOpzV5wsZ7L@eanpC1#cVuKP#Z~bp5Hnsv4)IivWf~Y5uU@curB}ABaHBIZf;5}%B@cgJVK7^joQ0l zm+F>(x3t}PLlmWlljD$ik1TS?eDOkY$+us49r)d)F=B>x{w-Bb7k#nRKu^>Y;wA5X zV4b*ius|b|!}fbv&@1E1OXu3El=K&srrbENOHBvn$k1PTnU%5;Q23eE_afc|}tVC1m z<>77lX%#PDL|X)`Z=+U-w%l1_e>(6p5mYT`W0OUg{(Oi*Ikw&kY*so(?h6&OKeOXr zVVSt$$A6Q6L>UCno2Ne;almE`XRNl)flVI}TE7ej5Rw(DgfHnb$B}N({V_sFd7xl_ zu1=tB)(ya)Yi4Gn7wcNeTo>1~Lm17S@{M5jdaZN&6Hu{^jNn~Ke5}OdVGy>YzhE-S zXT_OrDDIkdDx|(kD5fpKvmHvGuwSO2zy&o>?e`d}aYTT=HBR40BmkSU#!d6$sxk)KQok$!@({p^Wd9sQ6%(?a^86bX6$kfoPNRnS@1N4l zaBAkKedm2BBfEd-3KM@}Zv6=9K04uR6y}?G{psLab?HVnUKbnp10!UPs`inN6DN+^ zWWAp)c(f`G95vsE;@4M0I*%Jy^h))Ms_%yORV?YuSm;yXX^&=-%^>fJBjq2KKBdC{jHc<)qYPT-O<7FQ2U@0S~ zLlG6pG4N|zBCN+27(8ILz~}hPgq3MqC`a#85BzoSFQX0%b{Fu(h791OdMp}{%|}4S zz}#k()=_M?*9#&8(n}eV+Z4C@7@uaj75y+&#N;a7H_o#8&(j}-D#elc26c`IdF1e#6G|3r zU1wD0{)Nt#_fKye=S5xCglwqJxVX3jG(}&zUgIY%`k3p@i}E3Z+=b^uwH>u+9}w+Zo;R4 z;#HDz`#CmV1C88|pBz)>C?(x^QglLYo?jHr;beu;L$4O{ooa#}80i{`(fu^tJv9ji z60}fq?p%sf*sek&woc0rG`?Rc>EF6d9^>{tDqhCNm}X?&#h8Bz{Idhn03}+P`muSK zf9^WKoceRLq!a=pP*h*Rwm=RulaZG_U7bo1vYWw zd;~cNQKwd8xv}Dc?=0y3hX1F%vy6+X`}#gHz#!cqH8fHp-Q6Vu!idBm-3SQMA*FOm zhk$g4(k0#9-6h@i9K5c7T=(<&+%KP35ATLK`<%V^?6cNy?O0#snzhQj`JQA$hqf0C zYU)e_hYAsVLm_~LBG%wr_|!elgOoCaGP9bAMS5NfmY?bw!5h``mtHj9f&fHY>0FKvqAQH(`FHr0pZj$1PMIZ^M z(U8>ab$C^nggaO8AZtftE+)+B9IK?Y@QY6*d=8{n;E+&v*(tK}*ffzqK6R0I7e7V%pR+Nfs;^pi=mQwAMLs~3tqgQxXH2GxzCvE<%0LlFpq z{0RDxeC^uR-r>ouO~XB4nTe|Q$w?3|NX8Sdki42))1VAxD*3L{lyc5%O=6c{*ZES< zUNsWf-@>}^OY#tNt8Z9zX_Ze5trgfu6`g4i+FeBZvRP49h&8en(ix=$H(Ubq^bazc z)`SJbhI#^NDYA}KUXu*5(t5)oQ8Uyu@MtqfMl02D7DBvXkYFg9eUO8Om9^6El_`9) zXSq_GO&m9GUJI9pC-QG9zI8tK)c%w(6h2*vs6}ZjVLNkBUI_P%3qs}s<`4V@Vm`+R zlQRj70Zr2HY=`?7dP< z(Bb+hU;;O_D?6?U*#tVhg%VYtleM11)j%%Q%0U?@&ztBoz4xm5*}eOOZ+)qXQ*S@4 z;MSc5Vk9t~aF)!ki;J_nl?BX#_MzZQ^jNxT2zBdAF9RJFQ;9Dy7o0)g4P0pnI+*)t`eQGkH=e;gHj@c zc^qPLDb7i>Rk=FlxZ@gt6NCM_f-JL5QiAj^eWkid>M;dZrS(wW$5xupnCWHho|p} z7Yyr$%!oF$y2fGCtxgwmVOnc8>LjbIvoFyc(Fc*|#hItz=UXthM0i?!uU>QCc+s}u zBX#rOd~qg9!pa1eI?`P)7U0JOgjARY#&a4-RN)^CxKIr~dR&rT72ESIj^7A=S|mT1 zbJ;_AXQS!3j`Em);xgLRO1hV{=k|$qt`!Toy{@QEH3uv}BL=TJuj-xn zTGk1jebjQ^^yEqw4jDrEka6f56L{NYz-q!5-9bO%lQkyKoAP146neI!1?=uVlyA49 zWP4-LZdML(zQEFX5it;zl2k(c=Vfzcfw&Zk+#qW|^I0Gb!-;lc^@dtiQw2DD{|mc5 zgIvP|x@YQVH^?}it)4f)!=9&~!#f%AfU@I{R~t#|mrGNhen7b#1l4Y2UPFApH=D!d zu)IlseF2(;%FDzv3L#D+^_RpE=eEpz4I3bDpIJqinXc%ZAs?R>#1V5u;M{dwCvC>D zEYw!X+y4$MR?WsT495J*H{>nQNA(}!DmY?1V@ViRcANfXxS6qBfaG)ansxKRThf|C zLD`t{W_Hc)p5TNuC*m#ejc6pMV43BUUHdx#_0dFK3avPvo4WhTVDnxJElshdfB0(@8R)oPkO3T6x4E0D zjWup0keoBxh?mo!xyF6-wJjaQAuB7a9?H=ujlt6p)i&ug+G#`vtsh{=dB0Y&u?7#^dGvOFj<(ZqIpMPoE(k@oGlKiXm0h98i{`Nw%7EM zYs?$PuX6>cXz^TO&|iaT#7YWgtGRUQuEFM}qr-Agitrv^J*b(L`EbvhA=$MUdSmp? z3PR9T@siR(3U?Bjn^SaA#b``*M{S2{cuAnPi>#i41vvMxZe21-U!3Nyz)NGudQekU zHoWYHlbeQgs;3WuP)rJu1N+Nuc6f6^(vz*&P#`BvQk*up`umk$t98xUkF19$eiFhC6Ne!|{#y=Uhs3>G!R}*3A5=pBHMr@Y&jazWt^rNhxXhv# zgVhyzXN4d+7M)QS(JfQRYmwTJ_xbqXLHI1CN(mJbcpYYk{GK<|`88ct0r+G3m5&l? z$hVYzaf~2f*u;nB9ALpDHlFiV#sPI4u6$z$!NOTtlIjywT;a^*0K^X zjri#UyVdVO)sh~8+gU3}FG}{_RSXL1=P!Z%DH3_UhkKs9b5T<=GIVNP3LNsbGKT*} z$!@Y>R!aI^&*q4(G|y1k&A7ytO%>BlU$BIqh7cXD8lY+ft@-I1K0CrQgDq$B4VK)u zd%fNn5OOdfl5OjuGqRvmLArQBeFYhk;ONEYQTKtfsBZdXFR>{dt+`O*pv`j;I3c@F z0L*}fa_T6uVPkZsYYCeqRZ9j!FE7c@ScN|c1^Ws%vo|Fs^QMx$kIzK6(CLIXyTn!@ zX`#x%{#VA*J`N8DGNK%1y<#D`-2}>#oXpYmz8@K zyJHac6Gu0)<{NG} zvU?@ZIlIG`sb(p87z*dK#U5aFZeYsSG=oztYz-fe+Gmsc2KOs)VTs(neaM417q+MZuP}J9)TP<25xzp({ zT8Qri?c<+7FArHnQiK%a&b5fSni9tzoXZ!)ywf^Opms7PY{l6E7HZ1VP&o6!WxL+` zt0=Rh%Z9P-T@K+Vnr2=@4<~@zaIg&aHG$SS;fmLpNhCx7ED2it5>(p2;uT63?_@lh zD@f(MbA!f!B^#E9$*Uvl^Sx2KT!_y&0{#}YhILlXlh{%^r>QI`$a7qPb1 zy*Z|u1f!uW?jg**WXqDIOWUJ$E;+sOXUc87_E8sFZEb=kwx7_7t2 z;e~S#QrB@$0F|xZeTaxU4h*Wr!f*9rGI!r0xSBrwtTkelNwjMO%P|?;q)aG5MOR>g zxz5(kXE|l(t9=nqr{Eh*oz;M;EuQKnGronL9)69@9aTzkxa~?J5?ryR2cMJ$2~5Gn zK6?e$&AOec(d&sP$I6LHD$zhrA$(g7(|zdt5NL1TJY8KeT-1qujXb&kz_lh>=Dpfr z0pSmfAXhNengXF*evgoXm`{2Xsxk77kJWNk@U)r~ocys;V+BoG>V3MO4J-|dmZI<1 z%F6tlaZvKFI%%~Pn)J>X>c*%2qG(t0DyD&_%PXs+bH+L66e!9HkuYel36qIztJ>3u zOnPX6Q_a?|XA^|>Z3o)G%+VIGe6b9>Jh&@L=FM%+@#_Io7D!gdnGlNnrW^dsz}ysm zcoG8__0=5%Jd^TbLfQJ(qnzJVJ#GG_a^P()blyN5gln%JPIb}AAFKFmQUuzIzPxG!5Mic8fA7#0;oMo{D8c)pg7D4c zIj95($%c79n7*WC!4XrsQ$R1=Yp4}+J#N6Qy`M8#z!+2le(T|pg!#%~8U}L`yQs zkeUI5GtEaTy(Q!uWOA@BpLK1mrXh2l-YKZkPn9F z1fH^Df!*I6rX+LqTwg%9pm#L2 zMipN?$NVpGF?L_PX!osVRZ{k3URiNg2Vu!HKaGr{f^n|sgq>c7TW5Cj8c?rW&6xev zm4ZkT>s^+~$z%H5?X6+q6>>5YVVFS}-D3*Gi1hg~>55@AL0^!?vuPJ)FMuo!H4=r| z^vBMmt(}c5sP+&9Ip7$)(VM%I+3eHxiX?t@E0Y8{;8guk(TDo@8Mj}}=bDAcT$7;C~Bw9`AFF4y?b``Jt%%{hb9WgEr)pkF2GG&3K17G z;GyF{hPLU&TiH5Xk@|`a)kUOU8XXcLKQI(qjwX-AVI6JWqf5p{==BQ8>Z|zLNUjlY;ha2KB~I zoHLZHhZ(gOvG%cs`!jt0So_*$C&m1ku}^e8ujiSKLE;@>+B*iAhkUKJ7i`*pZ~u-4 zLuw=28(|np(n8lIYPG)$2@^R4-2AXYwAaIz4vPkh`tRqDrz*&9)MLHbr9F|$+;A6j zfbC5J))wJUaL5-45}Y;P{z%cD8vEvIbj*=1`;Fs6NK$nIF)A88wDHzmyMiH{P?JG4 zQ7h{O2|vIYt_?4RdzTfrSI1*k&CiEeTU7DsczUx<&;z;Vt3I*Ak~qrgSiHVDxp;AI z4c?s530r2Z7~Y4Ux_!`>{a@tbW*L%JvQj3K2eHhV2}{+!XwZsEs=2!ZfwQnEv}SJ=q8(v<b&xIdi4S7v>i|^}5r>goiMm zMcL#5i-kw+jRij?_&19B*tOm5Qu`}itr`y2Tngi11|yc{Ju!XQCK+xD$?~>*`CInNktQkEjiS!0e;m5u!YJ0h@^2j`x-BAlrm@a@K&<$l}eL%R>jJ zo818mV4o{C!LLhV-`=Wv&x+YMV3(?7$P~1wk13h{DRzOfLhVgOB)JQvCk>;!Qb~`> zGGfT5E1H0pYqSj)v1uM{=ST0Tqn`OM)T+6N+`d*xjcU-2aE#YCxW}gdQSNsqhM9of zS{rD+`v$40w#+XY>uE*B%k>5VV1eH!#kDq^wX#i=GR&(W*CoRwNmn=Kq4}VjwF8=y9GcT`GQM#r>)7nnr`KD1o9*bR~Xdt4!knZ{Wu-}In z%ij$Ont(mG7!DyCEzGRU+hb99Q@2cMzOAy)l9b90Tj&o=tk}i9uW-?*4o?~n#yQ4i zvOKePiMb$2(uh%Pw-c7mqxU+lhi5pB{Ue%~%JB`Yfim}i$42u(8<3%L0t*dcHBXRM-M zBIm^rT!k`E1+(|z3r~ca=l6cN0;?n>08jf^9nY7yQWRQ02psT!*5AAB-D%4RdcLEa zjpw?>7iTATEZi7bX^4V$;nCsA3?L{N-#9Eb^&xa|sEB|o+67a~-t#yJ-psZ-_S8E; zy2R3tF0C9NERFM7Pb_#fN7sbzb-^EVTReuK(u6;OGu!AYt%NGb=WvVZLEqTj>R-%i zebSYmUY{Co4?nZ(rp!Po)Ry!6ZM0Lv*S{G@biJLGsOP$~&*l7UZ9|Z6dMYD~EPuK5 z=Qg9btmD_^@5>KmnIFH;BovSs_w}{gnWAe%h*F2U3L)>&qE}jvE5=UKf1@jpD_Cl| z>C)$poBOKs^vB_FOGaqYwDUXrh098G9C=j5x`FJr0R*NVUP5Xva(bwDK(4*%;P&^N z0=CTLq9ly>QtWWU-oz5bM=ReO+n8_`SE8b~sjB(R*ToDc(`FUAUYj`ih@B9Gz5Bwx z16>tgDw8Oi-Q#M2DQLzUWGlg$TUdOnvYd<>G*uF|^d}YDZL3DCaipB3pbq0AI|@+u zsdW{;sVB3F_LthKr;(WYg^pS0PI2RV>wtKK<<{f*RN{zk{SNa!mHH|@LD0xm;0Z?8 z?=}^VoiQ***Nrs8h`Zh%RkZE*xcXy+o#P}}R9qfh>ovwC#TrH;bczIDL?-mxg5vYc zpy|=p;_-Va5R;!*XiSW3QWe%|z}HXv_voUe_ zg#Xwcl+4BI=7EgcAkHxiFYH)I&@Q6Q6}{Dd=ARMBc`Zyf6d5a|ixk!_=U5eu=koMf z^=}GSQBxb4Bz=QhB%0tnK|2=r?>O|+cGfgW*0uJxT<2wO-TDJ03D4_vfCnJkiIu3l zLTHui%Md13uTQG?VPaxZ&=ELCxgFcsPcKg%yY@CSl*sBl;UDU$uy*(?^x2XGhr%hQ z!nX<%sy%*ef#5^XZ>zTc+cq!ah}X_{(|z^JI+dHh+s(B@VqQWfqe%V8Q;Dv=*1Sr7 zG>M}`Gj1XeiZp&{lzmlud;5=C&&w!_rAmSq zR;SXeEYWkJ!(UT}#71SR)QK4MpN1J9#b92qpHx-;td5NS-F{!@bY_34I$_|t%pI4F zq+;n7rlBU?V$jI&?xd8%_awYG`zzbiNF^0R}?kr-ze|4P&c=g}Ry#j6_INA?eF@ZfZ&lg_rXZeI*nV zu(LCad)=w>x(NDntDLZM_X&5%41r+R)|~nLgnG%XsM;M1y0NgAI|{eWyXm~4-V4)r zSnWJ2OQsB@v1|AY^%UTJb?Spb;eL7Ek~DEQ5vXLWLnpnOf31mcW@0th!M7(brCUFA z`FDcF*sT|P62+e?@}_!tKY>CqO1r=H_Zy@~7bbeE9dwM6ZZ|#f2T-_V#*28|;_!qE zP5jVkDnK0@iVKq+IVXQ%SttdN_QZ{QyP4N)FS0;w>RVNk{U%xZ z>(Q@o>Z0GD+VtF0svGapy-zm3Q?EZ)xwe~mv*t`&&B$Tsx4v&WTG`OFY#LXVqbb== zQ|YF(VHrtemwGn22NpCMTCR)POKW(x;*Yq?CZ76rlA;c9T3GwljpIi6ko ztldk)zI~wI2N9+9hUnyAZcZm#-UkxhgS#Yx0=7rt^Vq4RZ#f*LsaMea;&DDp1q-JEzZA8c&jsvE3uCB^fffHSkhYuUw+=wc=JXc1&bnU z*u8>_i)$$Uh2iy$0ajhcwP@)fDe1*@$Cr1{#1W1nyg$#|Y1Pm!&V?Hff~O@fGSTt zuqr+khGFudV{g&E;yTv+EK3TmW+%U3Ye4WoL$uK}`8_g!3NAd|s15#h2{tx@gcukM zPXz(_d1JGG5>o(SU%K7ynTi^s)Qk8|$Ke0<&3`TnVDO2th?2S_PUTGq(f)VQKNpyR z)R?@@LVF7Sd0T9RwrFoKq|IT$cwMW9$Qf>b%DRc1+FBlTX&zM*$y?aGD)@Hc#4}%aiFq zequVH!@^bpRRt5=E;D$LVCCp{n=*B>bqLZ7<0~a)+(9xU^FSn>D zdu3&1IYg|34Wz`tZaM($_3h_w(92`z264=Qn7M#ib5KtdAWH#9(GRE~EeF=OZ zj`Ge%!k+2_nANE>v$HoSD`&3e`!iKzz@Hbo?VJto{#=d2P#M6tN9UvW0{bkhq&GIE z0^BlDIK)PV$VO&>biFN#HEA_dDSs#ExTX5=-h~DfAn4N;h&2ijv`}EpoKFVx?H0p} z-u}QWeQRrO{`qpAR5jt23KT%)Bez(Pk@_0?+-B})*~4Nnu%n%-rjNLMHBhH;>h-PJ zqT{G?j}76gVwn(P@z<|k{{cL}a_)h=?vW;a@#5?2>pkY@rlL0_2Cp1jQ5jCLHUR_t z?ZfVb{92?Z^|8rMyi0(*AT1k4mceZ~!6^Q&#TUu(5jT6jKf7J@V?k|^?(%gD$=$Fl znG-C5~9_naUTah$8 z+~1roeZtB=82v)Pe4QrF=Xui4JG%Z=Uj;KzQrb?6tFyLNplUkcAoKCXV_dmlN;M_m z>CtoB=RQkrb;cqc4T_^{cLmuOPG-ZxAy;~?+u4rS+d0g#4!2!x+hh`5v08faC!2#g zrfD8=jptP*!?s>GZ}W?b>BBomMU$NuTmr9wzlS(p3D{3OvC4?V#HZIlPVWpt#YsIk zR*&BfX_?~%S_KE#gsQv?A8Au!++;(pv)n^)TI;NM`|&;!U5o@qU=yAQR%HREn(GFgDV z!KU>-)4BZ9yheTf>yfWxCM1n+k4_LNPZ|{pKtxWrh7~TG!?~Ocs9Jb+?-pjTtN^k4eY{%f;rHL(~`bZKN*v^UuZ%}4uXYW8& zR8*R3y6C>@NIatBZjd4X^2oD_qCg7QpvL>N66Uk&TDf}$Pyj!?8JNnwc@Hs3kAQ#x z*x5Wmd6r*Zu9kpK^A4+$l8*=}v8%Y4?Rw%zqx9ls2XD+0N8hWSLw_+*pTh$Jo`w|{ zO>=@~`wd?-wyg&Wi_Z0N0T4?8JUsPY*ZpOusHVwlfJ2o(!#d*hjw&7&$fH)X8YXDA zJ(8_(hHL;5RHKm%3vtXR!$W8bYc>oQ{;nj_c-3#qgom>)h=h$TK^+UAokwZHg(Q%W zkb3m)0BAd2f2y$HNS?hC7+nxyD#2sP2W2Zq^v=9#s93z&fn}uPiAfkaIr(Xz=&iW$ zE@W!8hE5s`_JQ~e9S{JC;ZtA##N8C1{WvIm0aif6D=kC@@eW-yJ$MM5^l@%~3uaRT zGbksH9hhNuegjY(GE%`p$Zi+EU*A(6qWNq{eF4lT}~aW(F4b8MVwGO_@WW|6iuc9$)nu$h>d)j{cJLtLjA7#KL5+>+`D zlrs32+|&_Y9tXZJsI^J!NTk5-tlE0kY-cPF2gz&Mk{luOhal@vla`)~G%9vVN=grf z$3ne}V?XyKqjCp;pry$kzkI};1qu6agP&O0EOVjx0F@;E4Jw8Bq7rZs9j5s5tP(X{ z`g6SYE5&kPnHrE`!lPGGeTscs+7^T62~`7(97F?L%GrOqC2UGhn{#t7|#d#r5 z>FFTfD!RQu$|qHz$JzbQs|j$N>CiIdKL3b9hBXUYGgz$ zF*U7lt{A-dW~3p68jceOOekqA_VqwdM!CR|rysO()hITL6}=)Sp^#Yjy#LWd1YNu_ zt_f2NM8@fogEtytT>FRPdi+2l-drvMArXHm@a&(?&d-|-aGP7LbPWIWn($OGKfwRW zY;{-t<t-Tl+hh4x=x-UwY#1;$JEK<&MikfMRcWGC0T{ zJ%kuAzk^_)t{$yWegSBSA%{U>*&mCZZhgPGczH+LutdpD$gWiXE*T7zoaRpBc=}k< zn+_a8%B$k<(zsh(r{NV5y}c6r{QH{<6CB*P)ZHvSk0kNY`@5SPNx?;ri+LtL6J=$L zyCoD+)y=MlzkCp+4jcp*rF-%$6X(%0Lj#(RIw@buz57i2HC*Tz%nB{_=CPiUI%v3{ zpbE!377~|4Fjxo7^y?YCwL$OmH2^)A4j8!5YOCpY2}g3Wf8Dj23?WWg%52~;i||i9 zvE_*1*J6FJzU2Ms&yQO1DT@X9{$yr|2_ z>2~|8Y}X@=&gc@PaPdcMXwsFso>?Svnd7c+ZZbO*Hr=j2?-|=kv@Fg5tbj$tCxKh> z{QP{gjlKj6xsU#wb$?5(E;fXBzOnylsjrx>F8RFsNxx$o25;`Y(9K@O=}Fpy4!J{( z4k!)VhcjeDvc$*VMA&;WgAgaIIpjruiu z#QrpXo9^&(HGC9cs7rb_=_jcDVW}nA)XIO@x!x_&GJy^SHCI|JxB6FFPO@nOx`lv< zXjGmdCCgp1xc*o{yWHqAu98eRMUh|RX_$gG(c>e)@D-?2QzE=h5l$6vW3K<|WEd3p z@XEdCATuk=Xz0?-)ioxM5a4Kx&dwHqV#OJH;Q#KvkB{AVi{AtHSFwM|Qn3we;G}k6 z0`qp>U+wspTJ8E@3c%AkY$&)gf&OtTj#OY!l8E|q!2R{af62rMen5qGC)Y%!KKZ*Y zf2++91_**&$IA@#f7RvhchLwFP>CF-#aTIj+WhakK~@178g-=3i1@EtL;k8kf}|Me z|6LQ<`%pm$J|R>v8U6m;HjCyy;%Jf&(9qyhS-|u!OG8XQVra=QKh{hR3qHJ4Qdd_O zmDi?XIyWnec6oR7y@91=L59f-y%53KFLvG4B(X<8m#2RPShJ_N(I@{@(!f39fnG(; zj7IyPUkoXVfv_8Xt-1fZfBx=9Tza5eTesFE{^u8`xY+Pg&tLHC1NDr-;{za2=Bpi{ z&uk}mFk18O0A-W$_!5l`4W-x4PEO{8`Ja2N_r&fDDkt#(bhN;0(U}?thW+V^oCn)| zjN~i;Skg4wbbt2z_~veAxw6T%LGKz6Ut56R9QD3gKAY6fNli_?zxM#B^JDY#%8x-B z>)Yy6N?TwC1Q05rznA} zp$L@VFuwz!+Zqn;c>tXRDqQNd8Tpq2Ya;WvuO8eN<)RdP> zR@t({sVwuOh)5W84|vou7J-Z-W%pRh?k6{k52=r=o|#4u!AG&{xRaM7gD=r6L3+d6 zc!bd=d^z&9G3$4k+wYn{&)Zc>(&Cp)z^eiKh!eqH-)7lpTqyy`M1{eJw2z()ioUeA zwsr)lKLzuLz?8^KR<5$|86V2~!@!+d{o55HCL;pMtxS!#Zxscd_R=5Yu=C&Zij)AZcf4wfyK^z^ z;dXNzp)^1L3s6jSs4sz&#$jXLeD>x*`krNCxSZn~zXM9LkMsrLIplyKOTDw|D7|Ee z*nmYbjwR#x_!xc?hwEq^>i0 z1CXvAG0fac$l;J~=lFxASI5~-<>pYfp@_iJoZvxyw8-^v_y{0Nq(9t_rrkR}_&#;` z;^GBF2B-*rsrIwhKk}~Xj(eELje#&zBN4riP9dx8aau@WDW2ChRRHB;ZEv~)H4(o^ zO5nRkz@+mJ!MwVc`auSQX^oB(WjvMFk0kLSfTLD)uk*u({0?v*8W+#QBvpN}t1ZTv zwCkK$fpxe|b#2b%z^had4}pfe^VuCYIQWf6KMkl-Mhs%VBHcPCoJL7NQ0HT~V{HO) z=A^!tusE~-%|0*;8YjqI{>04a@_?zM!s$i@hCb9E&gqiZc0p-(vVbJBsN`nf)rm#DZ0DpS6Kw_GlaW6jQO^@!2 zv5KYwoP?ScskQpJ#0Q3;zF#@xqJim@ZF6j(x6Mga-2m_#yS9}Hva$%a#q zyXLt*G|Z%5O{QZxQi#3n@9*DXy8O7b_yE*kWTNQpco`}lJ!8f$Alsb0`Xf7n4Ks{? z1>y9dTkcJj?XVN>#vcID6xLHxE;wR_N>uD~h#j4FG1Rfok9k<2au?!=Pe6dvad_PO zyx_`L6Tx?6HC(jV&+KwQj3(#?sqj!&;%bApDeqP`?zw((@k5VRqr_KTrvzLv$dWiL z@H>u(_%c!=#7qZLD)&dRZc(M%-blafw=aHFG0jE@Q^o-<1cWJ@Db5rvAmkaim=}f} zr$3NG!C^#)zLXpE+AS-J%o&~BC?+f`Wxb)&WQ1R#F&Pv(Uz3t%7vnU;ORU#M=CUV6Se-mr-KY4X{_gNG69eh&w7?VSO zD*WALkfx{q8L&=^8UEf0cuoff_DB^OW=QvN?9;6)PtZ&*U16qzqN4iK9c>{f!KU## z;@&3%wnqWFR*u+5l3XutOX~s(@Ah`CFoGS7Je9rg) z&qrWxK$K*NrIHkuoj@#(=y%^{gpTvAc{4^`g~Sdc`OCxp;=S^|McW`U=Kj=~tWN-V z-yg`qO?S&#aeoh#&Fc$Z+EvxjDO_k{U~rE_$4D^wf=q>ADD+7=s`RqMy(O8kQY`7i zYA7$$=!;~;3}jCs?ay31@kwtQ#2ipqGn`&}Bl(TVZK&}9dxEv}J*qe=ZuV`xNF6=~ zB?sI**|3;#_d^yAaw&6Xd=zgm1fKgA3>(TPn16JXG-`7)sCs*<-T&l;AJ~ip7WXN| zg(afQZh}x8s==mPtFaGm10k94mwE(#enMCXg;81HDt&~+i@EtovpO~5oS{C&kLO+H z^8==)G#L$0&>Z%N4RHdiVR8PdS&KId7cr>#5>2gFq>c2;(xY*Hl;Ib)mBB|V+?DBR zW<>OSM}&OzhLZvl1Ka~GzPh95zux|EqM%^KhK1mV@T%QlS0BEqM+#w2wKJeQbxr=n z|HVvz$n{&xMfV!+47b_k(gpnJGwW2U!qo-LrohVGX2v-w#h64kx} zFV8b7IDK!`MSru<))z#A3yCz`PS#Xrb3lZ&gUgp@*z(!m$;@X_@^Xbp8_Tb@9RcHt z(5C6mNrL!oQL`;14m*McUdnROq9jk-?5*{j2*5{Le>lR_jL09SJifZt zmy%Kyi<58l%LjP{^iH40HA$4;q!nKKE0%XDGyoSH;XVc{=G9pxk2iw{=6`~p@&Lf) uyy1-H!2b7R|I`8Y{~z$Lp8a3C=mBdb^qrkHU%(0+@Fy>=B2_E_^Zh>;+9S{a diff --git a/ui/img_tags.png b/ui/img_tags.png index 02df104cf546bec6ee9c4d7389a4a3bf9a73e10e..a4f8740f34a2c8f5aa54d1dfd309200b9246b32c 100644 GIT binary patch literal 51311 zcmdSBbyQv3_9l1|B0vc4?(XgcIJiTCTW|~Ro&dgG+EHxLa`d;82U)_o{xQ zyT%*URo#E|9wT=g_T6Xiwbz zsrH=adN$8yfpBLmZ=$fe+Tw#9orRW*C5ABu$}=oy5n?N;9&y&>-r|eJ(|bE7e5!s~ z*4P1~jhic&jYW?Go)*6T-n)f$?JgcFFaU5!3W^lN{PWRw`i%(e-;Yr_QOJ)2gh0q? z$o>9)fJjNB?LwMICMGz}!b7rpuw%*1w^Ab*!^PWq5{-E#KSHI8Ci*Ihsiliyg5%`# zPOm)My*ennl2nV%-J8l0$(2752W4%YUKtQb=KM15#BSygu0gsGR6~B2Jz`cl z^LRr?-gMO>IbR~!`eN75jC9|>^oMY5Rs4QkUtEhi$4Ey_(m|2^uh*c3H-%LzRxh`j zVg3BGmB;7)YV%@mM&<2W$8G|bo{HPc)ySHvs<*1DjJl27W~?X9PyT+97!@U*q-t)z zKapvv!Z?(-&afLXb?{Hi!%Yj+@%Hk#M61Tc)Kuv9sQvu>e1R$(neU(HL5Z{2{4hg} zJ3}y#1kR#(ug<6R)YR0_MihLmRY#M;Fq zjG`3@dgnym8t|_C&>S#j1>SEDFd zS{6-MyiR$mrcrDA^*XD%nj<9IPm17ymQtZHh_OrEAj~Is!UE0kmhSVNnVYIiEK+^!oM8|SS!i%f+u#0tO+6%~^w=3M7#ti#61>#+_V#}N{{1f_^ttDMzv25N zsEs1~V#%lFTBK-#QLmZbb|i*E=C)K!2_fy-KbK77{vo6MXW?60iAnxBE2%6A`_H); zbX1XlE+qH&L;m}TSc>HT>@r_y**p7^3#ap1v(h!|&5G;#&;4>C?0$AnAaArqA2((c z?4sk`eM3>*jVIADAAY!xUHV%pBBvj^Q*QKSt!%^mtG3($q)-SXNGL`9<>RQ7Y-?s{ z?H0Y76Q)ZC>L@;`rfYvu5Rfp1qdz+7XBy5Bm@{I1EfxoXAe;W(@Z_HyDN%RbM(Fol zdKYPMSCOBCH*bH!i1W|P{eL?FV7$Kn?@i}_xEtC}T8UlV%%X0w2IJx323!~EgM-i% zjBT<~!zfW0-)G~+l94=Gb9J&%B3A+r3Wen?q54_gy3y{P%)0$UUcMIseMTqMYu;r= zy`640&m(#kAMAci*NQ-2hg3=YIa94b(*1qtzLy@tfAr=Fg!rDA1pm)`n$XC|Wk&zx z>gWXF&6MCpw*ZCrp*ye7s+GBFjxZuJ1aIpr=y6ENGf8DeZ(KJU^N90oN zO?mElivocJ(8v|T_)6kn->B&tU`E-#=Ptj3R z)Yv#uhJbOY*DKIoaK<9Pc-)LV27OXxjQ3)E^uB&vcZWQS#juMQkNjT|mN_4jQM=Z5 zrA^W@*%=YV*x0zbriLyA)xXR)h&dnO?^E84h9t82xi@)l;Z2yaeDYzsHdZ9N&8Q1 z4-3bS8&H>571`#VO-K1{R|Ew)WI*s@Bz07uT1mFuj-r`}qJHa_PSSI4vx24Q&{ak7 z*$%OTeX=JGw)a)W@-$+s9XG3m}_i@xn zJMFlHQkT~kuQZc@G0K5c)BPc$;2-0>=zl;d@c&wmH!&jr3C#Tex7fM19AIVjc-Q( zICE=cj~JPnUYPPhUif#fn%meQY3#jH>Rl^_zK4>dG<`iDjN`aUd!E3OBwI?Y6Wf@B z`O5x{B0M+SDIw-LH6Nc=_Rj;Z4lGYH5cdLb#FV}_9Pk3vG=1SL+JLEdknTMzQNu)~ zK}p)ZFSLPs9KQ6BdpKLAxetTHzntmFz`f-4GY#v((*M^8&f8J1ZMW}krlk!RPfT9v z=Gb%N4-4K{y??**<_A2nJE70*v4YUu+q|*!cR}TU@*X5E))`M#m{6l*Vn5s*t`{x2 z&mH}|ZdH~JnfcRGx_Dz2emscuiB=J7TWDVYdedVCy6)Ui+I+oJRN7qcg9pRh^Ead+ z2nlA|obOCvhOT?C@wm|1&+bg@}_kofT~$YRqoh$$Q)l9)ubVX&LJs;0e$x z4`vE2tsb8h@%a8+K6XuD(E6eO^HX!^{slLiH06f&y`fWu(#gi6LyE1!(RMRtZ=zGT zc^konW9bTk$1V+*9QE}~g>9DmUU~Ns%tvlN4*(nVmo1DGO7_B4Kg^MvekMJy%~y%W z_&s7leLU`(b~rnS=$cNs(jX&nF3SvmcQ2aBXz?vsnakO!s{d!Ee~4-{daFWnUf88#IekDI#I{XmZRFZlaBd(aeZx-syL~WF~)n_14w}6PwxzU84BH z#0s|b6KZfVIXe?R$`PO5bRo^Z|G&Zh-nvz5#>Z?DqXt>3s^YGw(%rhg_G#<0jQ&+ z#lQQxe?>3_w*#$(KT7n7GbRseQuTJ-Ul0C>}Y04Z{+!y3^19)W;z)|0Ts4plefA1`cPN(#qtD1=9!%}k-Q7*{=MVo-%jq&h&M16WpLnNzHg-dYu%2I~B zlYQRWebKIwV)EyT3p=&c$l6%C3toAv6DOzA&8R({k%`-vYIE5`)cjXm+>)I)X$?9X zw|=Be%hp1~Zr&E94>hF@))EVXy<^=W`yuR=cEh}SSSSM97B{~vkt#a}1vmMYn*U*h zQC6rVBvs5Sj^QJuL0)kMu}uvW!!HE`dFy(os{0H*?t~5>wiSF%5@%@Ymd+i2&{lL@ zarUmS{hU%q8)50J8Jb!rVHDrw8Ca_9-1Y2S80lMQ5Znwsh;ZTm^SQz$a#$3qoH^KZ zRMQgg$oskj{kM%9uO+!n5`*_vwa|)1D8K#R#m0_6U5ObH5x%jM(Oohgn$(aV!972d z({-w3Ikgb&a-Wk2K9R|xK+x&?kb%illoENS{qhX9>WyS`3Q{~j$EYoM(Q70}n&eNe zUm1-nCX@Qv)sCu2g>M{Us}C{K2TQQLHTXV2IZ(W!bV(I!SMKy2BJ$>%I{!XAiX6-V zg361V1N5vn^d)&Y@`EpKI3;I@QQ)A-pYl1CI;x;K_jAM2*C-hoNzKD-MgM%Q6^t3| zl*a=b^52Q`|6;76g@;=S!JwPBuJNh(_HCo4<&FWRx8imyJ95$Eu!&CX`<@`&Kld&N z49=`(E|E#E*|;C`0e|S~bXcggd9mKf(%Jb>JCcyLo}Lfjq+fc2vR?fCif@ou9I_^T z0tTI`Y#R57&}OWHU_pMqqTbZ_cwAy4nv#Zw2H=6ejL7%@;r(yc*rSUF{>>6~OI`M7 ztGN~&$7GnApit)q0Xn+Spkmdc1#2Y0`>yT|eSDT%pD3Xdd7X^}{V;sPjvG!4Yi@2X zy5#5x_X&_!5bL2z?8&m?*(^XR2w_P`N$KN>bRtH1AI8#!y6n-3jV8wOgcFMF2g3d@ zV=;N9xUV+svY4S1lthex!J^GE$`nm> z7)(uqaI%qVqwBije}DVy|3Xgt2Qmaaz?_7Yw>BULhGkKwohGpp=%hLP#UZkkvBR6O za@MX>WT(y-Pd<&ww4*OE7b4H{6Lh zxQr*kN5rURRz7xLjC#Amqhe5G&J<|1O5H4(!vZHAWFx5bfw(sLxh;H^E{ix z4qI!odB1X}2nKd|FMQ3N>VA+^*A!Mg4=Fh*Td6eoIq|_KG1{{0yAt*Yx~f0*-*qw~CUr6CCR(GwdQ}rljk1jyu_{jF7Y|6VP}0}JZ?1mu?Aeofx#YCV6TG}aWU8C+Q`}{bFjlEl z_g3_GXMI;TRzYn;T>~~EakAJc0!gc_%jqDO7QH}5aYL+qaFFMGQFhesWOo9z=P?PP_#ZF4&bx#Vb7W&8JrD-?FTXy41`e9= zIc_PwEmW4M=PTfOf07d%5)g#`jrx-U*{ zU1`zwC-pK?kjme}tq&brZJ_`8ycwsLPNq%Ji|k26%QSgXni%2}rd!4w)>OoAnKfSN zPlva)Ty&Cs>W@b|y(ZXKbKHd$_mIJKoAW9C`s>N4;QbZqv6MC`Y;}eO5%AO?RAwq{uBPDa`b3W&C z>6EeC(Gr9-3=I2f`e4M-q9WK5R^#>YKFsMlIT;OOG4gA(FL=qLlDfq+`i6Q9$-?N3 z5%?CQ#qO);$2(7T?kvpkQ&~d7Bkj+at#TE=xvMgN-jqij>dTI4?oZXQz>$;AwjwPw z$}?6WsSw5%r<6@9^SC&;FB$t9?Ihyv?*7Y47`b*Jvhml%`2?2?f!@e5qiG=zgHim; zhrOtUc|B8SXJ>0`>xV30L_sge{p^e?PZo8XIplg$+J>mI>e{NIXC7Caq?)w%$FlFg zYVJLKZ?~+ONpsl$Dx!zzY_-;&rYJ&nAPO>s&Zwe?ootM#Ls-%HaR4irtDsb(+%9{% zRu}=1c$TqlEk=g1&WPAj7nz?-Kwx3p@z0U|HQftk0SM%cEHOzKnJIkYIt|6@G|or1 zQj9~48~mG1^p#=)qCG6Hl?d;DBH9-bFo9u4$>eD`>}*uaJHH5Xl{kx}a#22GVuJYv zo0pp3`Jce_zpS%S=!oh+~K|QkOvC|r4eucu}L=e*GfP#XuQA4GondAomxMy6Bfn##$jRp@eT|(S0F;3(A8;!TFkLnA|PlT#a9flSs5{rQ9yw zIu9kciA0-kl=Z*l@q|dK6EwQfJ+uy}P?c9+Hyp6=9wnT_scXJj%HVX>@J?#p-*q4B zoxA_a&l#`7tW#@Ci~{rKt+^DJS}iB-I~IfcOdpOLlb2m@Hl`0gKOs+jrT`mQAaB8^ zqMoFX9UO$lgf7mo(E`8OVdAn)Z%W(n*}oCpq#dQDP%CX@EVarE%*-Att4!%1}MVYRZxq+1(OXn{S10hr^PrKlGj z+54V@?(65W38K)~w~yZE^;@p8Lg=V07NabcB@LeGx3{FTS&c2qZi-EwaY2i!8TU0O zQ)Xg_kY3_=R-E!D#ndt1LgYveU3}at)P)K0aO^wFtu*2BB;g;`F0Xc+HdprebUjAd z(b(W1`>oC`y6>fFb5kk?4jmi;DE}7D{;Qbw{}i(RM`T;@ObWJX&09}nW+3wUP@L3a zdrhs|)Ps=cf7N9;zXi7X{t`ptAyz9GPG{&LQx!_VRA9 z*N`F+z6P`Wq&3;U_|{-$gWZHfsqa@8wikRaVnwd9iOuubf^Bk}KI2Zo6Jy08#V!D? zMZ3szZbz@xKI@Z`!muqQo<61OESTny<&$Ka?V?V?VL7jk z*ghXfB0)T`Yh_*VLnrZ4Og-Z3LMm3dcMF^H98kNHYi{Xg)zQ%bqKo6wxo7W`*O$gG zQKMcXaJ;uf>sK(h{XN;wA=tX8YY6Y{aR(_cds0XHaYWE^<*^tII_$4t`794Jm_h0g z;T15)qK?eXQCI<-?#g6=1Uuezrk2~2EV0n*{7oz8PRIAnzs5$6JXPI;kH!pCanggH zKmw4+;o8+H`%{M)_dd{&amJ^YHiPxUZhnS(S`Zf$q9I0pj-52~W@9l0yR%C|nFq{F zJa=N)KT+UK%YRPF2pdD1Plxypx6ZGBtp`LsqUOJvVN@9^70Fx44Jc_aNJ%#Lkgp2B zEs;g?qwXSq!a)d75B$41;OJ0L+e+hKQ*8w$YP0qNvk))eP_>w*Z*lqI>YqG1&SQO` zUDD`T&&(AW4=w+iKi&3lT5vM7|ND?5hb-%}XSa8=S4+i*Ps}o+^^ScR)B_PtVaL`d zYrR?6dRM1_h!_z3eGl?ts3a_b(OkO_pG>VbB~3lYoU0{+7e_qfB_oNEPW9P49yx#s zwtisLAyh=X&wI7x{f)|P%)9wRmaWMXIxn!d=3+fbet|bIC|5Ti=)4%n6cU>Jt4P0T zllJqo4X_lc32Q0Nqt{IaD?A=8ir?4k{_*zBjO`jMZ!`G&mmGcvH~30Ruk51s z#oRiV)^0edOC^*Q2$t^rJSE5`t~M`YTU&wXKS}d&S>%~1YfnD-vuv5-!m{sBNadcO zV$Jd-JM*Z<`B>rQIG8~qoR#O}&!))pi(Hi{C zMg7&Q=L6X5wKqsQs*$AI6{IVUyfoqsXe05=I;vJ&(Cpwuoq1y3^zV9y!NeWgy?9N! zL`6u6EGDeU+?y=s0-D#=i5NP9nM`K#jklU0qZ-hxq>+Fj7A!R;Txk9RC0bU8JxU*4 zEZTTxS(+!(8~XiMypf{!i**+_!0U}#zPLNDBrX9Id)}lB`NwQIW-LDQT<$fY=|U)>c_BtiMje-qTcB)>`2 zA`@-7#_X8tUaIEFj;i&!b2*_zi&R85qWC{LM5z}*plnr)lDdw)J+1C55>u_#MH?Y;!$bP7R-7l)q3s-JT~}p%oC6W_x(y7V?xX4!=8%H zz9d`VFpUAAK8fY@j}LPiW2sr# zlQ_HrCXqJ&hp4H~)`r9Df$^o3$P<9@?`@-PRWxd}QX!Bm8PX-bzOlX}MEkRA{&!qX z0u)OE3bkKj1z)@2r&)`2|l5Bt9QPkI~^UlJWU)VIy!#;N3;_C5)Oi_+@pdQ zHVw-uPW~DtzFZ3T`zvktAGW#vqc0hFeV-H-74doBUcOV)!C+s?b0V_5s`!#K8Stw*KTL;j5dfgX|A;Clc>c?O8>{Cw~1Zb3eBLxbPPj zxnH|zHM5)-i+}o*7Y$!h%wf@_4(jC3HezvU9vO9XC0ht&WhBb^>yb~!`~~^B`=_Wg zqk7p|9WR0CLCQZ(xo9(cKM|1imq8H;$aGGR#aNnYWAA33-1RmG1l0$01z?O0rSqwk z>Jq3bK_m@o1OK-xD_r;fR&2cCw{KXeS@Le64gt}A8kDSnxC?##Pwj@UYX{Ha&Q6FE z`cEL?6^r_siHKYh$frFQc#8A5oruNH-0w=g&x=k@PSjtX2t@LqNIqUAJ>Yi)wl>u9 z^W_^{d?SWzDLF0Z0kFeH7A z3LA};INGY9>F>B(fh7>v{4CD*d z%S$!N3iJxrCj8T)iJN;W3(zn!^% zQ5liU7?)q|9XOmMWlYxA%6c!df5#v>V)L#FY zjj}X(^XwO|%|CC*opnw%SMf+ics`j*98fvUP>r8MK`hC;TR7rKY8 zTToC!h|gYgK3(ZH#=0meEgB_GGKK9(<%v&xg&lxf-X+CLybNa<9=U z&T%Bl6--ATM>r_=6mmJ)&{vsjrANDiU(z~Gm(P=Bo#Jl}P5mHxbI8?Mw4 zUg~7TN+{EP5il_~+66a8w_WuGU>`$e420*(CFDcap6;eDx(dZwD4*+VoPC;PqDa{r9KL*zCB21$h~o z%E}_pkQs`@vcXigkH=f{I30Q}k!K-fub^%^R9qfI)c6vw+Huc}H;2-d;2^~HsB9#A zqWYX$@-@e*L{yBi9YF-E9G!1TDw-G3l4ZK{za_m38u8ve(J=2}6)T>i>)~K**LIeQ z4DBi#o4|Tu!usn%{@7IM35v15H1z!?Z?A&7dVR#T*TABLE}qTcmoUP_`kuuug|&)k z)tI{|>?ZV(jmZ%Xh0*s7&=aY(TkV?C^eVzc3~J&7!YC%3PO*yBS`W-C<*ZuC$RA{^Jv9Ftm9y zKCr8N+ri)Rrr}_-FHr09X4A{9e;Ng?o@pV=^N2!EtF4Q0!^4*3F`L>~D|R zb)bC2_*8*52iP-47~f!KVLM) z!YzoWzgFSZ=yv^v@&HO`RA`D0QS3;L9i5#S!Qy~C!aa{(->%SEGrKOEVTSXux7$tX zqR^7Xr5tTPc@|n<^rparm%q1Efg*wYI-$My!Oa%>poU3;G*nM|SMaQ?Nw3a?Yp9?G_J@#RLiPvhQ-S|o7g#iYk1#~7n32T4Ys7Hw7W z%P196a-^joxkp;tH>nsA#@i&xL(hM}tYyD-&@5zhsyr1soPBV%+$asL65w|h$s1b< z06L4WBw(r7(5G-h!}p)HwhI$?XwUPWF$fIX56*0e@qUYxvVuhGcN`4e#|kqS1hR>5 z7fNh5^Wh{hn&>4q^WV;b6NyFwDJ54XzC}f&36cdd*JDZgN#6~xpMH>H&jxJY*9HJw zY;7C^#NfEn{rBh^;s`Uu2zurQ@nLBD~m0t289jtLW~;vFEKX3?l_57Z)>PV(c##Ttc%h|7$6&dct~ZZ_mF= zFeRam0l%zkKmyaVKY?Lq%{0@C(_|oN>2`xFH#ZlL(`x$vp35|Q_6Q5X0fPn7pXKVR z#p*0}zoAa7LP9#^T`M z7(Xp8-tju5OY;v;Des>Y($I*9EAeuAG^loD_$al$59zahNIVtYfuY z`cLf|hdDVq`qjO*uHhSq5gph(^>4u#q3Ew5mwJ35Wo2cMkWL9iD0f|KsF>Slxw0id ze2GE@ zeKFyAO@EBB+tH_Bzp?EwkRHv*Se%)`8D7xmekLp_Cl}u9kxw1cYXqN$MoKbYW1}Z0 zC#S1Rh{D0nJ`d`k`CJatcpOY3;Z~?JJxN1;gPPrOuy}pIiLwoGXMg{0-4%x8-Xv(N z%&>~#a4Z1Ymbd4KkNLQM};f}{sMrd2>aufy(S$zuhxl#~>xVAj>u zT{d#$B8%!?LHn+0%hD$25iu-*o4rahi3kLG zhljh1A|~sm^T{t0cc!m`sgKrHzJSWG*RNj#BV}V76FLPo@os+)uy{N?JokRTR&4hc zn?PxJV}8CFtidZZ!(w0pk+B}ah=ly0!JsRW=rA)jI{NF>?u}pqraIx^}`?~xm`H)z5q36-nYly74#2lR6=zdDVD&2 z9f2Zw1UXxn*!XyGdGQxEZ_{+AgcQBOBo?xxKiZ+4tbm!>I?Dy9w>bNH3hMomqX+ez z`>zj9{O>d5KYeFy(W7A@sDA?A_*S zg_I(LW)-#OyC&fF)O6i)A22n1jW8WM7;Y_z9C>vVBVPmOsf0yJ(s+Np%g4)mtAIwl#~>}^*$j+5%D<} zXJ?bKv9VE6QKdC3>^V1#ZSQ?}`(nrqRGmmmhww(x|Gg)9Jo1H!Y%*&u*v)1lQkq%R z-@bi&VeCQ}nb*{`0IEDNR0CZF+)j*=BKddr_N=U}4?Y|jizxvgb-hRV_ZE_zBtyv3 zF>l|!;{ew^;N);Ec{&_rOEYFszj!?_4aE%21?F;N2A?e+uAJF`x?w)|>C-1*O^epE zC}MVd)8*Kee?=5x9)C$#pFfqEcYCHncqxj+l96t>hQ)enM*;MayC45v6Qf!Rw*u(( z`P|a|pI)j=gcKnF3WX8jKs`mnLIx-izPI&+j?d2a@ziLRSl7(09;?%X?U?|&8C*Te z2qEOD2?>~>i(_h6OH&gb9=`s<3V1!xm9f6Q4jrGIG$~gH?tz|E?pa7yRduzoiAeze z;?(S{G*nphgTqj2N(w6*TLaQDt(3B*rKP+);&-|y5J~bTO21GnCV2&gmg6qGKvrBu zP)eN1ZP#YRdTyE6v+Y=T0S~tQkD8jqgoHxA_jZ?YVh~B%2Iu_>%@W|afExh+UC4|9 zUSel=x4*9sU2LY@P(oN(7?dT;ipW6-2nfK{fD6L&XifuQ9c(s~#`BR)hjD7L$wML> zcj8VrU~+O2n8(ifH3(f>T|fk88MhR11^qT?BZcpZGC()d!+_=Yx{Y~q>~fq?-gXounejZ${2 z9Knx9K%l9>7uoP&~XCRiQj&$ z=bK#WI8O|@|LMyYq*SnNkUxR9YVXZK<&wB4wCBYWV#1_BlXJ1F+uJWQG%+!;;aD95Q_T;i`Z0M5yu)LahS2E%+kG+!F`}p#f6WnsP_KLVO6^cU ztJ>n7q2cNZC{ZL5^gLP?)@FLl?*VC?S%lyD_m4SitrqXQ-0n&3**!H-B^J;X36Mi<+*5qsi42%l2$?&M&{m(Azw*R zh6FJt_UDdmk0W-k+i#z{3nMq`+L)S}{xVA_TYa+{`#Dqh zLG76kz+pagdW{ukSJU ziSt@dbaHaCd>)(a zUSC#LR_l8uK%v6K$pQ$0>Whs4d}SzOy&2%2AmMff0wUmWMjC`*fk7|@hng2dhyf_s z5EcF0YozQ#W5t;|whhAiVFRi#@@+gmpR;V~R3ML{7Cvh-s8*Bm`oN40|LWDmR2a*{ z7|rc-;$$9tL}BEoEeHVM@um+6ZFx#a1a_|;Kd|49XJWtj5=eYc7{H>cten+6x$P*R z%Onj29*{Ka3zPCM!vl6)IRpGcu=YWsV5HqdKDS#V+5Z0iAao7@YhoGo9mT@R z>TRiD-_Q`|v#-s~&42NB=?xr0%}7l%q%x}Msg z<4XhJP+rbrRNm@=>k%6h^V_*$f=-7lXKcG(=p9bIiVqDi%!^@jD=S$UnNuo1aCuXc zz}6pzAvY~8Jg2$HM=0;Rl3VKcYuz3o)_ji%Hq)Ur&JVL);dnAKGJ&)|K7vj<)>MG= zgpr?-7J{__^*I^g)FBms*aH_2pknJ42v^mbB>+#Pa@i1aS*J}{oHGHD@bNDWi??gN zT{{y+HP#Eb+!93-y0$-`1ADVHGuu*oClP^9!^pT;X*$ez*ob!j;bT}ikHZFV=Ae|1 z>1h72(d`t(;Uq0)c{S1Zhhj3+A2#2l$(t@KhjyNTg3kzS7Se&)7*)^;_)8(Xu#onsM+6{1a46z* zO#`9g_kP*meCC-Nh(ADsum^2|$V$e>>qPfQfq>1|fkh}QI|A5A6nhb3&YsdrKlJeB z5Ai4BxVSh+AH|9hv$yCJ3=AJSf>7>H$!VK(^|ZC|<3kgFSk1(wr0|-Ll0V=(UDOvA zS^!!5uFzt#SVOY}*bVUVY`4{q-G-om8hF|pQ}44839#+A)I`*^wde2nEs%$*;0 zbN|wkitMhmoMJ3dom-`vFg#NECOZQLA5A9l=WvNB#6WQnL>X>3jEI98r{`YJnvA`G z-v!Hz`lgg`=>mj>M_powXS4D0cPN;6Z-9@n7`2nIhYexJSK$;MyqFfy*t*mKTdUF( zIv-bIYC0P=o4~{XYo&yqt5>A$^@ymwoZf1-oKI?{%jfYDTX5fE@iGF`L;E*=L&)QG ziTFkq7rhVaHbb&p_p7JC%su}9<3|+rXmUoAmLmDUmEs*$X)PqigP&d zfiKIVzMpbMMgMyq6ajINRLxj@G_=3e3lxI=CrPQ`ya53LGnJ->L0^nkPp{-N_|2;|CpXI9gMniR+#}eOH%Dz*)R>r<&R`4fT2yORn^w+&z_4$TywKqCQa}_G|D9_c24$LcwY#TN7z%X|Q^~3{j0W{$#QZ z3=MIn4)(l=jcQ*3VdRH8y-B4;x*_P^a&7=gMNhL$-|DI=FoV}b&z=T%Z=RNDR6c67 zJ8K=mXpe3caE+1Gb6%|318bOg8$Y(j9Z7Gog z-`BjE;SscTw9?Mhc=Sm#fCVTh#NVyvYey`q6XN1L0l-noljlg5-JL2O?(Z)G7^&{y zBg{+gO@LZNk*Oe;09Q`rd9Qwvmt|*XpSJn|+Q68*CQJ1)Q&YiCnr?jx_PuZs>?cKS zZCNO2C+18o0mYFl8^fCbBm$nuVLqDkHJIqPw7Yvfpv#^JcR?s*R-9T@L)#eW=xZAr z;<>az3b^6l06r@#Q%t9)rw4eG9|Tq}5RN}A)V~v;tF>OJ2LbBj#J+TD_uPG0;6l4= zIxo{(^WD4L14P{LE`U=qz5dMHrvU!33j!LL>VkLA0q8Ey&p$dO@ILza5=2Amnj5fB z-)-V^+v=Bb;X|%-8ymGtr}`^op*t;r;++wN?%_FeKQSN$Hn8Zn`N;g#be!UW5pH55 z1pJJo-5wtwzw{K8iV+9I0kF2AGgp2p`7~hO2q^Ih34i_!ISfseXsKyyYpbe?LxBUI z*ggM5%+A5_oFH6APL6?*v5ULBH<$%8=`|`y&fha>t$_?R;CreckOM(4Qk(xPEP8ch zZU^AIMhbmEj|YtUZh1Fh``|vruG6P#c1b75s4_)?0a)hm?*gdP#}Aqmm6U`x@&Fg}CCU_54|p}O&-3RE*r!3?yKbq_Up2to z#u(@sqN1WeC(zW?yvPM$wOl%3JZU2KBMh?ZD>?3|Ef@$i^shu=U#AUpHWb~1iN!@- zJw4$3t=MsIr~zUJ_E!!Z^zS23c==`xs7#Lt``A+xzi(gwL|e_J_UO&EH6s%f3w8l3 zjz{Y4{woUxn-no{6=V)}1oc-TU^Ru2fjWoc_6{1Ck#P?g6v9Oyc?Jl>cEFoQ`_y)J zc7i?|0q2pA(lRoDFrrjE=9B%%I*8tusA?%GJxW>+0)95lR~yR`9B)>_GK94MkQiwk z?CeO($?Z4yw5;YL3eZZSZfYkOpC`EkXnSD?HP-0r$&$*-%{2z{m(cxjr70uRu|HB9a_6^48_?Y9Jy3?|#)7a676%1LOX(RqwQWa(dbwhEwT%=Uy~1 zJ34B>nc7faKg7FBUpm#`b@K;UTkEcgm*5h>>!|E#s7bv>^!- zmH^!l+#-g20d#0txD`#*gKoNN%c*OLS$+`Zp9^0ewIekIvbdjZIRN_r+L21;-5V%y z?e)Jy=(1XVLheRJMvhxykS-$?2GjY#&oi7Qn`Qtw*1Y`b6%c(ckGqMALV+)1Y`**r z(i{(9=YsZLEL~R;lt*m?s7XKsI4w8q4haqQIf>2O0~BV)H1l<%_SPf$X z}OTf4;LxqJu0{ywMK;3J!322G9;T80j z)w5uk-`h4!0B zRFId!ofjKk=%r2VKIUQbS}5(%dHH**ZkO&a!u7H%o$^QPy8-#NKZZv4t&Fcgd_^YUZ6~+}VP>?|U z1Ng*{tV*T*~wRCi)@+Mm28|Ry3E*nTU)Ttp87?-A+`k*zOu4{Z_3UG2LEt> z$CyYbnnF*+2!2omuqx1_ba!(R86Mub;o{;##BB>b}8Q5O#^WgoSt9_-ce;ptTS+_`xaB+XW!nIO>!huQ$FwNe5b6(yi(3C-M zzmW5u`gi9iAt-WV<>l(?2?V&fK)?{sR$@$4LC>Aq9mx|x+;#+{rBI_v+5nq!Qjr-O zAtF5d`DbB~ASfwIvaCq<@8|8OfEjm#k+m~#zc@hw;#4DG2XNJgLzzNE9+01>o*o`I zzkWq69TE``y!ID?qXWsEiHV7sGve2|B*?IPOD#S?D#q-;z5{aSg@UXsvIvkq0q!<+ zv_XdVmrvtn0kJn!4hDi=ZGIrrd>n35tW|Sh<8y=8Ujgt7P)`2Nn01YZkx_?5wFzMl zH$`kOdAzh~eO&)K_*s^UiqU;%BqXHa?+mIHX6(EyEI&^h!LQ#CerVe~4G#;0)o};I zX6NLjjO@V=hKfr_IPvP(o07EI4g>ZNe0O#eUr%m|hC>wVK_Kr>k- zdlTCmm**M(O+B_hImG5gG5GzMz~J{uAZD)9`)J_d;i=HZvnJC!pXB7cr3H-ocTvI- zzYsUKx{l5V&Q$+M{BAq^ys6!q4|C#Uj$n)3;`a6Tqiwt~MAMR4Gj(c4-6z!fRCgZju9uz{xBb-EO^^@>Uq0*1pGcQ zC}a_!wX`z>NDA@@xVhBQ*jmA>+|iQc^GXz@^A^>U64GhS&GyZ{0%WuxuetDM&;_Xw6rGd zM+Mr9ndjf0KteQUeUJXk+359n4gjJpA$Ym`dB7Z$Ts=x=kD1KwNFuBaMfCF?vdA=E zr=6*mdnbE$f04&P)_C`4?%`DEA=Yj1-Me>>E(nnL6Hu_+F{}sTo~$$J2(Txh>H~FZ zbYZ9Se%b&I1UfTjY(K_2pmzZ=z8*w;$6ZtGF6$cLo&gi0Tz9>IKwd$R2=w0%P~$#> zs1JbY7BO47xXEg5BM7U@L&%GZGJ_*Qsa!p%mMjqguqa zWDfVv$du(8ADs!bRx8EL?Qd{1QvEmL-aMSjw|yU7X)>i1LWV*@h!ql&w91enL&lPs zC}nI=qOuS&WhR776+$HqgoI2<10l(r3dxjdpO4<}KHlGd-@T7xAA9}r9zMNmc%J9J z@9Vy<^E|Kf{*YAFGlmA!7Dwc%ks1ecX4V!9zh7f=?*ng5V{15o$liZXPHa`aBFn|R#!tZGVx$J`qkKqX?vZSI0kC~08GLO&r+`@LB*`Hg093Y$ z<{`Utr*&~VDulkizWLR(jEoH9dqz2uS2f*m8Dy8lD`WWir>;HM-ul*I94KW9DsHF~ z*;Mt5hm^J_fB$|mRBdZi-O*#mc5=P!{P6yLytZ&+)}YG|_2PDkKf;f!tJd705DiWY zSq$`m`-FvsX(?+&goQDWID||{5j+Z`s>Tu=Orz;1cAlfV^N`g0jPY#!M#gGy7XsZ0 zKK%LE)6vVLmuO_Vt8Kjy7??s3^H|P8j9}^UxYgG>1HQ{k8D|1Wm{aLwIyd|(N zQZsW_?9%pN15x(sFZ9>aMT66S|K?E>jHD?z6~rDpQ|eEyoR}XeDEC2gaIAfaOSeyd zj7igxCeU56+nI`Q3DO=&BrRCb4-ZPocx+$^Jn?X=f)GcDUxii0=5L!AR?&IQZd!Tu zWu=R(7Szg8E7A@M>Wi|^D&Aw7@=kGz#AZQ!uuwkaK9z<3gyG+f7b0UW>uq54AJ`>R z{MxPah9sHYY~pm5s&R$Ik2F0|OZx(C;fcA0)pPZBL0L|@hKU8;lnPm0zOv~TqkEBl zAaImnAt$eOFYUA`w0b+c z`fY3L0eYv?ryKQR9Feco{X8TXSvxy1h!{^hbBSqFeGv+Pt+e+aKG<_LEn?~eOT}(7 zF4K&j0y(+Im*>t!6J?s7rm%>}mJ466ni*<*0i1`dc6I{j?5*$*;pL%Zoy*lXOQGnkKog8Nn36Z&^oqJ{~AsKr+ z**YEtRA5z4gVe1&<5RyQ7*Nz;GrSH^G5GzfR|iohmU)bCsH&=}{^Ca;9Z*+Shb#z^ zjtf~#$Rc9x%V!&195mP%{lVY5j#qPf@N$N#?VB!buI|=R&CpL79DO>H-?thzW?kpI z8{Im+SJT!bYyCSp0=QF!e)iY-@;$!EZ%FJRpgzr{k_7HZ$+o}Wn_p0%o04mMFGO%? zHR(z;*rHIVN%nS^Y7juN_lXr($W$TLI(*GUa!5G&s7zzE?24Z9#gTHK>1W+9zTdq! z@Fc+t!#eNdizKyjUQhIuo4I$~$L->yzm@jw+69XrT8<(+5J^{8(E=C7SO4zo6KbANOb#PUD=FPK6x+qUuD(dAc`e-vC3})7g*8a1bV}W4 z+w{%UP%FyNxo0OzRKt2Z&+OJ|buU#a+p+NK6-_f!bLO(r=5T}DhJk)67VKZw_~Xy?^m=AybN9M!3@A(4gv4*h zjvX%L3y+WHp#i^cn-ZxZ3c(b*n6BBTYIWqZ;vkfgS_Bo7i8+O z<-e_|7B4P7vMAsjn1^dd;*xozwvkcH(Y(WDCOJTLs(onWLQ`kygl{#zH`Fo?XBQ)T zEiG-gqP&X5Uz(;dZ!g#WP>fw=YNgcN@pH<1kdA{d=wK0mC(nYlsLbYP9FX%c_)h_I zXAr<12B`;RBT;pB%vFXaCie`*QU*7yqkDOy6U8^Q&~x`W2j!c3$Mx7hbar}ooGvMp z5WkUtt(eGKX09X*dd1bB1sd3ir=w82TSZx$jr;|QqDuNne{IRQ?B}b2bd7IO71W<^ zb);U$jJUw2LBByvVjG~V1g-j=SN!kjiEf4u1hGHU2AXD@RyRCj-na*(U#}(mvAmD8 zRn(nl9vy{H#>VIn2yFLMEz*_Yx3bBd96{upN;#~m`h_LJB-N9NS6mUN%4e#jSa{{h zp=#JaEM_VMNY@XhQ&0W+F){l)d39~M#9WFh=Oe@=CMWFJACI}5mFGoGBCe{ht2}Fm zR31nKr|^joGg0>MqoZKqWp$?i{K2ECIr;RrQumiH`JYCBUid3qzI?gD$`w`gnUZHE zC7+z-kl7PCPM1#1TkA7NjvO&DiL16bG^@t0d5prP{Y%d2s6_oc*<@D>e`;Fa22Ozr z6g*%o5=PCvUnR(#_!dZ|tIhCiOew&s&=9)W_z3w0*7s-{j`uIbq0@I5>;J@31L+wf_9DtNiDV z4wHQIpwH3?e2Sigb6R`$(zNf=d1@`tmuIIt9^cD<`W>J;z?;8QCFRMKqHVL?XVybT z>Xy_f*J_@&{=6u8d(vJlp_|xp;_72`LWZ)kgwqby7TMP$KjUOxGe|gYZo?ox04vzz zN`JigMtFG5bPL@C?8$1LzVCpG=G)BBE9p7lMMag}?jP9q!a_2$fq$CdZp^6rnT=s^7wR@To&HZ_Rf0U?i1dNikzefD#b<-O`-zQaJgy-xlQ07iF>`p6q_;6h&UA$jg#^xCEUA&_d9+ zj7*;Tl)pntiqqh*jt)a_j__CcrZXijoliDQE^zn(U-eXMz0AYtZ{Q<-L!ikG<};R} z?1?q=M0%>S$j>jqFHuhfRTN3B=PvBHv5CwQ*wN7u7#Mg~G5IZjM7rpsqkN}$34@eh zzs^`E4tf=Q62ITxJMMY@Jl5dtO+7YNB^|oSiZS_zZop0A>~}*U)}T~OV_>9x?xoN+ z;1zIzm3SJ#pKt7uxH{X~(J|s)N-u!5eE+`l=Rd4Lc5q-l`AG5jHKTjRhlE(IFWT6A z1FV4Oj;())!~L^Kq#m~fM+hXDqU_ttk@0bQ^0Be$hti8f|)?LN_COF0huMAO@<2 z5UaxZU*-YU$aZ9WDoRdjD;=k+m@C|iBX%R!gh%gjUrikO+XFwdLXd>)c+2`!QG z?tRkI(!J(%q-Ywe_W@Dn*86&*YHDf__7pSc%ZKp*MVVW`W6a8OD3f8()5F)+*Vn_f z7YGP9H^>m`o)2~aa0y%?u6c9#2|K$xNbERPI?$2su(1U4v8V$xHkWJ`e$nW_!^hWE zcKOo%)6c7VhDJvV?%&roNv!7K<$c)k6OtX#H@8X1u&Yace3h5vWjP^VXcoIJuu4{E zLP=NOP?VkZ>E;Fj**#)AGmXa>+>$kf7}xj#nzJdiYoD(hnM~Q|YmsZ{&bzxiVU?&X z5Lb@P$L#p6vqldTwrzRLIFw zry3nR++${%jRCv9O||0t14K z_WsdF-;pjlm>JV=@G!^?%o=9S)4x3weY9P@_2Jl+h(WKYI`$C*`=i{U4zQd%`RJnZ z-BWbzPi8Jtq_^aBkNSd8 zZ{1PpX3kG`Jbk*~YcV}U@|%~>=$98XsE0?U=lrcRN#A0Qs%R`uPerHa{K(k9Uykq6 zvM8@FL__F}`ReGb;Te{mu}+RG{}SuvX+{cRr>ms0hpO4OvazudSQ^A}v1iNnZf<_q zRkWIJg>{ZwNyiH?TPRfk0p8B2t=`TZ3h-Iyz|waV@4?SRqYs-@dKzTMOT!G5zbEsDDjk8y&`> z?m2h<{E5S@pFW-c{(gH{??J&x(7SuCRGYx#4Wuyi$ry^Y`ju2EcZwgS-tE#RRxC1GGh!>PPSDez`IJN-M zEz~qtYDP};r0bVc9M(&rm^Z$}c+@aQwAQT?`Lv76s8T=C)D~B zx;0Y6S&>YCdve7~Y9&u)dP{frJ|(5+XGe?!ta1H~4r~F(l%P_DCgw<)s^_yVETv;l zJ#(vVdb}2qD99`qh{&6$6Mzr*@J04bKhJ>IFnEiBWK>#T{=Tw@M%xn{y_j-rWO`H&rWJO_q=}z&Dw_24A!?A(v^zU+1&{?fLZnLjSR*yq=~tn< z<7tm4%HZS2A^q4&L&p35J-{jk0mWp5p5424G04P8m|b%ulWt$vV}E28Fyl{KpxHO#TU@! zgL^oG2Hx?Ol$I)Vt$WSeBHIO!d5;mOM`ZkOk0OgR%linla<)y9bcc53fulyIL9QWa z*XR~ZI&4qF9M)V8bvL&ah8H?0U?(Zu9n7v8bWnaBMvejb?A}Skr!HP8;Bf%cxy0`L z@(VoHkM^j}Tk?L`A#x1~4pGWyJfvO9=rbmIKB#*l3;%I$4j_#3NHw$w?(qq$#-&L1 z(q{LkS0!d))(^ToBSkPrVtS|?N)tUS^5vhQn&o~CegKN)Z;vuH z^U+ma``FU5Gh?a~QwEAX%%(caLWxU5Z_{wGSZ^rC7Z-gpTDUCN{u571-xfV-aq37j zUGoHpZ4a}R_=?AFy=rNk2@-&6GVggcQ?xPoZ!5Gh-LN{+_t)NpJRVFUFm^*Rqj~R? zL68x!T+9wKpLH~^s#qao7K=Ig=(DHav5QKZ5lA|R z-DJ5zFaQL>4sRXlDt|+{5bZ@3$OoX6-bPH@^6v7pBOgoer@g1EEGtuvwZ~RE?^E9B zfL^JFvYP0tS6BE|ka=$IN$4IOMQY>d2$094`J^cO=V#|fVWlTKZDbGWFA5t#t3E?- z1;TnogFip_^3c_7MppmkPjBy2IU^J||Fi(Tkc`bfcVN&|6Ji}68QDq`GT(4GyVari z!^e+JN2Wa^II-RRt6%FPvJl82CJ5dAMPu?u2D4bc3kPaj`=qBgnr%*A_QAgp7uG(VP&CqiAkdwIHN)COdM@Ia3MI9=Q9=9to! zpo5S`$%oy`&o4ufa3pKCYRe+OHV_K!!-tIx4R3^oGDzJ5p%KtDgmCSC&y%haIoHHs zbAeg0+R)KPJLwoeP?p^WPrUlQln+2VTMYMq>xRte=^7cqNDUC0m~I~#w)h|WZo0-X zkz)Wx&=&M=GHh#dbyE(t%GMX5Y}=gf!CT@n*hGwbtl9&#=1^-1rd8n=XWwzeW%sed z)ok>uP}G{zI~2D&%4S{4Kd5i$p4{9gTR4mi1dU1o*4TPPgO5U{cjN9`LaHmLDZ-DL z4M=zK^4A+@_#6|Va`KQHl_egJ!kGrvDhg6r^vrc73Gz%}%u7M!wcb`Sn-!pB*a3G=o z?!;fHP-vV%de4zV^6;R(Vpw6}Y~G4IHRz!9`f6n+Ub zX4j^@W1v?RY~j7fYTsTLtSy{WZ~X4i1vdGN@o(FMKR>WO@WxS2AqCxrh*!beIBYaJ zbK`Cxa6(crU}uDpy=S@bov`4JdbEE#!y3Qd-d=-T*)E>)mKOcE`i+;~$!?{d{oBXU zz<`>S!h#x#>M<70g7U$^2Of*Yd7n`r_gwa)mf_u}LRzNbmFbks~}O zGL8`o45MGY!YT_T_Pb0i8KsASs*u^8t45Zv-6Y>27y13$z0w$jGdsRqiLf_AG2q(_ zx?$ZKKd_D5p%Z_&vA4+Dc}S&^^Pu$J9$eJ!480%Z8=CnB(Dz8P27w?%(u)QGiy}r+Nc+sp%+L_d#Bh{N zY#b=P{~c;%>^1;P72a@zPq2yeyE2v*xcMn`Zg$eZg_p*+EbUZQ{_^gfJ2W5mi}KSy zg?r^CxkC@{X)>yNU@C!6Q%lw%7n*lb&mBLYv&wJ(qoX@GLj09GA)ua0j-w;>(bO`= z=N4!YPW6M1vTrEb0bd*m7FAaOyTk+106Py@XKd|bxR}Zs?51&XaRfd`V8ma)f=gBj z2nX|2+##x}?~7mnN-(PYXvvx64<|1VXT}+X-6_Eaj!qi_W(z(jxap&%vGHRRuAqk$ zlAC^b^t;N7iHjHOrf!S1k5cdC-n41_;tOQ{2vf_GG}rJhwgAm-%@dIteUK{T-n)0K z$S$aLSPAu}t!>8GsV)0_o);GvqfEjct7Cw)$%wd(5X&9@YaAyJ_52m>%E>AORffqN4_<+bng`$l*1%6fSxJJdWORyG2on-=Jbr zmAr0R$D>VSYkep-c_2xpc6(m`JU2ZxMQnx&W*yr0zaA!&(*bOwI81tpWCU=QK(GaR z+m7aiUB>w(;L{HZqG%w0B$$DkyC#sLn&y2pwH#xv0$C;Y%~td-RWgPe z-)k(3RGrFLAw>zWcJQ?0JRKRcLRDX>Iqv0y-P?}X^^Z&5lMTM#=OgOTeoH&oknw{A zA4?z_2j}%o`yhs76Xs=6XYsh1sUcKZ^y9|efC0Vxes4W-p-+{qY}TvN+@x)8ihmQ9 zeH^r96U3y>sFCW#r{@-C|LOp`=pId-irenJ#;>B^ePitb;};gA({sH`UlDbXG_UcK z)j^h^bNFzUx$DW3!DLonY5E=d6K5|rBrY?0!{-@psRn5DR%F71csPLc*hjFN3#hHM0zIO=ERF#a-I4JwZ@B{Ja@% zcAN3~25V)AATM6J#2|o0h&!z6U6iNl90Rd-IQtGU&HTo6+uUS#&!2lEgR9#Z2d>UB zF>Lf^jk6q}*O|L%+tC~gEZdfz=q0)iII4W%r^^z$`Um%H-2z6HfUHK%NzoFoR&K%0 z1Qz<;WpUP^-y8R5o>CT%s$>1U?oI!1XN#B8%ts#V_)1i(QbgH+bf(|V2$adx*x1;K zeRJ)%?l(Hi4chHRsjxzTxPCGrsc|}a@=e`c07eTwzWE>5kS4NS*R~S>FUnId|9>DO z$tsenVk(Nnn9`|A;kt29aNH6}L3mA6gfg&Jp3Mk>c=7X~pio5y085y=0F3f;^+l!W?0Jp8zD!z`5xz6*Z3}QTg^kNHyCWq;q z#BriNRuzo=vG((3^r~&y!kJ~eavrIDto`5)KN88GCHW0|FhpnQ6Vzvagu|e)c`wC$ zI2jsxwxZ|<>YAEfz@Z>1H(lJzw|VogkrAAjgw~sQ8F~4(uC5nA1JZo;Q=8T45&uv+ zq@2SDSXm^aLm4?VN*gobk0X=V63NmE3hhAlS%Yvtr@(ul;!?;akybOVuuhAp@2_;d zhNGK$#4`=rKYtd}4mp_q@uP8Y`pqbUP(h3+bc`U|P`Hq0Iv++QYkUt%4TTQu{8#)T z9kB;OpzU3^E$-FpO>$h!m85csdT!rCASE{oPekMOP&xbNNWzaudIklj?+;=f? z)dPt=%E~Ee3tzO`e@ zIuKG+p69o)g=qYemStyz_~Kbtn2+WE{gD`bi1@lWBztU|w#U3daGn|P@<8w7>mrHz zBIc@B4tGC%2MmWflXlvgE@jYmoj?)zPt?^zg==nGwL3r76BW`vq1+?mD-LCfwAt^r z9mTeVrf=7?vGeyt4n16AO4HMj;HXg)OPYL4n|!r&Vg*UUowr7xeOK!osOY+^=qBJX znnL{Ma6QXpem785i9{XALG^Uh6euM#iCA!!!rA4nJyc)cC5UnzJU8Fk=j-F>=$NIo zqR+q4;Td$M{-1hn3TJ>2DnnogBj&-rXu>lcvR;(ZNfe8E3Gfl#v-OrfeUa)me61o- z<#sGgckioNx1#SB$h=Z>z|ot2shY#B%wbWKPA;~ zg4`zbpdchs4emzZEf@YyV$GzW`@RuA>mY74;}aU3{**K=#`+&vG3Yy6#-0oBDvE#9-JP=t6)>o zailDEba)s`W6PE;sdHMF!g^sx%oR}gKxYG3-3Qd1Z z&w(bS3A+R7P0@-0j^>X}1Zd!J?M5ahsmsiA7O#;L#sRuxaJayzWsa72{4B#rp(`xx zHxs4&{mDsifW^Ay7*kJ6VE_J9ut2C_@?T7S{!zlD#}7e)T%E&vkrRrH{^{V)evPaE zf+ZL^M4XaUch@lyolofO6FHT%6;K`|d(Z_R5<;U?qUWSnVp0+^D2H(a(~K60V~?2+ z>_8MnQNT=BNk`R>e%q@Ru-Oe+j)rVfMr@<$)bhN4kaJsM*=CCLQt-dy4Am- z|G#>`^bYwy?bZ?oh>y{fH+Ih8@)YtZ{oLPR5zZvs75{jZ$+nmC*B2NZHjiu~S#79% zz~+y_i%>qJml(MuEdt$>Xg`3)Zvz!R9bdm%X=yQ4QR81yxgSpU0Mm~_tbEu!2!bIG1`CZrH51-%c3(xOicKMX zYh~&^^y1Y4w%Xjn|B?<`C)_s@(pm8UYxrjnstIodkQmM4?p3P#ipeY{yV=Xo5jc|n z3|OE@!=RUsyZcRRuEeItVn_JNL?hU_(J#plHpkUN(Sj{zxsqiG^s{eo*!nm4V0wXf zzj!gvBq!{JPn`H2?U9naUZzsI?KY*<<8Im#86`o2e5OMUfNord@akVD$EO$UG0H&-Ru!*8s z4|Eas(FL4xb?LziYN2sXAV;@jO0PVc{jOYENea2%J=$DW@!>|I z!?;p-mN~w7V%-YsMK@lN=i_V_1mkBMBB0Ys{3xe1B#A<-&_8g5u-$ay zjVn6+!c^k$&~0dOj0_D?l=Ni0ZM;oQyKX7Q#f*~jVZ5c#g_La3lN?OQncA>BF@_6J z(;^NECUh|h2zPBvMrnBY-8al`zX^)0{}@PoM(pd z)S+nM2-mz?hTyN!WXfPp2*~k)z z;w=OADQX!J@&V~NG!`+;9V{Q4uEu)1BHE%Y#94&;#joN4AZ4#FGPUJ^hM#rie>mxs z$Z>cxl4oUQ3utp^^AmfYAVj!8gN*$@xhX9zZD7D5QiBkH$#N@%c_}c z$6ioczlU8CmHmg4n*xGV&+yg&sdrMJPIvl?gu4{&DhvXeneVJ9pmGzl8Xby(LC!5e zK-$G4l9;uNTW4zYnr0h3cE*7|(GsK+ZrI~QEz!98O#!IA82tsw^w`l|d21-z6fRUn z+NNV@qzA!9wX8ts>URf79duBz;L|ZPGiZgR?W%gmYwe0mr>oJSRPSSW05>ISjktbY zTbS)A^J_JJ=)ViE3Synd+VjaoYDCX6JUyHplEIb@ zkT(mx3a!JmTSk_OTO64Kt1x~z!L@$MmfSme5k4OP@1!3NG5J$5JJ83O^Ra%y+t(KY zwglsQr?J_bJXzUHjH<%bD-;(3!$9+i3V($C-@3X(xrW~-FT#@cyZ7tZz2|L%URHD#7e6$b13`GdZEbke>{z zmqIJ41Ke=H)jH5B+dLsrk7T6uj~Y>Qkk_xU{sPX|8toY#W>rYWXt4b=Id<$4q-H`w z8abSa_B-~QI^QvHiX9B7vkTs32wjzYhC_{`Y%CDrUt>pb@~Ld1=~ofY0k3bb7{Y7( zB#rRJ{DEWf*oo8ZW#(5}tiTJqb29l$i^(Ml=c2pk7f_)SbGKm3?}k+5WI``fIuNM^r@nD zML@zNq^8xni$l}RQ6aPZJJBh)z@(%kxNk5B@YWzVLtwBkjt0J!n0T|kA8>GXYn@$@ z=XP{KxwsUJg`IJCFM^BE;7%iXUS*Gg8?D1gSrwDv(f8W-7+`4Wgqv{yTP+Go3JY7D zQ(GT`@z2Srb;!m32iX1ydo@M-?Ab?# zVmfgKI7j#6$KYxk>UE@|NsU0yOcFS;-qBrTD3)p9boT5n9pApUIfi$m$L}taujocN z_bfR*$64;qKWW(I<$<_TtsOne+?R4RuSq(ydocJY zdfs;nnX9>(8JsI%q7w^7o>kz&8se(2sOIa@Q8Nun$9U|y0w5b)yK{!VyZ6=p}6d?BFDs7&CJ#ASJ@X@iRFw}Jl`tXzrUb5pf3M)MV0X% zZ1DeP0c>AI+jhP8352rC-xW;yCuP7^OW|YmC))Lp&P(pBaWlRbgT|2zux&#_uFty0 zoe-g5q(K4HwShPt0I&Tjrt!cl&^Sr3UP6FRtE{aRGgbJl9v$s>FCEhti$U&#@+UPQ zUDWzo?-QaBym6!9*q7xWzwLPack&923THX!W(9Iu9c6JKboTJWv}XpnO6bG&@+uvR zw2lW`Lz4x78h_jAX;BeEca!exf1i&h(%Qlqod^MLb|hdwOrRBTh!R=8Hc^F~|D168 ze-;27j46YIPV1o6^{Y_G=hak`;beVM$wQExJuc40Qca=kA)KAG{`XB)uDC z@_;3U%h|-!TYHIV~5TLrC>j2oGsodDnYQ9SS_I-O3O7(_837qlq=krR}x zm6b|7QmJ=ezBElJ)wscj2)(1qGS5s8X0(7$bUsRV&k)^7MV{RN2oOII8>XhFO4)@; z{#JH&eSd~q&0fRq z7|od9;@Guun$?>0E7d{iqQ&jJJa>d-{3^x>V0S_*7biLhcw_7#6 zKu21$=3%*2N6~(|-w{$UbbTKbbT9S(oRULgyk#zl*7m}kQPM|p4WT^})c<^pyQkl4 zz)CmIxK%c}pJN3{lYy>sDb=++DNaW#^Bv*P5+z4MX%Q>bJ=xU7b{hMYd^v8P7 z4oG{FPzIvXJ~wjJ6LRfNEfN*`_C3g6=Pr^M_oK!LnC@Y?V*q^wPCyuD#ZK>3APrvA z_}+;KRnip${Z8FTuaqskynklBJFIt92zHsEE@K@n$+*FVk4#o>Vt>!8XD<9@ z%Im;y^IN)Zp?km;?Jf(S9OAW!|G#Qq4#n(N*iM+m@@?7#@d1q-*1Iet3e`pTnOs-% zzmL4aqH@HJ1Q@`^rgC&TJUpC90B5B=>iEfUz{c^>XE<@8pvu0r90OFwxBs$G)55>N z&IWsktPTobLkSKxDu4*62@G;?=nkKI*75l>?Ozd2YFAM)9m4dYY+#xa4aRb2s7nX0 zwRg`y=#p&sp98W@ACk!&H0+i=J=OqGQo>WAegU~!ic)H08K_XCW`&X0(Ef7i(j|T} zKh2eQH-!>WTAToDoTSFsGvXvt!no4t#H_>d0Q$@J8>sSO6Hr~*noUN$mSY1;H+5ZG;*vxGzj9_=(ui# zE_u`9>c4Yyr{y{-?PXbN+{Pj@Dskr2sgM^++I1ik?cf5nJ;2)i zi8_!I(U>>D=-Xs+Hv#X2cG__}^gKX<4+;uE0t8bmq|0FwPlsA$Ps?)qE7x%a;K^4m z)n+SC=0fSmyhMkkVY#${$`45b(UFLvM&~drBjJF>GbfMEPI>t!pc-k)ZSSDRyajsb zG(E{`98*Na=0&9*yV3FEI`rGc#kJy|q^DEk0rA4LMq_qV^!~}uKaqU4cQvday_L=T zG;*TkzNrMq=0Jwl@x8VT_WXUfa4eq=PpFzTHKPS^2J<5|+a-A>sUBawG`%}>mN?)! zT=_5Za&~1@G>DNS@u!bsN>Tf{0o$%w-eB2L5G0T9+}+UZE50`&A+ z#*n?5$r%rdafd4MhM}Z!logBA5Df;Eae_+?jc7l2Np7U33LZD=~ZvA@b`KmvY zKmR;e(xKD(XK2U~dN_-M@Uv}b%iJ1S3v5##Qw1+8eQd2o=)*=Fyr1V^XLqyC4ndc> zD(3@;jLyzZUgkBBw!U@ZN#9SrpSWP_I;4l=p~D2*b@{y&h28_v6M`b$0pcB`+oZ3V z%R1%dq~XDPyM2yQ%m0UjJ8CAPqX)~#`N?bp3QV-zQ@XmlrI>s7JTpRAK~Vdq|80de z=tPBglFbv4_V-Lg?Tys9)8cqDup2rKGQH4`=uab1pH@Dkrs?Gxj&}!Fe*?@#5*5w) zO4_!SOy6*MTe~@na_ai^-YcxaG)s?c%5GJVl|4ugz)??>ecTfM2a%DeJ*o6CKLg2S zVlpTa=LB9o+OO}axg^SNgIp{&f1OB}E#U?*zHs_9M(2!dIR%X={uoxSiM#?2gd|+AByzSJv<^ zb^nXx@#+G#j2Ped0O~6f``1Im|_Yx)ht^1mS zk)rIu=<>RCe;xE6suK<{A!O7<@6hOI_(8#9Q)9tMphMZt^*>$Z4U8Xp$n!$@5~h|> z+(w*|btkI+3Wc3^?LtLpHYmb&8OXcxbY!(G3L+5+C z7k_rc3NdlUnT=Z6GX~fP$}3vO+yl4!#ow0I^Tz(^zWXB$HpOL$<^B?HlP!eFwlV95Hb@l z*dX0>DBx6+=fyA&(^WE?{Dn~CJggwdR0s*YBe&i0`a7I`S=sV8BNUFv$#%(`Q^xlI zJZAG*>N_Q*pmVj>+^%|{CQRdZ{>E!gA@^x?VqGZ%UD^en1`$jAc2D^ZN#6c#YG)ri zOSe5CDXMM0EyjZVlg97S)J8rnf%xH=lv@tgebW4JztuZ(q!q@~9HDB2@(rLe;u_(C zhQ!s?mC|F&Qj%0bSU$NnCsMM@%gc+4C(y`IwzN2h9>x{aS_pzLezSy4?QnMLV$=Du zV#@4|-AYQGA3nsqEos9|mro>*!UPtCSV;$go??~tW$#;XlIXZ5l5!zEJ6k=zX)f%J z?9UB|0-!2<0M8P;pZaDm8hc$BucD_YYY<^#Mx2TT1r=tuOKCrcwG?5?E}s7+9cdit zypXjN(HuvsCmgEID<%`huehVl-edczwa~v*t`OrT9H%sd{u1Zy!a0{|Zrl8TFD3vw z1sAnu8q2316>Q^;^B(-WHEXXRA@xJ-S%MkM;@7qNE)1mwYTSKcfh`|9+K#k($%=<2 zPpN57hSEb8(TXl(Y*+nm$n$CR*{>f?p4HK5q%+y1Q#%DsN%YtpApm9gq~V@OrJRo3 z))2nL)((H>%KZMWhnyM^j!{>{oY9>)^_g$>r;BfrE62vK`{?Uz)Ny)-qKdaE4OZwtSzeK9GtUY6EGhFRdUU%*h=xXQ2NXoj2!EJW5hH5Bl9^MQjujf zD&zVl5_s|h#e+rGa zEiusBWjBS<*SK*W_uNolR04N*7_Khis30I}eJ>;<9L1_)Bn{`ZMT_3;h&exQ_P4D@ zS&cquVNq7crQ`8WEPl87T{k1LT&K2qM5^8ltA&+;4?K`wjUG)oe}#N=oG#7jvlT^% zU60`sHxF(5sPqr|<_RPrR2>{aVi-?^W5E&IEpw*S6-Ml;#+6R+JkabNI4BlFbo&3# zAT!~(%fp9-%@?ap?XZTBaL8M4=LoEqE|27uV60n* zg=lDS&uEDsgANIM6sz!nw6U(kRTXH=L0)caM$reB>E1oiA?UgAQc6+bN9KvP73e{(`9z;GGgCzlLAZ6$B!QE+P(W( z*Dvst8bUV3?ZGzcSd~8tYlv-n%ly~1ID6o$*B3&)Fx_Sw{sJ!E)WpipNajH!3YYgl z!U>ReDcCMhDI9-x?l?FObQa?^zE*?lRVLXS--0p-hJt1=a$SbSD_s^5-=OXS)$!VA zVy4%?QJQx{STE9|`Xa)m%;nk7$GVrlA5jnAtn+0AAnj-}zff-sGRG9JfdrbMc$a|} zXX>`_8a#KKa$it+$V3udL&3?-$l^mgA_9dILhchb)eP!FXaJyz{K9`D8{91``-+q3 z7#zQJR6g4{fDaE7kS_GBsjB|7>#14dMQ5J$1OUOAp}Q*@e4oYy{Z)Z!VLA%-HkZSu zv4q9XAGswj9g)WCKBBv=fDZmJZgowISfp_zx8^Y|&W{L4a7Be9sVn7e=!nzqoUm~Q`uWlQe(w0HKIb)BhbQ;1uI~ z<>P@C#JNVcFf9QsWkDSEREv|J#0iDdhKnADzKo>1;#V*f-3o8s=wipEb?=+yK6LoV zm75{=(H$OOxmwrsnl>c6y}YVcD7eoFtA z(Ql`TS8Te`uN&)Nd%&9iC;f>U>#w~KBK)p1zM=Y&aK@n#3#hWTpQjRA*S@JXTl^c& zEU7|sb`_-ogdo(iIEWCAjc|JCCG>3``p1slGssn*Yj1`nbjFs2>tyuf#)AF#{>GL{ z-rTgYven-XPYR7?q4sk~Ri9yFFDM=0rq=HIWKLWWOjjV%;9Lw7nych2a|PvU38|^9 z4qL$qjfNpUr2H2b}w6z6tg)6OE6##NQC zFhYeXk5@rRC34#xN|QG>n$0%p8xuzcbews%V{w}3%%A;G;InHH0}?fAo*iLsw-(l1G3C(qUhWOu&Dgi=@bf;tQfwM!WByXF zurmIQ)PVz4)8$JG|5+KW1L*l7e7@o0Gig(q-sjuz*88ILtZwpj%Jg%B^HMp0BWj3(ob*;tgMPU* zC&{w^JA{oyTIc_t^Jj>+-PtT~P+dK6M0EM>SClpAjgB8X)=|}b-}&@uNb7{FC{R*8 z^BgvSP7s~psEX(XbjANsLbq92sWEEwr2vZHrFUTQMnVFD@X9I*nm>RUDk>_vm);^@ z`_Ip9X2}c?3$5vej3;nu6KV)}U*bS`kcxX06m~LK4Nf3*rK))^Ux|v${r{+N97Tm_ z%l|~;{-48-uLMx3|71J2(}oVyBke@ObLry6UrX?NIn!0@apIltH>fDFh(#7sW9sbC z?qhscD#u(BBxw2h(G-Jyj_9aGUD7jX`tQaAZa=FZ`udeWX&uBx6Bm@K3&8E8fe4ob z3;DqLNeEIvrDpor006PH?B2S^SL_}R00B~k&hX|z-LV2R=A1uw4t?Kdrl#8SYtfp6 z|CDC7wXs3HGJVPBAJ}?!|9Pq-ROa8lrRU}CmE(al5YM}{^@!HUhLKbN&v;i;iBU%go0)Sy1;;nEjmpp*464n*wI@guX|%e;oy< zFebEUhD(>zO?rYF3P*uvXYW3<(bLN63i5enAG*{yg3C0ORp;b&BwpD?f&E7{J)>9|I0c3|JB=! z-hcgi8@)4se5Vf014Xfv(9YHsX{sEcx}@GM4`!)=S!5ep)9w z-+Fvi#A1L&Yxh|qZ3kxj!*_aea{J;x6{*S!yfH#E6Tl`ewtR9en#a%&{P*u)tSB^o zA^|Eaf7jmbh58TR8&v}iV!*2Aai}z2SKRLw1?s5>`e{I!ftUPj%XBdgzG-Rk(y-+M z9*u>7K8MZWyML8HsB0(P-e#`?<{B*wz~}<3L8yW(2sR(sicrwX`n_s+Xb7_X{EQ0{ zxKC#F=7GLoRwC! z7nNucZsqA>3<4raoo(6FbyJ^E$AujexDyRV0x_{_+Q6Wqt?j~v3#RM79EYEGZpC0Q zIURjgYdEjrn{fHtag(4Y)+w9dKGp?D82JgDdS|^}V0jGxJJLn`?*iig&u#j<(Hh6g#r0J&xMmlH^1x&8F!7IwJ79Au zcqbjR+1)hcD;nj?yA%lTZ#Xi(uCCs@ zuw`%Q;bg`BA3u0`c^l61hmRorDK0D=9~=9s7*P`gAT~a}wl4c3D~@GB-wk11V!rnG zlYDdynwri)bn3xZ+iQ>{013^TmX-|%V!!K!3lNPtd-lL5W}&;3rO(a!-&|W4aQ{$t zi}-&wrNkTR^gW7en&$BxXiWe;Gl(Dj(AEZK%<;sD8sb`z2PZ0?y_=A*>C;uEd|(Xd zk{B5tcH^tHErk;`9OqZk(LKR0OioRqUh=wl(H&P)xqQR9?EfAIasLK}Cu`pg{mUg}e1oLO>JCy~BRSL~)IZHypaI|*eMCLVV2UR+qFTy@(?S9N*;2%W`^ z@53)*P%*Y9U5+zd?)^a6SL#;=eLoknTBx$gcTWMVT66WC42FYYjwrweJJnvM;qXNC z1j5Ybn5n5NU%f3XffrHm?nKAdT`3w_T3#MOUY8!d`LIarS4{85F;-Sk3B!f^@ZrOM z9;+HB?QutF1ZGzT4=5TLyc6Q(*@NX#7tQI3R(r7bHzB-9O7h@qveggYQ~8x@7|z|G z`+k6jrk~LqL%fZEOX1iqFj+=9&u^;-{Kpu3a?OfV(*in*q2zVXO=+pXc7myBI*w<95qQA^$f6HButM06N`#o|K7Y& z;LejLGcT{M1c4hTc|83u740{esXUyVaG&R8Wwo)gdU;l_Jdlyaj605u+zR2aV^@T36w-|JbU^^JFptgeHDD3w!$ZJzVjLM57z`~n+(5wkt%bb{ zdU?}TLvVr&7CWT#PgryqY_%+sZ{5N%jQdCVoX(snyD*MNWdrFfy2OuS)O!6zHv`*K zy8PGk;wYXgj90b^3Gphp)4t3GaeHU8Q2~t(_Vl!LcHW0)@2_8nM+bwgaRyT&&=%l^ z3W#2_vyj&6T@=6y?CR>mIZ3!U9KlAMd}C$Be^w#wpGw<8CPfAKEf2HAPz`_6`A#^ z2*7-S8Gxnl!X(bC78DfBc^2We{(4Nz#?12vcb?*8^hZ$de(oi+!V$&QKP`Yv<^&tm zdRTUM%UjzsKds5+W!YD8pZqth|L``|2(>B+O)2lt0gr1E-W@mc#3vjjk4}QLzcm-?2mq)xKyscwO~e95MFn9jaL|(w3Vr+b8_u}} zM<3lSDT!O?LQCvbm6xY!Y#5{_$(2OGCM1MY2S@$ZE2Gw6U}XHJD4QAjESBi+1!Tj# z?Ytev7@8E2&6wNhb#`}i!-;utCmDum51Lz5otUB^ltDbXefu^rkUaC!qKpi`d?x*e zet?jj$2+hxkYWW5GfxE9uQ((zLbecX>PbbG-p?=3 z`@GNb9`A9y{WEjSP~E@Z_j@hpbzbLr`sEReSyJoF*-G_0uY9BUbiQ8z@s`7szmF&MooUEqNBF^iKZqhkXD3DPHYP zyKW~9tU92trw2%0`}Xbc8#k6w!h@>8KeGu~UzmR2%H_*=OoW?_hR_aKthY!sanhvM zGYwUdv6L9S0`Fqyd#vWp--n(94n{5oTTDJrfZb*?><+`}F+1kUD<}-=SB&UyY+Rhf zihRq(rCMKT8+d<={G2v#j&0Pnd-(Yw-Un<9aC^12k-S;0G1yi7r;A8=(#bn_?=}dY zL&V+7SFX?%Fns3~WXd_lmYXahrjjGMT!NDdr2!Hds6Drk68rV5;rC4V99Ccz@u+0X zI>eutIz#(tYHOok-Qw)rgg+GbEhA)$5hPlSXKvNBkhOF0a@c41;Mp@g$8Jr$!wEa@ zWyZbE(VZZes?g!p)U5Q^zpbee z92qfIlZ0_<;nCv&Br7Y+?^zNM5b)z`ZfC^zZz=ah!R;pcN@3fpACu-Rs;`fd6u%z-r zjgi!wl8gR|Mb$FpFE#bw*;S}tWAfp*#oFr~jBh2x9=7rDNRNnE>EJLnc+1^8Cp@OZ zH~9VOE9ab>-*oj->c>r;>QR~IVC#D>6E8}Xhvv8s8qsq4PiKxFA;w1LRk_D>RL?!B zGTPd5a-Sb9s%A^x*w`4_)OK-woPJ94Aon?gmCqz4H8Pv!1>tbFalv@+-Me|Yb1lD@ z)1{Ixi~g|!(zyM_Pv;FqmJ!nHpY0elV#GC8ZWVK%6s50_4=f)7N$UGXg}eIDW75enx-KjxhXPo1V)qiF8Aow%S9aJ zGBC8AYKlk+KEZbH0{i&ct%g4`-Qfl?7A`9*v)aWq)l=HGwKJ7-271NqK!MIxTqRNe zvk|(HFdH2`ddIF^mlcdnB4%^`=?4)hN;=?uf*{Wm!hmlw^#e9Eu*^y8d3i>rrbzHf zvWEF9ZoTSN{2`knJGPJIawe14`}yT%GzavbgpmdNp_ZPeg;5%cRHD>H!-p@h`&hKy z^XAQ)ZN=l5%y606ln=f35Qc7aSoMSW9 zB>i??se`2I?xv8JG&IONRGl>+mBY(5&RrDCZFyGh&6rdG_0eL370ellDa@$|4h)Q# zym66G+FgzNcke~uruNarj)wY|yM;l7rsln2haNtDEFLl9Qc{vol#wY>VGaumdx@V_ z*)MYW6QSNwmUA%Z-O{Gztg|rO@Z$277q4|Z)Ru%k@~qf4r!AvJ7#n<=HA;quhsL3O z(ReB}#blGdGUnxZX9dSTR5csTz*_?Y`;^6u-RC{GFvtH&p=Qq*uVZ9F;U9foZ zdv4#oEF25avYHyjH6^xHhmU&gBn?eX#;0Q&ju%ff=QdLRLNLC5?HXpi3%2d^-&H?u z$(^C9^0#O{2X1?P?fUhKNB1-3oQ=wr7jU{T4E}WQ`N_Sfq7o8Hu)F9aF}b?B{ZFVLa z1wn_s?TtP}Oi#bzg02-MOC?Th>QUDx%d(1fDKW9^(hBOl{G}gi-oCwyEJ|G5oZlxH zM=2PwHmadfUNOjhg7J#_(psv5=9ZT6W5>ocCqkQ*^shYPIwj7`z=)+a?<=>T6at2K zeEy908j$!tLuWDs)f|-wZGo%!v7VLaT23^crPuxKqd$H7_RZkit9}GBD>sWXPHl@s zpe0(+RL#t$yS(v>oxi%E-vrARN!XW~Qb|_3UqH+FgGMowfWlgoQ4H_W++3C$i$@nkS?fYa;e-kNf@c;YzN%Ohe zOjc7&Wc9R*XOAA3(D{^P$+}mDUYL4tL3QQhUOjpU zlAd&Lke(@DNfVN<(Vu8*rt0V{_B2I+2)vWqN978?CTC~MhH>w%*GBiBBs*u>6+0s{ zhJaKRI=FUH45bFYq!mZ`lz7Dl*|_!UMYeD8GNX*PoMvi0++K}PY-U-8)|Gi#gq?|_ zId_=$#BfwodwX(H(xQ3uVx06h+nQ!jJ!L|QkCm20*#sx<+Chbk8Qo^^ucX`aRyrE;ypTWQWYKmgH7@Xpr`S@^>+ki;C(aBZDU^t;>vdPl+%! z&XC(2JJ9N)P!mKOthVe~gWy?pb4EyGJ31KKot;H}`?j{UPdnWRUkI=~Ghk z9QLW^Pb4D%A)+5hHak9HHKi4O$-9~AXM>~apFDnyCd%GEefyqG&^qvCGwYaZXD z3%@5w!YH~nLbJdFz%Mj(Yptbdgnw(DpN&9v_TCX z1zKV$wZ`cB%dN6hxRKj`Qw0g#>KL?GoeJ=bYCp@;(1M~O-1QcB1gRg}Ok8SdX&IZi zfB0=|`G|p(I(#as4M-ng8t0rUR_HJCv4(vC^oY)LTywayQE~9_X|yp#3q20(-~WEs z!_%8grUF%Tg|ki1LjP{lr~oI-{r)s}tVe9g=XK%3uA~+Njnuww3ks5DoJiMmA^KD5 z!3A`Apfdc5JlP*Veh|iOO{XdA8HviYZ*;UQy;a|MSw^sRBp>CW(p77TmLz0gEUy>HN1(4f!<&{QFx^MVy) zewvSu6j5Ojdn7CmFIgh5{DynX@s>S!UzDxdN~uDx!!uzYfJ`s6s3!NmR%L7l37NBU zB^6oa&6{W9<2Sa|SJ+BVQO34AHB}f63+y04Ka)z9Z@`&xTbQVnfX0cNTX{KGUS z;040DuJ@nC)uv0?vu6+R88uBLOXYY>{Hsf2m>C-Lt_WAB^f8*cw;PJ&}!ZYAovL}1!o?28x9i-;L zN=mC%teE$qRNOm8rh?89z6AjcV6=ScFw*+K#}?y*vcs@pw0YuKs&w{LL+IvS^8?5FxuVK$hgbpjU6)FiG-LAQBQZ^y2P#KNWaZ>gQ3JXJ zKMWT;oR6pv5u>-XGJWe8Zt14T`pf9{I|HvHrU*94`|a6hux#JHmY-%F)<1Xu@#862 z-C>B0`S(^h5l}PBBg4pkOVPu#v%Bv6Dh~*Qrn&QTXy<9CsADvcf|<-*;8EDSf~g3x za?|dIK7Uvq#VXZy`En3LIHQ-;v*!z?T>hC&Wl4<0TR(VgzVqyv9&E9~pkYkke?TM3 z&&wmhXUNq)ENmnGjiyBiUwTwM=;Fu-ZTmy$4wTIvyDzFo*GN_QdCQldfEAUS zYd}jNrxaRNQX)TKz^gZJZn|qIOmgx~p`5&~W>^wZwS}_(DrFr7C`dF#8_^rYl9?WIz3E|*rhuzqaG|jk`3k#+DlcCP@eGJ@RQTAHEP+w9T%4+Z_w4|b?t`x zMXTv1e%|T~cY=ctB*2tPRBv8JT4y1=+Cya3oMif4y{*#3*!X5)p`hvv*=&a%`P$xP zR%7W+GL53=v($LWUMTTo!v8J=cauW3wGT5I5Kg4WrA~U- zz*>l%>${dOZr3;M9aURWnR>*|#B-LbYYR38u#K4Yy89^lMtyK%D;y73#A-Af8k|cF z!DGC>F^>KfACmu#*&iER)@{*1Wnj9h)gSF09T(bn@Pl8yeS7rCk?L2ku#AIp`L4Q} z|8>{h_U{?aFAa&~#5HT{QlzcM>Yv-TRd+GzRL zo&U8Xg%5nF{}Rj+sbfK1-__JyQH!PIw9WPiF0^TqPTvw==cc=O3L%uqALSs&6`R-Z zPa@A>9BCEl&S@x4Kh?=#5P0Byb+v+6OfRPxaD9M4RmTmP*#QxT1F_rNn;FIXO1INW zu-;L(@ha{S5w^v_!QVI*-XrOQV%=5zQj+3dgzp(8Fm98(g064fSW2<Owb_qTt7xa5{R-thW|YkI}&Hi@K1?UVaOnl%ip-eO47*4`f9_`s&;Xh|eZfe@9J zEct`f^7`6rlnQHCwWXBC+36<8d1%*iWYFay{TRzWfP^#k#ky? zDa#w(Yx=SqJpyFOQ&eAma_X~Tn4%)@z^O8=_s96POVr0D^GM5UQN*CyyzqMRxYo%| zAw!v5utO3(%X_AZN*?5XSWijSrKNLejmaT+jl$bwu_i)+`4Yd|!DHgQ%^T{){(gQU zk!Wak*&>z02|sSO@AEH${riaJ>sBRP~OB{>xerRcKobVmR zMHB!isO6|@w3`+SjXtLZJHFO) ztkhwTO3}+hzlVufWA+q^r}~O3HH^?HhpgOYTuo0u#l)v9#v$SBS8ZbxlZR8pmIgoj z{eT<~Vpdwch1KK$xnU$0jRsH2U43Rqdy(VAx+g~{hi}fg8}u|Goeo2A{G}##J9=$W zyZFu;CQPCjrx&Mx$#z}oc+7P zzHGZg!i&lTiaX8P%d_9*3|USK7+crF?9f_XBcn$_eD_IC>Wr9~3m1j;pQRe`?j<*n z-fMcA_~kwfEAQ8|K%PX9<=8PHZ8|%rRLW*p$EA%tP&qWa>IT5_+Mz&~HHYsAy39EDTJhHoewLN{lpPESd-;g2aw7pzz7+GRq)c_+u>v6zAXY|__tJRoy zG^?a#P8P&wfjLFt)e)XB(xcl(0OX%=JE7ACww2+imw?se^u*<grlK!EN&>C~ge)X$c)A>C=Av=UpLY7pD_Uw5>is<(ERUZP9zJlF zXJmJC8KYusO}QwHsbG0f#D+HXinQv>nqfCsfU~P>oYVLL%Ilq-AMmH`n#0US z)6Z;vGWx*W>ZuFqRH!Z&fBFC=56e3w28Q?>Q-uF#_jT%D1yr|1rQfaE`Fv2h?Se=4 z*G%fZcrTM}3V-e}6e_YH#R|N%a!L0a6J?dp@OY<9^JJXPXr;EHVT!i)iYzyWl`Dsr z#dLFK_U+Da%eUW1!Zt$k%|LDQ&r&h9HaA;F?vS&PR(?aO5tQGkCYP=DM%D2$`%NM&pgTQB|>pa+wI_J!j!U8y8KgOzd5f<~%Z%grP0R3xUlzLVs5pfucWW?sa`V z>`0@B@qzbi$OE09t3&BF?t{wmv-U87q=f(a`7``SXK|Fg(scJ_AEkSYmsl*N%IY%O zWbF&Me_iT{hH}^nfmYs9C$zm}>3?W~kyrDl0s7V(&_#5(!431&|!@2Iie@hjPE11IXNNBj1m!P`+Ro)R$(8mq+}8V zCYm{9b)%x}mM&$AJ81CWLibI7j~zE|(!_~y(%3_tZ*HzLaiX(}3&!Ft|NJL2*0;zH zaGZd#LZY(3UZ(6ZOz~~%&0tVVQ#07l@AJEeZS2+=q-YicjgnI`<@y?`20gV;;W>tc z$OSw<^ow3^YE{n0o0c!AkFL($bKP)MhUdps3}^{bbQN5JG};-k6Yr+Kr0La3Cu>&* zxroDEhBqYYNWF0L=PBfLW@g+jfs zQQI#tFuz3FhdaWA0+@)|S}U)L7ceXOS9}AOS_vZ&5rTNti4zQYh1nGB4jNv#FDO3I z^_>a}TWn{S*xSl;wB*Rgt04+p=)mA$O?7pVFan<|b(CET2pX3BC~NCCb#)7>rb*v8 zlU{4wBqb%?IL~;t^{bnBvownqbO9(awa`QG(=mseIUaa(jK zYm$zRo2x6v<3v4hYbclkMJgYaZxrf~uex*RQd*iDw~_QHZ^ROR=!h9KJ^vyG2%BkR zju5Nxw_e^5->5z;N~iuWWBO@cKSLBRmLTDl@Ym2SJIds7$CU-5*~!j6sr)CxV#Ss8 zZaUA{J%bYPXL$I{nigTlwV@KwZ{wCNUl~_z7b`AK#;SpDR$HY%a(Zdkm~@7o-Uvn+ zW#=vHw?#+W?S zYFnc+;sc@&3bO?|5^1N}LxJ8$bkHa%u6wIc^+W!!-)QZlwomMZ?tay?XN)+EjEn$_ zz$Hl4!cggUN3`NRhaj5oOCZk?wPcirK_WRmNFRiBen zBXa*ZSWWTxB~)PS`3#qYA>LKMF;7Zr2drXnJ9m*ts_6{X7DFb9uP+Q@jTM*Q0N*|? zm-i-iLjip-ofc^8>TKd7El5%qeS=Q8gdzI4qb_2xlut)sNXWhW_j7l)jENWw4FiJX z@w(F)`vxHceJ4#s`7TQi>-qyyQWnuXNz@JI&kxwJ;ehN?VNc=I zIUo!8762+nW-y7IoRSC(iHQw7%L4aJ=o9$Eo8qw;9)LwLT2=M!n>Qe$WbIsn6AeFk z)3yk@w4zKGKhwejAdAAn%#6LFFEnB_UJF6_k`6$8zuUD3@zQ_1mR1sqG6s8RWt*x_ zn2-!@`2PI~U8j&A6xX#%v17kTnUKa@z-<2fO6Vmt7RxnQYKIWTdRxuRnY=2u_kxyC zQx68`duYCmVjh4Z;--=9(ZIZYvbOf@scbD=kox(n&7VDcHaove$cG++0CLrE6lBa! za1zcMF`k#Vwu{QEr%V^l7tJLDrNF_OKZ~y5uDXXm)%la}ZE+LK=$!emG8PQ=5clY(i=YUjrA%LB>I@n!WVkW!Y!JN^}{|f{^!fq6mnD3gvG)~n0S)W zsuz?B-ovcu7nPM+kaQ6_zZZFuupzt$sp=2TV*cS{!=x8Mmd@ql82XBmE^a3eShpBMhm z=F0rJ{0F{t{_hgY3dPko8RQdf$y}$^v7&aRnHVIqgv0d zm(VYL)5BPJ7J`SUB#a6TvCb;8EGtZGL%3vq!wCz$D%`og)vfOApm~0t@C<7 z>I0Pw_C(f|^JB&s`_>7+g0(dWu9;aeh#qN&Y|0)4BuHbGOh_jnQts}p)Gk!%ycqWW zE3RF;M(IPZCpOsgjcq64HTd@9*WR?e>)Q2zszffNi4w{lz5zjt%H3k#Jm$6>3Ce>t zL-Dq*WmpJRAtpUt@FdNYL*{mk(a*z^2c?6e0o65nVd|LtiAX9IRj1}&Oia8xG04}q zh))eNN3Hh9kt3P1MC~BLi*0N= z8nZv{VZEL)Hq#-_xQs}|^bHm=700O{_Q?(R~MZVnu2C8fLT-RSkk@7^)K zF~0ZT*D++kS$nU&*IF~4`OG=b2PFkb6l8p4C@3ftX{nbgP*AXyP*5;hi15HCj_V}& zP*9H!EXBl>q{YNYl^pHOEp5!8pt!@s)fepN)G&oU*z4tD3uRSBJjDvFP*>G$BET=} zftQZW+Z4rb8vaV3+wWqBuL|L;pR`raJcF@+a`DK&8i6>Ny51{u<* z2+fIbLB5wlvmP@HbI*Ip=`I7ZPm5d#v)lJhE*eDzk0>)lZ8QaZhz~9OF`Ce7R#dtl<*?_}IrKc-JX)uYTyBY+(s%0xqxqFvH%WK1P_(aK;8FWw z9k%u8QH8s+2p=Vaz zDS=hua6c3nJvH0)So80C-JOI|3Q6XWupIr4zW0tW)fwacPVWXOU5uD%QkcKoBBgzF z7iH)Kx}(EnJz?mm@xsi>vEYj_h83c>LrobH2AKP$UK3*#ekbSH*4NQ#mJFHh2%TL| zYm*)wUR5yPRx%t_i88l()ogD)ljASyD4Hue1tag36x9VsUkTI&cBo64*qKL-^9xEu z1>p>m>UWuWdyhHXKk{%5YoIb7=7nHbYSH{a$P1$4o+FWtUy2io$69;5*6Qe{n>gnx zeW7-taiM&naG`&JXZk(HLHk0wk=&a?FD!j(Wy9on=dGvi6q|gDzA9^8Sgo$7^neVD zRE5-+zDzI^inPfDF?eT@zrnrLoe4gzvu$eXtctthjm{$lI4pOOASUh_+dDDq3E4m? zqdD-?8g0Ah-Dyc!lcb?uU(jDm5n43HXEq|ZP&97T%cb8XA-@X4s&FDr;^izE@+2Gc z5cct$wZPde+)aBOKGV#yuNntgd*NGLs8@ON$yb|Qo=3@}T2^3-d2EZca-Xy#hotb+ zIaAfKC*|=HJogFCqBa-#jPs*!)~H$6byCwoZp$^9(0bfiT=VY_MieQ1p%1LC&ky}T zc&({+9I2=W?OPYHhAS)P$C+#9PAjq}9qD?!$!kk#DMV6#D475K zfveVOHRh?z1dApN1^vH2oS|W~Y!LtVmWOEqu}S^Se(YsC{?{OE)zF4YyecTal)q3rdnmb+g~#i`36il5+F-FL1t7nG_AoGM2>g2%wv*L?2s zQy0`{civTwj98ENL$x+TU$u3_#>7za@HBO$_BcbA_Vh>;m6U9cML8%)NlQnA!D>at z#mF00pY>hO_ZIT<^CjZ4wN;Icb5>VZr7SIrv{SPne0+SmJFZ^c4Qom{Md^-_!~&+< z(`DI=oXcirrlvnc#<#Y%f-Csq7#L}3qloxilX$ZV&+05KEmidOiDgoP6Th@`F0blq z_O(wl$ah;*R)ljmL9nVTPGv9-@iSWiw)io^MV z-2~ZbT=YsJ5T?$lYVx&aAg> zeE9cRlDa=sg0@$LC&j;o<2AW36oUe9iaGhe$IP(+0hrGCxcF}Y5Kcox>kNsF$WQ+F zn7=k0qG58~Mj_X~B#{)21_rirIrpO_^}ojqH2_gG-{tv#%lpR>{@7J#+IU)7QEKJKNq-C1B#$z8d`ruk*+SJRJ8TMPB|F8fk$gTu3!l5<7; zl2Fi(kkC5Wlq{66V23Ej#>Pk!4SYQc)D>cktF-H_5MmVFQX>D91b-ozNWrT@OdK3H zElO={*^J z`U^t=G6ExPf)0y@W@%@a5Gi!0rN^A889|Ll#+Sx!*0N1k;gJ;Zdy_60DqoG0(=jpa zR%(6RVTd0oQd#!S?c%3?Cuw+jw05+1?xC{AFDU~$e{Vq*P0Qg|9>-@79_iS^`%qW) z6c!CpxD&gRjqwdI-v#3sC56w3ti*34NvajVn~ZCN&bZ&;FK)F4+mXlyhM8uxjPrS- zPDTF~3T79M`%y_7LdAcYLTX{CK|>-@m;V}^eVnxSOtfT*J~=sgR~LO<6R-?miivF$ zmm0txQgU#p$Hc^lf}FbtRBuVbZArl>a&mH*QzTnPXSs_w*r8u)hn0M?x9rc(8$1ni z3kuwLsguX~q<1Z*ygu*vd}^QO*3~K9wGOA)_LEmL=>ELXaMfyPu)8F5p ze>W5yzoIi0p>Pyn8qdcWc{ zW}Qq&N9S3fuBquYY!Zk^@1SmAz!DxFZeCd4%UhgYZ51?gE$TB?A~HtN#^m)9#lcu! zKD<45>oGe*B^w*t35)u}ya=+kwq@Le>usksvykGqST*Nx*RxP=^hR2Y*k^TC_r+(b z=6(j16)0Ws#D>vT)fMVo(aOEG=DzlYEP+)HdL`|dGrO*;=i;S1*6RKsIEA5`cBK|h zz;L$H6zvX_O7B`vy$*hOllusXCn7{#?lO9!KcwGV{@YdoUJe~Fa!KV`3tEGP4Aucc$xQR^vAaQ^D{HOi>CJmTs z8mxS>e_LZjTnS*zsQFFE|K9X)t@|@l|F!?O#Q%#^tfHtq?B~^Hbr0gU0#!}Y>ij$( zG)HL3blLVDZR)`S_4lnd$S(m1^#)z*T)3>=uXyPjVm@wyI8*={GFm4x8MQc>zi?=0 zPw&?0H}yv(7dFp+9&kG13r+6RrqhzkH(!x3YS4s9kzv#y?_TMopWcuX!1-!?@Rx*6 z?Jbh~IX4>jL4lo0%RKX@S5+v|n`m)#VW@y49I4HCQjGf5FW!8Xq%ep{iiTi zvVMVQLz*5|VZvd^4)7Xbu8hN?q$x1dl%b{(3Ss70T7P%KB1mYh$RUyM(Gi;fv=9}m z0?hO;VG^bV-1mEx*y{f>TcXSWTv*M;4E_(WcM=3$nl_JXy)&w^F}!^6Yl zxLXIo&p(xymp__!8pX>ORD*?v4WsGA)#};CuzL3&iy8xzPJ`e{#(%&gL|jEcArG(K z;s0~NzaCo)*p(^xw*`NHiQh`yg8|r_R>5qE{~ELf>`L9IZ*>20H2#MVHm5?d5dA*} zg$V$=V$13t@*k@(*%wUy{<E z3!}{iFNnpLJ$MR(kwu?p6@ZHUTq`VqJVgDa(1G_?fVPe~+io28GNiAw9~|99vQq44 z*<9Z-wfYD8eoi)a*t(JQ3OoEiVk@*@EMVWOCSq$JJxu@e8Grr=RtCnN&sM#7{2ycg z@4o-9eR+$_y`}dc#&qpDvsoOuI)I$`KZo7&b^38VIBVSUoc<-#pIiPHd^J|ivTRYc z*VuJzkNRSKKS2$MUV3K&&erMY`u2%2omXOFZwcMzUoSh?@5t&}9Q+iXhcgRiht^H2 zOI#=S7k&q)a!u3siJ@6qG=b`~wYkf~qnlvi7o(ZAuc>72kfh77Gy_W1OEf+Vu34q` zVEjINQer?qzL-=@n!}Pa8V;_Tjv~g^@IDB%{}-$1HyE+0bqJA!nGg$ zsqDgWu!2`VC_Jt<3&g6=^7E;iZjJ`O7$e=4F27#s>F0pxVZ?YU{{cu2NzoFZG_P6EOLaq4ce!-$0hzS$< z5j*ygIgX3tTvn;M*WB&<-N&9Uda<-JWIMw)qbZr}v>o;kfL251ZCcU~RVWIEQ_xro zg!>+8k@#L@d*9!lv$-D_dK`YiSdZ8rYV=x%p$J8+Y ztQY155j5-&HQEtW0qE&g$;osOkXyQ%x_ZB&&@H7R z|KYnrscS4vy=;U^etC8R+EejAb@D+)!_%a-0tj)`mJ1VzD4~rm{`mHbqmxCPgoxNPa&MA?Zy~+9GDXKuHjS-g)a4*El2R(qs z3Za;o&uuTPbM|vX$o#yXGQ#Jru1}@XwhZ(aO(wlhYdA$J+%z;2e35K@eA+DMvK9C= zrNi9{Tu031w@Q`k3{-Ymod!ln6OWD@ZxNtt>M3}5wC}wQ4G3?%Iocy%I`%1Il)$bTVGOBt)>Evg*B#P z@WU-L-(u`e_0z`;0k16<^$aPJ;KI(7*-s59l}+2`^&RH+LDz4mcYLyEjn3K~&I7Kj z*P#-w1$OKruj^*+nj2`?8z?jum#pSqp9jsB_bO+eDh=dQGOq2rDb!$!YB^2Icf&4QbOpw1k4?-cQ*ZtLxPcdAOXYnl3$Ql+sONh181$~+`Ad@eA;P3wn9(9*J7>cbO2F1=&s2c8|iOc5tG^om+AfM6He+$`GIZ z41W1J0o31q{2%(fESa?iF1WB{Vfv?@|1x&0$xzUYu`ak%|1r2M4;bLqQ|{gW7?Yz0 zf_qaU375Yt)o<$=;10k$EPDY3uYZq0$374#+Cj>o-#+25cO_i}(A^i^$VvTwk9C^D zaK=t0ZUNpW3MLerDJGfSqCR1w#XLBzQcY|(c! zgl-PH*qncixlXzp*#(3vg8OIrwofEhiBc)M%+31G8t_fm);Ow{-Vk2;&MV+K=r*5Z zWXxt~msm{qC2SCw&Q~l@ku8v;q!Lyi_#@*v8#I@;w`-hvQ;H!g%36ZTebdFTiS)?2 zG6v&XrTfb!J^l)W(R>5SbQ=Z??v8M(=62Z{9Z7gh07!b%scR}bi{IpZNfGnCFPfy; zhx#}~Kb|0=jg(*_B+q_9$)jxP_DFYn*%fQ()kri$C<)}qkDlbrvwflUt&BnxMg6@p z@ysz>lku8KHIrF7Ki|c=tH*46Bj7*R8doB$`95q=V}EE%)!pBZQ@ukA^M z#Ql{zM)jVS{r0(Lenn%kteeRM+n06uP4h)uR+AXBf!TRPBy~e`XI5|TbZ*a2AqEZb znzBo_nB&H|!+g34bB7|=H>cJ_WrIaDd>wYv1`QyKmM5)$!AHc@P9S>9ZEx2XTHM#= zkTX!U0@dH~4vvFLV@OQ~A~A~;$2QDf)OqjY>N?5=?IYG-C6LgS4c9+C4&0ePKd-Ji z>6nrCAUbO7$SmyGhEza~4-IS(f$-7hgrZEi(;}d|`(-k(OR-!AzqUconzQt-8#x|= z_9}Ceatdctw?+~RGt-FSFm04rsr|K{t5cCGJ|rafNoC(oYocyqiSAAe`p3w`j=saP z$yq^gwuU%8XwB&PDqTsV<42+!IS4C1v^9^N)l@H;c?X2-Gs?6tR?Mk)UIM zUe7Hpm9xJL5ORwJLI&y0DYgy>SWTM5D0b)8c0z4AZZ)GNLG>|adMdfLiA_v94v94{ z>0ed`9rLS2rqAkTK_>ROI{sNW-&%#wUGCI3#bw91(2w2Z(}aoqah@HVWqO`cIWKPY zsNQ#lu9D8N?^?~4>2lq+h@ke;CNu7C6os9Y@vSA~Sf4tAw=MWrl_%A=<{In=G43Lf zpd(I9atONSg4dA?yxCjz&Kh~-uk=%}7vq&ZzrvMjlwe|E^&foiax1f5EiafbcT6p6 z7ZMl}n`RzRvseVMh=&&IfiweiSweo9M$S;;R+Z67c&~fJYAvQ+ z7z2905s?pDib3Dv1(mNOzs2jm=|ChMOZK1Ki-|nbr}ENIqQV5DUq(NtzE4J6DJ%sr}ehVh0#GXlZ6%S?X*6(n*T^8 zo8X+$-!(sr{frn@JL#SOcUYMv%eVo1-Fi@$dIa*%`CrN#_PV*K)U_&OgBp3P zTnxYb5ubhQ@ITM&xMc~Ydcs`kx~o%ER(9Hwz=J^3f48)5m3V}s^dM7=a*exleg;Lx zEk-jOuXh^=0!?nOPLIwz?iW~3v&nyM!y>6$^Ru@M z^q3Y7aGH-2Bp&Skfja4hlbsI;<5G@FsbiWff)~Cs!nr{G7EHLQ-m`m!&&jh~zx#sl z@2`NynhJQVno}*ix2Zf+@AzKK-siD#$^#j z-xo0UKhrJ6p1B{?dj!rk!K$~JAxGsu@V~jeqWOZQOJgX#{^MnPt=rB~R{j$&K~;SI zwBcBuf%?I#x-5-PpR+M>wHZ?3nPW{z__^cqRIvYk4Bh?!<%RpB+ucUAqa(l9q{gx) z6UIZbLFjm3^h-anCG>80W8R8TOwGB_iwSFUAH-UWua%R`K2F>(t%5#3{_T=U2VlYi zu-2X$o+6T>c|xDAu}`bUE>KDGt5W;<)`;3$0r0g^Z{D43`a1pWl4fjvp3$|%@A_>8 zgku2CekTs0!!(TlzIKJ?e4|67U*GM9Jkqa9z!zU$_7_-S1zwZ!ku!`sK>Cd#-PGnu z-yeCbAjD@gfc>dv(wROL*S-wZZ~1^hGtd)GfTE>ZY)TnG!pX52FzS{#<)*`g^+f#> zNlih={q6oy=KW1?g*m1v<&Vqr?bua_qiF<50H*HX_v23Qk)!ZT{erxoVk?36?Z%zr z1jYq;XcW?FL4)^Y+L%y%hgL3?w%KCs*QO65eVkCpTWVSQd`^maC%Flo1r0+Cn&okG zb}jPyzL#e9+QzO|QTzn^Wl6gWV=s2Hpz*4g>!Y*j!c_i%MV%G^-65zNjSj?Xq+@)1 z0W6v3KWMjbu>!=-q^1{1s)**pkr^2tpq3o%7#K`Bn8?B!~B{<9_}+Eb|@t^^;KP3!O&X-RP5C7ioy(=2QHp` zhv+NvZ1+Au{|9E@AbfH1_bRxeDH$xN7 zQvWuF5PG^{e`A&vwi7?in@;nGZT-y~BEFOHXRj2clIB6|F6so)oW!6DsG2pNk^bGx zJt#2RQ|OUS02Q<TdHotb0l9Df)}wCT(=?NIH4!fo2)GJ7!lK3g%hoo z9#>1^1gWcmsKu+R-{~AL8=v^3bleZ?Xwf|8;v8H!E?&zpslElJ-2nR_9&mNboTvy1 zP1CkZgkA{iut^JDOOX6_nz_9i9MB(=`DsJM z{T&@vz`EHAgJy{fbZ!eS znk}<>>m~>#Dp- zVTA5)YU1MK``c(D&|I)RawiAk8O*+fU>Rwbo$g?qI{Kvxi21s3dg)7MKKjCY_fmUh zhh{`maq{>H9$UAQem)Sf^ue{yjpY)#fj3dlk)X&7kl=t1zrw*py1r|(%GUifENQyM zS2E~}I_9k5XkJ}+T1p+SxchB=)PS1AOY6sCe{!`=i@@?H2K9KH`=q&Yi7sS}xv7=~ zIT8a(Dy`K4F<#VzOD)V9K$||pAl1#884DeI%kM`glQzf?g;YK(IhM?_0h>8a2E`vm zO7{p+oVWT+t`&Zw%c(D^-}Jv4H66Kt<=9{osB>6gmBO0NAjTP$e6_j(s6 zK|P_VJq}*8`b6-&RAJCynK8jPVK_#>EW{UH11S6`xJ(ABF0wJcR=DMa?PpRJL_WC* zs_}cJSp??bTO0Wpe&6&%+OEp=bZlxC36~`;n!?9vnf%GO4*{0cIKiPzT%Z=4$`bYp zn9bhXYsyg1s9z>3m?I!RP2^}7p2Z>-x3a1Qq2h^_crm7Uz;lzHzG1E2B$Qc z-sGc#*EZK5T1BA(Dv>C)m>heRKixWUtzn^qi@(Y?chtrb%}?yiU~8rHa5)%XNUVuQ~7;Wt~_HqB{5B3j!Xi zfoIlYX0~(d$I;!%7=PBy7;*#Fm`yKHi3}iob35U^+HGpj;$_#>1^}}Ytyj0S-MoE_ z?~{xXR3K#}@n&hT2FNzeAH9yhsqZ4Qzg1z`*h@8kh1jyd{1}@N?X;n!HlJAx+m?tn zl#^p{_)*7nO(F-CtiFn@u=Vl!@UjEi#$Z>8DHuYnoh1_a`@GJ$XeKaLSsMf!HWMsCBMN5TJZ|UH0OxI% z2%@Ht2y;+GzNqjrxCR(`zHe;vkIS{HM1{mE3_5)Gq;GCPhI=9Ko3ZJnUgxVSnw-cF ziWKnmAt3VdkqJc$_JGFfR9TrF$`o2svK2V&#t`@U9@+pk4UpT+bM>~5n^}rWO7e1Y zMD3c^60!yX7M0C*_QmE@sI1hRp0KwtcZc7xFKZiR(#pe+E|R^vMM8b7bDGms^8n&+ zumO%d&idx!@ao$Qx=wnL#_=~zCa&urJNcAA5nXIJ0oTCY^}c;^y|VT%{YEsbLIFYz zIyi71g;g3MMc%u27yM2uZ&3xKHYW>Y8|)UIOcIUqABUBKS`vWr2hZ-WSjir8EVkYZ z(Wx}&FI>foh+sg7dIEwVwiw=yT9pM_qrLei*vjTgQ_ctE@efO7$Q#ffOCy^p=<`H% z9}wC(R+nt@9vmt8+5sU2wvjVy@8?#p)B;w{*zVFL!mT9Rep=!%7DEnStRk|%hZBE5 zK4JdHXq`tN&zD&2qL|d53MG&-JX{5UD?)`t?@F5jK!aR&agYMI(F<)H1_)%gYGsLM z_EvHS|Ez$!VeX`QCuoQ4@?l{ufTe{Pcd~c6@243?%k5lRS|YEwS7OE?)S}@c9R4aU z;#l1%4a@B7RbW%{I%L=?T2;cKDM`9H-0G(`0gpxmSj5ZVr0G^M>iuL!gj4yW*GSbr z0pdH=Z#%aw+t8&osC|z&tY`@W{9zy1mfT#*EVDW0+`Z=Fm}aN6X60@win619ENM1! zmljU>%r%JL);dm65p4U7C^$-g`vKygt#@S`gB zN;rR*|6rtmhdkHSR>>Nm=^S!i86N9++D(pmMq6Uyf8ON>D~Hnw2x?3+-VA#-kOS&A zu6pU+cITYS;-OBUrc1uNA-mu`9GjL_YQf<|p!Vn)2F9tZ2zZS&TES{TLatc9{j6lc zj>{P1gg39C;CenniHn?xiHUw&;~M)Tl{$?}a$Lon8trz)BE)LJ%FlW_E+!^NQvl!B zijUJug&4Sd*nCKg(eJEIp(Vg#^BMgS3CP) zPPDRJ(l~p>Dfqh4&_E;Fx$FTpF9NWjAa*@nU8Yj+BlC8n54^-`s5SPgTWz+vD>^2` zAeU+y6$I5S%nRX(Wv1DRY^RddJ!x&W>By>5a7E$Puqu%2=(9qp3A1`@6`DLZ{`G62 zS4tB~G4$5kyrw3eZ?-&1;WA~AVCktrh;LbuWmEPW^f_f+-EAj6QIKDq{mB$-+&1U( zr}xFNSD*1wP|p+1&hO~srlaWx1@=^4+<;w6uSTVO_nK)@4IXJppwuE%SGY6?smvK@ zZY$3P30>>B?3i@tMp%A4Bo1AFT{hc*d&*9M?~~n*TkIqAVtRMmYk9UQ{%9q^{PKcj z;WSm!T}Q!o&??hn)z!V&ZO)S3FeWryy6_>OI5wO3=H znMj`Pek)rgYUWTtS!H48b#npl*L3El(|g;PP#R2`%y~*nM{cuyzQq2hH>Muv%VZhY zMmlIPfX`jOYNMp#IJo^W;@Lvzyo9`&9!s04hnK#~iU^OrAfHuRt0obSUpEI%NSv-& z!qhYgZ(MBdT=71CIXHeE>`Xvg4!NUU4!KEwxivW7>T%5bWVL-bgDE_Q_SVL1ulVZL zt$;$_m7CqnaM`sZ0o3YVRd`r?Bfog{dC9SLts(7(B|1>%wU2|mY(mbsv4D3zcZY|b z>Fx#*wo_*Kf>B^3hVQHvgN0Co#E4L3%Y5S;ksM_2Rh$X&wYpt~9_5DPTSOA^er(GC z_!ime_&KvzBE2RVN)R(~%fWM+T?Z-PT$pdq=In8Ty0Q@x1U3xmVcL;ys_WK*&U(xX zYSSL?%{i`ykOXvgFeP>V0HUc_`Bcuj3QNy+e(n}EVl`D7A=-pALC4SX{~7# zUDR$>71UOy3bi9-9)6mrZ(7~(v3@}l_cNq|r98F(XS$!kVqHdAW0i#q#YnXkdy0ZV z8C5W!#$~a6CG$d^Ee6B%EEB<#kzst+5pU%nqo?g=$mB~hZjwLt&JQ-T^Klk+NA22M z(Kr~bpP2Dgsv496)kX_WC^(@$eeKxE4KK6Z>tkQUlpsq1+ue6mzXJxpvE(|^9G8i< zWxWGG^6ic@tu!hQ$(LTWJGOO^qpm#l?xQPYUEw*pA;i zdfd*;)v-wUSr6CbO_cl4a+_XYE!8T_-AWg^!cUjlGdzUg5x6nbkNEoMTxW_@3uM&Q z)#s#r1^iCBZM18;n01tN993HVqAt{FlhI#M92^gKx%qr}#oh+cTk~w9Rsm0;_jh>{y6etNjaX&AM;bKw2+R-Z{bT_zR~ooiLZk~9>NLl5 zL(PpVc>K2OS0`#d{b}5^)<+%Yr~CsKdxMyCEJL8hR=#>#hIoJj}pn?PFcg8zIK>#1^57n9z!3I*a|-J+h!+ zF}`E<7J4Ncoc;QY(EanI`_)**Gwub*hmT$b9t#G9JTC^fXIk466a`_uv9vmT+lJD3 zRP}vM)eUgQkJE*y~YBA|!*9;tR@*}w)^+k47f_#7fA%~a}_A^x!W@oYl=k8A8 z4mje|M~A7`=RjXXLfdujG-Rv#g&z!ohV7Ggsnn-7Ai)$xVs1{|4!tH;3eWm+8^1Z1 zlFniQ&*u~M>fb$JVbu-_va(2FtdDH5_MU(89$bi#4aa+ZbJ*+Vi1V5KhHgZ5(WFi8 zoS$c`1r2@@N43^2jqQ_@4@`RTh&igoku#kqH$-v<@q)qObEVotPymoT_At*$Izt+s z=CuKT=)%BO=v=A7X>@r-zqGOCs)hfHJqJ)d;=ZC*Rlc~_pU~lNVJ7)QapUr8DcT=* z++ZoKP{vPPxV=U4gNXS4b>#|BVaR5;q{I$HiEld3ip^)XBMeM?(!!Os_)35xPJ0+h zp=Ony`x>q3I1cy0&(43|8i0#!_@oqfPmh9QH!o2?W^FJL0Yv3OQwUVSBtJKi7&9w^ z8R6Y##N)71lN!j0`ifR)=lla@yeE%_%-=r%_9;OcT?He3V#Z8Zpm~;EHvP}|;sJ4X z1F%m#jJI9$1V|_jzC*$=J^1!1Fu)zi(!X3#NqeXq?ncAHi_2VwfF7eLTha#z6Cw`r z=O-2-ApN;Rq=FC8w?&6!-V_3fcV%Ia@&wnCw@F;F66&8z_ zi%)=g#5+(6q5lgrKlFh7|Ge?Z@*#$>!UUl&hnb^?`<8s-)CChJ2s%yA55dYAJ z<4mQ_gN23lEF^VCt4sq=z_XT;h6Vw|g8VCsn#B;%7^bGi!M)lcq}j)V;EWUcWg=dA ze#r0JApWJH*+)GdW{?752E77P*6C5?>FhCPzruIZw#FH><JGZPV&9 z)~^^21{7V6)>%%EW@i>CXUyA2QG+I_3flCTdv}t_ReSTV=e&<7{Dm>$>>9tr)6vt% z0I)mDIvYlzqU}s)Y^@XszwMegsqwh%^v2AT{~%C6NZn>o+b7y3W?~+(+znC#0U`P1sl{eDYQYMjLBXPRJDF+>bsLnwh zsFHE!YJe8GbrkS>r|&e(;rJPerY{(s0!BxY8)sH!Ep7llv9&5U14@HCn~orW6_Gn# z!DBUAGS_~o-H2A8l6;hBgHZXD{1?@Xh6Ft-xfHGCgb6wPL2})XvTqYNdA^JNMF-b@ z3gJvX!DG@j9mW^@&Gd4)L89rz&^M1u-(LBn5|XoQL;pjBP|Q8>;dKCy4yzyN{ety@ z42R$K+3v*Hn4#1MK^~-|2@)qNt|@PeNW5opGJnzAFXc#?A8Cmp*UG-ncPdiS)J<;Y zUk_NRZW-wD1|*c!4i@bDdi3U{YD0sj>zkr&#We~RR-kUIuc9`VV|sepl`T>G50ybH zfq9MB88S7J3;I)u3SogRh1HWu#Y8Ly4Oq}BkYdRzDw2kON{H*MElK1O2SoT3KOBEn zp*~2`5EVed=-rCj{;u>02u3XA8v=Q5=8+67^MDD1gE6z8uc0>26K1ptkJKv~{ZEd(3Vk3JgL z|HdVJ_vqyjTp}8LcH1kTvXf!?n9rr%q%wzo<8FzN!RSY^R20btqtrkey3rRpR1j{=PJhnc` z)12pI3s$+&bza<(@VMC4@i@HZ_3)B$yT_(}sO2|wfadsm*fc8XyJY2nT^s}jBZ8Rb zebmop+#O6R^R@1WZNma}BFHs)bz@^c1@~J`PEHO~qUm#XWW9qPg|^w_{I%q&D=;3g ze^IeP1zVA?RDjk6QG*3DhsZr?k+^U7IS8k+F?UT!j#C%T_c-QAz}a?G@HlOfPWBe~DA$ywZV=Pz+=^|AteT$C`0D&j zZ3c`zbVz(Y{xo?7U*&8Vnr~IGE8yj6XZW}V^Vh0Ur^xU3W60nusHVhz3Rukn_m|iw^uUJl*BJ=m)qd270D;7NEa&mqy}nYKMrxOiCs{OnQT@p4RnIi3BMl%)XjUbpOoz7~}9o zs9YmUt#^-aE2~6_%jcL;EzV-e>eVtK?fv7lswL9{nJUL?CzvZ?YnRe13Lceqsr<=P z2A*0NYpdxU10VW%9F=uYGv_2EmSDk9XAd>3_Q@1+4D9UeqSnS7KLz>|P!54C5ow0b zn%!v>L`1#heH?ysb3969)gjM(f;XG^jLBbJ!(fiAW5Esw3z2U% zN{lzI=K7t>^^<59pYy0Z&Y&IkbHA3+gp(8J%z@2H!zAkY7N0u(qh+HYH?6k|YnVaU z?_}2p?GXs5yCa43CYfh6j)_EDi{L8u=9^XYS(X?pQ09evc^RKDfy&@=)U3wNKD6gL zjqpg0o`HPw?ixhr0>k2bZOW%gRDu6%#Ioc|R+G$ZDpV%9%s$s=@lK-x5Z1DpcAu8k zqXCA%B2=u0j4Rp!vtj#3#eLg{GKvdQR-hbEIZ|OVPi$^QPLqu*oy8Bt)9FZyGK=HvA;~+ytYqeN=O#iHQqKV|dTdpN~Boro# z@6LU-bFdtX!%5FgTvPEc6PxNOlN$;&{GP!O!_I$V;9!8fv%vLy^(^)?r2|mQJ^17t+_!dvQX2>6##h>0L9T^?gARqPHc74Wd|MEhiJQ;^~%(Y#qW?ZTgkTC3T2qQZDkml&vmt;u*dUCKqp~`fXsZ>`3f)D4tuQtY%>%kf&?;aag2TfV z0fXJB=*Pdm3!wN~$|boqKm7iMONFxW?()Qv(xuPYj72tmh$C9CH8d6@+r(GpVstHSj-6DKL1CxF9)aG+#g%qn_H^BGbq440EtIP-Of;ho6ZAnOFlFUEpCzA zm-wl&S99VmSWee1HB-~|^Z7h+SSoG<(qC-_vKce0U6Be!!ik>tmLow6THDxw5u`Qz z-pX^P4lAt~!OjsUaAo>?q0K7UjAmQ4&E8+fs`mY@>v@Ghjwx*ceMcefoNB9Dj*z23@dNXwe+5we` z{{D=8^W8EW(Nm%>kOJ*&_8G^P7d#R`fp?!^7r~$aiMZfKx6jXmq$j}aU+xw+CT=Pq zb7ew=CU6b~X|CNyUfCmoNkEyk&3xnd3U6r_yz~(WQa|Fv!71I9tXbQxp{TOtA>#+~ z>v4&>`g}Wab3|Cxahfg2w03#@vbvV!+_gop$rP_NZfg+ue$z8LgkGBa z1WNj9J2Q7P8t2R5CD)ZB0-=Ndyjx~HBT@h@QsLV?lL#ION-Av?3!zfT=evH$#7+00 zFJ*$s5u(yq?W-&g{Vebp$Tt|+wd`_^vd_u6kmzy=TnBQmk65Rh zY%YkY5VwKSW+U8;dFv)XrWy#H$3)61T09*WTp$nKBw+RWh~r5Ws?+$O?keZJ7Yj#GltQj8 zT3)*h_vxp8G0r0&CN4S|rQ2PLxf|l7CVdoT2ksZhAM>eWwY5!=&1~0Q$U1L$Fw)vI~30e&Crv0|Kxv|*#gr4e& zeG}yWoh%u}e(5s#N=m9d&+^;G{1~T&e9+`k zOPyc?b{(TV9X*;QM(0tTesLC%qUwC3Y4v?|X}h@Hq%ap`RT@K8vewvl~pFQ}8mNZHv{GkmWsZ>MYZt>@2bvZStK?xuB#YOFFNlTih!=TZqMZB5$~ zEIya>TU{8FPqjCu2vqD$;ZeI2+Sq%%@;< zGQDRxgZd;%8ob&r(;HSlhfFz|NU-pbi}OKQr?y`epJKT!S>_#F<@OjQifQ;#Sy&mg z+A-oUbC9tA4A1x}{zFvL_U%r`K6mJ+6b$FC1R0<73o8Fmy*6V`Tj@Au(dBmx5T0*k%T z;*~90imTusBi9;`2vCly3YeZ4O}Ndj;pe2!H%_d_vA2~fVs#~apAnJAYtP@W?YYOjcxnf0_En$ zKE?M<{4LOY2ebogT-eY7q19*FEEp{bzDL&cjjxSto{P7@A?i0#y}3`dp5s`TJjhdq z0iqZ*5|}MU2bV_}6yai9`wMO>9}8Yl!60_00B}ibTX`1vdWpYgH^NX76Mm?1G-42n zdV^8-sfDHW;IlBc86Mysp9kd0CJuny7O3dI65FVl+z1|YK8lGNb3D#79N4Z{_@=Os z&7SlUiUC&uXjcDMtS1dAa%dfmxU#KOe~i zP%K|>G1%)=Axp*E7E?*k64F)&@&NOTtN3joT=okY^JSG?0b$bkusc@nKU%8MUOxnY zH0Sp3si>&f-1g=baCBH*6=x=DTG9>{MWyYIh~pl5550lH&uaI>Wraaib|HSpT5x_r zU(x;Tw8^4=n`i&HB+2gUjDipJ4lY11q({osX6-xGh=kl@g@nLRdvr*>%BY8G43*1S zm+`$-^b4Vj(hYv%{NjKg`HGo)Mo(kWg2OsfIILFz+0yie%Ua#C#Qt#)%Ay;sQ?sd zEy|w=H>z1-ntdP5)4zH8`0;=w?;SReYS!A%G6)5|~7HQ5|i(>8al zM&#n{cx;A5VhcAve^iL{{y+gq-`2{6*~Y>kYhQQoix&@`8y2T$y0%$2f9;&n_n7o( zo3ILKGY>mNccZ?WC-X~6J*7lhtIesn$wA4DV{x}@;yxyUmd$Uex6cpK9c(p9w_s~| zm;8#WZ56F7yI97Qm-nPL`YH+Y{ehKF6@?Dz4IX*z@Q^Nvdt~QoU)JV)zgn=^^l47s z;ZxbUXt7fBrSp+(IP|PU_3^w`weA^&jomv_gd5>ZY(fI>p~FX)E8i9f?yqM_D+2aS z!C*50Ql4;`xQI=y($+O4Rc=NQ1sx{t`2Lxml@zK<2sAAHv$QG)Gc z*nP^T8@j9<%??o{^NcDqrRzaE5&sl~>&w$imcrO_wjus8l961a^#IgAQEM-0Su&;J zHSXwr7eF~gt=&|yNw9i$Wv#U2@O^4+5~YX?PY47i^gOao5L|d1vUVtDKtG0CC$F>4 zaaSu}d|8^f-c8g`7ha-^lCL}{nTm21-ZBJzliA7ERq2Zi;@L8j_%fWz;(|X`i6M(?}6oxIhN`dA~rA~&^FxPSq%FyJ| zU@7cgMA|b|Yh{$43fiE4u|2lULEc@hxoBsdF-V)b4y)ZYbTw-qqi(!VR{#>4O&k4) zZD8w7Q!o=jrpql$_jU?pM$<(;aI>w3QGim?Rpl|B9KCrh>~r53^2?^v&3MU|Ed!42 zwE|jo8oHpb+-Pjk_|xPD?-z&L50)*eU9@SEYFUv*SDoux6@dKM?F28U=@^SQ)Q>B| zD%U5G1+~^LmHVJDJNZ_yz0-c;ht$OFguVmtuwOCjjsv1h=OMks%p3>M@M{M0(jBfI zeG`S+R)vD}{3Vjq_C1ZLg6+`z#y;KJShKe_r6t$)wTkpJEwlJva&Kb;)brs%h8cV| zZyPG*2kCkXa(NT6D{=&9ecOVtm-A(Hr;N{z+?4Rc zHxaeVGf(+@hzz`+?k+KTIR)y#vk3||!?oD0*p4Kxzyh;a;UsK3aaK2?KfAfR$iJ-8 znXoU#c`xe2Za32ima)kZJz|NHc(>z>c`J>RwV2ux~nY&1l@vmQ%lR6Yynwpj+ZY)1MxW3vI9OPhECiP%V!@fzTBbyqd`OV0s z(8-0r0CULx!$2Hb@T-7Qe-pqO)Rtc%#5$CJpmEpKcP%$Mj|6&1ro$pHK4AZ|=5c^X;!kNH;#&565X6 zmp#zkz90tgZDtFR3AVZT?OZRN&&G)b8{FobRjnn&#U#_t+J+JMb_uI1|Cc(k#Yff$ zk<>nRy#@PcL0h!K+-{S=lL?wi=VP(;==0-(doe6XwZSr}W4!>Vx6|6v za!hm3ICm15tlDA*`W=mz|s5N zZ}B?v0QbS`5a$(aYc^|f_w3rJfJa*RV4SJtz08hQ*VgQj(Yec%wY8#ePgiRqv~ZaP2=(nCS4I0v z8|Ym8ch&txn_hZ31!ZfW?;Rqiaz(DvJCU3Wa`KQ^rq;%h@n)r@oaZ_>XJWuwo;$%@ za)oeavQ-5AX^@A2osnB&fc05__CjIr`0tjB9LEI~6Ef6>ovzO%D5jwcv>VYapR*f< z7ro~f3dAGv-_l;fq2<3VSWqeM=+Z{8sDVvsFVXk}+f;FNByCerQ0!C&?HI3R@B($N zRPTDN0KjUiv+e0P3g1M}m4DD$-M(q;RG%`^GuM89j&^^5?nW43b9mTM7?EZz%2VTb7Tv7I*_L#SQ{xgTxS*YQ|WW3-Y zOt9aR-+JK&RDy>b!SNeqtD-RmXoZ$inZNTtpp?Y4JbN^+xL9D&W2uJFO4&Q0yO^Ge zPg8L6LQOQizc>Z1rC06HeNuiW>rCbo^L>W)z5J~40Msx}&$3!{@}FB8u^LPbO1%^n zuzfT`y*J7MRQamObSh`Wx+ob-iuluzb?KGLC*-9-b)a?VE%DkyAw%R{4N!nF_miF?oFM$&bi;7ZkEWYiPXDag8NIPu zR9y=a+ZMLixhUoOF#Pai(QEYDP&GsD@>n;=i%&1dtn3*^_)A=MEDGP?ovWp6a zJ|NpOD`r-h{*1I4u7%cL#Z%KqC}fzQ$ua1m0DpWXMw--KulYPV_XB2iZEb4oIlUe2 zt(+=Sz=@2x{<7HPd2KddM1QMjYZ?}H9-(o1%WHFInHf5)NmTtfHo>7S(`>b`{?Mhy zh79p4(>;&AAC67s;{}s@)lv>_A7uV6F)=ifg%#7>mW0$qeKp8?PEW7Rbco(_f^;zP zc339MFP_vUIaRb$TVu~z`>sDW@jN@W?=+!VgRkq+ZI-eUV?BF8QkGVP2-!rfZwwkP z#uuSDf1kR?=EIx8sW{Vnn^KuazVhdy-o3{b;5hqUIJXfSG1|qSzFmU%gf}Z1Reo!4 zNMf2VT`^o34=v-y9Is!c46dfKBr`1aQcn@-)0R6O(%KVobguD{6NUV>W-p6e^&weT z5Z^k?OHav2AYdz_d+QPLQJQ~7|Hu z3Z2cykeLtX(btLd6m#^f3f&*}fg{-WLzAEDLalM25RwHO{N||vz|^_+n)mlSGEJL2 zp3{YU8akxwG`lkZYO6yQY(H-paZRI2vD4@2=264AL{Qo2t8%9-357!N+Pzh!3Q!w) z&Zz*`p`|EpJm>M3R2B&9U+A!NaNMS*33_S{NRZkV{uFWIv?gtFqH0nHdr!pxpL}W# zS+H2hN8oHEe-A&L~nk`4C3@BKOJNA9Hio+km$%5zf|jWR5cZ?&ZbgQ;LYbQ`}@{u*=6e z4VJARYPR0E``ua>QbM^?Xa#uWp^1rn&kvtDXbd#LwX9M_%d($Onfkh_7qiPP92r&?#%-e|#2DR_ z{3`LlF+d%rbt)o_%4(o?CG_eZGEM||F}nbnq5;W#!nH)VQ!zS)j9`OB$`}~L-ULO> z)b?sR5eSk8N-pQK5}XYRZ_j=}dK15{$Xj#dC38GuAv&^!1O8!eO+ePmh43TZ8t6i@`VKL~IAxg@uJzd$iQhn0&wmg?4*i|IO=>G7)L| zu`s?_J0$^~FWIzzpaqwi)TO79Y+FI0P_x2B_;#o7a_s4;%yz)i67C#}uyG)K~|;WVP$z(&Q&ky|BE*$};%@U)OxX z>rV5BGs9_`lsf+?jZL4rF%_)-BBYQ3$^6Q7u_KSY1D z^6XFU&0C&MD-tDbqaZ(FP}rLtt*hIEbcF!@N#psa-riotrI8x>;!nZ?@AT)Lm330G ztDN71*2o%P%x;&KDw)LI`q!U6MNL{h65CL+JeW9u(sCeW`d*2@rWB?z z$Mt6PEUiFKB-T!xA1Z9PGW`(n&G79hpaK2fNpH_d8uUb;{S-hOMnS{a)X3&@cF8*c zaUktZzh)rn)?L5U3255%13h7%vpg3aSn?~Bj*B9qz$$Fano5ny z=^5mq@3o6C6mVAp;f710Vgf4v@b@HXA8)WYrO)QBK2u>4wKFveH#w$%&X0uLE^jcK zpCG%ao)lS|>0Xo9MW!d3u^GOi_`Ze(rFQDl2?&GYAWceTf@(dG=+$b04^fFu{0I9s za4nMn_lQ8-^gHBQhl}$?_l{&z6afDc=23%A7s;CcaWQA`LMtm_)%_D)1-tN;U_%cpZ!d?!hfL52;5Oz*IoZHs ze-bIYRUf-^EEKf0zCU&2N=B95mreHd=H?0q_^{3ygi?s@ZG9GSgUeO*k(q~QW5UPF z?)cXzI()i8R|cX0Q1jN9c#s1>0KEd~)zwCHQd=fOz84k=PLZQQ5B+{n4`ooG02-k{ z-(LU9POZ@SB2~4-<2)Wj_M5=5h*fWkG1Aov#`?>yW-n0u>rU!`>u>Zl=*i(#$w#?E zj@>FL_Lisb?HQWeyJgfWw<|T%D9+CHO{A0)%PUcp)F!M>JsLX+8FHFppvl+`)Kv%(5*xmZTg zhcd{>q{AIz_g^su?l;du98U&I{&#kY@2sr+@mE%ViYh=j;kB50C`jv+r;h+Aysxz# zr&>>x63*bVwWqc)UF8l=+Zx01L*GG(OFR!}UeZj#WYnpB4A#EM=^GInn>*@Xn4W%1 zRRS;M_9NxxC4PRj_8Sv#`E+Ft|A8s~gD!#&*pnwuz7n6k`opnBeYOu3*VEVchS{Pw z%CVv)ya*PmY_|Gwa zeX3{kQ$3`onx)lqS{JaC1x)HmAcywl`(sE)EH%V0BQflumPwAYF6PM>_`R6nvb#36 zT%EbD424zk4&!t7Q*CeBRyvKa{}#TC)=chJqGIARx~de(^Pblb^Q!X1cgfA6w9%IB zgAy0E#}45HwniV_E{}psmoBBBzQ=yam*MU^W~$WVvgFSwPM)Gke)j6s$&AQ8xNxTNl2I?O#arSp2SXt+4#1Yrthpslu42d}>;1^;eMXev) z^e-iilLqXd1Z6)({qVMAO|4laDp#M8@bH}vIFF3U69So`4$=EVf4b9Gq&sqK{xz0* z1R4L`4z{^U9M8Oi??gBK-0s)hTX3Zh_i*^=e`PNcsdNm zcH_H*voe%9zZQUY9~&QQq)il)ImI!fx#ui)n1kKPn^kq=0Xsu3+)H?Gwl0UL9jm?H z;z!^utS~k09L?kR*>1%E_iSBJ!s@-CVB*BRDxSLayI#&O(Pt5*ZiKTxujZDj2@nR{03}F~CKrTakmOzk60zLq zfz6&e!R(oc_-N?GR>qNFG5Ed2$HeS)UX~~=V_KBMIUS=ZC6-6**WBkCD%izH4y}i*$JEpD1{}}Z zdHZ}6a@tKaN6+5qG(cOMi4H9fHW?JCo7LE$cC*FfMyG{6Rsyz1Cf`aElt(Hn#a-gu zI*?LDp_3Qg58P)|bjlvYiAD?QO-t=Abek}rV7SW^{ivW<&A@u?h)J)_G7Z^>Bc`+_ zZi9MN&Zr<(iN0XqI8o>3jJ36=+CFypQUGvo!<|d@Q84nsCW_+@!5+! za?tNv;xymqe_0ne>7y#fO+RHC>$Aw@U(%rg_9uR^v9hwaFCTG-`#?VM?V2mw58hc| z+cTq7d-YL>Y(tv_zPUxOuWID0eAn9PO3pbEQ4wg2x5%ZXRtrBW_CkbTJei(-4Iz^C z>DTMdKywh`@%k$uF9NloJn{f~HajMm<2PqO^TG64TU!tHZsTFm&-NreHikyNEPFva z!jFVPT)*rx3f0q+7j~@L`uI7xb$GoAOKMi+N>6cD zm)gr|phnfV9`aLRqSKRNl^_=aC`o8u;Vw|FTp+%@y>` zlTEWcQxUqxMI$vHI2!(H6L*sfKP%7d(quqBq^z)p)N0_`NN!jX){GN^rPs-&inN^{ zHS;gTy{17SSImcg^qQ=-tx$^K5_z`c62iAK(8^LdxnfzHh)7AzRi<5?@znHNans7O zgO4slx8L;ce5OU%kC+ST3uNfm28Q}opLfFPze+tiA=O(P)yGpx%Ij?Rv22@~tnE&+ zxQ3bgIfWQw#gnT-c1El3lV7qj#u~N93b+3Kv>4Rpy?4?!OS z#=MPrH1urjjpm)phjICsq@@|*Nxh9Nh z>xt^D_L@R#B|*Xk1IkvLv^uG*FG|t%c>r< zpxf*WaKHU2d0VaFfGx&%p;IuKf=5Y`9vH8cK={z2na$^7W9QHijaKT%(}J9jGrqkh zwysqTc}~9v!qqZQDDH)!KHG`ZmdBXjsf1*c(dZJ%w}E@9-H7MpDRG6zRw6oSCQsJS z4HTuRL|^-m=sw5ku~;#)5U!yJLV?8;fKVzAQJR&%XRwU+(%Qg67R z_bL{D)2+D5fBE&5#KJID@#fmqh=PG(mr=yrI^fxn_$5=UJNJNn@E8fGPRP>Ypf4Vl zS!BCESz5n+p5Go#_;hg-2$u}9R1+2eNPqzwxKgGM-EV9IWC%Srf_Oy+7e!mM6QPuhgG*eisscgjm(wU`V2Ys!!ST{ zOlz5QF{gdb=$J%=Gw)rEe(b%fl*yqXMDm5HT#HlnSAtCB7oCo@+Z<4U$5-(tuNfu^q^RJ zaQ1cU#V8+vw=zZ)4gh#t2C}PJHTygBi|5O#7K#IjvuZxYA_(l~UVn%4oeLB@gA8#7 zo80r(HL*1mBo#-_hHh076l>kR!trr9rf48Hy?Xhv&M@u9Yt#kT2vH42V7S}#W$Xoc zklbb8F}hF9lNYF7sIt$HL^|YCV%9o0I(yHbkxMoqI~v1x8o|Sqhl_MId&+~1l)EjH zY_^&)D~a+Uceuw05^XOaz4McDaE1_D%qWpo;d_L zo8Rm4?@t(A5ZwX$I>~#hc?M>7PhzS1X=X_DAA)56)UtsgHzqHx%~YVb?|+UX*aMQq zqV^i78P=inOByzS#wm-qqouLH2RUl~$9*kncu_W=v~S#%-uQ}*K<476VM_@$>FcH*lG}8PMqM@=FXG_*Ru|4Qm_cE2feG;1rJ#wmW4b+Io=o388q_P7 z7Rd}oZtfi|lQDZ(g35!9$2Idh#Vyp*9#{y!o;#e>k?-Et*N?KgmT=^!XZ!un2b#Q+ zkl}mWh^MODaE;=DHeH0aSX+lO)eCL*dEOVsnHFE8AAp>u$k4u~H*WIWbbehyC3Ux<{sDzr=)~9 zdv2z%|`Nb=kKtar~h@P&lE_?)pV*Q}eMejhg?w0P@JZndB3a@j?MO;!> zGJ_e1SzmtXqvx~#D82vr_?{ha5+}3SS)X-o6YejszG~82p|8VIu8piN z3=T*OJIUX`U)R>T96psR&B_b=k@=O<@)=q)ST~x zeS6F7;oZ_10Pn;BtuuQMkYEm#0t+z!(#`u#)kO=Jsf;RjgyxO=8f%BQpI!EhD}Wrs z_C{vgRkxvFwRl8^4&&%EO@V(ega9%z$wNw0Qghj93jhE?%hQQ{KK}ZJ7Xb+u1}>C3 zs=hdO6Q9t+#9})4d=AhCO8Z5k+sVme1M6!tbaAPngP6~ZLQxmARR4Wk5i~U`(ee_UA@(VAQifqQab7-Mr1AKBDo<@45vGrS_KPSpYeW6|jjgCLhS+ zKvQj7yjZum)7(k15PIaypqY(o*=XLr!sM!Iz+V@6HM~B)MRcfWr9qAFY7dtlABb>$ zW!}gDRa}SKv?=|n(R^;=>l#EyCXXK+GD*`M@4Bh-KttEST8Feff9+Q4tnS6FX{JDIa^jHSc|I1F)FGWETEjASQ{0@)PifLYkv0Z!!6OR~7~@`TS?&ADjSdp||MK z9SNZ5D+`sO9-e<}JAS9=Dy9Fw4RCCrOgnw4L780w%z4mE#A)vSE}_5&0m?r1dv`qNRI9ykxi7nSL?bZ?cbG6DsujJ-MlXVIlUMU^n{#2M{VEC zW5CHT1um+auVONE$4YiDwT#{QN9Xxh+NVre0o$xEQzb6GwG-fY&n6#vFy%U&Ogne~ zKx6chEIyw6N##2y9yE8R?{ns13!X04HShFlGm zg8D+vJCmP9QTdtJVCw^3n*_`Lfdc!@J#6Hs=u*@S(ztQJZ{x|-aa_%p{k{~TU8x*Q zPIdK7`+2?qly25)ckP+p^oc~cA&dX&!h;FK?J3G;gk3dW$SEB$QayP5^{tb|i*a}G zC%#zEcnS7=e$DlKr$^lRmatXQt2yuY){6w2nhh>ONj5RD;E{Gw3+og{q*u9d3B;KS zl_+hNQ!g<(jc>1^(O^~YY~XExRy-QyX($w3}g)_|3U3 zAfR_X%gk=@csox0ey~yNJ1yC#@rpsk;#^q027@c>pB3frU?#U9D3hZO-h^;U63RYR?vV=F7VuaQ$7c`lr>lAhwkq9eKJ3*g` z7j_nL8zHn2+r!2J1uG?Lj&F}X>cS*;Am-MbOF5SMN@<%9ia8K!ppN4PbHNZ!jSCXa zgimG#KfbR8+FoI70!cX8cZ|D(*X`nzN|gpc->C}T^nMs$@Z9HXxlZ3JkkZ-2w46pw zd$BKjIVV1quiNzYS&zQ5)`aWe@Aqs5I^(ewk8bz0rue>Y-$ui33+JGE#o#^jaxXVHb#o61c$^)Q14IzYI;WL@DLiNErUX$WWF?sDIlD9W zB&~Sst@SREy+2uwniR!knpQ+yF&L0?HvQ3>Y*?}cq{2o$bQ6j|NkKVvM$L}TZZG8O}h{_x< zvAD6|Va;YUoSD&9;EvO|S(oGOc?~GcuB= zv}De%FtU$pzB)$gK8ezS07nh!N<`%y#8CcA!@>N)xOvdC(NMctv!q|=O_YKet6MMbPRxM*>EfK z^@lHL&)qE7Xgzb|aWX3i?Fpm${Z27$BNIpFJ=7_2yR%_)Su;DW^Si^3dYcWyytk0u zsNn!R0vu_mXJgaPUsOYX+A`9Nq+xZc6%T}%kq77M*gMZsh!B?sC7K%x81uHwbnJGq z8We_7Gz!T%WbSmhWgQO@!o24nLjn90Xg-VkI)Spk2=nJ9nuC~qHYiSkd9Jt-*a}KQ zK+sWeQ1!0v$Aj%F@sH(*T)8K-o!er+IJ@qiKujL-=vC_=L`@urqcemL(4=85?I5l} z&Tu3>aj5g?*0*Z5C_C8>nEU4dNjPtGN}hb2Z+ZChRORzGJyd>N$kMtm z(N_EebD?I=@Mg9$8!=C)q4$?lk4=)vyJI4pDei;})(o8Nw#7uaUk)wE;=exsux2=q zHE$kMd%U^BXPD?5SG29j(rdkRcREQKa9zvEHws_t80eaR3JVzkniIcsE)udJFw%-3 zjhZ-NG2~5NZAaFuL0>DK&A}ilFlewa8lti+pBRwD9opEdtrz;^ z$^fjuS=g=<(o+cg$1hLr-%WM zoresr5+Aen^l%AJKnU5%fg;axj?e>8q5hT1P(6ow=X=Q9e*RaJ;uvvrw5$(hXb42- z9AcAVV)-7Mm)XSbo7Mgm_WWf{5-D5{>mo)#iyP5qD+Oz(lhkZPVV z|DV9>sncQ(=@H@KLjT@Cq~sU4>Z$Tx>BPe^{RQx)%V3nsw%1U)6@chVy1F!7T2;ds z>!YAmcayr*eslzjwux%wD8BmVYkl>MEU90zlK%dkTP_fh7aebsg#V3bM0bImtumJ>}kH6$&-MX0-;k4+gl`lMie6UBeuXX<S+1G* zg5r+E+?VqQ*BLt3=s|r2ZU87MWk{jQ$0g_;f zw(G2ZG89m&;-)|d9ySYH?*b_71kwZ`mWtPjKwEbD(e)tX27r=(C)1mna&%!1YGnFn zApsfg&NLc*|C1LaK%d7mtMn!ymd8xk;GKI`ppr zEzm(yXWBe2>$8LHD`x`QAt3O(-+40jfg}=wsxY40t44JnJtj01F|unjrKG$(XAL1k=Oo=HC1)h?rD2Bos_YSt6C)6c^JaKuaQs)9fw*e{OsgO8Tr?dT}69a6Ct9kn@$g2|Exzr%S1>Qv;mzj za7z#>wd!sFy`h-+r{a!3)NzkOB!^0rK%0*7f#mSv>@X~_)BS2|-eTjgF6M!{+y)TP zzmheRumGe&M|8J=!9IU%px7+1wHaji!?pQ_Tj7p4jd!FxON=vML}j`27qbhk2SRL| zLuCG^2`r1pU-G+vHe`BuX49{UjSR_PNs$!A6>~}Y%mGrr<+`pDS&kuX$j#NJou$Ml z4QHVAn`tOFX{!z{RC(`8)uYB>m4jDxz#?8Cqn29&la~7OVG>b~i22EAg--IA(h*<* zCeI3K)x$2{A;e4mHdfF^9=igZsT#-OZpYPu=yaS*c_r@j_37K}@npu!Ev>N558U=O zL1$Jn4AcL@!GG;65z=$xi7GEU{&%mElD~mOdw*!l{GTJ>i-Ck^OXjD41~>lUv`ENq zGqL+>uXC{<`sXx%+L}RfR|h*0Rw;P^yVC$51zVG%%1?LIxeF%_Rx515w(t)PE>QIM zs|SX50aPt;i}9tF-#!{(Y^?xHn+K0HHcIy~#MtH}MYi&TIs^L1iOZ7$HVZT7eNXLj zW%^Q`1Py1P%`XfEq)%r~@EFg3rdRZBh$Q>}{{1fb!7>zyMEKpW^u! zH}}GY$NSqeanJPp??OT=h6|tsX$6{en%quNyAx)+8$q=-am{61{32;yc^}V|Tyi}b zbA{vfRFo*!R(Fop6-HFj{eQFon3h3x!N>1u6mFc7me~|^zceAtr~e!i;HO6u?>hc^ z1ETx7oN+1x+baf4VD9Ii2OSP*(nE*!K>cv2ZigPTq6FA;h##FPxM-xCr!ooBtw%89 z7W+vuW`(MLV-Noe{4KY@JbPQP;ZmCE&-_%|_}eS^jUVy+P6NM2#Eql}5`j@d3)}Pw z>GgzjYB4K6lCvZG;zOlkw{6PzUz-k@XLDfJkuf?qzx^5 zfU<{sfLhG2F^xYx(F-jToQ1^quc8${-`w3}TcEMY3aMK#GW{bL#07eaii$0w+oygz zJn)IC4w!=F{$pa0bzQxD4Ji0j^9KIa68S48mOb*A=7D-w9_7D&`qwi~Rs^aJv7Z~D z*zAA){Oq`;Gie@Zme?ej0Jfdd?Ch31DEu!3iH;NkA_7INozB0>Og~RKX_!1nQ3%>L z7SB0UJI;1_8U~oV0o@E?iXui{gOjm0--EI2|2-Q>&Ds{vFG?&FK1bUPV=G;jM(&q% z`V`y=Ij5teW1b-HMD1nV3>@OGyZZZ6A+Mh~Q+?O`gvZ801#eW7&j=tKHbwc7{r8K& zh=AKEW6;F^&oRKCz8$}+M`H7L&`?kWoSz3EY!0twRlf$Bn%9U*D&F0i(lai9UHMHv zP^XQ%{wQGfv^-ayZ}6YBScL{e?#6R&lgA+EI=kev zH^GMKR+Xr*+F1ZZ#8SwG$@ew}u~>v%R#{EJNcvAy{k+B%#?Cmi2u=Rz&sCqla1Vou z`4Ej9_}3hS)!fDkdcWCMG9@RQJVGjF+NwN^w_z;{eM(muh@?s;;zDh!Gb)C(ob#%7HzL6M-V*d_a?F8Q1lN zh4|K5b3Z~8ca`G;|WFCQQ7_1}1%9d(fo zfdKgXLk*@UmNpYz1wl$;J&p=BL2p|3Q5YQ}ZN!yaPClm;V%2G)!IF_+&HmcCdS+qk z@Y$qin#K_9Ok+H2FDU~nJK}ENr1dfra8!Vg!IR!b)EaDon#cRx014<;hy-igN)(4q7Xjo;Vo~@B~qTc zh;&sDC_j0R@6jNeo3yr2N}Bev2acj>KEJA+m}3(C3?`ciI-H`)lKbP91m-^Ll=+%+ zH7*R6Ab?>Ov1mU#4?IGxZc^0LYM|I;Ds- z)1=-(^M%{P&Z_T5=M;s=4faUoB((G>+)g>#@(9rQl>N@KN~Fe$*bV(C9vP@~ok;*Z zUvm(`0!3EmZ7Z8V*r6m;9Z+LhB-c$_PKyWk%B9zZK^S7O47RVtDdzwKZE{`?f!fg; zDY{5r8q_Xlw1Z||NLib^QHtgQ(=D?z%S+L~$vW*icM=TK=ZfF7uX@ zkS`;hyQQQ^n-E~_yf9GoK}ht_0gbW=xDHIM*KWX~b9_CC-p}Z$-ucMevtnJW^6rE= zG_3V|>mOS^orYY1Y(70qwb&-Vq9N$$4bb2|jJMLtR4xLD+9>SF4KM=SsCF+i!y>wl z=1Q`qm);%YQ~5nSKVcDeI2p4F1I8kB3Teyp+mI%glTpx^aGFeU1eI5AjR&gO2dlhev^FIbjX6+=^B%@qNAC0k_&-^_UQ+10-+iqUPK~KqD zMt#w%&-{*fJ3%+{VI>pxw zRHmMT9zCBwA(OvNI^c#-(Dl*Ha!)pt-2y(n{bMs&+-g>Hv`9A`Q2FOWHR7bP?j~4`ZlL?6aNuNV=mjCOw zNc_Uij19aLiQwedCj>tu4RO;p%#Y|~Q{R|r{^L)jP zK+xcP05bck-hL>##64+b{dZB{kOn9rHBuA+3u!Z4>4e*n-k2LmUHSsUStmCbosCAd?57Sb4~(kN?IE ze?Eh6Ao4#&6z9=90{CJNcJBNc;r@NRHxM%TrH6jIk_oH@hXL>;-pzzB{LjH;;(-+4 zlwK8ZxW!=28vr=lVNYS*f(0Pby*)j*>e$2oHypaa3l1)JAFinQIwC4cvewC|1UqB+BRTl<*b!KAW#rfs4qi_ z$qp^)xtLP)37A0+eL9BR4m<(Cq!*|MBf0MiX+K zwC0by{vc<@0WHfLsY3#@zh5i#i3%y>rYERS`|Q|hATcUuE=w;?}b1+xVXk<%OI~$DNxHYXyM6#Zq27FD|H=lKnbovK!4cvUwi@ z@XBuv8_GF3p&_c2O22%2Z;Bc*YRA9FO)HCXdl%HJZ2_ohh|=uVWb4fLTm)!?j;7{A zC?RZVY1!G<#;h;(`=poAQ z2Ex6G8>r;g$tX&+8Wy7&)-q9sxAf@QhcARzs+i@{Om!nK_QI{HZ48k&^NnjNWxdkN zV1w9aJr0LgJgi}^^Sb~88ZM9zIQm4o%4vQYJJ3TMjuZ77UCpH2?&hZ-#C8C@+%7^A zVUg4L4kdMTnZB;_?x=Hkg6%c|w@=3NETjMS+=^VC&1mlvF|W#~J6@6QL+hE8L_svF zEppTrfpD)n<#?vFwg=HtfNIkbL2F?X-y}GoXr=_ccGp%DN7TT#w*}FBr6bB-y~?{T zr#EQoZf4`d?cG;{FXnWkN0FXiRA-%1_9n4?=JRpn`uWPZO87xj0bBk?{nF6ICIL%W z&Td)RV#9RVK%?Z8gjZZw(T4(}t?l5=6W$^x!RG6l1d<|UpbKpXkf?)EFTB^{M#~$V zyV4b*5K;n28V=7`vorGOnE=XmB2=kVS(~m|C~n0VD5(2bW<>*D1q=v5V*rz_N_D)f zj)(wxgG*2knC$Kp6#-GQ2@`zR`0FDl*%8nl8nm0sUso`_1 z-|H)@H3LNQQs4^)K{t-Q2Ob@@8!QfoZ@1_|WUgR{dh1A;4Dsgx#q5XF!D>{UE#UiN zbz14i>7DkxSHqG9fbYTsp#~S^&CQ{wkUDxXFfCPepbyrH$@IqdWEhM!JKkrfJ1Gz3 zqt5*>mkLCYQWPJQj17XuBZgZTmOS~3gxU>s!65LE!xqwj8HoS@?4k=o0>E%(K+3$^ z1@}!VwHO(e8T{2ANTA>Vb(AG9t@Fg*+&F|Q!a)_6@4(;yjN%#_f@Ww|(G@cs^PE{+KX+fVDUSnAZ^OHJCS`^H_u1fq9L5?CWzsV_0nZ8X`nN z$)K1AzWYj|>q9Rb;idH6hx?K1m@#mTQB~1nyjQZ5W_LGVvUyuV6k?Qaf$`$$Ct%oe zY_M0$5{QbI_}tGztpGsiyPRhSZzwx8Y#0JR*M;kVxYQ#Hi+V1z8Bthh0$HY&ht{r+ zfq^vy#lrW-nFwo#x0T#s>1>;hMoYt0Ww;K(DN(Oo8i4}?U3b`z(_@5~^=%N3;Xz35 zz|;vQMKP*4kn$Gr6UGDiu>fMQWEFROe9)tM>S9J2x@_1vPU3Rbw61KYG6ElCkvJRd zX3)-=6+gan`ODQid{oxy+&ob;E4!~eT6c;^5sw5Vl%o6uf=vjdvW5kq7=AHQee_nNG+J9WQ`xQ4 z+Y{(dRMh6RUoXXTv!@V^z4Uv7u#X6*J~;%xH)aY#*pv`dp5=zEV?>;4j1TU5UB-8d z(NZDp?KPpf`zc>OB5IRYPTM4 z?oLI)7wM*rm$|%*?a#;(J;7Tvs=wqk*%YQGWd$^ZFkm8j6oK+21%o$$AF2ebMgY^X ze2G(YFRE_ui?Qo>3elZglsZn;JvsCO+r9qG`V?7?7qS&(%?M;adz)-dR^QBhR3MN; z%CDpOJg<6=Bn{D^RASy%OnJ_={$#kOHOQ`Q-Z_0llEjleh18c8fKhqMdT%LR2N$3J z*s9d%-7F|(Im!wJ^{j=e)<-xDIz!y|{>Mo9%o9=eo)av5cNciMUnRxN$@$F$@>Mnk z-x#NgqID{~FU^cj4?Bf;#Dyf&^WN2Aa8rZ5gr76^zzgGm1h9%<4w&>+bwZk=uv9Jk zD7D;Gs;v5IGFkC$^#rZ~LK+*f2@#kxPc`mRN0g}HJ2}?7k-w)JCxVj2d>rWG3bU3! z^%oW+%Qu1f#eqi>f4$Bd2Y=_kj127Y(qp>r2+GMyA-tW=8G!QFr5Hh`C%&RR zcHfWJ{-lYz*@}&g(?VBW&z|#KPjeXxFLaKX5PRX!L^xUg`a&YknCD9 z^14N#+EdUal`23Hv$vZ3ltx82aWWsF$Q0-FL1u=&vOKRC$*Xlu=;+L8Z>Mk37#)O` zbrqv2tLyx#jZIBQ*X|wh%=w4r?$Sm~t=cZ)Y~Qv+g9(*mY^JNYI$}GE<9nl-JJwp= zYlaIGiPd{p1E9U+-5b^EzhaT-)<8J+$$&|=&qJ#JlRowt9XUY`jX>#b~s{WeTi|--YNFv-s$TPZxOj11(1i{hUPzWO>nk9ENo0&2+BrM zi>9}(=)AdbfVcN~n&$nC&X^PK?UbUSRJoc*7m*+SBRN~>QNvM}2rW`}{#jGKwRliK z*#I-SYp%*iOnHJXsEYRRD1PB$U}&FGK2Dg-70gb5@4);zBTQcSF(`XEq>%!&eo;JV zj_SvpBB+K;so(<0>_AZSEy<9>9ybVbFhM(s%3@@DL1=y~k8!mt(vW~LF!9@8M$(|} zCEQ`XDU7}KfsG^K-4AlzD;ikJlV>$oab-i4r28HG^dP=`ig@>IX)fGre=W)7gAt6l zo@kS0=#NI_v@rwfYwHTg&5S%4Og83qr^K8AT1oqu#Z#j)W6)r7W;&)ngI)!F=%Ap&-5dr1Qz}y}1j-@~ki# zgkj9;d>N4<+^dWk1V*qr1q^Y)Li*_yt&#Qh+Hi%KS=TfXy$?y=#2vSi!yDZND1uI6 zEF8h_jX=$*>;@^+a=prZqnY|uog#AY;)qkq9VV&g&>O7i^Pg@jC2kW= z2>ZNiwm;aIN19{noCNa5B0}eGeaKG^gP#-PQZmyTgSlx|A-zYdmTC=0M?1fm!^*#H z-#XoXeQz%HI)q7idxf#jU+l&#_DgGm%lQrjB-M#u91&X7EffiR8%xSFwBnatnGUpm zF4wPMxhA}HXZq+^_MA^<_W!Z>p5bt|Z@YIQS`a0O5M4wK(OX9J8l6Zmgb*!C)EJBw zJ$g$bdheq5E_$>v7`-!s1Vi+7`mgs{&$FKY{o#GzuWNm|H}{rpX0AEsx{k9PzkT0# z6UveDBd%#>7$H!f7fJ-t@3zw18}&JBg4)qYx;w94^b0$nj|om1OSRGcz9wS{1$*%0 zMz=oJB!o{fuBQI`rkU--T4El8Tq{HXjfWbcIHm@X+D;*D}{0`Su zA%AuK63QEd;v99k0S2dT(c3jyGq0{WvxYdbi1m>t@Yaoo6ct9`fxv9FWww>n_(1y* zJ9kyUPT$ov<5q-yie`U}Lp?RtUz3`rn*_<~!iX0IEmbL7VP6%7Hq*p~P`TQQxYjLZ zPlG!guGGuI^-a7d*3?)`TnP)&BNDfXKsh3AP`^=K1|scaDxG!Y-tXBX%W!!mm{y<`}m_+fFg!{9D^guZ8)QoPA`gGP+X zr5}mRT^BJlEb=y{k`l~RsD)Fqtf7!F57o!XsWX{P+cir7vss8>)GTM-jJJido4{ul zg6=%I7eHuc**_U;FfOM{Uw>xOUbld@s<|Ayww;`H(EERi^e5{Wo{(6sr7; za`VoBSda-+Ftz@`MGSgN1CnmVrH*N`s{m> z_Q8XomDK%&c_e46v6ocZ_EU{BUmlr2a4tK{p8J-eO{Gi_=RIP2?BI@Ip|V7%f-Sps zCt||d!SXnH^1*0K%dFXX$xNV2a=w}>SP_-!7JT%YoQJwuacq;E^sYonLir!`r=0Sh%*S`Wb8PY~_z220ep zAzuPwu^LFE%8C25v%vyO>^|jr|9K5K4{d0bi zKYG)~MBT3Ou!*;|MvA4nBi6+%$0@($Vr~zTMNok#Wb@bCd>@RP&2V zX6A+LO;M2NtGxl8`Ha;n{`Mnl4#Tl7o(lW~RF%LSZnVzktEhrnrQGA3rl!K3F+2Cu z0=LK9z+W6xsG4VxD@Cf=L)zzb44qE2U_xF?HWtRA)72MeLWVrYahu=?X3g0U(P?q1 z0H%_IfuEo9wPR33jzbnteK491&Mm*WSW2wWY$amPj{VeH@m zawQe(1^UWEc_#SiX38!30-mPx;1jl+#Z{=$CsROiF)Tk#$%MQe?B1qnDW{+9ic#xx zFm{-FjWQ!V%~RO4%6CC0_qa%W^cSN^EVDGoc?6Xg1Bnl4wgRt$JD*FNwihXavWw^l zx;VDb#ruVek?P`yUxJ|9HS7__+RX(_`r4hv!=2Gh8v^XS4R>=!Y5EP(6L422*P^)% z$zw5h990rd-LV7>hcjpLu=CbKJH<=*Oys$cpkc~~1g>%X_Vn;9Z+U%>rrH4ZG=dN4 z^cB{jEb?AN5&OL5yvCeDj{2)pe4)JqnX5yrdV?tOX4vb-pg&yrh2Dl)NvmZ$&-Ljj zA8I|wur928^02jGq&E=wg-yD?h*#X>EK_)qTRQ+S=8IXE%)AYsUW3}At;7d*5}c~A znYGD#?2a@+*~A%C6bNTw#24K~G*C3UWl>fySovsqK0vNcf{@Np9PEkUBb*cjda7hc zgKeWhWvBTa3-{VsO?=CadA~#M4llRGC?AXWp&racWhXyXIe#%Twiet>L|Z3%EnwcL z)-i4_;4Ty>YkfIbVQyoakat+IC9J-4Hg8ysz#HXz%FO|3{j#5PfhtS;Y<-wOeiO8&1x9`3zIc z7hyJH=LWl9SNd%mTT34n@1k95Nbl;4&@+Y{t7_RNG~cf!Jr(QIXM0Gqlhu||i&=iet*~lcn~ixkfE&Qw4ZN)AZ$K|ID%v z)~>HI*>qr?v&rWQE(}M^P|gO+pQf2WH|6xD86!|50k5l@w@%zmt!*#zwH0eQr?O`3 ztJF6ACJGtKcE;S+C+~e^l`1(h*~wE_wpkdt-GG+iy{ReY@^0j@R`-WTX=#lMf~`k7 zY?`p6k4NOymHn*>M%IV`^&nT~<>o)?!*qv7)U9iHLXW{3DtLGssor}27Io?0zg>e| z!DMJ}sP3s2TFMuMy8)xxVlLRtZfLlwXwSr^8 zhD4XdX27N5ej>0aYHiy3o9Claa3R;~5s(V9)F&=WHfF#UXa2n*FSeHUmB?n&E%W|> zBYnGVw0{0x_DW#xR!5FM#Kr;hT&ubse$kaacY&O|Uhc;#Xy+ZNohMQs3btOx{M4JE zFSv?FksL?56FAa+SoGs5YKYE)zxf`Qy7CP^pYHr9B6l!x0Rh+lK9G*tZc-nfMP!NV zK1$KqmI+F2r%q_V4_K+$*Npv@k9$>~Ww*vTu+fmDOE=0GCoFm=4Kpuuf3@MDo+l;U zQ$PDWar=%dNhf9J;d#NlP`s|kxE0qNaV&@RRE0YUJl7+P52{~S)wmTF+|TS_H*lH+ z*UtB#r2XR=0^{4?tyNEPv7-2*uE}pF0k=3Xe8HD%ZB>Q^In5((5jPcA9_}`xyERvl z7k6fst80?dWNZFKJOV6y%ZfeDH2Dsat>=uPo2z@5Z49@Q-02u5 zwuW==9G$^6$7`LWKusugGhFoW*n)I;gI<{6U6{DG;d({zd85G+Q27} zh0pSLIBoi7@U+jW3oOD7JY3i!YP>PF0ngDQf9Znn`%#)d{^$iYB{K3b7k{$;^<4PS zsMWCdgday@EI_|sHrIpjOY6=nw_LlPvUf9;sa|mX2s2nerb}5m;RzxptxUZ0G%1y) zk|f8ccI0{+BL4b42>Ugia^s&qwbOx*^Lsxd8t?oybDyErE{|^^3e`k_SVQ3kXT1A@ zGH5;GCOXlhcN$7YGZ%w%kC*lilFN(RlatZm3-E6RX?4w!Cx78@P^f&2TBh51qyb#O z&If)bWz?ToFet6QLH$zNrt%-zA_Wj4Vk1ax^52f$|MkE4+Mq`ejVk`9v-R{*&?BHx zySKo*DeVC>45$CcmQ%+yoy09f=I^z+gRcS$p#BG389!XAQ(rHT)pC`^(eLu&Ecx=k z^4|Z?b@@HHEyv@Vqko2b!HEQZms~$!gx@pb6BBWFlZKr(6Pn-W6Hb6`d3x=d7cvkn z&Cze6d8tRGwZN-O3}z;h1Xe&ufbA1A`b@;m?!yr?3iTTi=#+Un@;<7j<}YTM?ie^Q zg{6IYw9d%W(_D9$qZ^^MH))d`rqha)z!iQ^#f6?+uJS1|xt~}g>~xdcF0dOdNMYN2 zGJAl)m#e2WX1TYEG^CXxdgMa=K>!>?(0H8r*D?G9Vr z%qEES%%=h2oQq6=Dvb@7j|=CVhMWpdw0L_Km6k@jh%Hx`j3Cz!@SD5`!Ulxp4I8~@ zq$OMF0F9AFvpKo$Tx4}xu{>5bA)FKQOlwcox>eIeWkXd<4V5cs!+~}k1^vuSAeVCZ ztvcE~*;OX^{8|Y4-&-*uDWEYlrN@Eu4~?K@R&b9PW0bA``-=b`HU&C3VbBC^#(#T9 zDMn*(11{^O#s8N8(*OA2|NC+OcQF4;LHj@8R;j6!BoF;~?FaxE#2RO1&}!TVkqc%z z^Zz?`{IB+~6ymzUuNiO)kGKkGF;0Kh1ElY|Epm;0x1>?MS^g&G{I5nQX#d++pLP;U z37||;OPg)fZ;G9 zQ-IAL0ZTX${1+*JwtWGpc#wS6-A}XqpK^fz_2x7nl%injZT4l2)meIEILC`-$Xpz;t`D^dSL<+%^$#jy8l z+W)(_>R;cPk@&ju{NIoJUq9EshVTF6!Hmb#ssY5IVV$GtMIm6^x8Nqgb>~dXyf^xE z_&j&QrLaS#^@VJpmKk6Z8>udU*6>Mbp`r&0{{>_1_#GLvGG5#SL837k68Z% zQN3d&Rk~pdctc@}eu`^A=i2?kV(~v%)@vXcq#ZZ{Y|{Fx2T z<3hlx3BcU}v116liu?^Mq>))pRlsfxP-D>OHN5X5K%h3>nm;KI4*2JUCo<*38K(#u zA_4b#v;(|7dmVI8yw@CCs9a_`2HG1qj=ZN``+gv|#O|9usq;7zH=}9Cbp&ZY!=5kZ zGH5kf3e7&NM*DOXm=sCsA;|6QL~S(Bqer#CQw#Y z0_UA6aM3%baq@n^u@ZG%U7jDHRi%^Y+@{(u3hum;E=!Md%QPz%Nn6t$$u2GB8C%nY z14Bt~Se306ZUUEkR%Fg!Q z+SYY8e4kJDEKoasApLwCslr4XS|d!0SzPn4LB?5~Ym|9Ezk17fvlw(vW^hVf5|%&@ z*|qjgZmM~~sLooh#sR+su)dVQAav%^fSY$^!~+o+1J1qx$Xv@< zc_Hhr*nToh!-#O1p_PaoiejSBF)LBr?brR2hTo-d1pp)@klAUV2Ni{^7m(i>(XP_q zQXfax2tWPTU;p!>^CQAkTVF`mu`{$zD0F9-6qQI2dvjoHMI7d7w-)V3*tkj_6v_`D-gD_yw%?608QdCyJ6dNOQ7-)UzrOud_9r1%9`-VFTCYcRxN+$4LIg z4(bm3x5~))#7|1$^-jeA&r##T#m_nBe7qX>9n=Jbd>bUCy4Mn?x}mH~+hFQ1POI7; zzKrn(+4Jhs?F#bE%K!cdNZrTAy8U_wNKAwQ2Q7j<;%SBH3MID#J;Yt))4fZDR%=r! z8y=7QKmkq2V`6dQ)Kt@gTM1bf=gy#?b1HTJeesxX zjpg_BR+06q6~lkODlkWWCTlYTGKK$GPyXj$_|;%K(bOmT@(uWw6g z18ByKQhNS>LLH@UgxmeY2T3s^z$_yJg_!?;iek3RkW>02M)KUmTld3L61KDk$5bpnMAuyc+u41K2Azg(&)zKL`0ULN78F<;sSm{7FL!m}F?dD)IbiqtJ@qDv71+KVvYQLp(u1n|^#f2KRQ@DCBC#C$ znji`ovyRjuyY)TrIBCoRI(6n7@1TG#Fx>#OSB>!C^z7St5Mq?u1qhyop_2~DPH8;4 z_zxgLwlj68_ylP44VJ-^X^-^C{JjJikl1S(WM=flCy#FsPd78bFHt{>>c^upa+F>M zE%qoCH}8Xb>+wgENFWJ4gVQI3UdwmyQki(Y*R4qAO9R*KXtvZ52wv5Jr}6ZU+;Y{p zdbrGs%Jo0V3+He1Q3eXH*GNr@3ktr2<>%@X%Q{PC;lbPrIWbm=-?>h55WN>K4EAqO zZ<#$b6rZVkpS5KfuLH!R1(KPmx>O)iI)+C9)F~jLNk$d2v#puT=py1G=c=lg^1A`~ zjt-FXzCuc7xN)MD&)k9IM$eAup{*Vjst3UIU|V`g7Yr{sB0Q~Ln#yu%!q+h=d`io` z^izK0XNnzg#v*cmv{9y?&96|?N=fP=WiC?b)<2&$v*YW4I zl;+y+4Jf!j3IvF)7hWqm0kB8ALA>{lMKQ7pl+r+v0I^lT*npn0(`SL%%3okCkU(qf zXzBEz-gZ1U0!-pw51a$9-c(mZV2AiV3YDu*)a~p%JPsREY;3dOgCVMh5+8mq_8tQr z2l5Co55jhK*49-$?)fGUFfH}Op+Jxs;?-IMoGx;&zw?Db0xNfc+)8&xEcO1s>_-24 zg^_BIs*)Yt%2{&whsXE-%?^4fSMdFZI>-IT@S)t64r5Ko)2GBFO+<|XC;uvP_`y=N zr&>$VgBm=`nha>w62n@aXN>Yj{lKy!tj_HPNLrq`rkUm0PrjNTZvkrQ@d@l@BUoNk z4$@slU0xoy&H!b$D%fBs{}o7P4JJ502g{Hle#O7fw5j2LI~ff2F@;OR?}BL2JB)q$ z7}Rxigkg)9M^JqxA5is~)PQ^N3C)+G=mB61KeZC|jDAa`rWo3Y1Y{mDfRlQdFWz#v z!Wm$jOyRI-gR^en_xjZ|Jp6}wvykGHJ3I7? zyTL1|{p4#ch)$Aczaq&^C5Bmi6B_ceFW>+zLIJ(5C8!}G*BhPOpZ!4Olp?Gzc=-)z zqC743!6UsPZVco+VG2LIoeD%a&~~-}p2--_TT08uJ#lY6OYz<|TyT<(V+T?02|I~~ z_TPcld;(Mn2KRCkV4(c>kHD%Upbl%UZD4gv*&ppJxX-yJZP_URL)#cSwQHleDZmV? zt!d3X=sx`maLt`DRbHWHJGC;O`EpZP3K5RRll5dfAn8I@Sg7iJ$^3j6`Slvk+nv~j zvFPZQ75123MZ%!}(mx%fUCqvWY|u?6osK27m~W){w0Ka7XI1&=>gm=0f?sT#xc7wR z<9=TrLl*L9&X?&?8^g9(J^yr5&G8xeDDoAgjQ#Nhh?r3Gg-{sywk4MI*TZ)g16T)L zo8$(Ny)|2(ikA1Gl1N}xya(0%_57pV1<;qir;86D7Vic2pY&99+KY;8_1EqL!2jEM z_qcpbLI>^=eFe-JZLWzryC}#}Iryh>SG4<#oyd4md{!(7`%tD5+?p&)``3CU%ICaO z5;R8@S$J!R#lB4at`W~4M@%cy?f||Yw^PPcY7dGu}?$J;h$U!bBLK$q(=ECt zC#fS{orIiLm8j0GM>7KnMgMvU#mAv)?6&tyi{6Rnv){;IOjN)JEIm`ahx#xA$jXg2 zj=4-u!U#EAKwQgif1bY-jqBZl1@S|+{KSGtdw0%+;yD8UBPxqSs z!{SXU3cU^0lx1-A!Ohw2c!GczwxdbB|H_GxzZS;6vlv3w{mbC8q{(hmFTkl25bP-q^)t>!5oj~fmlD&hxdN6owHM1&t>pteje|IAnfJQFmfvgi1OXeTMrlfdHtPjZkUPXOS2nTf8Sz@* zhttNJV~(e6C4h&0JCY6RJJt#uq~_*Ag@KOi*n^Mv35XH4UPF+55wcCZ_7>DtHu>8@ zHG5E|n{hprJ^!uJ*)@T`iDY+Gk9SY0vqi*;8=LMqTCaZgcQ`G`IL-U!6vh>x@c7!H zsFbBRjvNQxk=j%wL1XLfVXR{M%Xnv)Cr}~a{SAME> zrZs^vM?Pg>_JyIJ7OU$^#4h?s8pm6gS4$ZfZ+|7+w3!h<9Fd*d{O$wDvfLPI@gO;- zf|XL?YcSE>ZU-pWcS>s@2ZI8;i5vN!rZ5WFRwmDY6Cf1txjw?R>F*DbmL;C~kIj2yTfSPEzDLxz|?acSpWa}nh0a1WbB#o;1^M__+8;ddiid(Fb zBvv2pE+g#C({ z+DPf4qVU65w$0GhN?P>B?E_wYV-E{vF$5&W>o0VBs|FbZfSk4SYYJs3s6~B ze0HkEJRPI)&;&PHN%)67J+_ru?~NN09LjRiy1ZAMmK56iN9}U^H&a4a*}ur`-|OwV zwhT+#G0#dFfs+Rwf;H`<7$Qx!ST;ucWEHm?cMDmn^|h33^y66G-0dU84K>#kjPd$y zrCZUWCpq!sk%?8bk|YCL%&+1)@sZ1Kw00E}UZxkaJ6cW@X3K*D!_TdrA>FbUTnBZM zALPK4CCiv%Xr*@|1N$uXAI09(>PaQ42~JoLF}Z&F{aJ4zO4Xa*$RW_oVw`+2PczgW zI%K%Zk6n@mw&?P|UOV;fuNsVFkslwRCYMe@xgrXbeOMnpdzWiS!ipXnS%t}e%OjNw{R&iS8_Ia=@Q)r99=-@I6?tW@hA!IfJbuC^UrsqUaUkj9nZDbohPybcgbTerI^hbzQ>`tLXWA+Z z4no_me$M=TD{eS#L{H<6D$_|jKdH8B11UKUCNI>d@z4cjG$IeiLf6>MRt40ksx49?pAp`0=ajD1ohAEx%!X7hW zH5?Gd$KGgNRG`@wR*b+NfyZ3FlSCPmVer@Uc2`G2pV?N+4Dn3d}e9u2fu zGUO+(OKq@1lg+c+&aur3pEqk1BQC*)YQ_e`9(66*ILyp3XJozWPGJ?Fuv@5XjP1Um zV%+*7%UkeNZG%=ziGOm_GsSZITq%lcWRoG~&8An`W|lXNU;d6NOYb#(+~BMaQ8gT% z(@WzV^ya8mgHeRiS7u673G(ZoIqjQ$Eh0<_u%&4HY17MCoFx(>YPgV!@Wl!f&)5%owSDK6sfNvn%XYARnx^81 zzF5}MPcZcu|4*jG#vU{Asg`+>VZ^(r)T-h9xU%!2=bVP01N31EzCnL%T9M`MynEvL zAJ}#pprXH&Ytyf{`aF&~GcR2Ra%)&1CTeF2K>giej4d)a=V=@d0H9B-%`ig?Ek$Fx zKK6$@%11n)QdJ?WxA9ayCqiOGi8{&Z2rQMVEFfi_P%*cxZxs4^lZJa-pG`D-0lcbSXrfy;lnUltP5wNe%nACyF; zmiceN`oef(+4d?5e4<;>3LC}f<3f}BN7-!|KcgtPNB>AuCA#`~0skfYWbK6~1jkxe&Di3#BS(;mAC)pv3wsXC&B zl7;pMbm-J_Kv-0=dJ&r28B3h9FK;!X>wqLJG($X6JY!5r5~8GK7n=(vLRpEc)@BL6 zKUJKSxNvE+%sNIZ&Cxz8c{zCsirGgtkJ!aaLsVzNDzI_v9Iah61jVkk&VmVLS(*59MxFf`$C#pLc;cfZ4ZjJF@QR=)P6@7XBLYM$Mu^S6a~$)ceC(y%9*Iw-bJMM)=+RB5BZ2-}AU zMHAXHoHbh#D%rh>YdDs_m`kcvGsck`VxSK8uZ@=HmO){-mSTuWnLZX;4@_iL5|5FdT zavjHiPTZndd^0_OlVc-tDMh>5t^BjqQR&S$o?lzwJGLf8U$F6^*_mg7=`?G4I@`Je zeV>xcS)9c2LO)<$Q?G^zIMr1z`AZ0#-nZ-6EtxE%zgPJMSRTKAn~$aKY!@7A;v9M+ zc!>N^Ml?Ze13xWioaOeZTl?NN>x0@nX?Gv26tnqlPCfMt%^)NvZ$SSe_SXz*zJMOL z|3Mf-z_-(-eZfkg_7s{sI`$hWyp;1&TSXm&+t&Y~T(y0Y?Jl5frC))f;W$DEblx~9YIe0(Y6H(IhWBWZLh3(|Y!JV$Y zK~k-~AIVXBLsD%+M8fm}w>*Rdvft{PQ2Xo_yh{Exd7gkf5GZ791DrZL21!4m&Df8c zZ;?DLUw#&i7I=DEtoD=5OSI$_q^ceD=Ivo-b<0;OucW`{Uf?_eZHiwV1zta98HAVk zwz*f1~QX87T5 zxL|mg5+w!eH?O>W9|LpPnS+`2GB?MB`-(lSYS*bIocdFGE2|U2x+IsNvG$5XY_4{qj(XjCyd1{23N%fq z&yscTogF!D7LE>&vVF(6s~jS!KQg~(oGvn$^m>xZhw~9uJ8=RD<*lCANjpUp&d2qO z8Mze^L`E5qw21!TpHb+bk-rd!xnt6mzIi=Davk{hPe}5Aw$*RVq(>Thi?Ds`^w81f zn#SW;`9@x%0}-_4a$w*rVv^F_Xb@cT<1SG7f}|XOLXRJ0)0oa#@*E$n$r1I7=qZ)) zw-WvIM0+;9RK;b@ro8!>Y%z&vVnvN6<)>E7-*+7&Crr>>mtMfA&2VlUZ@=(o68)}M zYOqI}y`N9Mv#G-bu43|iOQ+P3c{b;O{h=ND85Qt#DZFOTN0+NX|;+ z`VU?5m-|7Ft)A~H!D3$WypRp7{yHzSI}eLXRoF$#aMh;18|}UT=TBvL_v*VKf(0VP ztf!CD=DUu?TARoke`$s|E)M| zvXk8V--_m|qNTf;<}(5jP@8x$9vss{Twnsvx^vMQ+`XEhyI>LU+$*13=W=23&Bl}A zt6NLkBNLr|1JT*$$7rfRCEECOA)%2#?C*{5rYlalv*np+Xe$iZrs(cLf8=EtA>Lu1U? zTdKc~rSj*$H@3T9KVY)6XQ7_uAPqf@!k1C6ZLyp+SnNAPoWhs96;DMcJLbgXUTXrR zBf~TOhB}Em>l?B4&u`FA-;V9l+mgt2k;PP*-7QV4MUp~J_kMCh=f&nc=2CY~@L^LD zu=2exwA)H%ufij;x`nH;@5PN~a63WX@j(TwNna>&ulEv1m(={ZQRbt|dVS2_{5kwX zzn>e2Y0ab7M$9AF8>U>MMJ~T;w*q;CJ8PR?jVbv#Z-n2!JFq-~ zW*#|};7_~M`W#YaSHG4xA=@9sZYJN|9e)%bpuWS|EUOY5deA6{;k$7CtMlKZO8*Jl!Ia|TDv#Et}UbObYmE?T4R=S#s z_OkMNiXaVN|1_9Puba6$g?NEv^%HnVYEkFiv}UHc@~ZztMw-aEgO>Df^26`Hm`cj3 zoQ@0dA~Md$f$0=|_7~ zQ5VhI&^?r#i9-RowiNdb;>J}(FMX105=ZhIUhbyj&%`}J|G#8fd-CYrP}D3LqA>cEEfk-!N6Ln2*6vvzvkYcqz6>erl+)5SY)V?%uWSw zVHGi-A*se!yA{~(He6j9hvN6Bd$*8dE0aNgls=2PzkH)OgKs%APvG^5!#KokySTC* zJ*3?doq=!cV=q>DLwT8gY1TYym*cnK*@aVSj(N3WoyfEzPs3)WxFV_kCEfcm{+s5K zQ;j(9qV;r7x(IePcgy`59#dgCCTif_$Ma~3-Qe-X=O*u48ZiCbk-gTt^RPy^vt6@J zMfouikc)rNGu7(EAZTCwDAa1|B@MqPU~L=Hl}fx1S!$_iVTMPCj*Sn#PYx$6?Pbz4 zBN>W)2X7>WMdhDmXM~l1Vc~hzEa)taP|?%%!`fnO7Bbd)`ZE8CQE9xKo75k5CVH6W zf$}&-wpRO?v!f~1AD41PY$hE8hu*tqv=#fCPrfht6CHxazQ-?owl`pGL zLVXv^2@y~1ydyG;1xegM3*hU$DBrl?hxAd zN9nPAlODuJRY>(zTa4$El(MdGm_+UGN$Z1ryBeGZs678uk?E#s|eEI8H{ZV1ugw2z>1`iE zJYUSeBU)qpgO60Qx__PYT_Kb{B=$=?VfKslUpZKbDq5U@#8j~cqqdsN$O})+-XS8q zC1d*TuW(|jjxSk31dRb^4U*wYj;-qpu#?V3ML_}55LaG(Z|jiq<1q~DoJPV~(7?%{ z)HfHtpY8owFQ(}HpI39Dr>r+Rn1nu@+fp&;)jb$%M1B)HpPN?ct~UN!tykUdM_XVU z&$)=Aw){3aWYAdZTykMw{AjlGKr_KXbAFgeIuZr-(dYZ1$qhosPHKYRrqS~gyv4m5 zL0!d2{C*l#g`y8C&ps7R;P}Y$OzHc>IpQpoYL%m)D(i+fYCQEtgtm7iZ6yZLL*`Dv zPst!8so(iSTdkl^(NH7he$Nw$k`PoFjcfyj-j{qOlF^UvpF(_SU#!wFnd_=%$QAPT zkIUxdD9_4gu+#MJ=kV_V=LWrcIab-*jIQOu!nrHIb!ZMYIQR!ioHK(D--;&p5an~o zD9=;ln|xRb)bnNy%nW{OA0ixAJ;U<1SF`hv#>(-y6M7{CoEjH$iWIUIzTvn#&!-|9 z_C`y?(_=e=2JuRkCPc8khr}3~8Yt$_x+yO$yt{x%7>wf3D1N0aU91Jk)*zzl{Ay+o z$z0r?%gV>N`$%3?`e;IxO}0%_Vo^`A{2D$@4G6a-%Wle|K2bzJYy`^<&Y^)gP{wAs;8%5Op8qimB$Y2y@irrXSCmu zIhTk~bxI4pn0#gXSO(EBldPz!>gXupW2Y7W9O}vb?1|1ubo`kHo1x$$%juH@8|4~ zybhZUAlnc5ru2B?fs@}biNFR^LXL+|!1t>a#h7YK$o4CY*J;Wwh2=;uZ zklZ&iJ?ht`C^!S=D%HlC?=m4m6HC#A%o6d>&Jm=NKM+op!VwYrp;mdaS)1`rOAuko zx6!}mx%8HU4%<~eAIeln7-@A(as48H`d}WMg1@*TiJ3`^aPK+Bxt+)KfR>)&d=XE- zqW|SD7AzcyP_Ri73PdF7`qT04_&%eL_PjrUI&xTXe81ODNc=8ntO5zBTJeZTIH;ca^m z_?e~1w?N>U%|~Ofr<1UIoCw&lh3s$KdyBr$uJ~+AoiiX=!H@EnxaF-(>GAnl%CMzB z>HW?MuGA%YIh+@zQ`YvC#47v*!Ys4F_w$JqME(7MVY_;y8RhuRU#-I zPIEW>)UKDKv_ShY0~~V8JmivpHfLXptj9E`rz*4C%ZF;koo_n#ht#gh8NUeps4{KB zs?Y5F^3DleTmiQ*y#H?Ytpa|tTG##lDYl|aX6i&4apL`trgewXK92&}n3BY&0%oDu zr)#`E9%|(Ar=}OsdM67J8%aE)f+&317@sbl>akSM-B)+s#WXdum;J!BzhwXMYv~9Q zbPB;vqn)B#EuaSGGrQJT^nVz1v=Y*5H9qtd>uFnmd1&Z9?%!ra8hyzX_qyVDv}!{e z9-%KiCmSc@60NFq?(&~s^=g3=6-)JJINDuJ^nI3H9iN4Jedk-|!uM^wuE4-XQbwg1 z^42Z-3r)xk1=5$8eS=8;Z6`rC;^b7F3Co0w`=ogvZOOcU+M=QQ=M8@Gk2G}SJf^ha zuZkGy(sxn@U>M^X_g>2(r3tHSARh4`$(8~USe2mX5ndw_*JT2EUu zXAH&gi-C${K6DHLQXKnvt2 zuH_I!8$Z00o%fb0&iFOo0j-e@opHRzj;ZwS?d_AJ30xNWV7~0|esf)ymS@gy;0&Rn zLYYIP*4-4;*4<}?NkQz=FX+4vM=^`4nZqK57O|G4Q!3#UY7~J-UIunNTiSFQ`tS8#<9?4D&U+h3_#JpOsp;$^?S18)+Gdf+HvxGju#lt2b)j#?( z{}th+a1cjjw5LD((aK@?HOFBRvrm2^bm2i4rFPQBTN0c8>Aw$xb=i-oz6v}BXl245 z(R;!Vfo)*n263Py_LG9%L>1c$BU?$U;@j*ee|0++AQ~~0?JtjCN=sV@LIgc=w2y(u zQ`y6^s@EGFU&wy6X$ablvykE-bA7<{f9qs+Z0E`JARbiaeu~Zw#xgmQzIa22ESei+ zih=UgAN^|aLwF7mw7Tr2y~-Ta`OoPue+N%)YLIZ&rIx2Un8Z99YtHwDMeiPe>tEK) z(K^&jAj;_|(vOi1zlweYVSkR?fRd}Z_a)pL({^?|Y$-Z_)YhKn$E@2gR-s}ckznJg zR9ji=;Xq0d!d1u+ELW(Hr`*4SOlWxA{D5$R%A6!Hz{S8%(6b)VNUxo2>g!l3tejQt zqx$Ac(`?OiG!H^xaQM|r>_?T%*h1Lv%;iO?j#jxvr7RsC>2NZ9N8u*OzaQh8uU=^XRdX zvHHUPGP>pr&1|#(p|0WTxSO`(_ErnO*ez9l=e9JhUeG{E6p;y;!DqYhilK^N;li6W zvrYrBlXTiF#Nsv!0jgqSqT#o^8CYL0bN4rAJC@o$RsD02s!X!F8{!>Rz}?H0s&c+a z>y|*KkSki%bTZ^nir1G@)h97k`*LW^G)6qgKT2Dnt&=Gxqoy;_awL2&*cAhgj&${y zP%BOPZ%)(2=EehUzRjqvWgV+5D!c0Ue*&mcZTQ8EIO~w?stMT*g{EIO2Fc)w*3z#_ z@fjUYY{e(F6F<~`vyNdK%QKMloXWZop>`A^F1S*f7x*cfWjs>S4H0r@^|SC({W!ZB zY_sr^vt-S=q=kvlB1`E(d<}=y`qTUy;bJSaW8xkblGkWpsb|2+bC;!3wEFHY+d=Ny zNwe-erv4KPHqvMW)oXGFI?vhaFxDBca8>5UQ^egRj)hcB+uYFNSZOx~0M9Oz7CsqR z88~P*dunO{y%^q@k!`!#Hk)Xuu`})zXP^ExMJ&B6o|-rk-!|BErT0;*sK$t=>?`I| zjhxjsOuizdaGAIJq`2}YTBc;%mn)2CC`LSqgmzp%`1KVsz+rOv>7R%zLnBAM@P-e+ ze@H)%>dNqVyt&%Ed~58~!rUnD&?Nds!8QoFSKwQ8{+}ZyIZbi+nbL16hMwK|b!=BA zk8qv`#h?1^j0k%9_(pu|>}2ne$_(U=JQL~`a(ldoPd0F~gD%P@X@_6}#(P%F456qe zpe`5C)Z7BDI;H5Nq^4C?=z`(o2KCWjA*ON~4;vm|fS{C)x{S)i8dto0cn=eclbQ5r zXVkA&U#P8QY1T<_6?vNK<3R3bto@4iKGYF-t&G5KHvu}TP{j9E^DrjA_}xLo%T{AC zT2L3C|Gp$u-q1P(#xacw#5g1dl2R(v*;WbkN~Z6IWz9Hbqexu~R19gc<-U4&Gmb&s zJkFjZGxTwKipyyI&cz%q_PN>+5xjhpQpA4oiR&@`>|HFSk!#~Jy>4J;8M-@pE?qOz+?Ea9Z zH|+n^R8{4YQ857)dLmrf%Lk9+^jDgsW(|^mxY|5i`d8Rssk~qHhdsTr*1pDJ#J7gv z>3Zh7z;H?4&t8$ zo$St!23W2EGek{2$A9fw=4T%t&ZPQ%l&uJE`g(!8u~!@9`w7eM&K}uB!m?3(ZyH&oPfbF%Rs-8|q z{imvVxls+VwRn~IC)NzfV-q~OkMr^(yrC)#J%y?~e%FUn-f1uvm?VH56M^kXS)u9_ z)uAYF;+RA=#gEL6qQke=A4ACClDaflx8h4UW2@(XksoaV@1NE}QVi8-mJ+Uy^a0ej zK3IWurL;?TMv*==_0}!enNpL8=ZCPJqnNTH$m$)353*QvJCeCRo73x8zrT2yWikIA zje=L5di`b1{OJ^wGku+%B@{Jt6J7u|kL)Tkk<|MHG}hATyx7@UfWLen7`g*8+zoZc zjqY+-jtSqv;?YeFkLRFdf`rrea%s8XND>2Y=&y+^c6RSFQ<%yW1cm1nb5G)iy7z!% zBBvs~hdD<53^+MSo(vCNy~plE69WytuN)3CJ)-l913>B87{Gh>x7}c9ccKi~ zt*Z128lBQ;w1W?bdM+<|lbti}dm8}>w>#;Zt-vP!dwNrI2|S>6T{vY?znt1N%(Y7S zam@bqO-|Q{vK2ssK?%v!;1|xR2j9NR^a`_-Fkr{Z)b$Sc``Zeb8*o`BQ!@z|!}W!e zf+4?5!)LS38yHEk{o5MI(yN$D-1_9rA;*}dVPVy z!m9oYiMCp^;WhSRyOazN;_B3tzmzAm2?_%TnHFAo^$rx7{EXRzDzz)&orr0P9%R6= zHm@2P5q6n}nPjhjdg-sxuU*uu*YNfn9*4y@MHtgvPY;tsr)M~)x+53eyl|~!LeG?X z$pWm69Axt82aacz7-~cOVvMx)%~pl%SEY~dhVupt$-$fBqp6xV#IY1D92L5`dTc9v%1h35pOpP?W*o4-F(As&N9B{*TzrRU?5NkX9MtC4#sp^3ns87BPv@7A0|DM-|gb2%b8UG;ZUycKV!hsrtE^}DX0|GYEvywCI8_j@nTdw)JRx=mP>!+)#PS#N4@)bSDyv8@e_vF8Jc-{Dq2$uNyMXT2_$1bHLNxn6V>|pJ(R`bTh`h1S@Ju4o8tlTqDi>D9OyL7 z4v|FDsyn%q+5ih$wO#9)&5;WRvRJA4&q`Yi4w}_lq<+3|bvyr81IbxkzVfVMht6=Q z% zyNXQWeq9EhU`!xtYm4wnYE!4vNQAsoFk8agoz!h0XspGFdSsZmQTyoEO zUU3ue0BBB1)B4?Q1EFzs(H2QF$-@(6eOCt}XtOUX?$nbxy7f;o^sgUHrj6UZE&l6_ zfqm($P+ub>Q)Sdihs1?_3Vzs<5VhSR%y;_t=Z9QV+QoL7m=ts9e8|u#i0Z?lTtrmG zO|-rghFG9`?i&nR?f&PCFL=s9b#UbqA>ul6?84 z_KU+7@}336)H}+j5;>?yPV#Y7Kkpyo4BEaw@Kog#Y@BcFHmU4g9<@9r0cbU0tXLCX zkBcuonqqc<6+8QW))JJmIPRgtFq<;6D$|WE*3&Fjcs#Ykt^9rlQ_9E_;C=CZ3m+92 zcBcxp&Mm$oF6i}am<1G6g=(koVw?!~`?|M8HcbcD+OyKmZd!AL;%ZidsY(>;B)L$U z3YF+Ck`syTZrWd`9t0t)*@f%BM>maJ6I(wCG{+QQ;7XQmyyB%-QBzhB%XZ)e4GuW) zGy;+|``mdF)%@0SyR5brhuoVaM3SxUT9~F zxS%5D(!2$`cWuz*=uNz>_6NuPPsZo2MRr$d-(ZAUP*TlZ<2m=+bt+7s{WPD+!4|Ub zs;tV;5o4)w@Aj&C=x}GvzOHU&;%2YZZ?~i@LInIFt22K#8sYBiNRW--oA=(Qlv(a+ zaq?i4nVBu`+_l=&cZShan!=;k{uMq+En_{sdpN0Q)#f{RB8%tB50zU8Jv_AS8I>9E zDDc{yF=OD6rmN0Y7?VqF?&)mIE{yw9?4%f+OkA3yL*UbgTAW!(M0}q*_h%jwB49cI z1Dp*XJDxX+(eV?F2pmr1kPis@0KBkPe4BhvEdgDwIoB<`u}X<~xl(@sdrqiHRI|9B z8wcBNe!@!;?8J51k2*?q>EhfEOHG4R!S3c=#!|lV{;ht}#O0WMNw*lGKs@=Psc1g8 zI}!uE&oy}33XP%5sJ7u=??%w)?WS(Go2@Mj6h$d;8X=<8Q0L4k#-HUOYsHk0(J2b{ zld%b{!kc&^^SELceGM^rYrV~p0K#QDAWdLu58=%j&+kK-?Qu`xwQarxGw*P42*n!L zKjp}hZnAJqUi`@;x0ACT=UC)y+~3g)G=amfu-86DU+p-ZKyY-O@6A+YWIOB26*XN{ zikZgVJt^oHXWI2Z%|!6C?5JI3tCW?1EWq*L>^vOI%gp zeO-p1?v8;n_d^GYBPN0}C(iB<);5}uISlxk1{1wq1g?oX8FE??&UnBkW*-L$M7G4k zhP@$`wcf4V?1;;Wt4#uf@EGUQ(v~KwIu{xZ6?)863Xf-PDF9K_6>TLVg$0cw{aIQ|zS!2E9pSEk;cT~5$ zu@632LfiLhCqC4`BLpp9*0DWJ#t^OPAk%;01?rZF!Mys(WGKp{BhjXU$@JP_VKphl za&x2I*hpp7jC?x8Cmtrkcdk4K^0nT{VGC;IJ3WcD-Y%GOz*zO@98EL0-k@&{7DeNp z4*Hv352N6Ut76F<(AyQfskn~3i_+P9{C2XKrF#Bg(OrIY1|JE!<7C`TFiYzJ9CgFv zyNtZsx}TK;`weX>G3Tl;hL(O4xi#~YBlx@X)N6%8$zWNL7`b#G! zUK@{WWpl0ts^%j8Kk#q*0TtwDc>mJuSbm~Lim^k>tRfmYSRB$=8N&nZMwxi&+11rs z8fjXIE8*J$Ckrf@1lF8Gn;D++l$8my7PvtRKimH0(crj-gAk9pCE)l^oCe&Stnw&u zT3?@p@T%PVxy<1B-_6bfq%`i*`Ezd{FB=R?6h>mA@nB--QJ)uk>`V;x{)&R2VEHo# zZIzCz7bT-L?pHxwp7RIQ?OfUyf8B4Wh3LLauDI_*AK}N7&4wXE=0~RV* z{KG61IamwDlr=*G+Irw}tgzlW3>|v&1!jhHB_D91(v|1_HZCAX+Rt~k$1@k2nbJt& zn15<}-_VekQmp3hD$R-_n-B@0NjmE4Ywwgj8Ff7k?X0p1b1%0vOHH%Fh>QnZ#Ba}U zX_jM}g;xTU{V3TU#9!A(DvenZM7!LoT)p7&wlq?m8|-vFLo;1Jem+#GSo!9(4CdSx zGMfQb5Ae|W>sm)=QM%A`OSfF-j%dMaZc zQG0-v^sLvQh+xHpQfwc~Y-3P{BDhUqR9f=b#mt=6^m5a`7odA$L0Wu$2{ftGD&uob zTBnvgf+fk6zDw0F^Lw`S?wdu+{Q(R;9A_Tmm6ZL@`#$0BfAJM=Rt)_pE6rmRXWlt( zppng<6)#H#gAzd@9-;x*V5xkPCV@NLy&7zsJNw~qO2z+(>N=L}YnVb0b)s2n%u+V~ zb)?*a%ADw8ytPnXG4!H{hZl6!^rkD-Q_mJ+7vfeVz6GN%xKJyuYC@|_Sr`-_NsNRZ zp_9quzGsizlnY`FCw&lQ;vjP{b}1!rUkqcDBYcmdOsRxhV1#Vvkb&xp)5aqYZ!>w{`;qKn5_!{hWtc zg^1N*tu=2G2{DugR&Ac&>A_ zT@y|mUl}i3v;Vo^(s}tVI(`z$0rI3FjQ=WE@qIYA0YXWEN#~s2Ya0)(o|VHRZhgb? z7n+Jx@#V|$XcQGd60ET6P}jM~o=IKZ83>K~=@(&q^lLlZEVm3a;C?NMr3c{{Z4&JR z{z%I5^?O$6rJ^q+Ik|jj_ysB=x>}lxlA%!@yq|pnC|Jhz|Jsj5ZiQ3a?wdFY+ zQbcX+LUJOq?d6X2ZaC$YLs|>VyAlzL5z!5;I=bAaRR;xFD*0bX1ibPPNIcEIbXOdj&`E7QyGtEg2|NZ4!ZJcEA2Fw|MvlZ8%g3c-&gKRm0L%E;r zbeC&cK7m87VlXyc;mu8n)fR~<~C zuWpIN-cJduF8&$;gN*(En+=?v^CnIi{1O)K`~{Z#os2J|&_AX$_O1Ge8{HNLn+p8T z#>*yi*^3Pbp9czmGBl!g@3xOk!J>ctL^Ke-FFJ`kaPx;@LQdz*3yxdK0!hLoQckfj z&RlY5nKZ;ocozEf4vj;IH0aSUxmFyUWXjLj4(P&B7Jn~;Z4|J5%i}aNBK`bI2|tInU|DmA*QwB z?QwfA!BZ}ODN31rGa`1@23TwL187h>%B#__9yw=5n$+ChFJbrWPTk-jF3NdAx3?bNv_#R$=Lkyk&7VJ~;48Yb(|JOUs_P zn%p?1rHLF%P=*ZMrJw_Vk7#BZdTC0HdBISI0-*5*B*F2V{9C-ekO{>YR`?Amvy@L{ zywTzGZt$lCL%|HeDe6z{fDlpxohol1$R)4E`Exy;dJafrcZD*rYtISBL==%CZBv@( zeO##IGQ`lsL83BWp*ma+Ipu5sT&?{Lshm6{0M22l7@0+ZjjG*iaF^IGf6xdM?K zqYt4_DWb>Qv^CR-s|K;m!JIqvZBL^#?dj>`tFC|EMItV?6J@}F8;Vx=e+?3hD+C=X z@jfv=aFqGOiGc|B3P6tXdTqY%YPCMZh62_E|B9JTmj*4t?{A(d{fvtdO>4OZTJPlZ zVY~aX>0)WZFCBy}R@A}~FiJiSLvH`qH!?PX32T|DJ=~5+ diff --git a/ui/img_timeTrend.png b/ui/img_timeTrend.png index 4d474a03eabcdf2646498bdba12977d6b1c621bf..2c92f80c5172d5ea5e83f8d7ce1dd842a9f04b4e 100644 GIT binary patch literal 2467 zcmeHJdsNbA7$#+cn&wi$O68}fY4c=d>Aa9oDw#J5Z+VF{kJp?fn&L!9Yjd-ucGDzF zauv4FrKV_<=3HV0O5REfkwP&=@q!mrbU@qA**W`rf9sIRYYU|?WqXb6MB;BdH+kKIWyk*N4V`F0z6BAQYQv?D50Dzg9nYp>S zg@wh|ty?WEEv>Aqwr$&HZEbC1V`FP;yL0DGdwcsmd-m+zyVt?N!O_vt$;rvp)fI_E zy1BWbP$)DS?e6aG;o;%w>50K$yu7>)9XjOg?d{{^V`Jmu;^O1u6A}^<6BAFKJeib~ zl$@NLl9ECo5K>c9)6&w?)6+9DGKfTCW@ctqRu+jw%FfQt$;ml;_UyTH=W=s%^YZe} zpFdwvP;lwerOTHuU%7JS>eZ`7MMcHM#n-M~D=8_VP$;FPrDbJhR4TQ+yqrd((dqQc z%F3#$s+yXb+S=NO4PjF9x<8B$B!R3H8nLiH$Q#)w56q`wY8PS zVzJrmj*gDb&d%Q6-oC!RH*enXcsxFzKQuHX5D0`q;qdVA$jFFDBpMwZ9UB`PA0HQs z#S;?~5{YDLYHE6VdS+&3c6L@OmCnu0&Cky-EG#T8F3M!GrKP3i<>i%?6}eo#y1Kfy zwr0Z?F+dF*v<&&Tnn31S@!poc468j0h%~|(#~A-E$*)X%;?0s9{k*acc1P?avA;3>_PVP0 zXs-GabXfo6D!;#3e z$ze-nI%RS2hKTiPcm7L#&buJhX3|&XB|IxV>oHW!nF3Q27c*r@sb$gdNvebS!GoIM zKJadb?35sY8wjb9zW$lv(*)>Q_tDXmXKsVjk;-#s#wFQV{7yS9aGrA^Gy6=7xk=`d zx-7F8MIGHB^p8*@M{#!am2AsjbhJzDB^zJQnD41Nq0FKMS>0@sCxE5H+Z94FChgtK zn3y)-YU&A&x%`d=>?0QksS*G3?f%gUbs2A=c(PFdS0k6}M!%J;of;}r;ELjAy998U zgSL|W$$})#%Q*qXfyf|$a|_@&^`6j zSm^y8@|V`<0>@Cs2ET1j14P-ftm`PMf^%k&HK6h$-xBiOgK}Nr#qPEEx=^JC;Z$yY zy{3}2vi5F>5}VA?1PAqy#m%de&!2m#tO-?lT6OcLv#9Mfw=M=g{?AU7CLL3h*1ym3 z75giFs6iTF&%_ku-_TQroc<5pzdA$6`Ku_`Vc3!s^4^BQrQM9;lwDhCBWSBMxZvfS zFYv?=WyM)Fq`5^&g;IB;oOhQP8?GFo-AH+5Wv(tyN>#O^afd>ee|1rZt6&#b;cm*w z_x(6#zN(ID+1(PtY{F=WU7@!cIp4XEmd;`SbUg~qqIfKMV{E%_(R78+zj%_aM&3&n zyIAOjD4IVpp3by`Nqfi*b})JuqMZq8mbMddwxb_6L`#sJ{5m|q?MAfgz$xhtnqb9X zG*-(8%=MHo?tbrpSQDp&4=RSGf#{NI$<-~W7nSK;`~z$bsn7 z!ZzP9(}p+l9%mz(XH*fI>3OngH6%!#=ye~EWNjz%WMscka9fofWOJ2HVs z&RuM-Q+L|uysMg!z-=Aif_J+g0)qF=_a!n`g%^-7$v%jP)v#7-Zrv?Sg$&5$1Yp8WaGAs-d5Es&RopL^B*<7fW>^E#m) literal 30606 zcmZU*cOcbm_&@F(=a}KxWF0eG_6o;H2bm#zg_6CBtaD_iGRrDk$d-&`6f%;LEtHig zS;%PY8dR?zutbyJo3bM0g1Ox;WT38Ju0s=xb0Rb$5 zgb4h^loufdez4)9u5O^Eu8ubF@pN`^b0Q#+yMNzg#&g=3P9@gUs(?Wyr}_aU{k=+) zE0&EcXUn^Yw2}+Ishw@?pAanQ@%K1;WnAXvM|YF#UAX6&JwjX!F?&LQ+SxN5yEQ*x zFSM?x(vR{KDEUocZY1x9mwHuHUU_BR)sR>jCja%e^3Ne@%)6@@3u#)+cC%a7(%Fd* zv(p|ansSm3sGi%wJSz&)YqAoBi*`j`8hdNY**+^vJhk@E*Wa|{86nS8HMgruA?%wj zxResb3M%xh=KhAjoa(2|3-fHEd@*MB0go1h-%7G_P|00c<#%{=uVB1RaGtm0NK$;? z?aVf7cpbOC$m-dq_je3${m8H%Hfz#1_%|T!DPysDXYRswIBq#-uv?mf6Mxt=+F4Y(2j&a(USzlwmEOcm0yr+{doI zm>^Wx%G4@iz}&3J*=Ff)q|gIfN?+8NNUiara;(PdoG#4z__MAC5&6#xoIaKk){+nC z)cz)2BdU#QOx*TRFOSG#$;j;URasQ76U-eLsVIHq^qNg0nCStpRF2)-GwTXwRWOO- zgy=IZY+i;}2njEz7>pRDFvUKzr*!%exP*J_-H}F7Hl8l6=`!$zdOd%- z8C(w&vs{F-1Blz+Qocwd+&rihJ*pDgs#X(i4ys*SrMY~eq_t$ayn8X96 zx~NtY>@^SPgrN({nhDX2eQ2AvPQk&0UjGOKZ^hU1I`k`y)4G_QTOlrt=9Qb~&`O<4 zQAwp=B429uxo!D)`j*z7@t*0P;hx@}%^tJkmn1LqJ*@_=U~a4UC!-5ruWf(7d&hEA zLid%;mGg!1FD&n9^=gY@E3uv3*&`wpTGxizN50Qqs1Ilk5FyHHdp$b3TP;@^Zb7Jr zqz_Py7LluU|EumgtP_Q`pB|yCHTMwj$V#LCh`txpN$rhgz21WFG+=#7F$*Aw1=8Y>dG4g z*61j$iVm)#tA3(e^Eisze~VOa-{IMwBa+);oHdu_n)D<5>`Ik$Sce^pzCB-?4YQKV zk^L08@j;&_6t;2m@b_kzHFI;Ohjb>@M$76R!fs)~c{_W_*>^!_rIA56t36&GlP9|bK>f|v#)Ode7~L|DLJ>j-?skbiTqdj zImuU&0~g9?ABkn;suI9aI06Kk07ilV|BS(7j+naaNRI#K|Ni_D0U60T`2Tqd`UQ#w zMwc*QAc^{4KgGe{$e%8C`sohM9D6tJeWn|ur6$U|rA<0V2fzB4`!k<=EQ)<48F_wn zAmL|QqmzK3!CfMX_eHvyaiLwB^&}gweO#4pCTorh9R1y7F=OGp{c`(>&vlX2qzG3N z>xfT#&E5-LMOw*x(h=U;u>C*V1Fj@yH}CR|Hu<}5PhQVXow`53iXJR8m#npaOH}K< zph;Yy8exP`@LzRg5Vh*=Hxj^71{d9{3>~>zY4Zao6=M*Gd3EbYe1+%QSh-LgOSU{F z$K<)`t#Vcrk{X=+%&qBkeU+n>=s|xk?Sq9!B9;s$7%uO2iz+*Ox|EAiYO=%Te5do9 z2+|AYx(Ao-g8!!pd9Y|dLTO2i2+4g(@1}WciPoJAWH4 zbYALB)%uWL&G|p=kB=aUU?;5k_xCWftnjjf?$60wu4`5_%Cv>nR|Z@=ltXhQ~4~+PDg`lc^B`M6*~O=vtM-W-2+nwYv{O}Ohl2D#4ZXp zE)d)nL!{FxT&w<;5q037Tx-C+5L}wQop2a-AU6}vP zqVOk!NC-mhDrR>!$kVr9dfe<@*ZQlU9?~Np^;Kp*1#kE7F8h9N!)rbwKl{IeBtZq9 zD}+8=e^vQyyfWLrJ~0SqG4NEW-{h*bQ~$v1%Rjl!UH>yEahMhJst9AeYA4-&hiNnT z|MV;jS_Q#nh}pXPFkS6`g|aG14i1sq+48>^x`;5q2)=pO{=a{Ug7c$QZ&Zu@uU#5Y zg8+})@IL>)eu|19Aj6_8zLTFiDTW6zR%U(;ymt%spy&z-rcDGa=21>O45bs`!#-M{ zpWL1me{6k=Iknuk@!+z8C)mT*%lY?=Cz3d7)U>Hz!^1jQCw;o(R14r#8 zfuwc)|0Jzg+6_9CFgjKY3CEy)z#bF1oeBQ4yf7@qQbj@MS6A*Bot3}fe|FZ!oE$_Jr~hvuxk%D z?v76Yp%(~@)w|GT_}_s=U@_w8a?5&|nI?a3N*;|0KO~Hi6ntBQU^n9Q+nB*-EMB^~ zyqpUSn#cIO+`TLt2HCuR`90IA%~`>QKmb;ek)&5;S+XO-F~#5swN9<;|9w%4I!4s& zDH4G!U=3#_#P6UmFs%U#PJt6|K-VHJFqX01n!qz9yswa;z1#K}d|r-RMmcINh! z7YUFB!fvdmCxXM6AxdA_*~3Wh2_IqFbfE~TAU8U#y*}zWO-Kzgk~)k}?Vrn1(ZG;C z4J((KPmhWQzbcMqQ@kZL^%7*n#~m6BBp5UgSb`H@z;g2C1c+X4gBf^Uc!YJ6pZNB2 zzfh(6gKz>w7BJ@g&K8>W^w16wrSEVzx;pTVVKeFWp}=hxZ~sV_KlyDNDSXtriiZw3 zgxT2$90+U!3|G7Mv;XY7$7?Wy)OlwQ+thh@gicTfJNRZP$rE(~9vtH^;z$HJw&+n> z4c_wR)Grt5oCA4C$cWX9e%4L zJ?}x5=)Lt9c*(FnIK(5@?lb=#B5##*|JnR75zCil;=~g6qnI~DB#z<0P52%qYMsXO zuoh;M<7Q2Ov8UskQoV>)&IAguwMnx}&al(1@xnU8+-mz}E;_w~8_|)oa336{kf;Du=pyxKO6T40lZJ7aIgnD`gXbKGK6w3iuzwz71Q>;XT;wbJS2NFss8ItO z6%y*XaJo?e9)n(_&PPs4p2&M~-KgTbn70bb4}UF~mRlgtR)!uOX#NXlXS{*BMHz{C z8%3eJ&~+ceck16B>gDkolyP~#;2sV#fd5(@m83W;RRtdI`@2aqs37e+_WmzXm!gk? zre$mBYnSPl?&afK>`HgiF5Y7pJqS#z9r2F~iaQ^xIsQ15(7$}D#!1KT?x3$DBFhK^ zzMTF>-a+n-k>W(sJ61WW6Y_NMrag~|s&-IF#8dvR@F>6!RL5zxLPzqiv1$%9m6$B8 zj6S~_J;WBGfyIoMg0D~WUmLq9r+w#@O_N_qozKWEkvWf7Ki+40wlMeA+4Np=_bGVn zCBu6)IHAJi!h~N?h-*+zEcv79wJ5(+_q|MuCgSUy#%7ks0A1E-+>6>(V}K%nBk`0ZVG$`_~lIr zd-9V5C4h^gNLIryGL$hfL~^20gkaZ9Xi3C>zm+CMc(*4Z9lyMZbOuRWTG0V~FhLMX zEEb{>k*A3^8iQgid+9!%0qm5yzy0+(F@Yo=qX#8(zc1-Br@rF?SEWPslwx)OAmR~` zSpb%y2gh52LPwt(32nfRM~kD+;xC&mc`x&mG-v|fsH0b9KRsMM5=1PFnnuEYX|cmD zBOS8fKCg55Y1WV>O<4%P$R{j2PE&&Ze?Z|4M7SW@45Oy5e+h+!A|r2)nf0U?B-nz$ zfXYr_3$*2+qjaUyEsMjKI&i{fRc&sQHN4{K%mAwtXMxWyo%sg)uaHQPlv&n)c;PlV z{5$c-bbb9{DVmc4IDi;1DcXWEt%e;XWW@y9esXD1l3wKK?SD-4&@!- zjRKzlr2(B_0=M~dDPQwGTsP4IjrXdSL}c-Rin&;WraRr!G$On!EI_I|V(Hk8fTtwQ z)~WlPn&>7eLbrWQ*O;ukIdHpKB@i5u5f*q$3&_gnC%kkWjda)lh|2Xmub;|ZeUpqD0zXO$mzn{A#fGpo+)y6%R<7{F5-?E14+R93vc14oq807seIiJ^n` zDM}mgt?=<>kecs5RvvXSPwWqYFA1Wj-RqxBHhAan?|jss$>yN}DEcBe5W3Dcn#XU) z&r<~=Tk_7%4N1pt6kUSa`DU?9Ortm&04&)jinnEam){Enxlw|ImjszbI7~AdvMCuH zbXU>Y4!X|k0qNLx70VuuGpTkq1I{8`* z`&d^=2?(S0#6;ex=I8;V`g1uDL+`N9cmDReRel&Tdq9o}raL_K=Qd~Aa6#ZeevV_9r92!Pp`i>F#k_jHrVE!*ehGN01{T8AST*}wYlxeW0#X;WIxUgJVJTX6fTt;P>U-qG zt}BvI)9#H%u%bb1v~i)2TPjA<%UN3qVSW{=Vh}?DK*cCZ zOTR+vttBBj3&=hNL@~0LzkYbqUuyFFyNV}EB{(1j5{*3EO3x%QN3cO;+kEG}{s>Z9 zh_@pLP@YVy-tsQQF|$Uu&~SY0JffIn|lCB^EE zhUL@>fj1gF?`H1z<=_id*o_Ps_nY*T=IZQsRych->93ky`OEv*%E7e4%EhAI!##TJ z@6BIp(G}#Aq5CJDQ8@M9cRI=&W$})3d#VuZ2TZ_V#_hN6%;mS`?Ic?jf&0B&4JCEodT-EaKcoQ1Hp#)Rn2b>XRJPsmzH15W8sLX!y zAGcoa6{;*tbnpZy)N(tt-g9nt{rR=CGHy2j=~rCeVhOT+8CNZ6q~_jLU6VjKQYY8l zW6E*dBW5<~eFvcrKg8`f1RU6 zZ)hu|Y~`j!0}xrLF~8E8r4rWiE4X-v)#$?T%22+#B4c52w}LvL$>_|EDBVH24zc$Y zws-H;RKJRu4f$>D`|s%Yv>BDB!4saQ+{B_%jwf%PJ@3zyoofc(0-lzCFwK@Mzh0 zKHLfVpJY|TCCp?c5ye^Kt=ks*Pn-f1FItYdo<)SyB*2FYbspzLk4|JWC7i`h5a5kb zBuBlRYnQ5TjhbAYOhXm+=bz;EOhf@L>&|KkZ)Eb4g{WOAayVB#I_YqW6A?#E!c9?m zkV=!kZ4kN~$xh$d<;a3Sf2PEnUD3}CZm8YB!lBHh0HgP3k@d)8z7XK`>*38mGex>A zYf&Z(gff^mV%Pw(?_CA&ZI`jKbi)hZvgCcW*WX2hnqrA?Fu{DvP&nbBFr0Y9e9iQh zki)6(k&)B)UO$G{fOgV>qnZNlPeY;u8^VmhOK4>kF>Uf7D}E3mg+trNMqx@;zmD?e zF<||<{;);h=ul#Yx(N$$KXh2J;(~5>anm4If3o2yxC%euG}n+ zS|_Jf992V?F`@h)A`2M0-J)=B!Sk#(tQyD9Gr|fDu39GoTDgBbp*Nz?xLJxMMIC*a zQCJwgR7UU)gEj}7>Djt|%!KHnNajO%@zprFYPS-4uH&allqgUa-hnlJn)fcVLACS} zx){zyPNKTPu4HqU#_ZLt@^WT|od$=)YcK)LNOzPMphIG&*X|y-FI?x&hy4wfyw-Kb zccY#7kX?rXHENrqispw}+o=~l5vdurWZl=ZL!1jn20>Z#gBYN93Y@$kXX3j_n*VI| zneLMqbyJXI9s3gZA1s9y2IQl^S_<&@78Sl21ig(2V9|jkDM4G~eM20D1Y5+=9GCF9 z$;u1+$Gz>@6inJC$LvH0K7c165@gpLT*0*`2{h2NJcz}YTU{)kX`Jd&h*euM67woJ z=e4i@P$ZIow5`*5ENX_iz|^dUMgk)kRbgYGVulukSGN9bn)H6hcK^@HT`9p_V!(n% zBHmnXU;A|r*#R*-!>RyOu&qU;Koy3I6D4(+dJZ9K#!d>X7NZ6OHFD6zE{udn2Rvr} zH=Yt&)(}pH`E7aBY+xXO_L-ZivRD7&JgW}yM#l*-NC*VSm2T_6cU)2B@B&wg(m-Cz z1PwC%TyDo0sPpMj6f7Aab{{ zszsqkTcXGgyhei@^SS~Vqi`oq7;xtItfB^3iXMr;m#qD3I&qT_XVJ|I6F@`td(!tD zt?A^7Plz2I85RsO+?{>_0$?daBsm&m0om56Fo71bZ46>jLE3v>L(=PWTTM_W+(@R$ zii7FmnHXFWsnGZ{`ec1(d{p7$6Q!V+%(5O<<*#q;@s+IZsn?@DS7+~{78U@q!?qsOFOZL>=-IGh?;`t|2!elne&p)@6Z2y z{rhPnD7l6hF3YnD5QT(d!~2wGUwur3EKs2SyQ_`{?|UB{7gfkE9>;>v7DR(;UOdza zu=GUmR?oTRx^bIn!C&`fXKyGUtmK!6Z4-gl0+>nF4y1nPot2^G`Fmm&*w5}SC%Yh= zoTn@&7lz0K4K>nnYq4jaus5DFK@HyGfJrgW1FmFJbZ%}A;2o36E)HlR^k-#!^|g0r z1*ib#D#eUZp}PlMLwws*XY;mRc%GybgrZ0gyy&%G_R(z4XJtKDcLvWMCL^B{(a7wfQ6^_%q8_n~ zeQNX#!M2M6=SxBa3!tw&)01u*{N(phw+OhXGZ+wv*MIUM7e{MVuwH}uIR3jBv-PWI zGlb2YgbAY4AYfU#WS9dSjI4Br6u&{bXN0kMal>B5ZNk852T%;@9y3k<_xMC%N`dT> z&hhuZlB;VApr4zTljRE?bd$owTr;c+^KLl4i3=ADQ9}pATWajS#fFCpM^SNjq$K^0 zm;7)Z;NcgORc{z$*^jvgG#R|thM#;F03;Ue-+()OpyMz>yPJvQ**&=$zr;|Y~;}G{kvp+WtW59AFh8lqE)=wNxeB&$e>6Z zL1^ATORs%kt*Hjh}PI3`7^n9kZUJ*O$#8)YZtrp@u=^X}7NpnRx3q#(V^)R8P7W2TO!Y zczwqBc2HkR3;VOcF}AqA`yzqzIDATJ_dq|Wd${}Kxo5?Sr-Z#pgxGE3OXaw3c;0p} z;P4u+^+j+d@WET?5&%^jyck=EYIAYb6;=# z%3kZUq@9Ue%YUd$CX!6{{Did~qA>$JUm^|H(jMOl{vKVeMv2**~12%Hm zP4;6SX5~etA|s@lABZ;OJM_SZLBHHxc!iaOA)#Ab5{ydtKKH@%?EIAKvSVwm6X_tWcSh1RCB;`8@5}V zMXYk+kOiV@!Ib!5)P@s`Iu6j~ncE)}2aF&>#xQ~Lw92ZY1vK0y z{1?#`OsGb?{-;XQeElUrx*(8voEUI8Px5ZDuzj8FVI48^aiOIR&|=K=gZ`8jmCkvR z#7K^tbGeq{Rj~w8q3)ZDLAFos0lPwl+jKuo*3+g1FBwE4rws+uZK1-?GeJLJ-!ILb z11`6m<@-VW_9yS?{EuqF$HBQl(tV^Y8&YGeG1MJFj~xB}tI=adf%}--PSn>krRv0^ zV%X(x65%lBP`)qaR{&Y(BbfJtSN%C*w=?@XC^J>)>LY1>;$t_&1S9g|{%ts8_=Leo zq>zOFuez>BkhheCeJ8}D8?b|9+HDi`;}}u+j+tLihq}y2a>k78Ka1y_R|a#J?)RPy zN`W|~Gt6&gkh5lUG5n%PLidJq(Y4O77alWH9rVd~cvAY6=vc=DP$mmN>0kaC_V1Pa zVuJen^7`4Ey2Y(~onme#J7*;9wV^1JxQH$#@S~z3i@6j&ZiJZc#Vz%q8Oy$Xd=?b8 zMFz2LZMOxV|2;ZnIl7YE2- z7X3a42nEnpgTl|6#ApZ=Q4AUl0~`f@$?G>DZZ0aXH5hH&q5U@d`c=B*^#_LE2%vyw zfXy)^s8#2e66S@Qs#*Y|=Kf!#l4v*6cNR+6=zW(@4b_v)fxdEV!#V|sd2BNCH-yh% zy_#7^xjMzR1hFc4<)pAhhz!;UL|gi4W(xk zyDb>T1M|G4o+h3D-n{*xrKnIkPDj}mUVWt;vBOgAIttSB&6#MbPrRQkVTNo8cPSOR zXE6_$#NYV+m>NB%DFHK(+wTFyKlp=Tsz?c6u+c&EcUCf(b+D}4L|byP!41vn*wDcx z!S;uDUStXVu$HX@gwUo5-YQo8MTOy!sWzp#dERQPk*O9(rRyjtx$(n;O%ukQp{pY$ z&hs6yMb`(OCdL-~YK(`=4bYma^66$c0-4XEtBsNJe9FLMgYU*EII`?ji_W|Kc>!6I zX48bawxVVuFmGozY6KMPc5qM!>RdiX37g@sc0M6g{=0Wg=<-NsE|>>ppgk&>*k5&K!u*?LpG=~-XY9I;A{0yImr85}(ATrPqX2ss#P#GB&DVDi z6xVOi3-Q7X2rhsGNv&i|kubV|LvImgT`DkdH$jAm2tizy4Myw+$B#yCURfi*yU#IH8+ zTbB#d8QP2|SK)5(#t>=^?8g-BbAqJ4H5>FZomNk-{gc;Qiha(vm!Y)hh&v5KW!la( zpfk{61Tee=n=OpAcnhW{ER7-;hYD~vvKlh!5zIL;8(O7>|AV&Fh%;=74;wu zv{3_~gfdCDs&S0npBis*-krH^3+Tzii7*Ixv859^KfNPXv-E8~-<&8K83^rVQUB4Ev{8uV% zUVrBHIvGUqXrlEX4k1>=*PKx3vz6?!w>c)oTPT((0q8y2ExtBq$T_voqd~4RhHBth z@2+@e2)~w~MD9ytfmZU0phU%Cz$~p#zIpyy zinAHn)z;7>!S#ETz+}Codp_+qXPWAmrEVk`o<9KMI0s4X?yGdjf-U5U9~x38^xYH0 zyvxM_{lciA=D4RglBZPIOsg|2V8^dj4IDpF<$wJad(ijlWe`r150!S)?h`YMJ4ArO zc{?c^Mssq=hVYuuVu?Ud&ErDZmo){@j_qX0H+DjFpD2uu5o~J4Nl;YMCGgCvG&dT? z4?;x6Cp1VoLl09#MP+CFlBKf+85SQ|dWeH2xPhe>Lw0P2VpVj-9u-BI96Wr`RT%$~ zrPLDRD3DB3QXpwxUjVAjHs)AF0F#AM%Fc)b0B$BcPi5RQC{{~r5><}NP8&142G?O2 zVL;mjpMPI-NTUJ!Qc77NxMK71?CPCX&I%TduludU zgZI2Fd4GYvsS1A+5bxgC7_cXhTbiUB4sm{Gr}HOrGRHw9dT~fPL=%JQjhYOy1|KHB3WBzKEF#E}@$p&tODV?*^lxCTE z-|K%JWX0VsnNsf+Sys4D>(*)*-7b>}D|T4a44PTl@Cnl;yrKW9gh=8vFoH2F-FeaY zS#Lb-_h}e z0o0hAk3_9+QYx(E*YVL%xoY||{~*O&}SQN#su z>`HPz(1f7RLv6r#X0R-k{30sfuh~e$_}{h4*Sj@jvGr5{h(MGF177aq#?58NH$JXM zuF0C!3Z-N=@9%L6GL{uw!*r;T#f1MniAn7yyTJL^N4wL`b0NQ_Z_kC)*Z1tKjSu_{ zc}pSdHq&(?RPl-ie50c4mn0tG^EK%rOCBb#wP3Nm@VvYFJ{flb;rqL~+fukMw zioe1KjvM5NOGEjE8mn1=v#~Em9$LkKQ(B6W4mt1xgVuz+?d#ltIH1BOT`l_XL@|^5 zf!v$F$xG_UqV?CmZMgelO4nAk;3o~jC+^PzXm4#kq=rj?iwEuA-onFsL^(l5Yf~Jz zSYyaV%`&prElD(fn`T@k;klGk05{?v6Mx5g?J4NXCEX^@yN;>+8o6@+)BoM_D1pmd zOGsJxmvDNa^%|mN%UMuzfj1j=;2Y+{mrT^f$k`#Vo=eUDEqv)dmv8w~x1;@muw5BI zdK{#Inb_dYkLlZMGPB1S4-j`rRX89{tlljwNVu0}Rpz)S9zwvb6kFO#pP~ox;{>qZBs{se&*4k6fdCWt=gnre-tnix`qoSs5`ZG-PMGPR(mg}z!ZzKex|^fDT~&gV8c$iFlV*m> z9nBBW@>QF2FDfboY}jps`ZZlz-xJecd=iau7$b3X)1+}0tX~%%N{0%R1)MGa3sU~S z`R29GMPLw-`^#MGlCef*1p7NRG%K`ZDeFPB%Aa4wCV%%?9?f0Uwrg#Yu+!q{#6>VitZS3mP}S1`y`<7vK%^hP;emLP zxpgFI(C_uvqw%H2%?FoG4x}DH443f=>+fobq(ZkATZoOVqS<*o0E**%n26L6*RYpn zq)+&o9j09NZ3xhY2B1Wc#a#Y2ZW|VIe?92es>wB$)4Xa9@7<`q^J`UuE&%`mgZT54 zOO^h9^ym@)S0K#l*7K=eL}kjjOT=-Ly}dt>3Y2gKCh-QNgHZDEL97~M{sO1Vu=Hr` z>~;(UgiprN?>QBD7v>Yq_pS3veS`cAn#O9%YI zV1~!D%jrof+Q%|nOdJVM3CC>~$ zb{5Jg$zw^^CJiuxl0uL&)~WZLz#l&ZuQ-JqGsBiioVO2IfiS28VZGks+i!^>VK06 zbsQ5Afty$*5t(2dVWdJNGZz`lK;pD~EY;a~qXG(B8@PXyU8fM`$xsqghyc&!hpNl_ zBt+G--W=jspy%9COme`y(NAK&os8%pN0U?ek(?^3w&RV2M4F&y4(aI?ay#L z52(%Ibq<|mjOWqnFnkU}0t9FQJq^uv70bF(mT~-3&=;i5HV4*nYoOFc1C8K29dn+p6IHqXx@6q+mG{Ka^B8o~TrK_x zjZy{*ijDMPP#6gC9V9EUbtxzTxR#XIH1+6Ua*l2AWpfq3T9HC7EV&SBrjrTfjiQAQ z-OZx@PLAIIL!XFuNlzhD^XLKbMX9YydiL%6_gGBlpQ+Nr!kcUZiKA2FZUY%g*Okk! zTdV_8;S!)2F>0t1kt{yINL(%cWbgb2N=oybpx$i8n+DUxQ8Ro^8X5DUMYO_PI?(A#9u zdR>IIBm17vR$C!?;*Fc*{u#J}ajqifFL&(nI3SB8frRI)qdJi2|CT$cxK5itDqls=GS}w9KWU}x(CV_(=S}q`Gl#W2rG>+w4%loOCXcT0#uYivA(4o4Ea9&RV(|j z2+_tx8i-Z4{A^%ubYZ*V=>xhHKef-x-sdDR0Yf@lT1@3#x;kxEOz@jym`v{zC zeu^s&RCO<{s^I9X4E^=|)?wl$c9)8#Rl!5$?y!SuZ0ToHl>Bx}<(Ss}%qhPtQXrhu zkIs>QY&7?Lwf*&-`LfJXo-juL1;M$0JWgKUMgSKi$``x)C7L4xWMgKNzm!vVey_VP z4qxq2C?&{Sw$b8HU81b{2O1uGAggFFQ7%utx9*_2obouN&Qzs;Pc>DS2~zu0%e!W#gKrIi<^R-D?nH^Bbd$p zsPq8^(8Kvqr}PO(M}M+;zDm_|!G${(wyE&jhMaJ6c_7y28y4nj|gtpL+Dsm6ri^ z|C}r%GEeA1K^7mfqZ0&#Re|tY@DViI0G{*R9h3=FOd3X5)NGbDpy@NDZv;hd4?*|+ zSz1B?J-93LrP5tqNsu<(YHQKi*yFhredU^{**uprm^JV-QojS(%?TA_0uxYIraY0Y zXCwS-OP=*>UEc(v_pjj>n={Kez&(}ejJ?9FFQ5~Vf49ms4(=G_f2uOTXoM5t_ds^) zc$bj~g{_8mTjU;x0Sj*L!XaV6FXs^d?M-dtkfkY5@R4GERYCg zh3?mZez$@j-Fv5itkX<2NlDrmQ8nDQsx5+ciGj7llfDP`uIz)XpETfqeGFKIh_u0g zP{Yh5mr1s4QU83SU25j*-ehGeadcdA;+CjWEO3wxb)Xht{}2!9R=@=#&^UU(LF&-* zqLj9lMCEZ-*$l#Fb}2-yNsovbg?ZgqJ~h@tlS1BNIT>Qa-<@YF>EhSA7VV0L^r?|N zce>(%Nib*zcm-gTYWUIB!hz*?fi3`uDrJF2sM4Q9g@eBc+Z%6m;qk{|R76GKmnf4D ztIKO?U^L*7QWR3QZi_`L5KF=cKcD}NCD=x7v-IN)WpWZ$1<1z1bk_H+=E;LZ!mzjMz zli5tlg>(em52@2sYJ)wv;NnEO(gA~uz1~TZUoFmmuS(432-1W&F^_gV3Aiv~qf!8= zM5|Iy=)H-9+ew~Y?b=B#;`Zhkse9V+Au!T#zjuvKCx3kiND*c8n}2d5L0`nVoN`4^ z9Pm7Lv);xR!obZm>S1W~iC-k`RtW?hVUhK#TRr64kq9FU50wZr++GL`Zd;LEpcddL zMdrVFUm**oCRy?y{lyc-IN|pg#bipKA2))a5elkUQPdR52C~Eb?{bjz1Sg4rdhLRU z?q5BTQRJpR&vRJ*f#$$83)YvZ+Q@(cT_O8rAT)SgkriUn*3!^(KamK(if}xV+h`*! zm#zfUXlUdvNp)cZ^J`{L5xP)DP&EOC816Y@F_d>L+GEe^MuQ!1JsFtr)Vesmt+|lG zLYTKl^@P~v26W-6l$h(56p8V<&yBW$)A|5LZi5S&Y2fUGG6N{EZTE#tFu9W_%t9%R zm%v~3q;Flx+AAjG{1vS!;q}Ath{&2pmK4@xSjY~qd=6eiQI}b z8;Ysnr10@f#&m#Sn;B>l4o5+mv1#aO;ehBe0Oj3sKb+;L$^D-?-gR1ojWQwTDh+ZZ zPopoN8&YF*a7phOmz%1^6kP%syRtM^4xtUO7&2_`Ve0QmO2zMXyPtgZw?VGE1B~^* zw_~#GUq}?gBtSj}I!@@af%U~lT8(4nme(P*%B|VJuY=3ur6xiwebiF)o@cLNz};N? z+MYavQvTJ6s2Mbq`NA%pQ$v?H-1+pf zZUEBY%J*w8Q-SE#2u{fXk}V2L4%yN>nLgsO+2&JK`&YJs!$S0)gK`Nk8tq&v;s_Jz zBZy$sV0gOvwNARQNf|_7al8#n4$ZV7M!W3`H^djZKrGb$>Z=h0%)IUWV!8xC&u5gq zvU91sv-@4^;?ADF<+)2%)ee!&DxuAwhc?jKPoY?AC*}}tq~aI@IT2isvxJgw!2{eq z27v$8xb*Hl#2Axd>$yw*h%NydwtZZdeupT% zs!~aD5xPUJb?%9VZo(A7Xbl_C*PVAe9+NNtij{xm6==2fVuc|o-KI$F@ZyIodC8G8 zW>0r&a0m)D{cC4P7*L*_+eb}-+s@qN*y;n0&hBoCwb*k{&);Fv*ajCqIylbl9!G&N zjB!B)0UU4kie`m+DaQ73A6DKd)fJZLkW~bj7v}rnV;8hOvL@Dfz(GEc1g9zsggX^M zU&VF}rd&r81OM)S4f!#k*Oi0wVgU9>VdcSy-l`Nf|D^-j$4x!pYP`vjWJ87>MDIv- z;jn>M$gYhVOy}DVCgZ&y^~mnI+qVCpdhWH4lC)25P<->(Z#k-0zViJ zxoPt=!x6G>Ak2iyV6eX6eL((LJ!Dq`v#X%g+Q$6hp9lV}TO_Ptg1c<{@8IfZGl8Fb z&9C!ti|(E2;NEY7JiI~>@X>L0XdQGxfU7%s(ir$#~E_Db}=3_#+NLA!3g zgQ~Qg~Woj>JA_QaE zo?h*J7TKw1yJS)KO9d!9Jo(C?8V4?LF`2~aSx);7DD{JG{jp4SqAU-5slhf-or+Ci zq)Qu&5qqXPTt$F7@Fwi7^NII=E+uCGtdHVdpu(UHss(h{VK?c{!llw;JnMDhl|s`R)pB2eA?ziX#EsR0Wy54`Bt}E1;h#3o zb>?CeZcVQ$z!i(?0*-y*E@~KSl=aGg%^AcqlhH%JWQJpDqJR4ukU~vz39&qy$2g`I zjOqbga!V%o7&y=)tjY14TLM!z-y1&QBgcZvNK$}w{9}N*K(ikh0yNG2P5x`~Wwxm= zll2sOzzjGkT8tNyhfBe|y#zU})wwDlzs?M=4-JtG`%s9pgT?L&Pk}}lLPLw-aydEH z;>yMyp*jHdr{Zl7LWj0gLElQYQ2zo*#)`uJ{apru+D+Un;rwlx{&{??7YT#|F3@;M z|9xvo4(?NG_*DYFSppn?wd(xPeTR5D)J#I(yy;b)SLBawVz8v`6wfPCKYaL_S}-S~ ziO&E!{Xe%^$hyPKHy{-hW|gGDg0O>7OI!_FD()Y2Z_tnM&$H{uG41_9`Kwoxkv#n% zz&Je2{L6iADL-~l0wV<93H#_snUeem3ccOZMq^qQ&^2G_^r~ao>rIk|jPP+nte_3F zq&Ff*=K#=O`+A-C;50LLKKcUK9W45|1l&M~9BWMSVh!0DS_V1yO!fc+_|- z^YCY@O5rd!xZ#Cj08BFAJ;|TH8a(7AQSvL0R*2^&m|+?5MBkaZhLN&0#}vn`mj}PJ zeS52Q>xKZ!*jp-~{AdAd7o^P5$|V(vt$&aNXrDKMh`c+FUTEtTM*My7 zrv~p_$MsF_(mBk|i+8w~PSBt@-s^$T6V=&WEde}$Cuvu00z1zzOYrP4vwF3`#(eew z6o{I=J*B7t)A~jxXsHgep?h6_iXN;Q#4-xH+YZnMiPFW7NY#}guU~hpfo9RXIl$YE zEN0Fj!rZIfNQQ?#l^ZpqI9;=^;QXHHkVP<3@;hIBCpEWb8k8QsS6rFnAj6V9_5x&u z=G0E%W1Bcnd$Mt=L{1bRY+M8lh?a_5{VlTr3lzsgR$((~6^bw&APx!{h4+NRx$Zas z-ed1;qK;DU(M=#2NsKLUGaI;50)7S2F}g3LzF z$d4FDklGON3L$80XP>C!w>f6%nNCP`p{j%ZODJ6jd>C9G@FLdFk)+9w8TC8g2yG8)|b-0BkidstEvYoe*-QD30SFXM1c$9R+WTm3}scO zO#v$Z4#r!7f_;mQkZaxulk(Ib*s_xmS6;$*9>}%V-ZTK|>?H*%Wd1^w3B5QO)`Y!e z&vmgo(Xu~M;)fED!#V>@S(3m8bU%OqDzknymhlU8hU_1ue(|i0gXH7>vZ!H^G6^a4 z!ynUOOkcjFDd*Ii(twiGi%0BWuGXoXmA*;$t@s_QZ#*=@d=D-+aj~7#eUgtWaH(ra zFwu8dyu{yXEL})CLfZvO#bhgVk))dnhUDn$F9g;1gIc@;m37~dl&*k*Ew zIJrx}>r`&G%1c~9fRdq9`Loe|uINxIu!5gg?1v7B76C=t9Vf$5Ij651XN#1M??p4h z#urpxoNd~u0Qdg*1Bpbe;NGunweFZtr@Zt7*QR*SB}Ym%&mv+8H?fXuCfZwIB%z71Qq0wR{@l?3 zQ1|A-=w1j}SbCDdF=zemI|_l@i6z)bjISH&*6KwReA!N*TQY1)s58eAav73lXd5)slDO`d0b*HBvZ3RHrRps&hn zCH3z9eEUo%#Y${|P3ZIIzC+3SGx5>;PuRibkGiOH?S7!~ttWGGzb0n+@_j{}$ES~D zFEl%s>*hiaCoh{_V)fRTDoQaA{Pq9Ub=F}~wcq-eQbGkO6;TF78k7d9kq!Zgp+iY& zDd`Y{k`4t#x`sw_5Ks^$rKFTlN*ZY-&)UB4_nhB3*Y)!cughVa*)#0DpSA9F-=7Ce zN%2=kiR>X+S2^)n*mh1qE_*+ID0E?G&X2phi;d``x6P#c?M>+oM)3`TKlGJ##RZ=B|Q!ZDgHS(dUQQ+R{6WGqP8475@A%4WR6zZ-t{@BK$cR_GL4w_!b4A--!IgavR~rs?OR_cYLF%M=cA>!)zAs( z+j`sAS+SiMOTL!xAx=5sF+ea@Ggczzth8USwlNMd3+I!&BndEsep0y3IB`#ZkGPeo zFzM{C*Det%Zhw9}A#qwsWtedmmLbjfm?sc`1kab+VtsF3EW zIhB!{q8w=>Z+CB>3VLuD@o!6?6=8}FVSS`Lj-p~wy<_g9b5a)1$>RD#RHp9U*g{Y% zgY(DWbA*{Xr($CoD?jmeVcP~&wJ8h-HOf6mLK10-WN0b+em{4QVT$&vzUu`u;(Zf) zE@c7qJCXKqRW<{dRU0`{m9T+R{fVh$jKU9;IZh{bOLpi$ObBlLg$){9N@kKj0tgo3 zv`Jfm;$vTsJygplDlGe><-EzL4W)KkrcZQ!(!y6tk?SuExoDmipKu&X=0sKm$9QwR z5K)h+yIy)|C5&`;23f*vs4}KB4dX9y_L~gxnojCb}^1%Q|Sj3d8%kPRMt~g!OkrZB0M;<(ndf9 zL6z;2cgZ-(lVVM3oh^DpEP6p|%0}Jqolzb5g!EEF#@_ae%?(*kbxz zVyuD*%sO6fFIP_pf-`oTs|!gGQ1@_FbLrnAo|Dh>k~{k+q@8rVZsM@GkpId2D-n$Z zWfa%NQhrHObi2_^(r31#=15V8u4~O>8NyND@XOy`Ah_y<2%;1inv?`p{M!t3aw5vv zcwgRLq9s*`v(h2`SXExY_+g-RD@id;%r44Dfm&qA|;#b5y# zkepn7O%+A%N2l@ICNUU~WYt{d7M%8q`8IQUm2iT-5~f%^t?;YBVK>akHuhEcO21aO zyg=XjFl4w)+B%eS(ab^ z09TkGL3K36v1!@~%w$>JAX8vFUs#y^bIW5DLM)aCyKCdA?{b3QBUrD^%iq9EkrJg( zTdA6IEAd@|DrBc7`8m0t9^C2RO5l6YgL-Q>!n*;5JI(6rqAwJzvwj%X*MN25$ue!4y&lWhXLOu-5MmfM5QJcorHSa*5V%!cPD$g zplF`H=0_k|Cpgi9X|e%zTYbQ-++2!XH^GUzp zdX!oM%m;{+M=kK8X>6d6=jJ5fB}Dy3w5_QKQSSHWdRMWwlB5couP-v95D$f4?hOAw z%h18y1cDnmW?Cee!7~^+t^uTeO5TpyY|mzWcAQuk6`HMq$2(+5*RS!k$AAV#+LSYm zILhPni(rW{*TYj^3NtOqdfL+`jUGo~lbKd2UVa0O)M`e)a_JMCGhCtB9Mll95#Kl%IDyTdwfVwBTdn z)Z3ooQ__r(?iYPMY`q4NFO#PGnGvgf9^i~tm(3}C{f&{pUBUBqi-5%E*XQ-Y%8Gu;FU?WGOo;nYI|`=cjIH;V3{K)1RhV!6)`$GK z%JI=*5!=M~gs%m0cgKFPz17mE1Ff0k`ZLW+7Q?&%V_`D!AK2o6R_DB$d=$Ah>HeK& zZ{MA`vx)pWDnw*KlCZq~QBjKB$?*;p6QHIzrLzx~CVm9?1WL>qSsdaNk|5xAQ4%iZOWy$ZEvX8?HM2srG6%%iP>VDNT{%))+B_HTlblj zM(GY1?TQiq!fWMQcR6WF3K^7=(!X}-IXE}>K}d@^ZJM#1e!K&hLoQ&vX#zv4kThB%1M&8m)KkUau;hy-%JM?tCM5y( zGP4{rqBDu^E2~gq(s!y>uCf22+fYsdiKk8712(pgaM7mJ@TOMLp>DCY24aqMq)CHqS9Fq8c*qn6 zL3=33LtM9>{G&dH;HfIw33`X_>zO{6?)~H)KQ+Z?ZG8s~rAl^_jho4#W35cw)eQRU zgzS~h)?8pGGnD33*tHe8-$Zz6&cxsYd+q%;sf?@76f61l(GNecuiB}%*o)J+spGNH z62xqs)*WZxhGZpk)+>mQSBL0)CT?AncBoj#SCsBBxMd9Q_C<+^asHFMM8$ofz}{wN zePe&D2ezU$o;`75_mfa3e& z93@h_B%1(Yanj&Os?t{O;_L}7YMyRd3a7NIUOz{E40?Ndw`!ut8LX{wIm#q$VX$-u zOIzhQPjd{I+7~m#hhjO|y;o{;Jt5`Eu^c+Zfx4T&kNMd%u{T(4$I}d%Oj?Io-$cR+ zLDH4M*e(qf9t@UBqmbAjf2wJZvxo=fd?TCa+7Fu(ILqi?Fx5&8oy+)PsY$n`K^`+2 z_idO^##8Zg82)6BULLibSB8f8hU%-U%!kv0owZqIH^u@$Yvks?u6et6Vt;(6HJGNa z?QZ?Hy#3hrTyJyhDMKX%O0IAoRCxdbETp}ACs2>>Gxd!_V-E-a;;!4Y6ym~~%j_jH zEno`;BLyUEW9mG@R$B|+i6OST%u}+~wn$FMc@-m`QYb`C5u~lFX3~*QcFvp>X}1qQ zyymk~jcOhSDHH38&0WO$&}oZKz2I9)YWIQ})q4c_b>&fu|E{$n`-b%kyy%W}YD;YT zzDQlesQem{{r4&X#Fcye#B@}X=+9=!&9h85ZqGH178wXFDizd7B#9DE&!pRI-5<~h zbFthjUWGB$EV78Z49k3yLL4|wB@pA*g z81sE$FqKs1M&a`}EJQLKx9Nioer0CmbA{u)V`yKp-WY+|RA`C+l7WTgP;8dbqmk?D zWfloCcp>yI;dpWJ(n^-p+Qr8^$49C47ZXHJ6p7)JvXg6+Dsju|E7#h$jAZ#Jkc9MM z_^^M1M?lERSdefz#L*xB{E%=-+l?%^*uv8qJdBln5K9+O$}aX&v9`w*gE+}sG`XK} ziRhyc_JR9pzMHk&iqKu%^L+$;_s)IKeMZ2KK^9?pt@X||Ixr$LlU zA#r%O@N)sNXdt(>=V%LsG9(aiAqo=XaZavYXB8)CIK}M<6xoMf=RxcB*mdfvqkOLXIpYrmDHjp{zYtVf}sm#aKFS*^0C@`Pk2WZho_Jwr$ zjFlnKBSw;0TQ1g&Vsj_EGRX!Ja>;dyiJ7f-oZTLmn%QV({Sw2b*rTskz4NR3S+q zzQzaB+_@h9kN(6~@SRgfiPhd~qste*aOHsMcqT?Cs9gRs%z)a+G}8&aP=_El>kNl| z56TP>E|utW-g<@@H0=72pivH(4`%_F8)@GuMxKS9xyWZZd{tWAd3U?I(H^;(8(d;) zcPjt7V_Q;h$u|;bP^zT%{fhsA(_09U=$2-coeVw&0!XCH7zj;q)E~CAjquu%$r1*G zgeio+Xw){paqUygfhnB>vDRbipv#Y5bvfj}YAh6lbyZt1v{S(^$88}$H%annEmBaZ zG4*gH*9S50H(B33pPF{9y+u|#D)so_m*8EIxi!zx3BHknCQlI+9&rd(MihD3f8#=B z{Vdw&jK!#~#5w7=EGA%gue1dA(8MO>%F!#V7jQYA^>iatWQuwBwNg1PNB|1q4%eHv zNEMbB89G?7SqF%=2=#R^O}{2_ zN0xZb+WrDj!DJyxMx}}wsqs%1GVSQt($*XRwHSo$f`F?vtywLIsScRtIw@0-uJuld zS4ue|;GKw;r1bb@J!?HRxF^Q^PGsMSM2IZVe6(1=nRl;G zRKSZ)4#rj$%)tA*Xgle(IGK)7g_|c?wW(TeK9C!DG7pNf#iBb$l6uS{4H1*b_M_=M zzH0*l;+V06Wk-Kozu!+7wAyBjhn##?QUgqRH_e&9*nHBk@!u*iNp$%l5)@_{lCAOE z3#iDFvtHrdnGoNf($tb#9Cy z%NzCH7^FT0L)=6Rc}Gmji_L8L0fL3XoGDp6w)*X8KP<}>j)zNVU-eZ}+tcD2Jd2i? zKdH25@i4sc%7Nv2Ouf@|X#(}Y%dt~xWHNu~)>-QN+-)k`^tt*Vp}JV~8{XV4MFt*} zoBySEn|0iV=NA&TJH){rbY)6XOwPP%UE$+Cc8>!*VhW?NOjtb*n(Dq?f2ao3&qV7s zvZ6xLg#_)b3%-I!{A={(5T*NmPCk8#C*QFhbRQo?MqhOXDw|ib^CA19 zJT*}PuzVcj2`oN_W@L*TNsCPE9uNtE7 zKc3Ivh5W=MLbJ)jQ7LI7oiKo%V?|XKd3^jn)1TYkasN+h5L{$7BOV7k!2R^ zU`b-KpX0~8w`rHxV$tZEcUM+1Qu`5iQQ3)rL#LRtk|T9M>b>lB&HSq~#_mXT7^cTx zuX)h;#8tip2BJkVmPn~thb|ommZnC_7D3#?B*?tC2ehM~J)+CqT zUN+AOBfefLecx(V%~wOK0!(!1o3Beee;J|U7FgZ~ zN21>bxoEnvo(Z6k&jOsgN-xBe4wrFX>$;JetNB9KAC|QCZ2NB&PP{K0`@9##wCMW~ z@y}o5;;?3Xd%QX00)Le}gKx#*c;_2&Q7s#Av+;m!l)SRLMifwQPLut)YC=kH-vO1G zX5z!oqP-$bimER=Vzi8$hIFH)q}DP!#tBQHpo-)0=of1pCmO2En*o$YA6w|-1Vn4A zU;C|~cMa#5!WgrlejbTA`7$JLMv%tnTn;fgT+pdPYxk{ZS@87Y++rX)MO_lG7j znc;Z%b7JQWW8a4H3EYF0XdYR$$C0-d@_INjtv=uf;!mc8V@!bdUdh-NH-@>se*E%^ zO)Ducd{jdNw9Fk+Vw&E=RMD9w5g4RxAP!g1waQ*MYkIzDFe?u@1PjFkKiH7H3Goo!`m;#+YljqLrKNQQ|qh(2Z^k>i0UX)bTN1$2gIxT=!GL))bWWVMX@_(u1zp#I5VhQ#IQFJ_n+Br8wm* z20+u5<-)i;Ih>k;t(6t!od^^CS;4j-cL|v->;+=+;gIH-%LDZ7%Q{3PZVvggsp zQBgYTYTI8#e$gl2R`S~pO>b={Usn+tGlxvRz_pjW`pblyPo*TOt@AqB-6P@5=%RJe zSQsu8w8##ryB9x<9Zr8U_^j9UC&oT8Z%U^rs#1%=`~z0e3LtBO-_s7>^?#cV%ud*W z;fAZ$O`Iu<^-n5~jV>YkTx*Z_=eL*Qf1o$MgwhZaF@5Bd*&;%GwNKW}x9+aJ;;aON z(YNG*jvI}mtoLHHUkCWnPdaa~ao;X2x-9yr;`ThUcS0fn4oaVBmRIwFQ%>h-#7R&* zTl1DN(RrP3n-8Uxf*l_Aje;8BvSofaH__Nw|LE%h|78PnJoS!tf@-Bas#6*y^?jcg z9!F@bvNK;0BWYUqob6J)c8U*Tmt z$9t0$vE$8rc-axYxW<6V7Sz@|LgK(h?f^F{JaSq%j=({W833LDi+=k8Q^#zT6&)|) zs86Vwrds948aVB5{v=srhe~{FoS+nbe0;Fed3I+E(31AcT~4r z>dEnEQa?a}tQ^uAvdw$OJEDI}T@W*{wr<#KGr~oaY^MG<1ykI30PU0A+;u zS+`TE^9%WF(U9ltK6=2ylRFhDInLUwp8fcV2D;CfK;}T4h)J2Kl3k<(=y$eS6S5;G z`$xrym{xgE`qBf=dazlC(GY)0zHRyEc)77kPo0NsYupD}b} zio2}r!047ZRw-BR2gtwLzVs9cKbXwVf~XvJ`1&+i=o?OCHJ@Y;6->%q`Lsshdd(!UKPyeHh)MR8H>U4H-R2LSnz-WBEFE|mQ#3;g;{dji! zToJTtv64o4e1;I2irQ%7TDT*V*IRFJ#C;E>Y5KXbN)}o9rl;&}%xItp* zHJ^J1e!R{zsn7`0|d8Tdz<>x#?9}ty|(b`CDL>SjkGQp0XY=(GDnTlXoBM5q*o>j{PS(fEb?; z)8up{Vz>u*Bd&-q?ZSz~agME$&Iw)~v%gX9f1hOj1kL#u`15y15b%L9ggROX_VE3S z-Tr@H>B`_u{JM7y9*ETzaiD^~5MHED9;FR{ZI7sbw|n^aC;xX-jenlc3fmlHF(xyF-ab`~g$U+<9|1i2e{uAG ze~P+;q@ntA`QPFV66PgQlnx zf$ZuutjD82m$@7ef_udra)suCj^p&lKVDo2ejjsP8F4b-IouOVB_`yaO<5c$u-dHG zZ}ju+yvApE7ayubez?TnF4Ao3Zb!aEBjZr;u}xl%>utYU3M03E*jT6^U_s>(ztTL2 z`5nhcD<1S_e7dK~h7!msFl$D9C&lm9l{P+7seLVDVE{ykAF;yiC195#7MeQ{Tt1|4 zk^pH04>@xOly zdMr^kMCJfh;cE^e@7|;1ktF^ohjtK0wBUy{A>qOVGmqcH<#6XEx6%4d%q;QaVPYiL zE^Fj%N)_;!{c4oW`NB}kFaKu;m?c6Dd%TboS^^{{@ISu;nsX2J@ze*iKtsA{L9zA? z+|qx;=ztZfSJ}qsaR4|=&kTZA{aCvxa-h?{hcFi67Q)`^*~uDqp8?z1C@wW3k=G*h z@I1fS*r2Kh!Q<1EyGw7oI}shq!V)J3JLxRy-cP>eW)p80&_1oXRHx%{dX+Is9>1kQ z$IYm~wNcn}eY)rv44biH8OklMFC83&&1Pin^)^7&qXKcRPH+IRkH%d91ba8xT;4@5s&p*@y#BDI`vqLss`HC7kx_& z(5`Do{|$e_t~J&O2xbEal*6liuyoqRrR>AtRRDw^$u1;F9es$nS|G2+gCyDgs?D#o zZ6tmi6~~7;!0WD$c|m44?lWLTMX|A+q6hv(+FisXc{06$2qaRW$BhL5%qP1@Zj`gyBKIA~E*bNNOSVDyC z*PwsN2`M8=X6NzI>T%NA)aUQ3QC0AvJq62}5!gT+xk-CNl1`(nkZSucm2tPQXUC{} zC8ClCKgm_VUWRCpFN%%G#W$mBCqp@w2r87hYd`9*W!E&qaBN$Y)y}JR8(|>AyAL$H zv;b#1v5z8p$7P^V$FCTJ`{cV*H&IF6u{kEXGwO1Cffdins5I`UQhShJ))uuk-4Zgm z!oQlZ=hK@ZOIx7Y2g;tk>^s;CWCKnfItzs~FfN)<-o1Yt7OF_G^EZLh*1A|Ei4F)%^~Wqdpwwvd53d+t$%LOxmF#Z+d8Lg+?Df z5dr&0;k-(F@Ee6nXpV-9?Vg}lhye+6T*}P==SaTWxwQsOe8%fpy5FJh>4M%uC^Ix? z{X;z*S10UJp>3yAbsObQxM{v!T(?sG%t^c;{nYKDGSeaUT9IO)wjDr1x@zba+cwUj z7w*P4NT~fvvI2H%wdWOm}LrKi=`T1mfr{OuMRy!LeK=&|~;m z7QPd%&?-1QxXMKYkEER#%U=Tt7SGK0>(=xZi{zgWjNsoAX)rYW%_l*)4p^D>(9?(hu&d>0Lsc zVVCrlwxaGJ7!26*DAc!PTH9o(Qc0fUw@+@$BmC?sLJhs(yMD+e{fM4x@-{H*rVC=BBq$fN6gIQB%@GoR$Y0{i)L$% zr997iKe(?e!6r0zcc8=%V{={tJ~^BpFOVH(h68yoBMYs2B}By2|FXlwHexhv%KEcIpv{Tb=@v)uV9`L`nY-!FIiF0o1v`B(hbG3tfESo(s!YU{Q{Rp|8MM~_o(z|pXJN`QB#6%d#8nAuk1m_Mq?FaGVLt%c)h-WjThEELw z9xwGhiowL*vDv;zNHOP??Uy$zy5*ZX=+?C_y)JtSpOBbh_X3^?S|TT&lo1{9-kWIF zQ?;W!YZ153Iv^Y|zveM5tI{9$xpd{m)tv_zqao|>RbQ*@*+Z`isKo9(KiwRKEAIG^ zg~ig#jT^*QQ=#BB3Wyr~ez_bUDef0c%z45)pnl&V`m)ivFVSA^gY}=-5yQHf)DUz! z(Tn7Xjm;6_!BIRtPl0Z#zKe%E8y#>09-1T`CZNpK(N_BVFXUm=yMPmv4bMpbeF8j0 zA&)*0($B$h{h$AWJYtMKK{6pl^q*HDrU<@<3ivo5A5Zz;|Bd*@ZvqjI#Jb((3cVBX OM^RQ)rdaA;;C}(7vyiy} diff --git a/ui/img_userProgress.png b/ui/img_userProgress.png index f55ef42da4e1982da016e53774289bffc45f4f69..d307f4fd4cbf832240e1a32c223b085dc8a0ecb4 100644 GIT binary patch literal 27230 zcmc$`cUV*1yDf?Wil7uhibxSbkSa)T5$Pfzy@N`V-g}9lNCyD{r9}Zjy7bva>wRp*J+Bser2^CEXB$uTAXy zLFKi*`frJb*JLXC4UIO$`o9aP3H>94oyp9I@6bRao}^aXXJAdVW=;LZ&{5~&$7zvx zuyk=z!53~3onaB}WqV#@go?U1xKOFwSL@;ExK;ULi1+#E+DOiF&)1m5L_Jm2IcMQ` zE~ASPEh9ykcyf?F=h*S?Jlq@E8wt4(Y?NsmA4rqc%GZ~d67$>_yjU4X$F>s78CgS~ z_&0v@#l zujq0La3 zdc3QUlPJ@#+-?0Aobuqdva|2f$YD#X@G8z*LW!=uN0Awmhe~T`7@rjnCqTr}C}e18 zsFBxZsgTo>=w8PIK0ZGFL`5`L^$aZ@&a|!DT)1oX%%Y>sbVXE9lG5@G9i6=3yx4u? zLVCPwZNy5%IP#VwiLs8Sh_)4$yE|X$(j?!uXn@guK(#!?yJ{Q;a}Saulg@W_oy$T$ zZaY3nr)N+ht6YP4LivS5WKvmfE1%15i=xuyh;bB$jyoe~VJ8!<`*Xj?DWkpZ2x&!s zvUKgX)7cej%Y@(M^F_JW!(p+pckbe56%>v1GLnSQ`gPm{`lP2_{=HV=ncR1_|D;!-FkVgVF5i}DhoL|`PNjqvfXq&6e=Nc#h87! zZPW%2*frKuy*LxZY_;3AMvmtB@q8qh`hvPsO9uxqx6;zmrKP1-WBCW}qM;OAw4&~h zNtk9Y55p>C)Tw|uc0HPJkAxmhnA=sYK7{qVb#s&xN3n!FG3#-k4;QelKwQfl60#ir zNzR9HBCMzEVKB7_21@bv+WdS%r)lHP&Q6C)ebft)c~(eRVNz03b~Y=pCa`$>LR%vv zBQn}FbQBB^>qUH)`=lNl-~DXDI=Z2kDJZxD z@!6ko*C|y%>*RHqP*SwfA`|T#JMag=Bvtwj1<@8AUq<<&DJG41CR&CfT_%+!CR*tz zGU-7|u3cdF-O=egML1tm<)Rt6qvBC3Ib9v%hT`nGn!%T@&<$K+nw?eBwK_dJEa&1L z9xDmbZ&e9I)E#Y~a~_X2n#ApYTFb-9=MgJ$~yZtUH7nvRKHXfFs!|_BlChWD{vHfBlwslbv;hq6KlqU(F-|?)&KkP3sBi}}-&iev|9>qBm_=ee&4}*>DT*%` zH28Qv+VfKfhYU!3=?)Jnc znF;u~&626}jWaPsjZBq{VE`QS5Rb8&(JMS+-aO=4w3NTK^F0Wu^lj`TgF~;3UB6=I_jk#e zDwpbmQ9Tj2trt>9vtHX}HdFi8_g9COzX#GXq$Z2F#eM$#IWCTn^6{&|bor3f7E2t= zLcIGKeb1pFH#Z5SiIssgBj1z7*;+5iZVRcWmxaaZ#zZj%yY{bFjs7BA74L)8H9$Nb zWs28V1uqqqLX*yD?QqO#u!t3+1I|YC^s1d#dEWk}ubvS%>-mCxop5+`^x9RwwY9aa znQ96$%&Wv|ObMEv$|4y^*xTPv2NG(?9kw_B1T%T1*wwKDqwU$+gQ=-f{9tF|_2OHZEFNfs=5K|N18}`16cXq(7k-%Op>Awc>eF)=lw3BN@Ea2adB~*1BvY5b?4M}HQZi@ z8_X&0sTmnRZ%PQ_Ua}Vqi&N>MOFrQb*G?Powa!GeD2)>`97^kvWlq7VZ>^z9zHrw{eI_QR#l^)VI28RTGwB%y zwYYb*p5)NR4D(Jc*YY`X87wR{ zbaiz#Fi8F+yCoe^6yDG?cBE> z-FTf&6qqZ_dr!XBk~x(|#PvhmXAr)Kaa70%2ndcgr!ob$;Pv(2zP;lnFD-PTzD#Pr z8qLgo~~xjRJ$oB333nbt>qLPZcI3#j(44w`|`50g^@i^ zwyV}T8E#8Ew1rWD4}G>OmqS8BWy9~@$sxIPpf|5k>`Aw;I88S@@Li98+%CrH6XB(y z5&IWCewnAG`w!{)@=xJ#i*YT4{aa2q9o`#fE zA68Uoh0gcj0@P!fKCG;J9M?Owd~y7e#PJ}z&++F%`JsYN+m7IMt4{;(>)Q6c&y15)w)9Oo57OKLPm^+GyDn1B}n-fbp{}vi=I>?KUa~bhP{&k~S-fd{7pkR?fe|xYj~a?MI+eDrC}8Fs{^p#|9|xs9#f?+1ZXG zFl;|80M#z?#>X$hvUo0i;NgFt?EV}r3@6Yq-#yuzm~e4%K_w-vEw3&JF}x8H;*1Z4 zA*Cq<(vm_fZ;`u?B6?teeZ|HE)nP9D7&$Dv2gsqen> z`@8K-)r{wQ9!TvE|BL)y^7C(8Nqz3vQd?ByxYYACO*Rsw_js?Pt@9RAW#Xvp>|(Rt zs)cBU=g*(Bva-gp>kOvKTrNZqQ)iRU`e>d(l`|FZ+fOsLbfEn3!@h25WmRrFlg-iv z00$C@l#QgVebb769(9BNU$w}8nZ8X;O~Hu!wN@j2r!p=n)u%& z*}wHF^xcdt5zbZHa*Y0oANQn69N}3d}<3b1A6>X4H&gl`x9oYQcA^}w4#+Uh# zF+C}T4wz$$o^Mdcs`Fi%XTTbo0jRzYDFk(_PF#3I>J``tVwsm?b}x;nQ-_@#gPq%( zM=q44YVJ_$ADGWQ0_922Wj3wbuF}tsj*i~j+dJE?M}JmRx(_l1dt`eW+78tAEFt`f z9J?|M!iW!~885y*lcEuJwx@F}H*41Iv@Q3#gxCP;lS%KMc+1ERbRg{AYYi8eSK%gBk^m(8syB=%&U8(p`a9EN5;@e5MS1)MeL!el&2r~l0Xqak8{}-_!ggz zsxgXYv`EOv&IZZhmo|Gs#%|1|FE3_}|I!8d=Jebb+gPs1{^;zSNc{K}Ox!0!8ODis zi*ykrM7Yn9!TI6E`56H|KBaN6z-@q)*f}{zr;av7qW3j_e8|p5Z76_IIQ<#Iy?Vv> zkSTvJ&CLwd0)2aFblk_mfr8zU5jpOd0n$nkgZ=|6Z5!oWur!(UToyzj`m##^CQ({N zU1O1%_FRt+AU^{?=dGt$*R zOdt(HS5{sgAE<2n={t%x4m`mxK@AkmI5IXy4LUF2dzA(AwSa$XAM}g_RnORJX@D{a z^R^kWb9UZ#xXeg!bn_{KHX^6V|7AscK$Dm_+1BoN`$(byFK?FVc}WB<9sbd=JIi!T z66I#IC@rA;gRyN9kUP*L^ZRXw96~QL$yp~?ePw61jsax?0N5F1e?c{MN_N0A; zFMr#i_%35GLofs8f1SJ*O4+k&_Lz*zE6pfncWFThaRgcU?-A~u-P-D>boft=f&bgF z@+pt-yDwzY-27NNaiBTI|B+aN_@=U)VA~h=?t~1G8n7|J-~pkqy&xt>Tm?a4HIN2V z=&F#N1j|M<=Ff7qQQDm#Sb=Tt8>En?vhcKl_ElXyGKN8dn9>;KU9o=V^_Y_P(lX?t z8)Ki;2YAsFKjy~*#-+grt|%XkxuW6_uzzzSFz23#zRQdWJYAa|)gqa+7#L)tv&2dZ z9E+k0)sjXb9K=knLI%<@Gp&4dMTl&>vS#k_D}JN?qsoy zGPebGgQOUuA`{(nSug8u0#JAVc}QFR{L)$}Us^BJ?kTMt7Fu!Ip@;&X`;GtvLh`pE zlxn28sknWY@Nc6F%gxkN?O(_`bv`>m_HVa{c!n#Zk~(}oMh(*z8=McgQ++@!pzj`C z7=;CiFmMvmnqOCZeFo+MMTMRNvtNg8!1D}oL`KE=3tJeQ| z<3>Hj@b=bh$bo$)#g<-~wN9nuB4}At&T8xG3WKt=rbd)u(8@tW!@M_v&vSpJ&gV=V z6e9|8?3HWTIjQ_*jtZa!k3H?;vJN@7K04f#8eaUYb`9kk)V#_o%pzBiVLbTL`O3{G zZ$zEd7-wkfn?mhp9DYx~RaI319O3_45ZfH!gpkymG{T>QWFl$LBcZ7I?410N$?=dp zfSz8sqYu!czRN}ocQgAuQ6alycW)D6H55GG3pl%@r7t11K2|_f`Z+$HEo2Y0O1G!V z3&43vAHL}5@8@D;TOa%pdhssbpgJx#)*^wtG>Y35ARhs^cT5l{pKQdG6n%?z!@120 zwRshvJpO183Quc(O!B8J*3IiszIW*smrd(7fB<$$iAaJ|f3_p%hWdMajt4S`-1kz> zB4XpwCw^2^cru_eB|h#XGJZkSd0CNui9mHYezv?Hr8RI?%o36n&TJ9QsKUn2ytqIA zoxS@jboJ-{MYA%L97h5)%R+9|GE+~%)J|sAwX{I5<0hRr3KXYgIIlr5D5b8ZMmkBg z;R-^9ef5kAwHoCOEUffVx5WAg-O_b(@q_(Zffu=1*aRi;z}=?oyMOU-$#4~%=^{g|h4+Y>Q}j`k76~S6!usPU z-J{J)bq_9_HtmE1%Be@vOms$hIf(Hn_tq3A{>T3MKYc-^#h|kY8j)uTU7*d2sbm5I z0?rOMhp3OX;YKfCHc*C6erb{emg+w?FXZ^=sgI3~BlKcmt~}AFXQ_XzH$j-=k8%pwR2fqI>M#buL9LZPUE#QRstob^wXnV0AA+oyfq=GAB;0nU z$U$wc;CK?P=QvT3qesT5NzIF^Z%Ni*9|m)Bc|a-BE+!&U{oi!{SyTE3!7c!3wI}!e zTaO0QY~KXvdYA5S8P_PlHvYv1>H2Fr4&QZzUS`WFd_Z8<{_Fu!U^$M4OMgT%+-4Rv zqm@`cg*wRJoDy-~QXekgwy5 zIBDL{$OyJ)ZY$g_7F9pz8c_}4YQsGMb`s~e>;-Sa=2Jiz#KP)$x07v9PhIM&h3zM( zAwp8STR?H~__hC=Qt$ecbsHm_3tQyUCfqwmo4vMAJZEgee8#b}7QAJvHV`>q7@j@v zm;Yt&M(!-As~ZQe`zB3|E848gfR%))#$I`pC#oNNyfuQmRHBn2HuUhH`+kJ3hsv(?(R-0 zWV5l!4>|7bao%${`4-B>Bm7ealOTE+-&BZ2U{@zVT9G|huxZbhMITKbyiGWrUy%2} z#f?;|6pOkJ7jm8MW{ZOj=9n`O)ghW<43FKld`1S|jm>v(5u4(sRf?Yd$!V4<@o+Ou zve3oKP}7_DMDzqE!zmBI(GiX>_($zv98#{4ZBXU za5GNdKcfV8=c`k&IrJtG#3yN_)Tqat&@%F3v5sp@%E)RDcnR4)vC=v+bihYLMP1tA z`kQ>#;|y^e2c;tU8#CdfN%i<;Ef&Ydh_n8n{k`>w$wQD;$%O;dYnpSz3)c*aVbljKFI zKdfkoyvxeEQd(D*5+v%9@(x0*{@#Vpg&HzTi7w#J8*gd8y@oOT$=uWnY0N3Ew~LMM z*FWs}^7zeM(5R?KdyEMG8RdGXkK4Un^;jr+H4#QT>vgQXTIkwdF7mzm#->O)*M|P_ zL3Y7B`XrifAmkq|z%re;p;PWdk;qV|CMaoE*cJ91KA4Q^DJ)X8d>F2!b@Wc0P_O%kjo`?63GXjOYs0U{epJ~{w4mAk3 zh4fv&Z6JxnAvH(8dS9=*C>4at7)bTrI!o~=`my>=sFE~V^3rOe@rI3G8Bz-6frz$OVC`SSmdu?N@G;; zt*?)zvSq?--P-6Ip49}S1-KWLr_$^qUqkPeZIqf8(*8apN_(J7mNU3Itdy*@nGT;h zJDy-B->^6lpY7r{&*uJIlNr*G7W9Bg>(0%ZSsA7Hk za}-Zip9Y0GwRwyHM;Zq|0m+YFVP%tf(F`~I|8%%Y&7fWw3LRuaj1J(@?nBeEGs3Lc zuXzbD*t_KE83lxB#y8i^!9Z~);b@fCXZ%EMOSH}_@>p5pch*Tx&PT1y@B*)9V_z70 zu8>0Dyud0@$jJNX?P8tSX6>v`sZzHC^NM)}h|8s_szqG7OZYSV-P8*Q?gtEl>bKT8 zdf^ABK^^Odr#0fRYD7M;8PA#&&q(+>(RqPkfLhFz)t9U6dM2U0x7YLEsE{S5!d=Ro zSjnXeSwl1mwK=5H;iGmdKRk|SlBVy;N7WeGX)0+B6BL%dPRk67Fsg{Gw0Y6yAB>H; z8^+G;4m73XZaQiIWU=k$caB@;jY}y$zKysKl<)pVsV9MnKiq0^i}6}zekeBJCI_!M z^gx8?vyLe|G14u1CI54A1D-UqSf#*KadpgoQOSKosWU}*dXPt$67RI8PFTxem`6C( zR>^}(QL4|iZ--}c>DMDoX^oMerp_z2ZC!7xXY#YN=QMbBbZa^}I(*DlpSazuf3SuY zKW`kW#I2+ve8h^ehfhCu5U$A$;}4)Tm2W2kBs6Zh*M`ib92Xy~OwI36b3&H`+@cB0 zR@oHV6=^7{^c*VQjP@4S8J>rd8VVFl)_9C8(ZDz4+D+~U?aWonYSc#tT@{B1UBM^8 z_4a!QdAXczr7MFzPL@45QLk49|G;2D{Iv_4nsOE#X?d++g|-`tUZm^>7~tQ!$$k&Bk^h#%CzsdzH*cd3aSU2m zM`Ps3$P zUwmThe8a>rVXIbjFImYU-Ne?JUDJogO@M2?0^1J1noJ4mdrAYXp5K{mmU4a;PrAR= zMRYmKcM-Ur{zJ5kI#tM35w4oGrXL0Dc|y9yuTMTYLEUWO_kBcMwt3G(R(H{5*)?k& zvkx{!O3klMRd^etOux{e$q*^AAy52a6`3z1 zOG1O0PC50}4}OZ~-BNd0yKiUx@gmxo@p`qr6ZgKFkpE08@bF&MDk{<25WY(jp}g>H z%&QLWq*@TOKlMno^(8TmTe3)=QyM9x^*6#3YR4 z%D$I-h|QYFq(Lh$l4mUXyE+GD)4nz&3H5y=e{qr?vA`0-Ag}7<<71VQE^Sm5?YjBc zyyaW94td;_$HbRr@^$Bp0oPo!UaFFxTvN$%MsJF!NFO$5-RT>KF0P(_uAXi8=j}7_ z?FjS-H&Gv17{O_JSs1A8z;30$-W%nm*p~SG-&BMuQ;Fx2SaM0PoI&;f>iMP-N|bj$ zKG;*JBU#V4I z^H8<1v1xgLBtY7E?UmIlpL^wIRw2-~a!$YM844};M~!ZbgpH}DymPe%VjdZnK&%coe4D+V^w2ECJ zs!ut1P#%dka8;NKH!0LPJuid#>cuT;Z;y3Q%SOvU>qUxOx1A(lBCtwiMbo@4 zsU*8UJ>vjWH4!%2PI`OU#%2_A3iJsZ-ADvDjl1agJVN;FPTSA^-+SRff#vgnFOxG* z)H)6iZ@Q$!u-x6<@#Xfl9Ky?4*P=dN)65xJM&iD2T%t=LDPli6_XV8+lk%w*4+Vbr_0QQ}QK| zXC*-79~w{G;&2=3!OOT~1w8-X`;CG5n{?d0wa!gXPZyip3`~?|-=wvX4(5NG8F4e9 znZ5lI`*WFbrTF1!YOnR;R1|=6Qx%~bWUeIBI55^xojl)qBeGW9ZCb?z`7+dk7;>Q_ zM?Hi8$tf2WYGb>I-73M%`aY#nG^2*bNhc8rW&JN7RQJIX)J!Ha_?b+ z08wxQ$`MO^S7Z)g*(Ax@lq3$w`5RV+q1R?Z7M^@e&%d1#^-B&j{yD>bit`t&w3I5{ zz!fkD*JYZkdUoFJbm#k&vSNg9f?cjDgK_Zj;cb_cn^;nqy6^Ylch%*tugrQ0G}cS9 z?j!l|aErT-o?!t*`{)$yWlu!t2q7W7s+XiLVf zyX!D@GU(5D3v}J z%FB%&DR3-Nl`D(eBsdlIQ_nvgQALq&VL5yd$C5+e1P!}=JdMroQ=X+W>h5RXY(2mT zD(u{q&uxz-L{P4horGAyjoCb}#1YreGu*CVxtrw|e$?jk`~XHICCY=c^_R79GQHM7 zOz99<_G;-me8xe7!q^zkhljh(x(pjiJ3KJ%{>|pBH5WT5ykAPO`gnL0ZT;md9qo0O zZm;w1_othd<&gG=vOeP_p~^JeP)R9cR4Rl?9_zSN0zvrc>i0<4SiPvbOFiiUxi_JN zu+({LaC0BO*GUBUSg_2lSzx?JcAQs5-!v<>(Zq4R?Ql~N+Dm(0W?0QESpQ=p(BU8g z>&sPqw|B#Mx1OKZa}nbCKR(?c4GX_cpH~u3K}tdmH62ESE58?~(uH$@<2&?btS!GL z(fuU)LE+M2dl>b;YEin!LD^jYp2ex_w;ajSZ}xT{9T#8-H=h6jsyjDY9MDX)YinWp zO!Vrdf#rY3Z#|;mjv4ODunrs=FRUVxN_w9NA3*SuC=(O)rbV&Ygnkeyqkw$t-I|vX$?!;RhITX!pr2Y zmL611*jpqo(GCoj%&*$nCJC+E9OR+z_)6m#gWYSjCT@~<1bTJM44aFsi1%B1L?bH# zS0%!I>!iQV*rfT^+C6E%WqX}#^2Nt16#FX+tr8mPPW`g9=sxo#jDsE2HtBZJ}>s@Zxq`jw)J&i=<)9&L#nL3Z&Q?8Vw-xhuguzvY%GeD z(Pr;n^GAfA-Z=XB6frA0ybjt)rPUFuNRww8UP}~l7Q}fbW4(rTX+I@hSIn;@ZNGLc z%-&Rw&A!$rj1|OGGc|Ui&Jg{fO{FqOSUd)UoW95(i&7=uU-l{5)skVqMI|2ka86g0 zSOR@NzF*}#4u!sQ=eDRPGu1FhdWO0b zt?gaW4Vl18DXUOVNN$7)k#UdZzm-bJFg;fNjR1F*9(FO&M(Op&x^AHGX<{q%JE`z{ z{`6R*Cr!%>IOG@c4~>Qr%-FYYfcT(D1hZhKr01Xmw8A5+JcwPV^<{fD&VduBLzCf&yrUm%(sWM6* z=)zRpUo{1iW2KXqYxIHWe$6ns#o0aa53P8SI9R09Ym*P^Tpg!i2rZ^m-J$D~2a9e( zIwia(Sv*?$4!9(FfG;&l!5}*>qx1siCa?xZr@0LYa;4~viFD}+7Uh#;g z+t=Vqa;&1L053vHCB5Qg0D4m&Ii$iMyuIMf@Vt|oH6m_FmiWWH#Cr+%v!P2qb=5qT zj5#17tbu;Pc04^EN0;(WOQ#egO@geHA7S~+BD!Xh`Wu0#?^r?r=VSpKi&PfktO?*A z-G9K|Xvhp`i6IVim3Hnu1Xt7F)8pm!C|iOpBEYV&z-*S3&jUWSXMEoR+wB3m{?+}- zjB~`$w8-)Vll2=9ml<3}8IeDn*;^82+1}%ebede0~&?Mx1BIP=l$OE7IH~fF6Mt%O8c3OL} z*r?ym<%%y)788anyRmgr5FjA<@H`l%f(`b+a$7Skl3m@b4Ar-+8}gB@@Lu*Ji(CSX2j2&94jBntZ2aOH8AMyH_t?z+<-!< zjQJC7x;&UO(wEaefKQl1-T)rau{8qFJH6=?! zfXy*BR=%PvyrkX4MK5ab8vaOz=rRXdqhiTJnTYYgJ{>bs)B=!eTHoC8aW#<{ zjvsQeD%CaB0Tfz!h{uo`jE#-0naJTZDGmqz90TC@J!|FLV{~1slQ9%kK-0^x0R6O+ zKr<;#&A9Ars;zzp?L5tTctQ5p>f@-XP1*{x9~Zt!zWy;mDOqQ`HAvqyw_~7Vf%Q{l zzq%FG)l~cI*A9qLBX-;W;;6>C8{;7sH}g z5=q=|wY(V@>p%IiQu`+!6feg+3JaTZT;~povalM=N0g+1e1(C5Qe=o;Kwxaqk;=;< z*IvK3ktr30LUnaL?{SC>Y0lySs2eu#yT79HmuEcJAm@jEhp_^=Y@^TOKKGfp z+kL{_-(JADX=rEbNJ(-TkF*v3l<)sL3E+f0Nc_ z%am=oLe`+Nf=|8~Y)t{)ZCy{lLuN%_S{Z*kpr#H!=lU*K?`SDCqBO9y7-)6MEf0Z( zOb*6JoT_7w<=!lqxkXlLsjMqJdz68czT#^$e$3V!$yk$Y5QD<~0yHPY4{NP&u|Bgk zZv}B*5-qFfslH;nas|tV768o^*g&CF6X5>8JNfd{kSO?$Q_HdDPwwD&JTZ;qBL43P zSMeA#Yd$)a&~@{xQjFQFxUDBWj12`>WI)YN-@4y<)D|LG9u}kfB=yCz{Y~2DH7wC) zjFccn50_W&pUz4xENR6xNGTE8OglZ~WJk&{|3WjWoS|D_%Iz>=oF^R^gP z{WA z=C2OhJRO$S4a0vZ(JMn)byd{CTS)$$(G5(M_mI?l_E`&)@8<_--e0bfE*Ec?j5}Un z*_aUvuTi%zvx1@WvrOL~3_79Sr&h4tva@EyB9`EqkfdPP{A^`a_Lwi-b@}xls+>q> zX3JR~WHOE&@zY{3K;Qf7rR(L*+gGuO0PJe9=_~y@uu{e`I`uiCJ4;4?^@fJXQ-;TL zgyAnUu)h!xjR}Pq17stk7|d^Sup1WsB2!8so;d_6G?Gpl>PhoW8vJx%v%q;B{bFAT z=l9aBwYafIW8|mi&Vt;);9tN-NUL_)NUTf}1oHG#Sk|6L$DizdTZR4< z-wq!gUwPcbOU=0RD9Uu^O2gAH^Mv7X)6LaTGW>#_R);YIDgZY(ae?>od zcmJ`*wbUT(;hWb@v4SKE#+vPvsi8j*NH+HhJhFaW*sTRpdgRLrNoPR@?59?gUN^Z- zXxy;gIXA0Qfv%(BvAq`x&`;koffff1VW3|DC!T+=8Ns#p7(HT~sWItoKW?+~DLzGv z+z8O4!nPVn{?SYU;s%Z%Mv@q3dTtQfmC2$q6}xW@hy)&4dQHYaJsJcj|p#3A-?3S(ts1MI@68QX$_f=J}MjQMqtp)By*0NEyQ z6gaLK-Gp=53*n_sJpWgP+S9g%oY2?*%2EKNJmtax;w}sobZQewv<}@cts~^wIrxg6 zjZHyABmcA*zOAJ(0Sm31)|~9{j{+>LZ_+o7`j{F6)PThAL%dOe zpdSwn*0&$~yDmP{2K6-DSD#%Q>17$c@+};c;8<9Xh!bevlMrLQ<88z&9C-bYGCHUq zjLqeeTJ`}1R5{NdDT#^ej+Iya-VGpt@~#J1Quvpp2+Z-HFX_^cK0c=b+kC)wFsJ(8 z)95t-7Lf2Y+8O5|#i2}P$jL%XIN=914Db2kWEl{a!C$g~mb)=t2(*{vKt!kQ?hN=u z7DE}er)xPf*PF7o0Vk_+Ifd=fBW_`0B_D8@LOiF>{(vmzM0DOejTlW$d_Agl<*DGo zq*Z~3Xv%s)JrJ-69sqhrsU7@+2zvZ}z|Y zFCYoaX=tRS{rQ|>0m!Z`T65Z0{TdL>f#DJUM&d9a$Ld*OIbL+F2EZu{d;}Du?GZGX zBS(gZhcWz9-1_Y7Y@i|IQw1HlT3Y@p7xOf*qD+@4Il2Rr(JsSi9 zN7z$RV`p?>)(2=O|3!>{?8nciVb&eTK|sMN>b&w25W{V24@LoNjr2cL*V2F6nIvS) z_<&+;+Mzv|86+S(@Y7JPI?4-cz(EH}Y%TZD42u|MWq_u2O5R3MF^8n{K>&eGr@|fq z2yHAOZ~9Zj3hFOT32B5)?B`V<=IIRbZWi~8pZ$4HbhtH>2!mlXv*=Z2Xb9hT`-P4u zySkHy5HSv)uUWad_aMHgmS9q@dX!_W=}?9u=IVe;o>JLsRa$bGRA}73M(Sj$vo)GG zRXS$q)kbA*Vmqap&i9BRl?Z~`fuhfh6crU!R0cjjQgd{2N~`Nyj5n&YM?4!+%#^os zYzwDecC38nmZ!N6vsurhi#a6anTE z)f2Ot-8Sme_h2&C&0#)=MctfJ_0alRRV^*8)8ah6a-}4}f%#pjnijAY1+|BhU`)H+ zT=hK*89$_Sk!jg$A8wEudMw5Q1sk1+t2Lr2pnTTT>M>;x%B)Pa%4>kFpvG~=Wh~FI zwyLCLAJE>R$B00?%0=>mF>1aqBoAb8uKGFK+7hJmJppD}joRx5^5(U@JutWPZQ($C zXlEu+s4+O>1S+3mm-W%f$w^RiV?>GI-X;r;Wj~e|#_E1e1+2C3dqR7_f5crk#%nx~ zX8kEN>j78plX(5Z1>mgSD0(T&6Y9*oj3E{R;-4DzLrY2+kXxxKi^Z1Zy)e{8Ist!< zdLU~E#O~kcZ5~r5J$~I3t7WL8tDDf6XB~TU!{{N0-=yKPg@~GIneEKv4~2M%_t$_z z4b*1$1ns{8Vb?z#MqUU6y1z2OrkVSjuIAqek5Jq4DFWX^L?E4^Q!gI^ougN3Ir69R zJrtP;&o!*owVMFE%Hb@v#970_H?6?Xn3a-_JDFiGfEuh;FXc+l&y|q7<;5j!_oRDsb7EFo(r{{w#XFKV;k6!Gs@R#%j+Gry_x%-(xvh>*dSeAhunnb#E{$u0{5VNR^oNCM4R`c}!P0^h3}! zfc&=8cpdQV6$NG%cHMcBKKvZ4g~~_sf}jUIUpG=T@&vNcn1_mYf!!IQPsadBjKOo| zdms>*WT3YJ;~w*Xg#2D5?Q0Pb{={B{JDiFV7B(+992eJLjq&Nt_ z>$E`D${D{7G_7=CI_KvmVP$0R$p0 zYx|goC2WGHAZTj1fG?Jl-Dn{cq#gE-V43fyg0OG^mJWOY^p(Zt{e;)vKbjp*H=&2T zzjjNv+BMJj4A~E%1K#N?qA3fcA!FYq0|m1bADur6(YPvo&b!PiRO6E3)F-qILfbIi zFW>W1;MAqgp_57&(XOMTBd_8V(3t?I@&M0G;AsPzSD@s*!20I_7)i_nyqf_OhF=67 z-VBwZK;Ewg(h;y&uB(GgAPgXvdJ9ubMzS?144hSfDI)jw@@w|GM(uQ;r;9)^?sImu zjqVfKe(~io0*I_ZV7pFYGg*@5wmrL?3w3LSQ`u*+R>Z+9i7KA;0u zQ&DN`&z`mDRR#8hv4Gt_{{H?TL;`KKzI`JuQ0ua=vnTPG;s<74Pp<}&u2m=V+mu#(Z|+t7l_rG%!Yrem)7k6FgaD5>E*DpQ+{-_-m=ho zZZR-U6(b`k$lCze06Q-O3pw1G#TlQIo}OM)gSt4|h5%-I5DRF?sN(<(1cXtZIjNIn zHi?Y#nJJ!@Lug$Plz~PqzxGg zi-=Bqdi$tAw{#6)w6EYHBOV?n8H$Pf=_Ek^eX1UKxH+}X0Uq)}Ms`ok^K;Ck|KQgj z;4}12GZ9HRfJy*g;q^DjGbeve;E*pZ*)pn{o0|hb0`vNjwll^57xJ zA%hBB0d)v~3VLkI1JR;PA#<{HKKlTB2;U>riIY@LOiavyX|+#HxU4Ef*scv{0qY&H zGdDNq(kWt$dhY~6+6tMN@edJ*QYJDzM(GszBxsrKA(2z1R+;7PYjU7WiEh!tjU6Rx zW%Wz&O#sIt1PNA{Yn13EJ>x$f@nez7BciMP90!m?j&n0$2Y{|d@zpG&=dji}zP z%Yn~cJ_AJp^*tB(wE-|;#VHL9FqTb8BC%l*tQmyu|1^M*xOU(f%(AaA2cD*LK<(k- z0jA^B#y5W_eiW6fQ@jKqnJ-{#gDP&3fU9N)Sl2|Um6oBQVZHA;K;^Uy_}AV8OgJFo zY+;dg5tyAF7axyws{B-9mZeo-2pksRAn4n&unY?TOV>d^t$&%oC6>Kz`dTY#CJ_kPXpQZdO47So%=#vUHM6pfyE~B+Xw@Rp=rFqXu{_6 z*sw*}a))`D^Lgeq&e41W5kia`rNcJz;iJ5HKnVe!uu@Xf-1GHG;4Nx?kXymu7^yc< zv|%#BgGf>Ecp(S~%)h5u#eeV#Rn^qg?C^2k77~;_kNQna)j@PFifCMQ{@8CAG!o^0 zHWv?8;}K>xu3xRB7`WO39^Gtevm3=Ib>j=EW%$)^C0rWA5qcuyo= z0T2t&R$|tuu$`6w=jsEQFiJuDKj1p2z#M3W98DViaRFWZ6lU*e#`;6(2_gb`89?kG zN3+>DISoPC0TLmg^JAtO?CY%1-2fhDgt3^J>V8pV51GxI9FSIQ%K=M1A4HOKP{D!L zJb3JoG$yfW&va_%y-@kdT%n&IZ|Io?FxU6j91LsVwz^{3zy^mn0Aj#OfcC#qpEGB~ zvQQfY7r589SZ&82P2Ct$jokN0Fmo7PD!5H8LysRmXNTW+)s0ObLcmDi6%O-NF6+YKGGk^bm%^?a#~{7{2@e;LB!Cqt zpK(oO?*?I@7V(i9l*8b;5!VRs{e)fcfM@_v{{;wSO9<4kv-!hm;A)4fnXt8Tpis4| z-Yf&=1D@ot(etFg20Yc|;1EEY$<0GBH_0*IlW#68gYh#l=)@@tucib1`)46W`C%$p zrHpFr;VqL2&5WO5udf`S6Hrw|fQUM2kqMgYK8W^k$oZ-=#w->(V*mh$xU8wSjeoi? z37+l*s)i5XG7+G_0!9t&&w^p-)6J;S1*tow%ftg9z10I3q%d^#<#w?6_%Q%?7R2i* zAq1W!RM)|TfN;Ue%8=TdD1hFEq7#LjG6p0Zq|l8kTh-hA!hkY^C3joAHwIJ!C7>ic z1!5qjIlHMobt+%*bd|oZPco~jCYO;wKjsCNoKKhmQ>H)u(msCzRs%$Dpr=Zneo~U0 z#e>2COEA-};E5zp+5pgN@7x~7{QA{5aPj^`0Xv|jmG4Kk{L|NI_~*_4VPX4U4dOdA ze73fo&mqGHyPo;}{itGkS%>$WSGy#naaCR$JB_`MymyX?Li1b;BC2%*R%gmYgZml_1dnNuaaz` z*h!K|lFXC_Q7dGYc@CK=lqnf2DN~Xu3L#U5D08NEB}2$m=3!@^GKEDr_o}_Gb6wy0 z&Nkc?fIU) z+sZE8U{kNXE7hW~94RIGWY|C6mDm_9pHyGPiryXeW2y*i z@0z;FB}R&aG@29=H0~R}s_i(Ueb zRGV+1qODKadyBMhoBTjrh##CROISXh|5|q}@$%ksYQ(k&%(>>+6?tj~_T- z3QYdjDmOGX_T^bKumdQIA38Jw>iChmVr|M^sp!;gt9-rrdhd*hakqU3)?c-Ljw$y% ze>iJLrc%n}Wg1GiAIn$IobiDNqJ>3DU|`*y-F$Nk2M9av|K9l*qOk z&*e)sDYxnt_xzlQ)3Jo*Ns7dzB=TJV>!9}7FyTNbpFz=s@g>eC()@^hd(KUIV#@-s z+?OnUCN?&2s9KhiEZ?0w_Z!%F%#GdYD!2R0ND}hyV*iKODb@Ajl?{fIHqG{vLECmR zFubzsIZ3>y$aU(*f)$Z?>+anTkRSZlm5n8LMTT`R_nK}fu&?}l5O+>hW>o+22Zw-w zy+c-GbxTVaDIp=@X5$E)e`c9Fcbuwk^R{09wmmM(xsURu&!MX=tp;BkX%C8TQh5j{ zkc1vLOnr2CxqLsyo$jiyzXI}>q5a~Rn3z%7jr`lU&q+&fna^p|ePscaM4z3V9mZ2& zbCL|~yu6oDe?vnYc*F_S0a(9t^GwLE|@oVF)!xSjYaLA zxohLA208&34&2q94m)-^WWljO=!dVy`Sa(eRDJ#Ypr7Dz3Eg>JuAGyXXLjO07xhL1 zqMPoVIpO#@o`{u|6_}JQlSn6yALr!aa&cK-W?g|aZ29q#iK(fny*(QXOC4`i-4LTR zKn0(mpabFwT3cpTmXfTjtb&5Ay?v_J9vYPXSi}fqM_h5=NvC`CiB~*3Pe0e-2}lG` zv}|}{ZEk+lyf%Dg7iVeH~l~H;_(xrEUZsH8~*yv~x;0shh0NY2; zV@>SsDwAl`NqcfjJ2c!tLkWKLXY8} z;sQgs7aVMuXQis76kJi^4LW$2%`5GSCQrn`z`(I%$H4Ev#1s^9usPkW>U23YN+cG` z#<++Yvya*Xo2E-DMn^}1hg@7;8Hm7X3-w}s@7}-99n1lRC@3fZry*Gl(G9YT$$1kjqiBaaKMBX?#$c>-NFc&r9i*X|+P9NL-p`+u3sAyhZUO0Vo zQxkiHd{R=RA!Z|1h=)Sp`|xT_p0tSY`}vc z`anKnNluRRm2G1;1H)USX-PQQ?GDN5)|TI>*vreyfttQa&Y03;g=gP0)}P$z zr?oR~V7A-$!TUg__~TcJNlmbB(AU?$>*q&X)Cu4bji?xFM(#uQU5D6C$KhyLI?%`1#$?W*Svmp{0wIdgVW)s=Ii1=s+F88&uyIPA8v(4wMy z?LxXnTwEN|P>E9K>-^pQRw^YW_mb8de`hs(*KsBdkY@gRDY_m#8KrPn0Q38Z0LSDJ zBek@%^LN;1Iu|}qOY5J#j$K^x+rgbR@#_nzK|w)iyX=Xmh^z5{DKx3hX#Ed^OCz(_ zQLeFffSP#u_}XH{Ke4Ib2P_CZJlAUDY-^jL$n`2`xiM|xEN40$pVPtd4G!_L(~9X{ zpQvJKw9_Sf^wA_r$;`YA!NcN4x$KyT0P5T0Dg#y~>O0hTh_3#`1l-BT_#mNJi_$w^ z?`|}%(cX;HFF4W`BhBE)!f@X8nhhIo?9*@LobK6YzhI(Bk5v@hnO(HW!Cx;6VP)Y} z?m>E~$Th#Xn4Otv#?!N~uuxff#v-UFw6v_O0vdR4@5Nzr4-XF)mqme+^DamS*NQ!0 z9s)GcS=YR2xF6WMwN=!tn%*BKE3)Gg6PN?F9ZWNq=kBjxJH7U{GECPx-*03@TCThO z_C2Y@p}HstPtr^06iiIm;~SwJmZYXynwgo&$W)=1Gm<@%m6e66fHv}^cSb!D(Jbjl zcejD*+?NlXoh3y@MUA{$0ul`j4Rs5UQqfwIMLo&NDkHlw+I|7M?`&zACwB*B{o*vO(!}Rad7A z=H|&!QBi013zoM8iO!0-D5)&mZ?LhMisN)kaaUSQo!T7vGX->q%H4vCIq-OqZ( z6O@&-Hk;vnyvS16gjV+Ul8(cQ#>V|MVTVHYp4ho(PbaFncjUg154KiT`12Qj|9}8J z=u@ygRZ~|NxLAsft7>tN)W68hIL=p)_qrh8{BeYpot*@P1t96ck&#y;f)I7Ceyu|E z3y6so=I1-(kzj^l+Iy3I8ENy%!~1Nbelo&?BYkvftT%IwxB$Wzsr@zEBh!r2MT2ys-_lbQrtS7|V z)xOBEkIs3ivxMQ+d78qbvm)mCv6WuDlZT2!X(*XzJirA7+ur=6RMg=;5;$T=>`G@i zY)aYK*ccf#baZ5?w$afwR#)r5NC&VNLLoe67pIV^(0*JKQ&CjxCPy6WsXT>umuAr! zoJSLQW@ZNJm=^}Vkv#+l_UXE0H6jrn4$v#TF62(jD2?8aJVz)f5*`A-K~YZQIsOh+ zB89z-;Lu2NahIa2OVhP2Jv~a29*V`UA0_jBJ#k_;!@D!uicM1!|6w>h9)zwv7OD=lib@5((v}VE8zq|2|wQ$wk z+I8~C`OGBg1NRc6)6As~9IB<2?|qiL=f%F0firP`dI%%aQv~{MOMvZlGT{^ z&WnHyqoIfp&CvWNvNd>gwMJE++e`cy z$jywR|I?U#!6|R&Zyn`7c2I5ZtQjKAG{5blBb0LM>FaNh8ol8MZ;vsRicaOjr&wwm zs%CD?C_KHMXSI1paOD`LYiSR=i_D}N4kVe*P%`4OhO$p0XZg8nb> z@ynv_|0anUFP1XkZ5Sq|rrNATxoE5`@Z-1i8^LFUX5$_O;o>o#2>C3n$AbGq?!K_3 zAjC=j5coMH_HRpb7gc|CJQ`2IbW(5^P6PWGJ&{jNTkbzKxwsyBr;%W%rr`T2vx_8v_^3Nlk(e6N4Y-z8`qh@v#Vx6InUq`p*QOT1XOiYF5b&>b)(=L8KJ0em<{^&a7 zNL3ue1cIxYS~FS`&(y3P92_oR&XiBS6eBDw3@8q5-72P`wwA;9lPK$s9VXE0F@ypG zXDv-lAc#QS;@sS;=)!<;0Q`a&*F_0fel`NB1+GPd9wSyR5R>rMYcc1~tG1#mB)QyA zPW!N*gtoqehy=Trm9<0cvX#|^jJ7v#-jw`y6N z4<67DkM#E&hstW8%a3UakfM~@L%vp`d+rdMy1OTbhZi$g_y1%iASQc)frKqk<)El= zgmMcDKQuoAu95p(h4v!OSwcaj_B4S< zw6m>V=zu6Zc<=xyQZ9@uA~JF((U+J&O!#DIlyG6@y0}EVB(%eQA=-w9SzTo0g4wbs zlHPG;5pFe#%5CO$b`1~d+@BK&24r{7%JAB{I&!a{o<0ZC5U|(%`}Z+G=Xpe1OAA^c zyxWpfQ@2u5LKm@p+-j3w@SyB(+>UUuv$5GDY(_RYl;!;X{X3k@ey7^ZRnz_GW$!P< zoRT8r$}X)6!0$`X#ug8t*esgm?t@M`&YN@YZ$E3nT%J0z4ETSWw+`jhLt?a-V*fWfM77IyySW^K{qL_#b3jM6x*U zkJ{1FWF?A>=j`YRjc93h_An1mqP1SS#!jMLZ)r^?S<5EVp&?A-w0CqAmz1QWrpCi; z7Al~mWW~#u%~e&y)u9K#DdCMjJ39*n;$s0gH2JGsPCBK9g{j}TQDVUVE&jG5*MunN z{2|IOn55C*X6)?8$HZ6xH7#vHPL9L1YcV30%23S;@)78tGj)-GUghRugsm35!I{B* zrvEI2Xekb6VKdn?XDTt*f+!Hm0v%iHtH6vE>!L@y`W8a}-hj^}WmM6No7K`qg@s?1 zm3cZm##TY2nqk<~&W@jvT4^_0h?Eqj|6J6`K%=sb65=c2qI?ng6#l=g{rwb*1cCs| zzQ%V<=8F4%Uh0?eB`^q+D)~SCk6`5g11QXFP*kUf7Vxckye7Y$oV2o3HqrRje*kx| B&0qik literal 50848 zcmeFZWl&sM)Gmw#cY+5El0cB)PUG$p+}+)wkr3S7-Ccvbd(hw>+})b5Gc#|!b7$t) z_wQESs#Dd}>9hCQdoO#|vsM!#FDr(ENPq|d0f8bRF02Rv0lg0a0T~Ss3%8yYDl0jWTa^r9Qh@pz zP*mtC+oDAeML!TIHs7mD*1g6Kw{-OC=&V{&1Wl1CX!V8HoA|=qH@<|s5{-0C^x^#D zy1>c>&lV9qRj``ATjKVoUgmcsXdFt19}E)1@)sItwkZ2vm_I*QAz!`oZ+I_9cSz7O z=AqznlBz$g)*>hWI>~Cwrg7nMad7#IDr&1WYEH*>a26d{Y1u5%$MC-6*F8QJ5c{Hi zK#MZMjRA0(lIoe?^DxYgbEI@ex)#!8aUWPB-(fZ$Pt|1Y;6A}u`YqkEg*}uv02gDu zbVe{{?>!*F#IamA*z+i&W~!6%lur7Wh7ZnB9_6W+-TKVHXs{Q_P&_rh! z6i6GXi|U9zPgkeB!xtjlo;?6KT__r8qT}4yCUeka(q@i)D+r1;gsls1j=8cCs`#2t zn3^`~$iKtaK$9~$TUnZD+)gCyg%?T5lC9T^e9EO(4arm-9faILWT&764J{onKdTsz z7gD5;YJB3p>)UJJmyA-rkisfzKDmi;`t@C!6IS5y;2!D6SRte2a9`;)3fq`oim+)6 z2fLZZcVUwTtBcoHd@NJ6+e86l&6%RQZ_mm-r>Clb*LOIUPciA{v{`O&UA?IF$utNXT+p>YKR!@+@kd zy3Oal^knQA(lF0{414i+rcDW1O>oZdoAw%|GeF6RX5rXXj-<(4Y-M8}WK-?{Z;vHY z+>_#ybo+?K7KSsW_=Q~-pVDHj>g#SFb!Hh(dG}f=-b4DSL(=Lq(#~9x;_f@Tnkx^A zt94k8Yuq(;cJf6h=nYG>?576t`5@P=x-3X7j%@ao!1DJE_pf-M6nhk3j z+Ih#}J&fM=w#il2u8HHe)O9DU-S9K6I)uF&X2a$;2nYa#gs_0J8{}~YoUhgw=ex<{ z>&3NtjT1?Y8yn3=O7+H1nl??i2Ja-zAf+*5(eDiyqhYqu1>w;R1(9HoQQ0W;43SSo zdsY)EHQT?Rw2w_p$gZEIb6=U5x|lYayZ&lld~Nu0Hr{%-dg*zR={d%(M8Nl6IbRm$WP>w=b0 z=i^*eadEMDzxQ<>NkJ6wdAnY}_uJ=fQPsQInaOaT{Lyun)(k5)!kfFhqgo%VlK9?D z(yU4LnEVzg!v>AvT?YkS-K^6?wjYQRFYP*K!f{758T|%1{{B#hCns|%?Nmzm@2}X? z#t*fZXJ(jFsE%kVVjj|@sc2|v^C~OpwLfP_8;6hSE~zUh2xMer#F^JtP7`DR-Q78z zU0r8boVe>8w8JMl>+6+o=6W~nRPQsab42%a6%_@Eqk;r;rWSLDMjk}>7??`0vjV#H zRPSXPg^msnn2HXlu-yO_xjsI^_^qs&L7 zkl{#z!KBU*!_b@QH^=9_nN>OzVSqZLOmM94ZCMNTCC@OzaEKttM-i>)tWNTrE51qc z92mNj)6pTmH@)ai@+7$f;xGWp&Dwyqo+w@Xt$>{%XTSqyLT6u!FZWXX zOTlE|5AJaE!W;UFrxz9=$cxKi2fqDcfY511hP`A_vS!YM1AtwxHSkap#TsY>?6hLGx*65|yy=w{GiBZ4MK14_EZpbS^7(y?_%8+!OMEiYa{-D25qL=| z0NoBR&f)cky)3!A6-TsHx9tcE6K_2|(h0#^k#T906|5*J|Bya&eDBAZta+DVGn&)f zErZ!?lxn;hP-kSh;3TSbYpA7xD z_Y`=rhpz%)xxD*Q*>deC+>c9hy66ro+^>Bv)X&TPEOHtzp_fcc`YXpL19qjM#=lp{=5V9f4g`(2oNHfcWR-5Ykl- zzi)8A?YaI$98yhJN*Kj+2~Ve9D~zzT+-RLgo#my7Z-TM;4BmTDh30pfZ5enBzxj9R1U0_a+L zuuG#|T_Vw`Mu}ZrVa(8ki)xGdjJy;aMS>mu#X+Q$7T2a%8%K!Pzs~@|Pm7e1&T`5T z5@rbkiu7OCA_W8_Z`!p2+rRb(0pAA?01Q_AYY2D}F7TYHD|M@=gPcdT+JOiOXHHzh zn|AWi5nK45gCii5Mn(EyU&HZ^UAVE|zK!lI8x5ZO;yl6dDPJ7eNp{2_`iK}BHoUNC zKJ+M65HY43evO@&@Po9qm&JmS>9wtmhbEml2v$QgB6NM~t`opeUP*=4>d9)sc==Lw zKbcXs#=jN05ZrzK{P2Qxe5zU*(anDagZOh>rKu{)zgzDYQr0)j2%lHnYAL%*x1qB; zIp~O#Npfl!r_mn)%yJe4l0$}&G2=hu`m>=DNf|F70{ZvTU-FiGK*orP4^1yy_8pdS5vKBM+LIX2p5g?cqK~{`WCG%EygM`_3-g162k+xF zE9cau7SGLh>ioHNX=n_}VC|X{Ep{}uM$ZlO4Eo%=Ai5`aLTO|IY5(DE zs_ZBH(b4l~cmEGjPm?$S$kBj)Uc>Kfh*1C1Xb8V+7}D$_(*V4G>N;5RLwJzz`}jf; z{{OZz04Xo{yMski*nip|_*o`V2q=#M`8?A9m{VL1{GA6|FywzMB^<-oH}muC2l)S( za~cc$T_%dbe=WrjyaiKa*8jJ?|Kq&>pY;BJC}&qJ-w5Dy;G2Qs@>N-*I(zM)aD{c{ z1}Bc-a@cn3a#ixAun(BBb4-Ts;vUmbxGGIHp9+1m=In;>%9ZA(hn~kx$lbqu^Dogb z2{#n|Wy>V;0QWqgmri5{uH=u3^S3l$>xREy?Aq)^KVLe(r((?l| zfGptF&%v(~jBW<@q4DdBY{P9oS|I#~o5iApfb`DIk4F6uTQP}-fVsy18dfgwujmNS z%LN;YT>RTIurr~s81LN)8il{8wgci4Yq!j>ih3Rhfr>&J5W zgoCuZi|?o;Tk~vl^FiKd0iX3_g6`t>-%RU z;LnMgHh%k8(=#Rgou@(Yt&&doAct2%6#)C=%ln?;jSbSk-pym)ucivMKORQ!zC2Fm z$nSspV05OOcZG}Jb#|x3h&M*uClPNoRx%~Qf-dnNqU?ePi;{4YCMWXWr^or*%}(eV zu%Q1-KmKnS_DQsO$IY1qyLC`1H_R<=RhB9(LfZYMrFc@AM&AKu$mmXHceXssuvTMu z2Qelj+`cm(s_@YErZ9B+<#SxWV4**J%C|0lLfla!wz!hup|_B)<>%}vL&{^50Ql#+ zZru?U?5jI=c+leZ$w-UVQf9|@7w(vG(YL5a zt(k^%6Pu(X%*9)QbCMKyl8hXxNH;{L@t(ZcB1oM!`5-?)shZ(CW+q@A=g9gQJM58i z0}B%{?&Ap1j!|Va+8VU-ocNAhDT`t#{sOvBh4P)@Y{Q+9I~KPFkM zrCwjQ5~u_46?7LNdw584x_oAVINh+9Fda&;$7o&wf{lShrZGpk8X*3cP`ZxE&!_cW zW9{fGqJ+QgFSfT+^t38K!#L&XaLy9`(~wL)`e9X+C&ZD%2w{|-u~ZI_!d$<_#SZ#6 zLb;YAWg3W0`J8*boUJxantcSq%<=!Xx`euWQG6l4+b z4_Dn~MOkfZjDg)O`jf{ruRN)OzR(MfaFEpu?+1B6Bh=i#y>K!s3}S|f$9h4+_3Z(q z#SzK}c1uf~9VM9*d(+9?Edf9l>vu*1#D99|W}&X`j!6a$on&s5twb=0ETX3-fd1!G zqca^O^ndeac3Cq&iAJV{80_rX(mrY_3-j_0 zs6d021&grab3%fG+!s*(8FzcSo)M^LN=re2H-o-?Bi)HNe1gBKE#0F9$!sXQBPx6% zOHyk1#6^kYUFLOrQ4m)61h6>&D-SVRpdcA9_<16e)Xrs+?C%;a#jDKXE@3H&U*67) zgvLrNFs~xSY#Gb}QDFlPV)qZ-Wa0N)$U{f|nZH56hf8Ho;%1AXW>V?)Y>32p`nI(D zw73b(HSO&gK!NkzEftZpf2s&z4`$8mP#klj;qcV@s4!EY^VU(-nk;*=bTneX{~yx# z<%6%kF4AfFII6F~Te5wvaFtT_2Ie}&Ff9GwL1G%c`d7+yAG-RLNl`Huw`RsI8vy2C ziVvWI|3t?is~(OQmZqx}%|yR|CJ30kp$)(NCra=|MM&4x7C@4WePd7Pnb~Y15mCEe z*-JC&mY~<~J%Eu1@pl#AMZcdfgWC_B8GnmU&Sh(Z?+u!E6kn+(2OpbJkZ+30imh6Q zFTo?vEZ@faR?aA#BbhNNx5cDD1zdHpvK3Nwca2<1WS`7VL87a(^EF7%4a|FvH`j|J|~Uvbv}lbfm5j zwex5ct-k;0)M?kBwSV^;Vfk5M_+sB##fUZk@9VRbpaOCjPpnTuTX{9Q>&B3z5S=xa zLsX7x?%D%D?t?ZSc_jfo$EMaY#vi>8My?h!uvW@t!buguA~o{=y&HK^{QsR!4;?BK z5KYYMl*$9rYa5_$S*@>eLDgogBKH{!=6-d1cn~dTJ4A*eWekG{^n2rITe192Is@;| zMGeJb?J5g^ai*E82!gFH?==6=1iyp#jMmKilYCE~ctQ8uJ1(u}7hC<;erR64hlhvC zG9+H-0v@N$dqYPz)8p*x(!cqWxeE};=kX5s>dNJD{bA9Ht>vh))oiuJd3&G)<{s{E zN};!ez|st-_zNGOAomvtlBPB(KYUQ&&llHGGtx2dYiny?pV$J^z^@?o*zkkf_eY}7 zemd*aowIqmJ-I$CtD1K0xFUK4-F3=M^1t%5-!56w$bP+|luDfHMdO#wdYmoVN7B8A zdUyfZZ%=eA4nh9y{iN7_JaHfA^qt3eM75UU&>{cujg0zGGvwK57r}?^cWY9{#>S-^ z1yV`VpqHn)4*2Z_Ek_hEhanFpJ+-}W=B|5?82YwtT2I)RE=GM`9&cDoC*Cc!x}G)J z(?Ej$4_$JB3X@bK45&*TSJu>GJlQ1^`g5n?*X3^MfGO3>qQG^~?e}{3E0deL_V$cM ztHoTAk7PdU9o`g&C*69{p`oF%TOJ-B1K~56z$4A|+<^g62ab2wUlx2cxXX{M!6awO z!!}g_wkV1sFw9uPCN2DZv>$0REI55RE`}V~Dv;c9Ib*uw@o`v^1`lYFu z8ZSpx)pWt1b5eNWldgCIrP3XKW>!{}v1wC9OlK#QW=FSd(Tv?n10rEYrx!4=Q`&;y z^9~}gb=3y`d4}G6nCm)8*Cz$cUW23{_m7UGJjj9pCsz+il1&5Kcn-SKd|!|pG>;U7xdFG>Id-k4p?@xms?4n z)6|p<3;Rt>&sf)FS&TTT9xEiy3Dc%&^V>e^tLO2-xBHGv*PU&O3?uw(MvEy}wQx0{ zJLd?rg%Rk|pT*)Ou-yqAoKH0Gfr%g3;_&BZf{f0#C*xc6JK${xF_R}MC~mv6x=Y{^ z7e&alU+xrG!)!E*FZ{mqb@y@j*qRibG29ok^YV+MRG;epbs5QaCgzlH zNnS}7*sO2;yd*amIi%O4TmL-*y-)@Kyd0)J7~}_i1~Zf1%D8oF^bo@Gw$|1Wb!O(~ z3WJD9NOR%M#a)&?ZTV%TrMWd*Tlo6_V}i({UATyGfhvJ?JU_qv;RL}Br7oijsYr8Q zNv=aQC)uUDvQXAT@6P^l-4z@*M!zKqPEyIvObeOW*c96OT%|cp^4=9M+S@l!0Wlk` zmqp3jTwPpZ;r9&sy^rQAE}DXfJ;WoZPJY%1jniB9w5KQ0%VvZF{|ca8q%en`yw`CV zaQoD)QBzT_Bn76C?9+Nvc%ya5{&;gRf4Fr~Iu+#G_5Cz9YjW^1IwnQhZxS_aauR62lsb_-P6h4PWxae_^?5q6V0$@j zJ&PnHC8VVLi@5wW zQZlkmcQZGmdqUz-O5LdNMv+|)tk}wj)e5eme#evrffognDP=KylK#GxQAfTSf8w;A z4}OkriLEIMIn=NU?zV(@`3ruYf>JrGYE~ZLiTRHcj%3rb?gActl zUhfcG3S)eiakCc)mPbiPko+JMI@LHh}o$2Ov4&W1R38c)LoIUy!Y*L z!o=HnI{hJ3G@Q0!4PfD1g7b1ZDh-slJ9SFrR&t-KBh922e+P5zcayjJ>iD(1)7|yb*(DlRDOeWEYz7GBrC2RhPZlv1*I!dklrU z@0CjuFB+tKZv41W(AW;kHehZ9V%pr*cg^LM%~&JFDo%`fNScfPG2S0`(3fITt8uxX zqFpphf;=PMf9G@g10+b2fQzDAtT!YLT_pVxWjw`Awa&F8#cMe36f2wafdU+2Dp1ZP zeJ7CZQh63bGGfd@t&z@3X#v`hm#+Muudf(q%1qelQZ>`v+*Z7SoM?jfI$(+?((}}b zV*et!7|7@>+io?Y-_~JN_)t`NFdKzhOJ~9k4CpNxd@Rhg|2DzG1!SN#b8`#-U?hK* zD!RwtRYiNi4=3j1#O(Ac+n8*A5x}=77(@J5fHxt84C9QV3C&R6ul=~mqy6OVw?kY% zXHXcZ!qXBzE#o5$uY(nwe{O zhU0kli*2wUz@SvmI<Zf|6mcC; z%aM?x5%z_lW-cBqp@bbIj!Rvyyq!e>`;Q=m@Y6Rtc7{J#{_+&b=1>OC-f&2Jr^$Ae z39cJX+<^gs^&SG8A(AJJS2$CdaVMYP-wc^E&s?S|YV_M124ZHqC-Hw>l*z6z_0{2> z#atNs;INp$CSrVXjrS0}=)lcTQA|Hxq&g3U;iv7-$q-dKiYOX5c-tQz^b|}55~5B>7?L77d8ERf%oDc63)(QU~W9KHZoM|ZA4tr;eXjYfo-v$F&J^J z7MZO>o=+xh7{N>;K*!Wiq&`%4>>Utn39q#i}%MB6&yj{BuPD`?*l?}ZMUtR0r+o2x1=F*P`m+4qMqnR2$rmq+*$ zm1>cZ_DGjb4TACrxmS!f@mt_0XB(W*s%cK_OSf;@3Ib)hOzlM^->a5f_S7s&b@kRQ z9{8IW^J+gEMe4Sdrh>X$F#AsZaE#mo-?2MXYXvflMI%*3XwTI3X5NfxHtmSTzMW$2nqhn;LOow(~r<|3?5cjS$oNU}{dIcw8d zo1XaY9=pgOZ?QU~e5k-tx1pchOl)9v8l2xPiQd5bo%)Y){LVfj@!tFy6vx=0n4n$P zVmS}xmgsF3GM8thy=~AY#ZimbaTLG1AkPQEfjEQKBn42gW2*Gwy(3ivBX)2$?4ZCiDokJC$ zqkjhtj>JUZB;RpQBbV~ebeD^gRCM!OUm%v061nfPyLB0VafK&Q<#p*B<6i!1IH+xO zbQI*T$}r#P>WV_g=W7J!qf1PMV%l;8L)~OL?~Nu6tqEa%%T=7hm)(;b<@m2Gz6%*0 zeL*&Nfc_}RxRYgFpq(cUSO3VKPbZJw-V!Hq&^vz;fE`Tu2m6;ps`5N#u) z&8c#3)v@M378%z6AdGaaLA2Y{Cr2^lfK~JU$L_6yy*{5x($A9esn3VA(55Z>yDt$t zzfzt;$>FqJCcHHIzLEE5EIYP=`!KYN7T@TQym6D4Wg#~5wUKZ}u-9~p4q+x&qQCljWc-J89$!8 zXMT4#S#5XS<wG_maVHvXg9pNzgsyA$ z-XIu2`aCV8*l%h{QRCbKLC<6!Pr`(g9cZ!E~-aCI-RH zCVDPdUC58e9UwE_KUM{Rg%4J_lbTc)kLs+~ZFZaveXFv7LR(s&_0!*%9wE52so1m# zktvS8Zrp+4h%T7n&Jp*EY>5Ur5BRRykEQK`mQr$yjhmeSKRrbzjIC8@$lKWs)9ont z&ze{W)0{;(`rg4RtG%0Km?T%R)Lxa;`e5jvJO{4(OdgI#4g9HiMxlV!70i~~9udhG zmHBg=y=61XCw&|;C`d5L(=}4MdEk%77Y|vig%rZP_I|mrq)v0(#F$_3iS9s{BMB0z zhL-GT+?W=Y+*o&1DUT9%OVVA2dkykE!Z!QAHAWnOEN!jznLU6q_X9eIC)5^Ib$mqG z&AIgB5UCB6;}6!2wo5Or?xRyN*c9w4nute>lyOyb2(ZyArB#g zVa&FKAEguiPxQ@aBHUR@kxjVYhpLCdb^4p~LcoevhpI7qn)aje*wtg6``$|JMUM$4 zLy@tfQC~{t`7Dm`@fv)bIj|ML=xL2>t#bagu{P%;4Ehj`ADyM;2jJJnAo%1o)nC7S zXWYZ~t|Cj>80I@lKv8q>029O39vwzj&XyfB{I4681bJI6m7 z9>yWrx17~G1+EE<=e8^2@tZ~$L$Aa)P1%ut!A&|1%n%uUk#$?!;;4?(hhhrznGuni zZ6|cDGkKpPFrmV~M((BCssEYC`mk_<&%W+gZYmR;3XYiRB>`h6TomjYoka$taiYxu-+4#ilp+UVSU^qXNeQ z`Hp)TJ?(~Rr9AgnI(VaS-?8UV;MpQ(-)K*2Aa-dpeNtGPj_pX{DCx4w@uXJIkRL0? zwFusNmz1XJc{mr;Z=r^ZLC~CTV+iuV`}&ek#WFhbVM-|Nom*`TaXf>o6~UNOiNX0> zWR=MtydXDa!yaVMXFV&iPh#)EWB22_9w`%?PGdQ(=J>eas9-nPY7_ClI(q9c%p$^E zi$gH)d$iFMW5MHv`<9Oif&DUGns4#z`8jzV&1_`oR2DwTtL6^U+WaIIa5;QckED+O0%G-0AafyUvzPV+5 z9n%T&)M#{waH084QcD9e8~EF_tDeIx0V9YRPW|pz!`-4QOcj4XN18uugpgNdld`b<}997>z$jX;nf8px`>A8y%WxqFb?BsU_CeHN&mSEXr)xGVyH$a|d`y5HL>LI^47GV3=e9Utw!DxYNq-P2Mpfj;TZO z>A2DhJd;OVR~?(`dmBYJ95C>M__q=F9CTg|u&%@4NV3Ch+Leso+f?^qKF{qjWQStd zLhs=BBYc}ad#7~z#r*@@fg6>f*|9<7XZV9Jg3MKR_GtJB5#Fx3lb2E9f1NBdUmaI}Bj` z#RdZIU?w!Vl29|v3IWF%RVq!TEV}B+K38UGOjasG^Mzk#6BTXcaNi6nST9^gTT{Hv z$dTirqG<=ixme#Z)Yf*$TL?hgG5H-8tlGoZzA1xkc-(Aqt1yL`A#p==1Ye`}$KGYM zxGd96%3uL8^-fS%oae#zLREoernCUq=%@H0?X@4T(~1)A-Ujt{ug{R4@XiUeL;Ea^ zNDW=T19ylW9J;{pvq!_Tio~1}t!gHbG}W_~soIoxc^#D~PJgHe9Gc>rhegcJodh1N z4qp_;rHTX7DczNY;;&Z#MnOKD=>l7-!*h3cACCt;=2ef2=`kI~crc;IND1XB>+)gK zYiF2AU}-qO#zO~`fCbf3;&i>#9)l}{)+yt{oMPo}RQt8Kqcw>97CmY=61C{DwZx_% z?9%ltr!6?htdD)B;gt?CQ&U8!a;!`v<(-yk)@QdU3d>pt(}n(lM~*wxv|-Au>;-{nKEvZ7g@F_M%yjelOw88EXn-d07T zPx{NODm8CU)Cq@#zGbxZ{ARCy=oCU$O8OhDtcojnNZ!Yh&n-J`7Ns;%ncvOq{b*b{ z_Dat1Q#$K4?$dfwI$w)qc^<|NHW((iNTTNAR&)#1)_aKX^ZDO#%CK8&3(F3UIU`}e zlKtWzICgdjD*{RNorSTfPKUKFzPhIbl6$ST638lE<;)ma5a$-HHq={<6KK>Ma3ZY@ z2k5OrGN4rd8u4{id*4rjs6hIzP&UhSDYK~LyN!h@4ameDHdiA}X_V5_RA%rct9|L} zsp#vX=0nsO<$KuomuILb=brSK{nmRGDeInX*HVJ)DDuW7bOc4cK+{v1^4@{N5=lS3 zN8J4ICCO@*`hrTPPOS>MjJIlvXFk{Gt=JUka9=-YIVa*UDX@&n_Q-rgUf!WHHS|j zq0Bv~!*$fDo;DqO!fI$iK|}qM`XV85vMe`0mMC{Qg-RMreJhu1qjlV!Nq8@NU$Y}0 z<7O8YD^2>wdEV=&Ys(z5X^Fdf-_RPlqRP2(oZ#S0h#@H$s7>&TuG5)z<&cp^zlZ5_ zE=fWuEJVD8`CeGERp*V|p7%)`@&T_92|E=7Q~g~cRX&?{EY)Y!-*6Ow13v`VvGml8 z`|4OS0Kssv=v|ya&kNMSu_&k_A9Ncp3tc;3yPG=2)y?+iUVm4#g@Ksi6WDW8g|&!e zW;=uP_)GgP(h)V+ln@dh-Qwh0(epd|niD?hp);JBy|w*w@(M4LLDOsi_AI{Kwg^ix-~~;>F;oapvCs7`0_D>kjLS6V~o%b5n~> zY8p@~I(S&;lWo=UN_l*GEUs=!p4V+lscbm`HvpI^Y#scB1Luv5knTm!B-ar%bNY2t zZ6nVLgEvlKC!Sa-YOT_tC}4F&01}r}(L$xIP}eH7z%DPNTFz0LJtNE~K7&}KQ%zMG zvYfGIL!3hk1Aws#%!aH5^Nl(7 z*B9KW2cDhxRSGn17mn4;NASUHuAY--y?$H27!=IdX_9@{<@g_decunH&MK^obRoD# z4quEXo2NQ&TD{KFeZ+ly_SXF}Dd}7grdmhU{bPnVznTB-+-rjrZAp{f&+Ii4;#Z=V z`=dLBnS+^;?=7m)$c4PO{QO07-VZu0$B&i`y+6U=+$gzgM5I7cbALZ2(`{I`HK9?5 zG0MvDXHGEn#1<;d^`~y!u#+!V$#PGTb%Yr>>}BaS{R%qFZWEUd4%HqBU$q<2UmjgM zvkg&hj=#~3(L-JqM{}Dktbk-&Y(5C~W`%rWh3fy^5z&PQ)7OM4$mEx`=E~0tnqnx< zD`5SY+gjkK5qVlrkXBXrMss~MaqWG*O-X`Etml5K>nrr?Z8zFfO9bvzTJpzs#5e$hF747$y!ZTvD+(7JjI;=EcbA(Ox^Z5`cv5jPi6#ieGK5xo zZg1d<%lo=*Mq(GNk04EwlU`rOPtFSCf>7h&53x`#kxzhEGF;9(AL!H@6vxX|z~#}> zvF>lzKiObjlg{d6$4v?dRMV2G_aZW`D}Zf59<426*jSs-9$Z`p>mU$w`Wb!8e(0$A zLyI#{s}2hd9V!?EkA3osuq-nZ(MEU>Qf(B$*x2P^!-THzKm)fgxCM@xU}b#I6?};( zA0Wx{3hnSb>y)=NoEiGS1?qjx4FX=lzw9hh4<}UFVn-+>4E|29)P=HZ$3#?#3s4Ky zzL&V()E;z*%angUf3bb}O8fwd8e)&u@FZpA00ilJ`AgrDFS+#+S)8mybv$TWm>*=w-w zWIl($hOLumo6><}qK>9=lhPaY(o5hZanTD;4*IV}823U3F4IaTnj{+U#z@{S<~?du zVk1wKl7;k0m8x44)sS@{0AZg=%4aQ9(&NaE8=HxNPC2o~Y&@3f(u2q8mEZeg0k{Vt z;RMhb1iA})m67AW{E$%l`256of$KERZ7U`1?+xBOGJ3RWOL9_{n>w_NRs}v805CbN za*6i1A0@{lG0FFc*TBM3tP!uGI<2Z2l-m1E3Un~hDXGcaIay>P*Kz6k8r5;1@iaU_ za|TZujQ~Z}VM}C7@?OdkSHulP&hEeqv0N=VBv;`ZBtme(tqhOH%LuVfP$uKd(bi%y z(wE6hW3H-G^PCsBql4jBchU;GO6@gx%_zR-6^5aAx6>=emgaX@Xg|hXy)%9qvm)*P zP;S+APgqjRP8N@DXnI;(k@>QQ4CzhY=D-_)9FE;mUT>g}z`(B`Hn5_X!kfehw8>eD zeBR5Uj-2j}>kSZK+PK}Sq+;Fn=`C=6A7{Gzz5Mg~#S?WQMY>d=@$E~BE`JZr1u+c` zU4a2ev*&31=~=b56|uOn(0`sjOKSRcX?!xSTsO;Xe_P$<;b}=bEALCzy6o%y$y4>Q zQSLdo2ifE!m{L@4I$!gHY}sP~rQV+Tgu%L<#NiOgX66dnp5>gwXfXy$&Udh{<+FqC z$tNSVN{s#J;K%U%c&efhNfu?P5v`nZ z1sv;4igrJ}+h6rRbW*6YJ^4caOC##+3(h=stZj1Ob^GLV=q>LZd_~)i22Gi|Fj1RL zQ$8b2P8O$2xXR76CzQk|A=m)m%QoEpP-gq_UeK#4tH}-SOU^B2y9>|92t{`s40-}v ztS9PAZ^sE%|$HhYuU*ZZ7bpa2-4obQC@=r zro~feNIEvJI#Y6toz<(r;R$ht4PQx5Qv}?aN7~9*c9ixeB9g0IRqAJU%}>gTs*-_} zlq0BL%QdsC(B+T~qGc0HwCrb4;&_P;!0^Qc11x9!j-MUf0*_M(3yPkObq+V5Yww54 z(_*7y!tsOvBoY{%rv894C59>JsMk~-KKo>^a`LyE#G1|u2&*2aqAg~_JR@b5=^+L& zrl{y23=K_A+sqHk5iW5sSsZQL!&9)nMfarO#@CO&+~oMRJ6 zg9toEj)+f}R*swDQFG!KsXOJY07I4lDb3COYuonGb`gGx;8M=ZMP%r_Pgxcw!)yO^KV~0raHelsqHQH9 zfal@!9HXfY>#F;mcD==mdtPm{z(YW9 z_+7vUU!*g<9<@8w%4nI?i1exzpPlBvjH4*`3-;Y*d6N$(l_$b#q9-Fm9w3Kx(H@Bh zw0-01m>m4{iRboeEP-pF6YGtU1V3J#9kBtKG*-N^ys}A*j1@j@s?JvnPWDvMQT|kF zq-BH$m}hdY!Re3sJjF0)F(()~s-CYS-18%6T48O5?u77r3T8vX0jK)3weKfMj=ooQ zCapc6$Q>}8wSCOA!gtLV-XLCJ=gNxFRTDo0-4B{wC4A|d%sPx5-Bq-_FZA$foGdFY z&Yr+HZL9^?vE#E)Kn9C1NBpZ5Fs>NK>R+QyuQEUBKNNAZf9O_+MWE<=^ZeD%Z{J)< zd4ze2mxq~dJvtu}HbFI`5*DqVM>+GtEB7LAQmGfK{;A;0e(UQqcI=)vjsApxf4yD* zNPLkbzeFM_;%hU~ubC7>>ixOB%qY~gd>+H&fYUV{;~|@qK-};QbTB~$4fE*vv_G2l z{FcbWGAdTAo_q)2_azK1!C{lW}$^2pA@kNjV5{;fO<_5O04+ zUxc|P68!x_P;4<&BWv}5w60&;B}mDctzSH5{zCcb^QP`sA7@nHkdYl=A`UhGF^+{t zEgKfa;6aL5gEQo5smtHWx(4#wfj=cP_O$-3Tu;l9Qv$E{gZRttqY2Y&7Ka3|_G0UE zSbR#Pb$RXGE{WF{?JMPwz|IwFKAm3E*=Q8dOurlJJ0vHI%q*w(K$S9zaQj#zI|0a0mIhb^Wj0Xq_Tr6XB{P zo!8GA9t*6rR4cFrxszwFDf=#LnS4UP7i!n)(K=?VN;!ibwDminGG9?_WxJ6=ENw#{ z3&Cq#P}Ee>+LI6KRWcs`5AOrV3O*pO%EEl!g{$wr#zKAV6x^MErQ{lVpRvI)6KzE2tC!rNf z!&gd0I5Z?65{{1aDimbnN?w1s{4!vj>C_~wefTg4l+VdSoNh3;7izicbC=o1Gy zWQ{tK9~yw$otcD2@7g@R^&CD-f0cKi_pX4Z{Ga~?ko)v3J>kQjmmU<~Jz2Kope>o@pdgzN)_$#W49ylM{zRb|I!7 zDR%atzsdTTF8oI0qL*%O)G>Fu#L-&0>og#@$5z=_C1X%6wU|ooT0J(haLj15*<~#% zD=(9m&{dd7vVtSya8DdmQmIfFiEtOPGU_;5KBBEOnVX=j#uwzFNl2|Nf;QO{G9K%k z##Zczf?Iu0e5+#crLR2rW6eY*6x!6j*!jO(m$bZ~zaJCs>Pr2CeyQ>x(SvM_D; ztLmj~quK=AsxgPrbtC@(-IkPO$T?Va;oy*o#(t9(BM86~V}CtVe09&$WsT%pGovX0 zAs{*`^*GET^$%)#!7|;$F=mUAZX4LrA1tj9pL? z($D~+uyLr7K`Q!lGiZn!>#Z*Ta4%|90yFnwNLbL2C@ZFcaY!_U23q>}$K;aQT>GUU z8>R)0&(^MDa72r(3>WfC-s*XG$F^YblU>C7S>$UAXpC2(U;QY2s6pY$f{>ttf2RW- zQuXWF&xW}AAD)7dV%u|PUs-;%amcPBrGJm7b-!2_$2J|-Jj_3pl1*|WDaKz&&Mv78 z)WSXS*|03HlcH2rlM zvW1)&$+@aY*B{h4Yc46z`bgJhFwRw8X%)KmUiKk;DNAKYz26g)ioa8fKC3Cz&%SM7 zxvbc=EjEh|y-l>*b#CGSeKwmNn4SkqX^@JhNX;krNK#Ia z1Iv%O92?@@{A-y6D5za@F%pOG^3X_uxW5hlEzbS+O?&x8ulGxL_VhRP*81?!V+?|Q z$Fd`;0PxQx(WjWb5`>){xcr@tEph1cZ<4GsBafYu29@E^2P}f&KQTf5Tv%XNtwren z|H%5vs5+LV(XiQg&>#VV26rd8ySqDt;KAL4ySoH;cZZPR?k>SKxWgOHm3O{#*Xkdv zHSC_6s_OEpHX|UC5hA1-AL^rH^T~z_eC&=zR(A*yVBuA83D2a5d@~W1b}KV;9&H~F zZ`*Ts?yK~%N)hR$I4a|E=gD z63P_i-rpiNig>=QXOnE5_NvQB#SF-^#n`H?!o^4q3ec7y7~%5DB)c{5;~4A7A!b#o zNG`tr`kXHNnTV-ag7JHrgD~+%(G6#0k=^Jc`iayo)|A@mi)rX(<2VA1a4>sR2=u=C z=b#lGA=BIB-L>-x-T9jR9sH~|G$gCSZ z5JA9u_ld`4t#N-L$U7hUg~zvhUh?tMbf|T`Z6vKId}hBELpVEuFBfXR^Xgof|GZ1U z;SWC|&R0Hhvv)b6ME+hlmD+`xvgqPGPPS7aB1K z62_d6=<^UiSK-<8zC^_3;FpU>k+8r3qh|_XC@)pL9fhHu9KrJo7-_9O+$V+*6k39W ziJr!A{X>bObcz@0)pry_pTJw~XU#UxTv}gOMUg#k+#NQ@4e}S5brDL`|ERZqM#SJ9 zv_^u-5v>x&8alf+xUU_AFS*@Yk?`}K$7y=(Nj<9(;f4*D=sHB081r&YmaV~qqMZg} z*f2Jl#jV&5HvwvCU_GaZnDn2FdRS=Wp(Wb@)T&9fXeW9L|1zHs3qU zJ|@2zA1(N}wcEYtAn;l3W%D9yX2zLTN9W3go3|;tvTrd$r%>>u^#+huSvCwMzFnFb z69WlFJ_L9y!N=4i&?jlOFEUynBG3BX?Y9Gv7}X}o9;aqfN-AF5Ur|Qbdk;ss2G~P< zH+n;2tF;QE=J^?`qxqg+xXFjgKrZuV+Y7Mi6TLWr3YN=j11Zff!mZ>(fa&kGE#F+897 zIx42=EA)rvYpnCK<|0D#uRyBRB5!=9QIm&$eKn>GxE=UF|LNjlzvi$KmmYibwbsSw zOH{w*eNbg{Ca0FBlDUcmjM>H{>E(cXr}*qzM{=Up)%u$R?Rf5Y$!v_o{Q4j;G&H2c zrNjAfoYP{6D0?#x1nc`eys4pvXs8W(?#nmr?nB!WQu%0yg+> z6X}+k=VCbKE3em(k>T0%EwgvkrfuZ0uvachX# zIYkDdu81I&dRAo)=aX+x4k@;4cRgWs28a0zMJIVfbr)~azI9xG<{YW;o`T!e{I#jF zGsow}zaT?JNj-&h_!$9$2O%lPNdb@NaT4i%p|MlwVRgQET0xj^;@3xuFg2ROo0k#t zFF!dBH(B3V3^`#gqVf~I1A9E9;C-5q!Q=6#5l-GOx$#P7wTd4sJS6Op8ahp9l__cRe=1Q5Hh-#6FT#lKH@f0)g7~&MJjO zRj17N=JLUTGFyu0r`laESHqOt^MO)b>odCRJg-!Ad*jv;p7OzP;nK?`Qp%}dzuJdj;EN38KejIT}# z!Yl}ds+Y}a0rj}~)J#z;7Qs>7UQW*Av&&_(sYzogakizI8s@yAGn5b-_P5hRru~Of zM_-5Y)1Eg^_jmQ4#Of2xjAul2EH+|E9bR6Z{LWn?W|Vt?gtMEcP3d_;`6%C{zz}Bq zWP#)R7bV3E-gST4ZoZJ?eOf5jh7O4cV4Z8v zvhKVvns(Xz6ms>uXVb7mtAj?uh^oqiNMkJT>(qdGoG&SBiVcJ0uo-AOpN^Fu_XDF4 zO+-Ug%wmb1=NMS+%;&Vdu_KA|enok0O2VHeFR2;+i>(NThD8a*0(s9g-8PE%!%>=A zoO561##@)@iclzAd)I2TQBvZuQG82$D2cpENss zx!3hVkqjiL}Cxxl^@jLw{xVc`V^-aB2(E(recH!CHI@7G) zz2CgrU$w%L&l~r_j6=f>@?1ehVK>6c(vtD^sI^sIVJj~u4w6~B;38w|BK=-dCH_Rp zMvN9F#mzSJ6q?4Sz=d3Mr^~_L>u>MW0J1Kp`JSWlqhd*U^)a1ml~)iSc27wp;-VnL z=gYq8SeD${V-FuydHGq5RYhf?-qWqG8Q_e%lV^HBFQ{kCF=uN(ySnl;H9aeJ&YbO? z3Pj$Vp9zGhfj$)`xjaveCe?2lev*T3IWBWeGV@*=b-} zvC@wXbSFUhHqhCG=1vHawpE-A@jddk9_%R|oEXYDj z2_A>@6)JR#{bpaTxfxWSX*!EFhlI?8$GMOzLT-ht`B1!un=Pp3@M{GNHYP;{tsL$- z*)wfcQU9l4O`Stc8Y^?aj@m@D{d~WQV&E+V$W&rIQ0j2{>1Hq!^ZdO1Xww8Y2hD4R z6k&{MH-(Rfg}xoPcKy9=Tm?1)w7t4GLCdq?`HfrgA8F?8&T2jrHdmf0Mw=`qiw|I5 z3Do)CKryMIA###zsb7X=_v4xEG{WwNAUlU&nsB3%*;rNcGbtk z)q3b_HMrUubo++>J!pEm8WN)|0cS4ceXZK*qLalJx%*p>Z1@!3*E4RMRljZBu9EoH zZO(6N_comx6M2yL8MnUq;M@KQ_k$4p29*k{g%kmfc!-UxnjpS5wtBOeTl#(jOR#q% zC-~*)DLZPEhgnSd>EnLDUTt~6Lbo4urGOm9xpo`b#Ds)MnT(e5M`k~P=hEE=14E*o zT2E9lh!;{^eE4MOFa5DCG6L@qPLZCLZJ0;A4M_?U2YW#}y$ZeF#ZbM)+o=n+mxG;r zU1JfXSN6Y=?vh59Sp1&!a9!D8s1D?6Z?^Hdzt61&U6hp7ouz{?BXg+7 zKeidO^?EYA!>)y%LMcADVaSay{;XYO_iaN|RFu{K#X5{O6#LF(eY9@}f z-dW4AW3XtclrV;fIpuarY3SsjJQR=dZ^P31@&*3s*V*lodJHMk{LfRrlRTz+f{hy3 zMsM?@I_}ZWxVG_%Bqepd=r7SZLhYTY*XZ`!9s{%}B%Ok$4&3OwG2 zcRiYOU0p^zyCg5{smRO>4^OKk)-sl}cw%ChG6WW#9DS6R*Dt_#@=v5f-$71uid*;^ z#1rN5JpDs+;}1%ElM;($4wZ8b()=_|Hs9N({gxrA`3W)wdo7=Pn4b7kCZ!Q=+_9P= z1u#mo1}Nv;x^BJQg9G_9M$EA~R|?1gUIi=e^zn`+J<6)<%yJQ1TUi#BO*vtX{Sy`L znrnS-S%^o82z&F zLza7JJ59f^;z4wu)R^_tMOsl_4vC{54MBiU<~D-QrU1VjSe4#h(bPFQbqVs!JmgK4 zt0xf$9`lqyX>pChu{IZL!~JiQ!N|5RYV?j|ct3!g{72szsdUNcS+GTUq#ZJSauRn{ zePC9#&I3#x$=Pua4p)ZRd0)VV3-}Z;v#OPNIW`OwfW-0_AHhVAb9CBV0W}%65;S_|Dm%IXyzT#x>NRNDu@QwlrXhi^URG~5wx2a$6I>|@z0Iq^Na8kK7fVaul>S%CdkdATV$Z&R-bOV&@7%vFJM0K&{ zd$7~V#kdc=v4Xi%XEMKuyTsJ(=)V1vvt0SDkh|}aR#AOgP}8puEjj} zW4G$p}5Jz}ww7!w5LaOO`}abAl*ji89ZA#P?!*wn@W5)%B^e2bWfw;d3uPfgzd~L8hBlijf0Mo;0#o=!$YwB zQl1}D9aj3b+2Ox6vJ16Qa5*LvI%T&R4SP_GRl6m8F%Ap)4z`M|PiD6wH);N7@?!vT z@u@O%tFm^BHJnxJG1HGaRWheU`cN;Wxyt6))vFEaqQ=^&VKQb7JWRVkoG#V(6*mm` z7L_+Rxn4lc@#_KxOc z=+ZJUf>k3FVG3cL>0Q(t&;l_b)v;^Lv;~jM#+wu&U3e{o8Wo;+pctLO&*vo_hpOnb zpmOa@_8zFL-AQq{9{qti|4vB6k;AIZ5b|kd?m4x-anjoxZEWHcQv&b_JH$?;)0$=^cRDNE0pGatrGawdO;4c3O{H zE6qO@_FpdUe%6JRH^KN#U?ZXq=N=v`A01GY@DlLFI2$))N6+Pa^x2(!|;^D>e7yKwK$Uu;iW3WnVx7_+=2mv&B1(1NXO z(?q>i?m+~34inUZUjaJ!3x^z%gzrBnTGWoQRJSrFa_CrEetk*>m6Xb`WhUm1$eGWs z{;;m8qOPAQx02{vQ0Jp`VKN;fZJnzs)R1D}LIovbMrg|kcP{ph}zaUnQ_v4^aSMQtd>h|Y^X5tw$ zpkF3(246!;ckd>SqhVEUxhSL%m#sS+nqC^xYYD% z^!HaoA}>;{sIk2A;OfP|CZG|s@zI0o)Fq?r*??dj!X5i6v2yIwdt0O1Ahr8gZu}$L zw-k^?q#}FQpCA3Q`GNWziFaLT=9B$j|LPs^=@NzwCifBE;66)-6oWC%@ab?+;B9xA z&iUN^Q$8K`h^orR8a{wBYK3XRIqUmZ6C$X@^Wk5xLu2;TRwUlAgxTysr^Tv5eS+n) zYz=r}B$YJ_bbZu>;ciq3bU$LLGBHr#P_WkonEut&HO>V=Lo@z>A^7ylVO`naWyst) zX$u)!cfrMzvV~O#5sc=Ni{jNpKALpk_wxT&bdJ!+*2uDntv!i4zcIf?$-t) z;iMvfg(+?@X@-FgKYv{r%D1%eOT5=l%R^FPuSDVJKLs=RSKLs4y9Wx?eS8Gqf|sfs z4A@$r>^}`(#yG1?AiH^P%{!-4LAP(&rGAmoBY?7GGq=Tc^{m{N))F&cX9$C~0Iy&9E6(;WZ1ouzL%6Q8llHsz4|1Fl8gv+R93Mu4y^T+8W35 zW4z2e2*d7k;sc$A%)onY<=F)(JfP^*CaR>O7LlXoPm)I68f{^VOAzg02pAX$!3gp% zt9Tj?YbUWNCk>YHpNjB0*hiRhOiHNo4BBT6BmX|9uEG?W}2|8cV2gmB=zP!kSiM~9==a|#CMS29@K7&jOa@9K|;s$ zkg#C2LXK{Bciq-T`;(ky77av9cLym#!6{yBvNzi`ZMk*Lu?^WnbP6$)Dtx8M7+S!+ z4FUMla+#Lm9oRvdKYahgI+Bnnvh#g8nN!eqe{oWMqB6Y5&y@#4vdS};B?V|Xj+%J!+W(PBQn~@7DFErLZypFcA z_Sv2}i{6?O3U#7e0aP_83pC*{ zSc#>9Ll@*dy*;U@&w0&LF)x>|Bc@~-oROms1B_U{uHZQGJ`d1>WbwBou+lAe^*M!b zE9GRcNMxfxEz^x@Buk%Eg#9D_ak^99p?H<%qAX(5joSX z&kM_Qhm9j08vhk+Lj$KrPWZPk?#qhZ--IRpLRsQZK5qJ8P>*Aey9m{EB6 znV)~|YFl8NpRg7zJVFOFa!DpFbmW)Cz9p!^LA4anw*$+v-hb)CrJY_p+3|&EF4sNC zTdJh~$f#*js~VecM(6lk5JK!~fMcggsjO4hph=nI_DPYy(ZPkHlAiNjW&Tt{gHi?y zAyo(E=aqVvd7LPIp|GrFNTPcDwyuPvOW8!$4afSA(6*yBA+AQ3Gb2-6m|qiFGj8`G zPMY{GmnxcoMznprw^M+90Zg%f2w41%y#~$Vn1W6U)fX%k^C5^|zXvQFpabnA3a#PS z5L{1YPo#dUWdWZz3th!>b+Foj0KU|2LYRO?NhSjw>+G9KksyKYS$sv=YD2rKmAJY3 zI#M!Z$q}H024|+ITOTAicNgCp7X_-!)3YcLMubslP%%(}r%E~BA?%W|F|fxcZMG?3 zZ}_0Xw$;@pA>lcfmbADemd2c7Fa|d0XGU0|C!1Z|1x%T1OV54{TdMh`+No(lcly%1 zz*>D@_CQ!`YIsRR)K(6iqr}IR!^qa}*TOt=kr>_QaIBiBQT*MtE}P^|ttLhWaBbi~ zHE)f7a6r{Pbn!257iO^9(``5hTf9A`W>!eT9T~Oq~fWT z`TMhuACQAJIb}NW8qyk_!GItX;1`vfg5uFUl2KFp00YsE5`C5Du1+Y9as8*&lM?rG zl4ggl(!Stwg9fiKfHimSS0L3we|kd1Xg4`CkGCls58}#AVelg) zv&l*Hb`y6Ng>!FGhgW$Y>?$=^jSc7lBttYvq2=J{_R*Tq|8{rm=6-_Tn~lrZ@;Hvy zJRxd$?_seMV*@!BZeOVV;bR_xA-Wtlg)vpIKxf=lhr;v1P|8`(-TihNB`<~P4s0+D z(b!k=rMT$ljJKE(Gcf7Rsl(Ev->IIVca{cN7~I~_sP_%^IaKJd1)fh1zY(f?aZcfWf8CaGVsBZB+ye(mqMDL;Fz!ecF1Qf87z#<8xQ51UZ+JGQz>F_vp@ zDxYkGx{jM%F=1)-2bGpe>-aBdM@m1=)R2WYT}wTlY=Ph5t6yr@h6Z=Wg%Bwok(`>` zzwqw#zP%4!ZxOz3S#j1(-+FH+FIQzM=(yZ?ik<*1h9IKTC!@^cjg3(quoeQXR1{T) z7j=<}FrrEEu;f6Hqrb0$ZaXVOfoq$x725QLuxOj{`;tY1y^ZA+hnHWww&l50l52>rqJAijv2Nv6WT!G#R#m0<1~Gh(vzSw@C5I9Kzt7 z;9v?&Fb2XwX^}T7Dot>`Kn!tS`!m ztzC4{9S1f>OTUye$@0x$V!UhXhDxuA@d^vH2Tjz(Okt=qiyt(8=arRTsBl{c_uE2p z8vnljT<(A<9|4Eg&a>Fg?i4$3LS^{iE+rB$h*fG+uRirlN=IhwM6ELPEwQ&L2lN1; z#$3Z_GZn*7DNtHy-KwC;*+O-2b?j-Zo!0WzBfi-JQ_89@vv`K>^h@H1dBYp7_{u^k zkBgrmYz!RY2c%MogK$WbY)i|vq8+O!gC1Ebk<$zzdOkY5<0q5DQA{(%-y>o0=Xnh^ z>hQbH!K|+F>IvKDcOM70uT3$jE!<3XLlMrmQ{#}8X%4yH$!=fqnWb}*@`~#JjB*-F z^NfA0h~r#X>`+0hJ;P5*Gq!8*aHqPv5jD79crtD^4{Hqg=zIN3VPjL!ImwK2P^Z#oHy*O8@7-Lt$l7G=MZdI|;N1j% z3?XfM$ju(f2cffY)0dMT{Iot(+_McZ5dhtp506s9ASZ2?FgAE;#i3J6Ehh`8C>Hyv zDv0}lW69+e^Wsw=RBEJ0ejX&oIASQOE?+H#Jy?I~>@D=E4t$H^L9rmE|E)zevFzsL zLmyk`PcZLlIWfL>oi63BChMAgqSH3y^O0Y@=02W!oPiQEML?@#Elz2txxJ|HWRWSjg_`}64T5EIG52jEmBJDlCKrk75YFieSE@?< zj|fAoId_}g#dHz|!3e#dL4qKXaeI)M96kx{F<#DnTMv`^NVnVYboa)ZHleRNSQNP| zmUU@y>o`9K|4pt63>CUur%99I{Vx3)Ra*Sja&fwrp@gHx_Zq*Y^X>!aflp96j!g7R z&_k|y3Gc0nO%9y~rxjVr9O=t6-oe20dIhg!w~acLAjKcRSC>4VGMs&klJ*CS6Mh00 zWt)E0k$FEUwyNDyEQM5>VBzkm_X7I45wH}-sL&E0L=BLlCaud4Lu=d9WWroEVuy3P zhR0JIXg{GCJrU%RgrUCI2#SntXj9av@rbzgDmhIvNE8$EYEDi8^Sb_l#a7oL9J)ag zz^UL==$ln5ZZZ|!zNBAcp5|$hU#T5pKZ&K4l;~p!V`5FTU)x|^tc5rAdvGa$)1Jjr zn;Y~g&-hU%jgJc-YP^)AqF8I3uU=oGWHijM&7J(M`UlC@qqWt$hy6K{yc3I$n3Fu` zgw^Y!QbZ7Fgud1&>r=V7<8Fs2ZG?@-<{@7r%H%74WpRHk3cWwXTkmDIQO*1o8YHfJ zF<6myAw{Y@-FfI%@%mE;0$A>sRZiF4-=j^)h*bLTaGrLDaq@MHJwJ))$G%^#R6L(? zF@T42Na~uuH_wlMuwiuGEv#sWQ0+;4JZy(#xEhs!L5y=; zazgN{i>IP~yF3c7GG1Yv-##WyxtNDDut8``1trxyKKG&fYlyex9O`@t=leAk z>l$k_m6O#wf4|t>-0HW@PF>Z`zvh@KQ6A*|!+Ri)pc=jH)@obN7`L zE}GvGG+^OYJ@tDQ9p!zVE?ZpS%}jSoOK$oh4TiGBp-*jIu3O8u!Rr|LZFI9zE-67$ zOTxnJ!DJG+Xdhx9e*a{(d8t`3IKTaR`ni}laF=wxBUC7~;6M@k`_H>+tT`ubUlchd&B+vO%{P`ccXP*#4) zyed>pI#>!uvsPEtvDj>1&; zoe#u5M66LA)r#5axB|l7y&XPKwAkIs2FaqsDTy3jNBWUJ*=TNMKq;bc?9(gN#z2kh zUiifYhz^nz^rBrt>SZcldsl%h0^jGsRSh&{!p8A~sNU7X0)m(%fx(_tylrh#L&`Z< z_mb4M$B_V3iOrz=0!PJ|tCq4|c;Nh@iGO>Og&!in$@>?BLxLGFCX6mr9Tkd_Y?dkQ zv8<$1`C~$(JvJeP93S8Ac31tvYm?*KrJ{>_180ol`xNiz)s_6r>DD@+YGM|XUbeaE zaOOpcT~=Uzm03Zf%%mucSS?jrR%;_V&pfE)T)QgTA$9QcPF1d^yFU0 zM9rSYlbLkm%oj?_yu<#nx#Q|oK>~rcX9cPydmBAKh4Nuj1RZNB@jBCmV=UdcKB?ocY5?jPTPOr_E* zpkW2TlRO~6FPMNofHe-*ToP1}(ARczhKhKAqZ&sK07SexxMVPNdj2@4DWyRwP;x5y zFh6?(qk54oM2AIO#D-6~+0|5*c?w6H{5DUrD7`S0W{MOT3K7jAH@a*zh6W%snqL(4 zy}D9~j;2tu^gL;@j9;uS=sHrza7>4=Mir4=zPq?=LP!{CIZ3tkQWas$8n%eP?$|Sm zsS{w3SNe_1fIj%I%6#Px2fr$lh&MDQQ=*P|xVlBZV#kzED&j9utDKK9AD&Hnbz2lI zhdaySuf~@MLZ8;Ka%D}DI+o9eU$^;dt&s8~xH%7;eM0LO0Lj1IS`jg{nJ0#=`e+nH zO}#q)fh49~MPr04M1UP-!U;WazcxI5*H_ z`+Mv0Vhq{n_F?UXPLA)X?r61LOO|6By?Naa;j$rv%XtuyeVH%}i#{@ zOeVCIHk|XPL5$l_XM|FlXnS z;fLac7I2m;bl)3!Q54oxn?tjzPrp=)PMccUYA^tB9TBfDy}uL*!yMR7(xbcB83`l2 zT(%z@D6QtAlRzv7i26^p{B1!lZ9dORKKC0SIqt7>X$Zd!+Z zg760Lb_oyR9sw`CP4p+#H;wj{?E=8R5O1WH6}vaT{gCEf_-Yb~CNESa_@cV18>SZA z-Yg(UJuA7#h*4_L9XtKT>~!9~!u2$)-7nGl{%G2m8i;!`c!E!u)J(}Vh6Va0@4 z(_XG@JC~F>Ic{8wBm_t;n!;+K>Y@XTPd4fHg96=LH#D#nmz0Fg1CweSl9zh8?0o^L z;tZ!Be%OGgGaAyYSNTYP(uw#fM+yo_2uW4eM-+v@$1r|)7Ivy93;8TOKXSGqletW0vyets{;wG{^w5fAs{K2-(#EaH&d z>d}+1>u?Pwm`A$j@LrBeqK!|qG#S|}I$Q6Bf7a;PY~5Nm1@Uo1B1N)0x>VHU)>d=; z__GNsGUdX$dd(C4K8>q8Wpg`JzCR5~m`qvXQ0ywi357OY)Nlv-^n0xoI%_ zZDE>sDudHQ-Itfk{i(vGzQTtt%XK{+9lT^S38ji`NKqprquZ7qyH2mC-gbO0l9~|` zhZz+$GZTC)4N0Gr{Eq_=99*m6xsmaY6tVxrV`;)tWW$1Q;-pt4`IGlh3W3 zesb78!WMG@mBKd|)F77ZO$;?!<>@y{FvzjU2TPGIx&MAyPB1JnjHOZhOG-;0&P^M0 zd8nNkmq+SWlH+N{=8lccBGvKWI=ajvd+Cj_YoRaIqE~x8{vb!28rQlB3cu|IvLS3KNIsQ015EQ18$bsnQTZCYG(h z(K(xmbxE3SjI*?Ds;teT?XnSnF<4UW)RZT|Q ztP2MqC49iwXkB&wao4B*b{CoMIIFRk>UA}v zhEO&PQ0EfqQ4Fv)F~HEX@x|+3Gk)l&2lTMP!x_JW(9#$?j?m%>GpgeY54E$-|`nO$*%huV1OS%i)7AAhY&=gtS6=FL!Q5IFXM#G z7o%KIF-t4H)P`2feHUqfQn>|R6R1#!&9d}Y6!d>55PDGQ-}6oArYDr*2g!mM+XVGj zhLnt^0^nQX-X}>Ant@au^XC;J1&3kyM8*tr%B~W#LYQdL#2F!6V&^N{v5<;_4Y2K& zzZ+g5TN8Gpe>|MoQaahRmh}H}Se5M_q6HL)zOzWP=X*6P!EtX2l(?K{DN;VwiIyn; z$xID3teTA~ZPbD=)gNT2(L4^iO)6ahP1?9>H2J_>-UVat{pv{bFE<2`0# zI1Kp%rd4a~`~K9xpNq)y3JQ;i(Ur0XuM}*ilr51s<-;Fc_i$J1dTAX|{w9%wiU**t zK&@KSI?yn7cdk`WE`||er!XT0Jc9CDSG!lnBJ|b%s4w%L)HT`5>=}(`B$Z-L(BcKo z5OFvi8^Nwz)=zbn17UWcb!dh~*L^!dByl*Mf&ZG|r$s+Qbv%_q5P_SnWquuQ z7EP-V6uGCAh%3G7RDkT#JFI~ZeKu(QZlDO6iLmz;T9>&^KTSc(J|7`IXb&z8=NU)*p@);UiQH#!TCWT8Si&Ci4i#p)PY7WT2 zHMrcbRYBn9%?}j~nKwe^N99ZHLq!b=lXBT}zp@KEi&9ej6Mucy;IRq0r@^54%h3P# z3vql&B?WHKhHKj#R*))Xn%k`lL-+7SEGbTlGn04*o10U?lOkQ5K$XaG2J27?j0JzW zzNVn$J>0lo<}c3M+k_jFCn5UKmB|wOYDtk3JcmI8Cd1hdvtbOmf0@Ovu6r?fkt^pX zIhL7)TE$X4EJ#)6vgjCgIQSMB9j%`dRPWi#Df06Re|8h1R$YyC1a`@0wloGt2795r zvAIEUc46`7hO&9W!)G3`yZqwd9CxUgcXK=pVpK45lE?kNpIJKrIr47|^1pjuwmc8` zPx}(N9X2Vu_vyOD1=>SPrcK`x%l7=bIisOt=;WJ-$zch1LL7G(4V@`?zygxR$)?Kf zwMz^#Gu5IRV;O_Z1JK&#vu!owk6VAajsLQmzrji4D|~z^X%V#~P*9^Zf>sH*`R(W5 z6$2B(YL-={RhjR{vNNK3_$%V;(bk2bed#n~j)U1qZpc=evE{{oL(wc#WGFl%Xe8QGxeKd|BJIwgp2LyGsrEJ8u8FKWdVu>yp(872uo2# zlq(I6(1-p#bT95ATk#8qGdDNf_GzitR_&>CtBT%`7LxgdSx6O`*}!IY-`-$cvZ!1Z zYM#zuK{9^Q&a5Iew4)W^|7FqRn zde$_vwwh~A!ocdUR)RqYq>%@HWEc0Qb#GGn^yfBd&6?U+^yb;eUMd=Ng(*DrC_K6c z-S4w1c1Tk!DhP5?|8}1MS7zm770=|}rgZP>Dr?nR!LiJFXQOIRg8flvYrf9&!w%I# zL+MY~Pe}mh*ag3#-D_7~z$>|NxZ2S%+-?*%(`}8%#1J=mG3QvHjB}@i;YR!qgM8E6rT8jxo4=|;;Tk@>ozONw-cfeu25zMHx`4Zc=TOM1$riDF- zkXK$W@;SUb4)WL6GFSTbUCO^9fMpBq$yrPR&P& zpfJ`V=J)9;n#8jcQ$KMgXK-}2uz6BF)&@7%Ar0UF7+OSpFfXkQq#g;uFI_Ig^cq!$ z7N?^c=FZ}}Q(}hoRu}{HNs*I`2VD0<-PB{+fD--hJJw~oN=i@;FLQ-a+S}`8EKL*| z&)bd-lteERZj`mgS7ghmsAHc3XI!#;EC5W`WCARLu2%i<{g7Ly%xd(>L*wL2Y|lv4 ziNfd&S#qa+X5CCCp_9U#u8!X5fbie&g9TS~H%6oyUh~nAYp2fJYlBmxzF1+zh@Pp< zJ773dxw3FF%$9;3hDi)pM~fARr)F=?b6=V*Pze6^g|>t6`f}4D(@D< z1G$DS#tftQ^rc6=2GUB`X6Kq?u7u5w0e9TF|N7U!u6gPFx|#4KV%yx?>8>C&SkPZ^ zk#bwg@whY{vA0#CV{GjQovtt1aa=^BD&qcVIk9Lsik|--xhJu>YP6M0(Dmw*|6_T* z%MNQ@6XuzurW;PmC7+WrGb={N!jb}v_C8%oZIkUV9d7=zL_{4~!)=TZoq4UqN4mm) zMVnsL+kcmD`)izMTZ%~MMCy2kS>zo4qf}|xgVhZ4^nFhM)uYHiUraK7`1%XSt$mK~ zI@5ZK2cyxC8K)(TyGz3GgZb^2e)FV4lW|0u34c51|JE^n0M%hXEIj?7+xvLTDrW3V zq`~<&Q2v4mmIB~xn7YkmtA9Rub>aaH-Fgt0|L~{3>Z%T6)*pO zZ7Zz2z*xn-vDrVL_<%u@KJae*)R7Bhf7|O{$myp8RB~-8uLjQl0^);~?T0@eYSi%m z_07ND1-RP{Ru3_6r~df9*%i2fAbvG}|IhO6LY;5X5v1?@SmTsCpIEaJ`GLljxiB<7 z0bD_`5NklSx1bnD1M?qt{10D}h|iU9%*;y>jJh;yPEBV@jtkVB-#sfop?OK zT%AvJ&t@$_`O2$5hkF0{orI8Zy*Q@$7Fy7lq-iz6P&{eoaVGzyiZ2*e{UH)_sHWw} z31wJ$CbF#N#F){={`%P3w*P_s2e>RGS6CDo)#3+cj0Z-&CqHd&W8s}!wqNEB{QCa? ze1s0TY?C;~z<<)wEptx9hwg-q@KNG__?;iLPYCcG-n6Ui-$48iS-+xY`<;M#vi=Fo ztGR;&1OhXW4!FtxMooTIl=+5I5hu2K2^oVVVYp*CsHTLqwY@DN ze||`2s*#xLNyJxmC$_2(n0+qh3BJ3hq@W=5zLA*;>vVm(A-0TC+E{?xxafnFrLQ1< z(fxL8OZ5l1-w$7l$va{0;ikHAw!eh7)p4mm9xy-g6m=CzYRPBPRIo3sR)1i}eJ5es z{K*&cW2%FC6=I!0c>wcS!1Wn?BWbI>(e%ZSu)r5H{;?&6_~jPN`a-t0v!v5O_=v>$ z0{FsnV$l~-Z9*k|aL134?R@LILDeO%H5Fj` zlAq=cZ9@CK?ESNql@;7^mKhgRhPQ}FfRCsADnvH}kLjYy;N!pb%U=h2i^ezgJf{fL zj$$WY|wuh!0*1?|HA>{{1OVj(%1`gwbN65v#u>2?kB?uugtbi9L>?e zUJ-uwckTkz9+j`gJ7{qQfy}mtGgUKltEA9L!ITcU3_#P6Db)^p0ICt}0|??b%4oIX ze`EG&4KPX?%&eV<<`P$Yjcnufa0$^)AlOd=I2YYz>^rG{6Rd=`DedIKLwMqW5YF;6y zDH6s6Vu}BF2)N5d*)W|*8leB(k%mxzLDEk*awLr%CI>bmBEnA&xa*Ga{4imlr$^At z!s22v{_N1{bd`3g(I!d2AKJu2H`k=9s7PE>ODorEbnj|pWTeJq2osyz<*Vo}v+9oD zFu~kNAR?~u-uU+0?-}^zBMBwP?<#d#RqwBlsYyvm1$rwh)3O`*AUuG3 z{1kO`Xn||-eAlxu;N1wtOQm^l*Zt3Le@6`wyxjI>8*`MN-vNdpXqvYKj2Y z!}7+hMT^Rr8-DrobeTKt2FnzW>)NaY;MzEjv`~!X8q38xiAe5qao5xK8&KS?JbA4L_aoa#BWm3{`d<}cG>h;v-yhfKEpk3e zzWa%&tu9F9w;mdP>OOMb_fzKq^d16{oCihx##wYHzC~o8|La}+mtKTRa9c0(5)D{P zN`qMN0d?*}w`aeZNu@XvkpEPcl})S0r&GBEqGQq(d_7KOv(gOQqPVG1keBaTePB_0 z2*+lgO!r^r;R!UwbKCnKnyvHH><>SA7r@f^o|r85zYJ4G-eqk}Q2HKI5DWqW6#T&1 zHx_vOap^Bj3}c)LE<-;K<;>2@db0-At_Neh`Y^m=x^>YfL&DQ(w1QxXm0uz2@>CdU zMNDa`g&Pmwk~^!={F-Gz0&=sU##J|qPlk7+8C=^ie7C+H2TEC!zKNJL>g%5r!6#Gm zUNw_H z<#iUOw+G|`tn6(D57vrZu+}pS4%-Uk@|sR(wcVe6yf`bo+qBM}9UECum2r-jw9)vMve(^yVVgSKxwJb^SPSAc znS$M)uI8@X+CEMaDUah#qZ)VuweOmYL3WXp0+}wGaP2VhhZDJC7Em7s!8rDzrGSem<94&Wc?}VAbaxNbo7bLBoc*d(y&sm= zwt!Sv$K!QlXF|DFqa|F2VMwvswJh;M5{&cX2uK-UD ze89s4aO~asnJQ>jAHF5cx<$fSdZVRJU0@mx%#6}@e^A;2i8@B+pgxkprDh`pgMp(x zKWBv}(0fo?(IWYLH|BkS9PdTnU8j`n2Xb48fT`Zg3mr{rFKEYtJL! z0Zp9T-T^Fn$bUL);6#7-^w{lU&uufVD;Pw~De!!r)afF)bwQ36wsr$rERf^9%X;yfAcwAl)G#jVN7$ zqymZpN|$uk&?Vh1(jcJHJ#W!?a6jBH_wo!pvstibueH}+ z>%V^SU%BLpg5>RRk}F;OzGN|XQmt9TvOZ?PPo6Hy6*;Rxdh+)!vvxt%8_rW38oryl z+_Jf&uTFL<2Dj!ZDk#=tWEeoiafHeuFWHJ^ras)i7ttK2EG9T>%io2vOEHhGX9ZsF zY;6dD6OVY}*D8Yy;dM``TJISPJ;6r+^|zq6F3$R;;2oJdn^2o-ktl_U6h>@Ml(=Nj zmo|_7pd8iJyOeZn17kEi7)lA>zO7%lDOO{&+ih=e+mt-m*1Z$*5C!MP^=xNqOci{T`amt)A0N>w)z5^gkXzucgG84d*aX&hJ{%Xp@!?`q<3T4yS`f1R)SgRg zER&+qEX1x33B@5R#pQXnEv(^43AjDCg!5E;L|lpz;2;Ff&vAmFq@_75rcOn@wP&*2 z^Nsr-dD9M>FUL!cg}W$^MijX)8rJ++yu`it`^iPXrCzr?029(YSkip!rp)JYD{XLa zr2}4#kv*=c1@>5^NGz_03EhZ=h*%u!*6v@+Lr?GyOHZ?JmYGa5T0^gD2R)U<{TIoC zoVc3Kv#+nA;&?P8V`HDsc-$nxQV7J?*8a=Me$E798i52W!2Ys7cbT~;OEZOWzIIBK zEqGl8xC8~z)cri@qA7901B*)y4P0(2dp}&bUgt-#dOPM%^Au%H(yr|T#$|xt8w6|@ z5^0YB5W?CZnJYnrY0mR@9D<`6Hwt$OdA- zeVilm6de_f+hNld6anX*$$cJ4Erc*&Lt8C=gBWiX+Al~fg9EzX0lV8~Q%;z{;w4KAtK^`xeWrn&tAIEUSTCX$6MvnFJi!jalSx`?rb`#4& ze%kZB9Y5{KMgz~08<776$Fk;lhyNk9 zEe=UxgC2@JfYIz_fMgx^2}+B&~*3WCbYIvEi8{) zM-b2zTIvzfo^R;+L2-rZ^bVfQu$ab%KKY`*U*dhE7>G@l?ZjR&aD&s%Ha`scNoUITB3=$h`Vn<(g~{Mg96Ekm zzQC1}Sc%r44&uh6kl-VffG{LACuoOnAXlN$6)lsvpm4c#f4HnQPa?HBDige`Zx}r|geysm?Ii)gTM|T2E8xHkP}N(5R?3R{dX{1G0imXM7Q>Y>W(X z?VfWdE{RR>k{-0@#g8wyz~8Q|1)ED-(r+C3LO>vQjz6g26|jcN*qVNHc|oG zMF}e+9;&)8;v1x zWm3Vx&c@3poCP{v`nnL?mG$E~fuZ&fe0Dk6%s6UVCiomITvLo}YK7=%{k&>|F4~#; zA1K=Ua_350!Z5fP(YHX25$HPpJT>uhpiLv(TofvveWBJHW8^cO2IlZgLrks*8l{Vg zM&#WNuTz6^qQs_mh$n3zob9|3BvrNfa}%BoP&`aL<$K5h?Tx-kc(a48y~p_Vh^@Pq zi~e{&xmZRegGpitj(gh;(Kxki9nfqbxn#bFu`iY<>JgrEiy-#XLY$QamOh|Qm^S*} zRlXUFI^$At4ib#F1zQ4>5Aq<*Y|y|q#UO)-x2=t2nKTkvSEfJy35C(Y_J#kFzm^>=NH$K+ASO;C%*bY48(GJIbDpEgWMrw3WfMZTdD?{3lv6w}v93Df2iiutDL1~?cWrh1w zW*jkMN0xW;ljx(HMUgz_J|H4GR$*1?MWp1c%(Dwk;%2YfkmvWKc;DiKxNeeU!{Q6Z zUw$v^L&OK>!5!Yjg^Hnvu1lg(edY*;2-xNbp{&eBlZ2x^{j_o5f=P64NdS3lxY1%F ze)V<^$)-0TFjlp!v;3t&zZlGh<)F0ApG*u~DrqKb60EwfCoyKuP^#j`k8HUlgV*{Z zghFhFk*a?Vd-y7No4i;`Mvp)iEs0=^=A1!-R)l{4l~g<4nZ}T=(#B@TIWG&eRE47T zaimFPjC8TPh>cz?uOBK+x>?!m!jK_$AFUW{-VnK8S_*-h16(W#?1wu#(^V@L+~?JV zrQ!u?PCmFikLZj~%14_QUl&Ef$K_`MgAQq?cHp#DQ5{WRIs4pIZGrCG!@> zAZ7lWZJ^_f4AM}BDM`+9LHPaVB{!f)XgF%n3e-U~t+PDI?N#fM}5oS`UDk0b*%>3{ozk?}Ax) zNJ@xE;=;GQs1$TkNPm4XN-VaN97}rQ?O=??U95{(pNMOse@J` zAs7U4!`62hcMv&z%I}pasJHdmeSS{llf7dt+YGKR&7-ZeVfTgJ>$vY$?LW|PIsmnu z)AGRM_L}d!<~B_N1Hf6Wwv^xtS_w)WH6=-}#YUecR4}XL#o$k9RK^~N`-6SZ z65?V2R6xkQQERD`$|=ld3=u5Ve}pz`hm(oKKf|cqKS!y5fZ{Uh8|ES?gv29-ex9>} zrAD?g?(Zhe{dP>g!F|ND`1$4T*%6x7;y3g86w*gn?>%n6mpC==p=gZ)sew7BE5V(a z9BYYMUbjYVCsCIYSJXTT{X?RKQWWS`s-(C3)PZM6@pkA!I(nM{6WT*_GdGt0<^o$Z z(+3}Y*$7%IFwRi0rL7y=98FtoLvK`Qh9qBo#UcVWRM(n9^FK$%swsgOH8O8)WfgofF(=Q={Fw~>fw)BwD03Sht-luImXkz z+vKR3&E{{s^x(nKZ=nWN-_? zltfR)Agy2YTH8LdID!|S`K6zjzKs8IVT+fUg9L4Hz#SxGFkNlE7hWeJg-d0+!4k$# zJWomU*`|2`1#B%D;-A7rt^sx)Oc$-ky4T=7^c7_6b-ur}|Yu|+{RZp~c5cc{CZC8c#Qcv#L zkft82=z1;yq0=Tih)vsX%MYcqPn1{NRiVo@i#Ai1?LJH-PraWk z9M|~yn&4?#9<1Jy{1suCZl%?n zE6K+JY!>=5XzIX(*%O=IIwey=xEa z9JpHiaKm&PA{oWJ8}?w1x_1KN*!~+LgU{q$D2V#ATox~A_NZX8H!6~6{`8~&1n_8m zsqZb49#ex>m;MF%UPJ@1OfMB9@_#8Ck^-PVcl79>|4F+2VL76GXaErJN;1am?`Y}o z_Y!y*Dw2D264Xk6LoNUCVqW+F43G9KPx4>NL>U3HBM8A&;BPSepHDoO^ues7AxcL5 zm$Kt%0BrpK75vl0|MOP7f$Y$d)roj_M1i73_UAl^<2kFh1wNVrI08 z?i}|A-u#?vW&;DR3V2I(-4AhvSvqG9X90!OnNa$^Q+61FWVj zfV(e#3n%**R#OI!yO*iGeeh4vvjw2Cs38vx1OHAy{B`#77~oN`EPRs~@=x5|7LL0Y z_kPs>=NT;-Tg-lz|M|4;dmv}`ph=3F;6_PL@|0(nujOttZ|OY?9GtDU*}qPI4;^k& z{OsDOv8y?5wEnH<)oV8A16p7&;qQ@99Sp*j)J;v7>h8Lth>@Ymhq)anyqU^hu?tz_ z{5+-|?xFTj!7n>A2)LRvd|EuXuLBX^)WSm1^j5e3E;T7BU%XKs_aclbS-{24bVbd~ z`}!G1(bN}&0@sR!SUr~ypK}UdAD&WipmfnZRP*vGH0YSCHtfPRv$9I?y1DF_bpc>K z5X$=@+FZ&yLl>5KjTttoYH+MaVYlrT~hAmd#A{3jp^g7}h6X zqoUMRQNb@0Ka3KrnA>E2S8X&1W%q}c8<;{;KiK?a51kRtybz#nTDJyfE%NlW9V^ONnT*37NsaK43 zv(wbE`SUtVdtME1ool|B#0$OYCT3;tj=OAHvtRFjIZ{J^aj`l#(V%{DZ)uxTwsL#C zQMdAHCXMUNuG^$gsP(o$y(AHkle0by-C;j`7$v`;g|^QBOH zle415NWOIY6(E>QqjVgS;1|0eH=B?p95sBxx6nFzZMmZWA5Kx?Qsz@ zE5+LYP%EfOCf#+NO#80+;)hNDxBW8!ab(H3yM_`L`@_LuAr4jbfjx%-LFQB#uoM?h z=GOPigykt`aK3r-#=eIssT+`spNM7L9_P28Xuf(i!t`Qw3cYxtw^uA!NnA8zq_ffDbtsnI$d%fa^{n+EstUg|ReoJG{Un4h@ z7RB<&rb)wiUQJlBwsrzAX?t}uKLfz1DDAuH%FV~W?Kf$h10PEdV62kg zg^n1Kg(OUTzfwT?4?%Cs3<5H7hleXHCOD@cb~yv1nl_D0y60^q$6{ym?luBAS`KS# zYfB4qM;{F%hp(1sh+-ZMil{!Znr4K9r{G2hI<=`%U0$d|-ga%nwp7o|Y562mucqYN z{(3nb-^u$cj5ZZ@ckkj|p85Gj#&%J=KcA?*if+C=DS0>C*0{s;#fBwty~5+dzV>)T zajoHKAP(pOsx%f`=FovOp%6fm&Dc*lq3!~(`~xmc3;-FI(S~W|G7{p{?{GBHyY-{~ zvv<{5qZ(j9qPuyxdaIr&A6H(?%(ijPYdKWr1T@oTB$r9Plt|NnLuZ{1VQq6G z6F|FA(i}I8fTx|m5`{|5aaM5yoCa74<*qM3=d-obq4q=i!cp<8CR<;sa^kM>rXmU446oK+n#{;^=bhc!^!^w zcub?E@I+s;$(LpqzO8uhd=p@Kik_!Dd7;O1bve;Yt%m7!y+VUkXob(BY6_+Sh=6GY zEGCT5s+f*260Ab6(#ey(1zot!XpZH(vuYl&tkKc*1EyGp{B*Z(YUO%sl3ui>_nHC1 z#!c{N^PcCPdtLZ|C$O!JcrQuwdB=XOo^g05-UZyG1H+O!K%?mweQ5<*%?2{R_{10`cKM}Rfq_*c zGRyIHh2}0ApdsF}K{W8fXo-x$4_fLr<83^*HJ2jspl;1cS&Ylm9aY9!8 zpouJZoTJ8z_$b^piLL{Furw7M8DV-a%%*Vr@$i-Kw5wrJ*9~r%V1v!RNT9^qE>C}x zTpB4HgS3npAUd!Q0z!k?uNH~%$o7c{@yRGy#HJ|6zi2K1;GF2ajPg2W_<thSOD-S5WagSBNC`_NGXP2PXuX<)8?E-h`jV(@mz^zL8#8hdf`Si+wStEG3n_9@xG|6yr*>gmm zdGn++S`sl(xL7kh*4H!DPbp)4{e5fID538g%HFUme(fnRk_SVW)B$dwG~V=pmz9vVmY5rfckwKeOg?h5LBp9jmWvfc6uo zw=ueOYAfZO1vy1NeS$D~u#x~ub5}SSLlBkoM+c|xytCPM-pl?%GSDf&;#Pd$%P~9m zsV!dCDDDJ>P;;F{KvY7_3*k@qszXWGq7t7KoN4)&jfB_WP}73f4NOB~q%S(_bqE`q zf4Ih7$V`(e83>)EcBQ++Y6;dtT=0aW)_xhOAQ+54LH0BqzeaU@36M(5QY@w<1A&@7 z%O)vS$ib?uZ$Qf@Oym2-{mkj$Y#p@Ri>52sD2{!h&(%XMKOWriq9HwY-jT<}JERVn zOfBKHV;HcTAeo1qf>Mjl5j-7(VpoMqBoX%E3_&N@#LRq3O9s0{Ed8dGPq|Sq03K)p z$1NTa)IqVrzJd{tt>JGg(z(g0UH2MT4=aj9Ms?z)k(=5wc&kv;sRTA%uW@Zh`WbO3 z(is!f#Pdc+e_`2+{Vw3>XfJUP$=sL75mvhZXb(;vFF!}~%^mv6<9=#cw2?DV$50B& zo}WDgaNVs)d=~UC%o=J-bBNDy6)3kb6GgPRLNJBmY$>A{F4WmRAD71Y2wXUWL1Xn=Vs93g&gp^3zpB^m|6II<^ zHQybDQ}6bV`XC}zhCMDku(b$6A;%PC9|4?-4b|7eM;{tUnUMMfI>{Qax9{Bt0N0;c zgdk9#_~Cmk!Los5b!KtCPy!>2l^S43OGhfDukA8pNCO)rB(YNAD7*t@6DfwQVD3Ff zQ81-<^-GvT)^eb>N#qGfFsnuJ%^7+LO0sj&u04x5rBD<4ym$L?fSxi)iR3$}k1T3u zClH&7k1NzWSh`jo|8R2@l0^K#i$3A(fq%{ZDfeeod9s7-O?7B|0B`F6nen(<-su;4 zS1TV`bfNLZO+?p=wWKO$tSz?0%oUK-vmt^2THnRvsuIs16%0&jLXg2lsukiw2N{8& z3G8JC30CPwy>pcJxUOUsD{| zH}cKgyXgG*P6K7B4GV?J5Sq5!Ul2#r8_qJJ;+1NDz7)i4)aXL(zt+Gbm8%`WQKKN- zw?5B&t;q^?t@3OWU*X7%%*xDRKyr1)6hYLhy7s=?yW7Mib`${b1{vznIXJfojQTEz zAMBzFO;GthZph1fu$4tB6_thF=>USZp;5h1!Ct&UNZJL1!bG&Hv)Gpmk-OT%kk0%x z-QGQMantr9dHqdp_Z!3W7e#qc(YCYohE+hyR8>s4 zavy(>`c%Px8@|YG!IvxEo}%pd6}zI-BCfm-DQw?D4-@FzZR?=?X&8RL>s((0NOw?` zr0CXQAXWC1(NtqNLXV8tgr(ftZXF|3kle=^z)@@ZHl(23xpMZ-N`;Am?VEztHT=!&`X;R;fX8RT8pE50-{;iMxO+?ea8Z-{f` z?l9-6S=tM8F~_fwdsBKNK`zK!XrXzUi(e5Y>@0(L0|)R*zK&*gGX$rO=CmXe_eKZ+ zED*ulIUC6x5c0zh_PazYy9jHv1g%ada3WqaK%eXhjmAV46n@oQadNTSz^U}p zs5iI;hBcGpJ$MWfvP47%@g#^8FIKNKp!PQHCrC_qiDyPI9>-KYmS9cprYV-oZi>L6 z%!=+Yj3#J*a*he1Pxe;Q>xBC~t1&l5+r{f2<*Qk@UCmzlhJQVaw5K^*w6;86PU$}R zv~e>R!QNBWMO_fY2QgI6Y)2Wy1slS%-@tv!uZM0jyZL|vkR-y2gFe-V5iBgh!VwiC z0z?W-L9JN*mv;aI{3XBGFM<72O9v?qZ;1>U`EKbzYaJ@TTloD>LGJMc&7u9ktB0rl z23WcH)|rzun2pIGoMMP+X;*LDBP+wVvY9+4i~LYA*jht_$i-N`ST02hX&mg7Jh&4N zM?IXi1MDhY8CZ_XZxcTFVl1vDndEtqn(g6|!JZo8b~elAX*HDrTc2(#PY@W@%03UO z6==arez_6sd;h)^8L*tOqT0t&GaRER#$eG6eup<BJwY{58Aa52lHm1-veDq@D(XdS!hI+2h!TcuE_`IO*` z=n5eLVdZ@fTV3XXWZKj&SxqtXLp`$Bs+>3xX;N;fSJl-)$iwr4;`W8F6CbRTt%@`W z_gOcE=)h;6xgJ8;eJy@yszc-{ciYjT_}xWRQ_zszTKEj`puq+%T;T&C41j9Wg`IxH z#!3tjk_y^?b|&m1ea+JH5fjI+>~pYRgba_Cc9v0F`9|u*PaM3Xc>{44DN>7FqHro2 zVdp|;-zSF2FTR7JUK)YCku7foxQO2IooA9tnfdtD0Fsf-hU|kNSAU-M$^MERrM?Ra z;ltjq}f7uLYVM&T>eg|F+7(>c@Wv^%wi4UoTVYur}p5XCa2=k2>N=Q0-Y5J1RRVm=o-C`3ml@2Veu(UOaNd>2P);&zkWbo1@JyEW)x;@l z{ma^zd+|0~zaeiYxqH+cY3cddGcor1QNL>haxIL_Zq%oAeES;PpzqIE($q{|nEuh= zeuVfylt-om>clg4Nh-Ys*iWg#O80V{Uc@cT3+1t@MrP>tW|^tIPmX#f-(aO?P4IYw zg6k{GS1Acs!tCozQqQ=RL=jsX!?y*7x5a%KJ!eqV)NFmm`4bHCpkXeN(V^>2)-%?C zQa|5vZus+MC#Es@4wLK~(NQdN*VlH%?vjIpgTs{WQ|Y}u=@I)qq!Km}Xu~`c%=6-x zX(g5}dQzgw=+$b|FT|u3+2EN$6bVbOHoL}rHY;>;0+2GKp?Wb;ajj9#M9XAv>Ur0E z@6B+~b;NH8ASYht0tA-&YqPa@iG~O5&L*^i*RV38`wH`4=q^WBDn;(e#dF1rjOs7N zJfBvhdwROR)IREb8=nFBqGoy0Bh$mz!O1lk+gi1D8OPB8%$D`4I?qGo;Vuo|*Z6Y% z*U_Pm9=(9$IvY%&Quekv;h2jScUHwqJ^*kFx2WAMx^8(!a+KJ9LStB*7W?%&)phmP zis3Kz#s~?p^_WO;lw-pyhffQVuZ3Kx6l-w8#25z|V`-x+!`$zgx$l1J;e_d2yy&Qt z)}Fl);Aj7tyt)jNP5$_cp8+zCy&G~*5g7ct_3RHlK@9-E?h=3j`JY@Bkc%Bni*~z*j{L2D|?om(`0g)FHYS4EVwRdAY%G*}R9$ERg8rKbq-3Z(b<@WxWJP z$na+TuNQs>uo6EHhy24l1YE%9RG=)LVf|k;^>Vag09kiHW(Q;s`GxNO{imEDP{u0T zPxx<@@Bo^1<Apx(#uWu4nwZOSCH( zw%Bf+>I9Ge?y2~z646*douE%SD#HKSP-O6X{eSb{MhlHS?(_Knz7ilUAKdW(Nnoi)CYaw#81v=B?Uyp7S!d z6Z5YH1##Kg*_<<}Y=H8T?ju%{ZnM|G_+{$u?k>T0s`!xPQoM$-Ev&|VO@Wn-ZQEW9 zDyH?D*78lq&kS={-Z;?s>)xc&mjV`zBEGhJR79@V2VHAb6FS@3sSJ0e-xeGOMa!+{ z>OO~6n2$dcT#HwQC)L3fzqa))_uj|~>IF2+R7%@$5I!eT=;8GY`-i7=KMsJ9i?_fC zNb_-+%jGE#_i;RW-#?UwYLeku-Jd4R-+)Ivw6qWCf0b~BHfYI!SZ1ewuZh=T{dw(L zqGsFG5-H2s1~&@_$L^u;Q(XDa*pp|n;+HXFV`JT8Usa6(K||f6Wk90qaPFb?=Rs)( z8v87aarC#F&KH{jq3`ti;>d6vGx0skK~JwBG&P5#C*_IN2&Nd(&Qyhog|R1q0LwF- z0rW>7@LiH%u5qa^*#!lF=omsJ0Xi*ImOi+cT0*c1$TDFJWIrm`Z%3^?`Kh@E=(6J| ztRZyE4RT0p4&LD?qA|SJ0B)BA7j@6OZF9_pAQaq)-yYyy^r|<}-vIzD{XiGZpYEdy zA6ONlyZ)l`ji?Y=d~#$WV&NRgYP8g9g1Sx!%SsQh=KWqVb_w{Hq154pIKXm0m|-nmAs=~zd)crDmOJ90fVp&b^y1($kKSe2D1NB*a*h(W+H(w z8_7_8c&=nA?LNS56@EwX#6$2`i!xB{o6kL!zn=$XJ;0LiE~M%9a(iuDT{nSMHLn{m z&wMK?&9hwqxFwW~W&nvgyxcD71G;1Zf8%}|mi_GobbG~)J^ldBNgaMCRNmONjp^dC zZ4G=HarvL9!mn%-RCUTMei7oaYoQwl{Gs@}19(cPHq0hL@9c$APUeRyBXKco z#gM0(h5Bnv7waj;n=rPOwW2rN@4& zJ%C+4EA#>cr>j5s7sAgy06cQZ^B!wE3W-)G2Xq5pLNvz#l?org7d1wxKud)11Wvyi zARCC_sZp@i|GMj|4-k<-k5;~&&De-voRoMMC79>GIS0_yTsYfxiG(r&i7~W1iQu3A zMZZ-!oun*W=Y>=7E6FPJ^DX7wzK3|;+pYc&rTR0T&mvNcs9>g@3KeCQU?%EQLujQG@Ouhk}KfX?!1C9{=&kbx>n36ym%*RoI3zj?1#yF*5{;j2?->7 zz7Qg9$2s%X*t!GM`sP?dv&}qtl%NS)ldeF)fx<_ItpudFh%?Lb*;mPq(RkqzE?$eg zd+}i7mL`=Eg6DYD_;AP+H!?^mME7P(ec&_X`R~X;^Z}rI=|WHbOX~vUYwrc zdrM>S(`ZaB-Of?@qDj#Eq3`HeuM9^92n%E{<9GXQ)WwskLO9w%cZIT~52@_Go^Tb4^fRk^Y^@dE)VE+GWe2-e;rFKVzhj^0ot<{Dt0DF6^+fg zhl7K&WVc#|i9X?i9N~YT61D{gDhqX+#SE|o^XME<6Z~hM5RF}4y3Nrc1W@(Th<(h% z_T4Hi66W=~K1a7`R43oiYY{kWX!xFj{IL#OHA<4z8Iyfk<@84b)UY#rSQ0k7GQ*Qd z3F1OQ7rCGAaVRgUUawPjMiYMpr;^GIIxrhisWIee6e=`JX|jh6-RWaZ$!-BcWDA$X z<Y0DOjV zc~#XLwuaJ7DM2eUGYp#P;o&T#)>cr&qTR>xZ8*q|I5NcQLu*e84HxX-NvASn*J%*& z@F>R$Mvn4v)G=$J4>#-AJ5iQF#iK41roqRD@i$*Y4D1za*B?6?*|K$AZ{SO}$WDJG z$7$WePorKr8NNX1+*k9_qZIF)X`j0W$gzNQ;TwR$7+bj;mb6<-P~W=2e@xSk#w{)s z*}*R)T#8!^{pj{%bJ!;mfosAOOw9NW75ShZ5ThTbZguNgSrv)gT_4pUp{9X;nVx|L z*iZ1WSI+rQbSZ$&vRzs*}H3MLh@suHTE)Y9-UsKOlh z`1ysEOT2R|70iAcT zWnR1?d`d?-a%CtbFRa%wW9xXS8JIv%YS(atrn4aI0t>gzaIrpfC*xd#9e#As^APKF zP7xgb;RfaJoNAw2=x2t_uIqGqkwR(ML@E94u1LKQEWpZ4F}y8`5>BD#_D$*QNq?q# zX83x}q_O<iw*LKK+kkFj|6`P><-0y;zGl;;+!Z9)p&*?h{_4 zI_B5)_j?IP`;5O&72StS%E*~ykzxExjRd5|LPQSPwkl&Us8Q}Y0*u)3ZZDxk01yKC z-%aYpM~2}rimpB#(u{NpMSFdPBF z*?ff0_$k#c3d>Ri{1_abfKQ04udlD4pI<;gKww~C zP*6~Kcz8raL{wB%e0+RjVq$V~a%yU7T3T9qdU|GNW_EUVUS3{)etub5Sw%%fO-)UG zeSLFtb6ZbJcW-a+gb5QSPMkP*?%ZX|maST~YR#H8+qZAuv17;1ojZ5! z+I8f}kuzt`T)1%I(xppRu3Wi#_3HKO*Kggrb^G@1$B!RBd-m+*%a?E7ym|NT-TU|N zKYsl9>C>k#XU=^2^5yH-uiw9a|M~OhuV24@|Ni~w&!4}4|Ni^;@Bjb*+E>r2F)%R3 zd%8G=RLpsM%QGm%QKI#tdvYgllb3P_?>3L+3bs+#_W$>7JY4lr;(^ZI=RWVa_MJG< z^XApRbB)_doZA1-zo6IvMh603=Y;a_{^*vI%_-pA6?4rXboY8Mjd<>Pl905HnPxHJ+t?641# z8t76i2Pvw~l#orsU$Tcc?pLa87lCCxnzm4C?Eaut+!-FAWKS`u>-WEeTM`Tu=Ly9> z6IHp3uuu|jU3$h8sD;^^%MJpI!C{}E-dRftO)I7l zv}hWw8z+yi_=$6r6A0?Ipcy6NTjYfZ<^zvDN20CWR*!z5fioM)o?e*LMAMqkgKm)> z1A9?bzKyU}UG?Tko}wm7mQ8AR(a1pPLKp5oh%SD$(rG9+YtK?0O>MZrODeN#_U_Ks zZ14|>dS_OCyTF%dcn6#)FEv))Z-HT`Lvy@BpSY()&t_Ejl8?=StS6o0aqA2l-v0ka07D)~`JSRpq(YNe52HC}e8r6oe6BvSB#G&s0aZG=y77P8qP zi!e_H8P)i2TKe{#yKUt$JRniy6mYz?04v+CnikzA6>O#aOG6H>K{Q;wfl+7ua1*=B zJ6#qZs){u>sCbK1>y3iOB0v2i&wR`*2+sIO)MeRcQzrD{${)Kt<-Uw_I(hz-UDUI4 z;2E9X8P%sORq}rhK7P3js^%bpoG}q2uKcKz;SV3fgnsvxELtO24JAj?YH$KBMn#6y zr1^KYz&L^V8*9sKl&j+N`~dxY$@%6Pp72#V-HU^p@Cv1$f+0k3p8~L?-*G&ku_fM>%x$UX=>;gV_E!N$A%Gu7?(GJW5i_^;>ekY z*RlDrb_mfohoJEQ0YPE0y{i1;W`I1ebXb6E`!~kFX>1OKvThxDeDkkPJ|(*G=_*PP z@b%emhZM;O3v+F-2};}P?2cSLjiBkiN7#Y_KNNMS5>BT!hOR8;XkWR8L>imLuI^h~ zVy0OpOH3>?CMRj@D;)NCXO?4~pOZ2q&NSl72X+TxDGy<>U741Y_t7E->l1nj%^6KF4(Bf`V7M(+J+YM}cv;R+T$h zr7KU@J*-kX+W$`r{_>&@>ItXfz|nHU^?_(c53U1!5EAm*W-MfDb3O9r?hq=8Rg>2LIjF$ikisi`t+jEt7mzFgb6y1Gi^e=3=Tv$28? zLr|N~r<~UkP1XLMzks0ZPQ8#FvHd0IgK4d)j)WVRxJyfu{(-4FCvW{_P+ zU40HJDXlU$YBy0s&Nw<|+gOMV0DG;Vs8y~Hl^9;ZyjNGH>q^vfKX1F7LylQ_Mp~k^ zrN!W*c5$ZfM12w*GwzGpZ{YXZe2YBf%s>LStI^-7C*3P5B0_tWv>P+`qb+1_B)vUD zK~b?&ASNtKucV}e)}3#Nd9}hEuJ`OI1b;kM=}JQCH>0*xBIl@`5V`s&&LpI2P!B-* zN4UUV4u|qyxQ*aTp-pz@ABRA2_;}o@P)&mXs=_p#e^x%K5xn8fSX*YHTaqOic;sdD8-#F0KY&+3Xzfp((5ZQr*%%b~vsYy_%_O`*<>E=&J+Ex*qs)Lt-y znmFok+${Nj?9U>sB0he!GK*sPz4I&0=FY-)$3?eunu==k`5TmN<7|KY$3a-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Army,,A,1288440000,[implementation],PROGRAMMING 38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Chess,,B,1288440000,"[brute force, implementation, math]",PROGRAMMING 38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Blinds,,C,1288440000,[brute force],PROGRAMMING @@ -161,26 +183,57 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Smart Boy,,F,1288440000,"[dp, games, strings]",PROGRAMMING 38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Queue,,G,1288440000,[data structures],PROGRAMMING 38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,The Great Marathon,,H,1288440000,[dp],PROGRAMMING -40,Codeforces Beta Round #39,12,Find Color,500.0,A,1288972800,"[constructive algorithms, implementation, math]",PROGRAMMING -40,Codeforces Beta Round #39,12,Repaintings,1000.0,B,1288972800,[math],PROGRAMMING -40,Codeforces Beta Round #39,12,Berland Square,1500.0,C,1288972800,[math],PROGRAMMING -40,Codeforces Beta Round #39,12,Interesting Sequence,2000.0,D,1288972800,[math],PROGRAMMING -40,Codeforces Beta Round #39,12,Number Table,2500.0,E,1288972800,[combinatorics],PROGRAMMING -41,Codeforces Beta Round #40 (Div. 2),2,Translation,500.0,A,1289232000,"[implementation, strings]",PROGRAMMING -41,Codeforces Beta Round #40 (Div. 2),2,Martian Dollar,1000.0,B,1289232000,[brute force],PROGRAMMING -41,Codeforces Beta Round #40 (Div. 2),2,Email address,1500.0,C,1289232000,"[expression parsing, implementation]",PROGRAMMING -41,Codeforces Beta Round #40 (Div. 2),2,Pawn,2000.0,D,1289232000,[dp],PROGRAMMING -41,Codeforces Beta Round #40 (Div. 2),2,3-cycles,2500.0,E,1289232000,"[constructive algorithms, graphs, greedy]",PROGRAMMING -42,Codeforces Beta Round #41,12,Guilty --- to the kitchen!,500.0,A,1290096000,"[greedy, implementation]",PROGRAMMING -42,Codeforces Beta Round #41,12,Game of chess unfinished,1000.0,B,1290096000,[implementation],PROGRAMMING -42,Codeforces Beta Round #41,12,Safe cracking,1500.0,C,1290096000,"[brute force, constructive algorithms]",PROGRAMMING -42,Codeforces Beta Round #41,12,Strange town,2000.0,D,1290096000,"[constructive algorithms, math]",PROGRAMMING -42,Codeforces Beta Round #41,12,Baldman and the military,2500.0,E,1290096000,"[dfs and similar, graphs]",PROGRAMMING -43,Codeforces Beta Round #42 (Div. 2),2,Football,500.0,A,1291046400,[strings],PROGRAMMING -43,Codeforces Beta Round #42 (Div. 2),2,Letter,1000.0,B,1291046400,"[implementation, strings]",PROGRAMMING -43,Codeforces Beta Round #42 (Div. 2),2,Lucky Tickets,1500.0,C,1291046400,[greedy],PROGRAMMING -43,Codeforces Beta Round #42 (Div. 2),2,Journey,2000.0,D,1291046400,"[brute force, constructive algorithms, implementation]",PROGRAMMING -43,Codeforces Beta Round #42 (Div. 2),2,Race,2500.0,E,1291046400,"[brute force, implementation, two pointers]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,C*++ Calculations,,A,1287904200,"[expression parsing, greedy]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Company Income Growth,,B,1287904200,[greedy],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Moon Craters,,C,1287904200,"[dp, sortings]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Cubical Planet,,D,1287904200,[math],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,What Has Dirichlet Got to Do with That?,,E,1287904200,"[dp, games]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Pacifist frogs,,F,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Inverse Function,,G,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Multiplication Table,,H,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Tram,,I,1287904200,[],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Spelling Check,,J,1287904200,"[hashing, implementation, strings]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Testing,,K,1287904200,[],PROGRAMMING +40,Codeforces Beta Round #39,12,Find Color,500,A,1288972800,"[constructive algorithms, implementation, math]",PROGRAMMING +40,Codeforces Beta Round #39,12,Repaintings,1000,B,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Berland Square,1500,C,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Interesting Sequence,2000,D,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Number Table,2500,E,1288972800,[combinatorics],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Translation,500,A,1289232000,"[implementation, strings]",PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Martian Dollar,1000,B,1289232000,[brute force],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Email address,1500,C,1289232000,"[expression parsing, implementation]",PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Pawn,2000,D,1289232000,[dp],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,3-cycles,2500,E,1289232000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +42,Codeforces Beta Round #41,12,Guilty --- to the kitchen!,500,A,1290096000,"[greedy, implementation]",PROGRAMMING +42,Codeforces Beta Round #41,12,Game of chess unfinished,1000,B,1290096000,[implementation],PROGRAMMING +42,Codeforces Beta Round #41,12,Safe cracking,1500,C,1290096000,"[brute force, constructive algorithms]",PROGRAMMING +42,Codeforces Beta Round #41,12,Strange town,2000,D,1290096000,"[constructive algorithms, math]",PROGRAMMING +42,Codeforces Beta Round #41,12,Baldman and the military,2500,E,1290096000,"[dfs and similar, graphs]",PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Football,500,A,1291046400,[strings],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Letter,1000,B,1291046400,"[implementation, strings]",PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Lucky Tickets,1500,C,1291046400,[greedy],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Journey,2000,D,1291046400,"[brute force, constructive algorithms, implementation]",PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Race,2500,E,1291046400,"[brute force, implementation, two pointers]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Indian Summer,,A,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Cola,,B,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Holidays,,C,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Hyperdrive,,D,1289041200,[math],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Anfisa the Monkey,,E,1289041200,[dp],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,BerPaint,,F,1289041200,"[geometry, graphs]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Shooting Gallery,,G,1289041200,"[data structures, implementation]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Phone Number,,H,1289041200,[dp],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Toys,,I,1289041200,"[brute force, combinatorics]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Triminoes,,J,1289041200,"[constructive algorithms, greedy]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Codecraft III,,A,1289646000,[implementation],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,School,,B,1289646000,"[dp, dsu]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Dancing Lessons,,C,1289646000,[data structures],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Event Dates,,D,1289646000,"[greedy, meet-in-the-middle, sortings]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Director,,E,1289646000,"[constructive algorithms, greedy]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Goats and Wolves,,F,1289646000,[greedy],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Prime Problem,,G,1289646000,[number theory],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Road Problem,,H,1289646000,[graphs],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,TCMCF+++,,I,1289646000,[greedy],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Planting Trees,,J,1289646000,[constructive algorithms],PROGRAMMING 46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Ball Game,,A,1291536000,"[brute force, implementation]",PROGRAMMING 46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,T-shirts from Sponsor,,B,1291536000,[implementation],PROGRAMMING 46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hamsters and Tigers,,C,1291536000,[two pointers],PROGRAMMING @@ -188,11 +241,11 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Comb,,E,1291536000,"[data structures, dp]",PROGRAMMING 46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hercule Poirot Problem,,F,1291536000,"[dsu, graphs]",PROGRAMMING 46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Emperor's Problem,,G,1291536000,[geometry],PROGRAMMING -47,Codeforces Beta Round #44 (Div. 2),2,Triangular numbers,500.0,A,1291737600,"[brute force, math]",PROGRAMMING -47,Codeforces Beta Round #44 (Div. 2),2,Coins,1000.0,B,1291737600,[implementation],PROGRAMMING -47,Codeforces Beta Round #44 (Div. 2),2,Crossword,1500.0,C,1291737600,[implementation],PROGRAMMING -47,Codeforces Beta Round #44 (Div. 2),2,Safe,2000.0,D,1291737600,[brute force],PROGRAMMING -47,Codeforces Beta Round #44 (Div. 2),2,Cannon,2500.0,E,1291737600,"[data structures, geometry, sortings]",PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Triangular numbers,500,A,1291737600,"[brute force, math]",PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Coins,1000,B,1291737600,[implementation],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Crossword,1500,C,1291737600,[implementation],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Safe,2000,D,1291737600,[brute force],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Cannon,2500,E,1291737600,"[data structures, geometry, sortings]",PROGRAMMING 48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Rock-paper-scissors,,A,1292140800,"[implementation, schedules]",PROGRAMMING 48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Land Lot,,B,1292140800,"[brute force, implementation]",PROGRAMMING 48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,The Race,,C,1292140800,[math],PROGRAMMING @@ -201,2616 +254,6376 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Snow sellers,,F,1292140800,"[greedy, sortings]",PROGRAMMING 48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Galaxy Union,,G,1292140800,"[dp, trees, two pointers]",PROGRAMMING 48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Black and White,,H,1292140800,[constructive algorithms],PROGRAMMING -49,Codeforces Beta Round #46 (Div. 2),2,Sleuth,500.0,A,1292601600,[implementation],PROGRAMMING -49,Codeforces Beta Round #46 (Div. 2),2,Sum,1000.0,B,1292601600,[math],PROGRAMMING -49,Codeforces Beta Round #46 (Div. 2),2,Disposition,1500.0,C,1292601600,"[constructive algorithms, math]",PROGRAMMING -49,Codeforces Beta Round #46 (Div. 2),2,Game,2000.0,D,1292601600,"[brute force, dp, implementation]",PROGRAMMING -49,Codeforces Beta Round #46 (Div. 2),2,Common ancestor,2500.0,E,1292601600,[dp],PROGRAMMING -51,Codeforces Beta Round #48,12,Cheaterius's Problem,500.0,A,1293552000,[implementation],PROGRAMMING -51,Codeforces Beta Round #48,12,bHTML Tables Analisys,1000.0,B,1293552000,[expression parsing],PROGRAMMING -51,Codeforces Beta Round #48,12,Three Base Stations,1500.0,C,1293552000,"[binary search, greedy]",PROGRAMMING -51,Codeforces Beta Round #48,12,Geometrical problem,2000.0,D,1293552000,[implementation],PROGRAMMING -51,Codeforces Beta Round #48,12,Pentagon,2500.0,E,1293552000,"[combinatorics, graphs, matrices]",PROGRAMMING -51,Codeforces Beta Round #48,12,Caterpillar,3000.0,F,1293552000,"[dfs and similar, dp, graphs, trees]",PROGRAMMING -53,Codeforces Beta Round #49 (Div. 2),2,Autocomplete,500.0,A,1294329600,[implementation],PROGRAMMING -53,Codeforces Beta Round #49 (Div. 2),2,Blog Photo,1000.0,B,1294329600,"[binary search, implementation]",PROGRAMMING -53,Codeforces Beta Round #49 (Div. 2),2,Little Frog,1500.0,C,1294329600,[constructive algorithms],PROGRAMMING -53,Codeforces Beta Round #49 (Div. 2),2,Physical Education,2000.0,D,1294329600,[sortings],PROGRAMMING -53,Codeforces Beta Round #49 (Div. 2),2,Dead Ends,2500.0,E,1294329600,"[bitmasks, dp]",PROGRAMMING -54,Codeforces Beta Round #50,12,Presents,500.0,A,1294733700,[implementation],PROGRAMMING -54,Codeforces Beta Round #50,12,Cutting Jigsaw Puzzle,1000.0,B,1294733700,"[hashing, implementation]",PROGRAMMING -54,Codeforces Beta Round #50,12,First Digit Law,1500.0,C,1294733700,"[dp, math, probabilities]",PROGRAMMING -54,Codeforces Beta Round #50,12,Writing a Song,2000.0,D,1294733700,"[brute force, dp]",PROGRAMMING -54,Codeforces Beta Round #50,12,Vacuum Сleaner,2500.0,E,1294733700,[geometry],PROGRAMMING -55,Codeforces Beta Round #51,12,Flea travel,500.0,A,1294992000,"[implementation, math]",PROGRAMMING -55,Codeforces Beta Round #51,12,Smallest number,1000.0,B,1294992000,[brute force],PROGRAMMING -55,Codeforces Beta Round #51,12,Pie or die,1500.0,C,1294992000,[games],PROGRAMMING -55,Codeforces Beta Round #51,12,Beautiful numbers,2000.0,D,1294992000,"[dp, number theory]",PROGRAMMING -55,Codeforces Beta Round #51,12,Very simple problem,2500.0,E,1294992000,"[geometry, two pointers]",PROGRAMMING -56,Codeforces Beta Round #52 (Div. 2),2,Bar,500.0,A,1295626200,[implementation],PROGRAMMING -56,Codeforces Beta Round #52 (Div. 2),2,Spoilt Permutation,1000.0,B,1295626200,[implementation],PROGRAMMING -56,Codeforces Beta Round #52 (Div. 2),2,Corporation Mail,1500.0,C,1295626200,"[data structures, expression parsing, implementation]",PROGRAMMING -56,Codeforces Beta Round #52 (Div. 2),2,Changing a String,2000.0,D,1295626200,[dp],PROGRAMMING -56,Codeforces Beta Round #52 (Div. 2),2,Domino Principle,2500.0,E,1295626200,"[binary search, data structures, sortings]",PROGRAMMING -57,Codeforces Beta Round #53,12,Square Earth?,500.0,A,1295971200,"[dfs and similar, greedy, implementation]",PROGRAMMING -57,Codeforces Beta Round #53,12,Martian Architecture,1000.0,B,1295971200,[implementation],PROGRAMMING -57,Codeforces Beta Round #53,12,Array,1500.0,C,1295971200,"[combinatorics, math]",PROGRAMMING -57,Codeforces Beta Round #53,12,Journey,2000.0,D,1295971200,"[dp, math]",PROGRAMMING -57,Codeforces Beta Round #53,12,Chess,2500.0,E,1295971200,"[math, shortest paths]",PROGRAMMING -58,Codeforces Beta Round #54 (Div. 2),2,Chat room,500.0,A,1296489600,"[greedy, strings]",PROGRAMMING -58,Codeforces Beta Round #54 (Div. 2),2,Coins,1000.0,B,1296489600,[greedy],PROGRAMMING -58,Codeforces Beta Round #54 (Div. 2),2,Trees,1500.0,C,1296489600,[brute force],PROGRAMMING -58,Codeforces Beta Round #54 (Div. 2),2,Calendar,2000.0,D,1296489600,"[greedy, strings]",PROGRAMMING -58,Codeforces Beta Round #54 (Div. 2),2,Expression,2500.0,E,1296489600,[dp],PROGRAMMING -59,Codeforces Beta Round #55 (Div. 2),2,Word,500.0,A,1297440000,"[implementation, strings]",PROGRAMMING -59,Codeforces Beta Round #55 (Div. 2),2,Fortune Telling,1000.0,B,1297440000,"[implementation, number theory]",PROGRAMMING -59,Codeforces Beta Round #55 (Div. 2),2,Title,1500.0,C,1297440000,[expression parsing],PROGRAMMING -59,Codeforces Beta Round #55 (Div. 2),2,Team Arrangement,2000.0,D,1297440000,"[constructive algorithms, greedy, implementation]",PROGRAMMING -59,Codeforces Beta Round #55 (Div. 2),2,Shortest Path,2500.0,E,1297440000,"[graphs, shortest paths]",PROGRAMMING -60,Codeforces Beta Round #56,12,Where Are My Flakes?,500.0,A,1298131200,"[implementation, two pointers]",PROGRAMMING -60,Codeforces Beta Round #56,12,Serial Time!,1000.0,B,1298131200,"[dfs and similar, dsu]",PROGRAMMING -60,Codeforces Beta Round #56,12,Mushroom Strife,1500.0,C,1298131200,"[brute force, dfs and similar]",PROGRAMMING -60,Codeforces Beta Round #56,12,Savior,2000.0,D,1298131200,"[brute force, dsu, math]",PROGRAMMING -60,Codeforces Beta Round #56,12,Mushroom Gnomes,2500.0,E,1298131200,"[math, matrices]",PROGRAMMING -61,Codeforces Beta Round #57 (Div. 2),2,Ultra-Fast Mathematician,500.0,A,1298390400,[implementation],PROGRAMMING -61,Codeforces Beta Round #57 (Div. 2),2,Hard Work,1000.0,B,1298390400,[strings],PROGRAMMING -61,Codeforces Beta Round #57 (Div. 2),2,Capture Valerian,1500.0,C,1298390400,[math],PROGRAMMING -61,Codeforces Beta Round #57 (Div. 2),2,Eternal Victory,2000.0,D,1298390400,"[dfs and similar, graphs, greedy, shortest paths, trees]",PROGRAMMING -61,Codeforces Beta Round #57 (Div. 2),2,Enemy is weak,2500.0,E,1298390400,"[data structures, trees]",PROGRAMMING -62,Codeforces Beta Round #58,12,A Student's Dream,500.0,A,1298649600,"[greedy, math]",PROGRAMMING -62,Codeforces Beta Round #58,12,Tyndex.Brome,1000.0,B,1298649600,"[binary search, implementation]",PROGRAMMING -62,Codeforces Beta Round #58,12,Inquisition,1500.0,C,1298649600,"[geometry, implementation, sortings]",PROGRAMMING -62,Codeforces Beta Round #58,12,Wormhouse,2000.0,D,1298649600,"[dfs and similar, graphs]",PROGRAMMING -62,Codeforces Beta Round #58,12,World Evil,2500.0,E,1298649600,"[dp, flows]",PROGRAMMING -63,Codeforces Beta Round #59 (Div. 2),2,Sinking Ship,500.0,A,1298908800,"[implementation, sortings, strings]",PROGRAMMING -63,Codeforces Beta Round #59 (Div. 2),2,Settlers' Training,1000.0,B,1298908800,[implementation],PROGRAMMING -63,Codeforces Beta Round #59 (Div. 2),2,Bulls and Cows,1500.0,C,1298908800,"[brute force, implementation]",PROGRAMMING -63,Codeforces Beta Round #59 (Div. 2),2,Dividing Island,2000.0,D,1298908800,[constructive algorithms],PROGRAMMING -63,Codeforces Beta Round #59 (Div. 2),2,Sweets Game,2500.0,E,1298908800,"[bitmasks, dfs and similar, dp, games, implementation]",PROGRAMMING -65,Codeforces Beta Round #60,12,Harry Potter and Three Spells,500.0,A,1299340800,"[implementation, math]",PROGRAMMING -65,Codeforces Beta Round #60,12,Harry Potter and the History of Magic,1000.0,B,1299340800,"[brute force, greedy, implementation]",PROGRAMMING -65,Codeforces Beta Round #60,12,Harry Potter and the Golden Snitch,1500.0,C,1299340800,"[binary search, geometry]",PROGRAMMING -65,Codeforces Beta Round #60,12,Harry Potter and the Sorting Hat,2000.0,D,1299340800,"[brute force, dfs and similar, hashing]",PROGRAMMING -65,Codeforces Beta Round #60,12,Harry Potter and Moving Staircases,2500.0,E,1299340800,"[dfs and similar, implementation]",PROGRAMMING -66,Codeforces Beta Round #61 (Div. 2),2,Petya and Java,500.0,A,1299513600,"[implementation, strings]",PROGRAMMING -66,Codeforces Beta Round #61 (Div. 2),2,Petya and Countryside,1000.0,B,1299513600,"[brute force, implementation]",PROGRAMMING -66,Codeforces Beta Round #61 (Div. 2),2,Petya and File System,1500.0,C,1299513600,"[data structures, implementation]",PROGRAMMING -66,Codeforces Beta Round #61 (Div. 2),2,Petya and His Friends,2000.0,D,1299513600,"[constructive algorithms, math, number theory]",PROGRAMMING -66,Codeforces Beta Round #61 (Div. 2),2,Petya and Post,2500.0,E,1299513600,"[data structures, dp]",PROGRAMMING -67,Manthan 2011,12,Partial Teacher,500.0,A,1300033800,"[dp, graphs, greedy, implementation]",PROGRAMMING -67,Manthan 2011,12,Restoration of the Permutation,1000.0,B,1300033800,[greedy],PROGRAMMING -67,Manthan 2011,12,Sequence of Balls,1500.0,C,1300033800,[dp],PROGRAMMING -67,Manthan 2011,12,Optical Experiment,2000.0,D,1300033800,"[binary search, data structures, dp]",PROGRAMMING -67,Manthan 2011,12,Save the City!,2500.0,E,1300033800,[geometry],PROGRAMMING -68,Codeforces Beta Round #62,12,Irrational problem,500.0,A,1300464000,"[implementation, number theory]",PROGRAMMING -68,Codeforces Beta Round #62,12,Energy exchange,1000.0,B,1300464000,[binary search],PROGRAMMING -68,Codeforces Beta Round #62,12,Synchrophasotron,1500.0,C,1300464000,[brute force],PROGRAMMING -68,Codeforces Beta Round #62,12,Half-decay tree,2000.0,D,1300464000,"[data structures, divide and conquer, dp, probabilities]",PROGRAMMING -68,Codeforces Beta Round #62,12,Contact,2500.0,E,1300464000,[geometry],PROGRAMMING -69,Codeforces Beta Round #63 (Div. 2),2,Young Physicist,500.0,A,1300809600,"[implementation, math]",PROGRAMMING -69,Codeforces Beta Round #63 (Div. 2),2,Bets,1000.0,B,1300809600,"[greedy, implementation]",PROGRAMMING -69,Codeforces Beta Round #63 (Div. 2),2,Game,1500.0,C,1300809600,[implementation],PROGRAMMING -69,Codeforces Beta Round #63 (Div. 2),2,Dot,2000.0,D,1300809600,"[dp, games]",PROGRAMMING -69,Codeforces Beta Round #63 (Div. 2),2,Subsegments,2500.0,E,1300809600,"[data structures, implementation]",PROGRAMMING -70,Codeforces Beta Round #64,12,Cookies,500.0,A,1301155200,[math],PROGRAMMING -70,Codeforces Beta Round #64,12,Text Messaging,1000.0,B,1301155200,"[expression parsing, greedy, strings]",PROGRAMMING -70,Codeforces Beta Round #64,12,Lucky Tickets,1500.0,C,1301155200,"[binary search, data structures, sortings, two pointers]",PROGRAMMING -70,Codeforces Beta Round #64,12,Professor's task,2000.0,D,1301155200,"[data structures, geometry]",PROGRAMMING -70,Codeforces Beta Round #64,12,Information Reform,2500.0,E,1301155200,"[dp, implementation, trees]",PROGRAMMING -71,Codeforces Beta Round #65 (Div. 2),2,Way Too Long Words,500.0,A,1301410800,[strings],PROGRAMMING -71,Codeforces Beta Round #65 (Div. 2),2,Progress Bar,1000.0,B,1301410800,"[implementation, math]",PROGRAMMING -71,Codeforces Beta Round #65 (Div. 2),2,Round Table Knights,1500.0,C,1301410800,"[dp, math, number theory]",PROGRAMMING -71,Codeforces Beta Round #65 (Div. 2),2,Solitaire,2000.0,D,1301410800,"[brute force, implementation]",PROGRAMMING -71,Codeforces Beta Round #65 (Div. 2),2,Nuclear Fusion,2500.0,E,1301410800,"[bitmasks, dp]",PROGRAMMING -73,Codeforces Beta Round #66,12,The Elder Trolls IV: Oblivon,500.0,A,1302422400,"[greedy, math]",PROGRAMMING -73,Codeforces Beta Round #66,12,Need For Brake,1000.0,B,1302422400,"[binary search, greedy, sortings]",PROGRAMMING -73,Codeforces Beta Round #66,12,LionAge II,1000.0,C,1302422400,[dp],PROGRAMMING -73,Codeforces Beta Round #66,12,FreeDiv,1500.0,D,1302422400,"[dfs and similar, graphs, greedy]",PROGRAMMING -73,Codeforces Beta Round #66,12,Morrowindows,1500.0,E,1302422400,"[math, number theory]",PROGRAMMING -73,Codeforces Beta Round #66,12,Plane of Tanks,2000.0,F,1302422400,"[brute force, geometry]",PROGRAMMING -74,Codeforces Beta Round #68,12,Room Leader,500.0,A,1302879600,[implementation],PROGRAMMING -74,Codeforces Beta Round #68,12,Train,1000.0,B,1302879600,"[dp, games, greedy]",PROGRAMMING -74,Codeforces Beta Round #68,12,Chessboard Billiard,1500.0,C,1302879600,"[dfs and similar, dsu, graphs, number theory]",PROGRAMMING -74,Codeforces Beta Round #68,12,Hanger,2000.0,D,1302879600,[data structures],PROGRAMMING -74,Codeforces Beta Round #68,12,Shift It!,2500.0,E,1302879600,[constructive algorithms],PROGRAMMING -75,Codeforces Beta Round #67 (Div. 2),2,Life Without Zeros,500.0,A,1302706800,[implementation],PROGRAMMING -75,Codeforces Beta Round #67 (Div. 2),2,Facetook Priority Wall,1000.0,B,1302706800,"[expression parsing, implementation, strings]",PROGRAMMING -75,Codeforces Beta Round #67 (Div. 2),2,Modified GCD,1500.0,C,1302706800,"[binary search, number theory]",PROGRAMMING -75,Codeforces Beta Round #67 (Div. 2),2,Big Maximum Sum,2000.0,D,1302706800,"[data structures, dp, greedy, implementation, math, trees]",PROGRAMMING -75,Codeforces Beta Round #67 (Div. 2),2,Ship's Shortest Path,2500.0,E,1302706800,"[geometry, shortest paths]",PROGRAMMING -77,Codeforces Beta Round #69 (Div. 1 Only),1,Heroes,500.0,A,1303226100,"[brute force, implementation]",PROGRAMMING -77,Codeforces Beta Round #69 (Div. 1 Only),1,Falling Anvils,1000.0,B,1303226100,"[math, probabilities]",PROGRAMMING -77,Codeforces Beta Round #69 (Div. 1 Only),1,Beavermuncher-0xFF,1500.0,C,1303226100,"[dfs and similar, dp, dsu, greedy, trees]",PROGRAMMING -77,Codeforces Beta Round #69 (Div. 1 Only),1,Domino Carpet,2000.0,D,1303226100,"[dp, implementation]",PROGRAMMING -77,Codeforces Beta Round #69 (Div. 1 Only),1,Martian Food,2000.0,E,1303226100,[geometry],PROGRAMMING -78,Codeforces Beta Round #70 (Div. 2),2,Haiku,500.0,A,1303916400,"[implementation, strings]",PROGRAMMING -78,Codeforces Beta Round #70 (Div. 2),2,Easter Eggs,1000.0,B,1303916400,"[constructive algorithms, implementation]",PROGRAMMING -78,Codeforces Beta Round #70 (Div. 2),2,Beaver Game,1500.0,C,1303916400,"[dp, games, number theory]",PROGRAMMING -78,Codeforces Beta Round #70 (Div. 2),2,Archer's Shot,2000.0,D,1303916400,"[binary search, geometry, math, two pointers]",PROGRAMMING -78,Codeforces Beta Round #70 (Div. 2),2,Evacuation,2500.0,E,1303916400,"[flows, graphs, shortest paths]",PROGRAMMING -79,Codeforces Beta Round #71,12,Bus Game,500.0,A,1304175600,[greedy],PROGRAMMING -79,Codeforces Beta Round #71,12,Colorful Field,1000.0,B,1304175600,"[implementation, sortings]",PROGRAMMING -79,Codeforces Beta Round #71,12,Beaver,1500.0,C,1304175600,"[data structures, dp, greedy, hashing, strings, two pointers]",PROGRAMMING -79,Codeforces Beta Round #71,12,Password,2000.0,D,1304175600,"[bitmasks, dp, shortest paths]",PROGRAMMING -79,Codeforces Beta Round #71,12,Security System,2500.0,E,1304175600,[math],PROGRAMMING -80,Codeforces Beta Round #69 (Div. 2 Only),2,Panoramix's Prediction,500.0,A,1303226100,[brute force],PROGRAMMING -80,Codeforces Beta Round #69 (Div. 2 Only),2,Depression,1000.0,B,1303226100,"[geometry, math]",PROGRAMMING -80,Codeforces Beta Round #69 (Div. 2 Only),2,Heroes,1500.0,C,1303226100,"[brute force, implementation]",PROGRAMMING -80,Codeforces Beta Round #69 (Div. 2 Only),2,Falling Anvils,2000.0,D,1303226100,"[geometry, probabilities]",PROGRAMMING -80,Codeforces Beta Round #69 (Div. 2 Only),2,Beavermuncher-0xFF,2500.0,E,1303226100,[],PROGRAMMING -81,Yandex.Algorithm Open 2011
Qualification 1,12,Plug-in,500.0,A,1304485200,[implementation],PROGRAMMING -81,Yandex.Algorithm Open 2011
Qualification 1,12,Sequence Formatting,1000.0,B,1304485200,"[implementation, strings]",PROGRAMMING -81,Yandex.Algorithm Open 2011
Qualification 1,12,Average Score,1500.0,C,1304485200,"[math, sortings]",PROGRAMMING -81,Yandex.Algorithm Open 2011
Qualification 1,12,Polycarp's Picture Gallery,2000.0,D,1304485200,"[constructive algorithms, greedy]",PROGRAMMING -81,Yandex.Algorithm Open 2011
Qualification 1,12,Pairs,2500.0,E,1304485200,"[dfs and similar, dp, dsu, graphs, implementation, trees]",PROGRAMMING -82,Yandex.Algorithm 2011
Qualification 2,12,Double Cola,500.0,A,1304694000,"[implementation, math]",PROGRAMMING -82,Yandex.Algorithm 2011
Qualification 2,12,Sets,1000.0,B,1304694000,"[constructive algorithms, hashing, implementation]",PROGRAMMING -82,Yandex.Algorithm 2011
Qualification 2,12,General Mobilization,1500.0,C,1304694000,"[data structures, dfs and similar, sortings]",PROGRAMMING -82,Yandex.Algorithm 2011
Qualification 2,12,Two out of Three,2000.0,D,1304694000,[dp],PROGRAMMING -82,Yandex.Algorithm 2011
Qualification 2,12,Corridor,2500.0,E,1304694000,[geometry],PROGRAMMING -83,Codeforces Beta Round #72 (Div. 1 Only),1,Magical Array,500.0,A,1305299400,[math],PROGRAMMING -83,Codeforces Beta Round #72 (Div. 1 Only),1,Doctor,1000.0,B,1305299400,"[binary search, math, sortings]",PROGRAMMING -83,Codeforces Beta Round #72 (Div. 1 Only),1,Track,1500.0,C,1305299400,"[graphs, greedy, shortest paths]",PROGRAMMING -83,Codeforces Beta Round #72 (Div. 1 Only),1,Numbers,2000.0,D,1305299400,"[dp, math, number theory]",PROGRAMMING -83,Codeforces Beta Round #72 (Div. 1 Only),1,Two Subsequences,2500.0,E,1305299400,"[bitmasks, dp]",PROGRAMMING -84,Codeforces Beta Round #72 (Div. 2 Only),2,Toy Army,500.0,A,1305299400,"[math, number theory]",PROGRAMMING -84,Codeforces Beta Round #72 (Div. 2 Only),2,Magical Array,1000.0,B,1305299400,"[combinatorics, implementation]",PROGRAMMING -84,Codeforces Beta Round #72 (Div. 2 Only),2,Biathlon,1500.0,C,1305299400,"[binary search, implementation]",PROGRAMMING -84,Codeforces Beta Round #72 (Div. 2 Only),2,Doctor,2000.0,D,1305299400,"[binary search, implementation]",PROGRAMMING -84,Codeforces Beta Round #72 (Div. 2 Only),2,Track,2500.0,E,1305299400,"[brute force, shortest paths]",PROGRAMMING -85,Yandex.Algorithm 2011
Round 1,12,Domino,500.0,A,1305903600,"[constructive algorithms, implementation]",PROGRAMMING -85,Yandex.Algorithm 2011
Round 1,12,Embassy Queue,1000.0,B,1305903600,[data structures],PROGRAMMING -85,Yandex.Algorithm 2011
Round 1,12,Petya and Tree,1500.0,C,1305903600,"[binary search, dfs and similar, probabilities, sortings, trees]",PROGRAMMING -85,Yandex.Algorithm 2011
Round 1,12,Sum of Medians,2000.0,D,1305903600,"[binary search, brute force, data structures, implementation]",PROGRAMMING -85,Yandex.Algorithm 2011
Round 1,12,Guard Towers,2500.0,E,1305903600,"[binary search, dsu, geometry, graphs, sortings]",PROGRAMMING -86,Yandex.Algorithm 2011
Round 2,12,Reflection,500.0,A,1306077000,[math],PROGRAMMING -86,Yandex.Algorithm 2011
Round 2,12,Tetris revisited,1000.0,B,1306077000,"[constructive algorithms, graph matchings, greedy, math]",PROGRAMMING -86,Yandex.Algorithm 2011
Round 2,12,Genetic engineering,2000.0,C,1306077000,"[dp, string suffix structures, trees]",PROGRAMMING -86,Yandex.Algorithm 2011
Round 2,12,Powerful array,2500.0,D,1306077000,"[data structures, implementation, math, two pointers]",PROGRAMMING -86,Yandex.Algorithm 2011
Round 2,12,Long sequence,2500.0,E,1306077000,"[brute force, math, matrices]",PROGRAMMING -87,Codeforces Beta Round #73 (Div. 1 Only),1,Trains,500.0,A,1307458800,[math],PROGRAMMING -87,Codeforces Beta Round #73 (Div. 1 Only),1,Vasya and Types,1000.0,B,1307458800,"[implementation, strings]",PROGRAMMING -87,Codeforces Beta Round #73 (Div. 1 Only),1,Interesting Game,1500.0,C,1307458800,"[dp, games]",PROGRAMMING -87,Codeforces Beta Round #73 (Div. 1 Only),1,Beautiful Road,2000.0,D,1307458800,"[dfs and similar, dp, dsu, implementation, sortings, trees]",PROGRAMMING -87,Codeforces Beta Round #73 (Div. 1 Only),1,Mogohu-Rea Idol,2500.0,E,1307458800,[geometry],PROGRAMMING -88,Codeforces Beta Round #73 (Div. 2 Only),2,Chord,500.0,A,1307458800,"[brute force, implementation]",PROGRAMMING -88,Codeforces Beta Round #73 (Div. 2 Only),2,Keyboard,1000.0,B,1307458800,[implementation],PROGRAMMING -88,Codeforces Beta Round #73 (Div. 2 Only),2,Trains,1500.0,C,1307458800,[number theory],PROGRAMMING -88,Codeforces Beta Round #73 (Div. 2 Only),2,Vasya and Types,2000.0,D,1307458800,[implementation],PROGRAMMING -88,Codeforces Beta Round #73 (Div. 2 Only),2,Interesting Game,2500.0,E,1307458800,[],PROGRAMMING -89,Codeforces Beta Round #74 (Div. 1 Only),1,Robbery,500.0,A,1308236400,[greedy],PROGRAMMING -89,Codeforces Beta Round #74 (Div. 1 Only),1,Widget Library,1000.0,B,1308236400,"[dp, expression parsing, graphs, implementation]",PROGRAMMING -89,Codeforces Beta Round #74 (Div. 1 Only),1,Chip Play,1000.0,C,1308236400,"[brute force, data structures, implementation]",PROGRAMMING -89,Codeforces Beta Round #74 (Div. 1 Only),1,Space mines,1500.0,D,1308236400,[geometry],PROGRAMMING -89,Codeforces Beta Round #74 (Div. 1 Only),1,Fire and Ice,2500.0,E,1308236400,[greedy],PROGRAMMING -90,Codeforces Beta Round #74 (Div. 2 Only),2,Cableway,500.0,A,1308236400,"[greedy, math]",PROGRAMMING -90,Codeforces Beta Round #74 (Div. 2 Only),2,African Crossword,1000.0,B,1308236400,"[implementation, strings]",PROGRAMMING -90,Codeforces Beta Round #74 (Div. 2 Only),2,Robbery,1500.0,C,1308236400,"[greedy, math]",PROGRAMMING -90,Codeforces Beta Round #74 (Div. 2 Only),2,Widget Library,2000.0,D,1308236400,[],PROGRAMMING -90,Codeforces Beta Round #74 (Div. 2 Only),2,Chip Play,2000.0,E,1308236400,[],PROGRAMMING -91,Codeforces Beta Round #75 (Div. 1 Only),1,Newspaper Headline,500.0,A,1308582000,"[greedy, strings]",PROGRAMMING -91,Codeforces Beta Round #75 (Div. 1 Only),1,Queue,1000.0,B,1308582000,"[binary search, data structures]",PROGRAMMING -91,Codeforces Beta Round #75 (Div. 1 Only),1,Ski Base,1500.0,C,1308582000,"[combinatorics, dsu, graphs]",PROGRAMMING -91,Codeforces Beta Round #75 (Div. 1 Only),1,Grocer's Problem,2500.0,D,1308582000,"[constructive algorithms, graphs, greedy]",PROGRAMMING -91,Codeforces Beta Round #75 (Div. 1 Only),1,Igloo Skyscraper,2500.0,E,1308582000,"[data structures, geometry]",PROGRAMMING -92,Codeforces Beta Round #75 (Div. 2 Only),2,Chips,500.0,A,1308582000,"[implementation, math]",PROGRAMMING -92,Codeforces Beta Round #75 (Div. 2 Only),2,Binary Number,1000.0,B,1308582000,[greedy],PROGRAMMING -92,Codeforces Beta Round #75 (Div. 2 Only),2,Newspaper Headline,1500.0,C,1308582000,"[binary search, data structures, dp, greedy]",PROGRAMMING -92,Codeforces Beta Round #75 (Div. 2 Only),2,Queue,2000.0,D,1308582000,"[binary search, data structures, dp]",PROGRAMMING -92,Codeforces Beta Round #75 (Div. 2 Only),2,Ski Base,2500.0,E,1308582000,"[data structures, dsu, graphs]",PROGRAMMING -93,Codeforces Beta Round #76 (Div. 1 Only),1,Frames,500.0,A,1309446000,[implementation],PROGRAMMING -93,Codeforces Beta Round #76 (Div. 1 Only),1,End of Exams,1000.0,B,1309446000,[greedy],PROGRAMMING -93,Codeforces Beta Round #76 (Div. 1 Only),1,Azembler,1500.0,C,1309446000,"[brute force, implementation]",PROGRAMMING -93,Codeforces Beta Round #76 (Div. 1 Only),1,Flags,2000.0,D,1309446000,"[dp, math, matrices]",PROGRAMMING -93,Codeforces Beta Round #76 (Div. 1 Only),1,Lostborn,2500.0,E,1309446000,"[dp, math]",PROGRAMMING -94,Codeforces Beta Round #76 (Div. 2 Only),2,Restoring Password,500.0,A,1309446000,"[implementation, strings]",PROGRAMMING -94,Codeforces Beta Round #76 (Div. 2 Only),2,Friends,1000.0,B,1309446000,"[implementation, math]",PROGRAMMING -94,Codeforces Beta Round #76 (Div. 2 Only),2,Frames,1500.0,C,1309446000,[math],PROGRAMMING -94,Codeforces Beta Round #76 (Div. 2 Only),2,End of Exams,2000.0,D,1309446000,"[greedy, math]",PROGRAMMING -94,Codeforces Beta Round #76 (Div. 2 Only),2,Azembler,2500.0,E,1309446000,[brute force],PROGRAMMING -95,Codeforces Beta Round #77 (Div. 1 Only),1,Hockey,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING -95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Numbers,1000.0,B,1310137200,"[dp, greedy]",PROGRAMMING -95,Codeforces Beta Round #77 (Div. 1 Only),1,Volleyball,1500.0,C,1310137200,[shortest paths],PROGRAMMING -95,Codeforces Beta Round #77 (Div. 1 Only),1,Horse Races,2000.0,D,1310137200,"[dp, math]",PROGRAMMING -95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Country,2500.0,E,1310137200,"[dp, dsu, graphs]",PROGRAMMING -96,Codeforces Beta Round #77 (Div. 2 Only),2,Football,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING -96,Codeforces Beta Round #77 (Div. 2 Only),2,Lucky Numbers (easy),1000.0,B,1310137200,"[binary search, bitmasks, brute force]",PROGRAMMING -96,Codeforces Beta Round #77 (Div. 2 Only),2,Hockey,1500.0,C,1310137200,"[implementation, strings]",PROGRAMMING -96,Codeforces Beta Round #77 (Div. 2 Only),2,Volleyball,2000.0,D,1310137200,"[graphs, shortest paths]",PROGRAMMING -96,Codeforces Beta Round #77 (Div. 2 Only),2,Horse Races,2500.0,E,1310137200,[],PROGRAMMING -97,Yandex.Algorithm 2011
Finals,12,Domino,500.0,A,1310731200,"[brute force, implementation]",PROGRAMMING -97,Yandex.Algorithm 2011
Finals,12,Superset,1500.0,B,1310731200,"[constructive algorithms, divide and conquer]",PROGRAMMING -97,Yandex.Algorithm 2011
Finals,12,Winning Strategy,2000.0,C,1310731200,"[binary search, graphs, math, shortest paths]",PROGRAMMING -97,Yandex.Algorithm 2011
Finals,12,Robot in Basement,2000.0,D,1310731200,"[bitmasks, brute force, implementation]",PROGRAMMING -97,Yandex.Algorithm 2011
Finals,12,Leaders,2500.0,E,1310731200,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING -101,Codeforces Beta Round #79 (Div. 1 Only),1,Homework,500.0,A,1312390800,[greedy],PROGRAMMING -101,Codeforces Beta Round #79 (Div. 1 Only),1,Buses,1000.0,B,1312390800,"[binary search, data structures, dp]",PROGRAMMING -101,Codeforces Beta Round #79 (Div. 1 Only),1,Vectors,1500.0,C,1312390800,"[implementation, math]",PROGRAMMING -101,Codeforces Beta Round #79 (Div. 1 Only),1,Castle,2000.0,D,1312390800,"[dp, greedy, probabilities, sortings, trees]",PROGRAMMING -101,Codeforces Beta Round #79 (Div. 1 Only),1,Candies and Stones,2500.0,E,1312390800,"[divide and conquer, dp]",PROGRAMMING -102,Codeforces Beta Round #79 (Div. 2 Only),2,Clothes,500.0,A,1312390800,[brute force],PROGRAMMING -102,Codeforces Beta Round #79 (Div. 2 Only),2,Sum of Digits,1000.0,B,1312390800,[implementation],PROGRAMMING -102,Codeforces Beta Round #79 (Div. 2 Only),2,Homework,1500.0,C,1312390800,[greedy],PROGRAMMING -102,Codeforces Beta Round #79 (Div. 2 Only),2,Buses,2000.0,D,1312390800,"[binary search, data structures, dp]",PROGRAMMING -102,Codeforces Beta Round #79 (Div. 2 Only),2,Vectors,2500.0,E,1312390800,[],PROGRAMMING -103,Codeforces Beta Round #80 (Div. 1 Only),1,Testing Pants for Sadness,500.0,A,1312714800,"[greedy, implementation, math]",PROGRAMMING -103,Codeforces Beta Round #80 (Div. 1 Only),1,Cthulhu,1000.0,B,1312714800,"[dfs and similar, dsu, graphs]",PROGRAMMING -103,Codeforces Beta Round #80 (Div. 1 Only),1,Russian Roulette,1500.0,C,1312714800,"[constructive algorithms, greedy]",PROGRAMMING -103,Codeforces Beta Round #80 (Div. 1 Only),1,Time to Raid Cowavans,2000.0,D,1312714800,"[brute force, data structures, sortings]",PROGRAMMING -103,Codeforces Beta Round #80 (Div. 1 Only),1,Buying Sets,2500.0,E,1312714800,"[flows, graph matchings]",PROGRAMMING -104,Codeforces Beta Round #80 (Div. 2 Only),2,Blackjack,500.0,A,1312714800,[implementation],PROGRAMMING -104,Codeforces Beta Round #80 (Div. 2 Only),2,Testing Pants for Sadness,1000.0,B,1312714800,[math],PROGRAMMING -104,Codeforces Beta Round #80 (Div. 2 Only),2,Cthulhu,1500.0,C,1312714800,"[dsu, trees]",PROGRAMMING -104,Codeforces Beta Round #80 (Div. 2 Only),2,Russian Roulette,2000.0,D,1312714800,[math],PROGRAMMING -104,Codeforces Beta Round #80 (Div. 2 Only),2,Time to Raid Cowavans,2500.0,E,1312714800,[],PROGRAMMING -105,Codeforces Beta Round #81,12,Transmigration,500.0,A,1313247600,[implementation],PROGRAMMING -105,Codeforces Beta Round #81,12,Dark Assembly,1000.0,B,1313247600,"[brute force, probabilities]",PROGRAMMING -105,Codeforces Beta Round #81,12,Item World,1500.0,C,1313247600,"[brute force, implementation, sortings]",PROGRAMMING -105,Codeforces Beta Round #81,12,Entertaining Geodetics,2000.0,D,1313247600,"[brute force, dsu, implementation]",PROGRAMMING -105,Codeforces Beta Round #81,12,Lift and Throw,2500.0,E,1313247600,[brute force],PROGRAMMING -106,Codeforces Beta Round #82 (Div. 2),2,Card Game,500.0,A,1313766000,[implementation],PROGRAMMING -106,Codeforces Beta Round #82 (Div. 2),2,Choosing Laptop,1000.0,B,1313766000,"[brute force, implementation]",PROGRAMMING -106,Codeforces Beta Round #82 (Div. 2),2,Buns,1500.0,C,1313766000,"[chinese remainder theorem, geometry]",PROGRAMMING -106,Codeforces Beta Round #82 (Div. 2),2,Treasure Island,2000.0,D,1313766000,"[brute force, implementation]",PROGRAMMING -106,Codeforces Beta Round #82 (Div. 2),2,Space Rescuers,2500.0,E,1313766000,"[geometry, ternary search]",PROGRAMMING -107,Codeforces Beta Round #83 (Div. 1 Only),1,Dorm Water Supply,500.0,A,1314111600,"[dfs and similar, graphs]",PROGRAMMING -107,Codeforces Beta Round #83 (Div. 1 Only),1,Basketball Team,1000.0,B,1314111600,"[combinatorics, dp, probabilities]",PROGRAMMING -107,Codeforces Beta Round #83 (Div. 1 Only),1,Arrangement,1500.0,C,1314111600,"[bitmasks, dp]",PROGRAMMING -107,Codeforces Beta Round #83 (Div. 1 Only),1,Crime Management,2000.0,D,1314111600,"[dp, matrices]",PROGRAMMING -107,Codeforces Beta Round #83 (Div. 1 Only),1,Darts,2500.0,E,1314111600,"[geometry, probabilities]",PROGRAMMING -109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sum of Digits,500.0,A,1314633600,"[brute force, implementation]",PROGRAMMING -109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Probability,1000.0,B,1314633600,"[brute force, probabilities]",PROGRAMMING -109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Tree,1500.0,C,1314633600,"[dp, dsu, trees]",PROGRAMMING -109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sorting,2000.0,D,1314633600,"[constructive algorithms, sortings]",PROGRAMMING -109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Interval,2500.0,E,1314633600,"[brute force, math]",PROGRAMMING -110,Codeforces Beta Round #84 (Div. 2 Only),2,Nearly Lucky Number,500.0,A,1314633600,[implementation],PROGRAMMING -110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky String,1000.0,B,1314633600,"[constructive algorithms, strings]",PROGRAMMING -110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Sum of Digits,1500.0,C,1314633600,"[implementation, math]",PROGRAMMING -110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Probability,2000.0,D,1314633600,"[brute force, combinatorics, dfs and similar, probabilities]",PROGRAMMING -110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Tree,2500.0,E,1314633600,"[combinatorics, dfs and similar, trees]",PROGRAMMING -111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Inequiations,500.0,A,1315051200,[greedy],PROGRAMMING -111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Divisors,1000.0,B,1315051200,"[binary search, data structures, number theory]",PROGRAMMING -111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Spiders,1500.0,C,1315051200,"[bitmasks, dp, dsu]",PROGRAMMING -111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Coloring,2000.0,D,1315051200,"[combinatorics, dp]",PROGRAMMING -111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Rectangle,2500.0,E,1315051200,[],PROGRAMMING -112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Strings,500.0,A,1315051200,"[implementation, strings]",PROGRAMMING -112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Square,1000.0,B,1315051200,"[implementation, math]",PROGRAMMING -112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Inequiations,1500.0,C,1315051200,"[greedy, math]",PROGRAMMING -112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Divisors,2000.0,D,1315051200,"[implementation, number theory]",PROGRAMMING -112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Spiders,2500.0,E,1315051200,"[bitmasks, dp]",PROGRAMMING -113,Codeforces Beta Round #86 (Div. 1 Only),1,Grammar Lessons,500.0,A,1315494000,"[implementation, strings]",PROGRAMMING -113,Codeforces Beta Round #86 (Div. 1 Only),1,Petr#,1000.0,B,1315494000,"[brute force, data structures, hashing, strings]",PROGRAMMING -113,Codeforces Beta Round #86 (Div. 1 Only),1,Double Happiness,1500.0,C,1315494000,"[brute force, number theory]",PROGRAMMING -113,Codeforces Beta Round #86 (Div. 1 Only),1,Museum,2000.0,D,1315494000,"[matrices, probabilities]",PROGRAMMING -113,Codeforces Beta Round #86 (Div. 1 Only),1,Sleeping,2500.0,E,1315494000,"[combinatorics, implementation, math]",PROGRAMMING -114,Codeforces Beta Round #86 (Div. 2 Only),2,Cifera,500.0,A,1315494000,[math],PROGRAMMING -114,Codeforces Beta Round #86 (Div. 2 Only),2,PFAST Inc.,1000.0,B,1315494000,"[bitmasks, brute force]",PROGRAMMING -114,Codeforces Beta Round #86 (Div. 2 Only),2,Grammar Lessons,1500.0,C,1315494000,[implementation],PROGRAMMING -114,Codeforces Beta Round #86 (Div. 2 Only),2,Petr#,2000.0,D,1315494000,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING -114,Codeforces Beta Round #86 (Div. 2 Only),2,Double Happiness,2500.0,E,1315494000,[number theory],PROGRAMMING -115,Codeforces Beta Round #87 (Div. 1 Only),1,Party,500.0,A,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING -115,Codeforces Beta Round #87 (Div. 1 Only),1,Lawnmower,1000.0,B,1316098800,"[greedy, sortings]",PROGRAMMING -115,Codeforces Beta Round #87 (Div. 1 Only),1,Plumber,1500.0,C,1316098800,[math],PROGRAMMING -115,Codeforces Beta Round #87 (Div. 1 Only),1,Unambiguous Arithmetic Expression,2000.0,D,1316098800,"[dp, expression parsing]",PROGRAMMING -115,Codeforces Beta Round #87 (Div. 1 Only),1,Linear Kingdom Races,2500.0,E,1316098800,"[data structures, dp]",PROGRAMMING -116,Codeforces Beta Round #87 (Div. 2 Only),2,Tram,500.0,A,1316098800,[implementation],PROGRAMMING -116,Codeforces Beta Round #87 (Div. 2 Only),2,Little Pigs and Wolves,1000.0,B,1316098800,"[greedy, implementation]",PROGRAMMING -116,Codeforces Beta Round #87 (Div. 2 Only),2,Party,1500.0,C,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING -116,Codeforces Beta Round #87 (Div. 2 Only),2,Lawnmower,2000.0,D,1316098800,"[dp, greedy]",PROGRAMMING -116,Codeforces Beta Round #87 (Div. 2 Only),2,Plumber,2500.0,E,1316098800,[],PROGRAMMING -117,Codeforces Beta Round #88,12,Elevator,500.0,A,1316790000,"[implementation, math]",PROGRAMMING -117,Codeforces Beta Round #88,12,Very Interesting Game,1000.0,B,1316790000,"[brute force, number theory]",PROGRAMMING -117,Codeforces Beta Round #88,12,Cycle,1500.0,C,1316790000,"[dfs and similar, graphs]",PROGRAMMING -117,Codeforces Beta Round #88,12,Not Quick Transformation,2000.0,D,1316790000,"[divide and conquer, math]",PROGRAMMING -117,Codeforces Beta Round #88,12,Tree or not Tree,2500.0,E,1316790000,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING -118,Codeforces Beta Round #89 (Div. 2),2,String Task,500.0,A,1317999600,"[implementation, strings]",PROGRAMMING -118,Codeforces Beta Round #89 (Div. 2),2,Present from Lena,1000.0,B,1317999600,"[constructive algorithms, implementation]",PROGRAMMING -118,Codeforces Beta Round #89 (Div. 2),2,Fancy Number,1500.0,C,1317999600,"[brute force, greedy, sortings, strings]",PROGRAMMING -118,Codeforces Beta Round #89 (Div. 2),2,Caesar's Legions,2000.0,D,1317999600,[dp],PROGRAMMING -118,Codeforces Beta Round #89 (Div. 2),2,Bertown roads,2500.0,E,1317999600,"[dfs and similar, graphs]",PROGRAMMING -121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Sum,500.0,A,1319727600,[implementation],PROGRAMMING -121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Transformation,1000.0,B,1319727600,[strings],PROGRAMMING -121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Permutation,1500.0,C,1319727600,"[brute force, combinatorics, number theory]",PROGRAMMING -121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Segments,2000.0,D,1319727600,"[binary search, implementation, two pointers]",PROGRAMMING -121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Array,2500.0,E,1319727600,[data structures],PROGRAMMING -122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Division,500.0,A,1319727600,"[brute force, number theory]",PROGRAMMING -122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Substring,1000.0,B,1319727600,"[brute force, implementation]",PROGRAMMING -122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Sum,1500.0,C,1319727600,"[brute force, math]",PROGRAMMING -122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Transformation,2000.0,D,1319727600,[brute force],PROGRAMMING -122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Permutation,2500.0,E,1319727600,[],PROGRAMMING -123,Codeforces Beta Round #92 (Div. 1 Only),1,Prime Permutation,1000.0,A,1320333000,"[implementation, number theory, strings]",PROGRAMMING -123,Codeforces Beta Round #92 (Div. 1 Only),1,Squares,1000.0,B,1320333000,[math],PROGRAMMING -123,Codeforces Beta Round #92 (Div. 1 Only),1,Brackets,1500.0,C,1320333000,"[combinatorics, dp, greedy]",PROGRAMMING -123,Codeforces Beta Round #92 (Div. 1 Only),1,String,2000.0,D,1320333000,[string suffix structures],PROGRAMMING -123,Codeforces Beta Round #92 (Div. 1 Only),1,Maze,2500.0,E,1320333000,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING -124,Codeforces Beta Round #92 (Div. 2 Only),2,The number of positions,500.0,A,1320333000,[math],PROGRAMMING -124,Codeforces Beta Round #92 (Div. 2 Only),2,Permutations,1000.0,B,1320333000,"[brute force, combinatorics, implementation]",PROGRAMMING -124,Codeforces Beta Round #92 (Div. 2 Only),2,Prime Permutation,2000.0,C,1320333000,"[constructive algorithms, dfs and similar, dsu, greedy, number theory, sortings, strings]",PROGRAMMING -124,Codeforces Beta Round #92 (Div. 2 Only),2,Squares,2000.0,D,1320333000,"[brute force, constructive algorithms, number theory]",PROGRAMMING -124,Codeforces Beta Round #92 (Div. 2 Only),2,Brackets,2500.0,E,1320333000,[],PROGRAMMING -126,Codeforces Beta Round #93 (Div. 1 Only),1,Hot Bath,500.0,A,1320858000,"[binary search, brute force, math]",PROGRAMMING -126,Codeforces Beta Round #93 (Div. 1 Only),1,Password,1000.0,B,1320858000,"[binary search, dp, hashing, string suffix structures, strings]",PROGRAMMING -126,Codeforces Beta Round #93 (Div. 1 Only),1,E-reader Display,1500.0,C,1320858000,"[constructive algorithms, greedy]",PROGRAMMING -126,Codeforces Beta Round #93 (Div. 1 Only),1,Fibonacci Sums,2000.0,D,1320858000,"[dp, math]",PROGRAMMING -126,Codeforces Beta Round #93 (Div. 1 Only),1,Pills,2500.0,E,1320858000,"[brute force, flows]",PROGRAMMING -127,Codeforces Beta Round #93 (Div. 2 Only),2,Wasted Time,500.0,A,1320858000,[geometry],PROGRAMMING -127,Codeforces Beta Round #93 (Div. 2 Only),2,Canvas Frames,1000.0,B,1320858000,[implementation],PROGRAMMING -127,Codeforces Beta Round #93 (Div. 2 Only),2,Hot Bath,1500.0,C,1320858000,"[binary search, math]",PROGRAMMING -127,Codeforces Beta Round #93 (Div. 2 Only),2,Password,2000.0,D,1320858000,"[hashing, strings]",PROGRAMMING -127,Codeforces Beta Round #93 (Div. 2 Only),2,E-reader Display,2500.0,E,1320858000,[implementation],PROGRAMMING -128,Codeforces Beta Round #94 (Div. 1 Only),1,Statues,1000.0,A,1321337400,[dfs and similar],PROGRAMMING -128,Codeforces Beta Round #94 (Div. 1 Only),1,String,1500.0,B,1321337400,"[brute force, constructive algorithms, hashing, string suffix structures, strings]",PROGRAMMING -128,Codeforces Beta Round #94 (Div. 1 Only),1,Games with Rectangle,1500.0,C,1321337400,"[combinatorics, dp]",PROGRAMMING -128,Codeforces Beta Round #94 (Div. 1 Only),1,Numbers,2000.0,D,1321337400,[constructive algorithms],PROGRAMMING -128,Codeforces Beta Round #94 (Div. 1 Only),1,Birthday,2500.0,E,1321337400,"[geometry, math]",PROGRAMMING -129,Codeforces Beta Round #94 (Div. 2 Only),2,Cookies,500.0,A,1321337400,[implementation],PROGRAMMING -129,Codeforces Beta Round #94 (Div. 2 Only),2,Students and Shoelaces,1000.0,B,1321337400,"[brute force, dfs and similar, graphs]",PROGRAMMING -129,Codeforces Beta Round #94 (Div. 2 Only),2,Statues,2000.0,C,1321337400,"[dfs and similar, graphs, implementation]",PROGRAMMING -129,Codeforces Beta Round #94 (Div. 2 Only),2,String,2500.0,D,1321337400,"[implementation, string suffix structures, strings]",PROGRAMMING -129,Codeforces Beta Round #94 (Div. 2 Only),2,Games with Rectangle,2500.0,E,1321337400,"[combinatorics, dp]",PROGRAMMING -131,Codeforces Beta Round #95 (Div. 2),2,cAPS lOCK,500.0,A,1322233200,"[implementation, strings]",PROGRAMMING -131,Codeforces Beta Round #95 (Div. 2),2,Opposites Attract,1000.0,B,1322233200,"[implementation, math]",PROGRAMMING -131,Codeforces Beta Round #95 (Div. 2),2,The World is a Theatre,1500.0,C,1322233200,"[combinatorics, math]",PROGRAMMING -131,Codeforces Beta Round #95 (Div. 2),2,Subway,2000.0,D,1322233200,"[dfs and similar, graphs]",PROGRAMMING -131,Codeforces Beta Round #95 (Div. 2),2,Yet Another Task with Queens,2500.0,E,1322233200,[sortings],PROGRAMMING -131,Codeforces Beta Round #95 (Div. 2),2,Present to Mom,2500.0,F,1322233200,"[binary search, two pointers]",PROGRAMMING -132,Codeforces Beta Round #96 (Div. 1),1,Turing Tape,500.0,A,1322924400,[implementation],PROGRAMMING -132,Codeforces Beta Round #96 (Div. 1),1,Piet,1500.0,B,1322924400,[implementation],PROGRAMMING -132,Codeforces Beta Round #96 (Div. 1),1,Logo Turtle,1500.0,C,1322924400,[dp],PROGRAMMING -132,Codeforces Beta Round #96 (Div. 1),1,Constants in the language of Shakespeare,2000.0,D,1322924400,"[constructive algorithms, dp, greedy]",PROGRAMMING -132,Codeforces Beta Round #96 (Div. 1),1,Bits of merry old England,2500.0,E,1322924400,[flows],PROGRAMMING -133,Codeforces Beta Round #96 (Div. 2),2,HQ9+,500.0,A,1322924400,[implementation],PROGRAMMING -133,Codeforces Beta Round #96 (Div. 2),2,Unary,1000.0,B,1322924400,[implementation],PROGRAMMING -133,Codeforces Beta Round #96 (Div. 2),2,Turing Tape,1500.0,C,1322924400,"[implementation, math]",PROGRAMMING -133,Codeforces Beta Round #96 (Div. 2),2,Piet,2500.0,D,1322924400,[implementation],PROGRAMMING -133,Codeforces Beta Round #96 (Div. 2),2,Logo Turtle,2500.0,E,1322924400,"[dp, implementation]",PROGRAMMING -135,Codeforces Beta Round #97 (Div. 1),1,Replacement,500.0,A,1323443100,"[implementation, sortings]",PROGRAMMING -135,Codeforces Beta Round #97 (Div. 1),1,Rectangle and Square,1000.0,B,1323443100,"[brute force, geometry, math]",PROGRAMMING -135,Codeforces Beta Round #97 (Div. 1),1,Zero-One,1500.0,C,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING -135,Codeforces Beta Round #97 (Div. 1),1,Cycle,2000.0,D,1323443100,"[brute force, dfs and similar, implementation]",PROGRAMMING -135,Codeforces Beta Round #97 (Div. 1),1,Weak Subsequence,2500.0,E,1323443100,[combinatorics],PROGRAMMING -136,Codeforces Beta Round #97 (Div. 2),2,Presents,500.0,A,1323443100,[implementation],PROGRAMMING -136,Codeforces Beta Round #97 (Div. 2),2,Ternary Logic,1000.0,B,1323443100,"[implementation, math]",PROGRAMMING -136,Codeforces Beta Round #97 (Div. 2),2,Replacement,1500.0,C,1323443100,"[implementation, sortings]",PROGRAMMING -136,Codeforces Beta Round #97 (Div. 2),2,Rectangle and Square,2000.0,D,1323443100,"[geometry, implementation]",PROGRAMMING -136,Codeforces Beta Round #97 (Div. 2),2,Zero-One,2500.0,E,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING -137,Codeforces Beta Round #98 (Div. 2),2,Postcards and photos,500.0,A,1324015200,[implementation],PROGRAMMING -137,Codeforces Beta Round #98 (Div. 2),2,Permutation,1000.0,B,1324015200,[greedy],PROGRAMMING -137,Codeforces Beta Round #98 (Div. 2),2,History,1500.0,C,1324015200,[sortings],PROGRAMMING -137,Codeforces Beta Round #98 (Div. 2),2,Palindromes,2000.0,D,1324015200,[dp],PROGRAMMING -137,Codeforces Beta Round #98 (Div. 2),2,Last Chance,2500.0,E,1324015200,"[data structures, implementation]",PROGRAMMING -138,Codeforces Beta Round #99 (Div. 1),1,Literature Lesson,500.0,A,1324728000,[implementation],PROGRAMMING -138,Codeforces Beta Round #99 (Div. 1),1,Digits Permutations,1000.0,B,1324728000,[greedy],PROGRAMMING -138,Codeforces Beta Round #99 (Div. 1),1,Mushroom Gnomes - 2,2000.0,C,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING -138,Codeforces Beta Round #99 (Div. 1),1,World of Darkraft,2000.0,D,1324728000,"[dp, games]",PROGRAMMING -138,Codeforces Beta Round #99 (Div. 1),1,Hellish Constraints,2500.0,E,1324728000,"[brute force, dp, two pointers]",PROGRAMMING -139,Codeforces Beta Round #99 (Div. 2),2,Petr and Book,500.0,A,1324728000,[implementation],PROGRAMMING -139,Codeforces Beta Round #99 (Div. 2),2,Wallpaper,1000.0,B,1324728000,"[implementation, math]",PROGRAMMING -139,Codeforces Beta Round #99 (Div. 2),2,Literature Lesson,1500.0,C,1324728000,"[implementation, strings]",PROGRAMMING -139,Codeforces Beta Round #99 (Div. 2),2,Digits Permutations,2000.0,D,1324728000,[implementation],PROGRAMMING -139,Codeforces Beta Round #99 (Div. 2),2,Mushroom Gnomes - 2,3000.0,E,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING -140,Codeforces Round #100,12,New Year Table,500.0,A,1325689200,"[geometry, math]",PROGRAMMING -140,Codeforces Round #100,12,New Year Cards,1000.0,B,1325689200,"[brute force, greedy, implementation]",PROGRAMMING -140,Codeforces Round #100,12,New Year Snowmen,1500.0,C,1325689200,"[binary search, data structures, greedy]",PROGRAMMING -140,Codeforces Round #100,12,New Year Contest,2000.0,D,1325689200,"[greedy, sortings]",PROGRAMMING -140,Codeforces Round #100,12,New Year Garland,2500.0,E,1325689200,"[combinatorics, dp]",PROGRAMMING -140,Codeforces Round #100,12,New Year Snowflake,3000.0,F,1325689200,"[geometry, sortings]",PROGRAMMING -141,Codeforces Round #101 (Div. 2),2,Amusing Joke,500.0,A,1326034800,"[implementation, sortings, strings]",PROGRAMMING -141,Codeforces Round #101 (Div. 2),2,Hopscotch,1000.0,B,1326034800,"[geometry, math]",PROGRAMMING -141,Codeforces Round #101 (Div. 2),2,Queue,2000.0,C,1326034800,"[constructive algorithms, greedy, sortings]",PROGRAMMING -141,Codeforces Round #101 (Div. 2),2,Take-off Ramps,2000.0,D,1326034800,"[graphs, shortest paths]",PROGRAMMING -141,Codeforces Round #101 (Div. 2),2,Clearing Up,2500.0,E,1326034800,"[constructive algorithms, dp, dsu, graphs]",PROGRAMMING -142,Codeforces Round #102 (Div. 1),1,Help Farmer,500.0,A,1326380700,"[brute force, math]",PROGRAMMING -142,Codeforces Round #102 (Div. 1),1,Help General,1000.0,B,1326380700,"[constructive algorithms, greedy, implementation]",PROGRAMMING -142,Codeforces Round #102 (Div. 1),1,Help Caretaker,1500.0,C,1326380700,"[brute force, dp]",PROGRAMMING -142,Codeforces Round #102 (Div. 1),1,Help Shrek and Donkey 2,2000.0,D,1326380700,[games],PROGRAMMING -142,Codeforces Round #102 (Div. 1),1,Help Greg the Dwarf 2,2500.0,E,1326380700,[geometry],PROGRAMMING -143,Codeforces Round #102 (Div. 2),2,Help Vasilisa the Wise 2,500.0,A,1326380700,"[brute force, math]",PROGRAMMING -143,Codeforces Round #102 (Div. 2),2,Help Kingdom of Far Far Away 2,1000.0,B,1326380700,"[implementation, strings]",PROGRAMMING -143,Codeforces Round #102 (Div. 2),2,Help Farmer,1500.0,C,1326380700,"[implementation, math]",PROGRAMMING -143,Codeforces Round #102 (Div. 2),2,Help General,2000.0,D,1326380700,"[graph matchings, greedy, math]",PROGRAMMING -143,Codeforces Round #102 (Div. 2),2,Help Caretaker,2500.0,E,1326380700,[],PROGRAMMING -144,Codeforces Round #103 (Div. 2),2,Arrival of the General,500.0,A,1326899100,[implementation],PROGRAMMING -144,Codeforces Round #103 (Div. 2),2,Meeting,1000.0,B,1326899100,[implementation],PROGRAMMING -144,Codeforces Round #103 (Div. 2),2,Anagram Search,1500.0,C,1326899100,"[implementation, strings]",PROGRAMMING -144,Codeforces Round #103 (Div. 2),2,Missile Silos,2000.0,D,1326899100,"[data structures, dfs and similar, graphs, shortest paths]",PROGRAMMING -144,Codeforces Round #103 (Div. 2),2,Competition,2500.0,E,1326899100,"[data structures, greedy]",PROGRAMMING -145,Codeforces Round #104 (Div. 1),1,Lucky Conversion,500.0,A,1327215600,"[greedy, implementation]",PROGRAMMING -145,Codeforces Round #104 (Div. 1),1,Lucky Number 2,1000.0,B,1327215600,[constructive algorithms],PROGRAMMING -145,Codeforces Round #104 (Div. 1),1,Lucky Subsequence,1500.0,C,1327215600,"[combinatorics, dp, math]",PROGRAMMING -145,Codeforces Round #104 (Div. 1),1,Lucky Pair,2500.0,D,1327215600,"[combinatorics, data structures, implementation]",PROGRAMMING -145,Codeforces Round #104 (Div. 1),1,Lucky Queries,2500.0,E,1327215600,[data structures],PROGRAMMING -146,Codeforces Round #104 (Div. 2),2,Lucky Ticket,500.0,A,1327215600,[implementation],PROGRAMMING -146,Codeforces Round #104 (Div. 2),2,Lucky Mask,1000.0,B,1327215600,"[brute force, implementation]",PROGRAMMING -146,Codeforces Round #104 (Div. 2),2,Lucky Conversion,1500.0,C,1327215600,[greedy],PROGRAMMING -146,Codeforces Round #104 (Div. 2),2,Lucky Number 2,2000.0,D,1327215600,"[brute force, constructive algorithms, implementation]",PROGRAMMING -146,Codeforces Round #104 (Div. 2),2,Lucky Subsequence,2500.0,E,1327215600,"[combinatorics, dp]",PROGRAMMING -148,Codeforces Round #105 (Div. 2),2,Insomnia cure,1000.0,A,1328198400,"[constructive algorithms, implementation, math]",PROGRAMMING -148,Codeforces Round #105 (Div. 2),2,Escape,1000.0,B,1328198400,"[implementation, math]",PROGRAMMING -148,Codeforces Round #105 (Div. 2),2,Terse princess,1000.0,C,1328198400,"[constructive algorithms, greedy]",PROGRAMMING -148,Codeforces Round #105 (Div. 2),2,Bag of mice,1000.0,D,1328198400,"[dp, games, math, probabilities]",PROGRAMMING -148,Codeforces Round #105 (Div. 2),2,Porcelain,1000.0,E,1328198400,[dp],PROGRAMMING -149,Codeforces Round #106 (Div. 2),2,Business trip,500.0,A,1328886000,"[greedy, implementation, sortings]",PROGRAMMING -149,Codeforces Round #106 (Div. 2),2,Martian Clock,1000.0,B,1328886000,[implementation],PROGRAMMING -149,Codeforces Round #106 (Div. 2),2,Division into Teams,1500.0,C,1328886000,"[greedy, math, sortings]",PROGRAMMING -149,Codeforces Round #106 (Div. 2),2,Coloring Brackets,2500.0,D,1328886000,[dp],PROGRAMMING -149,Codeforces Round #106 (Div. 2),2,Martian Strings,2500.0,E,1328886000,"[string suffix structures, strings]",PROGRAMMING -150,Codeforces Round #107 (Div. 1),1,Win or Freeze,500.0,A,1329490800,"[games, number theory]",PROGRAMMING -150,Codeforces Round #107 (Div. 1),1,Quantity of Strings,500.0,B,1329490800,"[combinatorics, dfs and similar, math]",PROGRAMMING -150,Codeforces Round #107 (Div. 1),1,Smart Cheater,1000.0,C,1329490800,"[data structures, math, probabilities]",PROGRAMMING -150,Codeforces Round #107 (Div. 1),1,Mission Impassable,1500.0,D,1329490800,[dp],PROGRAMMING -150,Codeforces Round #107 (Div. 1),1,Freezing with Style,3000.0,E,1329490800,"[binary search, data structures, divide and conquer, trees]",PROGRAMMING -151,Codeforces Round #107 (Div. 2),2,Soft Drinking,500.0,A,1329490800,[implementation],PROGRAMMING -151,Codeforces Round #107 (Div. 2),2,Phone Numbers,1000.0,B,1329490800,"[implementation, strings]",PROGRAMMING -151,Codeforces Round #107 (Div. 2),2,Win or Freeze,1500.0,C,1329490800,"[games, greedy, number theory]",PROGRAMMING -151,Codeforces Round #107 (Div. 2),2,Quantity of Strings,1500.0,D,1329490800,"[combinatorics, dsu]",PROGRAMMING -151,Codeforces Round #107 (Div. 2),2,Smart Cheater,3000.0,E,1329490800,[],PROGRAMMING -152,Codeforces Round #108 (Div. 2),2,Marks,500.0,A,1329750000,[implementation],PROGRAMMING -152,Codeforces Round #108 (Div. 2),2,Steps,1000.0,B,1329750000,"[binary search, implementation]",PROGRAMMING -152,Codeforces Round #108 (Div. 2),2,Pocket Book,1500.0,C,1329750000,[combinatorics],PROGRAMMING -152,Codeforces Round #108 (Div. 2),2,Frames,2500.0,D,1329750000,[brute force],PROGRAMMING -152,Codeforces Round #108 (Div. 2),2,Garden,2500.0,E,1329750000,"[bitmasks, dp, graphs, trees]",PROGRAMMING -154,Codeforces Round #109 (Div. 1),1,Hometask,500.0,A,1330095600,[greedy],PROGRAMMING -154,Codeforces Round #109 (Div. 1),1,Colliders,1000.0,B,1330095600,"[math, number theory]",PROGRAMMING -154,Codeforces Round #109 (Div. 1),1,Double Profiles,1500.0,C,1330095600,"[graphs, hashing, sortings]",PROGRAMMING -154,Codeforces Round #109 (Div. 1),1,Flatland Fencing,2000.0,D,1330095600,"[games, math]",PROGRAMMING -154,Codeforces Round #109 (Div. 1),1,Martian Colony,2500.0,E,1330095600,[geometry],PROGRAMMING -155,Codeforces Round #109 (Div. 2),2,I_love_\%username\%,500.0,A,1330095600,[brute force],PROGRAMMING -155,Codeforces Round #109 (Div. 2),2,Combination,1000.0,B,1330095600,"[greedy, sortings]",PROGRAMMING -155,Codeforces Round #109 (Div. 2),2,Hometask,1500.0,C,1330095600,"[dp, greedy]",PROGRAMMING -155,Codeforces Round #109 (Div. 2),2,Colliders,2000.0,D,1330095600,"[math, number theory]",PROGRAMMING -155,Codeforces Round #109 (Div. 2),2,Double Profiles,2500.0,E,1330095600,"[hashing, sortings]",PROGRAMMING -156,Codeforces Round #110 (Div. 1),1,Message,500.0,A,1330536600,[brute force],PROGRAMMING -156,Codeforces Round #110 (Div. 1),1,Suspects,1000.0,B,1330536600,"[constructive algorithms, data structures, implementation]",PROGRAMMING -156,Codeforces Round #110 (Div. 1),1,Cipher,1500.0,C,1330536600,"[combinatorics, dp]",PROGRAMMING -156,Codeforces Round #110 (Div. 1),1,Clues,2500.0,D,1330536600,"[combinatorics, graphs]",PROGRAMMING -156,Codeforces Round #110 (Div. 1),1,Mrs. Hudson's Pancakes,2500.0,E,1330536600,"[brute force, dp]",PROGRAMMING -157,Codeforces Round #110 (Div. 2),2,Game Outcome,500.0,A,1330536600,[brute force],PROGRAMMING -157,Codeforces Round #110 (Div. 2),2,Trace,1000.0,B,1330536600,"[geometry, sortings]",PROGRAMMING -157,Codeforces Round #110 (Div. 2),2,Message,1500.0,C,1330536600,"[brute force, dp, strings]",PROGRAMMING -157,Codeforces Round #110 (Div. 2),2,Suspects,2000.0,D,1330536600,[implementation],PROGRAMMING -157,Codeforces Round #110 (Div. 2),2,Cipher,2500.0,E,1330536600,"[dp, math]",PROGRAMMING -160,Codeforces Round #111 (Div. 2),2,Twins,500.0,A,1331046000,"[greedy, sortings]",PROGRAMMING -160,Codeforces Round #111 (Div. 2),2,Unlucky Ticket,1000.0,B,1331046000,"[greedy, sortings]",PROGRAMMING -160,Codeforces Round #111 (Div. 2),2,Find Pair,1500.0,C,1331046000,"[implementation, math, sortings]",PROGRAMMING -160,Codeforces Round #111 (Div. 2),2,Edges in MST,2000.0,D,1331046000,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING -160,Codeforces Round #111 (Div. 2),2,Buses and People,2500.0,E,1331046000,"[binary search, data structures, sortings]",PROGRAMMING -161,VK Cup 2012 Round 1,12,Dress'em in Vests!,1000.0,A,1331478300,"[binary search, brute force, greedy, two pointers]",PROGRAMMING -161,VK Cup 2012 Round 1,12,Discounts,1000.0,B,1331478300,"[constructive algorithms, greedy, sortings]",PROGRAMMING -161,VK Cup 2012 Round 1,12,Abracadabra,2000.0,C,1331478300,[divide and conquer],PROGRAMMING -161,VK Cup 2012 Round 1,12,Distance in Tree,2000.0,D,1331478300,"[dfs and similar, dp, trees]",PROGRAMMING -161,VK Cup 2012 Round 1,12,Polycarpus the Safecracker,2500.0,E,1331478300,"[brute force, dp]",PROGRAMMING -163,VK Cup 2012 Round 2,12,Substring and Subsequence,1000.0,A,1332687900,[dp],PROGRAMMING -163,VK Cup 2012 Round 2,12,Lemmings,1000.0,B,1332687900,[binary search],PROGRAMMING -163,VK Cup 2012 Round 2,12,Conveyor,1500.0,C,1332687900,[sortings],PROGRAMMING -163,VK Cup 2012 Round 2,12,Large Refrigerator,2000.0,D,1332687900,[brute force],PROGRAMMING -163,VK Cup 2012 Round 2,12,e-Government,2500.0,E,1332687900,"[data structures, dfs and similar, dp, strings, trees]",PROGRAMMING -164,VK Cup 2012 Round 3,12,"Variable, or There and Back Again",500.0,A,1333897500,"[dfs and similar, graphs]",PROGRAMMING -164,VK Cup 2012 Round 3,12,Ancient Berland Hieroglyphs,1000.0,B,1333897500,[two pointers],PROGRAMMING -164,VK Cup 2012 Round 3,12,Machine Programming,1500.0,C,1333897500,[flows],PROGRAMMING -164,VK Cup 2012 Round 3,12,Minimum Diameter,2500.0,D,1333897500,"[binary search, brute force]",PROGRAMMING -164,VK Cup 2012 Round 3,12,Polycarpus and Tasks,2500.0,E,1333897500,[],PROGRAMMING -165,Codeforces Round #112 (Div. 2),2,Supercentral Point,500.0,A,1331911800,[implementation],PROGRAMMING -165,Codeforces Round #112 (Div. 2),2,Burning Midnight Oil,1000.0,B,1331911800,"[binary search, implementation]",PROGRAMMING -165,Codeforces Round #112 (Div. 2),2,Another Problem on Strings,1500.0,C,1331911800,"[binary search, brute force, dp, math, strings, two pointers]",PROGRAMMING -165,Codeforces Round #112 (Div. 2),2,Beard Graph,2000.0,D,1331911800,"[data structures, dsu, trees]",PROGRAMMING -165,Codeforces Round #112 (Div. 2),2,Compatible Numbers,2500.0,E,1331911800,"[bitmasks, brute force, dfs and similar, dp]",PROGRAMMING -166,Codeforces Round #113 (Div. 2),2,Rank List,500.0,A,1332516600,"[binary search, implementation, sortings]",PROGRAMMING -166,Codeforces Round #113 (Div. 2),2,Polygons,3000.0,B,1332516600,"[geometry, sortings]",PROGRAMMING -166,Codeforces Round #113 (Div. 2),2,Median,1000.0,C,1332516600,"[greedy, math, sortings]",PROGRAMMING -166,Codeforces Round #113 (Div. 2),2,Shoe Store,3000.0,D,1332516600,"[dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING -166,Codeforces Round #113 (Div. 2),2,Tetrahedron,1000.0,E,1332516600,"[dp, math, matrices]",PROGRAMMING -167,Codeforces Round #114 (Div. 1),1,Wizards and Trolleybuses,500.0,A,1332860400,[implementation],PROGRAMMING -167,Codeforces Round #114 (Div. 1),1,Wizards and Huge Prize,1000.0,B,1332860400,"[dp, probabilities]",PROGRAMMING -167,Codeforces Round #114 (Div. 1),1,Wizards and Numbers,1500.0,C,1332860400,"[games, math]",PROGRAMMING -167,Codeforces Round #114 (Div. 1),1,Wizards and Roads,2000.0,D,1332860400,"[data structures, divide and conquer, graph matchings]",PROGRAMMING -167,Codeforces Round #114 (Div. 1),1,Wizards and Bets,2500.0,E,1332860400,"[math, matrices]",PROGRAMMING -168,Codeforces Round #114 (Div. 2),2,Wizards and Demonstration,500.0,A,1332860400,[implementation],PROGRAMMING -168,Codeforces Round #114 (Div. 2),2,Wizards and Minimal Spell,1000.0,B,1332860400,"[implementation, strings]",PROGRAMMING -168,Codeforces Round #114 (Div. 2),2,Wizards and Trolleybuses,1500.0,C,1332860400,"[implementation, math]",PROGRAMMING -168,Codeforces Round #114 (Div. 2),2,Wizards and Huge Prize,2000.0,D,1332860400,"[dp, probabilities]",PROGRAMMING -168,Codeforces Round #114 (Div. 2),2,Wizards and Numbers,2500.0,E,1332860400,[],PROGRAMMING -169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Chores,500.0,A,1332687900,[sortings],PROGRAMMING -169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Replacing Digits,1000.0,B,1332687900,[greedy],PROGRAMMING -169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Substring and Subsequence,1500.0,C,1332687900,[dp],PROGRAMMING -169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Lemmings,2000.0,D,1332687900,[],PROGRAMMING -169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Conveyor,2500.0,E,1332687900,[],PROGRAMMING -173,Croc Champ 2012 - Round 1,12,Rock-Paper-Scissors,500.0,A,1333724400,"[implementation, math]",PROGRAMMING -173,Croc Champ 2012 - Round 1,12,Chamber of Secrets,1000.0,B,1333724400,"[dfs and similar, shortest paths]",PROGRAMMING -173,Croc Champ 2012 - Round 1,12,Spiral Maximum,1500.0,C,1333724400,"[brute force, dp]",PROGRAMMING -173,Croc Champ 2012 - Round 1,12,Deputies,2000.0,D,1333724400,"[constructive algorithms, graphs, greedy, implementation]",PROGRAMMING -173,Croc Champ 2012 - Round 1,12,Camping Groups,2500.0,E,1333724400,"[data structures, sortings]",PROGRAMMING -174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Problem About Equation,500.0,A,1333897500,[math],PROGRAMMING -174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,File List,1000.0,B,1333897500,"[dp, greedy, implementation]",PROGRAMMING -174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Range Increments,1500.0,C,1333897500,"[data structures, greedy]",PROGRAMMING -174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,"Variable, or There and Back Again",2500.0,D,1333897500,[graphs],PROGRAMMING -174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Ancient Berland Hieroglyphs,3000.0,E,1333897500,[],PROGRAMMING -175,Codeforces Round #115,12,Robot Bicorn Attack,500.0,A,1334390400,"[brute force, implementation]",PROGRAMMING -175,Codeforces Round #115,12,Plane of Tanks: Pro,500.0,B,1334390400,[implementation],PROGRAMMING -175,Codeforces Round #115,12,Geometry Horse,1000.0,C,1334390400,"[greedy, implementation, sortings]",PROGRAMMING -175,Codeforces Round #115,12,Plane of Tanks: Duel,2500.0,D,1334390400,"[brute force, dp, probabilities]",PROGRAMMING -175,Codeforces Round #115,12,Power Defence,3000.0,E,1334390400,"[brute force, dp, greedy]",PROGRAMMING -175,Codeforces Round #115,12,Gnomes of Might and Magic,3000.0,F,1334390400,"[data structures, graphs, implementation, shortest paths]",PROGRAMMING -176,Croc Champ 2012 - Round 2,12,Trading Business,500.0,A,1334934300,"[greedy, sortings]",PROGRAMMING -176,Croc Champ 2012 - Round 2,12,Word Cut,1000.0,B,1334934300,[dp],PROGRAMMING -176,Croc Champ 2012 - Round 2,12,Playing with Superglue,1500.0,C,1334934300,"[combinatorics, constructive algorithms]",PROGRAMMING -176,Croc Champ 2012 - Round 2,12,Hyper String,2000.0,D,1334934300,[dp],PROGRAMMING -176,Croc Champ 2012 - Round 2,12,Archaeology,2500.0,E,1334934300,"[data structures, dfs and similar, trees]",PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,30.0,A1,1335016800,[implementation],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,70.0,A2,1335016800,[implementation],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,30.0,B1,1335016800,[number theory],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,70.0,B2,1335016800,[number theory],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Party,30.0,C1,1335016800,"[dfs and similar, dsu, graphs]",PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Party,70.0,C2,1335016800,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,30.0,D1,1335016800,[brute force],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,70.0,D2,1335016800,[data structures],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Space Voyage,30.0,E1,1335016800,[binary search],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Space Voyage,70.0,E2,1335016800,[binary search],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Script Generation,30.0,F1,1335016800,[],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Script Generation,70.0,F2,1335016800,[],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,30.0,G1,1335016800,[strings],PROGRAMMING -177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,70.0,G2,1335016800,"[matrices, strings]",PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Educational Game,20.0,A1,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Educational Game,30.0,A2,1335614400,[greedy],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Educational Game,50.0,A3,1335614400,[greedy],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,20.0,B1,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,30.0,B2,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,50.0,B3,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,20.0,C1,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,30.0,C2,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,50.0,C3,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Magic Squares,20.0,D1,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Magic Squares,30.0,D2,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Magic Squares,50.0,D3,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,20.0,E1,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,30.0,E2,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,50.0,E3,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,20.0,F1,1335614400,[],PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,30.0,F2,1335614400,"[dp, sortings, strings]",PROGRAMMING -178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,50.0,F3,1335614400,[],PROGRAMMING -180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Defragmentation,,A,1335078000,[implementation],PROGRAMMING -180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Divisibility Rules,,B,1335078000,"[math, number theory]",PROGRAMMING -180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Letter,,C,1335078000,[dp],PROGRAMMING -180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Name,,D,1335078000,"[greedy, strings]",PROGRAMMING -180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Cubes,,E,1335078000,"[binary search, dp, two pointers]",PROGRAMMING -180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Mathematical Analysis Rocks!,,F,1335078000,"[constructive algorithms, implementation, math]",PROGRAMMING -181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Series of Crimes,500.0,A,1334934300,"[brute force, geometry, implementation]",PROGRAMMING -181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Number of Triplets,1000.0,B,1334934300,"[binary search, brute force]",PROGRAMMING -181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Trading Business,1500.0,C,1334934300,"[games, graph matchings, greedy]",PROGRAMMING -181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Word Cut,2000.0,D,1334934300,[dp],PROGRAMMING -181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Playing with Superglue,2500.0,E,1334934300,[games],PROGRAMMING -186,Codeforces Round #118 (Div. 2),2,Comparing Strings,500.0,A,1336145400,"[implementation, strings]",PROGRAMMING -186,Codeforces Round #118 (Div. 2),2,Growing Mushrooms,1000.0,B,1336145400,"[greedy, sortings]",PROGRAMMING -186,Codeforces Round #118 (Div. 2),2,Plant,1500.0,C,1336145400,"[dp, math, matrices, number theory]",PROGRAMMING -186,Codeforces Round #118 (Div. 2),2,Mushroom Scientists,2000.0,D,1336145400,"[math, number theory, probabilities]",PROGRAMMING -186,Codeforces Round #118 (Div. 2),2,Clever Fat Rat,2500.0,E,1336145400,[],PROGRAMMING -187,Codeforces Round #119 (Div. 1),1,Permutations,500.0,A,1336663800,[greedy],PROGRAMMING -187,Codeforces Round #119 (Div. 1),1,AlgoRace,1000.0,B,1336663800,"[dp, shortest paths]",PROGRAMMING -187,Codeforces Round #119 (Div. 1),1,Weak Memory,1500.0,C,1336663800,"[dfs and similar, dsu]",PROGRAMMING -187,Codeforces Round #119 (Div. 1),1,BRT Contract ,2000.0,D,1336663800,[data structures],PROGRAMMING -187,Codeforces Round #119 (Div. 1),1,Heaven Tour,2500.0,E,1336663800,"[data structures, greedy]",PROGRAMMING -189,Codeforces Round #119 (Div. 2),2,Cut Ribbon,500.0,A,1336663800,"[brute force, dp]",PROGRAMMING -189,Codeforces Round #119 (Div. 2),2,Counting Rhombi,1000.0,B,1336663800,"[brute force, math]",PROGRAMMING -189,Codeforces Round #119 (Div. 2),2,Permutations,1500.0,C,1336663800,"[greedy, implementation]",PROGRAMMING -189,Codeforces Round #119 (Div. 2),2,AlgoRace,2000.0,D,1336663800,"[dp, shortest paths]",PROGRAMMING -189,Codeforces Round #119 (Div. 2),2,Weak Memory,2500.0,E,1336663800,"[binary search, shortest paths]",PROGRAMMING -191,Codeforces Round #121 (Div. 1),1,Dynasty Puzzles,500.0,A,1338132600,[dp],PROGRAMMING -191,Codeforces Round #121 (Div. 1),1,Demonstration,1000.0,B,1338132600,[greedy],PROGRAMMING -191,Codeforces Round #121 (Div. 1),1,Fools and Roads,1500.0,C,1338132600,"[data structures, dfs and similar, trees]",PROGRAMMING -191,Codeforces Round #121 (Div. 1),1,Metro Scheme,2000.0,D,1338132600,"[graphs, greedy]",PROGRAMMING -191,Codeforces Round #121 (Div. 1),1,Thwarting Demonstrations,2500.0,E,1338132600,"[binary search, data structures, trees]",PROGRAMMING -192,Codeforces Round #121 (Div. 2),2,Funky Numbers,500.0,A,1338132600,"[binary search, brute force, implementation]",PROGRAMMING -192,Codeforces Round #121 (Div. 2),2,Walking in the Rain,1000.0,B,1338132600,"[brute force, implementation]",PROGRAMMING -192,Codeforces Round #121 (Div. 2),2,Dynasty Puzzles,1500.0,C,1338132600,[dp],PROGRAMMING -192,Codeforces Round #121 (Div. 2),2,Demonstration,2000.0,D,1338132600,"[brute force, constructive algorithms]",PROGRAMMING -192,Codeforces Round #121 (Div. 2),2,Fools and Roads,2500.0,E,1338132600,"[data structures, trees]",PROGRAMMING -193,Codeforces Round #122 (Div. 1),1,Cutting Figure,500.0,A,1338737400,"[2-sat, chinese remainder theorem, trees]",PROGRAMMING -193,Codeforces Round #122 (Div. 1),1,Xor,1000.0,B,1338737400,[brute force],PROGRAMMING -193,Codeforces Round #122 (Div. 1),1,Hamming Distance,2000.0,C,1338737400,"[constructive algorithms, greedy, math, matrices]",PROGRAMMING -193,Codeforces Round #122 (Div. 1),1,Two Segments,2000.0,D,1338737400,[data structures],PROGRAMMING -193,Codeforces Round #122 (Div. 1),1,Fibonacci Number,2500.0,E,1338737400,"[brute force, math, matrices]",PROGRAMMING -194,Codeforces Round #122 (Div. 2),2,Exams,500.0,A,1338737400,"[implementation, math]",PROGRAMMING -194,Codeforces Round #122 (Div. 2),2,Square,1000.0,B,1338737400,[math],PROGRAMMING -194,Codeforces Round #122 (Div. 2),2,Cutting Figure,1500.0,C,1338737400,"[dfs and similar, graphs, implementation, matrices, strings]",PROGRAMMING -194,Codeforces Round #122 (Div. 2),2,Xor,2000.0,D,1338737400,[],PROGRAMMING -194,Codeforces Round #122 (Div. 2),2,Hamming Distance,3000.0,E,1338737400,[math],PROGRAMMING -195,Codeforces Round #123 (Div. 2),2,Let's Watch Football,500.0,A,1339342200,"[binary search, brute force, math]",PROGRAMMING -195,Codeforces Round #123 (Div. 2),2,After Training,1000.0,B,1339342200,"[data structures, implementation, math]",PROGRAMMING -195,Codeforces Round #123 (Div. 2),2,Try and Catch,1500.0,C,1339342200,"[expression parsing, implementation]",PROGRAMMING -195,Codeforces Round #123 (Div. 2),2,Analyzing Polyline,2000.0,D,1339342200,"[math, sortings]",PROGRAMMING -195,Codeforces Round #123 (Div. 2),2,Building Forest,2500.0,E,1339342200,"[data structures, dsu]",PROGRAMMING -196,Codeforces Round #124 (Div. 1),1,Lexicographically Maximum Subsequence,500.0,A,1339506000,[greedy],PROGRAMMING -196,Codeforces Round #124 (Div. 1),1,Infinite Maze,1000.0,B,1339506000,[dfs and similar],PROGRAMMING -196,Codeforces Round #124 (Div. 1),1,Paint Tree,1500.0,C,1339506000,"[divide and conquer, geometry, sortings, trees]",PROGRAMMING -196,Codeforces Round #124 (Div. 1),1,The Next Good String,3000.0,D,1339506000,"[data structures, greedy, hashing, strings]",PROGRAMMING -196,Codeforces Round #124 (Div. 1),1,Opening Portals,2500.0,E,1339506000,"[dsu, graphs, shortest paths]",PROGRAMMING -197,Codeforces Round #124 (Div. 2),2,Plate Game,1000.0,A,1339506000,"[constructive algorithms, games, math]",PROGRAMMING -197,Codeforces Round #124 (Div. 2),2,Limit,500.0,B,1339506000,[math],PROGRAMMING -197,Codeforces Round #124 (Div. 2),2,Lexicographically Maximum Subsequence,500.0,C,1339506000,"[greedy, implementation, sortings]",PROGRAMMING -197,Codeforces Round #124 (Div. 2),2,Infinite Maze,3000.0,D,1339506000,[hashing],PROGRAMMING -197,Codeforces Round #124 (Div. 2),2,Paint Tree,3000.0,E,1339506000,"[constructive algorithms, dfs and similar, geometry]",PROGRAMMING -198,Codeforces Round #125 (Div. 1),1,About Bacteria,500.0,A,1340379000,"[implementation, math]",PROGRAMMING -198,Codeforces Round #125 (Div. 1),1,Jumping on Walls,1000.0,B,1340379000,[shortest paths],PROGRAMMING -198,Codeforces Round #125 (Div. 1),1,Delivering Carcinogen,1500.0,C,1340379000,"[binary search, geometry]",PROGRAMMING -198,Codeforces Round #125 (Div. 1),1,Cube Snake,2000.0,D,1340379000,[constructive algorithms],PROGRAMMING -198,Codeforces Round #125 (Div. 1),1,Gripping Story,2500.0,E,1340379000,"[binary search, data structures, sortings]",PROGRAMMING -199,Codeforces Round #125 (Div. 2),2,Hexadecimal's theorem,500.0,A,1340379000,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING -199,Codeforces Round #125 (Div. 2),2,Special Olympics,1000.0,B,1340379000,[geometry],PROGRAMMING -199,Codeforces Round #125 (Div. 2),2,About Bacteria,1500.0,C,1340379000,[math],PROGRAMMING -199,Codeforces Round #125 (Div. 2),2,Jumping on Walls,2000.0,D,1340379000,"[dfs and similar, shortest paths]",PROGRAMMING -199,Codeforces Round #125 (Div. 2),2,Delivering Carcinogen,2500.0,E,1340379000,"[binary search, geometry]",PROGRAMMING -200,Codeforces Round #126 (Div. 2),2,Cinema,3000.0,A,1340551800,"[brute force, data structures]",PROGRAMMING -200,Codeforces Round #126 (Div. 2),2,Drinks,500.0,B,1340551800,"[implementation, math]",PROGRAMMING -200,Codeforces Round #126 (Div. 2),2,Football Championship,2000.0,C,1340551800,"[brute force, implementation]",PROGRAMMING -200,Codeforces Round #126 (Div. 2),2,Programming Language,1500.0,D,1340551800,"[binary search, brute force, expression parsing, implementation]",PROGRAMMING -200,Codeforces Round #126 (Div. 2),2,Tractor College,3000.0,E,1340551800,"[implementation, math, number theory, ternary search]",PROGRAMMING -201,Codeforces Round #127 (Div. 1),1,Clear Symmetry,1000.0,A,1340983800,"[constructive algorithms, dp, math]",PROGRAMMING -201,Codeforces Round #127 (Div. 1),1,Guess That Car!,1000.0,B,1340983800,"[math, ternary search]",PROGRAMMING -201,Codeforces Round #127 (Div. 1),1,Fragile Bridges,1500.0,C,1340983800,[dp],PROGRAMMING -201,Codeforces Round #127 (Div. 1),1,Brand New Problem,2000.0,D,1340983800,"[bitmasks, brute force, dp]",PROGRAMMING -201,Codeforces Round #127 (Div. 1),1,Thoroughly Bureaucratic Organization,2500.0,E,1340983800,"[binary search, combinatorics]",PROGRAMMING -202,Codeforces Round #127 (Div. 2),2,LLPS,500.0,A,1340983800,"[binary search, bitmasks, brute force, greedy, implementation, strings]",PROGRAMMING -202,Codeforces Round #127 (Div. 2),2,Brand New Easy Problem,1000.0,B,1340983800,[brute force],PROGRAMMING -202,Codeforces Round #127 (Div. 2),2,Clear Symmetry,2000.0,C,1340983800,"[binary search, math]",PROGRAMMING -202,Codeforces Round #127 (Div. 2),2,Guess That Car!,2000.0,D,1340983800,"[dp, math]",PROGRAMMING -202,Codeforces Round #127 (Div. 2),2,Fragile Bridges,2500.0,E,1340983800,"[data structures, dp]",PROGRAMMING -203,Codeforces Round #128 (Div. 2),2,Two Problems,500.0,A,1341329400,"[brute force, implementation]",PROGRAMMING -203,Codeforces Round #128 (Div. 2),2,Game on Paper,1000.0,B,1341329400,"[brute force, implementation]",PROGRAMMING -203,Codeforces Round #128 (Div. 2),2,Photographer,1500.0,C,1341329400,"[greedy, sortings]",PROGRAMMING -203,Codeforces Round #128 (Div. 2),2,Hit Ball,2000.0,D,1341329400,"[geometry, implementation, math]",PROGRAMMING -203,Codeforces Round #128 (Div. 2),2,Transportation,2500.0,E,1341329400,"[greedy, sortings, two pointers]",PROGRAMMING -204,Codeforces Round #129 (Div. 1),1,Little Elephant and Interval,500.0,A,1342020600,"[binary search, combinatorics, dp]",PROGRAMMING -204,Codeforces Round #129 (Div. 1),1,Little Elephant and Cards,500.0,B,1342020600,"[binary search, data structures]",PROGRAMMING -204,Codeforces Round #129 (Div. 1),1,Little Elephant and Furik and Rubik,1500.0,C,1342020600,"[math, probabilities]",PROGRAMMING -204,Codeforces Round #129 (Div. 1),1,Little Elephant and Retro Strings,2000.0,D,1342020600,[dp],PROGRAMMING -204,Codeforces Round #129 (Div. 1),1,Little Elephant and Strings,2500.0,E,1342020600,"[data structures, implementation, string suffix structures, two pointers]",PROGRAMMING -205,Codeforces Round #129 (Div. 2),2,Little Elephant and Rozdil,500.0,A,1342020600,"[brute force, implementation]",PROGRAMMING -205,Codeforces Round #129 (Div. 2),2,Little Elephant and Sorting,1000.0,B,1342020600,"[brute force, greedy]",PROGRAMMING -205,Codeforces Round #129 (Div. 2),2,Little Elephant and Interval,1500.0,C,1342020600,"[binary search, brute force, combinatorics, dp, math]",PROGRAMMING -205,Codeforces Round #129 (Div. 2),2,Little Elephant and Cards,1500.0,D,1342020600,"[binary search, brute force, sortings]",PROGRAMMING -205,Codeforces Round #129 (Div. 2),2,Little Elephant and Furik and Rubik,2500.0,E,1342020600,"[brute force, combinatorics, probabilities]",PROGRAMMING -208,Codeforces Round #130 (Div. 2),2,Dubstep,500.0,A,1343057400,[strings],PROGRAMMING -208,Codeforces Round #130 (Div. 2),2,Solitaire,2000.0,B,1343057400,"[dfs and similar, dp]",PROGRAMMING -208,Codeforces Round #130 (Div. 2),2,Police Station,2500.0,C,1343057400,"[dp, graphs, shortest paths]",PROGRAMMING -208,Codeforces Round #130 (Div. 2),2,"Prizes, Prizes, more Prizes",500.0,D,1343057400,[implementation],PROGRAMMING -208,Codeforces Round #130 (Div. 2),2,Blood Cousins,3000.0,E,1343057400,"[binary search, data structures, dfs and similar, trees]",PROGRAMMING -211,VK Cup 2012 Finals,12,Privatization,3000.0,A,1342335600,[],PROGRAMMING -211,VK Cup 2012 Finals,12,Polycarpus is Looking for Good Substrings,1000.0,B,1342335600,[],PROGRAMMING -211,VK Cup 2012 Finals,12,Cowboys,500.0,C,1342335600,[],PROGRAMMING -211,VK Cup 2012 Finals,12,Cutting a Fence,1000.0,D,1342335600,[],PROGRAMMING -211,VK Cup 2012 Finals,12,IT Restaurants,500.0,E,1342335600,[],PROGRAMMING -213,Codeforces Round #131 (Div. 1),1,Game,1000.0,A,1343662200,"[dfs and similar, greedy]",PROGRAMMING -213,Codeforces Round #131 (Div. 1),1,Numbers,1000.0,B,1343662200,"[combinatorics, dp]",PROGRAMMING -213,Codeforces Round #131 (Div. 1),1,Relay Race,1500.0,C,1343662200,[dp],PROGRAMMING -213,Codeforces Round #131 (Div. 1),1,Stars,2000.0,D,1343662200,"[constructive algorithms, geometry]",PROGRAMMING -213,Codeforces Round #131 (Div. 1),1,Two Permutations,2500.0,E,1343662200,"[data structures, hashing, strings]",PROGRAMMING -214,Codeforces Round #131 (Div. 2),2,System of Equations,500.0,A,1343662200,[brute force],PROGRAMMING -214,Codeforces Round #131 (Div. 2),2,Hometask,1000.0,B,1343662200,"[brute force, constructive algorithms, greedy, math]",PROGRAMMING -214,Codeforces Round #131 (Div. 2),2,Game,2000.0,C,1343662200,"[brute force, greedy]",PROGRAMMING -214,Codeforces Round #131 (Div. 2),2,Numbers,2000.0,D,1343662200,"[combinatorics, dp, math]",PROGRAMMING -214,Codeforces Round #131 (Div. 2),2,Relay Race,2500.0,E,1343662200,[dp],PROGRAMMING -215,Codeforces Round #132 (Div. 2),2,Bicycle Chain,500.0,A,1344267000,"[brute force, implementation]",PROGRAMMING -215,Codeforces Round #132 (Div. 2),2,Olympic Medal,500.0,B,1344267000,"[greedy, math]",PROGRAMMING -215,Codeforces Round #132 (Div. 2),2,Crosses,3000.0,C,1344267000,"[brute force, implementation]",PROGRAMMING -215,Codeforces Round #132 (Div. 2),2,Hot Days,2000.0,D,1344267000,[greedy],PROGRAMMING -215,Codeforces Round #132 (Div. 2),2,Periodical Numbers,3000.0,E,1344267000,"[combinatorics, dp, number theory]",PROGRAMMING -216,Codeforces Round #133 (Div. 2),2,Tiling with Hexagons,500.0,A,1344958200,"[implementation, math]",PROGRAMMING -216,Codeforces Round #133 (Div. 2),2,Forming Teams,1500.0,B,1344958200,"[dfs and similar, implementation]",PROGRAMMING -216,Codeforces Round #133 (Div. 2),2,Hiring Staff,2000.0,C,1344958200,[greedy],PROGRAMMING -216,Codeforces Round #133 (Div. 2),2,Spider's Web,2000.0,D,1344958200,"[binary search, sortings, two pointers]",PROGRAMMING -216,Codeforces Round #133 (Div. 2),2,Martian Luck,3000.0,E,1344958200,"[math, number theory]",PROGRAMMING -217,Codeforces Round #134 (Div. 1),1,Ice Skating,500.0,A,1345273500,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING -217,Codeforces Round #134 (Div. 1),1,Blackboard Fibonacci,1000.0,B,1345273500,"[brute force, math]",PROGRAMMING -217,Codeforces Round #134 (Div. 1),1,Formurosa,2500.0,C,1345273500,"[divide and conquer, dp, expression parsing]",PROGRAMMING -217,Codeforces Round #134 (Div. 1),1,Bitonix' Patrol,3000.0,D,1345273500,"[bitmasks, brute force, combinatorics, dfs and similar, math]",PROGRAMMING -217,Codeforces Round #134 (Div. 1),1,Alien DNA,3000.0,E,1345273500,"[data structures, dsu, trees]",PROGRAMMING -218,Codeforces Round #134 (Div. 2),2,Mountain Scenery,500.0,A,1345273500,"[brute force, constructive algorithms, implementation]",PROGRAMMING -218,Codeforces Round #134 (Div. 2),2,Airport,500.0,B,1345273500,[implementation],PROGRAMMING -218,Codeforces Round #134 (Div. 2),2,Ice Skating,1000.0,C,1345273500,"[dfs and similar, dsu, graphs]",PROGRAMMING -218,Codeforces Round #134 (Div. 2),2,Blackboard Fibonacci,3000.0,D,1345273500,[implementation],PROGRAMMING -218,Codeforces Round #134 (Div. 2),2,Formurosa,3000.0,E,1345273500,[],PROGRAMMING -219,Codeforces Round #135 (Div. 2),2,k-String,500.0,A,1346081400,"[implementation, strings]",PROGRAMMING -219,Codeforces Round #135 (Div. 2),2,Special Offer! Super Price 999 Bourles!,1000.0,B,1346081400,[implementation],PROGRAMMING -219,Codeforces Round #135 (Div. 2),2,Color Stripe,1500.0,C,1346081400,"[brute force, dp, greedy]",PROGRAMMING -219,Codeforces Round #135 (Div. 2),2,Choosing Capital for Treeland,2000.0,D,1346081400,"[dfs and similar, dp, trees]",PROGRAMMING -219,Codeforces Round #135 (Div. 2),2,Parking Lot,3000.0,E,1346081400,[data structures],PROGRAMMING -220,Codeforces Round #136 (Div. 1),1,Little Elephant and Problem,500.0,A,1346427000,"[implementation, sortings]",PROGRAMMING -220,Codeforces Round #136 (Div. 1),1,Little Elephant and Array,1000.0,B,1346427000,"[constructive algorithms, data structures]",PROGRAMMING -220,Codeforces Round #136 (Div. 1),1,Little Elephant and Shifts,1500.0,C,1346427000,[data structures],PROGRAMMING -220,Codeforces Round #136 (Div. 1),1,Little Elephant and Triangle,2000.0,D,1346427000,"[chinese remainder theorem, geometry, math]",PROGRAMMING -220,Codeforces Round #136 (Div. 1),1,Little Elephant and Inversions,2500.0,E,1346427000,"[data structures, two pointers]",PROGRAMMING -221,Codeforces Round #136 (Div. 2),2,Little Elephant and Function,500.0,A,1346427000,"[implementation, math]",PROGRAMMING -221,Codeforces Round #136 (Div. 2),2,Little Elephant and Numbers,1000.0,B,1346427000,[implementation],PROGRAMMING -221,Codeforces Round #136 (Div. 2),2,Little Elephant and Problem,1500.0,C,1346427000,[sortings],PROGRAMMING -221,Codeforces Round #136 (Div. 2),2,Little Elephant and Array,2000.0,D,1346427000,[data structures],PROGRAMMING -221,Codeforces Round #136 (Div. 2),2,Little Elephant and Shifts,2500.0,E,1346427000,[],PROGRAMMING -222,Codeforces Round #137 (Div. 2),2,Shooshuns and Sequence ,500.0,A,1347291900,"[brute force, implementation]",PROGRAMMING -222,Codeforces Round #137 (Div. 2),2,Cosmic Tables,1000.0,B,1347291900,[implementation],PROGRAMMING -222,Codeforces Round #137 (Div. 2),2,Reducing Fractions,1500.0,C,1347291900,"[implementation, number theory, sortings]",PROGRAMMING -222,Codeforces Round #137 (Div. 2),2,Olympiad,2000.0,D,1347291900,"[binary search, greedy, sortings, two pointers]",PROGRAMMING -222,Codeforces Round #137 (Div. 2),2,Decoding Genome,2500.0,E,1347291900,[matrices],PROGRAMMING -223,Codeforces Round #138 (Div. 1),1,Bracket Sequence,500.0,A,1347809400,"[data structures, expression parsing, implementation]",PROGRAMMING -223,Codeforces Round #138 (Div. 1),1,Two Strings,1000.0,B,1347809400,"[data structures, dp, strings]",PROGRAMMING -223,Codeforces Round #138 (Div. 1),1,Partial Sums,1500.0,C,1347809400,"[combinatorics, math]",PROGRAMMING -223,Codeforces Round #138 (Div. 1),1,Spider,2000.0,D,1347809400,"[geometry, graphs]",PROGRAMMING -223,Codeforces Round #138 (Div. 1),1,Planar Graph,2500.0,E,1347809400,"[flows, geometry, graphs]",PROGRAMMING -224,Codeforces Round #138 (Div. 2),2,Parallelepiped,500.0,A,1347809400,"[brute force, math]",PROGRAMMING -224,Codeforces Round #138 (Div. 2),2,Array,1000.0,B,1347809400,"[bitmasks, implementation, two pointers]",PROGRAMMING -224,Codeforces Round #138 (Div. 2),2,Bracket Sequence,1500.0,C,1347809400,[data structures],PROGRAMMING -224,Codeforces Round #138 (Div. 2),2,Two Strings,2000.0,D,1347809400,"[data structures, strings]",PROGRAMMING -224,Codeforces Round #138 (Div. 2),2,Partial Sums,2500.0,E,1347809400,"[combinatorics, math]",PROGRAMMING -225,Codeforces Round #139 (Div. 2),2,Dice Tower,500.0,A,1348069500,"[constructive algorithms, greedy]",PROGRAMMING -225,Codeforces Round #139 (Div. 2),2,Well-known Numbers,1000.0,B,1348069500,"[binary search, greedy, number theory]",PROGRAMMING -225,Codeforces Round #139 (Div. 2),2,Barcode,1500.0,C,1348069500,"[dp, matrices]",PROGRAMMING -225,Codeforces Round #139 (Div. 2),2,Snake,3000.0,D,1348069500,"[bitmasks, dfs and similar, graphs, implementation]",PROGRAMMING -225,Codeforces Round #139 (Div. 2),2,Unsolvable,3000.0,E,1348069500,"[math, number theory]",PROGRAMMING -226,Codeforces Round #140 (Div. 1),1,Flying Saucer Segments,500.0,A,1348500600,[math],PROGRAMMING -226,Codeforces Round #140 (Div. 1),1,Naughty Stone Piles,1000.0,B,1348500600,[greedy],PROGRAMMING -226,Codeforces Round #140 (Div. 1),1,Anniversary,1500.0,C,1348500600,"[data structures, implementation, math, matrices, number theory]",PROGRAMMING -226,Codeforces Round #140 (Div. 1),1,The table,2000.0,D,1348500600,"[constructive algorithms, greedy]",PROGRAMMING -226,Codeforces Round #140 (Div. 1),1,Noble Knight's Path,2500.0,E,1348500600,"[data structures, trees]",PROGRAMMING -227,Codeforces Round #140 (Div. 2),2,Where do I Turn?,500.0,A,1348500600,[geometry],PROGRAMMING -227,Codeforces Round #140 (Div. 2),2,Effective Approach,1000.0,B,1348500600,[implementation],PROGRAMMING -227,Codeforces Round #140 (Div. 2),2,Flying Saucer Segments,1500.0,C,1348500600,[math],PROGRAMMING -227,Codeforces Round #140 (Div. 2),2,Naughty Stone Piles,2000.0,D,1348500600,"[math, sortings]",PROGRAMMING -227,Codeforces Round #140 (Div. 2),2,Anniversary,2500.0,E,1348500600,"[matrices, number theory]",PROGRAMMING -228,Codeforces Round #141 (Div. 2),2,Is your horseshoe on the other hoof?,500.0,A,1348759800,[implementation],PROGRAMMING -228,Codeforces Round #141 (Div. 2),2,Two Tables,1000.0,B,1348759800,"[brute force, implementation]",PROGRAMMING -228,Codeforces Round #141 (Div. 2),2,Fractal Detector,1500.0,C,1348759800,"[dp, hashing]",PROGRAMMING -228,Codeforces Round #141 (Div. 2),2,Zigzag,2000.0,D,1348759800,[data structures],PROGRAMMING -228,Codeforces Round #141 (Div. 2),2,The Road to Berland is Paved With Good Intentions,2500.0,E,1348759800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING -229,Codeforces Round #142 (Div. 1),1,Shifts,500.0,A,1349105400,"[brute force, two pointers]",PROGRAMMING -229,Codeforces Round #142 (Div. 1),1,Planets,500.0,B,1349105400,"[binary search, data structures, shortest paths]",PROGRAMMING -229,Codeforces Round #142 (Div. 1),1,Triangles,1000.0,C,1349105400,"[combinatorics, graphs, math]",PROGRAMMING -229,Codeforces Round #142 (Div. 1),1,Towers,1000.0,D,1349105400,"[dp, greedy, two pointers]",PROGRAMMING -229,Codeforces Round #142 (Div. 1),1,Gifts,3000.0,E,1349105400,"[combinatorics, dp, probabilities]",PROGRAMMING -230,Codeforces Round #142 (Div. 2),2,Dragons,500.0,A,1349105400,"[greedy, sortings]",PROGRAMMING -230,Codeforces Round #142 (Div. 2),2,T-primes,500.0,B,1349105400,"[implementation, math, number theory]",PROGRAMMING -230,Codeforces Round #142 (Div. 2),2,Shifts,1500.0,C,1349105400,"[binary search, data structures, dp, implementation]",PROGRAMMING -230,Codeforces Round #142 (Div. 2),2,Planets,2500.0,D,1349105400,"[binary search, graphs, shortest paths]",PROGRAMMING -230,Codeforces Round #142 (Div. 2),2,Triangles,3000.0,E,1349105400,"[combinatorics, graphs, math]",PROGRAMMING -231,Codeforces Round #143 (Div. 2),2,Team,500.0,A,1349623800,"[brute force, greedy]",PROGRAMMING -231,Codeforces Round #143 (Div. 2),2,"Magic, Wizardry and Wonders",1000.0,B,1349623800,"[constructive algorithms, greedy]",PROGRAMMING -231,Codeforces Round #143 (Div. 2),2,To Add or Not to Add,1500.0,C,1349623800,"[binary search, sortings, two pointers]",PROGRAMMING -231,Codeforces Round #143 (Div. 2),2,Magic Box,2000.0,D,1349623800,"[brute force, geometry]",PROGRAMMING -231,Codeforces Round #143 (Div. 2),2,Cactus,2500.0,E,1349623800,"[data structures, dfs and similar, dp, graphs, trees]",PROGRAMMING -232,Codeforces Round #144 (Div. 1),1,Cycles,500.0,A,1349969400,"[binary search, constructive algorithms, graphs, greedy]",PROGRAMMING -232,Codeforces Round #144 (Div. 1),1,Table,1000.0,B,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING -232,Codeforces Round #144 (Div. 1),1,Doe Graphs,1500.0,C,1349969400,"[constructive algorithms, divide and conquer, dp, graphs, shortest paths]",PROGRAMMING -232,Codeforces Round #144 (Div. 1),1,Fence,2000.0,D,1349969400,"[binary search, data structures, string suffix structures]",PROGRAMMING -232,Codeforces Round #144 (Div. 1),1,Quick Tortoise,2500.0,E,1349969400,"[bitmasks, divide and conquer, dp]",PROGRAMMING -233,Codeforces Round #144 (Div. 2),2,Perfect Permutation,500.0,A,1349969400,"[implementation, math]",PROGRAMMING -233,Codeforces Round #144 (Div. 2),2,Non-square Equation,1000.0,B,1349969400,"[binary search, brute force, math]",PROGRAMMING -233,Codeforces Round #144 (Div. 2),2,Cycles,1500.0,C,1349969400,"[combinatorics, graphs, matrices]",PROGRAMMING -233,Codeforces Round #144 (Div. 2),2,Table,2000.0,D,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING -233,Codeforces Round #144 (Div. 2),2,Doe Graphs,2500.0,E,1349969400,[],PROGRAMMING -234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Lefthanders and Righthanders ,,A,1350370800,[implementation],PROGRAMMING -234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Reading,,B,1350370800,[sortings],PROGRAMMING -234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Weather,,C,1350370800,"[dp, implementation]",PROGRAMMING -234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Cinema,,D,1350370800,[implementation],PROGRAMMING -234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Champions' League,,E,1350370800,[implementation],PROGRAMMING -234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Fence,,F,1350370800,[dp],PROGRAMMING -234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Practice,,G,1350370800,"[constructive algorithms, divide and conquer, implementation]",PROGRAMMING -234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Merging Two Decks,,H,1350370800,"[constructive algorithms, greedy]",PROGRAMMING -235,Codeforces Round #146 (Div. 1),1,LCM Challenge,500.0,A,1350803400,[number theory],PROGRAMMING -235,Codeforces Round #146 (Div. 1),1,Let's Play Osu!,1000.0,B,1350803400,"[dp, math, probabilities]",PROGRAMMING -235,Codeforces Round #146 (Div. 1),1,Cyclical Quest,1500.0,C,1350803400,"[string suffix structures, strings]",PROGRAMMING -235,Codeforces Round #146 (Div. 1),1,Graph Game,2000.0,D,1350803400,[graphs],PROGRAMMING -235,Codeforces Round #146 (Div. 1),1,Number Challenge,2500.0,E,1350803400,"[combinatorics, dp, implementation, number theory]",PROGRAMMING -236,Codeforces Round #146 (Div. 2),2,Boy or Girl,500.0,A,1350803400,[implementation],PROGRAMMING -236,Codeforces Round #146 (Div. 2),2,Easy Number Challenge,1000.0,B,1350803400,"[implementation, number theory]",PROGRAMMING -236,Codeforces Round #146 (Div. 2),2,LCM Challenge,1500.0,C,1350803400,"[greedy, number theory]",PROGRAMMING -236,Codeforces Round #146 (Div. 2),2,Let's Play Osu!,2000.0,D,1350803400,"[dp, probabilities]",PROGRAMMING -236,Codeforces Round #146 (Div. 2),2,Cyclical Quest,2500.0,E,1350803400,[],PROGRAMMING -237,Codeforces Round #147 (Div. 2),2,Free Cash,500.0,A,1351179000,[implementation],PROGRAMMING -237,Codeforces Round #147 (Div. 2),2,Young Table,1000.0,B,1351179000,"[implementation, sortings]",PROGRAMMING -237,Codeforces Round #147 (Div. 2),2,Primes on Interval,1500.0,C,1351179000,"[binary search, number theory, two pointers]",PROGRAMMING -237,Codeforces Round #147 (Div. 2),2,T-decomposition,2000.0,D,1351179000,"[dfs and similar, graphs, greedy]",PROGRAMMING -237,Codeforces Round #147 (Div. 2),2,Build String,2500.0,E,1351179000,"[flows, graphs]",PROGRAMMING -238,Codeforces Round #148 (Div. 1),1,Not Wool Sequences,500.0,A,1352044800,"[constructive algorithms, math]",PROGRAMMING -238,Codeforces Round #148 (Div. 1),1,Boring Partition,1000.0,B,1352044800,[constructive algorithms],PROGRAMMING -238,Codeforces Round #148 (Div. 1),1,World Eater Brothers,1500.0,C,1352044800,"[dfs and similar, dp, greedy, trees]",PROGRAMMING -238,Codeforces Round #148 (Div. 1),1,Tape Programming,2000.0,D,1352044800,"[data structures, implementation]",PROGRAMMING -238,Codeforces Round #148 (Div. 1),1,Meeting Her,2500.0,E,1352044800,"[dp, graphs, shortest paths]",PROGRAMMING -239,Codeforces Round #148 (Div. 2),2,Two Bags of Potatoes,500.0,A,1352044800,"[greedy, implementation, math]",PROGRAMMING -239,Codeforces Round #148 (Div. 2),2,Easy Tape Programming,1000.0,B,1352044800,"[brute force, implementation]",PROGRAMMING -239,Codeforces Round #148 (Div. 2),2,Not Wool Sequences,1500.0,C,1352044800,"[combinatorics, constructive algorithms, math]",PROGRAMMING -239,Codeforces Round #148 (Div. 2),2,Boring Partition,2000.0,D,1352044800,"[constructive algorithms, greedy, sortings]",PROGRAMMING -239,Codeforces Round #148 (Div. 2),2,World Eater Brothers,2500.0,E,1352044800,[],PROGRAMMING -240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Cinema,,A,1350370800,[implementation],PROGRAMMING -240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Fence,,B,1350370800,[dp],PROGRAMMING -240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Practice,,C,1350370800,"[constructive algorithms, implementation]",PROGRAMMING -240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Merging Two Decks,,D,1350370800,"[constructive algorithms, greedy]",PROGRAMMING -240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Road Repairs,,E,1350370800,"[dfs and similar, graphs, greedy]",PROGRAMMING -240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,TorCoder,,F,1350370800,[data structures],PROGRAMMING -242,Codeforces Round #149 (Div. 2),2,Heads or Tails,500.0,A,1352647800,"[brute force, implementation]",PROGRAMMING -242,Codeforces Round #149 (Div. 2),2,Big Segment,1000.0,B,1352647800,"[implementation, sortings]",PROGRAMMING -242,Codeforces Round #149 (Div. 2),2,King's Path,1500.0,C,1352647800,"[dfs and similar, hashing, shortest paths]",PROGRAMMING -242,Codeforces Round #149 (Div. 2),2,Dispute,2000.0,D,1352647800,"[dfs and similar, greedy]",PROGRAMMING -242,Codeforces Round #149 (Div. 2),2,XOR on Segment,2500.0,E,1352647800,"[bitmasks, data structures]",PROGRAMMING -243,Codeforces Round #150 (Div. 1),1,The Brand New Function,500.0,A,1353079800,[bitmasks],PROGRAMMING -243,Codeforces Round #150 (Div. 1),1,Hydra,1000.0,B,1353079800,"[graphs, sortings]",PROGRAMMING -243,Codeforces Round #150 (Div. 1),1,Colorado Potato Beetle,1500.0,C,1353079800,"[dfs and similar, implementation]",PROGRAMMING -243,Codeforces Round #150 (Div. 1),1,Cubes,2000.0,D,1353079800,"[data structures, dp, geometry, two pointers]",PROGRAMMING -243,Codeforces Round #150 (Div. 1),1,Matrix,2500.0,E,1353079800,[data structures],PROGRAMMING -244,Codeforces Round #150 (Div. 2),2,Dividing Orange,500.0,A,1353079800,[implementation],PROGRAMMING -244,Codeforces Round #150 (Div. 2),2,Undoubtedly Lucky Numbers,1000.0,B,1353079800,"[bitmasks, brute force, dfs and similar]",PROGRAMMING -244,Codeforces Round #150 (Div. 2),2,The Brand New Function,1500.0,C,1353079800,"[bitmasks, divide and conquer, math]",PROGRAMMING -244,Codeforces Round #150 (Div. 2),2,Hydra,2000.0,D,1353079800,[],PROGRAMMING -244,Codeforces Round #150 (Div. 2),2,Colorado Potato Beetle,2500.0,E,1353079800,[],PROGRAMMING -246,Codeforces Round #151 (Div. 2),2,Buggy Sorting,500.0,A,1353511800,"[constructive algorithms, greedy, sortings]",PROGRAMMING -246,Codeforces Round #151 (Div. 2),2,Increase and Decrease,1000.0,B,1353511800,"[greedy, math]",PROGRAMMING -246,Codeforces Round #151 (Div. 2),2,Beauty Pageant,1500.0,C,1353511800,"[brute force, constructive algorithms, greedy]",PROGRAMMING -246,Codeforces Round #151 (Div. 2),2,Colorful Graph,2000.0,D,1353511800,"[brute force, dfs and similar, graphs]",PROGRAMMING -246,Codeforces Round #151 (Div. 2),2,Blood Cousins Return,2500.0,E,1353511800,"[binary search, data structures, dfs and similar, dp, sortings]",PROGRAMMING -247,"CROC-MBTU 2012, Final Round",12,Paper Work,500.0,A,1353927300,[],PROGRAMMING -247,"CROC-MBTU 2012, Final Round",12,Restoring IPv6,1000.0,B,1353927300,[],PROGRAMMING -247,"CROC-MBTU 2012, Final Round",12,Movie Critics,1500.0,C,1353927300,[],PROGRAMMING -247,"CROC-MBTU 2012, Final Round",12,Building Bridge,1500.0,D,1353927300,[],PROGRAMMING -247,"CROC-MBTU 2012, Final Round",12,Mad Joe,2000.0,E,1353927300,[],PROGRAMMING -248,Codeforces Round #152 (Div. 2),2,Cupboards,500.0,A,1353857400,[implementation],PROGRAMMING -248,Codeforces Round #152 (Div. 2),2,Chilly Willy,1000.0,B,1353857400,"[math, number theory]",PROGRAMMING -248,Codeforces Round #152 (Div. 2),2,Robo-Footballer,2000.0,C,1353857400,"[binary search, geometry]",PROGRAMMING -248,Codeforces Round #152 (Div. 2),2,Sweets for Everyone!,2000.0,D,1353857400,"[binary search, greedy, implementation]",PROGRAMMING -248,Codeforces Round #152 (Div. 2),2,Piglet's Birthday,2500.0,E,1353857400,"[dp, probabilities]",PROGRAMMING -249,Codeforces Round #152 (Div. 1),1,Robo-Footballer,1000.0,A,1353857400,[geometry],PROGRAMMING -249,Codeforces Round #152 (Div. 1),1,Sweets for Everyone!,1000.0,B,1353857400,"[binary search, greedy]",PROGRAMMING -249,Codeforces Round #152 (Div. 1),1,Piglet's Birthday,1500.0,C,1353857400,"[dp, probabilities]",PROGRAMMING -249,Codeforces Round #152 (Div. 1),1,Donkey and Stars,1500.0,D,1353857400,"[data structures, dp, math, sortings]",PROGRAMMING -249,Codeforces Round #152 (Div. 1),1,Endless Matrix,2500.0,E,1353857400,[math],PROGRAMMING -250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Paper Work,500.0,A,1353938400,[greedy],PROGRAMMING -250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Restoring IPv6,1000.0,B,1353938400,"[implementation, strings]",PROGRAMMING -250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Movie Critics,1500.0,C,1353938400,[greedy],PROGRAMMING -250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Building Bridge,1500.0,D,1353938400,"[geometry, ternary search, two pointers]",PROGRAMMING -250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Mad Joe,2000.0,E,1353938400,[brute force],PROGRAMMING -251,Codeforces Round #153 (Div. 1),1,Points on Line,500.0,A,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING -251,Codeforces Round #153 (Div. 1),1,Playing with Permutations,1000.0,B,1354807800,"[implementation, math]",PROGRAMMING -251,Codeforces Round #153 (Div. 1),1,Number Transformation,1500.0,C,1354807800,"[dp, greedy, number theory]",PROGRAMMING -251,Codeforces Round #153 (Div. 1),1,Two Sets,2000.0,D,1354807800,"[bitmasks, math]",PROGRAMMING -251,Codeforces Round #153 (Div. 1),1,Tree and Table,2500.0,E,1354807800,"[dfs and similar, dp, implementation, trees]",PROGRAMMING -252,Codeforces Round #153 (Div. 2),2,Little Xor,500.0,A,1354807800,"[brute force, implementation]",PROGRAMMING -252,Codeforces Round #153 (Div. 2),2,Unsorting Array,1000.0,B,1354807800,"[brute force, sortings]",PROGRAMMING -252,Codeforces Round #153 (Div. 2),2,Points on Line,1500.0,C,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING -252,Codeforces Round #153 (Div. 2),2,Playing with Permutations,2000.0,D,1354807800,"[brute force, combinatorics, implementation]",PROGRAMMING -252,Codeforces Round #153 (Div. 2),2,Number Transformation,2500.0,E,1354807800,"[dp, number theory]",PROGRAMMING -253,Codeforces Round #154 (Div. 2),2,Boys and Girls,500.0,A,1354960800,[greedy],PROGRAMMING -253,Codeforces Round #154 (Div. 2),2,Physics Practical,1000.0,B,1354960800,"[binary search, dp, two pointers]",PROGRAMMING -253,Codeforces Round #154 (Div. 2),2,Text Editor,1500.0,C,1354960800,"[data structures, dfs and similar, greedy, shortest paths]",PROGRAMMING -253,Codeforces Round #154 (Div. 2),2,Table with Letters - 2,2000.0,D,1354960800,"[brute force, two pointers]",PROGRAMMING -253,Codeforces Round #154 (Div. 2),2,Printer,2500.0,E,1354960800,"[binary search, data structures, implementation, sortings]",PROGRAMMING -254,Codeforces Round #155 (Div. 2),2,Cards with Numbers,500.0,A,1355047200,"[constructive algorithms, sortings]",PROGRAMMING -254,Codeforces Round #155 (Div. 2),2,Jury Size,1000.0,B,1355047200,"[brute force, implementation]",PROGRAMMING -254,Codeforces Round #155 (Div. 2),2,Anagram,1500.0,C,1355047200,[greedy],PROGRAMMING -254,Codeforces Round #155 (Div. 2),2,Rats,2000.0,D,1355047200,"[brute force, dfs and similar, implementation]",PROGRAMMING -254,Codeforces Round #155 (Div. 2),2,Dormitory,2500.0,E,1355047200,"[dp, implementation]",PROGRAMMING -255,Codeforces Round #156 (Div. 2),2,Greg's Workout,500.0,A,1355671800,[implementation],PROGRAMMING -255,Codeforces Round #156 (Div. 2),2,Code Parsing,1000.0,B,1355671800,[implementation],PROGRAMMING -255,Codeforces Round #156 (Div. 2),2,Almost Arithmetical Progression,1500.0,C,1355671800,"[brute force, dp]",PROGRAMMING -255,Codeforces Round #156 (Div. 2),2,Mr. Bender and Square,2000.0,D,1355671800,"[binary search, implementation, math]",PROGRAMMING -255,Codeforces Round #156 (Div. 2),2,Furlo and Rublo and Game,2500.0,E,1355671800,"[games, implementation, math]",PROGRAMMING -256,Codeforces Round #156 (Div. 1),1,Almost Arithmetical Progression,500.0,A,1355671800,"[binary search, dp, two pointers]",PROGRAMMING -256,Codeforces Round #156 (Div. 1),1,Mr. Bender and Square,1000.0,B,1355671800,"[binary search, brute force, math]",PROGRAMMING -256,Codeforces Round #156 (Div. 1),1,Furlo and Rublo and Game,1500.0,C,1355671800,[games],PROGRAMMING -256,Codeforces Round #156 (Div. 1),1,Liars and Serge,2000.0,D,1355671800,[dp],PROGRAMMING -256,Codeforces Round #156 (Div. 1),1,Lucky Arrays,2500.0,E,1355671800,[data structures],PROGRAMMING -257,Codeforces Round #159 (Div. 2),2,Sockets,500.0,A,1357659000,"[greedy, implementation, sortings]",PROGRAMMING -257,Codeforces Round #159 (Div. 2),2,Playing Cubes,500.0,B,1357659000,"[games, greedy, implementation]",PROGRAMMING -257,Codeforces Round #159 (Div. 2),2,View Angle,1500.0,C,1357659000,"[brute force, geometry, math]",PROGRAMMING -257,Codeforces Round #159 (Div. 2),2,Sum,2000.0,D,1357659000,"[greedy, math]",PROGRAMMING -257,Codeforces Round #159 (Div. 2),2,Greedy Elevator,3000.0,E,1357659000,"[data structures, implementation]",PROGRAMMING -258,Codeforces Round #157 (Div. 1),1,Little Elephant and Bits,500.0,A,1356190200,"[greedy, math]",PROGRAMMING -258,Codeforces Round #157 (Div. 1),1,Little Elephant and Elections,1000.0,B,1356190200,"[brute force, combinatorics, dp]",PROGRAMMING -258,Codeforces Round #157 (Div. 1),1,Little Elephant and LCM,1500.0,C,1356190200,"[binary search, combinatorics, dp, math]",PROGRAMMING -258,Codeforces Round #157 (Div. 1),1,Little Elephant and Broken Sorting,2000.0,D,1356190200,"[dp, math, probabilities]",PROGRAMMING -258,Codeforces Round #157 (Div. 1),1,Little Elephant and Tree,2500.0,E,1356190200,"[data structures, dfs and similar, trees]",PROGRAMMING -259,Codeforces Round #157 (Div. 2),2,Little Elephant and Chess,500.0,A,1356190200,"[brute force, strings]",PROGRAMMING -259,Codeforces Round #157 (Div. 2),2,Little Elephant and Magic Square,1000.0,B,1356190200,"[brute force, implementation]",PROGRAMMING -259,Codeforces Round #157 (Div. 2),2,Little Elephant and Bits,1500.0,C,1356190200,"[greedy, strings]",PROGRAMMING -259,Codeforces Round #157 (Div. 2),2,Little Elephant and Elections,2000.0,D,1356190200,"[brute force, combinatorics, dp, math]",PROGRAMMING -259,Codeforces Round #157 (Div. 2),2,Little Elephant and LCM,2500.0,E,1356190200,"[binary search, combinatorics, math]",PROGRAMMING -260,Codeforces Round #158 (Div. 2),2,Adding Digits,500.0,A,1356622500,"[implementation, math]",PROGRAMMING -260,Codeforces Round #158 (Div. 2),2,Ancient Prophesy,1000.0,B,1356622500,"[brute force, implementation, strings]",PROGRAMMING -260,Codeforces Round #158 (Div. 2),2,Balls and Boxes,1500.0,C,1356622500,"[greedy, implementation]",PROGRAMMING -260,Codeforces Round #158 (Div. 2),2,Black and White Tree,2000.0,D,1356622500,"[constructive algorithms, dsu, graphs, greedy, trees]",PROGRAMMING -260,Codeforces Round #158 (Div. 2),2,Dividing Kingdom,2500.0,E,1356622500,"[binary search, brute force, data structures]",PROGRAMMING -261,Codeforces Round #160 (Div. 1),1,Maxim and Discounts,500.0,A,1358091000,"[greedy, sortings]",PROGRAMMING -261,Codeforces Round #160 (Div. 1),1,Maxim and Restaurant,1000.0,B,1358091000,"[dp, math, probabilities]",PROGRAMMING -261,Codeforces Round #160 (Div. 1),1,Maxim and Matrix,1500.0,C,1358091000,"[constructive algorithms, dp, math]",PROGRAMMING -261,Codeforces Round #160 (Div. 1),1,Maxim and Increasing Subsequence,2000.0,D,1358091000,[dp],PROGRAMMING -261,Codeforces Round #160 (Div. 1),1,Maxim and Calculator,2500.0,E,1358091000,"[brute force, dp, two pointers]",PROGRAMMING -262,Codeforces Round #160 (Div. 2),2,Roma and Lucky Numbers,500.0,A,1358091000,[implementation],PROGRAMMING -262,Codeforces Round #160 (Div. 2),2,Roma and Changing Signs,1000.0,B,1358091000,[greedy],PROGRAMMING -262,Codeforces Round #160 (Div. 2),2,Maxim and Discounts,1500.0,C,1358091000,"[greedy, sortings]",PROGRAMMING -262,Codeforces Round #160 (Div. 2),2,Maxim and Restaurant,2000.0,D,1358091000,"[combinatorics, dp]",PROGRAMMING -262,Codeforces Round #160 (Div. 2),2,Maxim and Matrix,2500.0,E,1358091000,[dp],PROGRAMMING -263,Codeforces Round #161 (Div. 2),2,Beautiful Matrix,500.0,A,1358350200,[implementation],PROGRAMMING -263,Codeforces Round #161 (Div. 2),2,Squares,500.0,B,1358350200,"[greedy, implementation, sortings]",PROGRAMMING -263,Codeforces Round #161 (Div. 2),2,Circle of Numbers,2500.0,C,1358350200,"[dfs and similar, implementation]",PROGRAMMING -263,Codeforces Round #161 (Div. 2),2,Cycle in Graph,2000.0,D,1358350200,"[dfs and similar, graphs]",PROGRAMMING -263,Codeforces Round #161 (Div. 2),2,Rhombus,3000.0,E,1358350200,"[brute force, data structures, dp]",PROGRAMMING -264,Codeforces Round #162 (Div. 1),1,Escape from Stones,500.0,A,1358686800,"[constructive algorithms, data structures, implementation, two pointers]",PROGRAMMING -264,Codeforces Round #162 (Div. 1),1,Good Sequences,1000.0,B,1358686800,"[dp, number theory]",PROGRAMMING -264,Codeforces Round #162 (Div. 1),1,Choosing Balls,1500.0,C,1358686800,[dp],PROGRAMMING -264,Codeforces Round #162 (Div. 1),1,Colorful Stones,2000.0,D,1358686800,"[dp, two pointers]",PROGRAMMING -264,Codeforces Round #162 (Div. 1),1,Roadside Trees,2500.0,E,1358686800,"[data structures, dp]",PROGRAMMING -265,Codeforces Round #162 (Div. 2),2,Colorful Stones (Simplified Edition),500.0,A,1358686800,[implementation],PROGRAMMING -265,Codeforces Round #162 (Div. 2),2,Roadside Trees (Simplified Edition),1000.0,B,1358686800,"[greedy, implementation]",PROGRAMMING -265,Codeforces Round #162 (Div. 2),2,Escape from Stones,1500.0,C,1358686800,"[greedy, implementation]",PROGRAMMING -265,Codeforces Round #162 (Div. 2),2,Good Sequences,2000.0,D,1358686800,"[dp, number theory]",PROGRAMMING -265,Codeforces Round #162 (Div. 2),2,Choosing Balls,2500.0,E,1358686800,"[schedules, sortings]",PROGRAMMING -266,Codeforces Round #163 (Div. 2),2,Stones on the Table,500.0,A,1358868600,[implementation],PROGRAMMING -266,Codeforces Round #163 (Div. 2),2,Queue at the School,500.0,B,1358868600,"[constructive algorithms, graph matchings, implementation, shortest paths]",PROGRAMMING -266,Codeforces Round #163 (Div. 2),2,Below the Diagonal,2500.0,C,1358868600,"[constructive algorithms, greedy, math]",PROGRAMMING -266,Codeforces Round #163 (Div. 2),2,BerDonalds,3000.0,D,1358868600,"[graphs, math, shortest paths]",PROGRAMMING -266,Codeforces Round #163 (Div. 2),2,More Queries to Array...,3000.0,E,1358868600,"[data structures, math]",PROGRAMMING -268,Codeforces Round #164 (Div. 2),2,Games,500.0,A,1359387000,[brute force],PROGRAMMING -268,Codeforces Round #164 (Div. 2),2,Buttons,1000.0,B,1359387000,"[implementation, math]",PROGRAMMING -268,Codeforces Round #164 (Div. 2),2,Beautiful Sets of Points,1500.0,C,1359387000,"[constructive algorithms, implementation]",PROGRAMMING -268,Codeforces Round #164 (Div. 2),2,Wall Bars,2500.0,D,1359387000,[dp],PROGRAMMING -268,Codeforces Round #164 (Div. 2),2,Playlist,2500.0,E,1359387000,"[math, probabilities, sortings]",PROGRAMMING -269,Codeforces Round #165 (Div. 1),1,Magical Boxes,500.0,A,1359732600,"[greedy, math]",PROGRAMMING -269,Codeforces Round #165 (Div. 1),1,Greenhouse Effect,1000.0,B,1359732600,[dp],PROGRAMMING -269,Codeforces Round #165 (Div. 1),1,Flawed Flow,1500.0,C,1359732600,"[constructive algorithms, flows, graphs]",PROGRAMMING -269,Codeforces Round #165 (Div. 1),1,Maximum Waterfall,2000.0,D,1359732600,"[data structures, dp]",PROGRAMMING -269,Codeforces Round #165 (Div. 1),1,String Theory,2500.0,E,1359732600,[],PROGRAMMING -270,Codeforces Round #165 (Div. 2),2,Fancy Fence,500.0,A,1359732600,"[geometry, implementation, math]",PROGRAMMING -270,Codeforces Round #165 (Div. 2),2,Multithreading,1500.0,B,1359732600,"[data structures, greedy, implementation]",PROGRAMMING -270,Codeforces Round #165 (Div. 2),2,Magical Boxes,1500.0,C,1359732600,"[binary search, greedy, implementation, math, sortings]",PROGRAMMING -270,Codeforces Round #165 (Div. 2),2,Greenhouse Effect,2000.0,D,1359732600,[dp],PROGRAMMING -270,Codeforces Round #165 (Div. 2),2,Flawed Flow,2500.0,E,1359732600,"[dfs and similar, sortings]",PROGRAMMING -271,Codeforces Round #166 (Div. 2),2,Beautiful Year,500.0,A,1360596600,[brute force],PROGRAMMING -271,Codeforces Round #166 (Div. 2),2,Prime Matrix,1000.0,B,1360596600,"[binary search, brute force, math, number theory]",PROGRAMMING -271,Codeforces Round #166 (Div. 2),2,Secret,1500.0,C,1360596600,"[constructive algorithms, implementation]",PROGRAMMING -271,Codeforces Round #166 (Div. 2),2,Good Substrings,2000.0,D,1360596600,"[data structures, strings]",PROGRAMMING -271,Codeforces Round #166 (Div. 2),2,Three Horses,3000.0,E,1360596600,"[constructive algorithms, math, number theory]",PROGRAMMING -272,Codeforces Round #167 (Div. 2),2,Dima and Friends,500.0,A,1360769400,"[implementation, math]",PROGRAMMING -272,Codeforces Round #167 (Div. 2),2,Dima and Sequence,1000.0,B,1360769400,"[implementation, math]",PROGRAMMING -272,Codeforces Round #167 (Div. 2),2,Dima and Staircase,1500.0,C,1360769400,"[data structures, implementation]",PROGRAMMING -272,Codeforces Round #167 (Div. 2),2,Dima and Two Sequences,2000.0,D,1360769400,"[combinatorics, math, sortings]",PROGRAMMING -272,Codeforces Round #167 (Div. 2),2,Dima and Horses,2500.0,E,1360769400,"[combinatorics, constructive algorithms, graphs]",PROGRAMMING -273,Codeforces Round #167 (Div. 1),1,Dima and Staircase,500.0,A,1360769400,[],PROGRAMMING -273,Codeforces Round #167 (Div. 1),1,Dima and Two Sequences,1000.0,B,1360769400,[combinatorics],PROGRAMMING -273,Codeforces Round #167 (Div. 1),1,Dima and Horses,1500.0,C,1360769400,"[graphs, greedy]",PROGRAMMING -273,Codeforces Round #167 (Div. 1),1,Dima and Figure,2000.0,D,1360769400,[dp],PROGRAMMING -273,Codeforces Round #167 (Div. 1),1,Dima and Game,2500.0,E,1360769400,"[dp, games]",PROGRAMMING -274,Codeforces Round #168 (Div. 1),1,k-Multiple Free Set,500.0,A,1361374200,"[binary search, greedy, sortings]",PROGRAMMING -274,Codeforces Round #168 (Div. 1),1,Zero Tree,1000.0,B,1361374200,"[dfs and similar, dp, greedy, trees]",PROGRAMMING -274,Codeforces Round #168 (Div. 1),1,The Last Hole!,1500.0,C,1361374200,"[brute force, geometry]",PROGRAMMING -274,Codeforces Round #168 (Div. 1),1,Lovely Matrix,2000.0,D,1361374200,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING -274,Codeforces Round #168 (Div. 1),1,Mirror Room,2000.0,E,1361374200,"[data structures, implementation]",PROGRAMMING -275,Codeforces Round #168 (Div. 2),2,Lights Out,500.0,A,1361374200,[implementation],PROGRAMMING -275,Codeforces Round #168 (Div. 2),2,Convex Shape,1000.0,B,1361374200,"[constructive algorithms, implementation]",PROGRAMMING -275,Codeforces Round #168 (Div. 2),2,k-Multiple Free Set,1500.0,C,1361374200,"[binary search, greedy, sortings]",PROGRAMMING -275,Codeforces Round #168 (Div. 2),2,Zero Tree,2000.0,D,1361374200,"[dfs and similar, dp, trees]",PROGRAMMING -275,Codeforces Round #168 (Div. 2),2,The Last Hole!,2500.0,E,1361374200,[],PROGRAMMING -276,Codeforces Round #169 (Div. 2),2,Lunch Rush,500.0,A,1361719800,[implementation],PROGRAMMING -276,Codeforces Round #169 (Div. 2),2,Little Girl and Game,1000.0,B,1361719800,"[games, greedy]",PROGRAMMING -276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum Sum,1500.0,C,1361719800,"[data structures, implementation, sortings]",PROGRAMMING -276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum XOR,2000.0,D,1361719800,"[bitmasks, dp, greedy, implementation, math]",PROGRAMMING -276,Codeforces Round #169 (Div. 2),2,Little Girl and Problem on Trees,2500.0,E,1361719800,"[data structures, trees]",PROGRAMMING -277,Codeforces Round #170 (Div. 1),1,Learning Languages,500.0,A,1362065400,"[dfs and similar, dsu]",PROGRAMMING -277,Codeforces Round #170 (Div. 1),1,Set of Points,1500.0,B,1362065400,"[constructive algorithms, geometry]",PROGRAMMING -277,Codeforces Round #170 (Div. 1),1,Game,2000.0,C,1362065400,"[games, implementation]",PROGRAMMING -277,Codeforces Round #170 (Div. 1),1,Google Code Jam,3000.0,D,1362065400,"[dp, probabilities]",PROGRAMMING -277,Codeforces Round #170 (Div. 1),1,Binary Tree on Plane,2000.0,E,1362065400,[flows],PROGRAMMING -278,Codeforces Round #170 (Div. 2),2,Circle Line,500.0,A,1362065400,[implementation],PROGRAMMING -278,Codeforces Round #170 (Div. 2),2,New Problem,1000.0,B,1362065400,"[brute force, strings]",PROGRAMMING -278,Codeforces Round #170 (Div. 2),2,Learning Languages,1000.0,C,1362065400,[dsu],PROGRAMMING -278,Codeforces Round #170 (Div. 2),2,Set of Points,3000.0,D,1362065400,"[constructive algorithms, geometry]",PROGRAMMING -278,Codeforces Round #170 (Div. 2),2,Game,3000.0,E,1362065400,[games],PROGRAMMING -279,Codeforces Round #171 (Div. 2),2,Point on Spiral,500.0,A,1362411000,"[brute force, geometry, implementation]",PROGRAMMING -279,Codeforces Round #171 (Div. 2),2,Books,1000.0,B,1362411000,"[binary search, brute force, implementation, two pointers]",PROGRAMMING -279,Codeforces Round #171 (Div. 2),2,Ladder,1500.0,C,1362411000,"[dp, implementation, two pointers]",PROGRAMMING -279,Codeforces Round #171 (Div. 2),2,The Minimum Number of Variables,2000.0,D,1362411000,"[bitmasks, dp]",PROGRAMMING -279,Codeforces Round #171 (Div. 2),2,Beautiful Decomposition,2000.0,E,1362411000,"[games, greedy]",PROGRAMMING -280,Codeforces Round #172 (Div. 1),1,Rectangle Puzzle,500.0,A,1362929400,[geometry],PROGRAMMING -280,Codeforces Round #172 (Div. 1),1,Maximum Xor Secondary,1000.0,B,1362929400,"[data structures, implementation, two pointers]",PROGRAMMING -280,Codeforces Round #172 (Div. 1),1,Game on Tree,1500.0,C,1362929400,"[implementation, math, probabilities, trees]",PROGRAMMING -280,Codeforces Round #172 (Div. 1),1,k-Maximum Subsequence Sum,2000.0,D,1362929400,"[data structures, flows]",PROGRAMMING -280,Codeforces Round #172 (Div. 1),1,Sequence Transformation,2500.0,E,1362929400,"[data structures, dp, implementation, math]",PROGRAMMING -281,Codeforces Round #172 (Div. 2),2,Word Capitalization,500.0,A,1362929400,[strings],PROGRAMMING -281,Codeforces Round #172 (Div. 2),2,Nearest Fraction,1000.0,B,1362929400,"[brute force, implementation, two pointers]",PROGRAMMING -281,Codeforces Round #172 (Div. 2),2,Rectangle Puzzle,1500.0,C,1362929400,"[geometry, implementation]",PROGRAMMING -281,Codeforces Round #172 (Div. 2),2,Maximum Xor Secondary,2000.0,D,1362929400,[two pointers],PROGRAMMING -281,Codeforces Round #172 (Div. 2),2,Game on Tree,2500.0,E,1362929400,[math],PROGRAMMING -282,Codeforces Round #173 (Div. 2),2,Bit++,500.0,A,1363188600,[implementation],PROGRAMMING -282,Codeforces Round #173 (Div. 2),2,Painting Eggs,1000.0,B,1363188600,"[greedy, math]",PROGRAMMING -282,Codeforces Round #173 (Div. 2),2,XOR and OR,1500.0,C,1363188600,"[constructive algorithms, implementation, math]",PROGRAMMING -282,Codeforces Round #173 (Div. 2),2,Yet Another Number Game,2000.0,D,1363188600,"[dp, games]",PROGRAMMING -282,Codeforces Round #173 (Div. 2),2,Sausage Maximization,2500.0,E,1363188600,"[bitmasks, data structures, trees]",PROGRAMMING -283,Codeforces Round #174 (Div. 1),1,Cows and Sequence,1000.0,A,1363534200,"[constructive algorithms, implementation]",PROGRAMMING -283,Codeforces Round #174 (Div. 1),1,Cow Program,1000.0,B,1363534200,"[dfs and similar, dp, graphs]",PROGRAMMING -283,Codeforces Round #174 (Div. 1),1,Coin Troubles,1500.0,C,1363534200,[dp],PROGRAMMING -283,Codeforces Round #174 (Div. 1),1,Cows and Cool Sequences,2000.0,D,1363534200,"[dp, math, number theory]",PROGRAMMING -283,Codeforces Round #174 (Div. 1),1,Cow Tennis Tournament,2500.0,E,1363534200,"[combinatorics, data structures, math]",PROGRAMMING -284,Codeforces Round #174 (Div. 2),2,Cows and Primitive Roots,500.0,A,1363534200,"[implementation, math, number theory]",PROGRAMMING -284,Codeforces Round #174 (Div. 2),2,Cows and Poker Game,1000.0,B,1363534200,"[brute force, implementation]",PROGRAMMING -284,Codeforces Round #174 (Div. 2),2,Cows and Sequence,2000.0,C,1363534200,"[constructive algorithms, data structures, dp]",PROGRAMMING -284,Codeforces Round #174 (Div. 2),2,Cow Program,2000.0,D,1363534200,"[dfs and similar, dp]",PROGRAMMING -284,Codeforces Round #174 (Div. 2),2,Coin Troubles,2500.0,E,1363534200,"[dfs and similar, dp]",PROGRAMMING -285,Codeforces Round #175 (Div. 2),2,Slightly Decreasing Permutations,500.0,A,1363879800,"[greedy, implementation]",PROGRAMMING -285,Codeforces Round #175 (Div. 2),2,Find Marble,1000.0,B,1363879800,[implementation],PROGRAMMING -285,Codeforces Round #175 (Div. 2),2,Building Permutation,1500.0,C,1363879800,"[greedy, implementation, sortings]",PROGRAMMING -285,Codeforces Round #175 (Div. 2),2,Permutation Sum,2000.0,D,1363879800,"[bitmasks, combinatorics, dp, implementation, meet-in-the-middle]",PROGRAMMING -285,Codeforces Round #175 (Div. 2),2,Positions in Permutations,2500.0,E,1363879800,"[combinatorics, dp, math]",PROGRAMMING -286,Codeforces Round #176 (Div. 1),1,Lucky Permutation,500.0,A,1364025600,"[constructive algorithms, math]",PROGRAMMING -286,Codeforces Round #176 (Div. 1),1,Shifting,1500.0,B,1364025600,[implementation],PROGRAMMING -286,Codeforces Round #176 (Div. 1),1,Main Sequence,1500.0,C,1364025600,"[greedy, implementation]",PROGRAMMING -286,Codeforces Round #176 (Div. 1),1,Tourists,2000.0,D,1364025600,"[data structures, sortings]",PROGRAMMING -286,Codeforces Round #176 (Div. 1),1,Ladies' Shop,2500.0,E,1364025600,"[constructive algorithms, fft, math]",PROGRAMMING -287,Codeforces Round #176 (Div. 2),2,IQ Test,500.0,A,1364025600,"[brute force, implementation]",PROGRAMMING -287,Codeforces Round #176 (Div. 2),2,Pipeline,1500.0,B,1364025600,"[binary search, math]",PROGRAMMING -287,Codeforces Round #176 (Div. 2),2,Lucky Permutation,1500.0,C,1364025600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING -287,Codeforces Round #176 (Div. 2),2,Shifting,2500.0,D,1364025600,[],PROGRAMMING -287,Codeforces Round #176 (Div. 2),2,Main Sequence,2500.0,E,1364025600,"[data structures, greedy]",PROGRAMMING -288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Strings,500.0,A,1364916600,[greedy],PROGRAMMING -288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Houses ,1000.0,B,1364916600,[combinatorics],PROGRAMMING -288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and XOR operation,1500.0,C,1364916600,"[implementation, math]",PROGRAMMING -288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Trees ,2000.0,D,1364916600,"[combinatorics, dfs and similar, trees]",PROGRAMMING -288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Lucky Numbers,2500.0,E,1364916600,"[dp, implementation, math]",PROGRAMMING -289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Segments ,500.0,A,1364916600,"[brute force, implementation]",PROGRAMMING -289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Matrix,1000.0,B,1364916600,"[brute force, dp, implementation, sortings, ternary search]",PROGRAMMING -289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Strings,1500.0,C,1364916600,"[constructive algorithms, implementation]",PROGRAMMING -289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Houses ,2000.0,D,1364916600,"[brute force, combinatorics, dfs and similar, math]",PROGRAMMING -289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and XOR operation,2500.0,E,1364916600,"[data structures, greedy, implementation, math]",PROGRAMMING -292,Croc Champ 2013 - Round 1,12,SMSC,1000.0,A,1366040100,[implementation],PROGRAMMING -292,Croc Champ 2013 - Round 1,12,Network Topology,1000.0,B,1366040100,"[graphs, implementation]",PROGRAMMING -292,Croc Champ 2013 - Round 1,12,Beautiful IP Addresses,1500.0,C,1366040100,[brute force],PROGRAMMING -292,Croc Champ 2013 - Round 1,12,Connected Components,2000.0,D,1366040100,"[data structures, dfs and similar, dp, dsu]",PROGRAMMING -292,Croc Champ 2013 - Round 1,12,Copying Data,2500.0,E,1366040100,[data structures],PROGRAMMING -293,Croc Champ 2013 - Round 2,12,Weird Game,500.0,A,1366644900,"[games, greedy]",PROGRAMMING -293,Croc Champ 2013 - Round 2,12,Distinct Paths,1500.0,B,1366644900,"[brute force, combinatorics]",PROGRAMMING -293,Croc Champ 2013 - Round 2,12,Cube Problem,1500.0,C,1366644900,"[brute force, math, number theory]",PROGRAMMING -293,Croc Champ 2013 - Round 2,12,Ksusha and Square,2000.0,D,1366644900,"[geometry, math, probabilities, two pointers]",PROGRAMMING -293,Croc Champ 2013 - Round 2,12,Close Vertices,2500.0,E,1366644900,"[data structures, divide and conquer, trees]",PROGRAMMING -294,Codeforces Round #178 (Div. 2),2,Shaass and Oskols,500.0,A,1365348600,"[implementation, math]",PROGRAMMING -294,Codeforces Round #178 (Div. 2),2,Shaass and Bookshelf,1000.0,B,1365348600,"[dp, greedy]",PROGRAMMING -294,Codeforces Round #178 (Div. 2),2,Shaass and Lights,1500.0,C,1365348600,"[combinatorics, number theory]",PROGRAMMING -294,Codeforces Round #178 (Div. 2),2,Shaass and Painter Robot,2000.0,D,1365348600,"[brute force, implementation, number theory]",PROGRAMMING -294,Codeforces Round #178 (Div. 2),2,Shaass the Great,2500.0,E,1365348600,"[dp, trees]",PROGRAMMING -295,Codeforces Round #179 (Div. 1),1,Greg and Array,500.0,A,1365694200,"[data structures, implementation]",PROGRAMMING -295,Codeforces Round #179 (Div. 1),1,Greg and Graph,1000.0,B,1365694200,"[dp, graphs, shortest paths]",PROGRAMMING -295,Codeforces Round #179 (Div. 1),1,Greg and Friends,1500.0,C,1365694200,"[combinatorics, dp, graphs, shortest paths]",PROGRAMMING -295,Codeforces Round #179 (Div. 1),1,Greg and Caves,2000.0,D,1365694200,"[combinatorics, dp]",PROGRAMMING -295,Codeforces Round #179 (Div. 1),1,Yaroslav and Points,2500.0,E,1365694200,[data structures],PROGRAMMING -296,Codeforces Round #179 (Div. 2),2,Yaroslav and Permutations,500.0,A,1365694200,"[greedy, math]",PROGRAMMING -296,Codeforces Round #179 (Div. 2),2,Yaroslav and Two Strings,1500.0,B,1365694200,"[combinatorics, dp]",PROGRAMMING -296,Codeforces Round #179 (Div. 2),2,Greg and Array,1500.0,C,1365694200,"[data structures, dp, implementation]",PROGRAMMING -296,Codeforces Round #179 (Div. 2),2,Greg and Graph,2000.0,D,1365694200,"[dp, graphs]",PROGRAMMING -296,Codeforces Round #179 (Div. 2),2,Greg and Friends,2500.0,E,1365694200,"[combinatorics, dfs and similar, dp]",PROGRAMMING -297,Codeforces Round #180 (Div. 1),1,Parity Game,500.0,A,1366385400,[constructive algorithms],PROGRAMMING -297,Codeforces Round #180 (Div. 1),1,Fish Weight,500.0,B,1366385400,"[constructive algorithms, greedy]",PROGRAMMING -297,Codeforces Round #180 (Div. 1),1,Splitting the Uniqueness,2000.0,C,1366385400,[constructive algorithms],PROGRAMMING -297,Codeforces Round #180 (Div. 1),1,Color the Carpet,2500.0,D,1366385400,[constructive algorithms],PROGRAMMING -297,Codeforces Round #180 (Div. 1),1,Mystic Carvings,3000.0,E,1366385400,[data structures],PROGRAMMING -298,Codeforces Round #180 (Div. 2),2,Snow Footprints,500.0,A,1366385400,"[greedy, implementation]",PROGRAMMING -298,Codeforces Round #180 (Div. 2),2,Sail,500.0,B,1366385400,"[brute force, greedy, implementation]",PROGRAMMING -298,Codeforces Round #180 (Div. 2),2,Parity Game,1500.0,C,1366385400,"[combinatorics, constructive algorithms, math, number theory]",PROGRAMMING -298,Codeforces Round #180 (Div. 2),2,Fish Weight,1500.0,D,1366385400,"[greedy, math, sortings]",PROGRAMMING -298,Codeforces Round #180 (Div. 2),2,Splitting the Uniqueness,3000.0,E,1366385400,"[constructive algorithms, sortings]",PROGRAMMING -299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha and Array,500.0,A,1366644600,"[brute force, number theory, sortings]",PROGRAMMING -299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha the Squirrel,1000.0,B,1366644600,"[brute force, implementation]",PROGRAMMING -299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Weird Game,1500.0,C,1366644600,"[games, greedy]",PROGRAMMING -299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Distinct Paths,2500.0,D,1366644600,[],PROGRAMMING -299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Cube Problem,2500.0,E,1366644600,[],PROGRAMMING -300,Codeforces Round #181 (Div. 2),2,Array,500.0,A,1366903800,"[brute force, constructive algorithms, implementation]",PROGRAMMING -300,Codeforces Round #181 (Div. 2),2,Coach,1000.0,B,1366903800,"[brute force, dfs and similar]",PROGRAMMING -300,Codeforces Round #181 (Div. 2),2,Beautiful Numbers,2000.0,C,1366903800,"[brute force, combinatorics]",PROGRAMMING -300,Codeforces Round #181 (Div. 2),2,Painting Square,3000.0,D,1366903800,"[dp, fft]",PROGRAMMING -300,Codeforces Round #181 (Div. 2),2,Empire Strikes Back,3000.0,E,1366903800,"[binary search, math]",PROGRAMMING -303,Codeforces Round #183 (Div. 1),1,Lucky Permutation Triple,500.0,A,1368363600,"[constructive algorithms, implementation, math]",PROGRAMMING -303,Codeforces Round #183 (Div. 1),1,Rectangle Puzzle II,500.0,B,1368363600,"[implementation, math]",PROGRAMMING -303,Codeforces Round #183 (Div. 1),1,Minimum Modular,2000.0,C,1368363600,"[brute force, math]",PROGRAMMING -303,Codeforces Round #183 (Div. 1),1,Rotatable Number,2500.0,D,1368363600,"[math, number theory]",PROGRAMMING -303,Codeforces Round #183 (Div. 1),1,Random Ranking,3000.0,E,1368363600,[dp],PROGRAMMING -304,Codeforces Round #183 (Div. 2),2,Pythagorean Theorem II,500.0,A,1368363600,"[brute force, math]",PROGRAMMING -304,Codeforces Round #183 (Div. 2),2,Calendar,1000.0,B,1368363600,"[brute force, implementation]",PROGRAMMING -304,Codeforces Round #183 (Div. 2),2,Lucky Permutation Triple,1000.0,C,1368363600,[constructive algorithms],PROGRAMMING -304,Codeforces Round #183 (Div. 2),2,Rectangle Puzzle II,2000.0,D,1368363600,"[math, ternary search]",PROGRAMMING -304,Codeforces Round #183 (Div. 2),2,Minimum Modular,3000.0,E,1368363600,[math],PROGRAMMING -305,Codeforces Round #184 (Div. 2),2,Strange Addition,500.0,A,1368968400,"[brute force, constructive algorithms]",PROGRAMMING -305,Codeforces Round #184 (Div. 2),2,Continued Fractions,1000.0,B,1368968400,"[brute force, math]",PROGRAMMING -305,Codeforces Round #184 (Div. 2),2,Ivan and Powers of Two,1500.0,C,1368968400,[],PROGRAMMING -305,Codeforces Round #184 (Div. 2),2,Olya and Graph,2000.0,D,1368968400,"[combinatorics, math]",PROGRAMMING -305,Codeforces Round #184 (Div. 2),2,Playing with String,2500.0,E,1368968400,[games],PROGRAMMING -308,Croc Champ 2013 - Finals,12,Morning run,500.0,A,1368784800,[],PROGRAMMING -308,Croc Champ 2013 - Finals,12,Context Advertising,500.0,B,1368784800,[],PROGRAMMING -308,Croc Champ 2013 - Finals,12,Memory for Arrays,1000.0,C,1368784800,[],PROGRAMMING -308,Croc Champ 2013 - Finals,12,Tennis Rackets,2000.0,D,1368784800,[],PROGRAMMING -308,Croc Champ 2013 - Finals,12,Sheep,2500.0,E,1368784800,[],PROGRAMMING -309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Morning run,500.0,A,1368803400,"[binary search, math, two pointers]",PROGRAMMING -309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Context Advertising,500.0,B,1368803400,[two pointers],PROGRAMMING -309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Memory for Arrays,1000.0,C,1368803400,"[binary search, bitmasks, greedy]",PROGRAMMING -309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Tennis Rackets,2000.0,D,1368803400,"[brute force, geometry]",PROGRAMMING -309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Sheep,2500.0,E,1368803400,"[binary search, greedy]",PROGRAMMING -313,Codeforces Round #186 (Div. 2),2,Ilya and Bank Account,500.0,A,1369927800,"[implementation, number theory]",PROGRAMMING -313,Codeforces Round #186 (Div. 2),2,Ilya and Queries,1000.0,B,1369927800,"[dp, implementation]",PROGRAMMING -313,Codeforces Round #186 (Div. 2),2,Ilya and Matrix,1500.0,C,1369927800,"[constructive algorithms, greedy, implementation, sortings]",PROGRAMMING -313,Codeforces Round #186 (Div. 2),2,Ilya and Roads,2500.0,D,1369927800,[dp],PROGRAMMING -313,Codeforces Round #186 (Div. 2),2,Ilya and Two Numbers,2500.0,E,1369927800,"[constructive algorithms, data structures, dsu, greedy]",PROGRAMMING -314,Codeforces Round #187 (Div. 1),1,Sereja and Contest,500.0,A,1370619000,[implementation],PROGRAMMING -314,Codeforces Round #187 (Div. 1),1,Sereja and Periods,1000.0,B,1370619000,"[binary search, dfs and similar, strings]",PROGRAMMING -314,Codeforces Round #187 (Div. 1),1,Sereja and Subsequences,1500.0,C,1370619000,"[data structures, dp]",PROGRAMMING -314,Codeforces Round #187 (Div. 1),1,Sereja and Straight Lines,2000.0,D,1370619000,"[binary search, data structures, geometry, sortings, two pointers]",PROGRAMMING -314,Codeforces Round #187 (Div. 1),1,Sereja and Squares,2500.0,E,1370619000,[dp],PROGRAMMING -315,Codeforces Round #187 (Div. 2),2,Sereja and Bottles,500.0,A,1370619000,[brute force],PROGRAMMING -315,Codeforces Round #187 (Div. 2),2,Sereja and Array,1000.0,B,1370619000,[implementation],PROGRAMMING -315,Codeforces Round #187 (Div. 2),2,Sereja and Contest,1500.0,C,1370619000,"[dp, greedy, implementation]",PROGRAMMING -315,Codeforces Round #187 (Div. 2),2,Sereja and Periods,2000.0,D,1370619000,"[dfs and similar, strings]",PROGRAMMING -315,Codeforces Round #187 (Div. 2),2,Sereja and Subsequences,2500.0,E,1370619000,"[combinatorics, data structures]",PROGRAMMING -316,ABBYY Cup 3.0,12,Special Task,30.0,A1,1371042000,[greedy],PROGRAMMING -316,ABBYY Cup 3.0,12,Special Task,70.0,A2,1371042000,[math],PROGRAMMING -316,ABBYY Cup 3.0,12,EKG,30.0,B1,1371042000,"[brute force, dfs and similar]",PROGRAMMING -316,ABBYY Cup 3.0,12,EKG,70.0,B2,1371042000,"[dfs and similar, dp]",PROGRAMMING -316,ABBYY Cup 3.0,12,Tidying Up,30.0,C1,1371042000,[flows],PROGRAMMING -316,ABBYY Cup 3.0,12,Tidying Up,70.0,C2,1371042000,"[flows, graph matchings]",PROGRAMMING -316,ABBYY Cup 3.0,12,PE Lesson,30.0,D1,1371042000,"[brute force, dp]",PROGRAMMING -316,ABBYY Cup 3.0,12,PE Lesson,40.0,D2,1371042000,[dp],PROGRAMMING -316,ABBYY Cup 3.0,12,PE Lesson,30.0,D3,1371042000,"[dp, math]",PROGRAMMING -316,ABBYY Cup 3.0,12,Summer Homework,30.0,E1,1371042000,"[brute force, data structures]",PROGRAMMING -316,ABBYY Cup 3.0,12,Summer Homework,40.0,E2,1371042000,"[data structures, math]",PROGRAMMING -316,ABBYY Cup 3.0,12,Summer Homework,30.0,E3,1371042000,"[data structures, math]",PROGRAMMING -316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F1,1371042000,"[dfs and similar, implementation]",PROGRAMMING -316,ABBYY Cup 3.0,12,Suns and Rays,40.0,F2,1371042000,[],PROGRAMMING -316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F3,1371042000,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING -316,ABBYY Cup 3.0,12,Good Substrings,30.0,G1,1371042000,"[hashing, strings]",PROGRAMMING -316,ABBYY Cup 3.0,12,Good Substrings,40.0,G2,1371042000,[string suffix structures],PROGRAMMING -316,ABBYY Cup 3.0,12,Good Substrings,30.0,G3,1371042000,[string suffix structures],PROGRAMMING -317,Codeforces Round #188 (Div. 1),1,Perfect Pair,500.0,A,1371223800,[brute force],PROGRAMMING -317,Codeforces Round #188 (Div. 1),1,Ants,1000.0,B,1371223800,"[brute force, implementation]",PROGRAMMING -317,Codeforces Round #188 (Div. 1),1,Balance,2500.0,C,1371223800,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING -317,Codeforces Round #188 (Div. 1),1,Game with Powers,1500.0,D,1371223800,"[dp, games]",PROGRAMMING -317,Codeforces Round #188 (Div. 1),1,Princess and Her Shadow,3000.0,E,1371223800,"[constructive algorithms, shortest paths]",PROGRAMMING -318,Codeforces Round #188 (Div. 2),2,Even Odds,500.0,A,1371223800,[math],PROGRAMMING -318,Codeforces Round #188 (Div. 2),2,Strings of Power,500.0,B,1371223800,"[implementation, strings, two pointers]",PROGRAMMING -318,Codeforces Round #188 (Div. 2),2,Perfect Pair,1000.0,C,1371223800,"[greedy, math]",PROGRAMMING -318,Codeforces Round #188 (Div. 2),2,Ants,2500.0,D,1371223800,[dfs and similar],PROGRAMMING -318,Codeforces Round #188 (Div. 2),2,Balance,3000.0,E,1371223800,"[constructive algorithms, dfs and similar]",PROGRAMMING -319,Codeforces Round #189 (Div. 1),1,Malek Dance Club,500.0,A,1371992400,"[combinatorics, math]",PROGRAMMING -319,Codeforces Round #189 (Div. 1),1,Psychos in a Line,1000.0,B,1371992400,"[data structures, implementation]",PROGRAMMING -319,Codeforces Round #189 (Div. 1),1,Kalila and Dimna in the Logging Industry,1500.0,C,1371992400,"[dp, geometry]",PROGRAMMING -319,Codeforces Round #189 (Div. 1),1,Have You Ever Heard About the Word?,2500.0,D,1371992400,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING -319,Codeforces Round #189 (Div. 1),1,Ping-Pong,2500.0,E,1371992400,[data structures],PROGRAMMING -320,Codeforces Round #189 (Div. 2),2,Magic Numbers,500.0,A,1371992400,"[brute force, greedy]",PROGRAMMING -320,Codeforces Round #189 (Div. 2),2,Ping-Pong (Easy Version),1000.0,B,1371992400,"[dfs and similar, graphs]",PROGRAMMING -320,Codeforces Round #189 (Div. 2),2,Malek Dance Club,1500.0,C,1371992400,[math],PROGRAMMING -320,Codeforces Round #189 (Div. 2),2,Psychos in a Line,2000.0,D,1371992400,[data structures],PROGRAMMING -320,Codeforces Round #189 (Div. 2),2,Kalila and Dimna in the Logging Industry,2500.0,E,1371992400,[dp],PROGRAMMING -321,Codeforces Round #190 (Div. 1),1,Ciel and Robot,500.0,A,1372433400,"[binary search, implementation, math]",PROGRAMMING -321,Codeforces Round #190 (Div. 1),1,Ciel and Duel,1000.0,B,1372433400,"[dp, flows, greedy]",PROGRAMMING -321,Codeforces Round #190 (Div. 1),1,Ciel the Commander,1500.0,C,1372433400,"[constructive algorithms, dfs and similar, divide and conquer, greedy, trees]",PROGRAMMING -321,Codeforces Round #190 (Div. 1),1,Ciel and Flipboard,2000.0,D,1372433400,"[dp, greedy, math]",PROGRAMMING -321,Codeforces Round #190 (Div. 1),1,Ciel and Gondolas,2500.0,E,1372433400,"[data structures, divide and conquer, dp]",PROGRAMMING -322,Codeforces Round #190 (Div. 2),2,Ciel and Dancing,500.0,A,1372433400,[greedy],PROGRAMMING -322,Codeforces Round #190 (Div. 2),2,Ciel and Flowers,1000.0,B,1372433400,"[combinatorics, math]",PROGRAMMING -322,Codeforces Round #190 (Div. 2),2,Ciel and Robot,1500.0,C,1372433400,"[implementation, math, number theory]",PROGRAMMING -322,Codeforces Round #190 (Div. 2),2,Ciel and Duel,2000.0,D,1372433400,"[dp, flows, greedy, two pointers]",PROGRAMMING -322,Codeforces Round #190 (Div. 2),2,Ciel the Commander,2500.0,E,1372433400,[divide and conquer],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,30.0,A1,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,70.0,A2,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,30.0,B1,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,70.0,B2,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C1,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C2,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,60.0,C3,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D1,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D2,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,40.0,D3,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E1,1374043200,[],PROGRAMMING -324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E2,1374043200,[],PROGRAMMING -325,MemSQL start[c]up Round 1,12,Square and Rectangles,500.0,A,1373734800,[implementation],PROGRAMMING -325,MemSQL start[c]up Round 1,12,Stadium and Games,1000.0,B,1373734800,"[binary search, math]",PROGRAMMING -325,MemSQL start[c]up Round 1,12,Monsters and Diamonds,2000.0,C,1373734800,"[dfs and similar, shortest paths]",PROGRAMMING -325,MemSQL start[c]up Round 1,12,Reclamation,2000.0,D,1373734800,[dsu],PROGRAMMING -325,MemSQL start[c]up Round 1,12,The Red Button,2500.0,E,1373734800,"[combinatorics, dfs and similar, dsu, greedy]",PROGRAMMING -326,MemSQL start[c]up Round 2,12,Banana,500.0,A,1375549200,[],PROGRAMMING -326,MemSQL start[c]up Round 2,12,Palindrome,1000.0,B,1375549200,[],PROGRAMMING -326,MemSQL start[c]up Round 2,12,More Reclamation,1000.0,C,1375549200,[],PROGRAMMING -326,MemSQL start[c]up Round 2,12,Rectangles and Square,2000.0,D,1375549200,[],PROGRAMMING -326,MemSQL start[c]up Round 2,12,Counting Skyscrapers,2500.0,E,1375549200,[],PROGRAMMING -326,MemSQL start[c]up Round 2,12,"Buy One, Get One Free",3000.0,F,1375549200,[],PROGRAMMING -327,Codeforces Round #191 (Div. 2),2,Flipping Game,500.0,A,1372941000,"[brute force, dp, implementation]",PROGRAMMING -327,Codeforces Round #191 (Div. 2),2,Hungry Sequence,500.0,B,1372941000,[math],PROGRAMMING -327,Codeforces Round #191 (Div. 2),2,Magic Five,1500.0,C,1372941000,"[combinatorics, math]",PROGRAMMING -327,Codeforces Round #191 (Div. 2),2,Block Tower,2000.0,D,1372941000,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING -327,Codeforces Round #191 (Div. 2),2,Axis Walking,3000.0,E,1372941000,"[bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle]",PROGRAMMING -329,Codeforces Round #192 (Div. 1),1,Purification,500.0,A,1374327000,"[constructive algorithms, greedy]",PROGRAMMING -329,Codeforces Round #192 (Div. 1),1,Biridian Forest,1000.0,B,1374327000,"[dfs and similar, shortest paths]",PROGRAMMING -329,Codeforces Round #192 (Div. 1),1,Graph Reconstruction,1500.0,C,1374327000,[constructive algorithms],PROGRAMMING -329,Codeforces Round #192 (Div. 1),1,The Evil Temple and the Moving Rocks,1500.0,D,1374327000,[constructive algorithms],PROGRAMMING -329,Codeforces Round #192 (Div. 1),1,Evil,2500.0,E,1374327000,[math],PROGRAMMING -330,Codeforces Round #192 (Div. 2),2,Cakeminator,500.0,A,1374327000,"[brute force, implementation]",PROGRAMMING -330,Codeforces Round #192 (Div. 2),2,Road Construction,1000.0,B,1374327000,"[constructive algorithms, graphs]",PROGRAMMING -330,Codeforces Round #192 (Div. 2),2,Purification,1500.0,C,1374327000,[matrices],PROGRAMMING -330,Codeforces Round #192 (Div. 2),2,Biridian Forest,2000.0,D,1374327000,"[dfs and similar, implementation, shortest paths]",PROGRAMMING -330,Codeforces Round #192 (Div. 2),2,Graph Reconstruction,2500.0,E,1374327000,[],PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,30.0,A1,1374075000,"[brute force, implementation]",PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,70.0,A2,1374075000,"[data structures, sortings]",PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,30.0,B1,1374075000,[implementation],PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,70.0,B2,1374075000,[data structures],PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C1,1374075000,[dp],PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C2,1374075000,[dp],PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,60.0,C3,1374075000,[dp],PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D1,1374075000,"[dfs and similar, implementation]",PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D2,1374075000,[graphs],PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,40.0,D3,1374075000,"[data structures, implementation, trees]",PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E1,1374075000,"[constructive algorithms, graphs, implementation]",PROGRAMMING -331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E2,1374075000,"[constructive algorithms, dp]",PROGRAMMING -332,Codeforces Round #193 (Div. 2),2,Down the Hatch!,500.0,A,1374679800,[implementation],PROGRAMMING -332,Codeforces Round #193 (Div. 2),2,Maximum Absurdity,1000.0,B,1374679800,"[data structures, dp, implementation]",PROGRAMMING -332,Codeforces Round #193 (Div. 2),2,Students' Revenge,3000.0,C,1374679800,"[data structures, greedy, sortings]",PROGRAMMING -332,Codeforces Round #193 (Div. 2),2,Theft of Blueprints,3000.0,D,1374679800,"[graphs, math]",PROGRAMMING -332,Codeforces Round #193 (Div. 2),2,Binary Key,3000.0,E,1374679800,"[dp, greedy, implementation]",PROGRAMMING -333,Codeforces Round #194 (Div. 1),1,Secrets,500.0,A,1374913800,[greedy],PROGRAMMING -333,Codeforces Round #194 (Div. 1),1,Chips,1000.0,B,1374913800,[greedy],PROGRAMMING -333,Codeforces Round #194 (Div. 1),1,Lucky Tickets,1500.0,C,1374913800,"[brute force, constructive algorithms]",PROGRAMMING -333,Codeforces Round #194 (Div. 1),1,Characteristics of Rectangles,2000.0,D,1374913800,"[binary search, bitmasks, brute force, implementation, sortings]",PROGRAMMING -333,Codeforces Round #194 (Div. 1),1,Summer Earnings,2500.0,E,1374913800,"[binary search, bitmasks, brute force, geometry, sortings]",PROGRAMMING -334,Codeforces Round #194 (Div. 2),2,Candy Bags,500.0,A,1374913800,[implementation],PROGRAMMING -334,Codeforces Round #194 (Div. 2),2,Eight Point Sets,1000.0,B,1374913800,[sortings],PROGRAMMING -334,Codeforces Round #194 (Div. 2),2,Secrets,1500.0,C,1374913800,[math],PROGRAMMING -334,Codeforces Round #194 (Div. 2),2,Chips,2000.0,D,1374913800,"[greedy, implementation, two pointers]",PROGRAMMING -334,Codeforces Round #194 (Div. 2),2,Lucky Tickets,2500.0,E,1374913800,[],PROGRAMMING -336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Triangle,500.0,A,1376062200,"[implementation, math]",PROGRAMMING -336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Fly,1000.0,B,1376062200,[math],PROGRAMMING -336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Sequence,1500.0,C,1376062200,"[brute force, greedy, implementation, number theory]",PROGRAMMING -336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Beautiful Strings,2000.0,D,1376062200,"[combinatorics, math]",PROGRAMMING -336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Painting Square,2500.0,E,1376062200,"[bitmasks, combinatorics, dp, implementation]",PROGRAMMING -337,Codeforces Round #196 (Div. 2),2,Puzzles,500.0,A,1376668800,"[dp, graph matchings, greedy]",PROGRAMMING -337,Codeforces Round #196 (Div. 2),2,Routine Problem,1000.0,B,1376668800,"[greedy, math, number theory]",PROGRAMMING -337,Codeforces Round #196 (Div. 2),2,Quiz,1500.0,C,1376668800,"[binary search, greedy, math, matrices, number theory]",PROGRAMMING -337,Codeforces Round #196 (Div. 2),2,Book of Evil,2000.0,D,1376668800,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING -337,Codeforces Round #196 (Div. 2),2,Divisor Tree,2500.0,E,1376668800,"[brute force, number theory, trees]",PROGRAMMING -338,Codeforces Round #196 (Div. 1),1,Quiz,500.0,A,1376668800,"[greedy, math, number theory]",PROGRAMMING -338,Codeforces Round #196 (Div. 1),1,Book of Evil,1000.0,B,1376668800,"[dfs and similar, dp, trees]",PROGRAMMING -338,Codeforces Round #196 (Div. 1),1,Divisor Tree,1500.0,C,1376668800,"[brute force, dp, number theory]",PROGRAMMING -338,Codeforces Round #196 (Div. 1),1,GCD Table,2000.0,D,1376668800,"[chinese remainder theorem, math, number theory]",PROGRAMMING -338,Codeforces Round #196 (Div. 1),1,Optimize!,2500.0,E,1376668800,[data structures],PROGRAMMING -340,Codeforces Round #198 (Div. 2),2,The Wall,500.0,A,1377876600,[math],PROGRAMMING -340,Codeforces Round #198 (Div. 2),2,Maximal Area Quadrilateral,3000.0,B,1377876600,"[brute force, geometry]",PROGRAMMING -340,Codeforces Round #198 (Div. 2),2,Tourist Problem,2000.0,C,1377876600,"[combinatorics, implementation, math]",PROGRAMMING -340,Codeforces Round #198 (Div. 2),2,Bubble Sort Graph,2000.0,D,1377876600,"[binary search, data structures, dp]",PROGRAMMING -340,Codeforces Round #198 (Div. 2),2,Iahub and Permutations,3000.0,E,1377876600,"[combinatorics, math]",PROGRAMMING -341,Codeforces Round #198 (Div. 1),1,Tourist Problem,500.0,A,1377876600,[math],PROGRAMMING -341,Codeforces Round #198 (Div. 1),1,Bubble Sort Graph,500.0,B,1377876600,"[binary search, data structures, dp]",PROGRAMMING -341,Codeforces Round #198 (Div. 1),1,Iahub and Permutations,1000.0,C,1377876600,"[combinatorics, dp, math]",PROGRAMMING -341,Codeforces Round #198 (Div. 1),1,Iahub and Xors,2500.0,D,1377876600,[data structures],PROGRAMMING -341,Codeforces Round #198 (Div. 1),1,Candies Game,3000.0,E,1377876600,"[constructive algorithms, greedy]",PROGRAMMING -342,Codeforces Round #199 (Div. 2),2,Xenia and Divisors,500.0,A,1378540800,"[greedy, implementation]",PROGRAMMING -342,Codeforces Round #199 (Div. 2),2,Xenia and Spies,1000.0,B,1378540800,"[brute force, greedy, implementation]",PROGRAMMING -342,Codeforces Round #199 (Div. 2),2,Cupboard and Balloons,1500.0,C,1378540800,[geometry],PROGRAMMING -342,Codeforces Round #199 (Div. 2),2,Xenia and Dominoes,2000.0,D,1378540800,"[bitmasks, dfs and similar, dp]",PROGRAMMING -342,Codeforces Round #199 (Div. 2),2,Xenia and Tree,2500.0,E,1378540800,"[data structures, divide and conquer, trees]",PROGRAMMING -343,Codeforces Round #200 (Div. 1),1,Rational Resistance,500.0,A,1379172600,"[math, number theory]",PROGRAMMING -343,Codeforces Round #200 (Div. 1),1,Alternating Current,1000.0,B,1379172600,"[data structures, greedy, implementation]",PROGRAMMING -343,Codeforces Round #200 (Div. 1),1,Read Time,1500.0,C,1379172600,"[binary search, greedy, two pointers]",PROGRAMMING -343,Codeforces Round #200 (Div. 1),1,Water Tree,2000.0,D,1379172600,"[data structures, dfs and similar, trees]",PROGRAMMING -343,Codeforces Round #200 (Div. 1),1,Pumping Stations,2500.0,E,1379172600,"[brute force, dfs and similar, divide and conquer, flows, greedy]",PROGRAMMING -344,Codeforces Round #200 (Div. 2),2,Magnets,500.0,A,1379172600,[implementation],PROGRAMMING -344,Codeforces Round #200 (Div. 2),2,Simple Molecules,1000.0,B,1379172600,"[brute force, math]",PROGRAMMING -344,Codeforces Round #200 (Div. 2),2,Rational Resistance,1500.0,C,1379172600,[math],PROGRAMMING -344,Codeforces Round #200 (Div. 2),2,Alternating Current,2000.0,D,1379172600,"[data structures, greedy, implementation]",PROGRAMMING -344,Codeforces Round #200 (Div. 2),2,Read Time,2500.0,E,1379172600,"[binary search, two pointers]",PROGRAMMING -346,Codeforces Round #201 (Div. 1),1,Alice and Bob,500.0,A,1379691000,"[games, math, number theory]",PROGRAMMING -346,Codeforces Round #201 (Div. 1),1,Lucky Common Subsequence,1000.0,B,1379691000,"[dp, strings]",PROGRAMMING -346,Codeforces Round #201 (Div. 1),1,Number Transformation II,1500.0,C,1379691000,"[greedy, math]",PROGRAMMING -346,Codeforces Round #201 (Div. 1),1,Robot Control,2000.0,D,1379691000,[shortest paths],PROGRAMMING -346,Codeforces Round #201 (Div. 1),1,Doodle Jump,2500.0,E,1379691000,[math],PROGRAMMING -347,Codeforces Round #201 (Div. 2),2,Difference Row,500.0,A,1379691000,"[implementation, sortings]",PROGRAMMING -347,Codeforces Round #201 (Div. 2),2,Fixed Points,1000.0,B,1379691000,"[implementation, math]",PROGRAMMING -347,Codeforces Round #201 (Div. 2),2,Alice and Bob,1500.0,C,1379691000,"[games, math, number theory]",PROGRAMMING -347,Codeforces Round #201 (Div. 2),2,Lucky Common Subsequence,2000.0,D,1379691000,"[dp, strings]",PROGRAMMING -347,Codeforces Round #201 (Div. 2),2,Number Transformation II,2500.0,E,1379691000,"[dp, greedy, number theory]",PROGRAMMING -348,Codeforces Round #202 (Div. 1),1,Mafia,500.0,A,1380295800,"[binary search, math, sortings]",PROGRAMMING -348,Codeforces Round #202 (Div. 1),1,Apple Tree,1000.0,B,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING -348,Codeforces Round #202 (Div. 1),1,Subset Sums,1500.0,C,1380295800,"[brute force, data structures]",PROGRAMMING -348,Codeforces Round #202 (Div. 1),1,Turtles,2000.0,D,1380295800,"[dp, matrices]",PROGRAMMING -348,Codeforces Round #202 (Div. 1),1,Pilgrims,2500.0,E,1380295800,"[dfs and similar, dp, trees]",PROGRAMMING -349,Codeforces Round #202 (Div. 2),2,Cinema Line,500.0,A,1380295800,"[greedy, implementation]",PROGRAMMING -349,Codeforces Round #202 (Div. 2),2,Color the Fence,1000.0,B,1380295800,"[data structures, dp, greedy]",PROGRAMMING -349,Codeforces Round #202 (Div. 2),2,Mafia,1500.0,C,1380295800,[implementation],PROGRAMMING -349,Codeforces Round #202 (Div. 2),2,Apple Tree,2000.0,D,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING -349,Codeforces Round #202 (Div. 2),2,Subset Sums,2500.0,E,1380295800,[],PROGRAMMING -350,Codeforces Round #203 (Div. 2),2,TL,500.0,A,1380641400,"[brute force, greedy, implementation]",PROGRAMMING -350,Codeforces Round #203 (Div. 2),2,Resort,1000.0,B,1380641400,[brute force],PROGRAMMING -350,Codeforces Round #203 (Div. 2),2,Bombs,1000.0,C,1380641400,"[greedy, implementation, sortings]",PROGRAMMING -350,Codeforces Round #203 (Div. 2),2,Looking for Owls,3000.0,D,1380641400,"[binary search, geometry, hashing, sortings]",PROGRAMMING -350,Codeforces Round #203 (Div. 2),2,Wrong Floyd,3000.0,E,1380641400,"[brute force, constructive algorithms, dfs and similar, graphs]",PROGRAMMING -351,Codeforces Round #204 (Div. 1),1,Jeff and Rounding,1000.0,A,1380900600,"[dp, greedy, implementation, math]",PROGRAMMING -351,Codeforces Round #204 (Div. 1),1,Jeff and Furik,1000.0,B,1380900600,"[combinatorics, dp, probabilities]",PROGRAMMING -351,Codeforces Round #204 (Div. 1),1,Jeff and Brackets,1500.0,C,1380900600,"[dp, matrices]",PROGRAMMING -351,Codeforces Round #204 (Div. 1),1,Jeff and Removing Periods,2000.0,D,1380900600,[data structures],PROGRAMMING -351,Codeforces Round #204 (Div. 1),1,Jeff and Permutation,2000.0,E,1380900600,[greedy],PROGRAMMING -352,Codeforces Round #204 (Div. 2),2,Jeff and Digits,500.0,A,1380900600,"[brute force, implementation, math]",PROGRAMMING -352,Codeforces Round #204 (Div. 2),2,Jeff and Periods,1000.0,B,1380900600,"[implementation, sortings]",PROGRAMMING -352,Codeforces Round #204 (Div. 2),2,Jeff and Rounding,1500.0,C,1380900600,"[dp, greedy, implementation]",PROGRAMMING -352,Codeforces Round #204 (Div. 2),2,Jeff and Furik,2000.0,D,1380900600,[math],PROGRAMMING -352,Codeforces Round #204 (Div. 2),2,Jeff and Brackets,2500.0,E,1380900600,[],PROGRAMMING -353,Codeforces Round #205 (Div. 2),2,Domino,500.0,A,1381419000,"[implementation, math]",PROGRAMMING -353,Codeforces Round #205 (Div. 2),2,Two Heaps,1500.0,B,1381419000,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",PROGRAMMING -353,Codeforces Round #205 (Div. 2),2,Find Maximum,1000.0,C,1381419000,"[implementation, math, number theory]",PROGRAMMING -353,Codeforces Round #205 (Div. 2),2,Queue,2500.0,D,1381419000,[constructive algorithms],PROGRAMMING -353,Codeforces Round #205 (Div. 2),2,Antichain,3000.0,E,1381419000,"[dp, graph matchings, greedy]",PROGRAMMING -354,Codeforces Round #206 (Div. 1),1,Vasya and Robot,500.0,A,1381678200,"[brute force, greedy, math]",PROGRAMMING -354,Codeforces Round #206 (Div. 1),1,Game with Strings,1000.0,B,1381678200,"[bitmasks, dp, games]",PROGRAMMING -354,Codeforces Round #206 (Div. 1),1,Vasya and Beautiful Arrays,1500.0,C,1381678200,"[brute force, dp, number theory]",PROGRAMMING -354,Codeforces Round #206 (Div. 1),1,Transferring Pyramid,2000.0,D,1381678200,[dp],PROGRAMMING -354,Codeforces Round #206 (Div. 1),1,Lucky Number Representation,2500.0,E,1381678200,"[constructive algorithms, dfs and similar, dp]",PROGRAMMING -355,Codeforces Round #206 (Div. 2),2,Vasya and Digital Root,500.0,A,1381678200,"[constructive algorithms, implementation]",PROGRAMMING -355,Codeforces Round #206 (Div. 2),2,Vasya and Public Transport,1000.0,B,1381678200,"[greedy, implementation]",PROGRAMMING -355,Codeforces Round #206 (Div. 2),2,Vasya and Robot,1500.0,C,1381678200,"[brute force, dp]",PROGRAMMING -355,Codeforces Round #206 (Div. 2),2,Game with Strings,2000.0,D,1381678200,[],PROGRAMMING -355,Codeforces Round #206 (Div. 2),2,Vasya and Beautiful Arrays,2500.0,E,1381678200,"[binary search, brute force, data structures]",PROGRAMMING -356,Codeforces Round #207 (Div. 1),1,Knight Tournament,500.0,A,1381838400,"[data structures, dsu]",PROGRAMMING -356,Codeforces Round #207 (Div. 1),1,Xenia and Hamming,1000.0,B,1381838400,"[implementation, math]",PROGRAMMING -356,Codeforces Round #207 (Div. 1),1,Compartments,1500.0,C,1381838400,"[combinatorics, constructive algorithms, greedy, implementation]",PROGRAMMING -356,Codeforces Round #207 (Div. 1),1,Bags and Coins,2000.0,D,1381838400,"[bitmasks, constructive algorithms, dp, greedy]",PROGRAMMING -356,Codeforces Round #207 (Div. 1),1,Xenia and String Problem,2500.0,E,1381838400,"[dp, hashing, implementation, string suffix structures, strings]",PROGRAMMING -357,Codeforces Round #207 (Div. 2),2,Group of Students,500.0,A,1381838400,"[brute force, greedy, implementation]",PROGRAMMING -357,Codeforces Round #207 (Div. 2),2,Flag Day,1000.0,B,1381838400,"[constructive algorithms, implementation]",PROGRAMMING -357,Codeforces Round #207 (Div. 2),2,Knight Tournament,1500.0,C,1381838400,[data structures],PROGRAMMING -357,Codeforces Round #207 (Div. 2),2,Xenia and Hamming,2000.0,D,1381838400,[number theory],PROGRAMMING -357,Codeforces Round #207 (Div. 2),2,Compartments,2500.0,E,1381838400,[],PROGRAMMING -358,Codeforces Round #208 (Div. 2),2,Dima and Continuous Line,500.0,A,1382715000,"[brute force, implementation]",PROGRAMMING -358,Codeforces Round #208 (Div. 2),2,Dima and Text Messages,1000.0,B,1382715000,"[brute force, strings]",PROGRAMMING -358,Codeforces Round #208 (Div. 2),2,Dima and Containers,1500.0,C,1382715000,"[constructive algorithms, greedy, implementation]",PROGRAMMING -358,Codeforces Round #208 (Div. 2),2,Dima and Hares,2000.0,D,1382715000,"[dp, greedy]",PROGRAMMING -358,Codeforces Round #208 (Div. 2),2,Dima and Kicks,3000.0,E,1382715000,"[brute force, dsu, graphs, implementation]",PROGRAMMING -359,Codeforces Round #209 (Div. 2),2,Table,500.0,A,1383379200,"[greedy, implementation]",PROGRAMMING -359,Codeforces Round #209 (Div. 2),2,Permutation,1000.0,B,1383379200,"[constructive algorithms, dp, math]",PROGRAMMING -359,Codeforces Round #209 (Div. 2),2,Prime Number,1500.0,C,1383379200,[math],PROGRAMMING -359,Codeforces Round #209 (Div. 2),2,Pair of Numbers,2500.0,D,1383379200,"[binary search, brute force, data structures, math, two pointers]",PROGRAMMING -359,Codeforces Round #209 (Div. 2),2,Neatness,2500.0,E,1383379200,[dfs and similar],PROGRAMMING -360,Codeforces Round #210 (Div. 1),1,Levko and Array Recovery,500.0,A,1384102800,"[greedy, implementation]",PROGRAMMING -360,Codeforces Round #210 (Div. 1),1,Levko and Array,1000.0,B,1384102800,"[binary search, dp]",PROGRAMMING -360,Codeforces Round #210 (Div. 1),1,Levko and Strings,1500.0,C,1384102800,"[combinatorics, dp]",PROGRAMMING -360,Codeforces Round #210 (Div. 1),1,Levko and Sets,1500.0,D,1384102800,[number theory],PROGRAMMING -360,Codeforces Round #210 (Div. 1),1,Levko and Game,2000.0,E,1384102800,"[graphs, greedy, shortest paths]",PROGRAMMING -361,Codeforces Round #210 (Div. 2),2,Levko and Table,500.0,A,1384102800,"[constructive algorithms, implementation]",PROGRAMMING -361,Codeforces Round #210 (Div. 2),2,Levko and Permutation,1000.0,B,1384102800,"[constructive algorithms, math, number theory]",PROGRAMMING -361,Codeforces Round #210 (Div. 2),2,Levko and Array Recovery,1500.0,C,1384102800,"[brute force, constructive algorithms, greedy]",PROGRAMMING -361,Codeforces Round #210 (Div. 2),2,Levko and Array,2000.0,D,1384102800,"[binary search, dp]",PROGRAMMING -361,Codeforces Round #210 (Div. 2),2,Levko and Strings,2500.0,E,1384102800,[],PROGRAMMING -362,Codeforces Round #212 (Div. 2),2,Two Semiknights Meet,1000.0,A,1384443000,"[greedy, math]",PROGRAMMING -362,Codeforces Round #212 (Div. 2),2,Petya and Staircases,500.0,B,1384443000,"[implementation, sortings]",PROGRAMMING -362,Codeforces Round #212 (Div. 2),2,Insertion Sort,2500.0,C,1384443000,"[data structures, dp, implementation, math]",PROGRAMMING -362,Codeforces Round #212 (Div. 2),2,Fools and Foolproof Roads,3000.0,D,1384443000,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING -362,Codeforces Round #212 (Div. 2),2,Petya and Pipes,3000.0,E,1384443000,"[flows, graphs, shortest paths]",PROGRAMMING -363,Codeforces Round #211 (Div. 2),2,Soroban,500.0,A,1384156800,[implementation],PROGRAMMING -363,Codeforces Round #211 (Div. 2),2,Fence,1000.0,B,1384156800,"[brute force, dp]",PROGRAMMING -363,Codeforces Round #211 (Div. 2),2,Fixing Typos,1500.0,C,1384156800,"[greedy, implementation]",PROGRAMMING -363,Codeforces Round #211 (Div. 2),2,Renting Bikes,2000.0,D,1384156800,"[binary search, greedy]",PROGRAMMING -363,Codeforces Round #211 (Div. 2),2,Two Circles,2500.0,E,1384156800,"[brute force, data structures, implementation]",PROGRAMMING -364,Codeforces Round #213 (Div. 1),1,Matrix,500.0,A,1384875000,"[combinatorics, data structures, implementation]",PROGRAMMING -364,Codeforces Round #213 (Div. 1),1,Free Market,1000.0,B,1384875000,"[dp, greedy]",PROGRAMMING -364,Codeforces Round #213 (Div. 1),1,Beautiful Set,1500.0,C,1384875000,"[brute force, number theory]",PROGRAMMING -364,Codeforces Round #213 (Div. 1),1,Ghd,2000.0,D,1384875000,"[brute force, math, probabilities]",PROGRAMMING -364,Codeforces Round #213 (Div. 1),1,Empty Rectangles,2500.0,E,1384875000,"[divide and conquer, two pointers]",PROGRAMMING -365,Codeforces Round #213 (Div. 2),2,Good Number,500.0,A,1384875000,[implementation],PROGRAMMING -365,Codeforces Round #213 (Div. 2),2,The Fibonacci Segment,1000.0,B,1384875000,[implementation],PROGRAMMING -365,Codeforces Round #213 (Div. 2),2,Matrix,1500.0,C,1384875000,"[brute force, combinatorics, math, matrices]",PROGRAMMING -365,Codeforces Round #213 (Div. 2),2,Free Market,2000.0,D,1384875000,"[dp, greedy]",PROGRAMMING -365,Codeforces Round #213 (Div. 2),2,Beautiful Set,2500.0,E,1384875000,"[brute force, number theory]",PROGRAMMING -366,Codeforces Round #214 (Div. 2),2,Dima and Guards,500.0,A,1385307000,[implementation],PROGRAMMING -366,Codeforces Round #214 (Div. 2),2,Dima and To-do List,1000.0,B,1385307000,"[brute force, implementation]",PROGRAMMING -366,Codeforces Round #214 (Div. 2),2,Dima and Salad,1500.0,C,1385307000,[dp],PROGRAMMING -366,Codeforces Round #214 (Div. 2),2,Dima and Trap Graph,2000.0,D,1385307000,"[binary search, data structures, dfs and similar, dsu, shortest paths, two pointers]",PROGRAMMING -366,Codeforces Round #214 (Div. 2),2,Dima and Magic Guitar,2500.0,E,1385307000,"[brute force, implementation, math]",PROGRAMMING -367,Codeforces Round #215 (Div. 1),1,Sereja and Algorithm ,500.0,A,1385479800,"[data structures, implementation]",PROGRAMMING -367,Codeforces Round #215 (Div. 1),1,Sereja ans Anagrams,1000.0,B,1385479800,"[binary search, data structures]",PROGRAMMING -367,Codeforces Round #215 (Div. 1),1,Sereja and the Arrangement of Numbers,1500.0,C,1385479800,"[graphs, greedy, sortings]",PROGRAMMING -367,Codeforces Round #215 (Div. 1),1,Sereja and Sets,2000.0,D,1385479800,"[bitmasks, dfs and similar]",PROGRAMMING -367,Codeforces Round #215 (Div. 1),1,Sereja and Intervals,2000.0,E,1385479800,"[combinatorics, dp]",PROGRAMMING -368,Codeforces Round #215 (Div. 2),2,Sereja and Coat Rack,500.0,A,1385479800,[implementation],PROGRAMMING -368,Codeforces Round #215 (Div. 2),2,Sereja and Suffixes,1000.0,B,1385479800,"[data structures, dp]",PROGRAMMING -368,Codeforces Round #215 (Div. 2),2,Sereja and Algorithm ,1500.0,C,1385479800,"[brute force, implementation]",PROGRAMMING -368,Codeforces Round #215 (Div. 2),2,Sereja ans Anagrams,2000.0,D,1385479800,"[data structures, two pointers]",PROGRAMMING -368,Codeforces Round #215 (Div. 2),2,Sereja and the Arrangement of Numbers,2500.0,E,1385479800,"[combinatorics, graphs, implementation]",PROGRAMMING -369,Codeforces Round #216 (Div. 2),2,Valera and Plates,500.0,A,1385739000,[implementation],PROGRAMMING -369,Codeforces Round #216 (Div. 2),2,Valera and Contest,1000.0,B,1385739000,"[constructive algorithms, implementation, math]",PROGRAMMING -369,Codeforces Round #216 (Div. 2),2,Valera and Elections,1500.0,C,1385739000,"[dfs and similar, graphs, trees]",PROGRAMMING -369,Codeforces Round #216 (Div. 2),2,Valera and Fools,2000.0,D,1385739000,"[dfs and similar, dp, shortest paths]",PROGRAMMING -369,Codeforces Round #216 (Div. 2),2,Valera and Queries,2500.0,E,1385739000,"[binary search, data structures]",PROGRAMMING -370,Codeforces Round #217 (Div. 2),2,"Rook, Bishop and King",500.0,A,1386399600,[math],PROGRAMMING -370,Codeforces Round #217 (Div. 2),2,Berland Bingo,500.0,B,1386399600,[implementation],PROGRAMMING -370,Codeforces Round #217 (Div. 2),2,Mittens,1500.0,C,1386399600,"[constructive algorithms, greedy, sortings]",PROGRAMMING -370,Codeforces Round #217 (Div. 2),2,Broken Monitor,3000.0,D,1386399600,"[brute force, constructive algorithms, implementation]",PROGRAMMING -370,Codeforces Round #217 (Div. 2),2,Summer Reading,3000.0,E,1386399600,"[dp, greedy]",PROGRAMMING -371,Codeforces Round #218 (Div. 2),2,K-Periodic Array,500.0,A,1386493200,"[implementation, math]",PROGRAMMING -371,Codeforces Round #218 (Div. 2),2,Fox Dividing Cheese,1000.0,B,1386493200,"[math, number theory]",PROGRAMMING -371,Codeforces Round #218 (Div. 2),2,Hamburgers,1500.0,C,1386493200,"[binary search, brute force]",PROGRAMMING -371,Codeforces Round #218 (Div. 2),2,Vessels,2000.0,D,1386493200,"[data structures, dsu, implementation, trees]",PROGRAMMING -371,Codeforces Round #218 (Div. 2),2,Subway Innovation,2500.0,E,1386493200,"[math, two pointers]",PROGRAMMING -372,Codeforces Round #219 (Div. 1),1,Counting Kangaroos is Fun,500.0,A,1386943200,"[binary search, greedy, sortings, two pointers]",PROGRAMMING -372,Codeforces Round #219 (Div. 1),1,Counting Rectangles is Fun,1000.0,B,1386943200,"[brute force, divide and conquer, dp]",PROGRAMMING -372,Codeforces Round #219 (Div. 1),1,Watching Fireworks is Fun,1500.0,C,1386943200,"[data structures, dp, math]",PROGRAMMING -372,Codeforces Round #219 (Div. 1),1,Choosing Subtree is Fun,2000.0,D,1386943200,"[binary search, data structures, dfs and similar, trees, two pointers]",PROGRAMMING -372,Codeforces Round #219 (Div. 1),1,Drawing Circles is Fun,2500.0,E,1386943200,"[combinatorics, geometry]",PROGRAMMING -373,Codeforces Round #219 (Div. 2),2,Collecting Beats is Fun,500.0,A,1386943200,[implementation],PROGRAMMING -373,Codeforces Round #219 (Div. 2),2,Making Sequences is Fun,1000.0,B,1386943200,"[binary search, implementation, math]",PROGRAMMING -373,Codeforces Round #219 (Div. 2),2,Counting Kangaroos is Fun,1500.0,C,1386943200,"[greedy, sortings, two pointers]",PROGRAMMING -373,Codeforces Round #219 (Div. 2),2,Counting Rectangles is Fun,2000.0,D,1386943200,[],PROGRAMMING -373,Codeforces Round #219 (Div. 2),2,Watching Fireworks is Fun,2500.0,E,1386943200,[dp],PROGRAMMING -375,Codeforces Round #221 (Div. 1),1,Divisible by Seven,500.0,A,1387893600,"[math, number theory]",PROGRAMMING -375,Codeforces Round #221 (Div. 1),1,Maximum Submatrix 2,1000.0,B,1387893600,"[data structures, dp, implementation, sortings]",PROGRAMMING -375,Codeforces Round #221 (Div. 1),1,Circling Round Treasures,1500.0,C,1387893600,"[bitmasks, shortest paths]",PROGRAMMING -375,Codeforces Round #221 (Div. 1),1,Tree and Queries,2000.0,D,1387893600,"[data structures, dfs and similar, trees]",PROGRAMMING -375,Codeforces Round #221 (Div. 1),1,Red and Black Tree,2500.0,E,1387893600,"[dp, implementation, math]",PROGRAMMING -376,Codeforces Round #221 (Div. 2),2,Lever,500.0,A,1387893600,"[implementation, math]",PROGRAMMING -376,Codeforces Round #221 (Div. 2),2,I.O.U.,1000.0,B,1387893600,[implementation],PROGRAMMING -376,Codeforces Round #221 (Div. 2),2,Divisible by Seven,1500.0,C,1387893600,"[math, number theory]",PROGRAMMING -376,Codeforces Round #221 (Div. 2),2,Maximum Submatrix 2,2000.0,D,1387893600,"[dp, implementation, sortings]",PROGRAMMING -376,Codeforces Round #221 (Div. 2),2,Circling Round Treasures,2500.0,E,1387893600,"[bitmasks, shortest paths]",PROGRAMMING -377,Codeforces Round #222 (Div. 1),1,Maze,500.0,A,1388331000,[dfs and similar],PROGRAMMING -377,Codeforces Round #222 (Div. 1),1,Preparing for the Contest,1000.0,B,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING -377,Codeforces Round #222 (Div. 1),1,Captains Mode,1000.0,C,1388331000,"[bitmasks, dp, games]",PROGRAMMING -377,Codeforces Round #222 (Div. 1),1,Developing Game,2000.0,D,1388331000,[data structures],PROGRAMMING -377,Codeforces Round #222 (Div. 1),1,Cookie Clicker,2500.0,E,1388331000,"[dp, geometry]",PROGRAMMING -378,Codeforces Round #222 (Div. 2),2,Playing with Dice,500.0,A,1388331000,[brute force],PROGRAMMING -378,Codeforces Round #222 (Div. 2),2,Semifinals,1000.0,B,1388331000,"[implementation, sortings]",PROGRAMMING -378,Codeforces Round #222 (Div. 2),2,Maze,1500.0,C,1388331000,[dfs and similar],PROGRAMMING -378,Codeforces Round #222 (Div. 2),2,Preparing for the Contest,2000.0,D,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING -378,Codeforces Round #222 (Div. 2),2,Captains Mode,2000.0,E,1388331000,"[bitmasks, brute force, dp, greedy]",PROGRAMMING -379,Good Bye 2013,12,New Year Candles,500.0,A,1388417400,[implementation],PROGRAMMING -379,Good Bye 2013,12,New Year Present,1000.0,B,1388417400,"[constructive algorithms, implementation]",PROGRAMMING -379,Good Bye 2013,12,New Year Ratings Change,1500.0,C,1388417400,"[greedy, sortings]",PROGRAMMING -379,Good Bye 2013,12,New Year Letter,2000.0,D,1388417400,"[bitmasks, brute force, dp]",PROGRAMMING -379,Good Bye 2013,12,New Year Tree Decorations,2500.0,E,1388417400,"[geometry, schedules, sortings]",PROGRAMMING -379,Good Bye 2013,12,New Year Tree,3000.0,F,1388417400,"[data structures, divide and conquer, trees]",PROGRAMMING -379,Good Bye 2013,12,New Year Cactus,3500.0,G,1388417400,[dp],PROGRAMMING -380,Codeforces Round #223 (Div. 1),1,Sereja and Prefixes,500.0,A,1389540600,"[binary search, brute force]",PROGRAMMING -380,Codeforces Round #223 (Div. 1),1,Sereja and Tree,1000.0,B,1389540600,"[graphs, implementation]",PROGRAMMING -380,Codeforces Round #223 (Div. 1),1,Sereja and Brackets,1500.0,C,1389540600,"[data structures, schedules]",PROGRAMMING -380,Codeforces Round #223 (Div. 1),1,Sereja and Cinema,2000.0,D,1389540600,"[combinatorics, math]",PROGRAMMING -380,Codeforces Round #223 (Div. 1),1,Sereja and Dividing,2500.0,E,1389540600,[data structures],PROGRAMMING -381,Codeforces Round #223 (Div. 2),2,Sereja and Dima,500.0,A,1389540600,"[greedy, implementation, two pointers]",PROGRAMMING -381,Codeforces Round #223 (Div. 2),2,Sereja and Stairs,1000.0,B,1389540600,"[greedy, implementation, sortings]",PROGRAMMING -381,Codeforces Round #223 (Div. 2),2,Sereja and Prefixes,1500.0,C,1389540600,"[binary search, implementation, two pointers]",PROGRAMMING -381,Codeforces Round #223 (Div. 2),2,Sereja and Tree,2000.0,D,1389540600,[brute force],PROGRAMMING -381,Codeforces Round #223 (Div. 2),2,Sereja and Brackets,2500.0,E,1389540600,[data structures],PROGRAMMING -382,Codeforces Round #224 (Div. 2),2,Ksenia and Pan Scales,500.0,A,1389972600,"[greedy, implementation]",PROGRAMMING -382,Codeforces Round #224 (Div. 2),2,Number Busters,2500.0,B,1389972600,"[binary search, math]",PROGRAMMING -382,Codeforces Round #224 (Div. 2),2,Arithmetic Progression,1500.0,C,1389972600,"[implementation, sortings]",PROGRAMMING -382,Codeforces Round #224 (Div. 2),2,Ksenia and Pawns,3000.0,D,1389972600,"[dfs and similar, graphs, implementation, trees]",PROGRAMMING -382,Codeforces Round #224 (Div. 2),2,Ksenia and Combinatorics,3000.0,E,1389972600,"[combinatorics, dp]",PROGRAMMING -383,Codeforces Round #225 (Div. 1),1,Milking cows,500.0,A,1390231800,"[data structures, greedy]",PROGRAMMING -383,Codeforces Round #225 (Div. 1),1,Volcanoes,1500.0,B,1390231800,"[binary search, implementation, sortings, two pointers]",PROGRAMMING -383,Codeforces Round #225 (Div. 1),1,Propagating tree,1500.0,C,1390231800,"[data structures, dfs and similar, trees]",PROGRAMMING -383,Codeforces Round #225 (Div. 1),1,Antimatter,2000.0,D,1390231800,[dp],PROGRAMMING -383,Codeforces Round #225 (Div. 1),1,Vowels,2500.0,E,1390231800,"[combinatorics, divide and conquer, dp]",PROGRAMMING -384,Codeforces Round #225 (Div. 2),2,Coder,500.0,A,1390231800,[implementation],PROGRAMMING -384,Codeforces Round #225 (Div. 2),2,Multitasking,1000.0,B,1390231800,"[greedy, implementation, sortings, two pointers]",PROGRAMMING -384,Codeforces Round #225 (Div. 2),2,Milking cows,1500.0,C,1390231800,[greedy],PROGRAMMING -384,Codeforces Round #225 (Div. 2),2,Volcanoes,2500.0,D,1390231800,[implementation],PROGRAMMING -384,Codeforces Round #225 (Div. 2),2,Propagating tree,2500.0,E,1390231800,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING -385,Codeforces Round #226 (Div. 2),2,Bear and Raspberry,500.0,A,1390577700,"[brute force, greedy, implementation]",PROGRAMMING -385,Codeforces Round #226 (Div. 2),2,Bear and Strings,1000.0,B,1390577700,"[brute force, greedy, implementation, math, strings]",PROGRAMMING -385,Codeforces Round #226 (Div. 2),2,Bear and Prime Numbers,1500.0,C,1390577700,"[binary search, brute force, data structures, dp, implementation, math, number theory]",PROGRAMMING -385,Codeforces Round #226 (Div. 2),2,Bear and Floodlight,2000.0,D,1390577700,"[bitmasks, dp, geometry]",PROGRAMMING -385,Codeforces Round #226 (Div. 2),2,Bear in the Field,2500.0,E,1390577700,"[math, matrices]",PROGRAMMING -387,Codeforces Round #227 (Div. 2),2,George and Sleep,500.0,A,1391095800,[implementation],PROGRAMMING -387,Codeforces Round #227 (Div. 2),2,George and Round,1000.0,B,1391095800,"[brute force, greedy, two pointers]",PROGRAMMING -387,Codeforces Round #227 (Div. 2),2,George and Number,1500.0,C,1391095800,"[greedy, implementation]",PROGRAMMING -387,Codeforces Round #227 (Div. 2),2,George and Interesting Graph,2000.0,D,1391095800,[graph matchings],PROGRAMMING -387,Codeforces Round #227 (Div. 2),2,George and Cards,2500.0,E,1391095800,"[binary search, data structures]",PROGRAMMING -388,Codeforces Round #228 (Div. 1),1,Fox and Box Accumulation,500.0,A,1391442000,"[greedy, sortings]",PROGRAMMING -388,Codeforces Round #228 (Div. 1),1,Fox and Minimal path,1000.0,B,1391442000,"[bitmasks, constructive algorithms, graphs, implementation, math]",PROGRAMMING -388,Codeforces Round #228 (Div. 1),1,Fox and Card Game,1500.0,C,1391442000,"[games, greedy, sortings]",PROGRAMMING -388,Codeforces Round #228 (Div. 1),1,Fox and Perfect Sets,2000.0,D,1391442000,[math],PROGRAMMING -388,Codeforces Round #228 (Div. 1),1,Fox and Meteor Shower,2500.0,E,1391442000,[geometry],PROGRAMMING -389,Codeforces Round #228 (Div. 2),2,Fox and Number Game,500.0,A,1391442000,"[greedy, math]",PROGRAMMING -389,Codeforces Round #228 (Div. 2),2,Fox and Cross,1000.0,B,1391442000,"[greedy, implementation]",PROGRAMMING -389,Codeforces Round #228 (Div. 2),2,Fox and Box Accumulation,1500.0,C,1391442000,"[binary search, dp, greedy]",PROGRAMMING -389,Codeforces Round #228 (Div. 2),2,Fox and Minimal path,2000.0,D,1391442000,"[constructive algorithms, graphs, implementation, shortest paths]",PROGRAMMING -389,Codeforces Round #228 (Div. 2),2,Fox and Card Game,2500.0,E,1391442000,"[greedy, implementation]",PROGRAMMING -400,Codeforces Round #234 (Div. 2),2,Inna and Choose Options,500.0,A,1394033400,"[dp, implementation]",PROGRAMMING -400,Codeforces Round #234 (Div. 2),2,Inna and New Matrix of Candies,1000.0,B,1394033400,"[brute force, implementation, schedules]",PROGRAMMING -400,Codeforces Round #234 (Div. 2),2,Inna and Huge Candy Matrix,1500.0,C,1394033400,"[implementation, math]",PROGRAMMING -400,Codeforces Round #234 (Div. 2),2,Dima and Bacteria,2000.0,D,1394033400,"[dsu, graphs, shortest paths]",PROGRAMMING -400,Codeforces Round #234 (Div. 2),2,Inna and Binary Logic,2500.0,E,1394033400,"[binary search, bitmasks, data structures]",PROGRAMMING -401,Codeforces Round #235 (Div. 2),2,Vanya and Cards,500.0,A,1394465400,"[implementation, math]",PROGRAMMING -401,Codeforces Round #235 (Div. 2),2,Sereja and Contests,1000.0,B,1394465400,"[greedy, implementation, math]",PROGRAMMING -401,Codeforces Round #235 (Div. 2),2,Team,1500.0,C,1394465400,"[constructive algorithms, greedy, implementation]",PROGRAMMING -401,Codeforces Round #235 (Div. 2),2,Roman and Numbers,2000.0,D,1394465400,"[bitmasks, brute force, combinatorics, dp, number theory]",PROGRAMMING -401,Codeforces Round #235 (Div. 2),2,Olympic Games,2500.0,E,1394465400,[math],PROGRAMMING -402,Codeforces Round #236 (Div. 2),2,Nuts,500.0,A,1394983800,"[greedy, math]",PROGRAMMING -402,Codeforces Round #236 (Div. 2),2,Trees in a Row,1000.0,B,1394983800,[brute force],PROGRAMMING -402,Codeforces Round #236 (Div. 2),2,Searching for Graph,1500.0,C,1394983800,"[brute force, constructive algorithms]",PROGRAMMING -402,Codeforces Round #236 (Div. 2),2,Upgrading Array,2000.0,D,1394983800,"[dp, greedy, math]",PROGRAMMING -402,Codeforces Round #236 (Div. 2),2,Strictly Positive Matrix,2500.0,E,1394983800,[graphs],PROGRAMMING -403,Codeforces Round #236 (Div. 1),1,Searching for Graph,500.0,A,1394983800,"[constructive algorithms, graphs]",PROGRAMMING -403,Codeforces Round #236 (Div. 1),1,Upgrading Array,1000.0,B,1394983800,"[dp, greedy, number theory]",PROGRAMMING -403,Codeforces Round #236 (Div. 1),1,Strictly Positive Matrix,1500.0,C,1394983800,[graphs],PROGRAMMING -403,Codeforces Round #236 (Div. 1),1,Beautiful Pairs of Numbers,1500.0,D,1394983800,"[combinatorics, dp]",PROGRAMMING -403,Codeforces Round #236 (Div. 1),1,Two Rooted Trees,2000.0,E,1394983800,"[data structures, implementation]",PROGRAMMING -404,Codeforces Round #237 (Div. 2),2,Valera and X,500.0,A,1395243000,[implementation],PROGRAMMING -404,Codeforces Round #237 (Div. 2),2,Marathon,1000.0,B,1395243000,"[implementation, math]",PROGRAMMING -404,Codeforces Round #237 (Div. 2),2,Restore Graph,1500.0,C,1395243000,"[dfs and similar, graphs, sortings]",PROGRAMMING -404,Codeforces Round #237 (Div. 2),2,Minesweeper 1D,2000.0,D,1395243000,"[dp, implementation]",PROGRAMMING -404,Codeforces Round #237 (Div. 2),2,Maze 1D,2500.0,E,1395243000,"[binary search, greedy, implementation]",PROGRAMMING -405,Codeforces Round #238 (Div. 2),2,Gravity Flip,500.0,A,1395502200,"[greedy, implementation, sortings]",PROGRAMMING -405,Codeforces Round #238 (Div. 2),2,Domino Effect,1000.0,B,1395502200,[],PROGRAMMING -405,Codeforces Round #238 (Div. 2),2,Unusual Product,1500.0,C,1395502200,"[implementation, math]",PROGRAMMING -405,Codeforces Round #238 (Div. 2),2,Toy Sum,2000.0,D,1395502200,"[greedy, implementation, math]",PROGRAMMING -405,Codeforces Round #238 (Div. 2),2,Graph Cutting,3000.0,E,1395502200,[dfs and similar],PROGRAMMING -406,Codeforces Round #238 (Div. 1),1,Unusual Product,500.0,A,1395502200,"[implementation, math]",PROGRAMMING -406,Codeforces Round #238 (Div. 1),1,Toy Sum,1000.0,B,1395502200,"[constructive algorithms, greedy]",PROGRAMMING -406,Codeforces Round #238 (Div. 1),1,Graph Cutting,2000.0,C,1395502200,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING -406,Codeforces Round #238 (Div. 1),1,Hill Climbing,2000.0,D,1395502200,"[dfs and similar, geometry, trees]",PROGRAMMING -406,Codeforces Round #238 (Div. 1),1,Hamming Triples,2500.0,E,1395502200,"[implementation, math]",PROGRAMMING -407,Codeforces Round #239 (Div. 1),1,Triangle,500.0,A,1396162800,"[brute force, implementation, math]",PROGRAMMING -407,Codeforces Round #239 (Div. 1),1,Long Path,1000.0,B,1396162800,"[dp, implementation]",PROGRAMMING -407,Codeforces Round #239 (Div. 1),1,Curious Array,2000.0,C,1396162800,"[brute force, implementation, math]",PROGRAMMING -407,Codeforces Round #239 (Div. 1),1,Largest Submatrix 3,2000.0,D,1396162800,"[dp, hashing]",PROGRAMMING -407,Codeforces Round #239 (Div. 1),1,k-d-sequence,2500.0,E,1396162800,[data structures],PROGRAMMING -408,Codeforces Round #239 (Div. 2),2,Line to Cashier,500.0,A,1396162800,[implementation],PROGRAMMING -408,Codeforces Round #239 (Div. 2),2,Garland,1000.0,B,1396162800,[implementation],PROGRAMMING -408,Codeforces Round #239 (Div. 2),2,Triangle,1500.0,C,1396162800,"[geometry, math]",PROGRAMMING -408,Codeforces Round #239 (Div. 2),2,Long Path,2000.0,D,1396162800,[dp],PROGRAMMING -408,Codeforces Round #239 (Div. 2),2,Curious Array,3000.0,E,1396162800,[],PROGRAMMING -412,Coder-Strike 2014 - Round 1,12,Poster,500.0,A,1397837400,"[greedy, implementation]",PROGRAMMING -412,Coder-Strike 2014 - Round 1,12,Network Configuration,1000.0,B,1397837400,"[greedy, sortings]",PROGRAMMING -412,Coder-Strike 2014 - Round 1,12,Pattern,1500.0,C,1397837400,"[implementation, strings]",PROGRAMMING -412,Coder-Strike 2014 - Round 1,12,Giving Awards,2000.0,D,1397837400,[dfs and similar],PROGRAMMING -412,Coder-Strike 2014 - Round 1,12,E-mail Addresses,2500.0,E,1397837400,[implementation],PROGRAMMING -413,Coder-Strike 2014 - Round 2,12,Data Recovery,500.0,A,1397977200,[implementation],PROGRAMMING -413,Coder-Strike 2014 - Round 2,12,Spyke Chatting,1000.0,B,1397977200,[implementation],PROGRAMMING -413,Coder-Strike 2014 - Round 2,12,Jeopardy!,1500.0,C,1397977200,"[greedy, math]",PROGRAMMING -413,Coder-Strike 2014 - Round 2,12,2048,2000.0,D,1397977200,"[bitmasks, dp]",PROGRAMMING -413,Coder-Strike 2014 - Round 2,12,Maze 2D,2500.0,E,1397977200,"[data structures, divide and conquer]",PROGRAMMING -414,Codeforces Round #240 (Div. 1),1,Mashmokh and Numbers,500.0,A,1396798800,"[constructive algorithms, number theory]",PROGRAMMING -414,Codeforces Round #240 (Div. 1),1,Mashmokh and ACM,1000.0,B,1396798800,"[combinatorics, dp]",PROGRAMMING -414,Codeforces Round #240 (Div. 1),1,Mashmokh and Reverse Operation,1500.0,C,1396798800,"[combinatorics, divide and conquer]",PROGRAMMING -414,Codeforces Round #240 (Div. 1),1,Mashmokh and Water Tanks,1500.0,D,1396798800,"[binary search, data structures, greedy, two pointers]",PROGRAMMING -414,Codeforces Round #240 (Div. 1),1,Mashmokh's Designed Problem,2500.0,E,1396798800,[data structures],PROGRAMMING -415,Codeforces Round #240 (Div. 2),2,Mashmokh and Lights,500.0,A,1396798800,[implementation],PROGRAMMING -415,Codeforces Round #240 (Div. 2),2,Mashmokh and Tokens,1000.0,B,1396798800,"[binary search, greedy, math]",PROGRAMMING -415,Codeforces Round #240 (Div. 2),2,Mashmokh and Numbers,1500.0,C,1396798800,"[constructive algorithms, greedy, number theory]",PROGRAMMING -415,Codeforces Round #240 (Div. 2),2,Mashmokh and ACM,2000.0,D,1396798800,"[combinatorics, dp, number theory]",PROGRAMMING -415,Codeforces Round #240 (Div. 2),2,Mashmokh and Reverse Operation,2500.0,E,1396798800,"[divide and conquer, sortings]",PROGRAMMING -416,Codeforces Round #241 (Div. 2),2,Guess a number!,500.0,A,1397376000,"[greedy, implementation, two pointers]",PROGRAMMING -416,Codeforces Round #241 (Div. 2),2,Art Union,1000.0,B,1397376000,"[brute force, dp, implementation]",PROGRAMMING -416,Codeforces Round #241 (Div. 2),2,Booking System,1500.0,C,1397376000,"[binary search, dp, greedy, implementation]",PROGRAMMING -416,Codeforces Round #241 (Div. 2),2,Population Size,2000.0,D,1397376000,"[greedy, implementation]",PROGRAMMING -416,Codeforces Round #241 (Div. 2),2,President's Path,2500.0,E,1397376000,"[dp, graphs, shortest paths]",PROGRAMMING -417,RCC 2014 Warmup (Div. 2),2,Elimination,500.0,A,1397749200,"[dp, implementation, math]",PROGRAMMING -417,RCC 2014 Warmup (Div. 2),2,Crash,1000.0,B,1397749200,[implementation],PROGRAMMING -417,RCC 2014 Warmup (Div. 2),2,Football,1500.0,C,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING -417,RCC 2014 Warmup (Div. 2),2,Cunning Gena,2000.0,D,1397749200,"[bitmasks, dp, greedy, sortings]",PROGRAMMING -417,RCC 2014 Warmup (Div. 2),2,Square Table,2500.0,E,1397749200,"[constructive algorithms, math, probabilities]",PROGRAMMING -418,RCC 2014 Warmup (Div. 1),1,Football,500.0,A,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING -418,RCC 2014 Warmup (Div. 1),1,Cunning Gena,1000.0,B,1397749200,"[bitmasks, dp, sortings]",PROGRAMMING -418,RCC 2014 Warmup (Div. 1),1,Square Table,1500.0,C,1397749200,"[constructive algorithms, dp, math]",PROGRAMMING -418,RCC 2014 Warmup (Div. 1),1,Big Problems for Organizers,2500.0,D,1397749200,"[data structures, graphs, trees]",PROGRAMMING -418,RCC 2014 Warmup (Div. 1),1,Tricky Password,2500.0,E,1397749200,[data structures],PROGRAMMING -419,Coder-Strike 2014 - Finals,12,Start Up,500.0,A,1398169200,[],PROGRAMMING -419,Coder-Strike 2014 - Finals,12,Online Meeting,1500.0,B,1398169200,[],PROGRAMMING -419,Coder-Strike 2014 - Finals,12,Bug in Code,1500.0,C,1398169200,[],PROGRAMMING -419,Coder-Strike 2014 - Finals,12,Cup Trick,1500.0,D,1398169200,[],PROGRAMMING -419,Coder-Strike 2014 - Finals,12,Playing the ball,2000.0,E,1398169200,[],PROGRAMMING -420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Start Up,500.0,A,1398169140,[implementation],PROGRAMMING -420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Online Meeting,1500.0,B,1398169140,[implementation],PROGRAMMING -420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Bug in Code,1500.0,C,1398169140,"[data structures, graphs, implementation, two pointers]",PROGRAMMING -420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Cup Trick,1500.0,D,1398169140,[data structures],PROGRAMMING -420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Playing the ball,2000.0,E,1398169140,[geometry],PROGRAMMING -421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Pasha and Hamsters,500.0,A,1398168900,"[constructive algorithms, implementation]",PROGRAMMING -421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Start Up,1000.0,B,1398168900,[implementation],PROGRAMMING -421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Online Meeting,2000.0,C,1398168900,[implementation],PROGRAMMING -421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Bug in Code,2000.0,D,1398168900,"[binary search, data structures, sortings]",PROGRAMMING -421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Cup Trick,2000.0,E,1398168900,[data structures],PROGRAMMING -424,Codeforces Round #242 (Div. 2),2,Squats,500.0,A,1398409200,[implementation],PROGRAMMING -424,Codeforces Round #242 (Div. 2),2,Megacity,1000.0,B,1398409200,"[binary search, greedy, implementation, sortings]",PROGRAMMING -424,Codeforces Round #242 (Div. 2),2,Magic Formulas,1500.0,C,1398409200,[math],PROGRAMMING -424,Codeforces Round #242 (Div. 2),2,Biathlon Track,2500.0,D,1398409200,"[binary search, brute force, constructive algorithms, data structures, dp]",PROGRAMMING -424,Codeforces Round #242 (Div. 2),2,Colored Jenga,3000.0,E,1398409200,"[dfs and similar, dp, probabilities]",PROGRAMMING -425,Codeforces Round #243 (Div. 1),1,Sereja and Swaps,500.0,A,1398612600,"[brute force, sortings]",PROGRAMMING -425,Codeforces Round #243 (Div. 1),1,Sereja and Table ,1000.0,B,1398612600,"[bitmasks, greedy]",PROGRAMMING -425,Codeforces Round #243 (Div. 1),1,Sereja and Two Sequences,1500.0,C,1398612600,"[data structures, dp]",PROGRAMMING -425,Codeforces Round #243 (Div. 1),1,Sereja and Squares,2000.0,D,1398612600,"[binary search, data structures, hashing]",PROGRAMMING -425,Codeforces Round #243 (Div. 1),1,Sereja and Sets,2000.0,E,1398612600,[dp],PROGRAMMING -426,Codeforces Round #243 (Div. 2),2,Sereja and Mugs,500.0,A,1398612600,[implementation],PROGRAMMING -426,Codeforces Round #243 (Div. 2),2,Sereja and Mirroring,1000.0,B,1398612600,[implementation],PROGRAMMING -426,Codeforces Round #243 (Div. 2),2,Sereja and Swaps,1500.0,C,1398612600,"[brute force, sortings, two pointers]",PROGRAMMING -426,Codeforces Round #243 (Div. 2),2,Sereja and Table ,2000.0,D,1398612600,[],PROGRAMMING -426,Codeforces Round #243 (Div. 2),2,Sereja and Two Sequences,2500.0,E,1398612600,[],PROGRAMMING -427,Codeforces Round #244 (Div. 2),2,Police Recruits,500.0,A,1399044600,[implementation],PROGRAMMING -427,Codeforces Round #244 (Div. 2),2,Prison Transfer,1000.0,B,1399044600,"[data structures, implementation]",PROGRAMMING -427,Codeforces Round #244 (Div. 2),2,Checkposts,1500.0,C,1399044600,"[dfs and similar, graphs, two pointers]",PROGRAMMING -427,Codeforces Round #244 (Div. 2),2,Match & Catch,2000.0,D,1399044600,"[dp, string suffix structures, strings]",PROGRAMMING -427,Codeforces Round #244 (Div. 2),2,Police Patrol,2500.0,E,1399044600,"[greedy, implementation, math, ternary search]",PROGRAMMING -429,Codeforces Round #245 (Div. 1),1,Xor-tree,500.0,A,1399822800,"[dfs and similar, trees]",PROGRAMMING -429,Codeforces Round #245 (Div. 1),1,Working out,1000.0,B,1399822800,[dp],PROGRAMMING -429,Codeforces Round #245 (Div. 1),1,Guess the Tree,1500.0,C,1399822800,"[bitmasks, constructive algorithms, dp, greedy, trees]",PROGRAMMING -429,Codeforces Round #245 (Div. 1),1,Tricky Function,2000.0,D,1399822800,"[data structures, divide and conquer, geometry]",PROGRAMMING -429,Codeforces Round #245 (Div. 1),1,Points and Segments,2000.0,E,1399822800,[graphs],PROGRAMMING -430,Codeforces Round #245 (Div. 2),2,Points and Segments (easy),500.0,A,1399822800,"[constructive algorithms, sortings]",PROGRAMMING -430,Codeforces Round #245 (Div. 2),2,Balls Game,1000.0,B,1399822800,"[brute force, two pointers]",PROGRAMMING -430,Codeforces Round #245 (Div. 2),2,Xor-tree,1500.0,C,1399822800,"[brute force, data structures, dfs and similar, trees]",PROGRAMMING -430,Codeforces Round #245 (Div. 2),2,Working out,2000.0,D,1399822800,"[brute force, dp]",PROGRAMMING -430,Codeforces Round #245 (Div. 2),2,Guess the Tree,2500.0,E,1399822800,"[constructive algorithms, data structures, dfs and similar]",PROGRAMMING -431,Codeforces Round #247 (Div. 2),2,Black Square,500.0,A,1400686200,[implementation],PROGRAMMING -431,Codeforces Round #247 (Div. 2),2,Shower Line,1500.0,B,1400686200,"[brute force, implementation]",PROGRAMMING -431,Codeforces Round #247 (Div. 2),2,k-Tree,1500.0,C,1400686200,"[dp, implementation, trees]",PROGRAMMING -431,Codeforces Round #247 (Div. 2),2,Random Task,2000.0,D,1400686200,"[binary search, bitmasks, combinatorics, dp, math]",PROGRAMMING -431,Codeforces Round #247 (Div. 2),2,Chemistry Experiment,2500.0,E,1400686200,"[binary search, data structures, ternary search]",PROGRAMMING -432,Codeforces Round #246 (Div. 2),2,Choosing Teams,500.0,A,1400167800,"[greedy, implementation, sortings]",PROGRAMMING -432,Codeforces Round #246 (Div. 2),2,Football Kit,1000.0,B,1400167800,"[brute force, greedy, implementation]",PROGRAMMING -432,Codeforces Round #246 (Div. 2),2,Prime Swaps,1500.0,C,1400167800,"[greedy, sortings]",PROGRAMMING -432,Codeforces Round #246 (Div. 2),2,Prefixes and Suffixes,2000.0,D,1400167800,"[dp, string suffix structures, strings, two pointers]",PROGRAMMING -432,Codeforces Round #246 (Div. 2),2,Square Tiling,2500.0,E,1400167800,"[constructive algorithms, greedy]",PROGRAMMING -433,Codeforces Round #248 (Div. 2),2,Kitahara Haruki's Gift,500.0,A,1400914800,"[brute force, implementation]",PROGRAMMING -433,Codeforces Round #248 (Div. 2),2,Kuriyama Mirai's Stones,1500.0,B,1400914800,"[dp, implementation, sortings]",PROGRAMMING -433,Codeforces Round #248 (Div. 2),2,Ryouko's Memory Note,1500.0,C,1400914800,"[implementation, math, sortings]",PROGRAMMING -433,Codeforces Round #248 (Div. 2),2,Nanami's Digital Board,2000.0,D,1400914800,"[dsu, implementation]",PROGRAMMING -433,Codeforces Round #248 (Div. 2),2,Tachibana Kanade's Tofu,2500.0,E,1400914800,[dp],PROGRAMMING -434,Codeforces Round #248 (Div. 1),1,Ryouko's Memory Note,500.0,A,1400914800,"[math, sortings]",PROGRAMMING -434,Codeforces Round #248 (Div. 1),1,Nanami's Digital Board,1000.0,B,1400914800,"[divide and conquer, dp, dsu, implementation, two pointers]",PROGRAMMING -434,Codeforces Round #248 (Div. 1),1,Tachibana Kanade's Tofu,1500.0,C,1400914800,[dp],PROGRAMMING -434,Codeforces Round #248 (Div. 1),1,Nanami's Power Plant,2000.0,D,1400914800,[flows],PROGRAMMING -434,Codeforces Round #248 (Div. 1),1,Furukawa Nagisa's Tree,3000.0,E,1400914800,"[binary search, divide and conquer, sortings, trees]",PROGRAMMING -435,Codeforces Round #249 (Div. 2),2,Queue on Bus Stop,500.0,A,1401463800,[implementation],PROGRAMMING -435,Codeforces Round #249 (Div. 2),2,Pasha Maximizes,1000.0,B,1401463800,[greedy],PROGRAMMING -435,Codeforces Round #249 (Div. 2),2,Cardiogram,1500.0,C,1401463800,[implementation],PROGRAMMING -435,Codeforces Round #249 (Div. 2),2,Special Grid,2000.0,D,1401463800,"[brute force, dp, greedy]",PROGRAMMING -435,Codeforces Round #249 (Div. 2),2,Special Graph,2500.0,E,1401463800,[],PROGRAMMING -436,Zepto Code Rush 2014,12,Feed with Candy,1000.0,A,1402673400,[greedy],PROGRAMMING -436,Zepto Code Rush 2014,12,Om Nom and Spiders,1000.0,B,1402673400,"[implementation, math]",PROGRAMMING -436,Zepto Code Rush 2014,12,Dungeons and Candies,1500.0,C,1402673400,"[dsu, graphs, greedy, trees]",PROGRAMMING -436,Zepto Code Rush 2014,12,Pudding Monsters,2500.0,D,1402673400,[dp],PROGRAMMING -436,Zepto Code Rush 2014,12,Cardboard Box,2500.0,E,1402673400,"[data structures, greedy]",PROGRAMMING -436,Zepto Code Rush 2014,12,Banners,3000.0,F,1402673400,"[brute force, data structures, dp]",PROGRAMMING -437,Codeforces Round #250 (Div. 2),2,The Child and Homework,500.0,A,1401627600,[implementation],PROGRAMMING -437,Codeforces Round #250 (Div. 2),2,The Child and Set,1500.0,B,1401627600,"[bitmasks, greedy, implementation, sortings]",PROGRAMMING -437,Codeforces Round #250 (Div. 2),2,The Child and Toy,1500.0,C,1401627600,"[graphs, greedy, sortings]",PROGRAMMING -437,Codeforces Round #250 (Div. 2),2,The Child and Zoo,2000.0,D,1401627600,"[dsu, sortings]",PROGRAMMING -437,Codeforces Round #250 (Div. 2),2,The Child and Polygon,2500.0,E,1401627600,[],PROGRAMMING -438,Codeforces Round #250 (Div. 1),1,The Child and Toy,500.0,A,1401627600,[greedy],PROGRAMMING -438,Codeforces Round #250 (Div. 1),1,The Child and Zoo,1000.0,B,1401627600,"[dp, dsu, sortings]",PROGRAMMING -438,Codeforces Round #250 (Div. 1),1,The Child and Polygon,1500.0,C,1401627600,"[dp, geometry]",PROGRAMMING -438,Codeforces Round #250 (Div. 1),1,The Child and Sequence,2000.0,D,1401627600,[data structures],PROGRAMMING -438,Codeforces Round #250 (Div. 1),1,The Child and Binary Tree,3000.0,E,1401627600,"[combinatorics, divide and conquer, fft, number theory]",PROGRAMMING -439,Codeforces Round #251 (Div. 2),2,"Devu, the Singer and Churu, the Joker",500.0,A,1401895800,"[greedy, implementation]",PROGRAMMING -439,Codeforces Round #251 (Div. 2),2,"Devu, the Dumb Guy",1000.0,B,1401895800,"[implementation, sortings]",PROGRAMMING -439,Codeforces Round #251 (Div. 2),2,Devu and Partitioning of the Array,1500.0,C,1401895800,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING -439,Codeforces Round #251 (Div. 2),2,Devu and his Brother,2000.0,D,1401895800,"[binary search, sortings, ternary search, two pointers]",PROGRAMMING -439,Codeforces Round #251 (Div. 2),2,Devu and Birthday Celebration,2500.0,E,1401895800,"[combinatorics, dp, math]",PROGRAMMING -441,Codeforces Round #252 (Div. 2),2,Valera and Antique Items,500.0,A,1402241400,[implementation],PROGRAMMING -441,Codeforces Round #252 (Div. 2),2,Valera and Fruits,1000.0,B,1402241400,"[greedy, implementation]",PROGRAMMING -441,Codeforces Round #252 (Div. 2),2,Valera and Tubes ,1500.0,C,1402241400,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING -441,Codeforces Round #252 (Div. 2),2,Valera and Swaps,2000.0,D,1402241400,"[constructive algorithms, dsu, graphs, implementation, string suffix structures]",PROGRAMMING -441,Codeforces Round #252 (Div. 2),2,Valera and Number,2500.0,E,1402241400,"[bitmasks, dp]",PROGRAMMING -442,Codeforces Round #253 (Div. 1),1,Borya and Hanabi,500.0,A,1403191800,"[bitmasks, brute force, implementation]",PROGRAMMING -442,Codeforces Round #253 (Div. 1),1,Andrey and Problem,1500.0,B,1403191800,"[greedy, math, probabilities]",PROGRAMMING -442,Codeforces Round #253 (Div. 1),1,Artem and Array ,1500.0,C,1403191800,"[data structures, greedy]",PROGRAMMING -442,Codeforces Round #253 (Div. 1),1,Adam and Tree,2000.0,D,1403191800,"[data structures, trees]",PROGRAMMING -442,Codeforces Round #253 (Div. 1),1,Gena and Second Distance,2500.0,E,1403191800,[geometry],PROGRAMMING -443,Codeforces Round #253 (Div. 2),2,Anton and Letters,500.0,A,1403191800,"[constructive algorithms, implementation]",PROGRAMMING -443,Codeforces Round #253 (Div. 2),2,Kolya and Tandem Repeat,1000.0,B,1403191800,[brute force],PROGRAMMING -443,Codeforces Round #253 (Div. 2),2,Borya and Hanabi,1500.0,C,1403191800,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING -443,Codeforces Round #253 (Div. 2),2,Andrey and Problem,2500.0,D,1403191800,"[dp, greedy, math, probabilities, sortings]",PROGRAMMING -443,Codeforces Round #253 (Div. 2),2,Artem and Array ,2500.0,E,1403191800,[],PROGRAMMING -444,Codeforces Round #254 (Div. 1),1,DZY Loves Physics,500.0,A,1404651900,"[greedy, math]",PROGRAMMING -444,Codeforces Round #254 (Div. 1),1,DZY Loves FFT,1000.0,B,1404651900,[probabilities],PROGRAMMING -444,Codeforces Round #254 (Div. 1),1,DZY Loves Colors,2000.0,C,1404651900,[data structures],PROGRAMMING -444,Codeforces Round #254 (Div. 1),1,DZY Loves Strings,2000.0,D,1404651900,"[binary search, hashing, strings, two pointers]",PROGRAMMING -444,Codeforces Round #254 (Div. 1),1,DZY Loves Planting,2500.0,E,1404651900,"[binary search, dsu, trees]",PROGRAMMING -445,Codeforces Round #254 (Div. 2),2,DZY Loves Chessboard,500.0,A,1404651900,"[dfs and similar, implementation]",PROGRAMMING -445,Codeforces Round #254 (Div. 2),2,DZY Loves Chemistry,1000.0,B,1404651900,"[dfs and similar, dsu, greedy]",PROGRAMMING -445,Codeforces Round #254 (Div. 2),2,DZY Loves Physics,1500.0,C,1404651900,"[graphs, greedy]",PROGRAMMING -445,Codeforces Round #254 (Div. 2),2,DZY Loves FFT,2000.0,D,1404651900,[probabilities],PROGRAMMING -445,Codeforces Round #254 (Div. 2),2,DZY Loves Colors,3000.0,E,1404651900,[data structures],PROGRAMMING -446,Codeforces Round #FF (Div. 1),1,DZY Loves Sequences,500.0,A,1405256400,"[dp, implementation, two pointers]",PROGRAMMING -446,Codeforces Round #FF (Div. 1),1,DZY Loves Modification,1500.0,B,1405256400,"[brute force, greedy]",PROGRAMMING -446,Codeforces Round #FF (Div. 1),1,DZY Loves Fibonacci Numbers,1500.0,C,1405256400,"[data structures, number theory]",PROGRAMMING -446,Codeforces Round #FF (Div. 1),1,DZY Loves Games,2000.0,D,1405256400,"[math, matrices, probabilities]",PROGRAMMING -446,Codeforces Round #FF (Div. 1),1,DZY Loves Bridges,2500.0,E,1405256400,"[math, matrices]",PROGRAMMING -447,Codeforces Round #FF (Div. 2),2,DZY Loves Hash,500.0,A,1405256400,[implementation],PROGRAMMING -447,Codeforces Round #FF (Div. 2),2,DZY Loves Strings,1000.0,B,1405256400,"[greedy, implementation]",PROGRAMMING -447,Codeforces Round #FF (Div. 2),2,DZY Loves Sequences,1500.0,C,1405256400,[dp],PROGRAMMING -447,Codeforces Round #FF (Div. 2),2,DZY Loves Modification,2500.0,D,1405256400,"[data structures, greedy]",PROGRAMMING -447,Codeforces Round #FF (Div. 2),2,DZY Loves Fibonacci Numbers,2500.0,E,1405256400,[data structures],PROGRAMMING -448,Codeforces Round #256 (Div. 2),2,Rewards,500.0,A,1405605600,[implementation],PROGRAMMING -448,Codeforces Round #256 (Div. 2),2,Suffix Structures,1000.0,B,1405605600,"[implementation, strings]",PROGRAMMING -448,Codeforces Round #256 (Div. 2),2,Painting Fence,2500.0,C,1405605600,"[divide and conquer, dp, greedy]",PROGRAMMING -448,Codeforces Round #256 (Div. 2),2,Multiplication Table,2000.0,D,1405605600,"[binary search, brute force]",PROGRAMMING -448,Codeforces Round #256 (Div. 2),2,Divisors,3000.0,E,1405605600,"[brute force, dfs and similar, implementation, number theory]",PROGRAMMING -449,Codeforces Round #257 (Div. 1),1,Jzzhu and Chocolate,500.0,A,1405774800,[math],PROGRAMMING -449,Codeforces Round #257 (Div. 1),1,Jzzhu and Cities,1000.0,B,1405774800,"[graphs, shortest paths]",PROGRAMMING -449,Codeforces Round #257 (Div. 1),1,Jzzhu and Apples,1500.0,C,1405774800,"[constructive algorithms, number theory]",PROGRAMMING -449,Codeforces Round #257 (Div. 1),1,Jzzhu and Numbers,2000.0,D,1405774800,"[bitmasks, combinatorics, dp]",PROGRAMMING -449,Codeforces Round #257 (Div. 1),1,Jzzhu and Squares,2500.0,E,1405774800,"[dp, math, number theory]",PROGRAMMING -450,Codeforces Round #257 (Div. 2),2,Jzzhu and Children,500.0,A,1405774800,[implementation],PROGRAMMING -450,Codeforces Round #257 (Div. 2),2,Jzzhu and Sequences,1000.0,B,1405774800,"[implementation, math]",PROGRAMMING -450,Codeforces Round #257 (Div. 2),2,Jzzhu and Chocolate,1500.0,C,1405774800,"[greedy, implementation]",PROGRAMMING -450,Codeforces Round #257 (Div. 2),2,Jzzhu and Cities,2000.0,D,1405774800,"[graphs, shortest paths]",PROGRAMMING -450,Codeforces Round #257 (Div. 2),2,Jzzhu and Apples,2500.0,E,1405774800,"[constructive algorithms, number theory]",PROGRAMMING -451,Codeforces Round #258 (Div. 2),2,Game With Sticks,500.0,A,1406215800,[implementation],PROGRAMMING -451,Codeforces Round #258 (Div. 2),2,Sort the Array,1000.0,B,1406215800,"[implementation, sortings]",PROGRAMMING -451,Codeforces Round #258 (Div. 2),2,Predict Outcome of the Game,1500.0,C,1406215800,"[brute force, implementation, math]",PROGRAMMING -451,Codeforces Round #258 (Div. 2),2,Count Good Substrings,2500.0,D,1406215800,[math],PROGRAMMING -451,Codeforces Round #258 (Div. 2),2,Devu and Flowers,3000.0,E,1406215800,"[bitmasks, combinatorics, number theory]",PROGRAMMING -452,MemSQL Start[c]UP 2.0 - Round 1,12,Eevee,500.0,A,1406480400,"[implementation, strings]",PROGRAMMING -452,MemSQL Start[c]UP 2.0 - Round 1,12,4-point polyline,1000.0,B,1406480400,"[brute force, constructive algorithms, geometry, trees]",PROGRAMMING -452,MemSQL Start[c]UP 2.0 - Round 1,12,Magic Trick,1000.0,C,1406480400,"[combinatorics, math, probabilities]",PROGRAMMING -452,MemSQL Start[c]UP 2.0 - Round 1,12,"Washer, Dryer, Folder",1500.0,D,1406480400,"[greedy, implementation]",PROGRAMMING -452,MemSQL Start[c]UP 2.0 - Round 1,12,Three strings,2500.0,E,1406480400,"[data structures, dsu, string suffix structures, strings]",PROGRAMMING -452,MemSQL Start[c]UP 2.0 - Round 1,12,Permutation,2500.0,F,1406480400,"[data structures, divide and conquer, hashing]",PROGRAMMING -453,Codeforces Round #259 (Div. 1),1,Little Pony and Expected Maximum,500.0,A,1406907000,[probabilities],PROGRAMMING -453,Codeforces Round #259 (Div. 1),1,Little Pony and Harmony Chest,1000.0,B,1406907000,"[bitmasks, brute force, dp]",PROGRAMMING -453,Codeforces Round #259 (Div. 1),1,Little Pony and Summer Sun Celebration,1500.0,C,1406907000,"[constructive algorithms, dfs and similar]",PROGRAMMING -453,Codeforces Round #259 (Div. 1),1,Little Pony and Elements of Harmony,2500.0,D,1406907000,"[dp, matrices]",PROGRAMMING -453,Codeforces Round #259 (Div. 1),1,Little Pony and Lord Tirek,2500.0,E,1406907000,[data structures],PROGRAMMING -454,Codeforces Round #259 (Div. 2),2,Little Pony and Crystal Mine,500.0,A,1406907000,[implementation],PROGRAMMING -454,Codeforces Round #259 (Div. 2),2,Little Pony and Sort by Shift,1000.0,B,1406907000,[implementation],PROGRAMMING -454,Codeforces Round #259 (Div. 2),2,Little Pony and Expected Maximum,1500.0,C,1406907000,"[combinatorics, math, probabilities]",PROGRAMMING -454,Codeforces Round #259 (Div. 2),2,Little Pony and Harmony Chest,2000.0,D,1406907000,"[bitmasks, dp]",PROGRAMMING -454,Codeforces Round #259 (Div. 2),2,Little Pony and Summer Sun Celebration,2500.0,E,1406907000,[dfs and similar],PROGRAMMING -455,Codeforces Round #260 (Div. 1),1,Boredom,500.0,A,1407511800,[dp],PROGRAMMING -455,Codeforces Round #260 (Div. 1),1,A Lot of Games,1000.0,B,1407511800,"[dfs and similar, dp, games, implementation, strings, trees]",PROGRAMMING -455,Codeforces Round #260 (Div. 1),1,Civilization,1500.0,C,1407511800,"[dfs and similar, dp, dsu, ternary search, trees]",PROGRAMMING -455,Codeforces Round #260 (Div. 1),1,Serega and Fun,2000.0,D,1407511800,[data structures],PROGRAMMING -455,Codeforces Round #260 (Div. 1),1,Function,2500.0,E,1407511800,[data structures],PROGRAMMING -456,Codeforces Round #260 (Div. 2),2,Laptops,500.0,A,1407511800,[sortings],PROGRAMMING -456,Codeforces Round #260 (Div. 2),2,Fedya and Maths,1000.0,B,1407511800,"[math, number theory]",PROGRAMMING -456,Codeforces Round #260 (Div. 2),2,Boredom,1500.0,C,1407511800,[dp],PROGRAMMING -456,Codeforces Round #260 (Div. 2),2,A Lot of Games,2000.0,D,1407511800,"[dp, games, strings]",PROGRAMMING -456,Codeforces Round #260 (Div. 2),2,Civilization,2500.0,E,1407511800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING -457,MemSQL Start[c]UP 2.0 - Round 2,12,Golden System,1000.0,A,1407690000,"[math, meet-in-the-middle]",PROGRAMMING -457,MemSQL Start[c]UP 2.0 - Round 2,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING -457,MemSQL Start[c]UP 2.0 - Round 2,12,Elections,1500.0,C,1407690000,[brute force],PROGRAMMING -457,MemSQL Start[c]UP 2.0 - Round 2,12,Bingo!,2000.0,D,1407690000,"[combinatorics, math, probabilities]",PROGRAMMING -457,MemSQL Start[c]UP 2.0 - Round 2,12,Flow Optimality,2500.0,E,1407690000,"[constructive algorithms, flows, math]",PROGRAMMING -457,MemSQL Start[c]UP 2.0 - Round 2,12,An easy problem about trees,3000.0,F,1407690000,"[dp, games, greedy, trees]",PROGRAMMING -459,Codeforces Round #261 (Div. 2),2,Pashmak and Garden,500.0,A,1408116600,[implementation],PROGRAMMING -459,Codeforces Round #261 (Div. 2),2,Pashmak and Flowers,500.0,B,1408116600,"[implementation, sortings]",PROGRAMMING -459,Codeforces Round #261 (Div. 2),2,Pashmak and Buses,2000.0,C,1408116600,"[combinatorics, constructive algorithms, math]",PROGRAMMING -459,Codeforces Round #261 (Div. 2),2,Pashmak and Parmida's problem,2000.0,D,1408116600,"[data structures, divide and conquer, sortings]",PROGRAMMING -459,Codeforces Round #261 (Div. 2),2,Pashmak and Graph,3000.0,E,1408116600,"[dp, sortings]",PROGRAMMING -460,Codeforces Round #262 (Div. 2),2,Vasya and Socks,500.0,A,1408548600,"[brute force, implementation]",PROGRAMMING -460,Codeforces Round #262 (Div. 2),2,Little Dima and Equation,1000.0,B,1408548600,"[brute force, implementation, math]",PROGRAMMING -460,Codeforces Round #262 (Div. 2),2,Present,1500.0,C,1408548600,"[binary search, data structures, greedy]",PROGRAMMING -460,Codeforces Round #262 (Div. 2),2,Little Victor and Set,2000.0,D,1408548600,"[brute force, constructive algorithms]",PROGRAMMING -460,Codeforces Round #262 (Div. 2),2,Roland and Rose,2500.0,E,1408548600,"[brute force, geometry, math, sortings]",PROGRAMMING -461,Codeforces Round #263 (Div. 1),1,Appleman and Toastman,500.0,A,1409061600,"[greedy, sortings]",PROGRAMMING -461,Codeforces Round #263 (Div. 1),1,Appleman and Tree,1000.0,B,1409061600,"[dfs and similar, dp, trees]",PROGRAMMING -461,Codeforces Round #263 (Div. 1),1,Appleman and a Sheet of Paper,1500.0,C,1409061600,"[data structures, implementation]",PROGRAMMING -461,Codeforces Round #263 (Div. 1),1,Appleman and Complicated Task,2000.0,D,1409061600,"[dsu, math]",PROGRAMMING -461,Codeforces Round #263 (Div. 1),1,Appleman and a Game,2500.0,E,1409061600,[shortest paths],PROGRAMMING -462,Codeforces Round #263 (Div. 2),2,Appleman and Easy Task,500.0,A,1409061600,"[brute force, implementation]",PROGRAMMING -462,Codeforces Round #263 (Div. 2),2,Appleman and Card Game,1000.0,B,1409061600,[greedy],PROGRAMMING -462,Codeforces Round #263 (Div. 2),2,Appleman and Toastman,1500.0,C,1409061600,"[implementation, sortings]",PROGRAMMING -462,Codeforces Round #263 (Div. 2),2,Appleman and Tree,2000.0,D,1409061600,"[dp, graphs]",PROGRAMMING -462,Codeforces Round #263 (Div. 2),2,Appleman and a Sheet of Paper,2500.0,E,1409061600,[],PROGRAMMING -463,Codeforces Round #264 (Div. 2),2,Caisa and Sugar,500.0,A,1409383800,[implementation],PROGRAMMING -463,Codeforces Round #264 (Div. 2),2,Caisa and Pylons,1000.0,B,1409383800,[math],PROGRAMMING -463,Codeforces Round #264 (Div. 2),2,Gargari and Bishops,1500.0,C,1409383800,"[greedy, hashing, implementation]",PROGRAMMING -463,Codeforces Round #264 (Div. 2),2,Gargari and Permutations,2000.0,D,1409383800,"[dfs and similar, dp, graphs]",PROGRAMMING -463,Codeforces Round #264 (Div. 2),2,Caisa and Tree,2500.0,E,1409383800,"[brute force, dfs and similar, trees]",PROGRAMMING -464,Codeforces Round #265 (Div. 1),1,No to Palindromes!,500.0,A,1410103800,"[greedy, strings]",PROGRAMMING -464,Codeforces Round #265 (Div. 1),1,Restore Cube ,1500.0,B,1410103800,"[brute force, geometry]",PROGRAMMING -464,Codeforces Round #265 (Div. 1),1,Substitutes in Number,1500.0,C,1410103800,[dp],PROGRAMMING -464,Codeforces Round #265 (Div. 1),1,World of Darkraft - 2,2000.0,D,1410103800,"[dp, probabilities]",PROGRAMMING -464,Codeforces Round #265 (Div. 1),1,The Classic Problem,2500.0,E,1410103800,"[data structures, graphs, shortest paths]",PROGRAMMING -465,Codeforces Round #265 (Div. 2),2,inc ARG,500.0,A,1410103800,[implementation],PROGRAMMING -465,Codeforces Round #265 (Div. 2),2,Inbox (100500),1000.0,B,1410103800,[implementation],PROGRAMMING -465,Codeforces Round #265 (Div. 2),2,No to Palindromes!,1500.0,C,1410103800,[brute force],PROGRAMMING -465,Codeforces Round #265 (Div. 2),2,Restore Cube ,2500.0,D,1410103800,[brute force],PROGRAMMING -465,Codeforces Round #265 (Div. 2),2,Substitutes in Number,2500.0,E,1410103800,"[constructive algorithms, dp]",PROGRAMMING -466,Codeforces Round #266 (Div. 2),2,Cheap Travel,500.0,A,1410535800,[implementation],PROGRAMMING -466,Codeforces Round #266 (Div. 2),2,Wonder Room,1000.0,B,1410535800,"[brute force, math]",PROGRAMMING -466,Codeforces Round #266 (Div. 2),2,Number of Ways,1500.0,C,1410535800,"[binary search, brute force, data structures, dp, two pointers]",PROGRAMMING -466,Codeforces Round #266 (Div. 2),2,Increase Sequence,2000.0,D,1410535800,"[combinatorics, dp]",PROGRAMMING -466,Codeforces Round #266 (Div. 2),2,Information Graph,2500.0,E,1410535800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING -467,Codeforces Round #267 (Div. 2),2,George and Accommodation,500.0,A,1411054200,[implementation],PROGRAMMING -467,Codeforces Round #267 (Div. 2),2,Fedor and New Game,1000.0,B,1411054200,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING -467,Codeforces Round #267 (Div. 2),2,George and Job,1500.0,C,1411054200,"[dp, implementation]",PROGRAMMING -467,Codeforces Round #267 (Div. 2),2,Fedor and Essay,2000.0,D,1411054200,"[dfs and similar, dp, graphs, hashing, strings]",PROGRAMMING -467,Codeforces Round #267 (Div. 2),2,Alex and Complicated Task,2500.0,E,1411054200,"[data structures, dp, greedy]",PROGRAMMING -468,Codeforces Round #268 (Div. 1),1,24 Game,500.0,A,1411218000,"[constructive algorithms, greedy, math]",PROGRAMMING -468,Codeforces Round #268 (Div. 1),1,Two Sets,1000.0,B,1411218000,"[2-sat, dfs and similar, dsu, graph matchings, greedy]",PROGRAMMING -468,Codeforces Round #268 (Div. 1),1,Hack it!,1500.0,C,1411218000,"[binary search, constructive algorithms, math]",PROGRAMMING -468,Codeforces Round #268 (Div. 1),1,Tree,2000.0,D,1411218000,[graph matchings],PROGRAMMING -468,Codeforces Round #268 (Div. 1),1,Permanent,2500.0,E,1411218000,"[dp, graph matchings, math, meet-in-the-middle]",PROGRAMMING -469,Codeforces Round #268 (Div. 2),2,I Wanna Be the Guy,500.0,A,1411218000,"[greedy, implementation]",PROGRAMMING -469,Codeforces Round #268 (Div. 2),2,Chat Online,1000.0,B,1411218000,[implementation],PROGRAMMING -469,Codeforces Round #268 (Div. 2),2,24 Game,1500.0,C,1411218000,"[constructive algorithms, implementation]",PROGRAMMING -469,Codeforces Round #268 (Div. 2),2,Two Sets,2000.0,D,1411218000,"[2-sat, data structures, graph matchings, greedy]",PROGRAMMING -469,Codeforces Round #268 (Div. 2),2,Hack it!,2500.0,E,1411218000,[constructive algorithms],PROGRAMMING -471,Codeforces Round #269 (Div. 2),2,MUH and Sticks,500.0,A,1411745400,[implementation],PROGRAMMING -471,Codeforces Round #269 (Div. 2),2,MUH and Important Things,1000.0,B,1411745400,[sortings],PROGRAMMING -471,Codeforces Round #269 (Div. 2),2,MUH and House of Cards,2000.0,C,1411745400,"[binary search, brute force, greedy, math]",PROGRAMMING -471,Codeforces Round #269 (Div. 2),2,MUH and Cube Walls,2000.0,D,1411745400,"[string suffix structures, strings]",PROGRAMMING -471,Codeforces Round #269 (Div. 2),2,MUH and Lots and Lots of Segments,2500.0,E,1411745400,"[data structures, dsu]",PROGRAMMING -472,Codeforces Round #270,12,Design Tutorial: Learn from Math,500.0,A,1411918500,"[math, number theory]",PROGRAMMING -472,Codeforces Round #270,12,Design Tutorial: Learn from Life,1000.0,B,1411918500,[],PROGRAMMING -472,Codeforces Round #270,12,Design Tutorial: Make It Nondeterministic,1500.0,C,1411918500,[greedy],PROGRAMMING -472,Codeforces Round #270,12,Design Tutorial: Inverse the Problem,2000.0,D,1411918500,"[dfs and similar, dsu, shortest paths, trees]",PROGRAMMING -472,Codeforces Round #270,12,Design Tutorial: Learn from a Game,3000.0,E,1411918500,"[constructive algorithms, implementation]",PROGRAMMING -472,Codeforces Round #270,12,Design Tutorial: Change the Goal,3000.0,F,1411918500,"[constructive algorithms, math, matrices]",PROGRAMMING -472,Codeforces Round #270,12,Design Tutorial: Increase the Constraints,3500.0,G,1411918500,"[bitmasks, data structures, fft]",PROGRAMMING -474,Codeforces Round #271 (Div. 2),2,Keyboard,500.0,A,1412609400,[implementation],PROGRAMMING -474,Codeforces Round #271 (Div. 2),2,Worms,1000.0,B,1412609400,"[binary search, implementation]",PROGRAMMING -474,Codeforces Round #271 (Div. 2),2,Captain Marmot,1500.0,C,1412609400,"[brute force, geometry]",PROGRAMMING -474,Codeforces Round #271 (Div. 2),2,Flowers,2000.0,D,1412609400,[dp],PROGRAMMING -474,Codeforces Round #271 (Div. 2),2,Pillars,3000.0,E,1412609400,"[binary search, data structures, dp, sortings, trees]",PROGRAMMING -474,Codeforces Round #271 (Div. 2),2,Ant colony,3000.0,F,1412609400,"[data structures, number theory]",PROGRAMMING -475,Bayan 2015 Contest Warm Up,12,Bayan Bus,500.0,A,1412514000,[implementation],PROGRAMMING -475,Bayan 2015 Contest Warm Up,12,Strongly Connected City,1000.0,B,1412514000,"[brute force, dfs and similar, graphs, implementation]",PROGRAMMING -475,Bayan 2015 Contest Warm Up,12,Kamal-ol-molk's Painting,1500.0,C,1412514000,"[brute force, constructive algorithms, greedy]",PROGRAMMING -475,Bayan 2015 Contest Warm Up,12,CGCDSSQ,2000.0,D,1412514000,"[brute force, data structures, math]",PROGRAMMING -475,Bayan 2015 Contest Warm Up,12,Strongly Connected City 2,2500.0,E,1412514000,[dfs and similar],PROGRAMMING -475,Bayan 2015 Contest Warm Up,12,Meta-universe,2500.0,F,1412514000,[data structures],PROGRAMMING -476,Codeforces Round #272 (Div. 2),2,Dreamoon and Stairs,500.0,A,1413122400,"[implementation, math]",PROGRAMMING -476,Codeforces Round #272 (Div. 2),2,Dreamoon and WiFi,1500.0,B,1413122400,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",PROGRAMMING -476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sums,1500.0,C,1413122400,[math],PROGRAMMING -476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sets,2000.0,D,1413122400,"[constructive algorithms, greedy, math]",PROGRAMMING -476,Codeforces Round #272 (Div. 2),2,Dreamoon and Strings,2500.0,E,1413122400,"[dp, strings]",PROGRAMMING -477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sums,500.0,A,1413122400,[math],PROGRAMMING -477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sets,1000.0,B,1413122400,[math],PROGRAMMING -477,Codeforces Round #272 (Div. 1),1,Dreamoon and Strings,1500.0,C,1413122400,[dp],PROGRAMMING -477,Codeforces Round #272 (Div. 1),1,Dreamoon and Binary,2000.0,D,1413122400,"[dp, strings]",PROGRAMMING -477,Codeforces Round #272 (Div. 1),1,Dreamoon and Notepad,3000.0,E,1413122400,[data structures],PROGRAMMING -478,Codeforces Round #273 (Div. 2),2,Initial Bet,500.0,A,1413474000,[implementation],PROGRAMMING -478,Codeforces Round #273 (Div. 2),2,Random Teams,1000.0,B,1413474000,"[combinatorics, constructive algorithms, greedy, math]",PROGRAMMING -478,Codeforces Round #273 (Div. 2),2,Table Decorations,1500.0,C,1413474000,[greedy],PROGRAMMING -478,Codeforces Round #273 (Div. 2),2,Red-Green Towers,2000.0,D,1413474000,[dp],PROGRAMMING -478,Codeforces Round #273 (Div. 2),2,Wavy numbers,2500.0,E,1413474000,"[brute force, dfs and similar, meet-in-the-middle, sortings]",PROGRAMMING -479,Codeforces Round #274 (Div. 2),2,Expression,500.0,A,1413709200,"[brute force, math]",PROGRAMMING -479,Codeforces Round #274 (Div. 2),2,Towers,1000.0,B,1413709200,"[brute force, greedy, implementation, sortings]",PROGRAMMING -479,Codeforces Round #274 (Div. 2),2,Exams,1500.0,C,1413709200,"[greedy, sortings]",PROGRAMMING -479,Codeforces Round #274 (Div. 2),2,Long Jumps,2000.0,D,1413709200,"[binary search, greedy, implementation]",PROGRAMMING -479,Codeforces Round #274 (Div. 2),2,Riding in a Lift,2500.0,E,1413709200,[dp],PROGRAMMING -480,Codeforces Round #274 (Div. 1),1,Exams,500.0,A,1413709200,"[greedy, sortings]",PROGRAMMING -480,Codeforces Round #274 (Div. 1),1,Long Jumps,1000.0,B,1413709200,"[binary search, greedy, hashing, implementation, sortings]",PROGRAMMING -480,Codeforces Round #274 (Div. 1),1,Riding in a Lift,1500.0,C,1413709200,"[dp, implementation]",PROGRAMMING -480,Codeforces Round #274 (Div. 1),1,Parcels,2000.0,D,1413709200,"[dp, graphs]",PROGRAMMING -480,Codeforces Round #274 (Div. 1),1,Parking Lot,2500.0,E,1413709200,"[data structures, divide and conquer]",PROGRAMMING -482,Codeforces Round #275 (Div. 1),1,Diverse Permutation,500.0,A,1414170000,"[constructive algorithms, greedy]",PROGRAMMING -482,Codeforces Round #275 (Div. 1),1,Interesting Array,1500.0,B,1414170000,"[constructive algorithms, data structures, trees]",PROGRAMMING -482,Codeforces Round #275 (Div. 1),1,Game with Strings,1500.0,C,1414170000,"[bitmasks, dp, probabilities]",PROGRAMMING -482,Codeforces Round #275 (Div. 1),1,Random Function and Tree,2000.0,D,1414170000,"[combinatorics, dp, trees]",PROGRAMMING -482,Codeforces Round #275 (Div. 1),1,ELCA,2500.0,E,1414170000,"[data structures, trees]",PROGRAMMING -483,Codeforces Round #275 (Div. 2),2,Counterexample ,500.0,A,1414170000,"[brute force, implementation]",PROGRAMMING -483,Codeforces Round #275 (Div. 2),2,Friends and Presents,1000.0,B,1414170000,"[binary search, math]",PROGRAMMING -483,Codeforces Round #275 (Div. 2),2,Diverse Permutation,1500.0,C,1414170000,"[constructive algorithms, implementation]",PROGRAMMING -483,Codeforces Round #275 (Div. 2),2,Interesting Array,2500.0,D,1414170000,[data structures],PROGRAMMING -483,Codeforces Round #275 (Div. 2),2,Game with Strings,2500.0,E,1414170000,[],PROGRAMMING -486,Codeforces Round #277 (Div. 2),2,Calculating Function,500.0,A,1415718000,"[implementation, math]",PROGRAMMING -486,Codeforces Round #277 (Div. 2),2,OR in Matrix,1000.0,B,1415718000,"[greedy, hashing, implementation]",PROGRAMMING -486,Codeforces Round #277 (Div. 2),2,Palindrome Transformation,1500.0,C,1415718000,"[greedy, implementation]",PROGRAMMING -486,Codeforces Round #277 (Div. 2),2,Valid Sets,2000.0,D,1415718000,"[dfs and similar, dp, math, trees]",PROGRAMMING -486,Codeforces Round #277 (Div. 2),2,LIS of Sequence,2500.0,E,1415718000,"[data structures, dp, greedy, hashing, math]",PROGRAMMING -487,Codeforces Round #278 (Div. 1),1,Fight the Monster,500.0,A,1416590400,"[binary search, brute force]",PROGRAMMING -487,Codeforces Round #278 (Div. 1),1,Strip,1500.0,B,1416590400,"[binary search, data structures, dp, two pointers]",PROGRAMMING -487,Codeforces Round #278 (Div. 1),1,Prefix Product Sequence,1500.0,C,1416590400,"[constructive algorithms, number theory]",PROGRAMMING -487,Codeforces Round #278 (Div. 1),1,Conveyor Belts,2000.0,D,1416590400,[data structures],PROGRAMMING -487,Codeforces Round #278 (Div. 1),1,Tourists,2500.0,E,1416590400,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING -488,Codeforces Round #278 (Div. 2),2,Giga Tower,500.0,A,1416590400,[brute force],PROGRAMMING -488,Codeforces Round #278 (Div. 2),2,Candy Boxes,1500.0,B,1416590400,"[brute force, constructive algorithms]",PROGRAMMING -488,Codeforces Round #278 (Div. 2),2,Fight the Monster,1500.0,C,1416590400,[brute force],PROGRAMMING -488,Codeforces Round #278 (Div. 2),2,Strip,2500.0,D,1416590400,"[data structures, dp, two pointers]",PROGRAMMING -488,Codeforces Round #278 (Div. 2),2,Prefix Product Sequence,2500.0,E,1416590400,"[constructive algorithms, math]",PROGRAMMING -489,Codeforces Round #277.5 (Div. 2),2,SwapSort,500.0,A,1416238500,"[implementation, sortings]",PROGRAMMING -489,Codeforces Round #277.5 (Div. 2),2,BerSU Ball,1000.0,B,1416238500,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING -489,Codeforces Round #277.5 (Div. 2),2,Given Length and Sum of Digits...,1500.0,C,1416238500,"[dp, greedy, implementation]",PROGRAMMING -489,Codeforces Round #277.5 (Div. 2),2,Unbearable Controversy of Being,2000.0,D,1416238500,"[brute force, combinatorics, dfs and similar, graphs]",PROGRAMMING -489,Codeforces Round #277.5 (Div. 2),2,Hiking,2500.0,E,1416238500,"[binary search, dp]",PROGRAMMING -489,Codeforces Round #277.5 (Div. 2),2,Special Matrices,2500.0,F,1416238500,"[combinatorics, dp]",PROGRAMMING -490,Codeforces Round #279 (Div. 2),2,Team Olympiad,500.0,A,1416733800,"[greedy, implementation, sortings]",PROGRAMMING -490,Codeforces Round #279 (Div. 2),2,Queue,1000.0,B,1416733800,"[dsu, implementation]",PROGRAMMING -490,Codeforces Round #279 (Div. 2),2,Hacking Cypher,1500.0,C,1416733800,"[brute force, math, strings]",PROGRAMMING -490,Codeforces Round #279 (Div. 2),2,Chocolate,2000.0,D,1416733800,"[brute force, dfs and similar, math, meet-in-the-middle, number theory]",PROGRAMMING -490,Codeforces Round #279 (Div. 2),2,Restoring Increasing Sequence,2000.0,E,1416733800,"[binary search, brute force, greedy, implementation]",PROGRAMMING -490,Codeforces Round #279 (Div. 2),2,Treeland Tour,2500.0,F,1416733800,"[data structures, dfs and similar, dp, trees]",PROGRAMMING -492,Codeforces Round #280 (Div. 2),2,Vanya and Cubes,500.0,A,1417451400,[implementation],PROGRAMMING -492,Codeforces Round #280 (Div. 2),2,Vanya and Lanterns,1000.0,B,1417451400,"[binary search, math, sortings]",PROGRAMMING -492,Codeforces Round #280 (Div. 2),2,Vanya and Exams,1500.0,C,1417451400,"[greedy, sortings]",PROGRAMMING -492,Codeforces Round #280 (Div. 2),2,Vanya and Computer Game,2000.0,D,1417451400,"[binary search, implementation, math, sortings]",PROGRAMMING -492,Codeforces Round #280 (Div. 2),2,Vanya and Field,2500.0,E,1417451400,[math],PROGRAMMING -493,Codeforces Round #281 (Div. 2),2,Vasya and Football,500.0,A,1417618800,[implementation],PROGRAMMING -493,Codeforces Round #281 (Div. 2),2,Vasya and Wrestling,1000.0,B,1417618800,[implementation],PROGRAMMING -493,Codeforces Round #281 (Div. 2),2,Vasya and Basketball,2000.0,C,1417618800,"[binary search, brute force, implementation, sortings, two pointers]",PROGRAMMING -493,Codeforces Round #281 (Div. 2),2,Vasya and Chess,1500.0,D,1417618800,"[constructive algorithms, games]",PROGRAMMING -493,Codeforces Round #281 (Div. 2),2,Vasya and Polynomial,3000.0,E,1417618800,[math],PROGRAMMING -494,Codeforces Round #282 (Div. 1),1,Treasure,500.0,A,1418488200,[greedy],PROGRAMMING -494,Codeforces Round #282 (Div. 1),1,Obsessive String,1000.0,B,1418488200,"[dp, strings]",PROGRAMMING -494,Codeforces Round #282 (Div. 1),1,Helping People,1750.0,C,1418488200,"[dp, probabilities]",PROGRAMMING -494,Codeforces Round #282 (Div. 1),1,Birthday,1750.0,D,1418488200,"[data structures, dfs and similar, dp, trees]",PROGRAMMING -494,Codeforces Round #282 (Div. 1),1,Sharti,2500.0,E,1418488200,[games],PROGRAMMING -495,Codeforces Round #282 (Div. 2),2,Digital Counter,500.0,A,1418488200,[implementation],PROGRAMMING -495,Codeforces Round #282 (Div. 2),2,Modular Equations,1000.0,B,1418488200,[math],PROGRAMMING -495,Codeforces Round #282 (Div. 2),2,Treasure,1500.0,C,1418488200,[implementation],PROGRAMMING -495,Codeforces Round #282 (Div. 2),2,Obsessive String,2000.0,D,1418488200,"[binary search, dp, strings]",PROGRAMMING -495,Codeforces Round #282 (Div. 2),2,Helping People,2750.0,E,1418488200,[],PROGRAMMING -496,Codeforces Round #283 (Div. 2),2,Minimum Difficulty,500.0,A,1418833800,"[brute force, implementation, math]",PROGRAMMING -496,Codeforces Round #283 (Div. 2),2,Secret Combination,1000.0,B,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING -496,Codeforces Round #283 (Div. 2),2,Removing Columns,1750.0,C,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING -496,Codeforces Round #283 (Div. 2),2,Tennis Game,2250.0,D,1418833800,[binary search],PROGRAMMING -496,Codeforces Round #283 (Div. 2),2,Distributing Parts ,2250.0,E,1418833800,"[greedy, sortings]",PROGRAMMING -497,Codeforces Round #283 (Div. 1),1,Removing Columns,750.0,A,1418833800,[greedy],PROGRAMMING -497,Codeforces Round #283 (Div. 1),1,Tennis Game,1250.0,B,1418833800,"[binary search, brute force, implementation]",PROGRAMMING -497,Codeforces Round #283 (Div. 1),1,Distributing Parts ,1250.0,C,1418833800,"[data structures, greedy, implementation, sortings, two pointers]",PROGRAMMING -497,Codeforces Round #283 (Div. 1),1,Gears,2000.0,D,1418833800,"[brute force, geometry, math]",PROGRAMMING -497,Codeforces Round #283 (Div. 1),1,Subsequences Return,2500.0,E,1418833800,"[dp, matrices]",PROGRAMMING -498,Codeforces Round #284 (Div. 1),1,Crazy Town,500.0,A,1419438600,[geometry],PROGRAMMING -498,Codeforces Round #284 (Div. 1),1,Name That Tune,2000.0,B,1419438600,"[dp, probabilities, two pointers]",PROGRAMMING -498,Codeforces Round #284 (Div. 1),1,Array and Operations,1000.0,C,1419438600,"[flows, graph matchings, number theory]",PROGRAMMING -498,Codeforces Round #284 (Div. 1),1,Traffic Jams in the Land,2000.0,D,1419438600,"[data structures, dp, number theory]",PROGRAMMING -498,Codeforces Round #284 (Div. 1),1,Stairs and Lines,2500.0,E,1419438600,"[dp, matrices]",PROGRAMMING -499,Codeforces Round #284 (Div. 2),2,Watching a movie,500.0,A,1419438600,[implementation],PROGRAMMING -499,Codeforces Round #284 (Div. 2),2,Lecture,500.0,B,1419438600,[strings],PROGRAMMING -499,Codeforces Round #284 (Div. 2),2,Crazy Town,1500.0,C,1419438600,[math],PROGRAMMING -499,Codeforces Round #284 (Div. 2),2,Name That Tune,3000.0,D,1419438600,[],PROGRAMMING -499,Codeforces Round #284 (Div. 2),2,Array and Operations,3000.0,E,1419438600,[],PROGRAMMING -500,Good Bye 2014,12,New Year Transportation,500.0,A,1419951600,"[dfs and similar, graphs, implementation]",PROGRAMMING -500,Good Bye 2014,12,New Year Permutation,1000.0,B,1419951600,"[dfs and similar, dsu, graphs, greedy, math, sortings]",PROGRAMMING -500,Good Bye 2014,12,New Year Book Reading,1000.0,C,1419951600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING -500,Good Bye 2014,12,New Year Santa Network,1500.0,D,1419951600,"[combinatorics, dfs and similar, graphs, trees]",PROGRAMMING -500,Good Bye 2014,12,New Year Domino,2750.0,E,1419951600,"[data structures, dp, dsu]",PROGRAMMING -500,Good Bye 2014,12,New Year Shopping,2750.0,F,1419951600,"[divide and conquer, dp]",PROGRAMMING -500,Good Bye 2014,12,New Year Running,3500.0,G,1419951600,"[number theory, trees]",PROGRAMMING -501,Codeforces Round #285 (Div. 2),2,Contest,500.0,A,1421053200,[implementation],PROGRAMMING -501,Codeforces Round #285 (Div. 2),2,Misha and Changing Handles,500.0,B,1421053200,"[data structures, dsu, strings]",PROGRAMMING -501,Codeforces Round #285 (Div. 2),2,Misha and Forest,1500.0,C,1421053200,"[constructive algorithms, data structures, greedy, sortings, trees]",PROGRAMMING -501,Codeforces Round #285 (Div. 2),2,Misha and Permutations Summation,3000.0,D,1421053200,[data structures],PROGRAMMING -501,Codeforces Round #285 (Div. 2),2,Misha and Palindrome Degree,3000.0,E,1421053200,"[binary search, combinatorics, implementation]",PROGRAMMING -504,Codeforces Round #285 (Div. 1),1,Misha and Forest,500.0,A,1421053200,"[constructive algorithms, data structures, graphs, greedy]",PROGRAMMING -504,Codeforces Round #285 (Div. 1),1,Misha and Permutations Summation,500.0,B,1421053200,"[binary search, data structures, math]",PROGRAMMING -504,Codeforces Round #285 (Div. 1),1,Misha and Palindrome Degree,2500.0,C,1421053200,[math],PROGRAMMING -504,Codeforces Round #285 (Div. 1),1,Misha and XOR,2500.0,D,1421053200,[bitmasks],PROGRAMMING -504,Codeforces Round #285 (Div. 1),1,Misha and LCP on Tree,3000.0,E,1421053200,"[binary search, dfs and similar, hashing, string suffix structures, trees]",PROGRAMMING -505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Gift,500.0,A,1421586000,"[brute force, implementation, strings]",PROGRAMMING -505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Colorful Graph,1000.0,B,1421586000,"[dfs and similar, dp, dsu, graphs]",PROGRAMMING -505,Codeforces Round #286 (Div. 2),2,"Mr. Kitayuta, the Treasure Hunter",1500.0,C,1421586000,"[dfs and similar, dp, two pointers]",PROGRAMMING -505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Technology,2000.0,D,1421586000,[dfs and similar],PROGRAMMING -505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta vs. Bamboos,2750.0,E,1421586000,"[binary search, greedy]",PROGRAMMING -506,Codeforces Round #286 (Div. 1),1,"Mr. Kitayuta, the Treasure Hunter",500.0,A,1421586000,[dp],PROGRAMMING -506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Technology,1000.0,B,1421586000,"[dfs and similar, graphs]",PROGRAMMING -506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta vs. Bamboos,1750.0,C,1421586000,[binary search],PROGRAMMING -506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Colorful Graph,1750.0,D,1421586000,"[brute force, dfs and similar, dsu]",PROGRAMMING -506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Gift,2500.0,E,1421586000,"[combinatorics, dp, matrices, strings]",PROGRAMMING -507,Codeforces Round #287 (Div. 2),2,Amr and Music,500.0,A,1422028800,"[greedy, implementation, sortings]",PROGRAMMING -507,Codeforces Round #287 (Div. 2),2,Amr and Pins,1000.0,B,1422028800,"[geometry, math]",PROGRAMMING -507,Codeforces Round #287 (Div. 2),2,Guess Your Way Out!,1500.0,C,1422028800,"[implementation, math]",PROGRAMMING -507,Codeforces Round #287 (Div. 2),2,The Maths Lecture,2000.0,D,1422028800,"[dp, implementation]",PROGRAMMING -507,Codeforces Round #287 (Div. 2),2,Breaking Good,2500.0,E,1422028800,"[dfs and similar, dp, graphs, shortest paths]",PROGRAMMING -508,Codeforces Round #288 (Div. 2),2,Pasha and Pixels,500.0,A,1422376200,[brute force],PROGRAMMING -508,Codeforces Round #288 (Div. 2),2,Anton and currency you all know,1000.0,B,1422376200,[greedy],PROGRAMMING -508,Codeforces Round #288 (Div. 2),2,Anya and Ghosts,1500.0,C,1422376200,[greedy],PROGRAMMING -508,Codeforces Round #288 (Div. 2),2,Tanya and Password,2000.0,D,1422376200,"[dfs and similar, graphs]",PROGRAMMING -508,Codeforces Round #288 (Div. 2),2,Arthur and Brackets,2500.0,E,1422376200,"[dp, greedy]",PROGRAMMING -509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Maximum in Table,,A,1422705600,"[brute force, implementation]",PROGRAMMING -509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Painting Pebbles,,B,1422705600,"[constructive algorithms, greedy, implementation]",PROGRAMMING -509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Sums of Digits,,C,1422705600,"[dp, greedy, implementation]",PROGRAMMING -509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Restoring Numbers,,D,1422705600,"[constructive algorithms, math]",PROGRAMMING -509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Pretty Song,,E,1422705600,"[math, strings]",PROGRAMMING -509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Progress Monitoring,,F,1422705600,[dp],PROGRAMMING -510,Codeforces Round #290 (Div. 2),2,Fox And Snake,500.0,A,1422894600,[implementation],PROGRAMMING -510,Codeforces Round #290 (Div. 2),2,Fox And Two Dots,1000.0,B,1422894600,[dfs and similar],PROGRAMMING -510,Codeforces Round #290 (Div. 2),2,Fox And Names,1500.0,C,1422894600,"[dfs and similar, graphs, sortings]",PROGRAMMING -510,Codeforces Round #290 (Div. 2),2,Fox And Jumping,2000.0,D,1422894600,"[bitmasks, brute force, dp, math]",PROGRAMMING -510,Codeforces Round #290 (Div. 2),2,Fox And Dinner,2500.0,E,1422894600,[flows],PROGRAMMING -512,Codeforces Round #290 (Div. 1),1,Fox And Names,500.0,A,1422894600,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING -512,Codeforces Round #290 (Div. 1),1,Fox And Jumping,1000.0,B,1422894600,"[data structures, dp, math, number theory, shortest paths]",PROGRAMMING -512,Codeforces Round #290 (Div. 1),1,Fox And Dinner,1500.0,C,1422894600,"[flows, graph matchings]",PROGRAMMING -512,Codeforces Round #290 (Div. 1),1,Fox And Travelling,2250.0,D,1422894600,"[dp, trees]",PROGRAMMING -512,Codeforces Round #290 (Div. 1),1,Fox And Polygon,2250.0,E,1422894600,"[constructive algorithms, divide and conquer]",PROGRAMMING -513,Rockethon 2015,12,Game,3.0,A,1423328400,"[constructive algorithms, math]",PROGRAMMING -513,Rockethon 2015,12,Permutations,3.0,B1,1423328400,[brute force],PROGRAMMING -513,Rockethon 2015,12,Permutations,4.0,B2,1423328400,"[bitmasks, divide and conquer, math]",PROGRAMMING -513,Rockethon 2015,12,Second price auction,8.0,C,1423328400,"[bitmasks, probabilities]",PROGRAMMING -513,Rockethon 2015,12,Constrained Tree,9.0,D1,1423328400,[dfs and similar],PROGRAMMING -513,Rockethon 2015,12,Constrained Tree,8.0,D2,1423328400,"[constructive algorithms, data structures]",PROGRAMMING -513,Rockethon 2015,12,Subarray Cuts,9.0,E1,1423328400,[dp],PROGRAMMING -513,Rockethon 2015,12,Subarray Cuts,12.0,E2,1423328400,[dp],PROGRAMMING -513,Rockethon 2015,12,Scaygerboss,14.0,F1,1423328400,[flows],PROGRAMMING -513,Rockethon 2015,12,Scaygerboss,6.0,F2,1423328400,[flows],PROGRAMMING -513,Rockethon 2015,12,Inversions problem,3.0,G1,1423328400,"[brute force, dfs and similar, dp, meet-in-the-middle]",PROGRAMMING -513,Rockethon 2015,12,Inversions problem,5.0,G2,1423328400,"[dp, probabilities]",PROGRAMMING -513,Rockethon 2015,12,Inversions problem,16.0,G3,1423328400,[dp],PROGRAMMING -514,Codeforces Round #291 (Div. 2),2,Chewbaсca and Number,500.0,A,1423931400,"[greedy, implementation]",PROGRAMMING -514,Codeforces Round #291 (Div. 2),2,Han Solo and Lazer Gun,1000.0,B,1423931400,"[brute force, data structures, geometry, math]",PROGRAMMING -514,Codeforces Round #291 (Div. 2),2,Watto and Mechanism,2000.0,C,1423931400,"[binary search, hashing, string suffix structures, strings]",PROGRAMMING -514,Codeforces Round #291 (Div. 2),2,R2D2 and Droid Army,2000.0,D,1423931400,"[binary search, data structures, two pointers]",PROGRAMMING -514,Codeforces Round #291 (Div. 2),2,Darth Vader and Tree,2500.0,E,1423931400,"[dp, matrices]",PROGRAMMING -515,Codeforces Round #292 (Div. 2),2,Drazil and Date,500.0,A,1424190900,[math],PROGRAMMING -515,Codeforces Round #292 (Div. 2),2,Drazil and His Happy Friends,1000.0,B,1424190900,"[brute force, dsu, meet-in-the-middle, number theory]",PROGRAMMING -515,Codeforces Round #292 (Div. 2),2,Drazil and Factorial,1000.0,C,1424190900,"[greedy, math, sortings]",PROGRAMMING -515,Codeforces Round #292 (Div. 2),2,Drazil and Tiles,3000.0,D,1424190900,"[constructive algorithms, greedy]",PROGRAMMING -515,Codeforces Round #292 (Div. 2),2,Drazil and Park,3000.0,E,1424190900,[data structures],PROGRAMMING -516,Codeforces Round #292 (Div. 1),1,Drazil and Factorial,500.0,A,1424190900,"[dp, greedy, implementation, math]",PROGRAMMING -516,Codeforces Round #292 (Div. 1),1,Drazil and Tiles,1000.0,B,1424190900,"[data structures, graph matchings, greedy, implementation]",PROGRAMMING -516,Codeforces Round #292 (Div. 1),1,Drazil and Park,1500.0,C,1424190900,[data structures],PROGRAMMING -516,Codeforces Round #292 (Div. 1),1,Drazil and Morning Exercise,3000.0,D,1424190900,"[dfs and similar, dp, dsu, trees, two pointers]",PROGRAMMING -516,Codeforces Round #292 (Div. 1),1,Drazil and His Happy Friends,3000.0,E,1424190900,"[math, number theory]",PROGRAMMING -518,Codeforces Round #293 (Div. 2),2,Vitaly and Strings,500.0,A,1424795400,[strings],PROGRAMMING -518,Codeforces Round #293 (Div. 2),2,Tanya and Postcard,1000.0,B,1424795400,"[implementation, strings]",PROGRAMMING -518,Codeforces Round #293 (Div. 2),2,Anya and Smartphone,1500.0,C,1424795400,"[data structures, implementation]",PROGRAMMING -518,Codeforces Round #293 (Div. 2),2,Ilya and Escalator,2000.0,D,1424795400,"[combinatorics, dp, probabilities]",PROGRAMMING -518,Codeforces Round #293 (Div. 2),2,Arthur and Questions,2500.0,E,1424795400,"[greedy, implementation, ternary search]",PROGRAMMING -518,Codeforces Round #293 (Div. 2),2,Pasha and Pipe,2500.0,F,1424795400,"[binary search, brute force, combinatorics, dp, implementation]",PROGRAMMING -519,Codeforces Round #294 (Div. 2),2,A and B and Chess,500.0,A,1425128400,[implementation],PROGRAMMING -519,Codeforces Round #294 (Div. 2),2,A and B and Compilation Errors,1000.0,B,1425128400,"[data structures, implementation]",PROGRAMMING -519,Codeforces Round #294 (Div. 2),2,A and B and Team Training,1500.0,C,1425128400,"[greedy, implementation, math, number theory]",PROGRAMMING -519,Codeforces Round #294 (Div. 2),2,A and B and Interesting Substrings,2000.0,D,1425128400,"[data structures, dp, two pointers]",PROGRAMMING -519,Codeforces Round #294 (Div. 2),2,A and B and Lecture Rooms,2500.0,E,1425128400,"[binary search, data structures, dfs and similar, dp, trees]",PROGRAMMING -520,Codeforces Round #295 (Div. 2),2,Pangram,500.0,A,1425279600,"[implementation, strings]",PROGRAMMING -520,Codeforces Round #295 (Div. 2),2,Two Buttons,1000.0,B,1425279600,"[dfs and similar, graphs, greedy, implementation, math, shortest paths]",PROGRAMMING -520,Codeforces Round #295 (Div. 2),2,DNA Alignment,1500.0,C,1425279600,"[math, strings]",PROGRAMMING -520,Codeforces Round #295 (Div. 2),2,Cubes,2000.0,D,1425279600,"[games, greedy, implementation]",PROGRAMMING -520,Codeforces Round #295 (Div. 2),2,Pluses everywhere,2500.0,E,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING -521,Codeforces Round #295 (Div. 1),1,DNA Alignment,500.0,A,1425279600,"[greedy, math]",PROGRAMMING -521,Codeforces Round #295 (Div. 1),1,Cubes,1000.0,B,1425279600,"[data structures, greedy, implementation]",PROGRAMMING -521,Codeforces Round #295 (Div. 1),1,Pluses everywhere,1500.0,C,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING -521,Codeforces Round #295 (Div. 1),1,Shop,2000.0,D,1425279600,[greedy],PROGRAMMING -521,Codeforces Round #295 (Div. 1),1,Cycling City,2500.0,E,1425279600,"[dfs and similar, graphs]",PROGRAMMING -525,Codeforces Round #297 (Div. 2),2,Vitaliy and Pie,250.0,A,1427387400,"[greedy, hashing]",PROGRAMMING -525,Codeforces Round #297 (Div. 2),2,Pasha and String,750.0,B,1427387400,[greedy],PROGRAMMING -525,Codeforces Round #297 (Div. 2),2,Ilya and Sticks,1000.0,C,1427387400,"[greedy, sortings]",PROGRAMMING -525,Codeforces Round #297 (Div. 2),2,Arthur and Walls,3000.0,D,1427387400,"[data structures, greedy]",PROGRAMMING -525,Codeforces Round #297 (Div. 2),2,Anya and Cubes,3000.0,E,1427387400,"[binary search, bitmasks, brute force, dp, meet-in-the-middle]",PROGRAMMING -526,ZeptoLab Code Rush 2015,12,King of Thieves,500.0,A,1428165300,"[brute force, implementation]",PROGRAMMING -526,ZeptoLab Code Rush 2015,12,Om Nom and Dark Park,500.0,B,1428165300,"[dfs and similar, greedy, implementation]",PROGRAMMING -526,ZeptoLab Code Rush 2015,12,Om Nom and Candies,1250.0,C,1428165300,"[brute force, greedy, math]",PROGRAMMING -526,ZeptoLab Code Rush 2015,12,Om Nom and Necklace,1750.0,D,1428165300,"[hashing, string suffix structures, strings]",PROGRAMMING -526,ZeptoLab Code Rush 2015,12,Transmitting Levels,2250.0,E,1428165300,"[dp, implementation]",PROGRAMMING -526,ZeptoLab Code Rush 2015,12,Pudding Monsters,3000.0,F,1428165300,"[data structures, divide and conquer]",PROGRAMMING -526,ZeptoLab Code Rush 2015,12,Spiders Evil Plan,3000.0,G,1428165300,"[greedy, trees]",PROGRAMMING -527,Codeforces Round #296 (Div. 2),2,Playing with Paper,500.0,A,1426610700,"[implementation, math]",PROGRAMMING -527,Codeforces Round #296 (Div. 2),2,Error Correct System,1000.0,B,1426610700,[greedy],PROGRAMMING -527,Codeforces Round #296 (Div. 2),2,Glass Carving,1500.0,C,1426610700,"[binary search, data structures, implementation]",PROGRAMMING -527,Codeforces Round #296 (Div. 2),2,Clique Problem,2000.0,D,1426610700,"[data structures, dp, greedy, implementation, sortings]",PROGRAMMING -527,Codeforces Round #296 (Div. 2),2,Data Center Drama,2500.0,E,1426610700,"[dfs and similar, graphs]",PROGRAMMING -528,Codeforces Round #296 (Div. 1),1,Glass Carving,500.0,A,1426610700,"[data structures, implementation]",PROGRAMMING -528,Codeforces Round #296 (Div. 1),1,Clique Problem,1000.0,B,1426610700,"[dp, greedy]",PROGRAMMING -528,Codeforces Round #296 (Div. 1),1,Data Center Drama,1500.0,C,1426610700,"[constructive algorithms, graphs]",PROGRAMMING -528,Codeforces Round #296 (Div. 1),1,Fuzzy Search,2000.0,D,1426610700,"[bitmasks, brute force, fft]",PROGRAMMING -528,Codeforces Round #296 (Div. 1),1,Triangles 3000,2500.0,E,1426610700,"[geometry, sortings]",PROGRAMMING -529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,And Yet Another Bracket Sequence,2500.0,A,1426956300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING -529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Group Photo 2 (online mirror version),500.0,B,1426956300,"[brute force, greedy, sortings]",PROGRAMMING -529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Rooks and Rectangles,1500.0,C,1426956300,[data structures],PROGRAMMING -529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Social Network,1250.0,D,1426956300,"[data structures, greedy]",PROGRAMMING -529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,The Art of Dealing with ATM,500.0,E,1426956300,[brute force],PROGRAMMING -533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Berland Miners,3000.0,A,1429286400,"[binary search, data structures, dfs and similar, greedy, trees]",PROGRAMMING -533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Work Group,750.0,B,1429286400,"[dfs and similar, dp, graphs, strings, trees]",PROGRAMMING -533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Board Game,250.0,C,1429286400,"[games, greedy, implementation, math]",PROGRAMMING -533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Landmarks,3000.0,D,1429286400,[data structures],PROGRAMMING -533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Correcting Mistakes,500.0,E,1429286400,"[constructive algorithms, dp, greedy, hashing, strings, two pointers]",PROGRAMMING -533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Encoding,1500.0,F,1429286400,"[hashing, string suffix structures, strings]",PROGRAMMING -534,Codeforces Round #298 (Div. 2),2,Exam,500.0,A,1428854400,"[constructive algorithms, implementation]",PROGRAMMING -534,Codeforces Round #298 (Div. 2),2,Covered Path,1000.0,B,1428854400,"[dp, greedy, math]",PROGRAMMING -534,Codeforces Round #298 (Div. 2),2,Polycarpus' Dice,1500.0,C,1428854400,[math],PROGRAMMING -534,Codeforces Round #298 (Div. 2),2,Handshakes,2000.0,D,1428854400,"[binary search, constructive algorithms, data structures, greedy]",PROGRAMMING -534,Codeforces Round #298 (Div. 2),2,Berland Local Positioning System,2500.0,E,1428854400,"[constructive algorithms, greedy, hashing, implementation]",PROGRAMMING -534,Codeforces Round #298 (Div. 2),2,Simplified Nonogram,3000.0,F,1428854400,"[bitmasks, dp, hashing, meet-in-the-middle]",PROGRAMMING -535,Codeforces Round #299 (Div. 2),2,Tavas and Nafas,500.0,A,1429029300,[implementation],PROGRAMMING -535,Codeforces Round #299 (Div. 2),2,Tavas and SaDDas,1000.0,B,1429029300,"[bitmasks, brute force, implementation]",PROGRAMMING -535,Codeforces Round #299 (Div. 2),2,Tavas and Karafs,1500.0,C,1429029300,"[binary search, math]",PROGRAMMING -535,Codeforces Round #299 (Div. 2),2,Tavas and Malekas,2000.0,D,1429029300,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING -535,Codeforces Round #299 (Div. 2),2,Tavas and Pashmaks,2500.0,E,1429029300,[geometry],PROGRAMMING -536,Codeforces Round #299 (Div. 1),1,Tavas and Karafs,500.0,A,1429029300,"[binary search, math]",PROGRAMMING -536,Codeforces Round #299 (Div. 1),1,Tavas and Malekas,1000.0,B,1429029300,"[hashing, string suffix structures, strings]",PROGRAMMING -536,Codeforces Round #299 (Div. 1),1,Tavas and Pashmaks,1500.0,C,1429029300,[geometry],PROGRAMMING -536,Codeforces Round #299 (Div. 1),1,Tavas in Kansas,2000.0,D,1429029300,"[dp, games]",PROGRAMMING -536,Codeforces Round #299 (Div. 1),1,Tavas on the Path,2500.0,E,1429029300,"[data structures, divide and conquer, trees]",PROGRAMMING -538,Codeforces Round #300,12,Cutting Banner,500.0,A,1430064000,"[brute force, implementation]",PROGRAMMING -538,Codeforces Round #300,12,Quasi Binary,1000.0,B,1430064000,"[constructive algorithms, dp, greedy, implementation]",PROGRAMMING -538,Codeforces Round #300,12,Tourist's Notes,1500.0,C,1430064000,"[binary search, brute force, greedy, implementation, math]",PROGRAMMING -538,Codeforces Round #300,12,Weird Chess,1500.0,D,1430064000,"[brute force, constructive algorithms, implementation]",PROGRAMMING -538,Codeforces Round #300,12,Demiurges Play Again,2000.0,E,1430064000,"[dfs and similar, dp, math, trees]",PROGRAMMING -538,Codeforces Round #300,12,A Heap of Heaps,2500.0,F,1430064000,"[brute force, data structures, math, sortings]",PROGRAMMING -538,Codeforces Round #300,12,Berserk Robot ,3000.0,G,1430064000,"[constructive algorithms, math, sortings]",PROGRAMMING -538,Codeforces Round #300,12,Summer Dichotomy,3000.0,H,1430064000,"[2-sat, data structures, dfs and similar, greedy]",PROGRAMMING -540,Codeforces Round #301 (Div. 2),2,Combination Lock,500.0,A,1430411400,[implementation],PROGRAMMING -540,Codeforces Round #301 (Div. 2),2,School Marks,1000.0,B,1430411400,"[greedy, implementation]",PROGRAMMING -540,Codeforces Round #301 (Div. 2),2,Ice Cave,1500.0,C,1430411400,[dfs and similar],PROGRAMMING -540,Codeforces Round #301 (Div. 2),2,Bad Luck Island,2000.0,D,1430411400,"[dp, probabilities]",PROGRAMMING -540,Codeforces Round #301 (Div. 2),2,Infinite Inversions,2500.0,E,1430411400,"[binary search, data structures, implementation, sortings, trees]",PROGRAMMING -542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Place Your Ad Here,2000.0,A,1430668800,"[data structures, sortings]",PROGRAMMING -542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Duck Hunt,3000.0,B,1430668800,[data structures],PROGRAMMING -542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Idempotent functions,750.0,C,1430668800,"[constructive algorithms, graphs, math]",PROGRAMMING -542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Superhero's Job,2250.0,D,1430668800,"[dfs and similar, dp, hashing, math, number theory]",PROGRAMMING -542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Playing on Graph,2250.0,E,1430668800,"[graphs, shortest paths]",PROGRAMMING -542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Quest,1000.0,F,1430668800,"[dp, greedy]",PROGRAMMING -543,Codeforces Round #302 (Div. 1),1,Writing Code,500.0,A,1431016200,[dp],PROGRAMMING -543,Codeforces Round #302 (Div. 1),1,Destroying Roads,1000.0,B,1431016200,"[graphs, shortest paths]",PROGRAMMING -543,Codeforces Round #302 (Div. 1),1,Remembering Strings,1750.0,C,1431016200,"[bitmasks, dp]",PROGRAMMING -543,Codeforces Round #302 (Div. 1),1,Road Improvement,1750.0,D,1431016200,"[dp, trees]",PROGRAMMING -543,Codeforces Round #302 (Div. 1),1,Listening to Music,2500.0,E,1431016200,"[constructive algorithms, data structures]",PROGRAMMING -544,Codeforces Round #302 (Div. 2),2,Set of Strings,500.0,A,1431016200,[implementation],PROGRAMMING -544,Codeforces Round #302 (Div. 2),2,Sea and Islands,1000.0,B,1431016200,"[constructive algorithms, implementation]",PROGRAMMING -544,Codeforces Round #302 (Div. 2),2,Writing Code,1500.0,C,1431016200,[dp],PROGRAMMING -544,Codeforces Round #302 (Div. 2),2,Destroying Roads,2000.0,D,1431016200,"[brute force, graphs, shortest paths]",PROGRAMMING -544,Codeforces Round #302 (Div. 2),2,Remembering Strings,2750.0,E,1431016200,"[bitmasks, dp]",PROGRAMMING -545,Codeforces Round #303 (Div. 2),2,Toy Cars,500.0,A,1432053000,[implementation],PROGRAMMING -545,Codeforces Round #303 (Div. 2),2,Equidistant String,1000.0,B,1432053000,[greedy],PROGRAMMING -545,Codeforces Round #303 (Div. 2),2,Woodcutters,1750.0,C,1432053000,"[dp, greedy]",PROGRAMMING -545,Codeforces Round #303 (Div. 2),2,Queue,1750.0,D,1432053000,"[greedy, implementation, sortings]",PROGRAMMING -545,Codeforces Round #303 (Div. 2),2,Paths and Trees,2500.0,E,1432053000,"[graphs, greedy, shortest paths]",PROGRAMMING -546,Codeforces Round #304 (Div. 2),2,Soldier and Bananas,500.0,A,1432312200,"[implementation, math]",PROGRAMMING -546,Codeforces Round #304 (Div. 2),2,Soldier and Badges,1000.0,B,1432312200,"[brute force, greedy, implementation, sortings]",PROGRAMMING -546,Codeforces Round #304 (Div. 2),2,Soldier and Cards,1250.0,C,1432312200,"[brute force, dfs and similar]",PROGRAMMING -546,Codeforces Round #304 (Div. 2),2,Soldier and Number Game,1500.0,D,1432312200,"[constructive algorithms, dp, math, number theory]",PROGRAMMING -546,Codeforces Round #304 (Div. 2),2,Soldier and Traveling,2250.0,E,1432312200,"[flows, math]",PROGRAMMING -547,Codeforces Round #305 (Div. 1),1,Mike and Frog,750.0,A,1432658100,"[brute force, implementation, math]",PROGRAMMING -547,Codeforces Round #305 (Div. 1),1,Mike and Feet,1000.0,B,1432658100,"[binary search, data structures, dp, dsu]",PROGRAMMING -547,Codeforces Round #305 (Div. 1),1,Mike and Foam,1750.0,C,1432658100,"[bitmasks, number theory]",PROGRAMMING -547,Codeforces Round #305 (Div. 1),1,Mike and Fish,1750.0,D,1432658100,"[dfs and similar, graphs]",PROGRAMMING -547,Codeforces Round #305 (Div. 1),1,Mike and Friends,2500.0,E,1432658100,"[data structures, string suffix structures, strings]",PROGRAMMING -548,Codeforces Round #305 (Div. 2),2,Mike and Fax,500.0,A,1432658100,"[brute force, implementation]",PROGRAMMING -548,Codeforces Round #305 (Div. 2),2,Mike and Fun,1000.0,B,1432658100,"[brute force, greedy, implementation]",PROGRAMMING -548,Codeforces Round #305 (Div. 2),2,Mike and Frog,1750.0,C,1432658100,[number theory],PROGRAMMING -548,Codeforces Round #305 (Div. 2),2,Mike and Feet,2000.0,D,1432658100,"[binary search, data structures]",PROGRAMMING -548,Codeforces Round #305 (Div. 2),2,Mike and Foam,2750.0,E,1432658100,[number theory],PROGRAMMING -549,Looksery Cup 2015,12,Face Detection,250.0,A,1433595600,[implementation],PROGRAMMING -549,Looksery Cup 2015,12,Looksery Party,1750.0,B,1433595600,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING -549,Looksery Cup 2015,12,The Game Of Parity,2000.0,C,1433595600,[games],PROGRAMMING -549,Looksery Cup 2015,12,Haar Features,1000.0,D,1433595600,"[greedy, implementation]",PROGRAMMING -549,Looksery Cup 2015,12,Sasha Circle,3000.0,E,1433595600,[math],PROGRAMMING -549,Looksery Cup 2015,12,Yura and Developers,3000.0,F,1433595600,"[data structures, divide and conquer]",PROGRAMMING -549,Looksery Cup 2015,12,Happy Line,1500.0,G,1433595600,"[greedy, sortings]",PROGRAMMING -549,Looksery Cup 2015,12,Degenerate Matrix,1500.0,H,1433595600,"[binary search, math]",PROGRAMMING -550,Codeforces Round #306 (Div. 2),2,Two Substrings,1000.0,A,1433435400,"[brute force, dp, implementation, strings]",PROGRAMMING -550,Codeforces Round #306 (Div. 2),2,Preparing Olympiad,750.0,B,1433435400,"[bitmasks, brute force]",PROGRAMMING -550,Codeforces Round #306 (Div. 2),2,Divisibility by Eight,1000.0,C,1433435400,"[brute force, dp, math]",PROGRAMMING -550,Codeforces Round #306 (Div. 2),2,Regular Bridge,2000.0,D,1433435400,"[constructive algorithms, graphs, implementation]",PROGRAMMING -550,Codeforces Round #306 (Div. 2),2,Brackets in Implications,3000.0,E,1433435400,"[constructive algorithms, greedy, implementation]",PROGRAMMING -551,Codeforces Round #307 (Div. 2),2,GukiZ and Contest,500.0,A,1434127500,"[implementation, sortings]",PROGRAMMING -551,Codeforces Round #307 (Div. 2),2,ZgukistringZ,1250.0,B,1434127500,"[brute force, constructive algorithms, implementation, strings]",PROGRAMMING -551,Codeforces Round #307 (Div. 2),2,GukiZ hates Boxes,1750.0,C,1434127500,"[binary search, greedy]",PROGRAMMING -551,Codeforces Round #307 (Div. 2),2,GukiZ and Binary Operations,2000.0,D,1434127500,"[combinatorics, math, matrices, number theory]",PROGRAMMING -551,Codeforces Round #307 (Div. 2),2,GukiZ and GukiZiana,2500.0,E,1434127500,"[binary search, data structures]",PROGRAMMING -552,Codeforces Round #308 (Div. 2),2,Vanya and Table,500.0,A,1434645000,"[implementation, math]",PROGRAMMING -552,Codeforces Round #308 (Div. 2),2,Vanya and Books,1000.0,B,1434645000,"[implementation, math]",PROGRAMMING -552,Codeforces Round #308 (Div. 2),2,Vanya and Scales,1500.0,C,1434645000,"[brute force, dp, greedy, math, meet-in-the-middle]",PROGRAMMING -552,Codeforces Round #308 (Div. 2),2,Vanya and Triangles,2000.0,D,1434645000,"[brute force, combinatorics, data structures, geometry, math, sortings]",PROGRAMMING -552,Codeforces Round #308 (Div. 2),2,Vanya and Brackets,2500.0,E,1434645000,"[brute force, dp, expression parsing, greedy, implementation]",PROGRAMMING -553,Codeforces Round #309 (Div. 1),1,Kyoya and Colored Balls,250.0,A,1435163400,"[combinatorics, dp, math]",PROGRAMMING -553,Codeforces Round #309 (Div. 1),1,Kyoya and Permutation,500.0,B,1435163400,"[binary search, combinatorics, constructive algorithms, implementation, math]",PROGRAMMING -553,Codeforces Round #309 (Div. 1),1,Love Triangles,1000.0,C,1435163400,"[dfs and similar, dsu, graphs]",PROGRAMMING -553,Codeforces Round #309 (Div. 1),1,Nudist Beach,1500.0,D,1435163400,"[binary search, graphs, greedy]",PROGRAMMING -553,Codeforces Round #309 (Div. 1),1,Kyoya and Train,3000.0,E,1435163400,"[dp, fft, probabilities]",PROGRAMMING -554,Codeforces Round #309 (Div. 2),2,Kyoya and Photobooks,250.0,A,1435163400,"[brute force, math]",PROGRAMMING -554,Codeforces Round #309 (Div. 2),2,Ohana Cleans Up,500.0,B,1435163400,"[brute force, strings]",PROGRAMMING -554,Codeforces Round #309 (Div. 2),2,Kyoya and Colored Balls,1500.0,C,1435163400,"[combinatorics, dp, math]",PROGRAMMING -554,Codeforces Round #309 (Div. 2),2,Kyoya and Permutation,3000.0,D,1435163400,[math],PROGRAMMING -554,Codeforces Round #309 (Div. 2),2,Love Triangles,3000.0,E,1435163400,"[dfs and similar, dsu]",PROGRAMMING -555,Codeforces Round #310 (Div. 1),1,Case of Matryoshkas,250.0,A,1435414200,[implementation],PROGRAMMING -555,Codeforces Round #310 (Div. 1),1,Case of Fugitive,750.0,B,1435414200,"[data structures, greedy, sortings]",PROGRAMMING -555,Codeforces Round #310 (Div. 1),1,Case of Chocolate,1250.0,C,1435414200,[data structures],PROGRAMMING -555,Codeforces Round #310 (Div. 1),1,Case of a Top Secret,2000.0,D,1435414200,"[binary search, implementation, math]",PROGRAMMING -555,Codeforces Round #310 (Div. 1),1,Case of Computer Network,3000.0,E,1435414200,"[dfs and similar, graphs, trees]",PROGRAMMING -556,Codeforces Round #310 (Div. 2),2,Case of the Zeros and Ones,250.0,A,1435414200,[greedy],PROGRAMMING -556,Codeforces Round #310 (Div. 2),2,Case of Fake Numbers,250.0,B,1435414200,"[brute force, implementation]",PROGRAMMING -556,Codeforces Round #310 (Div. 2),2,Case of Matryoshkas,1000.0,C,1435414200,[implementation],PROGRAMMING -556,Codeforces Round #310 (Div. 2),2,Case of Fugitive,3000.0,D,1435414200,"[binary search, data structures, greedy]",PROGRAMMING -556,Codeforces Round #310 (Div. 2),2,Case of Chocolate,3000.0,E,1435414200,"[binary search, data structures]",PROGRAMMING -557,Codeforces Round #311 (Div. 2),2,Ilya and Diplomas,500.0,A,1435676400,"[greedy, implementation]",PROGRAMMING -557,Codeforces Round #311 (Div. 2),2,Pasha and Tea,1000.0,B,1435676400,"[implementation, sortings]",PROGRAMMING -557,Codeforces Round #311 (Div. 2),2,Arthur and Table,1500.0,C,1435676400,"[brute force, data structures, dp, greedy]",PROGRAMMING -557,Codeforces Round #311 (Div. 2),2,Vitaly and Cycle,2000.0,D,1435676400,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING -557,Codeforces Round #311 (Div. 2),2,Ann and Half-Palindrome,2500.0,E,1435676400,"[data structures, dp, string suffix structures, strings, trees]",PROGRAMMING -558,Codeforces Round #312 (Div. 2),2,Lala Land and Apple Trees,500.0,A,1436886600,"[brute force, implementation, sortings]",PROGRAMMING -558,Codeforces Round #312 (Div. 2),2,Amr and The Large Array,1000.0,B,1436886600,[implementation],PROGRAMMING -558,Codeforces Round #312 (Div. 2),2,Amr and Chemistry,1500.0,C,1436886600,"[brute force, greedy]",PROGRAMMING -558,Codeforces Round #312 (Div. 2),2,Guess Your Way Out! II,2250.0,D,1436886600,"[data structures, implementation, sortings]",PROGRAMMING -558,Codeforces Round #312 (Div. 2),2,A Simple Task,2500.0,E,1436886600,"[data structures, sortings, strings]",PROGRAMMING -559,Codeforces Round #313 (Div. 1),1,Gerald's Hexagon,500.0,A,1437573600,"[brute force, geometry, math]",PROGRAMMING -559,Codeforces Round #313 (Div. 1),1,Equivalent Strings,1000.0,B,1437573600,"[divide and conquer, hashing, sortings, strings]",PROGRAMMING -559,Codeforces Round #313 (Div. 1),1,Gerald and Giant Chess,1500.0,C,1437573600,"[combinatorics, dp, math, number theory]",PROGRAMMING -559,Codeforces Round #313 (Div. 1),1,Randomizer,2250.0,D,1437573600,"[combinatorics, geometry, probabilities]",PROGRAMMING -559,Codeforces Round #313 (Div. 1),1,Gerald and Path,2250.0,E,1437573600,"[dp, sortings]",PROGRAMMING -560,Codeforces Round #313 (Div. 2),2,Currency System in Geraldion,500.0,A,1437573600,"[geometry, implementation, sortings]",PROGRAMMING -560,Codeforces Round #313 (Div. 2),2,Gerald is into Art,1000.0,B,1437573600,"[constructive algorithms, implementation]",PROGRAMMING -560,Codeforces Round #313 (Div. 2),2,Gerald's Hexagon,1500.0,C,1437573600,[geometry],PROGRAMMING -560,Codeforces Round #313 (Div. 2),2,Equivalent Strings,2000.0,D,1437573600,"[hashing, implementation, strings]",PROGRAMMING -560,Codeforces Round #313 (Div. 2),2,Gerald and Giant Chess,2500.0,E,1437573600,"[combinatorics, dp]",PROGRAMMING -567,Codeforces Round #Pi (Div. 2),2,Lineland Mail,500.0,A,1438790400,[implementation],PROGRAMMING -567,Codeforces Round #Pi (Div. 2),2,Berland National Library,1000.0,B,1438790400,[implementation],PROGRAMMING -567,Codeforces Round #Pi (Div. 2),2,Geometric Progression,1500.0,C,1438790400,"[binary search, data structures, dp]",PROGRAMMING -567,Codeforces Round #Pi (Div. 2),2,One-Dimensional Battle Ships,2000.0,D,1438790400,"[binary search, data structures, sortings]",PROGRAMMING -567,Codeforces Round #Pi (Div. 2),2,President and Roads,2500.0,E,1438790400,"[dfs and similar, graphs, hashing, shortest paths]",PROGRAMMING -567,Codeforces Round #Pi (Div. 2),2,Mausoleum,2500.0,F,1438790400,[dp],PROGRAMMING -568,Codeforces Round #315 (Div. 1),1,Primes or Palindromes?,500.0,A,1439224200,"[brute force, implementation, math, number theory]",PROGRAMMING -568,Codeforces Round #315 (Div. 1),1,Symmetric and Transitive,1000.0,B,1439224200,"[combinatorics, dp, math]",PROGRAMMING -568,Codeforces Round #315 (Div. 1),1,New Language,1500.0,C,1439224200,"[2-sat, greedy]",PROGRAMMING -568,Codeforces Round #315 (Div. 1),1,Sign Posts,2250.0,D,1439224200,"[brute force, math]",PROGRAMMING -568,Codeforces Round #315 (Div. 1),1,Longest Increasing Subsequence,2500.0,E,1439224200,"[data structures, dp]",PROGRAMMING -569,Codeforces Round #315 (Div. 2),2,Music,500.0,A,1439224200,"[implementation, math]",PROGRAMMING -569,Codeforces Round #315 (Div. 2),2,Inventory,1000.0,B,1439224200,[greedy],PROGRAMMING -569,Codeforces Round #315 (Div. 2),2,Primes or Palindromes?,1500.0,C,1439224200,"[binary search, brute force, number theory]",PROGRAMMING -569,Codeforces Round #315 (Div. 2),2,Symmetric and Transitive,2250.0,D,1439224200,"[brute force, dp, math]",PROGRAMMING -569,Codeforces Round #315 (Div. 2),2,New Language,2750.0,E,1439224200,[],PROGRAMMING -570,Codeforces Round #316 (Div. 2),2,Elections,500.0,A,1439483400,[implementation],PROGRAMMING -570,Codeforces Round #316 (Div. 2),2,Simple Game,1000.0,B,1439483400,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING -570,Codeforces Round #316 (Div. 2),2,Replacement,1500.0,C,1439483400,"[constructive algorithms, data structures, implementation]",PROGRAMMING -570,Codeforces Round #316 (Div. 2),2,Tree Requests,2000.0,D,1439483400,"[binary search, constructive algorithms, dfs and similar, trees]",PROGRAMMING -570,Codeforces Round #316 (Div. 2),2,Pig and Palindromes,2500.0,E,1439483400,"[combinatorics, dp]",PROGRAMMING -571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Lengthening Sticks,750.0,A,1440261000,"[combinatorics, implementation, math]",PROGRAMMING -571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Minimization,1250.0,B,1440261000,"[dp, greedy, sortings]",PROGRAMMING -571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,CNF 2,1500.0,C,1440261000,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING -571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Campus,2000.0,D,1440261000,"[binary search, data structures, dsu, trees]",PROGRAMMING -571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Geometric Progressions,2750.0,E,1440261000,[math],PROGRAMMING -572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Arrays,500.0,A,1440261000,[sortings],PROGRAMMING -572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Order Book,1000.0,B,1440261000,"[data structures, greedy, implementation, sortings]",PROGRAMMING -572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Lengthening Sticks,1750.0,C,1440261000,"[brute force, combinatorics, dp, math]",PROGRAMMING -572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Minimization,2250.0,D,1440261000,"[dp, sortings]",PROGRAMMING -572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,CNF 2,2500.0,E,1440261000,[],PROGRAMMING -573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Poker,500.0,A,1440865800,"[implementation, number theory]",PROGRAMMING -573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Blocks,1000.0,B,1440865800,"[binary search, data structures, dp]",PROGRAMMING -573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Drawing,1750.0,C,1440865800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING -573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Cavalry,2000.0,D,1440865800,"[data structures, divide and conquer, dp]",PROGRAMMING -573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Bowling,2500.0,E,1440865800,[greedy],PROGRAMMING -574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Elections,500.0,A,1440865800,[implementation],PROGRAMMING -574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Three Musketeers,1000.0,B,1440865800,"[brute force, dfs and similar, graphs, hashing]",PROGRAMMING -574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Poker,1500.0,C,1440865800,[number theory],PROGRAMMING -574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Blocks,2000.0,D,1440865800,"[data structures, dp, shortest paths]",PROGRAMMING -574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Drawing,2750.0,E,1440865800,[],PROGRAMMING -576,Codeforces Round #319 (Div. 1),1,Vasya and Petya's Game,500.0,A,1441902600,"[math, number theory]",PROGRAMMING -576,Codeforces Round #319 (Div. 1),1,Invariance of Tree,1250.0,B,1441902600,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING -576,Codeforces Round #319 (Div. 1),1,Points on Plane,1250.0,C,1441902600,"[constructive algorithms, divide and conquer, geometry, greedy, sortings]",PROGRAMMING -576,Codeforces Round #319 (Div. 1),1,Flights for Regular Customers,2000.0,D,1441902600,"[dp, matrices]",PROGRAMMING -576,Codeforces Round #319 (Div. 1),1,Painting Edges,2750.0,E,1441902600,"[binary search, data structures]",PROGRAMMING -577,Codeforces Round #319 (Div. 2),2,Multiplication Table,500.0,A,1441902600,"[implementation, number theory]",PROGRAMMING -577,Codeforces Round #319 (Div. 2),2,Modulo Sum,1250.0,B,1441902600,"[combinatorics, data structures, dp, two pointers]",PROGRAMMING -577,Codeforces Round #319 (Div. 2),2,Vasya and Petya's Game,1500.0,C,1441902600,"[implementation, number theory]",PROGRAMMING -577,Codeforces Round #319 (Div. 2),2,Invariance of Tree,2250.0,D,1441902600,[],PROGRAMMING -577,Codeforces Round #319 (Div. 2),2,Points on Plane,2250.0,E,1441902600,[constructive algorithms],PROGRAMMING -578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,A Problem about Polyline,250.0,A,1442416500,"[geometry, math]",PROGRAMMING -578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,"""Or"" Game",500.0,B,1442416500,"[brute force, greedy]",PROGRAMMING -578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Weakness and Poorness,750.0,C,1442416500,[ternary search],PROGRAMMING -578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,LCS Again,2500.0,D,1442416500,"[dp, greedy]",PROGRAMMING -578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Walking!,2750.0,E,1442416500,"[constructive algorithms, greedy]",PROGRAMMING -578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Mirror Box,3000.0,F,1442416500,"[matrices, trees]",PROGRAMMING -579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Raising Bacteria,250.0,A,1442416500,[bitmasks],PROGRAMMING -579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Finding Team Member,500.0,B,1442416500,"[brute force, implementation, sortings]",PROGRAMMING -579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,A Problem about Polyline,1250.0,C,1442416500,"[binary search, math]",PROGRAMMING -579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,"""Or"" Game",2000.0,D,1442416500,"[brute force, greedy, math]",PROGRAMMING -579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Weakness and Poorness,3000.0,E,1442416500,[ternary search],PROGRAMMING -579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,LCS Again,3000.0,F,1442416500,[],PROGRAMMING -580,Codeforces Round #321 (Div. 2),2,Kefa and First Steps,750.0,A,1442939400,"[brute force, dp, implementation]",PROGRAMMING -580,Codeforces Round #321 (Div. 2),2,Kefa and Company,1250.0,B,1442939400,"[binary search, sortings, two pointers]",PROGRAMMING -580,Codeforces Round #321 (Div. 2),2,Kefa and Park,1500.0,C,1442939400,"[dfs and similar, trees]",PROGRAMMING -580,Codeforces Round #321 (Div. 2),2,Kefa and Dishes,2000.0,D,1442939400,"[bitmasks, dp]",PROGRAMMING -580,Codeforces Round #321 (Div. 2),2,Kefa and Watch,2500.0,E,1442939400,"[data structures, hashing, strings]",PROGRAMMING -581,Codeforces Round #322 (Div. 2),2,Vasya the Hipster,500.0,A,1443430800,[implementation],PROGRAMMING -581,Codeforces Round #322 (Div. 2),2,Luxurious Houses,1000.0,B,1443430800,[implementation],PROGRAMMING -581,Codeforces Round #322 (Div. 2),2,Developing Skills,1500.0,C,1443430800,"[implementation, sortings]",PROGRAMMING -581,Codeforces Round #322 (Div. 2),2,Three Logos,2000.0,D,1443430800,"[bitmasks, brute force, constructive algorithms, implementation, math]",PROGRAMMING -581,Codeforces Round #322 (Div. 2),2,Kojiro and Furrari,3000.0,E,1443430800,"[dp, greedy]",PROGRAMMING -581,Codeforces Round #322 (Div. 2),2,Zublicanes and Mumocrates,3000.0,F,1443430800,"[dp, trees, two pointers]",PROGRAMMING -582,Codeforces Round #323 (Div. 1),1,GCD Table,750.0,A,1443890700,"[constructive algorithms, greedy]",PROGRAMMING -582,Codeforces Round #323 (Div. 1),1,Once Again...,1250.0,B,1443890700,"[dp, matrices]",PROGRAMMING -582,Codeforces Round #323 (Div. 1),1,Superior Periodic Subarrays,1500.0,C,1443890700,[number theory],PROGRAMMING -582,Codeforces Round #323 (Div. 1),1,Number of Binominal Coefficients,2250.0,D,1443890700,"[dp, number theory]",PROGRAMMING -582,Codeforces Round #323 (Div. 1),1,Boolean Function,2500.0,E,1443890700,"[bitmasks, dp, expression parsing]",PROGRAMMING -583,Codeforces Round #323 (Div. 2),2,Asphalting Roads,500.0,A,1443890700,[implementation],PROGRAMMING -583,Codeforces Round #323 (Div. 2),2,Robot's Task,1000.0,B,1443890700,[implementation],PROGRAMMING -583,Codeforces Round #323 (Div. 2),2,GCD Table,1750.0,C,1443890700,[],PROGRAMMING -583,Codeforces Round #323 (Div. 2),2,Once Again...,2250.0,D,1443890700,[],PROGRAMMING -583,Codeforces Round #323 (Div. 2),2,Superior Periodic Subarrays,2500.0,E,1443890700,[number theory],PROGRAMMING -584,Codeforces Round #324 (Div. 2),2,Olesya and Rodion,500.0,A,1444149000,[math],PROGRAMMING -584,Codeforces Round #324 (Div. 2),2,Kolya and Tanya ,1000.0,B,1444149000,[combinatorics],PROGRAMMING -584,Codeforces Round #324 (Div. 2),2,Marina and Vasya,1500.0,C,1444149000,"[constructive algorithms, greedy]",PROGRAMMING -584,Codeforces Round #324 (Div. 2),2,Dima and Lisa,2000.0,D,1444149000,[number theory],PROGRAMMING -584,Codeforces Round #324 (Div. 2),2,Anton and Ira,2500.0,E,1444149000,"[constructive algorithms, greedy]",PROGRAMMING -585,Codeforces Round #325 (Div. 1),1,Gennady the Dentist,500.0,A,1444641000,"[brute force, implementation]",PROGRAMMING -585,Codeforces Round #325 (Div. 1),1,Phillip and Trains,750.0,B,1444641000,[dfs and similar],PROGRAMMING -585,Codeforces Round #325 (Div. 1),1,"Alice, Bob, Oranges and Apples",1250.0,C,1444641000,[number theory],PROGRAMMING -585,Codeforces Round #325 (Div. 1),1,Lizard Era: Beginning,1750.0,D,1444641000,[meet-in-the-middle],PROGRAMMING -585,Codeforces Round #325 (Div. 1),1,Present for Vitalik the Philatelist ,2250.0,E,1444641000,"[combinatorics, math, number theory]",PROGRAMMING -585,Codeforces Round #325 (Div. 1),1,Digits of Number Pi,3000.0,F,1444641000,"[dp, implementation, strings]",PROGRAMMING -586,Codeforces Round #325 (Div. 2),2,Alena's Schedule,500.0,A,1444641000,[implementation],PROGRAMMING -586,Codeforces Round #325 (Div. 2),2,Laurenty and Shop,1000.0,B,1444641000,[implementation],PROGRAMMING -586,Codeforces Round #325 (Div. 2),2,Gennady the Dentist,1500.0,C,1444641000,[implementation],PROGRAMMING -586,Codeforces Round #325 (Div. 2),2,Phillip and Trains,1750.0,D,1444641000,[dp],PROGRAMMING -586,Codeforces Round #325 (Div. 2),2,"Alice, Bob, Oranges and Apples",2250.0,E,1444641000,[number theory],PROGRAMMING -586,Codeforces Round #325 (Div. 2),2,Lizard Era: Beginning,2750.0,F,1444641000,[meet-in-the-middle],PROGRAMMING -587,Codeforces Round #326 (Div. 1),1,Duff and Weight Lifting,500.0,A,1444926600,[greedy],PROGRAMMING -587,Codeforces Round #326 (Div. 1),1,Duff in Beach,1000.0,B,1444926600,[dp],PROGRAMMING -587,Codeforces Round #326 (Div. 1),1,Duff in the Army,1500.0,C,1444926600,"[data structures, trees]",PROGRAMMING -587,Codeforces Round #326 (Div. 1),1,Duff in Mafia,2000.0,D,1444926600,"[2-sat, binary search]",PROGRAMMING -587,Codeforces Round #326 (Div. 1),1,Duff as a Queen,2750.0,E,1444926600,[data structures],PROGRAMMING -587,Codeforces Round #326 (Div. 1),1,Duff is Mad,2750.0,F,1444926600,"[data structures, strings]",PROGRAMMING -588,Codeforces Round #326 (Div. 2),2,Duff and Meat,750.0,A,1444926600,[greedy],PROGRAMMING -588,Codeforces Round #326 (Div. 2),2,Duff in Love,1000.0,B,1444926600,[math],PROGRAMMING -588,Codeforces Round #326 (Div. 2),2,Duff and Weight Lifting,1500.0,C,1444926600,[],PROGRAMMING -588,Codeforces Round #326 (Div. 2),2,Duff in Beach,2000.0,D,1444926600,[],PROGRAMMING -588,Codeforces Round #326 (Div. 2),2,Duff in the Army,2500.0,E,1444926600,"[data structures, dfs and similar, trees]",PROGRAMMING -588,Codeforces Round #326 (Div. 2),2,Duff in Mafia,3000.0,F,1444926600,[],PROGRAMMING -590,Codeforces Round #327 (Div. 1),1,Median Smoothing,750.0,A,1445763600,[],PROGRAMMING -590,Codeforces Round #327 (Div. 1),1,Chip 'n Dale Rescue Rangers,1000.0,B,1445763600,"[binary search, geometry, math]",PROGRAMMING -590,Codeforces Round #327 (Div. 1),1,Three States,1250.0,C,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING -590,Codeforces Round #327 (Div. 1),1,Top Secret Task,1750.0,D,1445763600,[dp],PROGRAMMING -590,Codeforces Round #327 (Div. 1),1,Birthday,2500.0,E,1445763600,"[graph matchings, strings]",PROGRAMMING -591,Codeforces Round #327 (Div. 2),2,Wizards' Duel,500.0,A,1445763600,[math],PROGRAMMING -591,Codeforces Round #327 (Div. 2),2,Rebranding,1000.0,B,1445763600,[implementation],PROGRAMMING -591,Codeforces Round #327 (Div. 2),2,Median Smoothing,1750.0,C,1445763600,[constructive algorithms],PROGRAMMING -591,Codeforces Round #327 (Div. 2),2,Chip 'n Dale Rescue Rangers,2000.0,D,1445763600,[],PROGRAMMING -591,Codeforces Round #327 (Div. 2),2,Three States,2250.0,E,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING -592,Codeforces Round #328 (Div. 2),2,PawnChess,500.0,A,1446309000,[implementation],PROGRAMMING -592,Codeforces Round #328 (Div. 2),2,The Monster and the Squirrel,1000.0,B,1446309000,[math],PROGRAMMING -592,Codeforces Round #328 (Div. 2),2,The Big Race,1500.0,C,1446309000,[math],PROGRAMMING -592,Codeforces Round #328 (Div. 2),2,Super M,2000.0,D,1446309000,"[dfs and similar, dp, trees]",PROGRAMMING -592,Codeforces Round #328 (Div. 2),2,BCPC,3000.0,E,1446309000,"[binary search, geometry, two pointers]",PROGRAMMING -593,Codeforces Round #329 (Div. 2),2,2Char,250.0,A,1446655500,[brute force],PROGRAMMING -593,Codeforces Round #329 (Div. 2),2,Anton and Lines,1000.0,B,1446655500,"[geometry, sortings]",PROGRAMMING -593,Codeforces Round #329 (Div. 2),2,Beautiful Function,3000.0,C,1446655500,"[constructive algorithms, math]",PROGRAMMING -593,Codeforces Round #329 (Div. 2),2,Happy Tree Party,3000.0,D,1446655500,"[data structures, trees]",PROGRAMMING -593,Codeforces Round #329 (Div. 2),2,Strange Calculation and Cats,3000.0,E,1446655500,"[dp, matrices]",PROGRAMMING -596,Codeforces Round #331 (Div. 2),2,Wilbur and Swimming Pool,500.0,A,1447605300,[implementation],PROGRAMMING -596,Codeforces Round #331 (Div. 2),2,Wilbur and Array,1000.0,B,1447605300,[greedy],PROGRAMMING -596,Codeforces Round #331 (Div. 2),2,Wilbur and Points,1500.0,C,1447605300,"[greedy, sortings]",PROGRAMMING -596,Codeforces Round #331 (Div. 2),2,Wilbur and Trees,2250.0,D,1447605300,"[dp, probabilities, sortings]",PROGRAMMING -596,Codeforces Round #331 (Div. 2),2,Wilbur and Strings,2500.0,E,1447605300,"[dfs and similar, dp, graphs]",PROGRAMMING -599,Codeforces Round #332 (Div. 2),2,Patrick and Shopping,500.0,A,1448037300,[implementation],PROGRAMMING -599,Codeforces Round #332 (Div. 2),2,Spongebob and Joke,1000.0,B,1448037300,[implementation],PROGRAMMING -599,Codeforces Round #332 (Div. 2),2,Day at the Beach,1500.0,C,1448037300,[sortings],PROGRAMMING -599,Codeforces Round #332 (Div. 2),2,Spongebob and Squares,2000.0,D,1448037300,"[brute force, math]",PROGRAMMING -599,Codeforces Round #332 (Div. 2),2,Sandy and Nuts,3000.0,E,1448037300,"[bitmasks, dp]",PROGRAMMING -601,Codeforces Round #333 (Div. 1),1,The Two Routes,500.0,A,1448382900,"[graphs, shortest paths]",PROGRAMMING -601,Codeforces Round #333 (Div. 1),1,Lipshitz Sequence,1250.0,B,1448382900,[data structures],PROGRAMMING -601,Codeforces Round #333 (Div. 1),1,Kleofáš and the n-thlon,1250.0,C,1448382900,"[dp, probabilities]",PROGRAMMING -601,Codeforces Round #333 (Div. 1),1,Acyclic Organic Compounds,2000.0,D,1448382900,"[data structures, dfs and similar, dsu, hashing, trees]",PROGRAMMING -601,Codeforces Round #333 (Div. 1),1,A Museum Robbery,2500.0,E,1448382900,"[data structures, dp]",PROGRAMMING -602,Codeforces Round #333 (Div. 2),2,Two Bases,500.0,A,1448382900,[implementation],PROGRAMMING -602,Codeforces Round #333 (Div. 2),2,Approximating a Constant Range,1000.0,B,1448382900,"[dp, two pointers]",PROGRAMMING -602,Codeforces Round #333 (Div. 2),2,The Two Routes,1500.0,C,1448382900,[],PROGRAMMING -602,Codeforces Round #333 (Div. 2),2,Lipshitz Sequence,2250.0,D,1448382900,[],PROGRAMMING -602,Codeforces Round #333 (Div. 2),2,Kleofáš and the n-thlon,2250.0,E,1448382900,[probabilities],PROGRAMMING -603,Codeforces Round #334 (Div. 1),1,Alternative Thinking,500.0,A,1448984100,"[dp, greedy]",PROGRAMMING -603,Codeforces Round #334 (Div. 1),1,Moodular Arithmetic,1000.0,B,1448984100,"[dfs and similar, dsu, math, number theory]",PROGRAMMING -603,Codeforces Round #334 (Div. 1),1,Lieges of Legendre,1500.0,C,1448984100,[games],PROGRAMMING -603,Codeforces Round #334 (Div. 1),1,Ruminations on Ruminants,2000.0,D,1448984100,"[geometry, math]",PROGRAMMING -603,Codeforces Round #334 (Div. 1),1,Pastoral Oddities,3000.0,E,1448984100,"[data structures, divide and conquer, dsu, trees]",PROGRAMMING -604,Codeforces Round #334 (Div. 2),2,Uncowed Forces,500.0,A,1448984100,[implementation],PROGRAMMING -604,Codeforces Round #334 (Div. 2),2,More Cowbell,1000.0,B,1448984100,"[binary search, greedy]",PROGRAMMING -604,Codeforces Round #334 (Div. 2),2,Alternative Thinking,1500.0,C,1448984100,"[constructive algorithms, dp, math]",PROGRAMMING -604,Codeforces Round #334 (Div. 2),2,Moodular Arithmetic,2000.0,D,1448984100,[dsu],PROGRAMMING -604,Codeforces Round #334 (Div. 2),2,Lieges of Legendre,2500.0,E,1448984100,[],PROGRAMMING -605,Codeforces Round #335 (Div. 1),1,Sorting Railway Cars,500.0,A,1449677100,"[constructive algorithms, greedy]",PROGRAMMING -605,Codeforces Round #335 (Div. 1),1,Lazy Student,1000.0,B,1449677100,"[constructive algorithms, data structures, graphs]",PROGRAMMING -605,Codeforces Round #335 (Div. 1),1,Freelancer's Dreams,1500.0,C,1449677100,[geometry],PROGRAMMING -605,Codeforces Round #335 (Div. 1),1,Board Game,2000.0,D,1449677100,"[data structures, dfs and similar]",PROGRAMMING -605,Codeforces Round #335 (Div. 1),1,Intergalaxy Trips,2500.0,E,1449677100,"[probabilities, shortest paths]",PROGRAMMING -606,Codeforces Round #335 (Div. 2),2,Magic Spheres,500.0,A,1449677100,[implementation],PROGRAMMING -606,Codeforces Round #335 (Div. 2),2,Testing Robots,1000.0,B,1449677100,[implementation],PROGRAMMING -606,Codeforces Round #335 (Div. 2),2,Sorting Railway Cars,1500.0,C,1449677100,[],PROGRAMMING -606,Codeforces Round #335 (Div. 2),2,Lazy Student,2000.0,D,1449677100,[graphs],PROGRAMMING -606,Codeforces Round #335 (Div. 2),2,Freelancer's Dreams,2500.0,E,1449677100,[],PROGRAMMING -607,Codeforces Round #336 (Div. 1),1,Chain Reaction,500.0,A,1450888500,"[binary search, dp]",PROGRAMMING -607,Codeforces Round #336 (Div. 1),1,Zuma,1250.0,B,1450888500,[dp],PROGRAMMING -607,Codeforces Round #336 (Div. 1),1,Marbles,1500.0,C,1450888500,"[hashing, strings]",PROGRAMMING -607,Codeforces Round #336 (Div. 1),1,Power Tree,2000.0,D,1450888500,[data structures],PROGRAMMING -607,Codeforces Round #336 (Div. 1),1,Cross Sum,3000.0,E,1450888500,"[binary search, geometry]",PROGRAMMING -608,Codeforces Round #336 (Div. 2),2,Saitama Destroys Hotel,500.0,A,1450888500,"[implementation, math]",PROGRAMMING -608,Codeforces Round #336 (Div. 2),2,Hamming Distance Sum,1000.0,B,1450888500,[combinatorics],PROGRAMMING -608,Codeforces Round #336 (Div. 2),2,Chain Reaction,1500.0,C,1450888500,[dp],PROGRAMMING -608,Codeforces Round #336 (Div. 2),2,Zuma,2250.0,D,1450888500,[],PROGRAMMING -608,Codeforces Round #336 (Div. 2),2,Marbles,2500.0,E,1450888500,[],PROGRAMMING -610,Codeforces Round #337 (Div. 2),2,Pasha and Stick,500.0,A,1451215200,"[combinatorics, math]",PROGRAMMING -610,Codeforces Round #337 (Div. 2),2,Vika and Squares,1000.0,B,1451215200,[implementation],PROGRAMMING -610,Codeforces Round #337 (Div. 2),2,Harmony Analysis,1500.0,C,1451215200,[constructive algorithms],PROGRAMMING -610,Codeforces Round #337 (Div. 2),2,Vika and Segments,2500.0,D,1451215200,"[data structures, geometry, two pointers]",PROGRAMMING -610,Codeforces Round #337 (Div. 2),2,Alphabet Permutations,2500.0,E,1451215200,"[data structures, strings]",PROGRAMMING -611,Good Bye 2015,12,New Year and Days,500.0,A,1451487900,[implementation],PROGRAMMING -611,Good Bye 2015,12,New Year and Old Property,750.0,B,1451487900,"[brute force, implementation]",PROGRAMMING -611,Good Bye 2015,12,New Year and Domino,1250.0,C,1451487900,"[dp, implementation]",PROGRAMMING -611,Good Bye 2015,12,New Year and Ancient Prophecy,1750.0,D,1451487900,"[hashing, strings]",PROGRAMMING -611,Good Bye 2015,12,New Year and Three Musketeers,2500.0,E,1451487900,"[data structures, greedy]",PROGRAMMING -611,Good Bye 2015,12,New Year and Cleaning,2500.0,F,1451487900,"[binary search, implementation]",PROGRAMMING -611,Good Bye 2015,12,New Year and Cake,3000.0,G,1451487900,"[geometry, two pointers]",PROGRAMMING -611,Good Bye 2015,12,New Year and Forgotten Tree,3500.0,H,1451487900,"[constructive algorithms, flows]",PROGRAMMING -613,Codeforces Round #339 (Div. 1),1,Peter and Snow Blower,750.0,A,1452789300,"[binary search, geometry, ternary search]",PROGRAMMING -613,Codeforces Round #339 (Div. 1),1,Skills,1250.0,B,1452789300,"[binary search, brute force, two pointers]",PROGRAMMING -613,Codeforces Round #339 (Div. 1),1,Necklace,1250.0,C,1452789300,[constructive algorithms],PROGRAMMING -613,Codeforces Round #339 (Div. 1),1,Kingdom and its Cities,2000.0,D,1452789300,"[dfs and similar, divide and conquer, graphs, sortings, trees]",PROGRAMMING -613,Codeforces Round #339 (Div. 1),1,Puzzle Lover,2500.0,E,1452789300,"[dp, hashing, strings]",PROGRAMMING -614,Codeforces Round #339 (Div. 2),2,Link/Cut Tree,500.0,A,1452789300,[brute force],PROGRAMMING -614,Codeforces Round #339 (Div. 2),2,Gena's Code,1000.0,B,1452789300,[implementation],PROGRAMMING -614,Codeforces Round #339 (Div. 2),2,Peter and Snow Blower,1750.0,C,1452789300,[],PROGRAMMING -614,Codeforces Round #339 (Div. 2),2,Skills,2250.0,D,1452789300,[],PROGRAMMING -614,Codeforces Round #339 (Div. 2),2,Necklace,2250.0,E,1452789300,[],PROGRAMMING -617,Codeforces Round #340 (Div. 2),2,Elephant,500.0,A,1453563300,[math],PROGRAMMING -617,Codeforces Round #340 (Div. 2),2,Chocolate,1000.0,B,1453563300,[combinatorics],PROGRAMMING -617,Codeforces Round #340 (Div. 2),2,Watering Flowers,1250.0,C,1453563300,[implementation],PROGRAMMING -617,Codeforces Round #340 (Div. 2),2,Polyline,1750.0,D,1453563300,[constructive algorithms],PROGRAMMING -617,Codeforces Round #340 (Div. 2),2,XOR and Favorite Number,2750.0,E,1453563300,[data structures],PROGRAMMING -618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Slime Combining,500.0,A,1454087400,[implementation],PROGRAMMING -618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Guess the Permutation,1000.0,B,1454087400,[constructive algorithms],PROGRAMMING -618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Constellation,1500.0,C,1454087400,"[geometry, implementation]",PROGRAMMING -618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Hamiltonian Spanning Tree,1750.0,D,1454087400,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING -618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Robot Arm,2500.0,E,1454087400,[data structures],PROGRAMMING -618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Double Knapsack,2750.0,F,1454087400,"[constructive algorithms, two pointers]",PROGRAMMING -618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Combining Slimes,3500.0,G,1454087400,"[dp, matrices, probabilities]",PROGRAMMING -621,Codeforces Round #341 (Div. 2),2,Wet Shark and Odd and Even,500.0,A,1454249100,[implementation],PROGRAMMING -621,Codeforces Round #341 (Div. 2),2,Wet Shark and Bishops,1000.0,B,1454249100,[combinatorics],PROGRAMMING -621,Codeforces Round #341 (Div. 2),2,Wet Shark and Flowers,1500.0,C,1454249100,[probabilities],PROGRAMMING -621,Codeforces Round #341 (Div. 2),2,Rat Kwesh and Cheese,2000.0,D,1454249100,"[brute force, math]",PROGRAMMING -621,Codeforces Round #341 (Div. 2),2,Wet Shark and Blocks,2500.0,E,1454249100,"[dp, matrices]",PROGRAMMING -623,AIM Tech Round (Div. 1),1,Graph and String,500.0,A,1454605500,"[constructive algorithms, graphs]",PROGRAMMING -623,AIM Tech Round (Div. 1),1,Array GCD,1000.0,B,1454605500,"[dp, greedy, number theory]",PROGRAMMING -623,AIM Tech Round (Div. 1),1,Electric Charges,1750.0,C,1454605500,[binary search],PROGRAMMING -623,AIM Tech Round (Div. 1),1,Birthday,2000.0,D,1454605500,"[greedy, probabilities]",PROGRAMMING -623,AIM Tech Round (Div. 1),1,Transforming Sequence,2250.0,E,1454605500,"[combinatorics, dp, fft]",PROGRAMMING -624,AIM Tech Round (Div. 2),2,Save Luke,500.0,A,1454605500,[math],PROGRAMMING -624,AIM Tech Round (Div. 2),2,Making a String,1000.0,B,1454605500,"[greedy, sortings]",PROGRAMMING -624,AIM Tech Round (Div. 2),2,Graph and String,1500.0,C,1454605500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING -624,AIM Tech Round (Div. 2),2,Array GCD,2000.0,D,1454605500,"[dp, greedy, number theory]",PROGRAMMING -624,AIM Tech Round (Div. 2),2,Electric Charges,3000.0,E,1454605500,[],PROGRAMMING -625,Codeforces Round #342 (Div. 2),2,Guest From the Past,750.0,A,1454835900,"[implementation, math]",PROGRAMMING -625,Codeforces Round #342 (Div. 2),2,War of the Corporations,750.0,B,1454835900,"[constructive algorithms, strings]",PROGRAMMING -625,Codeforces Round #342 (Div. 2),2,K-special Tables,1000.0,C,1454835900,"[constructive algorithms, implementation]",PROGRAMMING -625,Codeforces Round #342 (Div. 2),2,Finals in arithmetic,2000.0,D,1454835900,"[constructive algorithms, implementation]",PROGRAMMING -625,Codeforces Round #342 (Div. 2),2,Frog Fights,3000.0,E,1454835900,"[data structures, greedy]",PROGRAMMING -626,8VC Venture Cup 2016 - Elimination Round,12,Robot Sequence,500.0,A,1455384900,"[brute force, implementation]",PROGRAMMING -626,8VC Venture Cup 2016 - Elimination Round,12,Cards,750.0,B,1455384900,"[constructive algorithms, dp]",PROGRAMMING -626,8VC Venture Cup 2016 - Elimination Round,12,Block Towers,1000.0,C,1455384900,"[brute force, greedy]",PROGRAMMING -626,8VC Venture Cup 2016 - Elimination Round,12,Jerry's Protest,1500.0,D,1455384900,"[brute force, combinatorics, probabilities]",PROGRAMMING -626,8VC Venture Cup 2016 - Elimination Round,12,Simple Skewness,2000.0,E,1455384900,"[binary search, math, ternary search]",PROGRAMMING -626,8VC Venture Cup 2016 - Elimination Round,12,Group Projects,2500.0,F,1455384900,[dp],PROGRAMMING -626,8VC Venture Cup 2016 - Elimination Round,12,Raffles,3000.0,G,1455384900,"[data structures, greedy]",PROGRAMMING -627,8VC Venture Cup 2016 - Final Round,12,XOR Equation,500.0,A,1456683000,"[dp, math]",PROGRAMMING -627,8VC Venture Cup 2016 - Final Round,12,Factory Repairs,1000.0,B,1456683000,[data structures],PROGRAMMING -627,8VC Venture Cup 2016 - Final Round,12,Package Delivery,1500.0,C,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING -627,8VC Venture Cup 2016 - Final Round,12,Preorder Test,2000.0,D,1456683000,"[binary search, dp, trees]",PROGRAMMING -627,8VC Venture Cup 2016 - Final Round,12,Orchestra,2500.0,E,1456683000,[two pointers],PROGRAMMING -627,8VC Venture Cup 2016 - Final Round,12,Island Puzzle,3000.0,F,1456683000,"[dfs and similar, graphs, trees]",PROGRAMMING -629,Codeforces Round #343 (Div. 2),2,Far Relative’s Birthday Cake,500.0,A,1455986100,"[brute force, constructive algorithms, implementation]",PROGRAMMING -629,Codeforces Round #343 (Div. 2),2,Far Relative’s Problem,1000.0,B,1455986100,[brute force],PROGRAMMING -629,Codeforces Round #343 (Div. 2),2,Famil Door and Brackets,1750.0,C,1455986100,"[dp, strings]",PROGRAMMING -629,Codeforces Round #343 (Div. 2),2,Babaei and Birthday Cake,2000.0,D,1455986100,"[data structures, dp]",PROGRAMMING -629,Codeforces Round #343 (Div. 2),2,Famil Door and Roads,2500.0,E,1455986100,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING -631,Codeforces Round #344 (Div. 2),2,Interview,500.0,A,1457022900,"[brute force, implementation]",PROGRAMMING -631,Codeforces Round #344 (Div. 2),2,Print Check,1000.0,B,1457022900,"[constructive algorithms, implementation]",PROGRAMMING -631,Codeforces Round #344 (Div. 2),2,Report,1500.0,C,1457022900,"[data structures, sortings]",PROGRAMMING -631,Codeforces Round #344 (Div. 2),2,Messenger,2000.0,D,1457022900,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING -631,Codeforces Round #344 (Div. 2),2,Product Sum,2500.0,E,1457022900,"[data structures, dp, geometry]",PROGRAMMING -633,"Manthan, Codefest 16",12,Ebony and Ivory,250.0,A,1456506900,"[brute force, math]",PROGRAMMING -633,"Manthan, Codefest 16",12,A Trivial Problem,500.0,B,1456506900,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING -633,"Manthan, Codefest 16",12,Spy Syndrome 2,1500.0,C,1456506900,"[data structures, dp, hashing, implementation, sortings, string suffix structures, strings]",PROGRAMMING -633,"Manthan, Codefest 16",12,Fibonacci-ish,1750.0,D,1456506900,"[brute force, hashing, implementation, math]",PROGRAMMING -633,"Manthan, Codefest 16",12,Startup Funding,2500.0,E,1456506900,"[binary search, data structures, probabilities, two pointers]",PROGRAMMING -633,"Manthan, Codefest 16",12,The Chocolate Spree,2750.0,F,1456506900,"[dfs and similar, dp, trees]",PROGRAMMING -633,"Manthan, Codefest 16",12,Yash And Trees,3000.0,G,1456506900,"[bitmasks, data structures, dfs and similar]",PROGRAMMING -633,"Manthan, Codefest 16",12,Fibonacci-ish II,3000.0,H,1456506900,"[data structures, implementation]",PROGRAMMING -634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Island Puzzle,500.0,A,1456683000,"[constructive algorithms, implementation]",PROGRAMMING -634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,XOR Equation,1000.0,B,1456683000,"[constructive algorithms, dp, implementation]",PROGRAMMING -634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Factory Repairs,1500.0,C,1456683000,[data structures],PROGRAMMING -634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Package Delivery,2000.0,D,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING -634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Preorder Test,2500.0,E,1456683000,[],PROGRAMMING -634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Orchestra,3000.0,F,1456683000,[two pointers],PROGRAMMING -635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Orchestra,500.0,A,1456683000,"[brute force, implementation]",PROGRAMMING -635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Island Puzzle,1000.0,B,1456683000,[],PROGRAMMING -635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,XOR Equation,1500.0,C,1456683000,[dp],PROGRAMMING -635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Factory Repairs,2000.0,D,1456683000,[],PROGRAMMING -635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Package Delivery,2500.0,E,1456683000,"[data structures, greedy]",PROGRAMMING -635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Preorder Test,3000.0,F,1456683000,[],PROGRAMMING -645,CROC 2016 - Elimination Round,12,Amity Assessment,500.0,A,1458318900,"[brute force, constructive algorithms, implementation]",PROGRAMMING -645,CROC 2016 - Elimination Round,12,Mischievous Mess Makers,1000.0,B,1458318900,"[greedy, math]",PROGRAMMING -645,CROC 2016 - Elimination Round,12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING -645,CROC 2016 - Elimination Round,12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, dp, graphs]",PROGRAMMING -645,CROC 2016 - Elimination Round,12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING -645,CROC 2016 - Elimination Round,12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, math, number theory]",PROGRAMMING -645,CROC 2016 - Elimination Round,12,Armistice Area Apportionment,3500.0,G,1458318900,"[binary search, geometry]",PROGRAMMING -648,Технокубок 2016 - Отборочный Раунд 1,12,Наибольший подъем,500.0,A,1458745200,[constructive algorithms],PROGRAMMING -648,Технокубок 2016 - Отборочный Раунд 1,12,Собери стол,1000.0,B,1458745200,"[constructive algorithms, sortings]",PROGRAMMING -648,Технокубок 2016 - Отборочный Раунд 1,12,Путь Робота,1500.0,C,1458745200,"[dfs and similar, graphs]",PROGRAMMING -648,Технокубок 2016 - Отборочный Раунд 1,12,Собачки и миски,2000.0,D,1458745200,"[greedy, sortings]",PROGRAMMING -648,Технокубок 2016 - Отборочный Раунд 1,12,Собери число,2500.0,E,1458745200,[],PROGRAMMING -649,Технокубок 2016 - Отборочный Раунд 2,12,Любимые числа Поликарпа,500.0,A,1458975600,[constructive algorithms],PROGRAMMING -649,Технокубок 2016 - Отборочный Раунд 2,12,Этажи,1000.0,B,1458975600,[constructive algorithms],PROGRAMMING -649,Технокубок 2016 - Отборочный Раунд 2,12,Печать условий,1500.0,C,1458975600,"[greedy, sortings]",PROGRAMMING -649,Технокубок 2016 - Отборочный Раунд 2,12,Дефрагментация памяти,2000.0,D,1458975600,"[greedy, implementation]",PROGRAMMING -649,Технокубок 2016 - Отборочный Раунд 2,12,Автобус,2500.0,E,1458975600,"[binary search, data structures, greedy, sortings]",PROGRAMMING -650,Codeforces Round #345 (Div. 1),1,Watchmen,500.0,A,1457342700,"[data structures, math]",PROGRAMMING -650,Codeforces Round #345 (Div. 1),1,Image Preview,1000.0,B,1457342700,"[binary search, dp, two pointers]",PROGRAMMING -650,Codeforces Round #345 (Div. 1),1,Table Compression,1500.0,C,1457342700,"[dfs and similar, dp, dsu, graphs, greedy]",PROGRAMMING -650,Codeforces Round #345 (Div. 1),1,Zip-line,2000.0,D,1457342700,"[binary search, data structures, dp]",PROGRAMMING -650,Codeforces Round #345 (Div. 1),1,Clockwork Bomb,2500.0,E,1457342700,"[data structures, dfs and similar, dsu, trees]",PROGRAMMING -651,Codeforces Round #345 (Div. 2),2,Joysticks,500.0,A,1457342700,"[dp, greedy]",PROGRAMMING -651,Codeforces Round #345 (Div. 2),2,Beautiful Paintings,1000.0,B,1457342700,"[greedy, sortings]",PROGRAMMING -651,Codeforces Round #345 (Div. 2),2,Watchmen,1500.0,C,1457342700,"[data structures, geometry, implementation, sortings]",PROGRAMMING -651,Codeforces Round #345 (Div. 2),2,Image Preview,2000.0,D,1457342700,"[binary search, dp, two pointers]",PROGRAMMING -651,Codeforces Round #345 (Div. 2),2,Table Compression,2500.0,E,1457342700,"[dsu, graphs, greedy]",PROGRAMMING -653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Three Balls,500.0,A,1458376500,"[brute force, implementation, sortings]",PROGRAMMING -653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Compressing,1000.0,B,1458376500,"[brute force, dfs and similar, dp, strings]",PROGRAMMING -653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Up-Down,1500.0,C,1458376500,"[brute force, implementation]",PROGRAMMING -653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Delivery Bears,2000.0,D,1458376500,"[binary search, flows]",PROGRAMMING -653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Forgotten Tree 2,2500.0,E,1458376500,"[dfs and similar, dsu, graphs]",PROGRAMMING -653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Paper task,3500.0,F,1458376500,"[data structures, string suffix structures]",PROGRAMMING -653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Move by Prime,3500.0,G,1458376500,[combinatorics],PROGRAMMING -655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Amity Assessment,500.0,A,1458318900,[],PROGRAMMING -655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Mischievous Mess Makers,1000.0,B,1458318900,[],PROGRAMMING -655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING -655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, graphs]",PROGRAMMING -655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING -655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, number theory]",PROGRAMMING -655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Armistice Area Apportionment,3500.0,G,1458318900,[],PROGRAMMING -657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Forgotten Tree 3,500.0,A,1459182900,[graphs],PROGRAMMING -657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Polynomials,1000.0,B,1459182900,[math],PROGRAMMING -657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Contribution,1500.0,C,1459182900,[sortings],PROGRAMMING -657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Paradox,2000.0,D,1459182900,[sortings],PROGRAMMING -657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Chemistry,3000.0,E,1459182900,[],PROGRAMMING -658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Reverse Radewoosh,500.0,A,1459182900,[implementation],PROGRAMMING -658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Displayed Friends,1000.0,B,1459182900,[],PROGRAMMING -658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Forgotten Tree 3,1500.0,C,1459182900,[],PROGRAMMING -658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Polynomials,2000.0,D,1459182900,[],PROGRAMMING -658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Contribution,2500.0,E,1459182900,[],PROGRAMMING -659,Codeforces Round #346 (Div. 2),2,Round House,500.0,A,1459353900,"[implementation, math]",PROGRAMMING -659,Codeforces Round #346 (Div. 2),2,Qualifying Contest,1000.0,B,1459353900,[sortings],PROGRAMMING -659,Codeforces Round #346 (Div. 2),2,Tanya and Toys,1000.0,C,1459353900,"[greedy, implementation]",PROGRAMMING -659,Codeforces Round #346 (Div. 2),2,Bicycle Race,1250.0,D,1459353900,"[geometry, implementation, math]",PROGRAMMING -659,Codeforces Round #346 (Div. 2),2,New Reform,1500.0,E,1459353900,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING -659,Codeforces Round #346 (Div. 2),2,Polycarp and Hay,2000.0,F,1459353900,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING -659,Codeforces Round #346 (Div. 2),2,Fence Divercity,2500.0,G,1459353900,"[combinatorics, dp]",PROGRAMMING -662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Gambling Nim,500.0,A,1460729700,"[bitmasks, math, matrices, probabilities]",PROGRAMMING -662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Graph Coloring,250.0,B,1460729700,[dfs and similar],PROGRAMMING -662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Binary Table,2250.0,C,1460729700,"[bitmasks, brute force, divide and conquer, dp, fft, math]",PROGRAMMING -662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,International Olympiad,250.0,D,1460729700,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING -662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,To Hack or not to Hack,2250.0,E,1460729700,"[brute force, dp, greedy]",PROGRAMMING -666,Codeforces Round #349 (Div. 1),1,Reberland Linguistics,500.0,A,1461947700,"[dp, implementation]",PROGRAMMING -666,Codeforces Round #349 (Div. 1),1,World Tour,1000.0,B,1461947700,"[graphs, shortest paths]",PROGRAMMING -666,Codeforces Round #349 (Div. 1),1,Codeword,2000.0,C,1461947700,[combinatorics],PROGRAMMING -666,Codeforces Round #349 (Div. 1),1,Chain Reaction,2000.0,D,1461947700,[brute force],PROGRAMMING -666,Codeforces Round #349 (Div. 1),1,Forensic Examination,3000.0,E,1461947700,"[data structures, string suffix structures]",PROGRAMMING -667,Codeforces Round #349 (Div. 2),2,Pouring Rain,500.0,A,1461947700,"[geometry, math]",PROGRAMMING -667,Codeforces Round #349 (Div. 2),2,Coat of Anticubism,1000.0,B,1461947700,"[constructive algorithms, geometry]",PROGRAMMING -667,Codeforces Round #349 (Div. 2),2,Reberland Linguistics,1500.0,C,1461947700,"[dp, strings]",PROGRAMMING -667,Codeforces Round #349 (Div. 2),2,World Tour,2000.0,D,1461947700,"[brute force, graphs, shortest paths]",PROGRAMMING -667,Codeforces Round #349 (Div. 2),2,Chain Reaction,3000.0,E,1461947700,[],PROGRAMMING -668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Matrix,500.0,A,1461515700,[],PROGRAMMING -668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Dance,1000.0,B,1461515700,[],PROGRAMMING -668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Random Variable,1500.0,C,1461515700,[math],PROGRAMMING -668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Time Machine,2000.0,D,1461515700,[data structures],PROGRAMMING -668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and 2-SAT,3000.0,E,1461515700,[graphs],PROGRAMMING -668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Graph,3000.0,F,1461515700,[dp],PROGRAMMING -669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Presents,500.0,A,1461515700,[math],PROGRAMMING -669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Grasshopper,1000.0,B,1461515700,[],PROGRAMMING -669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Matrix,1500.0,C,1461515700,"[constructive algorithms, implementation]",PROGRAMMING -669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Dance,2000.0,D,1461515700,"[data structures, implementation, math]",PROGRAMMING -669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Time Machine,2500.0,E,1461515700,[data structures],PROGRAMMING -670,Codeforces Round #350 (Div. 2),2,Holidays,500.0,A,1462464300,"[brute force, constructive algorithms]",PROGRAMMING -670,Codeforces Round #350 (Div. 2),2,Game of Robots,750.0,B,1462464300,[implementation],PROGRAMMING -670,Codeforces Round #350 (Div. 2),2,Cinema,1000.0,C,1462464300,"[implementation, sortings]",PROGRAMMING -670,Codeforces Round #350 (Div. 2),2,Magic Powder - 1,1000.0,D1,1462464300,"[binary search, brute force]",PROGRAMMING -670,Codeforces Round #350 (Div. 2),2,Magic Powder - 2,500.0,D2,1462464300,[binary search],PROGRAMMING -670,Codeforces Round #350 (Div. 2),2,Correct Bracket Sequence Editor,2000.0,E,1462464300,"[data structures, dsu]",PROGRAMMING -670,Codeforces Round #350 (Div. 2),2,Restore a Number,2500.0,F,1462464300,"[constructive algorithms, strings]",PROGRAMMING -671,Codeforces Round #352 (Div. 1),1,Recycling Bottles,500.0,A,1462984500,"[dp, greedy]",PROGRAMMING -671,Codeforces Round #352 (Div. 1),1,Robin Hood,1000.0,B,1462984500,"[binary search, greedy]",PROGRAMMING -671,Codeforces Round #352 (Div. 1),1,Ultimate Weirdness of an Array,1500.0,C,1462984500,"[data structures, number theory]",PROGRAMMING -671,Codeforces Round #352 (Div. 1),1,Roads in Yusland,2000.0,D,1462984500,"[data structures, dp, greedy]",PROGRAMMING -671,Codeforces Round #352 (Div. 1),1,Organizing a Race,3000.0,E,1462984500,"[data structures, greedy]",PROGRAMMING -672,Codeforces Round #352 (Div. 2),2,Summer Camp,500.0,A,1462984500,[implementation],PROGRAMMING -672,Codeforces Round #352 (Div. 2),2,Different is Good,1000.0,B,1462984500,"[constructive algorithms, implementation, strings]",PROGRAMMING -672,Codeforces Round #352 (Div. 2),2,Recycling Bottles,1500.0,C,1462984500,"[brute force, geometry, greedy]",PROGRAMMING -672,Codeforces Round #352 (Div. 2),2,Robin Hood,2000.0,D,1462984500,"[binary search, greedy]",PROGRAMMING -672,Codeforces Round #352 (Div. 2),2,Ultimate Weirdness of an Array,2500.0,E,1462984500,[],PROGRAMMING -673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Game,500.0,A,1462633500,[implementation],PROGRAMMING -673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Problems for Round,750.0,B,1462633500,"[greedy, implementation]",PROGRAMMING -673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Colors,1000.0,C,1462633500,[],PROGRAMMING -673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Two Paths,1500.0,D,1462633500,[],PROGRAMMING -673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Levels and Regions,2250.0,E,1462633500,"[divide and conquer, dp]",PROGRAMMING -673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bearish Fanpages,3000.0,F,1462633500,[],PROGRAMMING -674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Colors,500.0,A,1462633500,"[brute force, data structures, implementation]",PROGRAMMING -674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Two Paths,1000.0,B,1462633500,"[constructive algorithms, graphs]",PROGRAMMING -674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Levels and Regions,1750.0,C,1462633500,"[divide and conquer, dp]",PROGRAMMING -674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING -674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING -674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bears and Juice,3000.0,F,1462633500,[combinatorics],PROGRAMMING -674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING -706,Codeforces Round #367 (Div. 2),2,Beru-taxi,500.0,A,1470933300,"[brute force, geometry]",PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Sleuth,500,A,1292601600,[implementation],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Sum,1000,B,1292601600,[math],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Disposition,1500,C,1292601600,"[constructive algorithms, math]",PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Game,2000,D,1292601600,"[brute force, dp, implementation]",PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Common ancestor,2500,E,1292601600,[dp],PROGRAMMING +50,Codeforces Beta Round #47,12,Domino piling,500,A,1292862000,"[greedy, math]",PROGRAMMING +50,Codeforces Beta Round #47,12,Choosing Symbol Pairs,1000,B,1292862000,[strings],PROGRAMMING +50,Codeforces Beta Round #47,12,Happy Farm 5,1500,C,1292862000,[geometry],PROGRAMMING +50,Codeforces Beta Round #47,12,Bombing,2000,D,1292862000,"[binary search, dp, probabilities]",PROGRAMMING +50,Codeforces Beta Round #47,12,Square Equation Roots,2500,E,1292862000,[math],PROGRAMMING +51,Codeforces Beta Round #48,12,Cheaterius's Problem,500,A,1293552000,[implementation],PROGRAMMING +51,Codeforces Beta Round #48,12,bHTML Tables Analisys,1000,B,1293552000,[expression parsing],PROGRAMMING +51,Codeforces Beta Round #48,12,Three Base Stations,1500,C,1293552000,"[binary search, greedy]",PROGRAMMING +51,Codeforces Beta Round #48,12,Geometrical problem,2000,D,1293552000,[implementation],PROGRAMMING +51,Codeforces Beta Round #48,12,Pentagon,2500,E,1293552000,"[combinatorics, graphs, matrices]",PROGRAMMING +51,Codeforces Beta Round #48,12,Caterpillar,3000,F,1293552000,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +52,Codeforces Testing Round #1,12,123-sequence,500,A,1294160400,[implementation],PROGRAMMING +52,Codeforces Testing Round #1,12,Right Triangles,1000,B,1294160400,[combinatorics],PROGRAMMING +52,Codeforces Testing Round #1,12,Circular RMQ,1500,C,1294160400,[data structures],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Autocomplete,500,A,1294329600,[implementation],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Blog Photo,1000,B,1294329600,"[binary search, implementation]",PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Little Frog,1500,C,1294329600,[constructive algorithms],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Physical Education,2000,D,1294329600,[sortings],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Dead Ends,2500,E,1294329600,"[bitmasks, dp]",PROGRAMMING +54,Codeforces Beta Round #50,12,Presents,500,A,1294733700,[implementation],PROGRAMMING +54,Codeforces Beta Round #50,12,Cutting Jigsaw Puzzle,1000,B,1294733700,"[hashing, implementation]",PROGRAMMING +54,Codeforces Beta Round #50,12,First Digit Law,1500,C,1294733700,"[dp, math, probabilities]",PROGRAMMING +54,Codeforces Beta Round #50,12,Writing a Song,2000,D,1294733700,"[brute force, dp]",PROGRAMMING +54,Codeforces Beta Round #50,12,Vacuum Сleaner,2500,E,1294733700,[geometry],PROGRAMMING +55,Codeforces Beta Round #51,12,Flea travel,500,A,1294992000,"[implementation, math]",PROGRAMMING +55,Codeforces Beta Round #51,12,Smallest number,1000,B,1294992000,[brute force],PROGRAMMING +55,Codeforces Beta Round #51,12,Pie or die,1500,C,1294992000,[games],PROGRAMMING +55,Codeforces Beta Round #51,12,Beautiful numbers,2000,D,1294992000,"[dp, number theory]",PROGRAMMING +55,Codeforces Beta Round #51,12,Very simple problem,2500,E,1294992000,"[geometry, two pointers]",PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Bar,500,A,1295626200,[implementation],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Spoilt Permutation,1000,B,1295626200,[implementation],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Corporation Mail,1500,C,1295626200,"[data structures, expression parsing, implementation]",PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Changing a String,2000,D,1295626200,[dp],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Domino Principle,2500,E,1295626200,"[binary search, data structures, sortings]",PROGRAMMING +57,Codeforces Beta Round #53,12,Square Earth?,500,A,1295971200,"[dfs and similar, greedy, implementation]",PROGRAMMING +57,Codeforces Beta Round #53,12,Martian Architecture,1000,B,1295971200,[implementation],PROGRAMMING +57,Codeforces Beta Round #53,12,Array,1500,C,1295971200,"[combinatorics, math]",PROGRAMMING +57,Codeforces Beta Round #53,12,Journey,2000,D,1295971200,"[dp, math]",PROGRAMMING +57,Codeforces Beta Round #53,12,Chess,2500,E,1295971200,"[math, shortest paths]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Chat room,500,A,1296489600,"[greedy, strings]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Coins,1000,B,1296489600,[greedy],PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Trees,1500,C,1296489600,[brute force],PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Calendar,2000,D,1296489600,"[greedy, strings]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Expression,2500,E,1296489600,[dp],PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Word,500,A,1297440000,"[implementation, strings]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Fortune Telling,1000,B,1297440000,"[implementation, number theory]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Title,1500,C,1297440000,[expression parsing],PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Team Arrangement,2000,D,1297440000,"[constructive algorithms, greedy, implementation]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Shortest Path,2500,E,1297440000,"[graphs, shortest paths]",PROGRAMMING +60,Codeforces Beta Round #56,12,Where Are My Flakes?,500,A,1298131200,"[implementation, two pointers]",PROGRAMMING +60,Codeforces Beta Round #56,12,Serial Time!,1000,B,1298131200,"[dfs and similar, dsu]",PROGRAMMING +60,Codeforces Beta Round #56,12,Mushroom Strife,1500,C,1298131200,"[brute force, dfs and similar]",PROGRAMMING +60,Codeforces Beta Round #56,12,Savior,2000,D,1298131200,"[brute force, dsu, math]",PROGRAMMING +60,Codeforces Beta Round #56,12,Mushroom Gnomes,2500,E,1298131200,"[math, matrices]",PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Ultra-Fast Mathematician,500,A,1298390400,[implementation],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Hard Work,1000,B,1298390400,[strings],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Capture Valerian,1500,C,1298390400,[math],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Eternal Victory,2000,D,1298390400,"[dfs and similar, graphs, greedy, shortest paths, trees]",PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Enemy is weak,2500,E,1298390400,"[data structures, trees]",PROGRAMMING +62,Codeforces Beta Round #58,12,A Student's Dream,500,A,1298649600,"[greedy, math]",PROGRAMMING +62,Codeforces Beta Round #58,12,Tyndex.Brome,1000,B,1298649600,"[binary search, implementation]",PROGRAMMING +62,Codeforces Beta Round #58,12,Inquisition,1500,C,1298649600,"[geometry, implementation, sortings]",PROGRAMMING +62,Codeforces Beta Round #58,12,Wormhouse,2000,D,1298649600,"[dfs and similar, graphs]",PROGRAMMING +62,Codeforces Beta Round #58,12,World Evil,2500,E,1298649600,"[dp, flows]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Sinking Ship,500,A,1298908800,"[implementation, sortings, strings]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Settlers' Training,1000,B,1298908800,[implementation],PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Bulls and Cows,1500,C,1298908800,"[brute force, implementation]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Dividing Island,2000,D,1298908800,[constructive algorithms],PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Sweets Game,2500,E,1298908800,"[bitmasks, dfs and similar, dp, games, implementation]",PROGRAMMING +64,Unknown Language Round #1,12,Factorial,,A,1298304000,"[*special, implementation]",PROGRAMMING +64,Unknown Language Round #1,12,Expression,,B,1298304000,"[*special, expression parsing]",PROGRAMMING +64,Unknown Language Round #1,12,Table,,C,1298304000,"[*special, greedy, implementation, math]",PROGRAMMING +64,Unknown Language Round #1,12,Presents,,D,1298304000,"[*special, greedy]",PROGRAMMING +64,Unknown Language Round #1,12,Prime Segment,,E,1298304000,"[*special, brute force]",PROGRAMMING +64,Unknown Language Round #1,12,Domain,,F,1298304000,"[*special, expression parsing]",PROGRAMMING +64,Unknown Language Round #1,12,Path Canonization,,G,1298304000,[*special],PROGRAMMING +64,Unknown Language Round #1,12,Table Bowling,,H,1298304000,"[*special, sortings]",PROGRAMMING +64,Unknown Language Round #1,12,Sort the Table,,I,1298304000,"[*special, sortings]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and Three Spells,500,A,1299340800,"[implementation, math]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the History of Magic,1000,B,1299340800,"[brute force, greedy, implementation]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the Golden Snitch,1500,C,1299340800,"[binary search, geometry]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the Sorting Hat,2000,D,1299340800,"[brute force, dfs and similar, hashing]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and Moving Staircases,2500,E,1299340800,"[dfs and similar, implementation]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Java,500,A,1299513600,"[implementation, strings]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Countryside,1000,B,1299513600,"[brute force, implementation]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and File System,1500,C,1299513600,"[data structures, implementation]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and His Friends,2000,D,1299513600,"[constructive algorithms, math, number theory]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Post,2500,E,1299513600,"[data structures, dp]",PROGRAMMING +67,Manthan 2011,12,Partial Teacher,500,A,1300033800,"[dp, graphs, greedy, implementation]",PROGRAMMING +67,Manthan 2011,12,Restoration of the Permutation,1000,B,1300033800,[greedy],PROGRAMMING +67,Manthan 2011,12,Sequence of Balls,1500,C,1300033800,[dp],PROGRAMMING +67,Manthan 2011,12,Optical Experiment,2000,D,1300033800,"[binary search, data structures, dp]",PROGRAMMING +67,Manthan 2011,12,Save the City!,2500,E,1300033800,[geometry],PROGRAMMING +68,Codeforces Beta Round #62,12,Irrational problem,500,A,1300464000,"[implementation, number theory]",PROGRAMMING +68,Codeforces Beta Round #62,12,Energy exchange,1000,B,1300464000,[binary search],PROGRAMMING +68,Codeforces Beta Round #62,12,Synchrophasotron,1500,C,1300464000,[brute force],PROGRAMMING +68,Codeforces Beta Round #62,12,Half-decay tree,2000,D,1300464000,"[data structures, divide and conquer, dp, probabilities]",PROGRAMMING +68,Codeforces Beta Round #62,12,Contact,2500,E,1300464000,[geometry],PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Young Physicist,500,A,1300809600,"[implementation, math]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Bets,1000,B,1300809600,"[greedy, implementation]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Game,1500,C,1300809600,[implementation],PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Dot,2000,D,1300809600,"[dp, games]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Subsegments,2500,E,1300809600,"[data structures, implementation]",PROGRAMMING +70,Codeforces Beta Round #64,12,Cookies,500,A,1301155200,[math],PROGRAMMING +70,Codeforces Beta Round #64,12,Text Messaging,1000,B,1301155200,"[expression parsing, greedy, strings]",PROGRAMMING +70,Codeforces Beta Round #64,12,Lucky Tickets,1500,C,1301155200,"[binary search, data structures, sortings, two pointers]",PROGRAMMING +70,Codeforces Beta Round #64,12,Professor's task,2000,D,1301155200,"[data structures, geometry]",PROGRAMMING +70,Codeforces Beta Round #64,12,Information Reform,2500,E,1301155200,"[dp, implementation, trees]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Way Too Long Words,500,A,1301410800,[strings],PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Progress Bar,1000,B,1301410800,"[implementation, math]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Round Table Knights,1500,C,1301410800,"[dp, math, number theory]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Solitaire,2000,D,1301410800,"[brute force, implementation]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Nuclear Fusion,2500,E,1301410800,"[bitmasks, dp]",PROGRAMMING +72,Unknown Language Round #2,12,"Goshtasp, Vishtasp and Eidi",,A,1300637400,"[*special, greedy, math]",PROGRAMMING +72,Unknown Language Round #2,12,INI-file,,B,1300637400,"[*special, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,Extraordinarily Nice Numbers,,C,1300637400,"[*special, math]",PROGRAMMING +72,Unknown Language Round #2,12,Perse-script,,D,1300637400,"[*special, expression parsing]",PROGRAMMING +72,Unknown Language Round #2,12,Ali goes shopping,,E,1300637400,"[*special, brute force, strings]",PROGRAMMING +72,Unknown Language Round #2,12,Oil,,F,1300637400,"[*special, greedy, math]",PROGRAMMING +72,Unknown Language Round #2,12,Fibonacci army,,G,1300637400,"[*special, dp]",PROGRAMMING +72,Unknown Language Round #2,12,Reverse It!,,H,1300637400,"[*special, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,Goofy Numbers,,I,1300637400,"[*special, implementation]",PROGRAMMING +73,Codeforces Beta Round #66,12,The Elder Trolls IV: Oblivon,500,A,1302422400,"[greedy, math]",PROGRAMMING +73,Codeforces Beta Round #66,12,Need For Brake,1000,B,1302422400,"[binary search, greedy, sortings]",PROGRAMMING +73,Codeforces Beta Round #66,12,LionAge II,1000,C,1302422400,[dp],PROGRAMMING +73,Codeforces Beta Round #66,12,FreeDiv,1500,D,1302422400,"[dfs and similar, graphs, greedy]",PROGRAMMING +73,Codeforces Beta Round #66,12,Morrowindows,1500,E,1302422400,"[math, number theory]",PROGRAMMING +73,Codeforces Beta Round #66,12,Plane of Tanks,2000,F,1302422400,"[brute force, geometry]",PROGRAMMING +74,Codeforces Beta Round #68,12,Room Leader,500,A,1302879600,[implementation],PROGRAMMING +74,Codeforces Beta Round #68,12,Train,1000,B,1302879600,"[dp, games, greedy]",PROGRAMMING +74,Codeforces Beta Round #68,12,Chessboard Billiard,1500,C,1302879600,"[dfs and similar, dsu, graphs, number theory]",PROGRAMMING +74,Codeforces Beta Round #68,12,Hanger,2000,D,1302879600,[data structures],PROGRAMMING +74,Codeforces Beta Round #68,12,Shift It!,2500,E,1302879600,[constructive algorithms],PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Life Without Zeros,500,A,1302706800,[implementation],PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Facetook Priority Wall,1000,B,1302706800,"[expression parsing, implementation, strings]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Modified GCD,1500,C,1302706800,"[binary search, number theory]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Big Maximum Sum,2000,D,1302706800,"[data structures, dp, greedy, implementation, math, trees]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Ship's Shortest Path,2500,E,1302706800,"[geometry, shortest paths]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Gift,,A,1302609600,"[dsu, graphs, sortings, trees]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Mice,,B,1302609600,"[greedy, two pointers]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Mutation,,C,1302609600,"[bitmasks, dp, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Plus and xor,,D,1302609600,"[dp, greedy, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Points,,E,1302609600,"[implementation, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Tourist,,F,1302609600,"[binary search, data structures, dp]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Heroes,500,A,1303226100,"[brute force, implementation]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Falling Anvils,1000,B,1303226100,"[math, probabilities]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Beavermuncher-0xFF,1500,C,1303226100,"[dfs and similar, dp, dsu, greedy, trees]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Domino Carpet,2000,D,1303226100,"[dp, implementation]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Martian Food,2000,E,1303226100,[geometry],PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Haiku,500,A,1303916400,"[implementation, strings]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Easter Eggs,1000,B,1303916400,"[constructive algorithms, implementation]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Beaver Game,1500,C,1303916400,"[dp, games, number theory]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Archer's Shot,2000,D,1303916400,"[binary search, geometry, math, two pointers]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Evacuation,2500,E,1303916400,"[flows, graphs, shortest paths]",PROGRAMMING +79,Codeforces Beta Round #71,12,Bus Game,500,A,1304175600,[greedy],PROGRAMMING +79,Codeforces Beta Round #71,12,Colorful Field,1000,B,1304175600,"[implementation, sortings]",PROGRAMMING +79,Codeforces Beta Round #71,12,Beaver,1500,C,1304175600,"[data structures, dp, greedy, hashing, strings, two pointers]",PROGRAMMING +79,Codeforces Beta Round #71,12,Password,2000,D,1304175600,"[bitmasks, dp, shortest paths]",PROGRAMMING +79,Codeforces Beta Round #71,12,Security System,2500,E,1304175600,[math],PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Panoramix's Prediction,500,A,1303226100,[brute force],PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Depression,1000,B,1303226100,"[geometry, math]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Heroes,1500,C,1303226100,"[brute force, implementation]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Falling Anvils,2000,D,1303226100,"[geometry, probabilities]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Beavermuncher-0xFF,2500,E,1303226100,[],PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Plug-in,500,A,1304485200,[implementation],PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Sequence Formatting,1000,B,1304485200,"[implementation, strings]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Average Score,1500,C,1304485200,"[math, sortings]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Polycarp's Picture Gallery,2000,D,1304485200,"[constructive algorithms, greedy]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Pairs,2500,E,1304485200,"[dfs and similar, dp, dsu, graphs, implementation, trees]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Double Cola,500,A,1304694000,"[implementation, math]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Sets,1000,B,1304694000,"[constructive algorithms, hashing, implementation]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,General Mobilization,1500,C,1304694000,"[data structures, dfs and similar, sortings]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Two out of Three,2000,D,1304694000,[dp],PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Corridor,2500,E,1304694000,[geometry],PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Magical Array,500,A,1305299400,[math],PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Doctor,1000,B,1305299400,"[binary search, math, sortings]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Track,1500,C,1305299400,"[graphs, greedy, shortest paths]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Numbers,2000,D,1305299400,"[dp, math, number theory]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Two Subsequences,2500,E,1305299400,"[bitmasks, dp]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Toy Army,500,A,1305299400,"[math, number theory]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Magical Array,1000,B,1305299400,"[combinatorics, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Biathlon,1500,C,1305299400,"[binary search, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Doctor,2000,D,1305299400,"[binary search, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Track,2500,E,1305299400,"[brute force, shortest paths]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Domino,500,A,1305903600,"[constructive algorithms, implementation]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Embassy Queue,1000,B,1305903600,[data structures],PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Petya and Tree,1500,C,1305903600,"[binary search, dfs and similar, probabilities, sortings, trees]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Sum of Medians,2000,D,1305903600,"[binary search, brute force, data structures, implementation]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Guard Towers,2500,E,1305903600,"[binary search, dsu, geometry, graphs, sortings]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Reflection,500,A,1306077000,[math],PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Tetris revisited,1000,B,1306077000,"[constructive algorithms, graph matchings, greedy, math]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Genetic engineering,2000,C,1306077000,"[dp, string suffix structures, trees]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Powerful array,2500,D,1306077000,"[data structures, implementation, math, two pointers]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Long sequence,2500,E,1306077000,"[brute force, math, matrices]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Trains,500,A,1307458800,[math],PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Vasya and Types,1000,B,1307458800,"[implementation, strings]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Interesting Game,1500,C,1307458800,"[dp, games]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Beautiful Road,2000,D,1307458800,"[dfs and similar, dp, dsu, implementation, sortings, trees]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Mogohu-Rea Idol,2500,E,1307458800,[geometry],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Chord,500,A,1307458800,"[brute force, implementation]",PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Keyboard,1000,B,1307458800,[implementation],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Trains,1500,C,1307458800,[number theory],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Vasya and Types,2000,D,1307458800,[implementation],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Interesting Game,2500,E,1307458800,[],PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Robbery,500,A,1308236400,[greedy],PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Widget Library,1000,B,1308236400,"[dp, expression parsing, graphs, implementation]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Chip Play,1000,C,1308236400,"[brute force, data structures, implementation]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Space mines,1500,D,1308236400,[geometry],PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Fire and Ice,2500,E,1308236400,[greedy],PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Cableway,500,A,1308236400,"[greedy, math]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,African Crossword,1000,B,1308236400,"[implementation, strings]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Robbery,1500,C,1308236400,"[greedy, math]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Widget Library,2000,D,1308236400,[],PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Chip Play,2000,E,1308236400,[],PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Newspaper Headline,500,A,1308582000,"[greedy, strings]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Queue,1000,B,1308582000,"[binary search, data structures]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Ski Base,1500,C,1308582000,"[combinatorics, dsu, graphs]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Grocer's Problem,2500,D,1308582000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Igloo Skyscraper,2500,E,1308582000,"[data structures, geometry]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Chips,500,A,1308582000,"[implementation, math]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Binary Number,1000,B,1308582000,[greedy],PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Newspaper Headline,1500,C,1308582000,"[binary search, data structures, dp, greedy]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Queue,2000,D,1308582000,"[binary search, data structures, dp]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Ski Base,2500,E,1308582000,"[data structures, dsu, graphs]",PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Frames,500,A,1309446000,[implementation],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,End of Exams,1000,B,1309446000,[greedy],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Azembler,1500,C,1309446000,"[brute force, implementation]",PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Flags,2000,D,1309446000,"[dp, math, matrices]",PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Lostborn,2500,E,1309446000,"[dp, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Restoring Password,500,A,1309446000,"[implementation, strings]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Friends,1000,B,1309446000,"[implementation, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Frames,1500,C,1309446000,[math],PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,End of Exams,2000,D,1309446000,"[greedy, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Azembler,2500,E,1309446000,[brute force],PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Hockey,500,A,1310137200,"[implementation, strings]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Numbers,1000,B,1310137200,"[dp, greedy]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Volleyball,1500,C,1310137200,[shortest paths],PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Horse Races,2000,D,1310137200,"[dp, math]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Country,2500,E,1310137200,"[dp, dsu, graphs]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Football,500,A,1310137200,"[implementation, strings]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Lucky Numbers (easy),1000,B,1310137200,"[binary search, bitmasks, brute force]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Hockey,1500,C,1310137200,"[implementation, strings]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Volleyball,2000,D,1310137200,"[graphs, shortest paths]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Horse Races,2500,E,1310137200,[],PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Domino,500,A,1310731200,"[brute force, implementation]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Superset,1500,B,1310731200,"[constructive algorithms, divide and conquer]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Winning Strategy,2000,C,1310731200,"[binary search, graphs, math, shortest paths]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Robot in Basement,2000,D,1310731200,"[bitmasks, brute force, implementation]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Leaders,2500,E,1310731200,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Victoria the Wise,500,A,1311346800,"[brute force, implementation]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help King,1000,B,1311346800,"[implementation, probabilities, trees]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Greg the Dwarf,1500,C,1311346800,"[geometry, ternary search]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Monks,2000,D,1311346800,[constructive algorithms],PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Shrek and Donkey,2500,E,1311346800,"[dp, games, math, probabilities]",PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Far Away Kingdom,500,A,1311346800,[strings],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Chef Gerasim,1000,B,1311346800,"[implementation, sortings]",PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Victoria the Wise,1500,C,1311346800,[brute force],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help King,2000,D,1311346800,[],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Greg the Dwarf,2500,E,1311346800,"[binary search, geometry, ternary search]",PROGRAMMING +100,Unknown Language Round #3,12,Carpeting the Room,,A,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Friendly Numbers,,B,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,A+B,,C,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,World of Mouth,,D,1312005600,"[*special, strings]",PROGRAMMING +100,Unknown Language Round #3,12,Lamps in a Line,,E,1312005600,"[*special, math]",PROGRAMMING +100,Unknown Language Round #3,12,Polynom,,F,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Name the album,,G,1312005600,"[*special, data structures, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Battleship,,H,1312005600,"[*special, dfs and similar, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Rotation,,I,1312005600,"[*special, geometry, math]",PROGRAMMING +100,Unknown Language Round #3,12,Interval Coloring,,J,1312005600,"[*special, greedy, math]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Homework,500,A,1312390800,[greedy],PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Buses,1000,B,1312390800,"[binary search, data structures, dp]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Vectors,1500,C,1312390800,"[implementation, math]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Castle,2000,D,1312390800,"[dp, greedy, probabilities, sortings, trees]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Candies and Stones,2500,E,1312390800,"[divide and conquer, dp]",PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Clothes,500,A,1312390800,[brute force],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Sum of Digits,1000,B,1312390800,[implementation],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Homework,1500,C,1312390800,[greedy],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Buses,2000,D,1312390800,"[binary search, data structures, dp]",PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Vectors,2500,E,1312390800,[],PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Testing Pants for Sadness,500,A,1312714800,"[greedy, implementation, math]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Cthulhu,1000,B,1312714800,"[dfs and similar, dsu, graphs]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Russian Roulette,1500,C,1312714800,"[constructive algorithms, greedy]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Time to Raid Cowavans,2000,D,1312714800,"[brute force, data structures, sortings]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Buying Sets,2500,E,1312714800,"[flows, graph matchings]",PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Blackjack,500,A,1312714800,[implementation],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Testing Pants for Sadness,1000,B,1312714800,[math],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Cthulhu,1500,C,1312714800,"[dsu, trees]",PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Russian Roulette,2000,D,1312714800,[math],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Time to Raid Cowavans,2500,E,1312714800,[],PROGRAMMING +105,Codeforces Beta Round #81,12,Transmigration,500,A,1313247600,[implementation],PROGRAMMING +105,Codeforces Beta Round #81,12,Dark Assembly,1000,B,1313247600,"[brute force, probabilities]",PROGRAMMING +105,Codeforces Beta Round #81,12,Item World,1500,C,1313247600,"[brute force, implementation, sortings]",PROGRAMMING +105,Codeforces Beta Round #81,12,Entertaining Geodetics,2000,D,1313247600,"[brute force, dsu, implementation]",PROGRAMMING +105,Codeforces Beta Round #81,12,Lift and Throw,2500,E,1313247600,[brute force],PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Card Game,500,A,1313766000,[implementation],PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Choosing Laptop,1000,B,1313766000,"[brute force, implementation]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Buns,1500,C,1313766000,"[chinese remainder theorem, geometry]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Treasure Island,2000,D,1313766000,"[brute force, implementation]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Space Rescuers,2500,E,1313766000,"[geometry, ternary search]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Dorm Water Supply,500,A,1314111600,"[dfs and similar, graphs]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Basketball Team,1000,B,1314111600,"[combinatorics, dp, probabilities]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Arrangement,1500,C,1314111600,"[bitmasks, dp]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Crime Management,2000,D,1314111600,"[dp, matrices]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Darts,2500,E,1314111600,"[geometry, probabilities]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Palindromic Times,500,A,1314111600,"[implementation, strings]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Datatypes,1000,B,1314111600,"[math, sortings]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Dorm Water Supply,1500,C,1314111600,"[dfs and similar, implementation]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Basketball Team,2000,D,1314111600,"[combinatorics, math, probabilities]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Arrangement,2500,E,1314111600,[],PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sum of Digits,500,A,1314633600,"[brute force, implementation]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Probability,1000,B,1314633600,"[brute force, probabilities]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Tree,1500,C,1314633600,"[dp, dsu, trees]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sorting,2000,D,1314633600,"[constructive algorithms, sortings]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Interval,2500,E,1314633600,"[brute force, math]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Nearly Lucky Number,500,A,1314633600,[implementation],PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky String,1000,B,1314633600,"[constructive algorithms, strings]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Sum of Digits,1500,C,1314633600,"[implementation, math]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Probability,2000,D,1314633600,"[brute force, combinatorics, dfs and similar, probabilities]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Tree,2500,E,1314633600,"[combinatorics, dfs and similar, trees]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Inequiations,500,A,1315051200,[greedy],PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Divisors,1000,B,1315051200,"[binary search, data structures, number theory]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Spiders,1500,C,1315051200,"[bitmasks, dp, dsu]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Coloring,2000,D,1315051200,"[combinatorics, dp]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Rectangle,2500,E,1315051200,[],PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Strings,500,A,1315051200,"[implementation, strings]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Square,1000,B,1315051200,"[implementation, math]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Inequiations,1500,C,1315051200,"[greedy, math]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Divisors,2000,D,1315051200,"[implementation, number theory]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Spiders,2500,E,1315051200,"[bitmasks, dp]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Grammar Lessons,500,A,1315494000,"[implementation, strings]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Petr#,1000,B,1315494000,"[brute force, data structures, hashing, strings]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Double Happiness,1500,C,1315494000,"[brute force, number theory]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Museum,2000,D,1315494000,"[matrices, probabilities]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Sleeping,2500,E,1315494000,"[combinatorics, implementation, math]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Cifera,500,A,1315494000,[math],PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,PFAST Inc.,1000,B,1315494000,"[bitmasks, brute force]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Grammar Lessons,1500,C,1315494000,[implementation],PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Petr#,2000,D,1315494000,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Double Happiness,2500,E,1315494000,[number theory],PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Party,500,A,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Lawnmower,1000,B,1316098800,"[greedy, sortings]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Plumber,1500,C,1316098800,[math],PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Unambiguous Arithmetic Expression,2000,D,1316098800,"[dp, expression parsing]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Linear Kingdom Races,2500,E,1316098800,"[data structures, dp]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Tram,500,A,1316098800,[implementation],PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Little Pigs and Wolves,1000,B,1316098800,"[greedy, implementation]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Party,1500,C,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Lawnmower,2000,D,1316098800,"[dp, greedy]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Plumber,2500,E,1316098800,[],PROGRAMMING +117,Codeforces Beta Round #88,12,Elevator,500,A,1316790000,"[implementation, math]",PROGRAMMING +117,Codeforces Beta Round #88,12,Very Interesting Game,1000,B,1316790000,"[brute force, number theory]",PROGRAMMING +117,Codeforces Beta Round #88,12,Cycle,1500,C,1316790000,"[dfs and similar, graphs]",PROGRAMMING +117,Codeforces Beta Round #88,12,Not Quick Transformation,2000,D,1316790000,"[divide and conquer, math]",PROGRAMMING +117,Codeforces Beta Round #88,12,Tree or not Tree,2500,E,1316790000,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,String Task,500,A,1317999600,"[implementation, strings]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Present from Lena,1000,B,1317999600,"[constructive algorithms, implementation]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Fancy Number,1500,C,1317999600,"[brute force, greedy, sortings, strings]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Caesar's Legions,2000,D,1317999600,[dp],PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Bertown roads,2500,E,1317999600,"[dfs and similar, graphs]",PROGRAMMING +119,Codeforces Beta Round #90,12,Epic Game,500,A,1318604400,[implementation],PROGRAMMING +119,Codeforces Beta Round #90,12,Before Exam,1000,B,1318604400,"[constructive algorithms, implementation, sortings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Education Reform,1500,C,1318604400,[dp],PROGRAMMING +119,Codeforces Beta Round #90,12,String Transformation,2000,D,1318604400,"[hashing, strings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Alternative Reality,2500,E,1318604400,[geometry],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Elevator,,A,1318919400,"[brute force, implementation, math]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Quiz League,,B,1318919400,[implementation],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Winnie-the-Pooh and honey,,C,1318919400,"[implementation, math]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Three Sons,,D,1318919400,[brute force],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Put Knight!,,E,1318919400,[games],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Spiders,,F,1318919400,"[dp, greedy, trees]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Boom,,G,1318919400,[implementation],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Brevity is Soul of Wit,,H,1318919400,[graph matchings],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Luck is in Numbers,,I,1318919400,[greedy],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Minimum Sum,,J,1318919400,"[divide and conquer, geometry, sortings]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Sum,500,A,1319727600,[implementation],PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Transformation,1000,B,1319727600,[strings],PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Permutation,1500,C,1319727600,"[brute force, combinatorics, number theory]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Segments,2000,D,1319727600,"[binary search, implementation, two pointers]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Array,2500,E,1319727600,[data structures],PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Division,500,A,1319727600,"[brute force, number theory]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Substring,1000,B,1319727600,"[brute force, implementation]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Sum,1500,C,1319727600,"[brute force, math]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Transformation,2000,D,1319727600,[brute force],PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Permutation,2500,E,1319727600,[],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Prime Permutation,1000,A,1320333000,"[implementation, number theory, strings]",PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Squares,1000,B,1320333000,[math],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Brackets,1500,C,1320333000,"[combinatorics, dp, greedy]",PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,String,2000,D,1320333000,[string suffix structures],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Maze,2500,E,1320333000,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,The number of positions,500,A,1320333000,[math],PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Permutations,1000,B,1320333000,"[brute force, combinatorics, implementation]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Prime Permutation,2000,C,1320333000,"[constructive algorithms, dfs and similar, dsu, greedy, number theory, sortings, strings]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Squares,2000,D,1320333000,"[brute force, constructive algorithms, number theory]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Brackets,2500,E,1320333000,[],PROGRAMMING +125,Codeforces Testing Round #2,12,Measuring Lengths in Baden,1000,A,1319893200,[math],PROGRAMMING +125,Codeforces Testing Round #2,12,Simple XML,1500,B,1319893200,[implementation],PROGRAMMING +125,Codeforces Testing Round #2,12,Hobbits' Party,2000,C,1319893200,"[constructive algorithms, greedy]",PROGRAMMING +125,Codeforces Testing Round #2,12,Two progressions,3000,D,1319893200,"[constructive algorithms, greedy]",PROGRAMMING +125,Codeforces Testing Round #2,12,MST Company,5000,E,1319893200,"[binary search, graphs]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Hot Bath,500,A,1320858000,"[binary search, brute force, math]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Password,1000,B,1320858000,"[binary search, dp, hashing, string suffix structures, strings]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,E-reader Display,1500,C,1320858000,"[constructive algorithms, greedy]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Fibonacci Sums,2000,D,1320858000,"[dp, math]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Pills,2500,E,1320858000,"[brute force, flows]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Wasted Time,500,A,1320858000,[geometry],PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Canvas Frames,1000,B,1320858000,[implementation],PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Hot Bath,1500,C,1320858000,"[binary search, math]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Password,2000,D,1320858000,"[hashing, strings]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,E-reader Display,2500,E,1320858000,[implementation],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Statues,1000,A,1321337400,[dfs and similar],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,String,1500,B,1321337400,"[brute force, constructive algorithms, hashing, string suffix structures, strings]",PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Games with Rectangle,1500,C,1321337400,"[combinatorics, dp]",PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Numbers,2000,D,1321337400,[constructive algorithms],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Birthday,2500,E,1321337400,"[geometry, math]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Cookies,500,A,1321337400,[implementation],PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Students and Shoelaces,1000,B,1321337400,"[brute force, dfs and similar, graphs]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Statues,2000,C,1321337400,"[dfs and similar, graphs, implementation]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,String,2500,D,1321337400,"[implementation, string suffix structures, strings]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Games with Rectangle,2500,E,1321337400,"[combinatorics, dp]",PROGRAMMING +130,Unknown Language Round #4,12,Hexagonal numbers,,A,1321801200,"[*special, implementation]",PROGRAMMING +130,Unknown Language Round #4,12,Gnikool Ssalg,,B,1321801200,"[*special, implementation, strings]",PROGRAMMING +130,Unknown Language Round #4,12,Decimal sum,,C,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Exponentiation,,D,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Tribonacci numbers,,E,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Prime factorization,,F,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,CAPS LOCK ON,,G,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Balanced brackets,,H,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Array sorting,,I,1321801200,"[*special, sortings]",PROGRAMMING +130,Unknown Language Round #4,12,Date calculation,,J,1321801200,[*special],PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,cAPS lOCK,500,A,1322233200,"[implementation, strings]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Opposites Attract,1000,B,1322233200,"[implementation, math]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,The World is a Theatre,1500,C,1322233200,"[combinatorics, math]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Subway,2000,D,1322233200,"[dfs and similar, graphs]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Yet Another Task with Queens,2500,E,1322233200,[sortings],PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Present to Mom,2500,F,1322233200,"[binary search, two pointers]",PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Turing Tape,500,A,1322924400,[implementation],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Piet,1500,B,1322924400,[implementation],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Logo Turtle,1500,C,1322924400,[dp],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Constants in the language of Shakespeare,2000,D,1322924400,"[constructive algorithms, dp, greedy]",PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Bits of merry old England,2500,E,1322924400,[flows],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,HQ9+,500,A,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Unary,1000,B,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Turing Tape,1500,C,1322924400,"[implementation, math]",PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Piet,2500,D,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Logo Turtle,2500,E,1322924400,"[dp, implementation]",PROGRAMMING +134,Codeforces Testing Round #3,12,Average Numbers,500,A,1322838000,"[brute force, implementation]",PROGRAMMING +134,Codeforces Testing Round #3,12,Pairs of Numbers,1000,B,1322838000,"[brute force, dfs and similar, math, number theory]",PROGRAMMING +134,Codeforces Testing Round #3,12,Swaps,1500,C,1322838000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Replacement,500,A,1323443100,"[implementation, sortings]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Rectangle and Square,1000,B,1323443100,"[brute force, geometry, math]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Zero-One,1500,C,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Cycle,2000,D,1323443100,"[brute force, dfs and similar, implementation]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Weak Subsequence,2500,E,1323443100,[combinatorics],PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Presents,500,A,1323443100,[implementation],PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Ternary Logic,1000,B,1323443100,"[implementation, math]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Replacement,1500,C,1323443100,"[implementation, sortings]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Rectangle and Square,2000,D,1323443100,"[geometry, implementation]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Zero-One,2500,E,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Postcards and photos,500,A,1324015200,[implementation],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Permutation,1000,B,1324015200,[greedy],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,History,1500,C,1324015200,[sortings],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Palindromes,2000,D,1324015200,[dp],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Last Chance,2500,E,1324015200,"[data structures, implementation]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Literature Lesson,500,A,1324728000,[implementation],PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Digits Permutations,1000,B,1324728000,[greedy],PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Mushroom Gnomes - 2,2000,C,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,World of Darkraft,2000,D,1324728000,"[dp, games]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Hellish Constraints,2500,E,1324728000,"[brute force, dp, two pointers]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Petr and Book,500,A,1324728000,[implementation],PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Wallpaper,1000,B,1324728000,"[implementation, math]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Literature Lesson,1500,C,1324728000,"[implementation, strings]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Digits Permutations,2000,D,1324728000,[implementation],PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Mushroom Gnomes - 2,3000,E,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING +140,Codeforces Round #100,12,New Year Table,500,A,1325689200,"[geometry, math]",PROGRAMMING +140,Codeforces Round #100,12,New Year Cards,1000,B,1325689200,"[brute force, greedy, implementation]",PROGRAMMING +140,Codeforces Round #100,12,New Year Snowmen,1500,C,1325689200,"[binary search, data structures, greedy]",PROGRAMMING +140,Codeforces Round #100,12,New Year Contest,2000,D,1325689200,"[greedy, sortings]",PROGRAMMING +140,Codeforces Round #100,12,New Year Garland,2500,E,1325689200,"[combinatorics, dp]",PROGRAMMING +140,Codeforces Round #100,12,New Year Snowflake,3000,F,1325689200,"[geometry, sortings]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Amusing Joke,500,A,1326034800,"[implementation, sortings, strings]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Hopscotch,1000,B,1326034800,"[geometry, math]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Queue,2000,C,1326034800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Take-off Ramps,2000,D,1326034800,"[graphs, shortest paths]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Clearing Up,2500,E,1326034800,"[constructive algorithms, dp, dsu, graphs]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Farmer,500,A,1326380700,"[brute force, math]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help General,1000,B,1326380700,"[constructive algorithms, greedy, implementation]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Caretaker,1500,C,1326380700,"[brute force, dp]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Shrek and Donkey 2,2000,D,1326380700,[games],PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Greg the Dwarf 2,2500,E,1326380700,[geometry],PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Vasilisa the Wise 2,500,A,1326380700,"[brute force, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Kingdom of Far Far Away 2,1000,B,1326380700,"[implementation, strings]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Farmer,1500,C,1326380700,"[implementation, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help General,2000,D,1326380700,"[graph matchings, greedy, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Caretaker,2500,E,1326380700,[],PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Arrival of the General,500,A,1326899100,[implementation],PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Meeting,1000,B,1326899100,[implementation],PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Anagram Search,1500,C,1326899100,"[implementation, strings]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Missile Silos,2000,D,1326899100,"[data structures, dfs and similar, graphs, shortest paths]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Competition,2500,E,1326899100,"[data structures, greedy]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Conversion,500,A,1327215600,"[greedy, implementation]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Number 2,1000,B,1327215600,[constructive algorithms],PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Subsequence,1500,C,1327215600,"[combinatorics, dp, math]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Pair,2500,D,1327215600,"[combinatorics, data structures, implementation]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Queries,2500,E,1327215600,[data structures],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Ticket,500,A,1327215600,[implementation],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Mask,1000,B,1327215600,"[brute force, implementation]",PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Conversion,1500,C,1327215600,[greedy],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Number 2,2000,D,1327215600,"[brute force, constructive algorithms, implementation]",PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Subsequence,2500,E,1327215600,"[combinatorics, dp]",PROGRAMMING +147,Codeforces Testing Round #4,12,Punctuation,500,A,1325602800,"[implementation, strings]",PROGRAMMING +147,Codeforces Testing Round #4,12,Smile House,1000,B,1325602800,"[binary search, graphs, matrices]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Insomnia cure,1000,A,1328198400,"[constructive algorithms, implementation, math]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Escape,1000,B,1328198400,"[implementation, math]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Terse princess,1000,C,1328198400,"[constructive algorithms, greedy]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Bag of mice,1000,D,1328198400,"[dp, games, math, probabilities]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Porcelain,1000,E,1328198400,[dp],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Business trip,500,A,1328886000,"[greedy, implementation, sortings]",PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Martian Clock,1000,B,1328886000,[implementation],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Division into Teams,1500,C,1328886000,"[greedy, math, sortings]",PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Coloring Brackets,2500,D,1328886000,[dp],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Martian Strings,2500,E,1328886000,"[string suffix structures, strings]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Win or Freeze,500,A,1329490800,"[games, number theory]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Quantity of Strings,500,B,1329490800,"[combinatorics, dfs and similar, math]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Smart Cheater,1000,C,1329490800,"[data structures, math, probabilities]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Mission Impassable,1500,D,1329490800,[dp],PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Freezing with Style,3000,E,1329490800,"[binary search, data structures, divide and conquer, trees]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Soft Drinking,500,A,1329490800,[implementation],PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Phone Numbers,1000,B,1329490800,"[implementation, strings]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Win or Freeze,1500,C,1329490800,"[games, greedy, number theory]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Quantity of Strings,1500,D,1329490800,"[combinatorics, dsu]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Smart Cheater,3000,E,1329490800,[],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Marks,500,A,1329750000,[implementation],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Steps,1000,B,1329750000,"[binary search, implementation]",PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Pocket Book,1500,C,1329750000,[combinatorics],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Frames,2500,D,1329750000,[brute force],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Garden,2500,E,1329750000,"[bitmasks, dp, graphs, trees]",PROGRAMMING +153,Surprise Language Round #5,12,A + B,,A,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Binary notation,,B,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Caesar Cipher,,C,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Date Change,,D,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Euclidean Distance,,E,1329922800,[*special],PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Hometask,500,A,1330095600,[greedy],PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Colliders,1000,B,1330095600,"[math, number theory]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Double Profiles,1500,C,1330095600,"[graphs, hashing, sortings]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Flatland Fencing,2000,D,1330095600,"[games, math]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Martian Colony,2500,E,1330095600,[geometry],PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,I_love_\%username\%,500,A,1330095600,[brute force],PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Combination,1000,B,1330095600,"[greedy, sortings]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Hometask,1500,C,1330095600,"[dp, greedy]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Colliders,2000,D,1330095600,"[math, number theory]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Double Profiles,2500,E,1330095600,"[hashing, sortings]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Message,500,A,1330536600,[brute force],PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Suspects,1000,B,1330536600,"[constructive algorithms, data structures, implementation]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Cipher,1500,C,1330536600,"[combinatorics, dp]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Clues,2500,D,1330536600,"[combinatorics, graphs]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Mrs. Hudson's Pancakes,2500,E,1330536600,"[brute force, dp]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Game Outcome,500,A,1330536600,[brute force],PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Trace,1000,B,1330536600,"[geometry, sortings]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Message,1500,C,1330536600,"[brute force, dp, strings]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Suspects,2000,D,1330536600,[implementation],PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Cipher,2500,E,1330536600,"[dp, math]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Next Round,500,A,1330804800,[implementation],PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Taxi,1000,B,1330804800,"[greedy, implementation]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Cd and pwd commands,1000,C,1330804800,"[data structures, implementation]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Ice Sculptures,1500,D,1330804800,"[brute force, number theory]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Phone Talks,2000,E,1330804800,"[dp, sortings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Friends or Not,500,A,1331280000,"[*special, greedy, implementation]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Matchmaker,1000,B,1331280000,"[greedy, sortings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,String Manipulation 1.0,1500,C,1331280000,"[binary search, brute force, data structures, strings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Palindrome pairs,2000,D,1331280000,"[*special, brute force, dp, strings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Zebra Tower,2500,E,1331280000,"[data structures, greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Twins,500,A,1331046000,"[greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Unlucky Ticket,1000,B,1331046000,"[greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Find Pair,1500,C,1331046000,"[implementation, math, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Edges in MST,2000,D,1331046000,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Buses and People,2500,E,1331046000,"[binary search, data structures, sortings]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Dress'em in Vests!,1000,A,1331478300,"[binary search, brute force, greedy, two pointers]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Discounts,1000,B,1331478300,"[constructive algorithms, greedy, sortings]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Abracadabra,2000,C,1331478300,[divide and conquer],PROGRAMMING +161,VK Cup 2012 Round 1,12,Distance in Tree,2000,D,1331478300,"[dfs and similar, dp, trees]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Polycarpus the Safecracker,2500,E,1331478300,"[brute force, dp]",PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Pentagonal numbers,,A,1332083400,"[*special, implementation]",PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Binary notation,,B,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Prime factorization,,C,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Remove digits,,D,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,HQ9+,,E,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Factorial zeros,,F,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Non-decimal sum,,G,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Alternating case,,H,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Truncatable primes,,I,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Brackets,,J,1332083400,[*special],PROGRAMMING +163,VK Cup 2012 Round 2,12,Substring and Subsequence,1000,A,1332687900,[dp],PROGRAMMING +163,VK Cup 2012 Round 2,12,Lemmings,1000,B,1332687900,[binary search],PROGRAMMING +163,VK Cup 2012 Round 2,12,Conveyor,1500,C,1332687900,[sortings],PROGRAMMING +163,VK Cup 2012 Round 2,12,Large Refrigerator,2000,D,1332687900,[brute force],PROGRAMMING +163,VK Cup 2012 Round 2,12,e-Government,2500,E,1332687900,"[data structures, dfs and similar, dp, strings, trees]",PROGRAMMING +164,VK Cup 2012 Round 3,12,"Variable, or There and Back Again",500,A,1333897500,"[dfs and similar, graphs]",PROGRAMMING +164,VK Cup 2012 Round 3,12,Ancient Berland Hieroglyphs,1000,B,1333897500,[two pointers],PROGRAMMING +164,VK Cup 2012 Round 3,12,Machine Programming,1500,C,1333897500,[flows],PROGRAMMING +164,VK Cup 2012 Round 3,12,Minimum Diameter,2500,D,1333897500,"[binary search, brute force]",PROGRAMMING +164,VK Cup 2012 Round 3,12,Polycarpus and Tasks,2500,E,1333897500,[],PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Supercentral Point,500,A,1331911800,[implementation],PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Burning Midnight Oil,1000,B,1331911800,"[binary search, implementation]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Another Problem on Strings,1500,C,1331911800,"[binary search, brute force, dp, math, strings, two pointers]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Beard Graph,2000,D,1331911800,"[data structures, dsu, trees]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Compatible Numbers,2500,E,1331911800,"[bitmasks, brute force, dfs and similar, dp]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Rank List,500,A,1332516600,"[binary search, implementation, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Polygons,3000,B,1332516600,"[geometry, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Median,1000,C,1332516600,"[greedy, math, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Shoe Store,3000,D,1332516600,"[dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Tetrahedron,1000,E,1332516600,"[dp, math, matrices]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Trolleybuses,500,A,1332860400,[implementation],PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Huge Prize,1000,B,1332860400,"[dp, probabilities]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Numbers,1500,C,1332860400,"[games, math]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Roads,2000,D,1332860400,"[data structures, divide and conquer, graph matchings]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Bets,2500,E,1332860400,"[math, matrices]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Demonstration,500,A,1332860400,[implementation],PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Minimal Spell,1000,B,1332860400,"[implementation, strings]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Trolleybuses,1500,C,1332860400,"[implementation, math]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Huge Prize,2000,D,1332860400,"[dp, probabilities]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Numbers,2500,E,1332860400,[],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Chores,500,A,1332687900,[sortings],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Replacing Digits,1000,B,1332687900,[greedy],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Substring and Subsequence,1500,C,1332687900,[dp],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Lemmings,2000,D,1332687900,[],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Conveyor,2500,E,1332687900,[],PROGRAMMING +170,VK Cup 2012 Wild-card Round 2,12,Placing Rectangles,,A,1332954000,[*special],PROGRAMMING +171,April Fools Day Contest,12,Mysterious numbers - 1,,A,1333292400,"[*special, constructive algorithms]",PROGRAMMING +171,April Fools Day Contest,12,Star,,B,1333292400,"[*special, combinatorics]",PROGRAMMING +171,April Fools Day Contest,12,A Piece of Cake,,C,1333292400,"[*special, implementation]",PROGRAMMING +171,April Fools Day Contest,12,Broken checker,,D,1333292400,"[*special, brute force]",PROGRAMMING +171,April Fools Day Contest,12,MYSTERIOUS LANGUAGE,,E,1333292400,[*special],PROGRAMMING +171,April Fools Day Contest,12,ucyhf,,F,1333292400,"[*special, brute force, implementation, number theory]",PROGRAMMING +171,April Fools Day Contest,12,Mysterious numbers - 2,,G,1333292400,[*special],PROGRAMMING +171,April Fools Day Contest,12,A polyline,,H,1333292400,"[*special, implementation]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Phone Code,1000,A,1333440000,"[brute force, implementation]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Pseudorandom Sequence Period,1000,B,1333440000,"[implementation, number theory]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Bus,1500,C,1333440000,"[implementation, sortings]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Calendar Reform,1500,D,1333440000,[number theory],PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,BHTML+BCSS,2000,E,1333440000,"[dfs and similar, expression parsing]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Rock-Paper-Scissors,500,A,1333724400,"[implementation, math]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Chamber of Secrets,1000,B,1333724400,"[dfs and similar, shortest paths]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Spiral Maximum,1500,C,1333724400,"[brute force, dp]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Deputies,2000,D,1333724400,"[constructive algorithms, graphs, greedy, implementation]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Camping Groups,2500,E,1333724400,"[data structures, sortings]",PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Problem About Equation,500,A,1333897500,[math],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,File List,1000,B,1333897500,"[dp, greedy, implementation]",PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Range Increments,1500,C,1333897500,"[data structures, greedy]",PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,"Variable, or There and Back Again",2500,D,1333897500,[graphs],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Ancient Berland Hieroglyphs,3000,E,1333897500,[],PROGRAMMING +175,Codeforces Round #115,12,Robot Bicorn Attack,500,A,1334390400,"[brute force, implementation]",PROGRAMMING +175,Codeforces Round #115,12,Plane of Tanks: Pro,500,B,1334390400,[implementation],PROGRAMMING +175,Codeforces Round #115,12,Geometry Horse,1000,C,1334390400,"[greedy, implementation, sortings]",PROGRAMMING +175,Codeforces Round #115,12,Plane of Tanks: Duel,2500,D,1334390400,"[brute force, dp, probabilities]",PROGRAMMING +175,Codeforces Round #115,12,Power Defence,3000,E,1334390400,"[brute force, dp, greedy]",PROGRAMMING +175,Codeforces Round #115,12,Gnomes of Might and Magic,3000,F,1334390400,"[data structures, graphs, implementation, shortest paths]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Trading Business,500,A,1334934300,"[greedy, sortings]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Word Cut,1000,B,1334934300,[dp],PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Playing with Superglue,1500,C,1334934300,"[combinatorics, constructive algorithms]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Hyper String,2000,D,1334934300,[dp],PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Archaeology,2500,E,1334934300,"[data structures, dfs and similar, trees]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,30,A1,1335016800,[implementation],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,70,A2,1335016800,[implementation],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,30,B1,1335016800,[number theory],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,70,B2,1335016800,[number theory],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Party,30,C1,1335016800,"[dfs and similar, dsu, graphs]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Party,70,C2,1335016800,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,30,D1,1335016800,[brute force],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,70,D2,1335016800,[data structures],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Space Voyage,30,E1,1335016800,[binary search],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Space Voyage,70,E2,1335016800,[binary search],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Script Generation,30,F1,1335016800,[],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Script Generation,70,F2,1335016800,[],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,30,G1,1335016800,[strings],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,70,G2,1335016800,"[matrices, strings]",PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,20,A1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,30,A2,1335614400,[greedy],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,50,A3,1335614400,[greedy],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,20,B1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,30,B2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,50,B3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,20,C1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,30,C2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,50,C3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,20,D1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,30,D2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,50,D3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,20,E1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,30,E2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,50,E3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,20,F1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,30,F2,1335614400,"[dp, sortings, strings]",PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,50,F3,1335614400,[],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Defragmentation,,A,1335078000,[implementation],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Divisibility Rules,,B,1335078000,"[math, number theory]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Letter,,C,1335078000,[dp],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Name,,D,1335078000,"[greedy, strings]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Cubes,,E,1335078000,"[binary search, dp, two pointers]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Mathematical Analysis Rocks!,,F,1335078000,"[constructive algorithms, implementation, math]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Series of Crimes,500,A,1334934300,"[brute force, geometry, implementation]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Number of Triplets,1000,B,1334934300,"[binary search, brute force]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Trading Business,1500,C,1334934300,"[games, graph matchings, greedy]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Word Cut,2000,D,1334934300,[dp],PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Playing with Superglue,2500,E,1334934300,[games],PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Battlefield,3000,A,1335280200,"[geometry, graphs, implementation, shortest paths]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Vasya's Calendar,500,B,1335280200,[implementation],PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Optimal Sum,3000,C,1335280200,"[data structures, greedy]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Common Divisors,1000,D,1335280200,"[brute force, hashing, implementation, math, strings]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Wooden Fence,1500,E,1335280200,[dp],PROGRAMMING +183,Croc Champ 2012 - Final,12,Headquarters,500,A,1335532800,"[constructive algorithms, math]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Zoo,1000,B,1335532800,"[brute force, geometry]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Cyclic Coloring,1500,C,1335532800,[dfs and similar],PROGRAMMING +183,Croc Champ 2012 - Final,12,T-shirt,2000,D,1335532800,"[dp, greedy, probabilities]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Candy Shop,2500,E,1335532800,[greedy],PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Plant,500,A,1336145400,[math],PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Mushroom Scientists,1000,B,1336145400,"[math, ternary search]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Clever Fat Rat,1500,C,1336145400,[dp],PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Visit of the Great,2000,D,1336145400,"[math, number theory]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Soap Time! - 2,2500,E,1336145400,"[binary search, data structures]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Comparing Strings,500,A,1336145400,"[implementation, strings]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Growing Mushrooms,1000,B,1336145400,"[greedy, sortings]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Plant,1500,C,1336145400,"[dp, math, matrices, number theory]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Mushroom Scientists,2000,D,1336145400,"[math, number theory, probabilities]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Clever Fat Rat,2500,E,1336145400,[],PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Permutations,500,A,1336663800,[greedy],PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,AlgoRace,1000,B,1336663800,"[dp, shortest paths]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Weak Memory,1500,C,1336663800,"[dfs and similar, dsu]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,BRT Contract ,2000,D,1336663800,[data structures],PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Heaven Tour,2500,E,1336663800,"[data structures, greedy]",PROGRAMMING +188,Surprise Language Round #6,12,Hexagonal Numbers,,A,1337959800,[*special],PROGRAMMING +188,Surprise Language Round #6,12,A + Reverse B,,B,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,LCM,,C,1337959800,"[*special, implementation, math]",PROGRAMMING +188,Surprise Language Round #6,12,Asterisks,,D,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,HQ9+,,E,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Binary Notation,,F,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Array Sorting,,G,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Stack,,H,1337959800,"[*special, expression parsing, implementation]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Cut Ribbon,500,A,1336663800,"[brute force, dp]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Counting Rhombi,1000,B,1336663800,"[brute force, math]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Permutations,1500,C,1336663800,"[greedy, implementation]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,AlgoRace,2000,D,1336663800,"[dp, shortest paths]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Weak Memory,2500,E,1336663800,"[binary search, shortest paths]",PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Vasya and the Bus,500,A,1337182200,"[greedy, math]",PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Surrounded,1000,B,1337182200,[geometry],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,STL,1500,C,1337182200,[dfs and similar],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Non-Secret Cypher,2000,D,1337182200,[two pointers],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Counter Attack,2500,E,1337182200,"[data structures, dsu, graphs, hashing, sortings]",PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Dynasty Puzzles,500,A,1338132600,[dp],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Demonstration,1000,B,1338132600,[greedy],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Fools and Roads,1500,C,1338132600,"[data structures, dfs and similar, trees]",PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Metro Scheme,2000,D,1338132600,"[graphs, greedy]",PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Thwarting Demonstrations,2500,E,1338132600,"[binary search, data structures, trees]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Funky Numbers,500,A,1338132600,"[binary search, brute force, implementation]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Walking in the Rain,1000,B,1338132600,"[brute force, implementation]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Dynasty Puzzles,1500,C,1338132600,[dp],PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Demonstration,2000,D,1338132600,"[brute force, constructive algorithms]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Fools and Roads,2500,E,1338132600,"[data structures, trees]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Cutting Figure,500,A,1338737400,"[2-sat, chinese remainder theorem, trees]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Xor,1000,B,1338737400,[brute force],PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Hamming Distance,2000,C,1338737400,"[constructive algorithms, greedy, math, matrices]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Two Segments,2000,D,1338737400,[data structures],PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Fibonacci Number,2500,E,1338737400,"[brute force, math, matrices]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Exams,500,A,1338737400,"[implementation, math]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Square,1000,B,1338737400,[math],PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Cutting Figure,1500,C,1338737400,"[dfs and similar, graphs, implementation, matrices, strings]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Xor,2000,D,1338737400,[],PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Hamming Distance,3000,E,1338737400,[math],PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Let's Watch Football,500,A,1339342200,"[binary search, brute force, math]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,After Training,1000,B,1339342200,"[data structures, implementation, math]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Try and Catch,1500,C,1339342200,"[expression parsing, implementation]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Analyzing Polyline,2000,D,1339342200,"[math, sortings]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Building Forest,2500,E,1339342200,"[data structures, dsu]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Lexicographically Maximum Subsequence,500,A,1339506000,[greedy],PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Infinite Maze,1000,B,1339506000,[dfs and similar],PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Paint Tree,1500,C,1339506000,"[divide and conquer, geometry, sortings, trees]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,The Next Good String,3000,D,1339506000,"[data structures, greedy, hashing, strings]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Opening Portals,2500,E,1339506000,"[dsu, graphs, shortest paths]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Plate Game,1000,A,1339506000,"[constructive algorithms, games, math]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Limit,500,B,1339506000,[math],PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Lexicographically Maximum Subsequence,500,C,1339506000,"[greedy, implementation, sortings]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Infinite Maze,3000,D,1339506000,[hashing],PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Paint Tree,3000,E,1339506000,"[constructive algorithms, dfs and similar, geometry]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,About Bacteria,500,A,1340379000,"[implementation, math]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Jumping on Walls,1000,B,1340379000,[shortest paths],PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Delivering Carcinogen,1500,C,1340379000,"[binary search, geometry]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Cube Snake,2000,D,1340379000,[constructive algorithms],PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Gripping Story,2500,E,1340379000,"[binary search, data structures, sortings]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Hexadecimal's theorem,500,A,1340379000,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Special Olympics,1000,B,1340379000,[geometry],PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,About Bacteria,1500,C,1340379000,[math],PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Jumping on Walls,2000,D,1340379000,"[dfs and similar, shortest paths]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Delivering Carcinogen,2500,E,1340379000,"[binary search, geometry]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Cinema,3000,A,1340551800,"[brute force, data structures]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Drinks,500,B,1340551800,"[implementation, math]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Football Championship,2000,C,1340551800,"[brute force, implementation]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Programming Language,1500,D,1340551800,"[binary search, brute force, expression parsing, implementation]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Tractor College,3000,E,1340551800,"[implementation, math, number theory, ternary search]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Clear Symmetry,1000,A,1340983800,"[constructive algorithms, dp, math]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Guess That Car!,1000,B,1340983800,"[math, ternary search]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Fragile Bridges,1500,C,1340983800,[dp],PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Brand New Problem,2000,D,1340983800,"[bitmasks, brute force, dp]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Thoroughly Bureaucratic Organization,2500,E,1340983800,"[binary search, combinatorics]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,LLPS,500,A,1340983800,"[binary search, bitmasks, brute force, greedy, implementation, strings]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Brand New Easy Problem,1000,B,1340983800,[brute force],PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Clear Symmetry,2000,C,1340983800,"[binary search, math]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Guess That Car!,2000,D,1340983800,"[dp, math]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Fragile Bridges,2500,E,1340983800,"[data structures, dp]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Two Problems,500,A,1341329400,"[brute force, implementation]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Game on Paper,1000,B,1341329400,"[brute force, implementation]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Photographer,1500,C,1341329400,"[greedy, sortings]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Hit Ball,2000,D,1341329400,"[geometry, implementation, math]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Transportation,2500,E,1341329400,"[greedy, sortings, two pointers]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Interval,500,A,1342020600,"[binary search, combinatorics, dp]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Cards,500,B,1342020600,"[binary search, data structures]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Furik and Rubik,1500,C,1342020600,"[math, probabilities]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Retro Strings,2000,D,1342020600,[dp],PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Strings,2500,E,1342020600,"[data structures, implementation, string suffix structures, two pointers]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Rozdil,500,A,1342020600,"[brute force, implementation]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Sorting,1000,B,1342020600,"[brute force, greedy]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Interval,1500,C,1342020600,"[binary search, brute force, combinatorics, dp, math]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Cards,1500,D,1342020600,"[binary search, brute force, sortings]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Furik and Rubik,2500,E,1342020600,"[brute force, combinatorics, probabilities]",PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,20,A1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,30,A2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,50,A3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,20,B1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,30,B2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,50,B3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,20,C1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,30,C2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,50,C3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D10,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D4,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D5,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D6,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D7,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D8,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10,D9,1341576900,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,20,A1,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,30,A2,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,50,A3,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,20,B1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,30,B2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,50,B3,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,20,C1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,30,C2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,50,C3,1341730800,[data structures],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D10,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D3,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D4,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D5,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D6,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D7,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D8,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10,D9,1341730800,[],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Dubstep,500,A,1343057400,[strings],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Solitaire,2000,B,1343057400,"[dfs and similar, dp]",PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Police Station,2500,C,1343057400,"[dp, graphs, shortest paths]",PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,"Prizes, Prizes, more Prizes",500,D,1343057400,[implementation],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Blood Cousins,3000,E,1343057400,"[binary search, data structures, dfs and similar, trees]",PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Multicolored Marbles,500,A,1342252500,"[dp, math]",PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Pixels,500,B,1342252500,"[constructive algorithms, math]",PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Trails and Glades,1000,C,1342252500,"[constructive algorithms, dsu, graphs, greedy]",PROGRAMMING +211,VK Cup 2012 Finals,12,Privatization,3000,A,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Polycarpus is Looking for Good Substrings,1000,B,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Cowboys,500,C,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Cutting a Fence,1000,D,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,IT Restaurants,500,E,1342335600,[],PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Privatization,3000,A,1342450800,"[flows, graphs]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Polycarpus is Looking for Good Substrings,2000,B,1342450800,"[bitmasks, hashing, implementation]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Cowboys,1500,C,1342450800,"[dp, math]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Cutting a Fence,2500,D,1342450800,"[binary search, data structures, dsu]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,IT Restaurants,500,E,1342450800,"[dfs and similar, dp, trees]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Game,1000,A,1343662200,"[dfs and similar, greedy]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Numbers,1000,B,1343662200,"[combinatorics, dp]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Relay Race,1500,C,1343662200,[dp],PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Stars,2000,D,1343662200,"[constructive algorithms, geometry]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Two Permutations,2500,E,1343662200,"[data structures, hashing, strings]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,System of Equations,500,A,1343662200,[brute force],PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Hometask,1000,B,1343662200,"[brute force, constructive algorithms, greedy, math]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Game,2000,C,1343662200,"[brute force, greedy]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Numbers,2000,D,1343662200,"[combinatorics, dp, math]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Relay Race,2500,E,1343662200,[dp],PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Bicycle Chain,500,A,1344267000,"[brute force, implementation]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Olympic Medal,500,B,1344267000,"[greedy, math]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Crosses,3000,C,1344267000,"[brute force, implementation]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Hot Days,2000,D,1344267000,[greedy],PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Periodical Numbers,3000,E,1344267000,"[combinatorics, dp, number theory]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Tiling with Hexagons,500,A,1344958200,"[implementation, math]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Forming Teams,1500,B,1344958200,"[dfs and similar, implementation]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Hiring Staff,2000,C,1344958200,[greedy],PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Spider's Web,2000,D,1344958200,"[binary search, sortings, two pointers]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Martian Luck,3000,E,1344958200,"[math, number theory]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Ice Skating,500,A,1345273500,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Blackboard Fibonacci,1000,B,1345273500,"[brute force, math]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Formurosa,2500,C,1345273500,"[divide and conquer, dp, expression parsing]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Bitonix' Patrol,3000,D,1345273500,"[bitmasks, brute force, combinatorics, dfs and similar, math]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Alien DNA,3000,E,1345273500,"[data structures, dsu, trees]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Mountain Scenery,500,A,1345273500,"[brute force, constructive algorithms, implementation]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Airport,500,B,1345273500,[implementation],PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Ice Skating,1000,C,1345273500,"[dfs and similar, dsu, graphs]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Blackboard Fibonacci,3000,D,1345273500,[implementation],PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Formurosa,3000,E,1345273500,[],PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,k-String,500,A,1346081400,"[implementation, strings]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Special Offer! Super Price 999 Bourles!,1000,B,1346081400,[implementation],PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Color Stripe,1500,C,1346081400,"[brute force, dp, greedy]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Choosing Capital for Treeland,2000,D,1346081400,"[dfs and similar, dp, trees]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Parking Lot,3000,E,1346081400,[data structures],PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Problem,500,A,1346427000,"[implementation, sortings]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Array,1000,B,1346427000,"[constructive algorithms, data structures]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Shifts,1500,C,1346427000,[data structures],PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Triangle,2000,D,1346427000,"[chinese remainder theorem, geometry, math]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Inversions,2500,E,1346427000,"[data structures, two pointers]",PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Function,500,A,1346427000,"[implementation, math]",PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Numbers,1000,B,1346427000,[implementation],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Problem,1500,C,1346427000,[sortings],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Array,2000,D,1346427000,[data structures],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Shifts,2500,E,1346427000,[],PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Shooshuns and Sequence ,500,A,1347291900,"[brute force, implementation]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Cosmic Tables,1000,B,1347291900,[implementation],PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Reducing Fractions,1500,C,1347291900,"[implementation, number theory, sortings]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Olympiad,2000,D,1347291900,"[binary search, greedy, sortings, two pointers]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Decoding Genome,2500,E,1347291900,[matrices],PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Bracket Sequence,500,A,1347809400,"[data structures, expression parsing, implementation]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Two Strings,1000,B,1347809400,"[data structures, dp, strings]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Partial Sums,1500,C,1347809400,"[combinatorics, math]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Spider,2000,D,1347809400,"[geometry, graphs]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Planar Graph,2500,E,1347809400,"[flows, geometry, graphs]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Parallelepiped,500,A,1347809400,"[brute force, math]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Array,1000,B,1347809400,"[bitmasks, implementation, two pointers]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Bracket Sequence,1500,C,1347809400,[data structures],PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Two Strings,2000,D,1347809400,"[data structures, strings]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Partial Sums,2500,E,1347809400,"[combinatorics, math]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Dice Tower,500,A,1348069500,"[constructive algorithms, greedy]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Well-known Numbers,1000,B,1348069500,"[binary search, greedy, number theory]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Barcode,1500,C,1348069500,"[dp, matrices]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Snake,3000,D,1348069500,"[bitmasks, dfs and similar, graphs, implementation]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Unsolvable,3000,E,1348069500,"[math, number theory]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Flying Saucer Segments,500,A,1348500600,[math],PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Naughty Stone Piles,1000,B,1348500600,[greedy],PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Anniversary,1500,C,1348500600,"[data structures, implementation, math, matrices, number theory]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,The table,2000,D,1348500600,"[constructive algorithms, greedy]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Noble Knight's Path,2500,E,1348500600,"[data structures, trees]",PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Where do I Turn?,500,A,1348500600,[geometry],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Effective Approach,1000,B,1348500600,[implementation],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Flying Saucer Segments,1500,C,1348500600,[math],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Naughty Stone Piles,2000,D,1348500600,"[math, sortings]",PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Anniversary,2500,E,1348500600,"[matrices, number theory]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Is your horseshoe on the other hoof?,500,A,1348759800,[implementation],PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Two Tables,1000,B,1348759800,"[brute force, implementation]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Fractal Detector,1500,C,1348759800,"[dp, hashing]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Zigzag,2000,D,1348759800,[data structures],PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,The Road to Berland is Paved With Good Intentions,2500,E,1348759800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Shifts,500,A,1349105400,"[brute force, two pointers]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Planets,500,B,1349105400,"[binary search, data structures, shortest paths]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Triangles,1000,C,1349105400,"[combinatorics, graphs, math]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Towers,1000,D,1349105400,"[dp, greedy, two pointers]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Gifts,3000,E,1349105400,"[combinatorics, dp, probabilities]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Dragons,500,A,1349105400,"[greedy, sortings]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,T-primes,500,B,1349105400,"[implementation, math, number theory]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Shifts,1500,C,1349105400,"[binary search, data structures, dp, implementation]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Planets,2500,D,1349105400,"[binary search, graphs, shortest paths]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Triangles,3000,E,1349105400,"[combinatorics, graphs, math]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Team,500,A,1349623800,"[brute force, greedy]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,"Magic, Wizardry and Wonders",1000,B,1349623800,"[constructive algorithms, greedy]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,To Add or Not to Add,1500,C,1349623800,"[binary search, sortings, two pointers]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Magic Box,2000,D,1349623800,"[brute force, geometry]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Cactus,2500,E,1349623800,"[data structures, dfs and similar, dp, graphs, trees]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Cycles,500,A,1349969400,"[binary search, constructive algorithms, graphs, greedy]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Table,1000,B,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Doe Graphs,1500,C,1349969400,"[constructive algorithms, divide and conquer, dp, graphs, shortest paths]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Fence,2000,D,1349969400,"[binary search, data structures, string suffix structures]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Quick Tortoise,2500,E,1349969400,"[bitmasks, divide and conquer, dp]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Perfect Permutation,500,A,1349969400,"[implementation, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Non-square Equation,1000,B,1349969400,"[binary search, brute force, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Cycles,1500,C,1349969400,"[combinatorics, graphs, matrices]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Table,2000,D,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Doe Graphs,2500,E,1349969400,[],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Lefthanders and Righthanders ,,A,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Reading,,B,1350370800,[sortings],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Weather,,C,1350370800,"[dp, implementation]",PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Cinema,,D,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Champions' League,,E,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Fence,,F,1350370800,[dp],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Practice,,G,1350370800,"[constructive algorithms, divide and conquer, implementation]",PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Merging Two Decks,,H,1350370800,"[constructive algorithms, greedy]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,LCM Challenge,500,A,1350803400,[number theory],PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Let's Play Osu!,1000,B,1350803400,"[dp, math, probabilities]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Cyclical Quest,1500,C,1350803400,"[string suffix structures, strings]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Graph Game,2000,D,1350803400,[graphs],PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Number Challenge,2500,E,1350803400,"[combinatorics, dp, implementation, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Boy or Girl,500,A,1350803400,[implementation],PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Easy Number Challenge,1000,B,1350803400,"[implementation, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,LCM Challenge,1500,C,1350803400,"[greedy, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Let's Play Osu!,2000,D,1350803400,"[dp, probabilities]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Cyclical Quest,2500,E,1350803400,[],PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Free Cash,500,A,1351179000,[implementation],PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Young Table,1000,B,1351179000,"[implementation, sortings]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Primes on Interval,1500,C,1351179000,"[binary search, number theory, two pointers]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,T-decomposition,2000,D,1351179000,"[dfs and similar, graphs, greedy]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Build String,2500,E,1351179000,"[flows, graphs]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Not Wool Sequences,500,A,1352044800,"[constructive algorithms, math]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Boring Partition,1000,B,1352044800,[constructive algorithms],PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,World Eater Brothers,1500,C,1352044800,"[dfs and similar, dp, greedy, trees]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Tape Programming,2000,D,1352044800,"[data structures, implementation]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Meeting Her,2500,E,1352044800,"[dp, graphs, shortest paths]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Two Bags of Potatoes,500,A,1352044800,"[greedy, implementation, math]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Easy Tape Programming,1000,B,1352044800,"[brute force, implementation]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Not Wool Sequences,1500,C,1352044800,"[combinatorics, constructive algorithms, math]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Boring Partition,2000,D,1352044800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,World Eater Brothers,2500,E,1352044800,[],PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Cinema,,A,1350370800,[implementation],PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Fence,,B,1350370800,[dp],PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Practice,,C,1350370800,"[constructive algorithms, implementation]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Merging Two Decks,,D,1350370800,"[constructive algorithms, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Road Repairs,,E,1350370800,"[dfs and similar, graphs, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,TorCoder,,F,1350370800,[data structures],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Old Peykan,,A,1351783800,[greedy],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Friends,,B,1351783800,"[binary search, bitmasks, data structures, math]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Mirror Box,,C,1351783800,"[geometry, implementation]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Numbers,,D,1351783800,[],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Flights,,E,1351783800,"[graphs, shortest paths]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Race,,F,1351783800,"[brute force, implementation]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Challenging Balloons,,G,1351783800,[constructive algorithms],PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Heads or Tails,500,A,1352647800,"[brute force, implementation]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Big Segment,1000,B,1352647800,"[implementation, sortings]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,King's Path,1500,C,1352647800,"[dfs and similar, hashing, shortest paths]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Dispute,2000,D,1352647800,"[dfs and similar, greedy]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,XOR on Segment,2500,E,1352647800,"[bitmasks, data structures]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,The Brand New Function,500,A,1353079800,[bitmasks],PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Hydra,1000,B,1353079800,"[graphs, sortings]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Colorado Potato Beetle,1500,C,1353079800,"[dfs and similar, implementation]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Cubes,2000,D,1353079800,"[data structures, dp, geometry, two pointers]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Matrix,2500,E,1353079800,[data structures],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Dividing Orange,500,A,1353079800,[implementation],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Undoubtedly Lucky Numbers,1000,B,1353079800,"[bitmasks, brute force, dfs and similar]",PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,The Brand New Function,1500,C,1353079800,"[bitmasks, divide and conquer, math]",PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Hydra,2000,D,1353079800,[],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Colorado Potato Beetle,2500,E,1353079800,[],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,System Administrator,,A,1353339000,[implementation],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Internet Address,,B,1353339000,"[implementation, strings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Game with Coins,,C,1353339000,[greedy],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Restoring Table,,D,1353339000,"[constructive algorithms, greedy]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Mishap in Club,,E,1353339000,[implementation],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Log Stream Analysis,,F,1353339000,"[binary search, brute force, implementation, strings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Suggested Friends,,G,1353339000,"[brute force, graphs]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Queries for Number of Palindromes,,H,1353339000,"[dp, hashing, strings]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Buggy Sorting,500,A,1353511800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Increase and Decrease,1000,B,1353511800,"[greedy, math]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Beauty Pageant,1500,C,1353511800,"[brute force, constructive algorithms, greedy]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Colorful Graph,2000,D,1353511800,"[brute force, dfs and similar, graphs]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Blood Cousins Return,2500,E,1353511800,"[binary search, data structures, dfs and similar, dp, sortings]",PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Paper Work,500,A,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Restoring IPv6,1000,B,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Movie Critics,1500,C,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Building Bridge,1500,D,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Mad Joe,2000,E,1353927300,[],PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Cupboards,500,A,1353857400,[implementation],PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Chilly Willy,1000,B,1353857400,"[math, number theory]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Robo-Footballer,2000,C,1353857400,"[binary search, geometry]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Sweets for Everyone!,2000,D,1353857400,"[binary search, greedy, implementation]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Piglet's Birthday,2500,E,1353857400,"[dp, probabilities]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Robo-Footballer,1000,A,1353857400,[geometry],PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Sweets for Everyone!,1000,B,1353857400,"[binary search, greedy]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Piglet's Birthday,1500,C,1353857400,"[dp, probabilities]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Donkey and Stars,1500,D,1353857400,"[data structures, dp, math, sortings]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Endless Matrix,2500,E,1353857400,[math],PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Paper Work,500,A,1353938400,[greedy],PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Restoring IPv6,1000,B,1353938400,"[implementation, strings]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Movie Critics,1500,C,1353938400,[greedy],PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Building Bridge,1500,D,1353938400,"[geometry, ternary search, two pointers]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Mad Joe,2000,E,1353938400,[brute force],PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Points on Line,500,A,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Playing with Permutations,1000,B,1354807800,"[implementation, math]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Number Transformation,1500,C,1354807800,"[dp, greedy, number theory]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Two Sets,2000,D,1354807800,"[bitmasks, math]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Tree and Table,2500,E,1354807800,"[dfs and similar, dp, implementation, trees]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Little Xor,500,A,1354807800,"[brute force, implementation]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Unsorting Array,1000,B,1354807800,"[brute force, sortings]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Points on Line,1500,C,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Playing with Permutations,2000,D,1354807800,"[brute force, combinatorics, implementation]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Number Transformation,2500,E,1354807800,"[dp, number theory]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Boys and Girls,500,A,1354960800,[greedy],PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Physics Practical,1000,B,1354960800,"[binary search, dp, two pointers]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Text Editor,1500,C,1354960800,"[data structures, dfs and similar, greedy, shortest paths]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Table with Letters - 2,2000,D,1354960800,"[brute force, two pointers]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Printer,2500,E,1354960800,"[binary search, data structures, implementation, sortings]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Cards with Numbers,500,A,1355047200,"[constructive algorithms, sortings]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Jury Size,1000,B,1355047200,"[brute force, implementation]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Anagram,1500,C,1355047200,[greedy],PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Rats,2000,D,1355047200,"[brute force, dfs and similar, implementation]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Dormitory,2500,E,1355047200,"[dp, implementation]",PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Greg's Workout,500,A,1355671800,[implementation],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Code Parsing,1000,B,1355671800,[implementation],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Almost Arithmetical Progression,1500,C,1355671800,"[brute force, dp]",PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Mr. Bender and Square,2000,D,1355671800,"[binary search, implementation, math]",PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Furlo and Rublo and Game,2500,E,1355671800,"[games, implementation, math]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Almost Arithmetical Progression,500,A,1355671800,"[binary search, dp, two pointers]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Mr. Bender and Square,1000,B,1355671800,"[binary search, brute force, math]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Furlo and Rublo and Game,1500,C,1355671800,[games],PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Liars and Serge,2000,D,1355671800,[dp],PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Lucky Arrays,2500,E,1355671800,[data structures],PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Sockets,500,A,1357659000,"[greedy, implementation, sortings]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Playing Cubes,500,B,1357659000,"[games, greedy, implementation]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,View Angle,1500,C,1357659000,"[brute force, geometry, math]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Sum,2000,D,1357659000,"[greedy, math]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Greedy Elevator,3000,E,1357659000,"[data structures, implementation]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Bits,500,A,1356190200,"[greedy, math]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Elections,1000,B,1356190200,"[brute force, combinatorics, dp]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and LCM,1500,C,1356190200,"[binary search, combinatorics, dp, math]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Broken Sorting,2000,D,1356190200,"[dp, math, probabilities]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Tree,2500,E,1356190200,"[data structures, dfs and similar, trees]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Chess,500,A,1356190200,"[brute force, strings]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Magic Square,1000,B,1356190200,"[brute force, implementation]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Bits,1500,C,1356190200,"[greedy, strings]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Elections,2000,D,1356190200,"[brute force, combinatorics, dp, math]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and LCM,2500,E,1356190200,"[binary search, combinatorics, math]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Adding Digits,500,A,1356622500,"[implementation, math]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Ancient Prophesy,1000,B,1356622500,"[brute force, implementation, strings]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Balls and Boxes,1500,C,1356622500,"[greedy, implementation]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Black and White Tree,2000,D,1356622500,"[constructive algorithms, dsu, graphs, greedy, trees]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Dividing Kingdom,2500,E,1356622500,"[binary search, brute force, data structures]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Discounts,500,A,1358091000,"[greedy, sortings]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Restaurant,1000,B,1358091000,"[dp, math, probabilities]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Matrix,1500,C,1358091000,"[constructive algorithms, dp, math]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Increasing Subsequence,2000,D,1358091000,[dp],PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Calculator,2500,E,1358091000,"[brute force, dp, two pointers]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Roma and Lucky Numbers,500,A,1358091000,[implementation],PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Roma and Changing Signs,1000,B,1358091000,[greedy],PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Discounts,1500,C,1358091000,"[greedy, sortings]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Restaurant,2000,D,1358091000,"[combinatorics, dp]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Matrix,2500,E,1358091000,[dp],PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Beautiful Matrix,500,A,1358350200,[implementation],PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Squares,500,B,1358350200,"[greedy, implementation, sortings]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Circle of Numbers,2500,C,1358350200,"[dfs and similar, implementation]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Cycle in Graph,2000,D,1358350200,"[dfs and similar, graphs]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Rhombus,3000,E,1358350200,"[brute force, data structures, dp]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Escape from Stones,500,A,1358686800,"[constructive algorithms, data structures, implementation, two pointers]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Good Sequences,1000,B,1358686800,"[dp, number theory]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Choosing Balls,1500,C,1358686800,[dp],PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Colorful Stones,2000,D,1358686800,"[dp, two pointers]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Roadside Trees,2500,E,1358686800,"[data structures, dp]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Colorful Stones (Simplified Edition),500,A,1358686800,[implementation],PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Roadside Trees (Simplified Edition),1000,B,1358686800,"[greedy, implementation]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Escape from Stones,1500,C,1358686800,"[greedy, implementation]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Good Sequences,2000,D,1358686800,"[dp, number theory]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Choosing Balls,2500,E,1358686800,"[schedules, sortings]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Stones on the Table,500,A,1358868600,[implementation],PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Queue at the School,500,B,1358868600,"[constructive algorithms, graph matchings, implementation, shortest paths]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Below the Diagonal,2500,C,1358868600,"[constructive algorithms, greedy, math]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,BerDonalds,3000,D,1358868600,"[graphs, math, shortest paths]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,More Queries to Array...,3000,E,1358868600,"[data structures, math]",PROGRAMMING +267,Codeforces Testing Round #5,12,Subtractions,500,A,1358002800,"[math, number theory]",PROGRAMMING +267,Codeforces Testing Round #5,12,Dominoes,1000,B,1358002800,"[dfs and similar, graphs]",PROGRAMMING +267,Codeforces Testing Round #5,12,Berland Traffic,1500,C,1358002800,"[math, matrices]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Games,500,A,1359387000,[brute force],PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Buttons,1000,B,1359387000,"[implementation, math]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Beautiful Sets of Points,1500,C,1359387000,"[constructive algorithms, implementation]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Wall Bars,2500,D,1359387000,[dp],PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Playlist,2500,E,1359387000,"[math, probabilities, sortings]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Magical Boxes,500,A,1359732600,"[greedy, math]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Greenhouse Effect,1000,B,1359732600,[dp],PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Flawed Flow,1500,C,1359732600,"[constructive algorithms, flows, graphs]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Maximum Waterfall,2000,D,1359732600,"[data structures, dp]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,String Theory,2500,E,1359732600,[],PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Fancy Fence,500,A,1359732600,"[geometry, implementation, math]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Multithreading,1500,B,1359732600,"[data structures, greedy, implementation]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Magical Boxes,1500,C,1359732600,"[binary search, greedy, implementation, math, sortings]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Greenhouse Effect,2000,D,1359732600,[dp],PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Flawed Flow,2500,E,1359732600,"[dfs and similar, sortings]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Beautiful Year,500,A,1360596600,[brute force],PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Prime Matrix,1000,B,1360596600,"[binary search, brute force, math, number theory]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Secret,1500,C,1360596600,"[constructive algorithms, implementation]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Good Substrings,2000,D,1360596600,"[data structures, strings]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Three Horses,3000,E,1360596600,"[constructive algorithms, math, number theory]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Friends,500,A,1360769400,"[implementation, math]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Sequence,1000,B,1360769400,"[implementation, math]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Staircase,1500,C,1360769400,"[data structures, implementation]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Two Sequences,2000,D,1360769400,"[combinatorics, math, sortings]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Horses,2500,E,1360769400,"[combinatorics, constructive algorithms, graphs]",PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Staircase,500,A,1360769400,[],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Two Sequences,1000,B,1360769400,[combinatorics],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Horses,1500,C,1360769400,"[graphs, greedy]",PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Figure,2000,D,1360769400,[dp],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Game,2500,E,1360769400,"[dp, games]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,k-Multiple Free Set,500,A,1361374200,"[binary search, greedy, sortings]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Zero Tree,1000,B,1361374200,"[dfs and similar, dp, greedy, trees]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,The Last Hole!,1500,C,1361374200,"[brute force, geometry]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Lovely Matrix,2000,D,1361374200,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Mirror Room,2000,E,1361374200,"[data structures, implementation]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Lights Out,500,A,1361374200,[implementation],PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Convex Shape,1000,B,1361374200,"[constructive algorithms, implementation]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,k-Multiple Free Set,1500,C,1361374200,"[binary search, greedy, sortings]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Zero Tree,2000,D,1361374200,"[dfs and similar, dp, trees]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,The Last Hole!,2500,E,1361374200,[],PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Lunch Rush,500,A,1361719800,[implementation],PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Game,1000,B,1361719800,"[games, greedy]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum Sum,1500,C,1361719800,"[data structures, implementation, sortings]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum XOR,2000,D,1361719800,"[bitmasks, dp, greedy, implementation, math]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Problem on Trees,2500,E,1361719800,"[data structures, trees]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Learning Languages,500,A,1362065400,"[dfs and similar, dsu]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Set of Points,1500,B,1362065400,"[constructive algorithms, geometry]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Game,2000,C,1362065400,"[games, implementation]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Google Code Jam,3000,D,1362065400,"[dp, probabilities]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Binary Tree on Plane,2000,E,1362065400,[flows],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Circle Line,500,A,1362065400,[implementation],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,New Problem,1000,B,1362065400,"[brute force, strings]",PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Learning Languages,1000,C,1362065400,[dsu],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Set of Points,3000,D,1362065400,"[constructive algorithms, geometry]",PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Game,3000,E,1362065400,[games],PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Point on Spiral,500,A,1362411000,"[brute force, geometry, implementation]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Books,1000,B,1362411000,"[binary search, brute force, implementation, two pointers]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Ladder,1500,C,1362411000,"[dp, implementation, two pointers]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,The Minimum Number of Variables,2000,D,1362411000,"[bitmasks, dp]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Beautiful Decomposition,2000,E,1362411000,"[games, greedy]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Rectangle Puzzle,500,A,1362929400,[geometry],PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Maximum Xor Secondary,1000,B,1362929400,"[data structures, implementation, two pointers]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Game on Tree,1500,C,1362929400,"[implementation, math, probabilities, trees]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,k-Maximum Subsequence Sum,2000,D,1362929400,"[data structures, flows]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Sequence Transformation,2500,E,1362929400,"[data structures, dp, implementation, math]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Word Capitalization,500,A,1362929400,[strings],PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Nearest Fraction,1000,B,1362929400,"[brute force, implementation, two pointers]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Rectangle Puzzle,1500,C,1362929400,"[geometry, implementation]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Maximum Xor Secondary,2000,D,1362929400,[two pointers],PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Game on Tree,2500,E,1362929400,[math],PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Bit++,500,A,1363188600,[implementation],PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Painting Eggs,1000,B,1363188600,"[greedy, math]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,XOR and OR,1500,C,1363188600,"[constructive algorithms, implementation, math]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Yet Another Number Game,2000,D,1363188600,"[dp, games]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Sausage Maximization,2500,E,1363188600,"[bitmasks, data structures, trees]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cows and Sequence,1000,A,1363534200,"[constructive algorithms, implementation]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cow Program,1000,B,1363534200,"[dfs and similar, dp, graphs]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Coin Troubles,1500,C,1363534200,[dp],PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cows and Cool Sequences,2000,D,1363534200,"[dp, math, number theory]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cow Tennis Tournament,2500,E,1363534200,"[combinatorics, data structures, math]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Primitive Roots,500,A,1363534200,"[implementation, math, number theory]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Poker Game,1000,B,1363534200,"[brute force, implementation]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Sequence,2000,C,1363534200,"[constructive algorithms, data structures, dp]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cow Program,2000,D,1363534200,"[dfs and similar, dp]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Coin Troubles,2500,E,1363534200,"[dfs and similar, dp]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Slightly Decreasing Permutations,500,A,1363879800,"[greedy, implementation]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Find Marble,1000,B,1363879800,[implementation],PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Building Permutation,1500,C,1363879800,"[greedy, implementation, sortings]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Permutation Sum,2000,D,1363879800,"[bitmasks, combinatorics, dp, implementation, meet-in-the-middle]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Positions in Permutations,2500,E,1363879800,"[combinatorics, dp, math]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Lucky Permutation,500,A,1364025600,"[constructive algorithms, math]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Shifting,1500,B,1364025600,[implementation],PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Main Sequence,1500,C,1364025600,"[greedy, implementation]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Tourists,2000,D,1364025600,"[data structures, sortings]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Ladies' Shop,2500,E,1364025600,"[constructive algorithms, fft, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,IQ Test,500,A,1364025600,"[brute force, implementation]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Pipeline,1500,B,1364025600,"[binary search, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Lucky Permutation,1500,C,1364025600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Shifting,2500,D,1364025600,[],PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Main Sequence,2500,E,1364025600,"[data structures, greedy]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Strings,500,A,1364916600,[greedy],PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Houses ,1000,B,1364916600,[combinatorics],PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and XOR operation,1500,C,1364916600,"[implementation, math]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Trees ,2000,D,1364916600,"[combinatorics, dfs and similar, trees]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Lucky Numbers,2500,E,1364916600,"[dp, implementation, math]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Segments ,500,A,1364916600,"[brute force, implementation]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Matrix,1000,B,1364916600,"[brute force, dp, implementation, sortings, ternary search]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Strings,1500,C,1364916600,"[constructive algorithms, implementation]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Houses ,2000,D,1364916600,"[brute force, combinatorics, dfs and similar, math]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and XOR operation,2500,E,1364916600,"[data structures, greedy, implementation, math]",PROGRAMMING +290,April Fools Day Contest 2013,12,Mysterious strings,,A,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,QR code,,B,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,WTF?,,C,1364830200,"[*special, graph matchings, implementation, trees]",PROGRAMMING +290,April Fools Day Contest 2013,12,Orange,,D,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,HQ,,E,1364830200,"[*special, constructive algorithms]",PROGRAMMING +290,April Fools Day Contest 2013,12,Greedy Petya,,F,1364830200,"[*special, dfs and similar, graphs, greedy]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Spyke Talks,500,A,1365796800,"[implementation, sortings]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Command Line Arguments,1000,B,1365796800,"[implementation, strings]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Network Mask,1500,C,1365796800,"[brute force, implementation]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Parallel Programming,2000,D,1365796800,[greedy],PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Tree-String Problem,2500,E,1365796800,"[dfs and similar, hashing, strings]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,SMSC,1000,A,1366040100,[implementation],PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Network Topology,1000,B,1366040100,"[graphs, implementation]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Beautiful IP Addresses,1500,C,1366040100,[brute force],PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Connected Components,2000,D,1366040100,"[data structures, dfs and similar, dp, dsu]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Copying Data,2500,E,1366040100,[data structures],PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Weird Game,500,A,1366644900,"[games, greedy]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Distinct Paths,1500,B,1366644900,"[brute force, combinatorics]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Cube Problem,1500,C,1366644900,"[brute force, math, number theory]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Ksusha and Square,2000,D,1366644900,"[geometry, math, probabilities, two pointers]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Close Vertices,2500,E,1366644900,"[data structures, divide and conquer, trees]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Oskols,500,A,1365348600,"[implementation, math]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Bookshelf,1000,B,1365348600,"[dp, greedy]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Lights,1500,C,1365348600,"[combinatorics, number theory]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Painter Robot,2000,D,1365348600,"[brute force, implementation, number theory]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass the Great,2500,E,1365348600,"[dp, trees]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Array,500,A,1365694200,"[data structures, implementation]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Graph,1000,B,1365694200,"[dp, graphs, shortest paths]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Friends,1500,C,1365694200,"[combinatorics, dp, graphs, shortest paths]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Caves,2000,D,1365694200,"[combinatorics, dp]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Yaroslav and Points,2500,E,1365694200,[data structures],PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Yaroslav and Permutations,500,A,1365694200,"[greedy, math]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Yaroslav and Two Strings,1500,B,1365694200,"[combinatorics, dp]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Array,1500,C,1365694200,"[data structures, dp, implementation]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Graph,2000,D,1365694200,"[dp, graphs]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Friends,2500,E,1365694200,"[combinatorics, dfs and similar, dp]",PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Parity Game,500,A,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Fish Weight,500,B,1366385400,"[constructive algorithms, greedy]",PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Splitting the Uniqueness,2000,C,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Color the Carpet,2500,D,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Mystic Carvings,3000,E,1366385400,[data structures],PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Snow Footprints,500,A,1366385400,"[greedy, implementation]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Sail,500,B,1366385400,"[brute force, greedy, implementation]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Parity Game,1500,C,1366385400,"[combinatorics, constructive algorithms, math, number theory]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Fish Weight,1500,D,1366385400,"[greedy, math, sortings]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Splitting the Uniqueness,3000,E,1366385400,"[constructive algorithms, sortings]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha and Array,500,A,1366644600,"[brute force, number theory, sortings]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha the Squirrel,1000,B,1366644600,"[brute force, implementation]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Weird Game,1500,C,1366644600,"[games, greedy]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Distinct Paths,2500,D,1366644600,[],PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Cube Problem,2500,E,1366644600,[],PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Array,500,A,1366903800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Coach,1000,B,1366903800,"[brute force, dfs and similar]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Beautiful Numbers,2000,C,1366903800,"[brute force, combinatorics]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Painting Square,3000,D,1366903800,"[dp, fft]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Empire Strikes Back,3000,E,1366903800,"[binary search, math]",PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Sequence,500,A,1367769900,[constructive algorithms],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Time,1000,B,1367769900,"[binary search, graphs, shortest paths]",PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Algorithm,1500,C,1367769900,[constructive algorithms],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Divisors,2000,D,1367769900,[data structures],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Arrangements,2500,E,1367769900,[dp],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Eugeny and Array,500,A,1367769900,[implementation],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Eugeny and Play List,1000,B,1367769900,"[binary search, implementation, two pointers]",PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Sequence,1500,C,1367769900,[constructive algorithms],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Time,2000,D,1367769900,"[binary search, dfs and similar, dp, shortest paths]",PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Algorithm,2500,E,1367769900,[],PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Lucky Permutation Triple,500,A,1368363600,"[constructive algorithms, implementation, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Rectangle Puzzle II,500,B,1368363600,"[implementation, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Minimum Modular,2000,C,1368363600,"[brute force, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Rotatable Number,2500,D,1368363600,"[math, number theory]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Random Ranking,3000,E,1368363600,[dp],PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Pythagorean Theorem II,500,A,1368363600,"[brute force, math]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Calendar,1000,B,1368363600,"[brute force, implementation]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Lucky Permutation Triple,1000,C,1368363600,[constructive algorithms],PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Rectangle Puzzle II,2000,D,1368363600,"[math, ternary search]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Minimum Modular,3000,E,1368363600,[math],PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Strange Addition,500,A,1368968400,"[brute force, constructive algorithms]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Continued Fractions,1000,B,1368968400,"[brute force, math]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Ivan and Powers of Two,1500,C,1368968400,[],PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Olya and Graph,2000,D,1368968400,"[combinatorics, math]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Playing with String,2500,E,1368968400,[games],PROGRAMMING +306,Testing Round #6,12,Candies,500,A,1368302400,[implementation],PROGRAMMING +306,Testing Round #6,12,Optimizer,1000,B,1368302400,"[data structures, greedy, sortings]",PROGRAMMING +306,Testing Round #6,12,"White, Black and White Again",1500,C,1368302400,"[combinatorics, number theory]",PROGRAMMING +306,Testing Round #6,12,Polygon,2000,D,1368302400,"[constructive algorithms, geometry]",PROGRAMMING +308,Croc Champ 2013 - Finals,12,Morning run,500,A,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Context Advertising,500,B,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Memory for Arrays,1000,C,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Tennis Rackets,2000,D,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Sheep,2500,E,1368784800,[],PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Morning run,500,A,1368803400,"[binary search, math, two pointers]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Context Advertising,500,B,1368803400,[two pointers],PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Memory for Arrays,1000,C,1368803400,"[binary search, bitmasks, greedy]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Tennis Rackets,2000,D,1368803400,"[brute force, geometry]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Sheep,2500,E,1368803400,"[binary search, greedy]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,The Closest Pair,500,A,1369582200,"[constructive algorithms, implementation]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Cats Transport,1000,B,1369582200,"[data structures, dp]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Fetch the Treasure,1500,C,1369582200,"[brute force, data structures, shortest paths]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Interval Cubing,2000,D,1369582200,"[data structures, math]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Biologist,2500,E,1369582200,[flows],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Whose sentence is it?,500,A,1369582200,[implementation],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Archer,1000,B,1369582200,"[math, probabilities]",PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,The Closest Pair,1500,C,1369582200,[constructive algorithms],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Cats Transport,2000,D,1369582200,[],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Fetch the Treasure,2500,E,1369582200,[],PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Bank Account,500,A,1369927800,"[implementation, number theory]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Queries,1000,B,1369927800,"[dp, implementation]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Matrix,1500,C,1369927800,"[constructive algorithms, greedy, implementation, sortings]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Roads,2500,D,1369927800,[dp],PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Two Numbers,2500,E,1369927800,"[constructive algorithms, data structures, dsu, greedy]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Contest,500,A,1370619000,[implementation],PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Periods,1000,B,1370619000,"[binary search, dfs and similar, strings]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Subsequences,1500,C,1370619000,"[data structures, dp]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Straight Lines,2000,D,1370619000,"[binary search, data structures, geometry, sortings, two pointers]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Squares,2500,E,1370619000,[dp],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Bottles,500,A,1370619000,[brute force],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Array,1000,B,1370619000,[implementation],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Contest,1500,C,1370619000,"[dp, greedy, implementation]",PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Periods,2000,D,1370619000,"[dfs and similar, strings]",PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Subsequences,2500,E,1370619000,"[combinatorics, data structures]",PROGRAMMING +316,ABBYY Cup 3.0,12,Special Task,30,A1,1371042000,[greedy],PROGRAMMING +316,ABBYY Cup 3.0,12,Special Task,70,A2,1371042000,[math],PROGRAMMING +316,ABBYY Cup 3.0,12,EKG,30,B1,1371042000,"[brute force, dfs and similar]",PROGRAMMING +316,ABBYY Cup 3.0,12,EKG,70,B2,1371042000,"[dfs and similar, dp]",PROGRAMMING +316,ABBYY Cup 3.0,12,Tidying Up,30,C1,1371042000,[flows],PROGRAMMING +316,ABBYY Cup 3.0,12,Tidying Up,70,C2,1371042000,"[flows, graph matchings]",PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,30,D1,1371042000,"[brute force, dp]",PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,40,D2,1371042000,[dp],PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,30,D3,1371042000,"[dp, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,30,E1,1371042000,"[brute force, data structures]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,40,E2,1371042000,"[data structures, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,30,E3,1371042000,"[data structures, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,30,F1,1371042000,"[dfs and similar, implementation]",PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,40,F2,1371042000,[],PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,30,F3,1371042000,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,30,G1,1371042000,"[hashing, strings]",PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,40,G2,1371042000,[string suffix structures],PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,30,G3,1371042000,[string suffix structures],PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Perfect Pair,500,A,1371223800,[brute force],PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Ants,1000,B,1371223800,"[brute force, implementation]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Balance,2500,C,1371223800,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Game with Powers,1500,D,1371223800,"[dp, games]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Princess and Her Shadow,3000,E,1371223800,"[constructive algorithms, shortest paths]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Even Odds,500,A,1371223800,[math],PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Strings of Power,500,B,1371223800,"[implementation, strings, two pointers]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Perfect Pair,1000,C,1371223800,"[greedy, math]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Ants,2500,D,1371223800,[dfs and similar],PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Balance,3000,E,1371223800,"[constructive algorithms, dfs and similar]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Malek Dance Club,500,A,1371992400,"[combinatorics, math]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Psychos in a Line,1000,B,1371992400,"[data structures, implementation]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Kalila and Dimna in the Logging Industry,1500,C,1371992400,"[dp, geometry]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Have You Ever Heard About the Word?,2500,D,1371992400,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Ping-Pong,2500,E,1371992400,[data structures],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Magic Numbers,500,A,1371992400,"[brute force, greedy]",PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Ping-Pong (Easy Version),1000,B,1371992400,"[dfs and similar, graphs]",PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Malek Dance Club,1500,C,1371992400,[math],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Psychos in a Line,2000,D,1371992400,[data structures],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Kalila and Dimna in the Logging Industry,2500,E,1371992400,[dp],PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Robot,500,A,1372433400,"[binary search, implementation, math]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Duel,1000,B,1372433400,"[dp, flows, greedy]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel the Commander,1500,C,1372433400,"[constructive algorithms, dfs and similar, divide and conquer, greedy, trees]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Flipboard,2000,D,1372433400,"[dp, greedy, math]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Gondolas,2500,E,1372433400,"[data structures, divide and conquer, dp]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Dancing,500,A,1372433400,[greedy],PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Flowers,1000,B,1372433400,"[combinatorics, math]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Robot,1500,C,1372433400,"[implementation, math, number theory]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Duel,2000,D,1372433400,"[dp, flows, greedy, two pointers]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel the Commander,2500,E,1372433400,[divide and conquer],PROGRAMMING +323,Testing Round #7,12,Black-and-White Cube,500,A,1372363200,"[combinatorics, constructive algorithms]",PROGRAMMING +323,Testing Round #7,12,Tournament-graph,1000,B,1372363200,[constructive algorithms],PROGRAMMING +323,Testing Round #7,12,Two permutations,1500,C,1372363200,[data structures],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,30,A1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,70,A2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,30,B1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,70,B2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20,C1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20,C2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,60,C3,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30,D1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30,D2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,40,D3,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50,E1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50,E2,1374043200,[],PROGRAMMING +325,MemSQL start[c]up Round 1,12,Square and Rectangles,500,A,1373734800,[implementation],PROGRAMMING +325,MemSQL start[c]up Round 1,12,Stadium and Games,1000,B,1373734800,"[binary search, math]",PROGRAMMING +325,MemSQL start[c]up Round 1,12,Monsters and Diamonds,2000,C,1373734800,"[dfs and similar, shortest paths]",PROGRAMMING +325,MemSQL start[c]up Round 1,12,Reclamation,2000,D,1373734800,[dsu],PROGRAMMING +325,MemSQL start[c]up Round 1,12,The Red Button,2500,E,1373734800,"[combinatorics, dfs and similar, dsu, greedy]",PROGRAMMING +326,MemSQL start[c]up Round 2,12,Banana,500,A,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Palindrome,1000,B,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,More Reclamation,1000,C,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Rectangles and Square,2000,D,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Counting Skyscrapers,2500,E,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,"Buy One, Get One Free",3000,F,1375549200,[],PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Flipping Game,500,A,1372941000,"[brute force, dp, implementation]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Hungry Sequence,500,B,1372941000,[math],PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Magic Five,1500,C,1372941000,"[combinatorics, math]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Block Tower,2000,D,1372941000,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Axis Walking,3000,E,1372941000,"[bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle]",PROGRAMMING +328,Testing Round #8,12,IQ Test,500,A,1373662800,[implementation],PROGRAMMING +328,Testing Round #8,12,Sheldon and Ice Pieces,500,B,1373662800,[greedy],PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Purification,500,A,1374327000,"[constructive algorithms, greedy]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Biridian Forest,1000,B,1374327000,"[dfs and similar, shortest paths]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Graph Reconstruction,1500,C,1374327000,[constructive algorithms],PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,The Evil Temple and the Moving Rocks,1500,D,1374327000,[constructive algorithms],PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Evil,2500,E,1374327000,[math],PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Cakeminator,500,A,1374327000,"[brute force, implementation]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Road Construction,1000,B,1374327000,"[constructive algorithms, graphs]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Purification,1500,C,1374327000,[matrices],PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Biridian Forest,2000,D,1374327000,"[dfs and similar, implementation, shortest paths]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Graph Reconstruction,2500,E,1374327000,[],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,30,A1,1374075000,"[brute force, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,70,A2,1374075000,"[data structures, sortings]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,30,B1,1374075000,[implementation],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,70,B2,1374075000,[data structures],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20,C1,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20,C2,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,60,C3,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30,D1,1374075000,"[dfs and similar, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30,D2,1374075000,[graphs],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,40,D3,1374075000,"[data structures, implementation, trees]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50,E1,1374075000,"[constructive algorithms, graphs, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50,E2,1374075000,"[constructive algorithms, dp]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Down the Hatch!,500,A,1374679800,[implementation],PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Maximum Absurdity,1000,B,1374679800,"[data structures, dp, implementation]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Students' Revenge,3000,C,1374679800,"[data structures, greedy, sortings]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Theft of Blueprints,3000,D,1374679800,"[graphs, math]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Binary Key,3000,E,1374679800,"[dp, greedy, implementation]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Secrets,500,A,1374913800,[greedy],PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Chips,1000,B,1374913800,[greedy],PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Lucky Tickets,1500,C,1374913800,"[brute force, constructive algorithms]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Characteristics of Rectangles,2000,D,1374913800,"[binary search, bitmasks, brute force, implementation, sortings]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Summer Earnings,2500,E,1374913800,"[binary search, bitmasks, brute force, geometry, sortings]",PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Candy Bags,500,A,1374913800,[implementation],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Eight Point Sets,1000,B,1374913800,[sortings],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Secrets,1500,C,1374913800,[math],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Chips,2000,D,1374913800,"[greedy, implementation, two pointers]",PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Lucky Tickets,2500,E,1374913800,[],PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Banana,500,A,1375549200,"[binary search, constructive algorithms, greedy]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Palindrome,1000,B,1375549200,"[constructive algorithms, dp]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,More Reclamation,1000,C,1375549200,[games],PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Rectangles and Square,2000,D,1375549200,"[brute force, dp]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Counting Skyscrapers,2500,E,1375549200,"[dp, math, probabilities]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,"Buy One, Get One Free",3000,F,1375549200,"[dp, greedy]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Triangle,500,A,1376062200,"[implementation, math]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Fly,1000,B,1376062200,[math],PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Sequence,1500,C,1376062200,"[brute force, greedy, implementation, number theory]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Beautiful Strings,2000,D,1376062200,"[combinatorics, math]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Painting Square,2500,E,1376062200,"[bitmasks, combinatorics, dp, implementation]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Puzzles,500,A,1376668800,"[dp, graph matchings, greedy]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Routine Problem,1000,B,1376668800,"[greedy, math, number theory]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Quiz,1500,C,1376668800,"[binary search, greedy, math, matrices, number theory]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Book of Evil,2000,D,1376668800,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Divisor Tree,2500,E,1376668800,"[brute force, number theory, trees]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Quiz,500,A,1376668800,"[greedy, math, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Book of Evil,1000,B,1376668800,"[dfs and similar, dp, trees]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Divisor Tree,1500,C,1376668800,"[brute force, dp, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,GCD Table,2000,D,1376668800,"[chinese remainder theorem, math, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Optimize!,2500,E,1376668800,[data structures],PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Helpful Maths,500,A,1377531000,"[greedy, implementation, sortings, strings]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Ringroad,1000,B,1377531000,[implementation],PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Weights,1500,C,1377531000,"[constructive algorithms, dfs and similar, dp, greedy]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Bit Operations,2000,D,1377531000,"[data structures, trees]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Three Swaps,3000,E,1377531000,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,The Wall,500,A,1377876600,[math],PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Maximal Area Quadrilateral,3000,B,1377876600,"[brute force, geometry]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Tourist Problem,2000,C,1377876600,"[combinatorics, implementation, math]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Bubble Sort Graph,2000,D,1377876600,"[binary search, data structures, dp]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Iahub and Permutations,3000,E,1377876600,"[combinatorics, math]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Tourist Problem,500,A,1377876600,[math],PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Bubble Sort Graph,500,B,1377876600,"[binary search, data structures, dp]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Iahub and Permutations,1000,C,1377876600,"[combinatorics, dp, math]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Iahub and Xors,2500,D,1377876600,[data structures],PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Candies Game,3000,E,1377876600,"[constructive algorithms, greedy]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Divisors,500,A,1378540800,"[greedy, implementation]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Spies,1000,B,1378540800,"[brute force, greedy, implementation]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Cupboard and Balloons,1500,C,1378540800,[geometry],PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Dominoes,2000,D,1378540800,"[bitmasks, dfs and similar, dp]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Tree,2500,E,1378540800,"[data structures, divide and conquer, trees]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Rational Resistance,500,A,1379172600,"[math, number theory]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Alternating Current,1000,B,1379172600,"[data structures, greedy, implementation]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Read Time,1500,C,1379172600,"[binary search, greedy, two pointers]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Water Tree,2000,D,1379172600,"[data structures, dfs and similar, trees]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Pumping Stations,2500,E,1379172600,"[brute force, dfs and similar, divide and conquer, flows, greedy]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Magnets,500,A,1379172600,[implementation],PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Simple Molecules,1000,B,1379172600,"[brute force, math]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Rational Resistance,1500,C,1379172600,[math],PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Alternating Current,2000,D,1379172600,"[data structures, greedy, implementation]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Read Time,2500,E,1379172600,"[binary search, two pointers]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Expecting Trouble,,A,1379086800,"[*special, probabilities]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Triskaidekaphobia,,B,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Counting Fridays,,C,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Chain Letter,,D,1379086800,"[*special, dfs and similar, graphs]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Black Cat Rush,,E,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Superstitions Inspection,,F,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Suffix Subgroup,,G,1379086800,"[*special, strings]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Alice and Bob,500,A,1379691000,"[games, math, number theory]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Lucky Common Subsequence,1000,B,1379691000,"[dp, strings]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Number Transformation II,1500,C,1379691000,"[greedy, math]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Robot Control,2000,D,1379691000,[shortest paths],PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Doodle Jump,2500,E,1379691000,[math],PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Difference Row,500,A,1379691000,"[implementation, sortings]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Fixed Points,1000,B,1379691000,"[implementation, math]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Alice and Bob,1500,C,1379691000,"[games, math, number theory]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Lucky Common Subsequence,2000,D,1379691000,"[dp, strings]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Number Transformation II,2500,E,1379691000,"[dp, greedy, number theory]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Mafia,500,A,1380295800,"[binary search, math, sortings]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Apple Tree,1000,B,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Subset Sums,1500,C,1380295800,"[brute force, data structures]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Turtles,2000,D,1380295800,"[dp, matrices]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Pilgrims,2500,E,1380295800,"[dfs and similar, dp, trees]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Cinema Line,500,A,1380295800,"[greedy, implementation]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Color the Fence,1000,B,1380295800,"[data structures, dp, greedy]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Mafia,1500,C,1380295800,[implementation],PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Apple Tree,2000,D,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Subset Sums,2500,E,1380295800,[],PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,TL,500,A,1380641400,"[brute force, greedy, implementation]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Resort,1000,B,1380641400,[brute force],PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Bombs,1000,C,1380641400,"[greedy, implementation, sortings]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Looking for Owls,3000,D,1380641400,"[binary search, geometry, hashing, sortings]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Wrong Floyd,3000,E,1380641400,"[brute force, constructive algorithms, dfs and similar, graphs]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Rounding,1000,A,1380900600,"[dp, greedy, implementation, math]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Furik,1000,B,1380900600,"[combinatorics, dp, probabilities]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Brackets,1500,C,1380900600,"[dp, matrices]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Removing Periods,2000,D,1380900600,[data structures],PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Permutation,2000,E,1380900600,[greedy],PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Digits,500,A,1380900600,"[brute force, implementation, math]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Periods,1000,B,1380900600,"[implementation, sortings]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Rounding,1500,C,1380900600,"[dp, greedy, implementation]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Furik,2000,D,1380900600,[math],PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Brackets,2500,E,1380900600,[],PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Domino,500,A,1381419000,"[implementation, math]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Two Heaps,1500,B,1381419000,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Find Maximum,1000,C,1381419000,"[implementation, math, number theory]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Queue,2500,D,1381419000,[constructive algorithms],PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Antichain,3000,E,1381419000,"[dp, graph matchings, greedy]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Vasya and Robot,500,A,1381678200,"[brute force, greedy, math]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Game with Strings,1000,B,1381678200,"[bitmasks, dp, games]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Vasya and Beautiful Arrays,1500,C,1381678200,"[brute force, dp, number theory]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Transferring Pyramid,2000,D,1381678200,[dp],PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Lucky Number Representation,2500,E,1381678200,"[constructive algorithms, dfs and similar, dp]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Digital Root,500,A,1381678200,"[constructive algorithms, implementation]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Public Transport,1000,B,1381678200,"[greedy, implementation]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Robot,1500,C,1381678200,"[brute force, dp]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Game with Strings,2000,D,1381678200,[],PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Beautiful Arrays,2500,E,1381678200,"[binary search, brute force, data structures]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Knight Tournament,500,A,1381838400,"[data structures, dsu]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Xenia and Hamming,1000,B,1381838400,"[implementation, math]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Compartments,1500,C,1381838400,"[combinatorics, constructive algorithms, greedy, implementation]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Bags and Coins,2000,D,1381838400,"[bitmasks, constructive algorithms, dp, greedy]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Xenia and String Problem,2500,E,1381838400,"[dp, hashing, implementation, string suffix structures, strings]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Group of Students,500,A,1381838400,"[brute force, greedy, implementation]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Flag Day,1000,B,1381838400,"[constructive algorithms, implementation]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Knight Tournament,1500,C,1381838400,[data structures],PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Xenia and Hamming,2000,D,1381838400,[number theory],PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Compartments,2500,E,1381838400,[],PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Continuous Line,500,A,1382715000,"[brute force, implementation]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Text Messages,1000,B,1382715000,"[brute force, strings]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Containers,1500,C,1382715000,"[constructive algorithms, greedy, implementation]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Hares,2000,D,1382715000,"[dp, greedy]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Kicks,3000,E,1382715000,"[brute force, dsu, graphs, implementation]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Table,500,A,1383379200,"[greedy, implementation]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Permutation,1000,B,1383379200,"[constructive algorithms, dp, math]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Prime Number,1500,C,1383379200,[math],PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Pair of Numbers,2500,D,1383379200,"[binary search, brute force, data structures, math, two pointers]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Neatness,2500,E,1383379200,[dfs and similar],PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Array Recovery,500,A,1384102800,"[greedy, implementation]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Array,1000,B,1384102800,"[binary search, dp]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Strings,1500,C,1384102800,"[combinatorics, dp]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Sets,1500,D,1384102800,[number theory],PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Game,2000,E,1384102800,"[graphs, greedy, shortest paths]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Table,500,A,1384102800,"[constructive algorithms, implementation]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Permutation,1000,B,1384102800,"[constructive algorithms, math, number theory]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Array Recovery,1500,C,1384102800,"[brute force, constructive algorithms, greedy]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Array,2000,D,1384102800,"[binary search, dp]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Strings,2500,E,1384102800,[],PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Two Semiknights Meet,1000,A,1384443000,"[greedy, math]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Petya and Staircases,500,B,1384443000,"[implementation, sortings]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Insertion Sort,2500,C,1384443000,"[data structures, dp, implementation, math]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Fools and Foolproof Roads,3000,D,1384443000,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Petya and Pipes,3000,E,1384443000,"[flows, graphs, shortest paths]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Soroban,500,A,1384156800,[implementation],PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Fence,1000,B,1384156800,"[brute force, dp]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Fixing Typos,1500,C,1384156800,"[greedy, implementation]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Renting Bikes,2000,D,1384156800,"[binary search, greedy]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Two Circles,2500,E,1384156800,"[brute force, data structures, implementation]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Matrix,500,A,1384875000,"[combinatorics, data structures, implementation]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Free Market,1000,B,1384875000,"[dp, greedy]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Beautiful Set,1500,C,1384875000,"[brute force, number theory]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Ghd,2000,D,1384875000,"[brute force, math, probabilities]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Empty Rectangles,2500,E,1384875000,"[divide and conquer, two pointers]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Good Number,500,A,1384875000,[implementation],PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,The Fibonacci Segment,1000,B,1384875000,[implementation],PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Matrix,1500,C,1384875000,"[brute force, combinatorics, math, matrices]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Free Market,2000,D,1384875000,"[dp, greedy]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Beautiful Set,2500,E,1384875000,"[brute force, number theory]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Guards,500,A,1385307000,[implementation],PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and To-do List,1000,B,1385307000,"[brute force, implementation]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Salad,1500,C,1385307000,[dp],PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Trap Graph,2000,D,1385307000,"[binary search, data structures, dfs and similar, dsu, shortest paths, two pointers]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Magic Guitar,2500,E,1385307000,"[brute force, implementation, math]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Algorithm ,500,A,1385479800,"[data structures, implementation]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja ans Anagrams,1000,B,1385479800,"[binary search, data structures]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and the Arrangement of Numbers,1500,C,1385479800,"[graphs, greedy, sortings]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Sets,2000,D,1385479800,"[bitmasks, dfs and similar]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Intervals,2000,E,1385479800,"[combinatorics, dp]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Coat Rack,500,A,1385479800,[implementation],PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Suffixes,1000,B,1385479800,"[data structures, dp]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Algorithm ,1500,C,1385479800,"[brute force, implementation]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja ans Anagrams,2000,D,1385479800,"[data structures, two pointers]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and the Arrangement of Numbers,2500,E,1385479800,"[combinatorics, graphs, implementation]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Plates,500,A,1385739000,[implementation],PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Contest,1000,B,1385739000,"[constructive algorithms, implementation, math]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Elections,1500,C,1385739000,"[dfs and similar, graphs, trees]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Fools,2000,D,1385739000,"[dfs and similar, dp, shortest paths]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Queries,2500,E,1385739000,"[binary search, data structures]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,"Rook, Bishop and King",500,A,1386399600,[math],PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Berland Bingo,500,B,1386399600,[implementation],PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Mittens,1500,C,1386399600,"[constructive algorithms, greedy, sortings]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Broken Monitor,3000,D,1386399600,"[brute force, constructive algorithms, implementation]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Summer Reading,3000,E,1386399600,"[dp, greedy]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,K-Periodic Array,500,A,1386493200,"[implementation, math]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Fox Dividing Cheese,1000,B,1386493200,"[math, number theory]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Hamburgers,1500,C,1386493200,"[binary search, brute force]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Vessels,2000,D,1386493200,"[data structures, dsu, implementation, trees]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Subway Innovation,2500,E,1386493200,"[math, two pointers]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Counting Kangaroos is Fun,500,A,1386943200,"[binary search, greedy, sortings, two pointers]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Counting Rectangles is Fun,1000,B,1386943200,"[brute force, divide and conquer, dp]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Watching Fireworks is Fun,1500,C,1386943200,"[data structures, dp, math]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Choosing Subtree is Fun,2000,D,1386943200,"[binary search, data structures, dfs and similar, trees, two pointers]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Drawing Circles is Fun,2500,E,1386943200,"[combinatorics, geometry]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Collecting Beats is Fun,500,A,1386943200,[implementation],PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Making Sequences is Fun,1000,B,1386943200,"[binary search, implementation, math]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Counting Kangaroos is Fun,1500,C,1386943200,"[greedy, sortings, two pointers]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Counting Rectangles is Fun,2000,D,1386943200,[],PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Watching Fireworks is Fun,2500,E,1386943200,[dp],PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Pink Pony,500,A,1387380600,"[greedy, implementation]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Nine,1000,B,1387380600,"[combinatorics, greedy]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Dima,1500,C,1387380600,"[dfs and similar, dp, graphs, implementation]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Sequence ,2000,D,1387380600,"[binary search, data structures, dp, trees]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Babies,2500,E,1387380600,"[binary search, data structures, dsu, geometry, implementation]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Divisible by Seven,500,A,1387893600,"[math, number theory]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Maximum Submatrix 2,1000,B,1387893600,"[data structures, dp, implementation, sortings]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Circling Round Treasures,1500,C,1387893600,"[bitmasks, shortest paths]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Tree and Queries,2000,D,1387893600,"[data structures, dfs and similar, trees]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Red and Black Tree,2500,E,1387893600,"[dp, implementation, math]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Lever,500,A,1387893600,"[implementation, math]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,I.O.U.,1000,B,1387893600,[implementation],PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Divisible by Seven,1500,C,1387893600,"[math, number theory]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Maximum Submatrix 2,2000,D,1387893600,"[dp, implementation, sortings]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Circling Round Treasures,2500,E,1387893600,"[bitmasks, shortest paths]",PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Maze,500,A,1388331000,[dfs and similar],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Preparing for the Contest,1000,B,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Captains Mode,1000,C,1388331000,"[bitmasks, dp, games]",PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Developing Game,2000,D,1388331000,[data structures],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Cookie Clicker,2500,E,1388331000,"[dp, geometry]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Playing with Dice,500,A,1388331000,[brute force],PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Semifinals,1000,B,1388331000,"[implementation, sortings]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Maze,1500,C,1388331000,[dfs and similar],PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Preparing for the Contest,2000,D,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Captains Mode,2000,E,1388331000,"[bitmasks, brute force, dp, greedy]",PROGRAMMING +379,Good Bye 2013,12,New Year Candles,500,A,1388417400,[implementation],PROGRAMMING +379,Good Bye 2013,12,New Year Present,1000,B,1388417400,"[constructive algorithms, implementation]",PROGRAMMING +379,Good Bye 2013,12,New Year Ratings Change,1500,C,1388417400,"[greedy, sortings]",PROGRAMMING +379,Good Bye 2013,12,New Year Letter,2000,D,1388417400,"[bitmasks, brute force, dp]",PROGRAMMING +379,Good Bye 2013,12,New Year Tree Decorations,2500,E,1388417400,"[geometry, schedules, sortings]",PROGRAMMING +379,Good Bye 2013,12,New Year Tree,3000,F,1388417400,"[data structures, divide and conquer, trees]",PROGRAMMING +379,Good Bye 2013,12,New Year Cactus,3500,G,1388417400,[dp],PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Prefixes,500,A,1389540600,"[binary search, brute force]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Tree,1000,B,1389540600,"[graphs, implementation]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Brackets,1500,C,1389540600,"[data structures, schedules]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Cinema,2000,D,1389540600,"[combinatorics, math]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Dividing,2500,E,1389540600,[data structures],PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Dima,500,A,1389540600,"[greedy, implementation, two pointers]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Stairs,1000,B,1389540600,"[greedy, implementation, sortings]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Prefixes,1500,C,1389540600,"[binary search, implementation, two pointers]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Tree,2000,D,1389540600,[brute force],PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Brackets,2500,E,1389540600,[data structures],PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Pan Scales,500,A,1389972600,"[greedy, implementation]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Number Busters,2500,B,1389972600,"[binary search, math]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Arithmetic Progression,1500,C,1389972600,"[implementation, sortings]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Pawns,3000,D,1389972600,"[dfs and similar, graphs, implementation, trees]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Combinatorics,3000,E,1389972600,"[combinatorics, dp]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Milking cows,500,A,1390231800,"[data structures, greedy]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Volcanoes,1500,B,1390231800,"[binary search, implementation, sortings, two pointers]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Propagating tree,1500,C,1390231800,"[data structures, dfs and similar, trees]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Antimatter,2000,D,1390231800,[dp],PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Vowels,2500,E,1390231800,"[combinatorics, divide and conquer, dp]",PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Coder,500,A,1390231800,[implementation],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Multitasking,1000,B,1390231800,"[greedy, implementation, sortings, two pointers]",PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Milking cows,1500,C,1390231800,[greedy],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Volcanoes,2500,D,1390231800,[implementation],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Propagating tree,2500,E,1390231800,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Raspberry,500,A,1390577700,"[brute force, greedy, implementation]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Strings,1000,B,1390577700,"[brute force, greedy, implementation, math, strings]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Prime Numbers,1500,C,1390577700,"[binary search, brute force, data structures, dp, implementation, math, number theory]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Floodlight,2000,D,1390577700,"[bitmasks, dp, geometry]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear in the Field,2500,E,1390577700,"[math, matrices]",PROGRAMMING +386,Testing Round #9,12,Second-Price Auction,500,A,1389906900,[implementation],PROGRAMMING +386,Testing Round #9,12,"Fly, freebies, fly!",1000,B,1389906900,"[binary search, brute force, implementation]",PROGRAMMING +386,Testing Round #9,12,Diverse Substrings,1500,C,1389906900,"[dp, two pointers]",PROGRAMMING +386,Testing Round #9,12,Game with Points,2000,D,1389906900,"[dp, graphs, implementation, shortest paths]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Sleep,500,A,1391095800,[implementation],PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Round,1000,B,1391095800,"[brute force, greedy, two pointers]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Number,1500,C,1391095800,"[greedy, implementation]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Interesting Graph,2000,D,1391095800,[graph matchings],PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Cards,2500,E,1391095800,"[binary search, data structures]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Box Accumulation,500,A,1391442000,"[greedy, sortings]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Minimal path,1000,B,1391442000,"[bitmasks, constructive algorithms, graphs, implementation, math]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Card Game,1500,C,1391442000,"[games, greedy, sortings]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Perfect Sets,2000,D,1391442000,[math],PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Meteor Shower,2500,E,1391442000,[geometry],PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Number Game,500,A,1391442000,"[greedy, math]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Cross,1000,B,1391442000,"[greedy, implementation]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Box Accumulation,1500,C,1391442000,"[binary search, dp, greedy]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Minimal path,2000,D,1391442000,"[constructive algorithms, graphs, implementation, shortest paths]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Card Game,2500,E,1391442000,"[greedy, implementation]",PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Alarm Clock,500,A,1392132600,[implementation],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,"Inna, Dima and Song",1000,B,1392132600,[implementation],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Candy Boxes,1500,C,1392132600,[data structures],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Sweet Matrix,2000,D,1392132600,[constructive algorithms],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Large Sweet Matrix,2500,E,1392132600,[],PROGRAMMING +391,Rockethon 2014,12,Genetic Engineering,3,A,1392573600,"[implementation, two pointers]",PROGRAMMING +391,Rockethon 2014,12,Word Folding,5,B,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,The Tournament,4,C1,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,The Tournament,4,C2,1392573600,[greedy],PROGRAMMING +391,Rockethon 2014,12,The Tournament,8,C3,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Supercollider,3,D1,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,Supercollider,16,D2,1392573600,[data structures],PROGRAMMING +391,Rockethon 2014,12,Three Trees,11,E1,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Three Trees,13,E2,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,8,F1,1392573600,[dp],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,15,F2,1392573600,[greedy],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,10,F3,1392573600,[],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Blocked Points,500,A,1392728400,[math],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Tower of Hanoi,1000,B,1392728400,[dp],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Yet Another Number Sequence,1500,C,1392728400,"[combinatorics, math, matrices]",PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Three Arrays,2000,D,1392728400,[data structures],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Deleting Substrings,2500,E,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Nineteen,500,A,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Three matrices,1000,B,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Blocked Points,1500,C,1392728400,[geometry],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Tower of Hanoi,2000,D,1392728400,[dp],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Yet Another Number Sequence,2500,E,1392728400,[],PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Counting Sticks,500,A,1392910200,[implementation],PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Very Beautiful Number,1000,B,1392910200,[],PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Dominoes,1500,C,1392910200,"[constructive algorithms, greedy]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Physical Education and Buns,2000,D,1392910200,"[brute force, implementation, math]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Lightbulb for Minister,2500,E,1392910200,[geometry],PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Number of Decompositions into Multipliers,500,A,1393428600,"[combinatorics, number theory]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Sum of Fractions,1000,B,1393428600,"[math, number theory]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Changing Tree,1500,C,1393428600,"[data structures, trees]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Sum of Number of Inversions in Permutations,2000,D,1393428600,[combinatorics],PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Iteration of One Well-Known Function,2500,E,1393428600,[],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Segment's Own Points,500,A,1393428600,[],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Corruption and Numbers,1000,B,1393428600,"[implementation, math]",PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Number of Decompositions into Multipliers,1500,C,1393428600,"[combinatorics, number theory]",PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Sum of Fractions,2000,D,1393428600,[math],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Changing Tree,2500,E,1393428600,"[data structures, trees]",PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Cards,500,A,1393687800,[implementation],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Painting The Wall,1000,B,1393687800,"[dp, probabilities]",PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Tree and Array,1500,C,1393687800,[constructive algorithms],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Instant Messanger,2000,D,1393687800,[data structures],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Sorting Permutations,2500,E,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Pages,500,A,1393687800,[implementation],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Red and Blue Balls,1000,B,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Cards,1500,C,1393687800,[number theory],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Painting The Wall,2000,D,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Tree and Array,2500,E,1393687800,[],PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Choose Options,500,A,1394033400,"[dp, implementation]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and New Matrix of Candies,1000,B,1394033400,"[brute force, implementation, schedules]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Huge Candy Matrix,1500,C,1394033400,"[implementation, math]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Dima and Bacteria,2000,D,1394033400,"[dsu, graphs, shortest paths]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Binary Logic,2500,E,1394033400,"[binary search, bitmasks, data structures]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Vanya and Cards,500,A,1394465400,"[implementation, math]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Sereja and Contests,1000,B,1394465400,"[greedy, implementation, math]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Team,1500,C,1394465400,"[constructive algorithms, greedy, implementation]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Roman and Numbers,2000,D,1394465400,"[bitmasks, brute force, combinatorics, dp, number theory]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Olympic Games,2500,E,1394465400,[math],PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Nuts,500,A,1394983800,"[greedy, math]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Trees in a Row,1000,B,1394983800,[brute force],PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Searching for Graph,1500,C,1394983800,"[brute force, constructive algorithms]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Upgrading Array,2000,D,1394983800,"[dp, greedy, math]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Strictly Positive Matrix,2500,E,1394983800,[graphs],PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Searching for Graph,500,A,1394983800,"[constructive algorithms, graphs]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Upgrading Array,1000,B,1394983800,"[dp, greedy, number theory]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Strictly Positive Matrix,1500,C,1394983800,[graphs],PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Beautiful Pairs of Numbers,1500,D,1394983800,"[combinatorics, dp]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Two Rooted Trees,2000,E,1394983800,"[data structures, implementation]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Valera and X,500,A,1395243000,[implementation],PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Marathon,1000,B,1395243000,"[implementation, math]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Restore Graph,1500,C,1395243000,"[dfs and similar, graphs, sortings]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Minesweeper 1D,2000,D,1395243000,"[dp, implementation]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Maze 1D,2500,E,1395243000,"[binary search, greedy, implementation]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Gravity Flip,500,A,1395502200,"[greedy, implementation, sortings]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Domino Effect,1000,B,1395502200,[],PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Unusual Product,1500,C,1395502200,"[implementation, math]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Toy Sum,2000,D,1395502200,"[greedy, implementation, math]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Graph Cutting,3000,E,1395502200,[dfs and similar],PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Unusual Product,500,A,1395502200,"[implementation, math]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Toy Sum,1000,B,1395502200,"[constructive algorithms, greedy]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Graph Cutting,2000,C,1395502200,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Hill Climbing,2000,D,1395502200,"[dfs and similar, geometry, trees]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Hamming Triples,2500,E,1395502200,"[implementation, math]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Triangle,500,A,1396162800,"[brute force, implementation, math]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Long Path,1000,B,1396162800,"[dp, implementation]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Curious Array,2000,C,1396162800,"[brute force, implementation, math]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Largest Submatrix 3,2000,D,1396162800,"[dp, hashing]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,k-d-sequence,2500,E,1396162800,[data structures],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Line to Cashier,500,A,1396162800,[implementation],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Garland,1000,B,1396162800,[implementation],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Triangle,1500,C,1396162800,"[geometry, math]",PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Long Path,2000,D,1396162800,[dp],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Curious Array,3000,E,1396162800,[],PROGRAMMING +409,April Fools Day Contest 2014,12,The Great Game,,A,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Mysterious Language,,B,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Magnum Opus,,C,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Big Data,,D,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Dome,,E,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,1,,F,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,On a plane,,G,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,A + B Strikes Back,,H,1396366200,"[*special, brute force, constructive algorithms, dsu, implementation]",PROGRAMMING +409,April Fools Day Contest 2014,12,Feed the Golorp,,I,1396366200,[*special],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Password Check,,A,1397505600,[implementation],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Multi-core Processor,,B,1397505600,[implementation],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Kicker,,C,1397505600,[implementation],PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Poster,500,A,1397837400,"[greedy, implementation]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Network Configuration,1000,B,1397837400,"[greedy, sortings]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Pattern,1500,C,1397837400,"[implementation, strings]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Giving Awards,2000,D,1397837400,[dfs and similar],PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,E-mail Addresses,2500,E,1397837400,[implementation],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Data Recovery,500,A,1397977200,[implementation],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Spyke Chatting,1000,B,1397977200,[implementation],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Jeopardy!,1500,C,1397977200,"[greedy, math]",PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,2048,2000,D,1397977200,"[bitmasks, dp]",PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Maze 2D,2500,E,1397977200,"[data structures, divide and conquer]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Numbers,500,A,1396798800,"[constructive algorithms, number theory]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and ACM,1000,B,1396798800,"[combinatorics, dp]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Reverse Operation,1500,C,1396798800,"[combinatorics, divide and conquer]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Water Tanks,1500,D,1396798800,"[binary search, data structures, greedy, two pointers]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh's Designed Problem,2500,E,1396798800,[data structures],PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Lights,500,A,1396798800,[implementation],PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Tokens,1000,B,1396798800,"[binary search, greedy, math]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Numbers,1500,C,1396798800,"[constructive algorithms, greedy, number theory]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and ACM,2000,D,1396798800,"[combinatorics, dp, number theory]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Reverse Operation,2500,E,1396798800,"[divide and conquer, sortings]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Guess a number!,500,A,1397376000,"[greedy, implementation, two pointers]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Art Union,1000,B,1397376000,"[brute force, dp, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Booking System,1500,C,1397376000,"[binary search, dp, greedy, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Population Size,2000,D,1397376000,"[greedy, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,President's Path,2500,E,1397376000,"[dp, graphs, shortest paths]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Elimination,500,A,1397749200,"[dp, implementation, math]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Crash,1000,B,1397749200,[implementation],PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Football,1500,C,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Cunning Gena,2000,D,1397749200,"[bitmasks, dp, greedy, sortings]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Square Table,2500,E,1397749200,"[constructive algorithms, math, probabilities]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Football,500,A,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Cunning Gena,1000,B,1397749200,"[bitmasks, dp, sortings]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Square Table,1500,C,1397749200,"[constructive algorithms, dp, math]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Big Problems for Organizers,2500,D,1397749200,"[data structures, graphs, trees]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Tricky Password,2500,E,1397749200,[data structures],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Start Up,500,A,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Online Meeting,1500,B,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Bug in Code,1500,C,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Cup Trick,1500,D,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Playing the ball,2000,E,1398169200,[],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Start Up,500,A,1398169140,[implementation],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Online Meeting,1500,B,1398169140,[implementation],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Bug in Code,1500,C,1398169140,"[data structures, graphs, implementation, two pointers]",PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Cup Trick,1500,D,1398169140,[data structures],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Playing the ball,2000,E,1398169140,[geometry],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Pasha and Hamsters,500,A,1398168900,"[constructive algorithms, implementation]",PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Start Up,1000,B,1398168900,[implementation],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Online Meeting,2000,C,1398168900,[implementation],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Bug in Code,2000,D,1398168900,"[binary search, data structures, sortings]",PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Cup Trick,2000,E,1398168900,[data structures],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Squats,500,A,1398409200,[implementation],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Megacity,1000,B,1398409200,"[binary search, greedy, implementation, sortings]",PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Magic Formulas,1500,C,1398409200,[math],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Biathlon Track,2500,D,1398409200,"[binary search, brute force, constructive algorithms, data structures, dp]",PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Colored Jenga,3000,E,1398409200,"[dfs and similar, dp, probabilities]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Swaps,500,A,1398612600,"[brute force, sortings]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Table ,1000,B,1398612600,"[bitmasks, greedy]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Two Sequences,1500,C,1398612600,"[data structures, dp]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Squares,2000,D,1398612600,"[binary search, data structures, hashing]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Sets,2000,E,1398612600,[dp],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Mugs,500,A,1398612600,[implementation],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Mirroring,1000,B,1398612600,[implementation],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Swaps,1500,C,1398612600,"[brute force, sortings, two pointers]",PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Table ,2000,D,1398612600,[],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Two Sequences,2500,E,1398612600,[],PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Police Recruits,500,A,1399044600,[implementation],PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Prison Transfer,1000,B,1399044600,"[data structures, implementation]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Checkposts,1500,C,1399044600,"[dfs and similar, graphs, two pointers]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Match & Catch,2000,D,1399044600,"[dp, string suffix structures, strings]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Police Patrol,2500,E,1399044600,"[greedy, implementation, math, ternary search]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Xor-tree,500,A,1399822800,"[dfs and similar, trees]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Working out,1000,B,1399822800,[dp],PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Guess the Tree,1500,C,1399822800,"[bitmasks, constructive algorithms, dp, greedy, trees]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Tricky Function,2000,D,1399822800,"[data structures, divide and conquer, geometry]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Points and Segments,2000,E,1399822800,[graphs],PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Points and Segments (easy),500,A,1399822800,"[constructive algorithms, sortings]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Balls Game,1000,B,1399822800,"[brute force, two pointers]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Xor-tree,1500,C,1399822800,"[brute force, data structures, dfs and similar, trees]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Working out,2000,D,1399822800,"[brute force, dp]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Guess the Tree,2500,E,1399822800,"[constructive algorithms, data structures, dfs and similar]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Black Square,500,A,1400686200,[implementation],PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Shower Line,1500,B,1400686200,"[brute force, implementation]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,k-Tree,1500,C,1400686200,"[dp, implementation, trees]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Random Task,2000,D,1400686200,"[binary search, bitmasks, combinatorics, dp, math]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Chemistry Experiment,2500,E,1400686200,"[binary search, data structures, ternary search]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Choosing Teams,500,A,1400167800,"[greedy, implementation, sortings]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Football Kit,1000,B,1400167800,"[brute force, greedy, implementation]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Prime Swaps,1500,C,1400167800,"[greedy, sortings]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Prefixes and Suffixes,2000,D,1400167800,"[dp, string suffix structures, strings, two pointers]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Square Tiling,2500,E,1400167800,"[constructive algorithms, greedy]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Kitahara Haruki's Gift,500,A,1400914800,"[brute force, implementation]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Kuriyama Mirai's Stones,1500,B,1400914800,"[dp, implementation, sortings]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Ryouko's Memory Note,1500,C,1400914800,"[implementation, math, sortings]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Nanami's Digital Board,2000,D,1400914800,"[dsu, implementation]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Tachibana Kanade's Tofu,2500,E,1400914800,[dp],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Ryouko's Memory Note,500,A,1400914800,"[math, sortings]",PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Nanami's Digital Board,1000,B,1400914800,"[divide and conquer, dp, dsu, implementation, two pointers]",PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Tachibana Kanade's Tofu,1500,C,1400914800,[dp],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Nanami's Power Plant,2000,D,1400914800,[flows],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Furukawa Nagisa's Tree,3000,E,1400914800,"[binary search, divide and conquer, sortings, trees]",PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Queue on Bus Stop,500,A,1401463800,[implementation],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Pasha Maximizes,1000,B,1401463800,[greedy],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Cardiogram,1500,C,1401463800,[implementation],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Special Grid,2000,D,1401463800,"[brute force, dp, greedy]",PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Special Graph,2500,E,1401463800,[],PROGRAMMING +436,Zepto Code Rush 2014,12,Feed with Candy,1000,A,1402673400,[greedy],PROGRAMMING +436,Zepto Code Rush 2014,12,Om Nom and Spiders,1000,B,1402673400,"[implementation, math]",PROGRAMMING +436,Zepto Code Rush 2014,12,Dungeons and Candies,1500,C,1402673400,"[dsu, graphs, greedy, trees]",PROGRAMMING +436,Zepto Code Rush 2014,12,Pudding Monsters,2500,D,1402673400,[dp],PROGRAMMING +436,Zepto Code Rush 2014,12,Cardboard Box,2500,E,1402673400,"[data structures, greedy]",PROGRAMMING +436,Zepto Code Rush 2014,12,Banners,3000,F,1402673400,"[brute force, data structures, dp]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Homework,500,A,1401627600,[implementation],PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Set,1500,B,1401627600,"[bitmasks, greedy, implementation, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Toy,1500,C,1401627600,"[graphs, greedy, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Zoo,2000,D,1401627600,"[dsu, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Polygon,2500,E,1401627600,[],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Toy,500,A,1401627600,[greedy],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Zoo,1000,B,1401627600,"[dp, dsu, sortings]",PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Polygon,1500,C,1401627600,"[dp, geometry]",PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Sequence,2000,D,1401627600,[data structures],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Binary Tree,3000,E,1401627600,"[combinatorics, divide and conquer, fft, number theory]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,"Devu, the Singer and Churu, the Joker",500,A,1401895800,"[greedy, implementation]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,"Devu, the Dumb Guy",1000,B,1401895800,"[implementation, sortings]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and Partitioning of the Array,1500,C,1401895800,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and his Brother,2000,D,1401895800,"[binary search, sortings, ternary search, two pointers]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and Birthday Celebration,2500,E,1401895800,"[combinatorics, dp, math]",PROGRAMMING +440,Testing Round #10,12,Forgotten Episode,500,A,1401809400,[implementation],PROGRAMMING +440,Testing Round #10,12,Balancer,1000,B,1401809400,[implementation],PROGRAMMING +440,Testing Round #10,12,One-Based Arithmetic,1500,C,1401809400,"[dfs and similar, divide and conquer]",PROGRAMMING +440,Testing Round #10,12,Berland Federalization,2000,D,1401809400,"[dp, trees]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Antique Items,500,A,1402241400,[implementation],PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Fruits,1000,B,1402241400,"[greedy, implementation]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Tubes ,1500,C,1402241400,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Swaps,2000,D,1402241400,"[constructive algorithms, dsu, graphs, implementation, string suffix structures]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Number,2500,E,1402241400,"[bitmasks, dp]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Borya and Hanabi,500,A,1403191800,"[bitmasks, brute force, implementation]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Andrey and Problem,1500,B,1403191800,"[greedy, math, probabilities]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Artem and Array ,1500,C,1403191800,"[data structures, greedy]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Adam and Tree,2000,D,1403191800,"[data structures, trees]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Gena and Second Distance,2500,E,1403191800,[geometry],PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Anton and Letters,500,A,1403191800,"[constructive algorithms, implementation]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Kolya and Tandem Repeat,1000,B,1403191800,[brute force],PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Borya and Hanabi,1500,C,1403191800,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Andrey and Problem,2500,D,1403191800,"[dp, greedy, math, probabilities, sortings]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Artem and Array ,2500,E,1403191800,[],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Physics,500,A,1404651900,"[greedy, math]",PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves FFT,1000,B,1404651900,[probabilities],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Colors,2000,C,1404651900,[data structures],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Strings,2000,D,1404651900,"[binary search, hashing, strings, two pointers]",PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Planting,2500,E,1404651900,"[binary search, dsu, trees]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Chessboard,500,A,1404651900,"[dfs and similar, implementation]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Chemistry,1000,B,1404651900,"[dfs and similar, dsu, greedy]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Physics,1500,C,1404651900,"[graphs, greedy]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves FFT,2000,D,1404651900,[probabilities],PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Colors,3000,E,1404651900,[data structures],PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Sequences,500,A,1405256400,"[dp, implementation, two pointers]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Modification,1500,B,1405256400,"[brute force, greedy]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Fibonacci Numbers,1500,C,1405256400,"[data structures, number theory]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Games,2000,D,1405256400,"[math, matrices, probabilities]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Bridges,2500,E,1405256400,"[math, matrices]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Hash,500,A,1405256400,[implementation],PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Strings,1000,B,1405256400,"[greedy, implementation]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Sequences,1500,C,1405256400,[dp],PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Modification,2500,D,1405256400,"[data structures, greedy]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Fibonacci Numbers,2500,E,1405256400,[data structures],PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Rewards,500,A,1405605600,[implementation],PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Suffix Structures,1000,B,1405605600,"[implementation, strings]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Painting Fence,2500,C,1405605600,"[divide and conquer, dp, greedy]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Multiplication Table,2000,D,1405605600,"[binary search, brute force]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Divisors,3000,E,1405605600,"[brute force, dfs and similar, implementation, number theory]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Chocolate,500,A,1405774800,[math],PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Cities,1000,B,1405774800,"[graphs, shortest paths]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Apples,1500,C,1405774800,"[constructive algorithms, number theory]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Numbers,2000,D,1405774800,"[bitmasks, combinatorics, dp]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Squares,2500,E,1405774800,"[dp, math, number theory]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Children,500,A,1405774800,[implementation],PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Sequences,1000,B,1405774800,"[implementation, math]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Chocolate,1500,C,1405774800,"[greedy, implementation]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Cities,2000,D,1405774800,"[graphs, shortest paths]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Apples,2500,E,1405774800,"[constructive algorithms, number theory]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Game With Sticks,500,A,1406215800,[implementation],PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Sort the Array,1000,B,1406215800,"[implementation, sortings]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Predict Outcome of the Game,1500,C,1406215800,"[brute force, implementation, math]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Count Good Substrings,2500,D,1406215800,[math],PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Devu and Flowers,3000,E,1406215800,"[bitmasks, combinatorics, number theory]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Eevee,500,A,1406480400,"[implementation, strings]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,4-point polyline,1000,B,1406480400,"[brute force, constructive algorithms, geometry, trees]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Magic Trick,1000,C,1406480400,"[combinatorics, math, probabilities]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,"Washer, Dryer, Folder",1500,D,1406480400,"[greedy, implementation]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Three strings,2500,E,1406480400,"[data structures, dsu, string suffix structures, strings]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Permutation,2500,F,1406480400,"[data structures, divide and conquer, hashing]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Expected Maximum,500,A,1406907000,[probabilities],PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Harmony Chest,1000,B,1406907000,"[bitmasks, brute force, dp]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Summer Sun Celebration,1500,C,1406907000,"[constructive algorithms, dfs and similar]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Elements of Harmony,2500,D,1406907000,"[dp, matrices]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Lord Tirek,2500,E,1406907000,[data structures],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Crystal Mine,500,A,1406907000,[implementation],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Sort by Shift,1000,B,1406907000,[implementation],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Expected Maximum,1500,C,1406907000,"[combinatorics, math, probabilities]",PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Harmony Chest,2000,D,1406907000,"[bitmasks, dp]",PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Summer Sun Celebration,2500,E,1406907000,[dfs and similar],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Boredom,500,A,1407511800,[dp],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,A Lot of Games,1000,B,1407511800,"[dfs and similar, dp, games, implementation, strings, trees]",PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Civilization,1500,C,1407511800,"[dfs and similar, dp, dsu, ternary search, trees]",PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Serega and Fun,2000,D,1407511800,[data structures],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Function,2500,E,1407511800,[data structures],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Laptops,500,A,1407511800,[sortings],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Fedya and Maths,1000,B,1407511800,"[math, number theory]",PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Boredom,1500,C,1407511800,[dp],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,A Lot of Games,2000,D,1407511800,"[dp, games, strings]",PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Civilization,2500,E,1407511800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Golden System,1000,A,1407690000,"[math, meet-in-the-middle]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Distributed Join,1000,B,1407690000,[greedy],PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Elections,1500,C,1407690000,[brute force],PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Bingo!,2000,D,1407690000,"[combinatorics, math, probabilities]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Flow Optimality,2500,E,1407690000,"[constructive algorithms, flows, math]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,An easy problem about trees,3000,F,1407690000,"[dp, games, greedy, trees]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Golden System,1000,A,1407690000,[math],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Distributed Join,1000,B,1407690000,[greedy],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Elections,1500,C,1407690000,"[data structures, ternary search]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Bingo!,2000,D,1407690000,"[combinatorics, probabilities]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Flow Optimality,2500,E,1407690000,[],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,An easy problem about trees,3000,F,1407690000,[],PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Garden,500,A,1408116600,[implementation],PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Flowers,500,B,1408116600,"[implementation, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Buses,2000,C,1408116600,"[combinatorics, constructive algorithms, math]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Parmida's problem,2000,D,1408116600,"[data structures, divide and conquer, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Graph,3000,E,1408116600,"[dp, sortings]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Vasya and Socks,500,A,1408548600,"[brute force, implementation]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Little Dima and Equation,1000,B,1408548600,"[brute force, implementation, math]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Present,1500,C,1408548600,"[binary search, data structures, greedy]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Little Victor and Set,2000,D,1408548600,"[brute force, constructive algorithms]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Roland and Rose,2500,E,1408548600,"[brute force, geometry, math, sortings]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Toastman,500,A,1409061600,"[greedy, sortings]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Tree,1000,B,1409061600,"[dfs and similar, dp, trees]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and a Sheet of Paper,1500,C,1409061600,"[data structures, implementation]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Complicated Task,2000,D,1409061600,"[dsu, math]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and a Game,2500,E,1409061600,[shortest paths],PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Easy Task,500,A,1409061600,"[brute force, implementation]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Card Game,1000,B,1409061600,[greedy],PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Toastman,1500,C,1409061600,"[implementation, sortings]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Tree,2000,D,1409061600,"[dp, graphs]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and a Sheet of Paper,2500,E,1409061600,[],PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Sugar,500,A,1409383800,[implementation],PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Pylons,1000,B,1409383800,[math],PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Gargari and Bishops,1500,C,1409383800,"[greedy, hashing, implementation]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Gargari and Permutations,2000,D,1409383800,"[dfs and similar, dp, graphs]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Tree,2500,E,1409383800,"[brute force, dfs and similar, trees]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,No to Palindromes!,500,A,1410103800,"[greedy, strings]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,Restore Cube ,1500,B,1410103800,"[brute force, geometry]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,Substitutes in Number,1500,C,1410103800,[dp],PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,World of Darkraft - 2,2000,D,1410103800,"[dp, probabilities]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,The Classic Problem,2500,E,1410103800,"[data structures, graphs, shortest paths]",PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,inc ARG,500,A,1410103800,[implementation],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Inbox (100500),1000,B,1410103800,[implementation],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,No to Palindromes!,1500,C,1410103800,[brute force],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Restore Cube ,2500,D,1410103800,[brute force],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Substitutes in Number,2500,E,1410103800,"[constructive algorithms, dp]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Cheap Travel,500,A,1410535800,[implementation],PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Wonder Room,1000,B,1410535800,"[brute force, math]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Number of Ways,1500,C,1410535800,"[binary search, brute force, data structures, dp, two pointers]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Increase Sequence,2000,D,1410535800,"[combinatorics, dp]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Information Graph,2500,E,1410535800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,George and Accommodation,500,A,1411054200,[implementation],PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Fedor and New Game,1000,B,1411054200,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,George and Job,1500,C,1411054200,"[dp, implementation]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Fedor and Essay,2000,D,1411054200,"[dfs and similar, dp, graphs, hashing, strings]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Alex and Complicated Task,2500,E,1411054200,"[data structures, dp, greedy]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,24 Game,500,A,1411218000,"[constructive algorithms, greedy, math]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Two Sets,1000,B,1411218000,"[2-sat, dfs and similar, dsu, graph matchings, greedy]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Hack it!,1500,C,1411218000,"[binary search, constructive algorithms, math]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Tree,2000,D,1411218000,[graph matchings],PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Permanent,2500,E,1411218000,"[dp, graph matchings, math, meet-in-the-middle]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,I Wanna Be the Guy,500,A,1411218000,"[greedy, implementation]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Chat Online,1000,B,1411218000,[implementation],PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,24 Game,1500,C,1411218000,"[constructive algorithms, implementation]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Two Sets,2000,D,1411218000,"[2-sat, data structures, graph matchings, greedy]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Hack it!,2500,E,1411218000,[constructive algorithms],PROGRAMMING +470,Surprise Language Round #7,12,Crystal Ball Sequence,,A,1410622200,"[*special, implementation]",PROGRAMMING +470,Surprise Language Round #7,12,Hexakosioihexekontahexaphobia,,B,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Eval,,C,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Caesar Cipher,,D,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Chessboard,,E,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Pairwise Sums,,F,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Hamming Distance,,G,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Array Sorting,,H,1410622200,[*special],PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Sticks,500,A,1411745400,[implementation],PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Important Things,1000,B,1411745400,[sortings],PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and House of Cards,2000,C,1411745400,"[binary search, brute force, greedy, math]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Cube Walls,2000,D,1411745400,"[string suffix structures, strings]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Lots and Lots of Segments,2500,E,1411745400,"[data structures, dsu]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from Math,500,A,1411918500,"[math, number theory]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from Life,1000,B,1411918500,[],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Make It Nondeterministic,1500,C,1411918500,[greedy],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Inverse the Problem,2000,D,1411918500,"[dfs and similar, dsu, shortest paths, trees]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from a Game,3000,E,1411918500,"[constructive algorithms, implementation]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Change the Goal,3000,F,1411918500,"[constructive algorithms, math, matrices]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Increase the Constraints,3500,G,1411918500,"[bitmasks, data structures, fft]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Keyboard,500,A,1412609400,[implementation],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Worms,1000,B,1412609400,"[binary search, implementation]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Captain Marmot,1500,C,1412609400,"[brute force, geometry]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Flowers,2000,D,1412609400,[dp],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Pillars,3000,E,1412609400,"[binary search, data structures, dp, sortings, trees]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Ant colony,3000,F,1412609400,"[data structures, number theory]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Bayan Bus,500,A,1412514000,[implementation],PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Strongly Connected City,1000,B,1412514000,"[brute force, dfs and similar, graphs, implementation]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Kamal-ol-molk's Painting,1500,C,1412514000,"[brute force, constructive algorithms, greedy]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,CGCDSSQ,2000,D,1412514000,"[brute force, data structures, math]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Strongly Connected City 2,2500,E,1412514000,[dfs and similar],PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Meta-universe,2500,F,1412514000,[data structures],PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Stairs,500,A,1413122400,"[implementation, math]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and WiFi,1500,B,1413122400,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sums,1500,C,1413122400,[math],PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sets,2000,D,1413122400,"[constructive algorithms, greedy, math]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Strings,2500,E,1413122400,"[dp, strings]",PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sums,500,A,1413122400,[math],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sets,1000,B,1413122400,[math],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Strings,1500,C,1413122400,[dp],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Binary,2000,D,1413122400,"[dp, strings]",PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Notepad,3000,E,1413122400,[data structures],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Initial Bet,500,A,1413474000,[implementation],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Random Teams,1000,B,1413474000,"[combinatorics, constructive algorithms, greedy, math]",PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Table Decorations,1500,C,1413474000,[greedy],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Red-Green Towers,2000,D,1413474000,[dp],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Wavy numbers,2500,E,1413474000,"[brute force, dfs and similar, meet-in-the-middle, sortings]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Expression,500,A,1413709200,"[brute force, math]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Towers,1000,B,1413709200,"[brute force, greedy, implementation, sortings]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Exams,1500,C,1413709200,"[greedy, sortings]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Long Jumps,2000,D,1413709200,"[binary search, greedy, implementation]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Riding in a Lift,2500,E,1413709200,[dp],PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Exams,500,A,1413709200,"[greedy, sortings]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Long Jumps,1000,B,1413709200,"[binary search, greedy, hashing, implementation, sortings]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Riding in a Lift,1500,C,1413709200,"[dp, implementation]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Parcels,2000,D,1413709200,"[dp, graphs]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Parking Lot,2500,E,1413709200,"[data structures, divide and conquer]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Diverse Permutation,500,A,1414170000,"[constructive algorithms, greedy]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Interesting Array,1500,B,1414170000,"[constructive algorithms, data structures, trees]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Game with Strings,1500,C,1414170000,"[bitmasks, dp, probabilities]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Random Function and Tree,2000,D,1414170000,"[combinatorics, dp, trees]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,ELCA,2500,E,1414170000,"[data structures, trees]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Counterexample ,500,A,1414170000,"[brute force, implementation]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Friends and Presents,1000,B,1414170000,"[binary search, math]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Diverse Permutation,1500,C,1414170000,"[constructive algorithms, implementation]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Interesting Array,2500,D,1414170000,[data structures],PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Game with Strings,2500,E,1414170000,[],PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Bits,500,A,1415205000,"[bitmasks, constructive algorithms]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Maximum Value,1000,B,1415205000,"[binary search, math, sortings, two pointers]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Strange Sorting,3000,C,1415205000,"[implementation, math]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Kindergarten,2000,D,1415205000,"[data structures, dp, greedy]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Sign on Fence,3000,E,1415205000,"[binary search, constructive algorithms, data structures]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Factory,1000,A,1415205000,"[implementation, math, matrices]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Valuable Resources,500,B,1415205000,"[brute force, greedy]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Bits,1500,C,1415205000,"[implementation, math]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Maximum Value,3000,D,1415205000,"[binary search, sortings]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Strange Sorting,3000,E,1415205000,[],PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Calculating Function,500,A,1415718000,"[implementation, math]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,OR in Matrix,1000,B,1415718000,"[greedy, hashing, implementation]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Palindrome Transformation,1500,C,1415718000,"[greedy, implementation]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Valid Sets,2000,D,1415718000,"[dfs and similar, dp, math, trees]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,LIS of Sequence,2500,E,1415718000,"[data structures, dp, greedy, hashing, math]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Fight the Monster,500,A,1416590400,"[binary search, brute force]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Strip,1500,B,1416590400,"[binary search, data structures, dp, two pointers]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Prefix Product Sequence,1500,C,1416590400,"[constructive algorithms, number theory]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Conveyor Belts,2000,D,1416590400,[data structures],PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Tourists,2500,E,1416590400,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Giga Tower,500,A,1416590400,[brute force],PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Candy Boxes,1500,B,1416590400,"[brute force, constructive algorithms]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Fight the Monster,1500,C,1416590400,[brute force],PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Strip,2500,D,1416590400,"[data structures, dp, two pointers]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Prefix Product Sequence,2500,E,1416590400,"[constructive algorithms, math]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,SwapSort,500,A,1416238500,"[implementation, sortings]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,BerSU Ball,1000,B,1416238500,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Given Length and Sum of Digits...,1500,C,1416238500,"[dp, greedy, implementation]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Unbearable Controversy of Being,2000,D,1416238500,"[brute force, combinatorics, dfs and similar, graphs]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Hiking,2500,E,1416238500,"[binary search, dp]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Special Matrices,2500,F,1416238500,"[combinatorics, dp]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Team Olympiad,500,A,1416733800,"[greedy, implementation, sortings]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Queue,1000,B,1416733800,"[dsu, implementation]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Hacking Cypher,1500,C,1416733800,"[brute force, math, strings]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Chocolate,2000,D,1416733800,"[brute force, dfs and similar, math, meet-in-the-middle, number theory]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Restoring Increasing Sequence,2000,E,1416733800,"[binary search, brute force, greedy, implementation]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Treeland Tour,2500,F,1416733800,"[data structures, dfs and similar, dp, trees]",PROGRAMMING +491,Testing Round #11,12,Up the hill,500,A,1416519000,[implementation],PROGRAMMING +491,Testing Round #11,12,New York Hotel,1000,B,1416519000,"[greedy, math]",PROGRAMMING +491,Testing Round #11,12,Deciphering,1500,C,1416519000,"[flows, graph matchings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Cubes,500,A,1417451400,[implementation],PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Lanterns,1000,B,1417451400,"[binary search, math, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Exams,1500,C,1417451400,"[greedy, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Computer Game,2000,D,1417451400,"[binary search, implementation, math, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Field,2500,E,1417451400,[math],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Football,500,A,1417618800,[implementation],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Wrestling,1000,B,1417618800,[implementation],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Basketball,2000,C,1417618800,"[binary search, brute force, implementation, sortings, two pointers]",PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Chess,1500,D,1417618800,"[constructive algorithms, games]",PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Polynomial,3000,E,1417618800,[math],PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Treasure,500,A,1418488200,[greedy],PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Obsessive String,1000,B,1418488200,"[dp, strings]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Helping People,1750,C,1418488200,"[dp, probabilities]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Birthday,1750,D,1418488200,"[data structures, dfs and similar, dp, trees]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Sharti,2500,E,1418488200,[games],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Digital Counter,500,A,1418488200,[implementation],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Modular Equations,1000,B,1418488200,[math],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Treasure,1500,C,1418488200,[implementation],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Obsessive String,2000,D,1418488200,"[binary search, dp, strings]",PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Helping People,2750,E,1418488200,[],PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Minimum Difficulty,500,A,1418833800,"[brute force, implementation, math]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Secret Combination,1000,B,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Removing Columns,1750,C,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Tennis Game,2250,D,1418833800,[binary search],PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Distributing Parts ,2250,E,1418833800,"[greedy, sortings]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Removing Columns,750,A,1418833800,[greedy],PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Tennis Game,1250,B,1418833800,"[binary search, brute force, implementation]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Distributing Parts ,1250,C,1418833800,"[data structures, greedy, implementation, sortings, two pointers]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Gears,2000,D,1418833800,"[brute force, geometry, math]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Subsequences Return,2500,E,1418833800,"[dp, matrices]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Crazy Town,500,A,1419438600,[geometry],PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Name That Tune,2000,B,1419438600,"[dp, probabilities, two pointers]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Array and Operations,1000,C,1419438600,"[flows, graph matchings, number theory]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Traffic Jams in the Land,2000,D,1419438600,"[data structures, dp, number theory]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Stairs and Lines,2500,E,1419438600,"[dp, matrices]",PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Watching a movie,500,A,1419438600,[implementation],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Lecture,500,B,1419438600,[strings],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Crazy Town,1500,C,1419438600,[math],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Name That Tune,3000,D,1419438600,[],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Array and Operations,3000,E,1419438600,[],PROGRAMMING +500,Good Bye 2014,12,New Year Transportation,500,A,1419951600,"[dfs and similar, graphs, implementation]",PROGRAMMING +500,Good Bye 2014,12,New Year Permutation,1000,B,1419951600,"[dfs and similar, dsu, graphs, greedy, math, sortings]",PROGRAMMING +500,Good Bye 2014,12,New Year Book Reading,1000,C,1419951600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +500,Good Bye 2014,12,New Year Santa Network,1500,D,1419951600,"[combinatorics, dfs and similar, graphs, trees]",PROGRAMMING +500,Good Bye 2014,12,New Year Domino,2750,E,1419951600,"[data structures, dp, dsu]",PROGRAMMING +500,Good Bye 2014,12,New Year Shopping,2750,F,1419951600,"[divide and conquer, dp]",PROGRAMMING +500,Good Bye 2014,12,New Year Running,3500,G,1419951600,"[number theory, trees]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Contest,500,A,1421053200,[implementation],PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Changing Handles,500,B,1421053200,"[data structures, dsu, strings]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Forest,1500,C,1421053200,"[constructive algorithms, data structures, greedy, sortings, trees]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Permutations Summation,3000,D,1421053200,[data structures],PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Palindrome Degree,3000,E,1421053200,"[binary search, combinatorics, implementation]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Forest,500,A,1421053200,"[constructive algorithms, data structures, graphs, greedy]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Permutations Summation,500,B,1421053200,"[binary search, data structures, math]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Palindrome Degree,2500,C,1421053200,[math],PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and XOR,2500,D,1421053200,[bitmasks],PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and LCP on Tree,3000,E,1421053200,"[binary search, dfs and similar, hashing, string suffix structures, trees]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Gift,500,A,1421586000,"[brute force, implementation, strings]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Colorful Graph,1000,B,1421586000,"[dfs and similar, dp, dsu, graphs]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,"Mr. Kitayuta, the Treasure Hunter",1500,C,1421586000,"[dfs and similar, dp, two pointers]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Technology,2000,D,1421586000,[dfs and similar],PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta vs. Bamboos,2750,E,1421586000,"[binary search, greedy]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,"Mr. Kitayuta, the Treasure Hunter",500,A,1421586000,[dp],PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Technology,1000,B,1421586000,"[dfs and similar, graphs]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta vs. Bamboos,1750,C,1421586000,[binary search],PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Colorful Graph,1750,D,1421586000,"[brute force, dfs and similar, dsu]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Gift,2500,E,1421586000,"[combinatorics, dp, matrices, strings]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Amr and Music,500,A,1422028800,"[greedy, implementation, sortings]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Amr and Pins,1000,B,1422028800,"[geometry, math]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Guess Your Way Out!,1500,C,1422028800,"[implementation, math]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,The Maths Lecture,2000,D,1422028800,"[dp, implementation]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Breaking Good,2500,E,1422028800,"[dfs and similar, dp, graphs, shortest paths]",PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Pasha and Pixels,500,A,1422376200,[brute force],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Anton and currency you all know,1000,B,1422376200,[greedy],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Anya and Ghosts,1500,C,1422376200,[greedy],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Tanya and Password,2000,D,1422376200,"[dfs and similar, graphs]",PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Arthur and Brackets,2500,E,1422376200,"[dp, greedy]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Maximum in Table,,A,1422705600,"[brute force, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Painting Pebbles,,B,1422705600,"[constructive algorithms, greedy, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Sums of Digits,,C,1422705600,"[dp, greedy, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Restoring Numbers,,D,1422705600,"[constructive algorithms, math]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Pretty Song,,E,1422705600,"[math, strings]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Progress Monitoring,,F,1422705600,[dp],PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Snake,500,A,1422894600,[implementation],PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Two Dots,1000,B,1422894600,[dfs and similar],PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Names,1500,C,1422894600,"[dfs and similar, graphs, sortings]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Jumping,2000,D,1422894600,"[bitmasks, brute force, dp, math]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Dinner,2500,E,1422894600,[flows],PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Names,500,A,1422894600,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Jumping,1000,B,1422894600,"[data structures, dp, math, number theory, shortest paths]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Dinner,1500,C,1422894600,"[flows, graph matchings]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Travelling,2250,D,1422894600,"[dp, trees]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Polygon,2250,E,1422894600,"[constructive algorithms, divide and conquer]",PROGRAMMING +513,Rockethon 2015,12,Game,3,A,1423328400,"[constructive algorithms, math]",PROGRAMMING +513,Rockethon 2015,12,Permutations,3,B1,1423328400,[brute force],PROGRAMMING +513,Rockethon 2015,12,Permutations,4,B2,1423328400,"[bitmasks, divide and conquer, math]",PROGRAMMING +513,Rockethon 2015,12,Second price auction,8,C,1423328400,"[bitmasks, probabilities]",PROGRAMMING +513,Rockethon 2015,12,Constrained Tree,9,D1,1423328400,[dfs and similar],PROGRAMMING +513,Rockethon 2015,12,Constrained Tree,8,D2,1423328400,"[constructive algorithms, data structures]",PROGRAMMING +513,Rockethon 2015,12,Subarray Cuts,9,E1,1423328400,[dp],PROGRAMMING +513,Rockethon 2015,12,Subarray Cuts,12,E2,1423328400,[dp],PROGRAMMING +513,Rockethon 2015,12,Scaygerboss,14,F1,1423328400,[flows],PROGRAMMING +513,Rockethon 2015,12,Scaygerboss,6,F2,1423328400,[flows],PROGRAMMING +513,Rockethon 2015,12,Inversions problem,3,G1,1423328400,"[brute force, dfs and similar, dp, meet-in-the-middle]",PROGRAMMING +513,Rockethon 2015,12,Inversions problem,5,G2,1423328400,"[dp, probabilities]",PROGRAMMING +513,Rockethon 2015,12,Inversions problem,16,G3,1423328400,[dp],PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Chewbaсca and Number,500,A,1423931400,"[greedy, implementation]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Han Solo and Lazer Gun,1000,B,1423931400,"[brute force, data structures, geometry, math]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Watto and Mechanism,2000,C,1423931400,"[binary search, hashing, string suffix structures, strings]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,R2D2 and Droid Army,2000,D,1423931400,"[binary search, data structures, two pointers]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Darth Vader and Tree,2500,E,1423931400,"[dp, matrices]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Date,500,A,1424190900,[math],PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and His Happy Friends,1000,B,1424190900,"[brute force, dsu, meet-in-the-middle, number theory]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Factorial,1000,C,1424190900,"[greedy, math, sortings]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Tiles,3000,D,1424190900,"[constructive algorithms, greedy]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Park,3000,E,1424190900,[data structures],PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Factorial,500,A,1424190900,"[dp, greedy, implementation, math]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Tiles,1000,B,1424190900,"[data structures, graph matchings, greedy, implementation]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Park,1500,C,1424190900,[data structures],PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Morning Exercise,3000,D,1424190900,"[dfs and similar, dp, dsu, trees, two pointers]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and His Happy Friends,3000,E,1424190900,"[math, number theory]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Vitaly and Strings,500,A,1424795400,[strings],PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Tanya and Postcard,1000,B,1424795400,"[implementation, strings]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Anya and Smartphone,1500,C,1424795400,"[data structures, implementation]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Ilya and Escalator,2000,D,1424795400,"[combinatorics, dp, probabilities]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Arthur and Questions,2500,E,1424795400,"[greedy, implementation, ternary search]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Pasha and Pipe,2500,F,1424795400,"[binary search, brute force, combinatorics, dp, implementation]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Chess,500,A,1425128400,[implementation],PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Compilation Errors,1000,B,1425128400,"[data structures, implementation]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Team Training,1500,C,1425128400,"[greedy, implementation, math, number theory]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Interesting Substrings,2000,D,1425128400,"[data structures, dp, two pointers]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Lecture Rooms,2500,E,1425128400,"[binary search, data structures, dfs and similar, dp, trees]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Pangram,500,A,1425279600,"[implementation, strings]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Two Buttons,1000,B,1425279600,"[dfs and similar, graphs, greedy, implementation, math, shortest paths]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,DNA Alignment,1500,C,1425279600,"[math, strings]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Cubes,2000,D,1425279600,"[games, greedy, implementation]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Pluses everywhere,2500,E,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,DNA Alignment,500,A,1425279600,"[greedy, math]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Cubes,1000,B,1425279600,"[data structures, greedy, implementation]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Pluses everywhere,1500,C,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Shop,2000,D,1425279600,[greedy],PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Cycling City,2500,E,1425279600,"[dfs and similar, graphs]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Reposts,500,A,1425740400,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Photo to Remember,1000,B,1425740400,"[data structures, dp, implementation]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Chicken or Fish?,1500,C,1425740400,[greedy],PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Closest Equals,2000,D,1425740400,[data structures],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,"Rotate, Flip and Zoom",500,A,1426345200,[implementation],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Mean Requests,1000,B,1426345200,[implementation],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Name Quest,1500,C,1426345200,[greedy],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Statistics of Recompressing Videos,2000,D,1426345200,"[data structures, implementation]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,"Возможно, вы знаете этих людей?",500,A,1426946400,[implementation],PROGRAMMING +524,VK Cup 2015 - Round 1,12,Фото на память - 2 (round version),500,B,1426946400,"[dp, greedy]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,The Art of Dealing with ATM,1000,C,1426946400,"[binary search, sortings]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,Social Network,1250,D,1426946400,"[greedy, two pointers]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,Rooks and Rectangles,1750,E,1426946400,[data structures],PROGRAMMING +524,VK Cup 2015 - Round 1,12,And Yet Another Bracket Sequence,3000,F,1426946400,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Vitaliy and Pie,250,A,1427387400,"[greedy, hashing]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Pasha and String,750,B,1427387400,[greedy],PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Ilya and Sticks,1000,C,1427387400,"[greedy, sortings]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Arthur and Walls,3000,D,1427387400,"[data structures, greedy]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Anya and Cubes,3000,E,1427387400,"[binary search, bitmasks, brute force, dp, meet-in-the-middle]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,King of Thieves,500,A,1428165300,"[brute force, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Dark Park,500,B,1428165300,"[dfs and similar, greedy, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Candies,1250,C,1428165300,"[brute force, greedy, math]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Necklace,1750,D,1428165300,"[hashing, string suffix structures, strings]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Transmitting Levels,2250,E,1428165300,"[dp, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Pudding Monsters,3000,F,1428165300,"[data structures, divide and conquer]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Spiders Evil Plan,3000,G,1428165300,"[greedy, trees]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Playing with Paper,500,A,1426610700,"[implementation, math]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Error Correct System,1000,B,1426610700,[greedy],PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Glass Carving,1500,C,1426610700,"[binary search, data structures, implementation]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Clique Problem,2000,D,1426610700,"[data structures, dp, greedy, implementation, sortings]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Data Center Drama,2500,E,1426610700,"[dfs and similar, graphs]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Glass Carving,500,A,1426610700,"[data structures, implementation]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Clique Problem,1000,B,1426610700,"[dp, greedy]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Data Center Drama,1500,C,1426610700,"[constructive algorithms, graphs]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Fuzzy Search,2000,D,1426610700,"[bitmasks, brute force, fft]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Triangles 3000,2500,E,1426610700,"[geometry, sortings]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,And Yet Another Bracket Sequence,2500,A,1426956300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Group Photo 2 (online mirror version),500,B,1426956300,"[brute force, greedy, sortings]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Rooks and Rectangles,1500,C,1426956300,[data structures],PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Social Network,1250,D,1426956300,"[data structures, greedy]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,The Art of Dealing with ATM,500,E,1426956300,[brute force],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,String inside out,,B,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Set subtraction,,D,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Sum and product,,E,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Points in triangle,,H,1427562000,"[*special, geometry]",PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Different variables,,I,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,String inside out,,B,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Set subtraction,,D,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Sum and product,,E,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Points in triangle,,H,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Different variables,,I,1427562000,[*special],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Berland Miners,3000,A,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Work Group,500,B,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Board Game,250,C,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Landmarks,3000,D,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Correcting Mistakes,500,E,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Encoding,1250,F,1429286400,[],PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Berland Miners,3000,A,1429286400,"[binary search, data structures, dfs and similar, greedy, trees]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Work Group,750,B,1429286400,"[dfs and similar, dp, graphs, strings, trees]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Board Game,250,C,1429286400,"[games, greedy, implementation, math]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Landmarks,3000,D,1429286400,[data structures],PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Correcting Mistakes,500,E,1429286400,"[constructive algorithms, dp, greedy, hashing, strings, two pointers]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Encoding,1500,F,1429286400,"[hashing, string suffix structures, strings]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Exam,500,A,1428854400,"[constructive algorithms, implementation]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Covered Path,1000,B,1428854400,"[dp, greedy, math]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Polycarpus' Dice,1500,C,1428854400,[math],PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Handshakes,2000,D,1428854400,"[binary search, constructive algorithms, data structures, greedy]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Berland Local Positioning System,2500,E,1428854400,"[constructive algorithms, greedy, hashing, implementation]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Simplified Nonogram,3000,F,1428854400,"[bitmasks, dp, hashing, meet-in-the-middle]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Nafas,500,A,1429029300,[implementation],PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and SaDDas,1000,B,1429029300,"[bitmasks, brute force, implementation]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Karafs,1500,C,1429029300,"[binary search, math]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Malekas,2000,D,1429029300,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Pashmaks,2500,E,1429029300,[geometry],PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Karafs,500,A,1429029300,"[binary search, math]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Malekas,1000,B,1429029300,"[hashing, string suffix structures, strings]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Pashmaks,1500,C,1429029300,[geometry],PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas in Kansas,2000,D,1429029300,"[dp, games]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas on the Path,2500,E,1429029300,"[data structures, divide and conquer, trees]",PROGRAMMING +537,VK Cup 2015 - Wild Card Round 2,12,Antiplagiarism,,A,1429381800,[*special],PROGRAMMING +538,Codeforces Round #300,12,Cutting Banner,500,A,1430064000,"[brute force, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Quasi Binary,1000,B,1430064000,"[constructive algorithms, dp, greedy, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Tourist's Notes,1500,C,1430064000,"[binary search, brute force, greedy, implementation, math]",PROGRAMMING +538,Codeforces Round #300,12,Weird Chess,1500,D,1430064000,"[brute force, constructive algorithms, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Demiurges Play Again,2000,E,1430064000,"[dfs and similar, dp, math, trees]",PROGRAMMING +538,Codeforces Round #300,12,A Heap of Heaps,2500,F,1430064000,"[brute force, data structures, math, sortings]",PROGRAMMING +538,Codeforces Round #300,12,Berserk Robot ,3000,G,1430064000,"[constructive algorithms, math, sortings]",PROGRAMMING +538,Codeforces Round #300,12,Summer Dichotomy,3000,H,1430064000,"[2-sat, data structures, dfs and similar, greedy]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Combination Lock,500,A,1430411400,[implementation],PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,School Marks,1000,B,1430411400,"[greedy, implementation]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Ice Cave,1500,C,1430411400,[dfs and similar],PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Bad Luck Island,2000,D,1430411400,"[dp, probabilities]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Infinite Inversions,2500,E,1430411400,"[binary search, data structures, implementation, sortings, trees]",PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Place Your Ad Here,750,A,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Duck Hunt,3000,B,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Idempotent functions,250,C,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Superhero's Job,1250,D,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Playing on Graph,750,E,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Quest,500,F,1430668800,[],PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Place Your Ad Here,2000,A,1430668800,"[data structures, sortings]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Duck Hunt,3000,B,1430668800,[data structures],PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Idempotent functions,750,C,1430668800,"[constructive algorithms, graphs, math]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Superhero's Job,2250,D,1430668800,"[dfs and similar, dp, hashing, math, number theory]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Playing on Graph,2250,E,1430668800,"[graphs, shortest paths]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Quest,1000,F,1430668800,"[dp, greedy]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Writing Code,500,A,1431016200,[dp],PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Destroying Roads,1000,B,1431016200,"[graphs, shortest paths]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Remembering Strings,1750,C,1431016200,"[bitmasks, dp]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Road Improvement,1750,D,1431016200,"[dp, trees]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Listening to Music,2500,E,1431016200,"[constructive algorithms, data structures]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Set of Strings,500,A,1431016200,[implementation],PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Sea and Islands,1000,B,1431016200,"[constructive algorithms, implementation]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Writing Code,1500,C,1431016200,[dp],PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Destroying Roads,2000,D,1431016200,"[brute force, graphs, shortest paths]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Remembering Strings,2750,E,1431016200,"[bitmasks, dp]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Toy Cars,500,A,1432053000,[implementation],PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Equidistant String,1000,B,1432053000,[greedy],PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Woodcutters,1750,C,1432053000,"[dp, greedy]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Queue,1750,D,1432053000,"[greedy, implementation, sortings]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Paths and Trees,2500,E,1432053000,"[graphs, greedy, shortest paths]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Bananas,500,A,1432312200,"[implementation, math]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Badges,1000,B,1432312200,"[brute force, greedy, implementation, sortings]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Cards,1250,C,1432312200,"[brute force, dfs and similar]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Number Game,1500,D,1432312200,"[constructive algorithms, dp, math, number theory]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Traveling,2250,E,1432312200,"[flows, math]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Frog,750,A,1432658100,"[brute force, implementation, math]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Feet,1000,B,1432658100,"[binary search, data structures, dp, dsu]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Foam,1750,C,1432658100,"[bitmasks, number theory]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Fish,1750,D,1432658100,"[dfs and similar, graphs]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Friends,2500,E,1432658100,"[data structures, string suffix structures, strings]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Fax,500,A,1432658100,"[brute force, implementation]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Fun,1000,B,1432658100,"[brute force, greedy, implementation]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Frog,1750,C,1432658100,[number theory],PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Feet,2000,D,1432658100,"[binary search, data structures]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Foam,2750,E,1432658100,[number theory],PROGRAMMING +549,Looksery Cup 2015,12,Face Detection,250,A,1433595600,[implementation],PROGRAMMING +549,Looksery Cup 2015,12,Looksery Party,1750,B,1433595600,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING +549,Looksery Cup 2015,12,The Game Of Parity,2000,C,1433595600,[games],PROGRAMMING +549,Looksery Cup 2015,12,Haar Features,1000,D,1433595600,"[greedy, implementation]",PROGRAMMING +549,Looksery Cup 2015,12,Sasha Circle,3000,E,1433595600,[math],PROGRAMMING +549,Looksery Cup 2015,12,Yura and Developers,3000,F,1433595600,"[data structures, divide and conquer]",PROGRAMMING +549,Looksery Cup 2015,12,Happy Line,1500,G,1433595600,"[greedy, sortings]",PROGRAMMING +549,Looksery Cup 2015,12,Degenerate Matrix,1500,H,1433595600,"[binary search, math]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Two Substrings,1000,A,1433435400,"[brute force, dp, implementation, strings]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Preparing Olympiad,750,B,1433435400,"[bitmasks, brute force]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Divisibility by Eight,1000,C,1433435400,"[brute force, dp, math]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Regular Bridge,2000,D,1433435400,"[constructive algorithms, graphs, implementation]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Brackets in Implications,3000,E,1433435400,"[constructive algorithms, greedy, implementation]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and Contest,500,A,1434127500,"[implementation, sortings]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,ZgukistringZ,1250,B,1434127500,"[brute force, constructive algorithms, implementation, strings]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ hates Boxes,1750,C,1434127500,"[binary search, greedy]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and Binary Operations,2000,D,1434127500,"[combinatorics, math, matrices, number theory]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and GukiZiana,2500,E,1434127500,"[binary search, data structures]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Table,500,A,1434645000,"[implementation, math]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Books,1000,B,1434645000,"[implementation, math]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Scales,1500,C,1434645000,"[brute force, dp, greedy, math, meet-in-the-middle]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Triangles,2000,D,1434645000,"[brute force, combinatorics, data structures, geometry, math, sortings]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Brackets,2500,E,1434645000,"[brute force, dp, expression parsing, greedy, implementation]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Colored Balls,250,A,1435163400,"[combinatorics, dp, math]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Permutation,500,B,1435163400,"[binary search, combinatorics, constructive algorithms, implementation, math]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Love Triangles,1000,C,1435163400,"[dfs and similar, dsu, graphs]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Nudist Beach,1500,D,1435163400,"[binary search, graphs, greedy]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Train,3000,E,1435163400,"[dp, fft, probabilities]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Photobooks,250,A,1435163400,"[brute force, math]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Ohana Cleans Up,500,B,1435163400,"[brute force, strings]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Colored Balls,1500,C,1435163400,"[combinatorics, dp, math]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Permutation,3000,D,1435163400,[math],PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Love Triangles,3000,E,1435163400,"[dfs and similar, dsu]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Matryoshkas,250,A,1435414200,[implementation],PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Fugitive,750,B,1435414200,"[data structures, greedy, sortings]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Chocolate,1250,C,1435414200,[data structures],PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of a Top Secret,2000,D,1435414200,"[binary search, implementation, math]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Computer Network,3000,E,1435414200,"[dfs and similar, graphs, trees]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of the Zeros and Ones,250,A,1435414200,[greedy],PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Fake Numbers,250,B,1435414200,"[brute force, implementation]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Matryoshkas,1000,C,1435414200,[implementation],PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Fugitive,3000,D,1435414200,"[binary search, data structures, greedy]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Chocolate,3000,E,1435414200,"[binary search, data structures]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Ilya and Diplomas,500,A,1435676400,"[greedy, implementation]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Pasha and Tea,1000,B,1435676400,"[implementation, sortings]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Arthur and Table,1500,C,1435676400,"[brute force, data structures, dp, greedy]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Vitaly and Cycle,2000,D,1435676400,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Ann and Half-Palindrome,2500,E,1435676400,"[data structures, dp, string suffix structures, strings, trees]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Lala Land and Apple Trees,500,A,1436886600,"[brute force, implementation, sortings]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Amr and The Large Array,1000,B,1436886600,[implementation],PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Amr and Chemistry,1500,C,1436886600,"[brute force, greedy]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Guess Your Way Out! II,2250,D,1436886600,"[data structures, implementation, sortings]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,A Simple Task,2500,E,1436886600,"[data structures, sortings, strings]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald's Hexagon,500,A,1437573600,"[brute force, geometry, math]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Equivalent Strings,1000,B,1437573600,"[divide and conquer, hashing, sortings, strings]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald and Giant Chess,1500,C,1437573600,"[combinatorics, dp, math, number theory]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Randomizer,2250,D,1437573600,"[combinatorics, geometry, probabilities]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald and Path,2250,E,1437573600,"[dp, sortings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Currency System in Geraldion,500,A,1437573600,"[geometry, implementation, sortings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald is into Art,1000,B,1437573600,"[constructive algorithms, implementation]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald's Hexagon,1500,C,1437573600,[geometry],PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Equivalent Strings,2000,D,1437573600,"[hashing, implementation, strings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald and Giant Chess,2500,E,1437573600,"[combinatorics, dp]",PROGRAMMING +562,VK Cup 2015 - Finals,12,Logistical Questions,1500,A,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Clique in the Divisibility Graph,250,B,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Restoring Map,2250,C,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Restructuring Company,250,D,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Max and Min,500,E,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Matching Names,250,F,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Replicating Processes,500,G,1437898500,[],PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Matching Names,1750,A,1438273200,"[dfs and similar, strings, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Replicating Processes,2500,B,1438273200,"[constructive algorithms, greedy]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Logistical Questions,3000,C,1438273200,"[dfs and similar, divide and conquer, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Restructuring Company,1000,D,1438273200,"[data structures, dsu]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Restoring Map,3000,E,1438273200,"[bitmasks, constructive algorithms, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Clique in the Divisibility Graph,500,F,1438273200,"[dp, math, number theory]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Max and Min,2500,G,1438273200,[geometry],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Lineland Mail,500,A,1438790400,[implementation],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Berland National Library,1000,B,1438790400,[implementation],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Geometric Progression,1500,C,1438790400,"[binary search, data structures, dp]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,One-Dimensional Battle Ships,2000,D,1438790400,"[binary search, data structures, sortings]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,President and Roads,2500,E,1438790400,"[dfs and similar, graphs, hashing, shortest paths]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Mausoleum,2500,F,1438790400,[dp],PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Primes or Palindromes?,500,A,1439224200,"[brute force, implementation, math, number theory]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Symmetric and Transitive,1000,B,1439224200,"[combinatorics, dp, math]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,New Language,1500,C,1439224200,"[2-sat, greedy]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Sign Posts,2250,D,1439224200,"[brute force, math]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Longest Increasing Subsequence,2500,E,1439224200,"[data structures, dp]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Music,500,A,1439224200,"[implementation, math]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Inventory,1000,B,1439224200,[greedy],PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Primes or Palindromes?,1500,C,1439224200,"[binary search, brute force, number theory]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Symmetric and Transitive,2250,D,1439224200,"[brute force, dp, math]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,New Language,2750,E,1439224200,[],PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Elections,500,A,1439483400,[implementation],PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Simple Game,1000,B,1439483400,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Replacement,1500,C,1439483400,"[constructive algorithms, data structures, implementation]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Tree Requests,2000,D,1439483400,"[binary search, constructive algorithms, dfs and similar, trees]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Pig and Palindromes,2500,E,1439483400,"[combinatorics, dp]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Lengthening Sticks,750,A,1440261000,"[combinatorics, implementation, math]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Minimization,1250,B,1440261000,"[dp, greedy, sortings]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,CNF 2,1500,C,1440261000,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Campus,2000,D,1440261000,"[binary search, data structures, dsu, trees]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Geometric Progressions,2750,E,1440261000,[math],PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Arrays,500,A,1440261000,[sortings],PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Order Book,1000,B,1440261000,"[data structures, greedy, implementation, sortings]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Lengthening Sticks,1750,C,1440261000,"[brute force, combinatorics, dp, math]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Minimization,2250,D,1440261000,"[dp, sortings]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,CNF 2,2500,E,1440261000,[],PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Poker,500,A,1440865800,"[implementation, number theory]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Blocks,1000,B,1440865800,"[binary search, data structures, dp]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Drawing,1750,C,1440865800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Cavalry,2000,D,1440865800,"[data structures, divide and conquer, dp]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Bowling,2500,E,1440865800,[greedy],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Elections,500,A,1440865800,[implementation],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Three Musketeers,1000,B,1440865800,"[brute force, dfs and similar, graphs, hashing]",PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Poker,1500,C,1440865800,[number theory],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Blocks,2000,D,1440865800,"[data structures, dp, shortest paths]",PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Drawing,2750,E,1440865800,[],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Fibonotci,,A,1441526400,"[math, matrices]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bribes,,B,1441526400,"[dfs and similar, trees]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Party,,C,1441526400,"[bitmasks, brute force, graph matchings]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Tablecity,,D,1441526400,[constructive algorithms],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Spectator Riots,,E,1441526400,[geometry],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bulbo,,F,1441526400,"[dp, greedy]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Run for beer,,G,1441526400,"[dfs and similar, shortest paths]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bots,,H,1441526400,"[combinatorics, number theory]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Robots protection,,I,1441526400,[data structures],PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Vasya and Petya's Game,500,A,1441902600,"[math, number theory]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Invariance of Tree,1250,B,1441902600,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Points on Plane,1250,C,1441902600,"[constructive algorithms, divide and conquer, geometry, greedy, sortings]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Flights for Regular Customers,2000,D,1441902600,"[dp, matrices]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Painting Edges,2750,E,1441902600,"[binary search, data structures]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Multiplication Table,500,A,1441902600,"[implementation, number theory]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Modulo Sum,1250,B,1441902600,"[combinatorics, data structures, dp, two pointers]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Vasya and Petya's Game,1500,C,1441902600,"[implementation, number theory]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Invariance of Tree,2250,D,1441902600,[],PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Points on Plane,2250,E,1441902600,[constructive algorithms],PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,A Problem about Polyline,250,A,1442416500,"[geometry, math]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,"""Or"" Game",500,B,1442416500,"[brute force, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Weakness and Poorness,750,C,1442416500,[ternary search],PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,LCS Again,2500,D,1442416500,"[dp, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Walking!,2750,E,1442416500,"[constructive algorithms, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Mirror Box,3000,F,1442416500,"[matrices, trees]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Raising Bacteria,250,A,1442416500,[bitmasks],PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Finding Team Member,500,B,1442416500,"[brute force, implementation, sortings]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,A Problem about Polyline,1250,C,1442416500,"[binary search, math]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,"""Or"" Game",2000,D,1442416500,"[brute force, greedy, math]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Weakness and Poorness,3000,E,1442416500,[ternary search],PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,LCS Again,3000,F,1442416500,[],PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and First Steps,750,A,1442939400,"[brute force, dp, implementation]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Company,1250,B,1442939400,"[binary search, sortings, two pointers]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Park,1500,C,1442939400,"[dfs and similar, trees]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Dishes,2000,D,1442939400,"[bitmasks, dp]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Watch,2500,E,1442939400,"[data structures, hashing, strings]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Vasya the Hipster,500,A,1443430800,[implementation],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Luxurious Houses,1000,B,1443430800,[implementation],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Developing Skills,1500,C,1443430800,"[implementation, sortings]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Three Logos,2000,D,1443430800,"[bitmasks, brute force, constructive algorithms, implementation, math]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Kojiro and Furrari,3000,E,1443430800,"[dp, greedy]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Zublicanes and Mumocrates,3000,F,1443430800,"[dp, trees, two pointers]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,GCD Table,750,A,1443890700,"[constructive algorithms, greedy]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Once Again...,1250,B,1443890700,"[dp, matrices]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Superior Periodic Subarrays,1500,C,1443890700,[number theory],PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Number of Binominal Coefficients,2250,D,1443890700,"[dp, number theory]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Boolean Function,2500,E,1443890700,"[bitmasks, dp, expression parsing]",PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Asphalting Roads,500,A,1443890700,[implementation],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Robot's Task,1000,B,1443890700,[implementation],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,GCD Table,1750,C,1443890700,[],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Once Again...,2250,D,1443890700,[],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Superior Periodic Subarrays,2500,E,1443890700,[number theory],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Olesya and Rodion,500,A,1444149000,[math],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Kolya and Tanya ,1000,B,1444149000,[combinatorics],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Marina and Vasya,1500,C,1444149000,"[constructive algorithms, greedy]",PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Dima and Lisa,2000,D,1444149000,[number theory],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Anton and Ira,2500,E,1444149000,"[constructive algorithms, greedy]",PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Gennady the Dentist,500,A,1444641000,"[brute force, implementation]",PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Phillip and Trains,750,B,1444641000,[dfs and similar],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,"Alice, Bob, Oranges and Apples",1250,C,1444641000,[number theory],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Lizard Era: Beginning,1750,D,1444641000,[meet-in-the-middle],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Present for Vitalik the Philatelist ,2250,E,1444641000,"[combinatorics, math, number theory]",PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Digits of Number Pi,3000,F,1444641000,"[dp, implementation, strings]",PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Alena's Schedule,500,A,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Laurenty and Shop,1000,B,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Gennady the Dentist,1500,C,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Phillip and Trains,1750,D,1444641000,[dp],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,"Alice, Bob, Oranges and Apples",2250,E,1444641000,[number theory],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Lizard Era: Beginning,2750,F,1444641000,[meet-in-the-middle],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff and Weight Lifting,500,A,1444926600,[greedy],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in Beach,1000,B,1444926600,[dp],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in the Army,1500,C,1444926600,"[data structures, trees]",PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in Mafia,2000,D,1444926600,"[2-sat, binary search]",PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff as a Queen,2750,E,1444926600,[data structures],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff is Mad,2750,F,1444926600,"[data structures, strings]",PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff and Meat,750,A,1444926600,[greedy],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Love,1000,B,1444926600,[math],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff and Weight Lifting,1500,C,1444926600,[],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Beach,2000,D,1444926600,[],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in the Army,2500,E,1444926600,"[data structures, dfs and similar, trees]",PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Mafia,3000,F,1444926600,[],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Email Aliases,,A,1445068800,[implementation],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Layer Cake,,B,1445068800,[sortings],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Polycarp's Masterpiece,,C,1445068800,"[data structures, divide and conquer, dp]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Boulevard,,D,1445068800,"[brute force, implementation]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Training with Doors,,E,1445068800,[],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Gourmet and Banquet,,F,1445068800,"[binary search, flows, greedy]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Hiring,,G,1445068800,"[binary search, data structures]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Tourist Guide,,H,1445068800,[dfs and similar],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lottery,,I,1445068800,[implementation],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Cleaner Robot,,J,1445068800,"[dfs and similar, implementation]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Task processing,,K,1445068800,"[brute force, math]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Agricultural Archaeology,,L,1445068800,"[greedy, math]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Taxi in Berland,,M,1445068800,[shortest paths],PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Median Smoothing,750,A,1445763600,[],PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Chip 'n Dale Rescue Rangers,1000,B,1445763600,"[binary search, geometry, math]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Three States,1250,C,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Top Secret Task,1750,D,1445763600,[dp],PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Birthday,2500,E,1445763600,"[graph matchings, strings]",PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Wizards' Duel,500,A,1445763600,[math],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Rebranding,1000,B,1445763600,[implementation],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Median Smoothing,1750,C,1445763600,[constructive algorithms],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Chip 'n Dale Rescue Rangers,2000,D,1445763600,[],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Three States,2250,E,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,PawnChess,500,A,1446309000,[implementation],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,The Monster and the Squirrel,1000,B,1446309000,[math],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,The Big Race,1500,C,1446309000,[math],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,Super M,2000,D,1446309000,"[dfs and similar, dp, trees]",PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,BCPC,3000,E,1446309000,"[binary search, geometry, two pointers]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,2Char,250,A,1446655500,[brute force],PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Anton and Lines,1000,B,1446655500,"[geometry, sortings]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Beautiful Function,3000,C,1446655500,"[constructive algorithms, math]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Happy Tree Party,3000,D,1446655500,"[data structures, trees]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Strange Calculation and Cats,3000,E,1446655500,"[dp, matrices]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Warrior and Archer,500,A,1447000200,[games],PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Max and Bike,1000,B,1447000200,"[binary search, geometry]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Edo and Magnets,1500,C,1447000200,"[brute force, two pointers]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,REQ,2000,D,1447000200,"[data structures, number theory]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Cutting the Line,3000,E,1447000200,"[string suffix structures, strings]",PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Vitaly and Night,500,A,1447000200,[implementation],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Pasha and Phone,1000,B,1447000200,"[binary search, math]",PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Warrior and Archer,1500,C,1447000200,[games],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Max and Bike,2000,D,1447000200,[],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Edo and Magnets,2500,E,1447000200,[],PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Swimming Pool,500,A,1447605300,[implementation],PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Array,1000,B,1447605300,[greedy],PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Points,1500,C,1447605300,"[greedy, sortings]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Trees,2250,D,1447605300,"[dp, probabilities, sortings]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Strings,2500,E,1447605300,"[dfs and similar, dp, graphs]",PROGRAMMING +597,Testing Round #12,12,Divisibility,500,A,1447264800,[math],PROGRAMMING +597,Testing Round #12,12,Restaurant,1000,B,1447264800,"[dp, greedy, sortings]",PROGRAMMING +597,Testing Round #12,12,Subsequences,1500,C,1447264800,"[data structures, dp]",PROGRAMMING +598,Educational Codeforces Round 1,12,Tricky Sum,,A,1447426800,[math],PROGRAMMING +598,Educational Codeforces Round 1,12,Queries on a String,,B,1447426800,"[implementation, strings]",PROGRAMMING +598,Educational Codeforces Round 1,12,Nearest vectors,,C,1447426800,"[geometry, sortings]",PROGRAMMING +598,Educational Codeforces Round 1,12,Igor In the Museum,,D,1447426800,[dfs and similar],PROGRAMMING +598,Educational Codeforces Round 1,12,Chocolate Bar,,E,1447426800,"[brute force, dp]",PROGRAMMING +598,Educational Codeforces Round 1,12,Cut Length,,F,1447426800,[geometry],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Patrick and Shopping,500,A,1448037300,[implementation],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Spongebob and Joke,1000,B,1448037300,[implementation],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Day at the Beach,1500,C,1448037300,[sortings],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Spongebob and Squares,2000,D,1448037300,"[brute force, math]",PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Sandy and Nuts,3000,E,1448037300,"[bitmasks, dp]",PROGRAMMING +600,Educational Codeforces Round 2,12,Extract Numbers,,A,1448636400,[implementation],PROGRAMMING +600,Educational Codeforces Round 2,12,Queries about less or equal elements,,B,1448636400,"[binary search, sortings, two pointers]",PROGRAMMING +600,Educational Codeforces Round 2,12,Make Palindrome,,C,1448636400,[greedy],PROGRAMMING +600,Educational Codeforces Round 2,12,Area of Two Circles' Intersection,,D,1448636400,[geometry],PROGRAMMING +600,Educational Codeforces Round 2,12,Lomsat gelral,,E,1448636400,"[dfs and similar, dsu, trees]",PROGRAMMING +600,Educational Codeforces Round 2,12,Edge coloring of bipartite graph,,F,1448636400,[graphs],PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,The Two Routes,500,A,1448382900,"[graphs, shortest paths]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Lipshitz Sequence,1250,B,1448382900,[data structures],PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Kleofáš and the n-thlon,1250,C,1448382900,"[dp, probabilities]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Acyclic Organic Compounds,2000,D,1448382900,"[data structures, dfs and similar, dsu, hashing, trees]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,A Museum Robbery,2500,E,1448382900,"[data structures, dp]",PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Two Bases,500,A,1448382900,[implementation],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Approximating a Constant Range,1000,B,1448382900,"[dp, two pointers]",PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,The Two Routes,1500,C,1448382900,[],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Lipshitz Sequence,2250,D,1448382900,[],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Kleofáš and the n-thlon,2250,E,1448382900,[probabilities],PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Alternative Thinking,500,A,1448984100,"[dp, greedy]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Moodular Arithmetic,1000,B,1448984100,"[dfs and similar, dsu, math, number theory]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Lieges of Legendre,1500,C,1448984100,[games],PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Ruminations on Ruminants,2000,D,1448984100,"[geometry, math]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Pastoral Oddities,3000,E,1448984100,"[data structures, divide and conquer, dsu, trees]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Uncowed Forces,500,A,1448984100,[implementation],PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,More Cowbell,1000,B,1448984100,"[binary search, greedy]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Alternative Thinking,1500,C,1448984100,"[constructive algorithms, dp, math]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Moodular Arithmetic,2000,D,1448984100,[dsu],PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Lieges of Legendre,2500,E,1448984100,[],PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Sorting Railway Cars,500,A,1449677100,"[constructive algorithms, greedy]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Lazy Student,1000,B,1449677100,"[constructive algorithms, data structures, graphs]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Freelancer's Dreams,1500,C,1449677100,[geometry],PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Board Game,2000,D,1449677100,"[data structures, dfs and similar]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Intergalaxy Trips,2500,E,1449677100,"[probabilities, shortest paths]",PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Magic Spheres,500,A,1449677100,[implementation],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Testing Robots,1000,B,1449677100,[implementation],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Sorting Railway Cars,1500,C,1449677100,[],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Lazy Student,2000,D,1449677100,[graphs],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Freelancer's Dreams,2500,E,1449677100,[],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Chain Reaction,500,A,1450888500,"[binary search, dp]",PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Zuma,1250,B,1450888500,[dp],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Marbles,1500,C,1450888500,"[hashing, strings]",PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Power Tree,2000,D,1450888500,[data structures],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Cross Sum,3000,E,1450888500,"[binary search, geometry]",PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Saitama Destroys Hotel,500,A,1450888500,"[implementation, math]",PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Hamming Distance Sum,1000,B,1450888500,[combinatorics],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Chain Reaction,1500,C,1450888500,[dp],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Zuma,2250,D,1450888500,[],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Marbles,2500,E,1450888500,[],PROGRAMMING +609,Educational Codeforces Round 3,12,USB Flash Drives,,A,1450537200,"[greedy, implementation, sortings]",PROGRAMMING +609,Educational Codeforces Round 3,12,The Best Gift,,B,1450537200,[implementation],PROGRAMMING +609,Educational Codeforces Round 3,12,Load Balancing,,C,1450537200,[implementation],PROGRAMMING +609,Educational Codeforces Round 3,12,Gadgets for dollars and pounds,,D,1450537200,"[binary search, two pointers]",PROGRAMMING +609,Educational Codeforces Round 3,12,Minimum spanning tree for each edge,,E,1450537200,"[data structures, dfs and similar, dsu, graphs, trees]",PROGRAMMING +609,Educational Codeforces Round 3,12,Frogs and mosquitoes,,F,1450537200,[data structures],PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Pasha and Stick,500,A,1451215200,"[combinatorics, math]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Vika and Squares,1000,B,1451215200,[implementation],PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Harmony Analysis,1500,C,1451215200,[constructive algorithms],PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Vika and Segments,2500,D,1451215200,"[data structures, geometry, two pointers]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Alphabet Permutations,2500,E,1451215200,"[data structures, strings]",PROGRAMMING +611,Good Bye 2015,12,New Year and Days,500,A,1451487900,[implementation],PROGRAMMING +611,Good Bye 2015,12,New Year and Old Property,750,B,1451487900,"[brute force, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Domino,1250,C,1451487900,"[dp, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Ancient Prophecy,1750,D,1451487900,"[hashing, strings]",PROGRAMMING +611,Good Bye 2015,12,New Year and Three Musketeers,2500,E,1451487900,"[data structures, greedy]",PROGRAMMING +611,Good Bye 2015,12,New Year and Cleaning,2500,F,1451487900,"[binary search, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Cake,3000,G,1451487900,"[geometry, two pointers]",PROGRAMMING +611,Good Bye 2015,12,New Year and Forgotten Tree,3500,H,1451487900,"[constructive algorithms, flows]",PROGRAMMING +612,Educational Codeforces Round 4,12,The Text Splitting,,A,1451055600,"[brute force, implementation, strings]",PROGRAMMING +612,Educational Codeforces Round 4,12,HDD is Outdated Technology,,B,1451055600,[implementation],PROGRAMMING +612,Educational Codeforces Round 4,12,Replace To Make Regular Bracket Sequence,,C,1451055600,"[data structures, expression parsing, math]",PROGRAMMING +612,Educational Codeforces Round 4,12,The Union of k-Segments,,D,1451055600,[sortings],PROGRAMMING +612,Educational Codeforces Round 4,12,Square Root of Permutation,,E,1451055600,"[combinatorics, constructive algorithms, dfs and similar, graphs]",PROGRAMMING +612,Educational Codeforces Round 4,12,Simba on the Circle,,F,1451055600,[dp],PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Peter and Snow Blower,750,A,1452789300,"[binary search, geometry, ternary search]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Skills,1250,B,1452789300,"[binary search, brute force, two pointers]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Necklace,1250,C,1452789300,[constructive algorithms],PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Kingdom and its Cities,2000,D,1452789300,"[dfs and similar, divide and conquer, graphs, sortings, trees]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Puzzle Lover,2500,E,1452789300,"[dp, hashing, strings]",PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Link/Cut Tree,500,A,1452789300,[brute force],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Gena's Code,1000,B,1452789300,[implementation],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Peter and Snow Blower,1750,C,1452789300,[],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Skills,2250,D,1452789300,[],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Necklace,2250,E,1452789300,[],PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Bulbs,500,A,1452261900,[implementation],PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Longtail Hedgehog,1250,B,1452261900,"[dp, graphs]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Running Track,1750,C,1452261900,"[dp, greedy, strings, trees]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Multipliers,2000,D,1452261900,"[math, number theory]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Hexagons,2500,E,1452261900,"[binary search, implementation, math]",PROGRAMMING +616,Educational Codeforces Round 5,12,Comparing Two Long Integers,,A,1452524400,"[implementation, strings]",PROGRAMMING +616,Educational Codeforces Round 5,12,Dinner with Emma,,B,1452524400,"[games, greedy]",PROGRAMMING +616,Educational Codeforces Round 5,12,The Labyrinth,,C,1452524400,[dfs and similar],PROGRAMMING +616,Educational Codeforces Round 5,12,Longest k-Good Segment,,D,1452524400,"[binary search, data structures, two pointers]",PROGRAMMING +616,Educational Codeforces Round 5,12,Sum of Remainders,,E,1452524400,"[implementation, math, number theory]",PROGRAMMING +616,Educational Codeforces Round 5,12,Expensive Strings,,F,1452524400,"[string suffix structures, strings]",PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Elephant,500,A,1453563300,[math],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Chocolate,1000,B,1453563300,[combinatorics],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Watering Flowers,1250,C,1453563300,[implementation],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Polyline,1750,D,1453563300,[constructive algorithms],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,XOR and Favorite Number,2750,E,1453563300,[data structures],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Slime Combining,500,A,1454087400,[implementation],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Guess the Permutation,1000,B,1454087400,[constructive algorithms],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Constellation,1500,C,1454087400,"[geometry, implementation]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Hamiltonian Spanning Tree,1750,D,1454087400,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Robot Arm,2500,E,1454087400,[data structures],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Double Knapsack,2750,F,1454087400,"[constructive algorithms, two pointers]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Combining Slimes,3500,G,1454087400,"[dp, matrices, probabilities]",PROGRAMMING +620,Educational Codeforces Round 6,12,Professor GukiZ's Robot,,A,1453388400,"[implementation, math]",PROGRAMMING +620,Educational Codeforces Round 6,12,Grandfather Dovlet’s calculator,,B,1453388400,[implementation],PROGRAMMING +620,Educational Codeforces Round 6,12,Pearls in a Row,,C,1453388400,[greedy],PROGRAMMING +620,Educational Codeforces Round 6,12,Professor GukiZ and Two Arrays,,D,1453388400,"[binary search, two pointers]",PROGRAMMING +620,Educational Codeforces Round 6,12,New Year Tree,,E,1453388400,"[bitmasks, data structures]",PROGRAMMING +620,Educational Codeforces Round 6,12,Xors on Segments,,F,1453388400,[data structures],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Odd and Even,500,A,1454249100,[implementation],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Bishops,1000,B,1454249100,[combinatorics],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Flowers,1500,C,1454249100,[probabilities],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Rat Kwesh and Cheese,2000,D,1454249100,"[brute force, math]",PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Blocks,2500,E,1454249100,"[dp, matrices]",PROGRAMMING +622,Educational Codeforces Round 7,12,Infinite Sequence,,A,1455116400,"[implementation, math]",PROGRAMMING +622,Educational Codeforces Round 7,12,The Time,,B,1455116400,[implementation],PROGRAMMING +622,Educational Codeforces Round 7,12,Not Equal on a Segment,,C,1455116400,"[data structures, implementation]",PROGRAMMING +622,Educational Codeforces Round 7,12,Optimal Number Permutation,,D,1455116400,[constructive algorithms],PROGRAMMING +622,Educational Codeforces Round 7,12,Ants in Leaves,,E,1455116400,"[dfs and similar, greedy, trees]",PROGRAMMING +622,Educational Codeforces Round 7,12,The Sum of the k-th Powers,,F,1455116400,[math],PROGRAMMING +623,AIM Tech Round (Div. 1),1,Graph and String,500,A,1454605500,"[constructive algorithms, graphs]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Array GCD,1000,B,1454605500,"[dp, greedy, number theory]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Electric Charges,1750,C,1454605500,[binary search],PROGRAMMING +623,AIM Tech Round (Div. 1),1,Birthday,2000,D,1454605500,"[greedy, probabilities]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Transforming Sequence,2250,E,1454605500,"[combinatorics, dp, fft]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Save Luke,500,A,1454605500,[math],PROGRAMMING +624,AIM Tech Round (Div. 2),2,Making a String,1000,B,1454605500,"[greedy, sortings]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Graph and String,1500,C,1454605500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Array GCD,2000,D,1454605500,"[dp, greedy, number theory]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Electric Charges,3000,E,1454605500,[],PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Guest From the Past,750,A,1454835900,"[implementation, math]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,War of the Corporations,750,B,1454835900,"[constructive algorithms, strings]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,K-special Tables,1000,C,1454835900,"[constructive algorithms, implementation]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Finals in arithmetic,2000,D,1454835900,"[constructive algorithms, implementation]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Frog Fights,3000,E,1454835900,"[data structures, greedy]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Robot Sequence,500,A,1455384900,"[brute force, implementation]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Cards,750,B,1455384900,"[constructive algorithms, dp]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Block Towers,1000,C,1455384900,"[brute force, greedy]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Jerry's Protest,1500,D,1455384900,"[brute force, combinatorics, probabilities]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Simple Skewness,2000,E,1455384900,"[binary search, math, ternary search]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Group Projects,2500,F,1455384900,[dp],PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Raffles,3000,G,1455384900,"[data structures, greedy]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,XOR Equation,500,A,1456683000,"[dp, math]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Factory Repairs,1000,B,1456683000,[data structures],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Package Delivery,1500,C,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Preorder Test,2000,D,1456683000,"[binary search, dp, trees]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Orchestra,2500,E,1456683000,[two pointers],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Island Puzzle,3000,F,1456683000,"[dfs and similar, graphs, trees]",PROGRAMMING +628,Educational Codeforces Round 8,12,Tennis Tournament,,A,1455894000,[implementation],PROGRAMMING +628,Educational Codeforces Round 8,12,New Skateboard,,B,1455894000,[dp],PROGRAMMING +628,Educational Codeforces Round 8,12,Bear and String Distance,,C,1455894000,[greedy],PROGRAMMING +628,Educational Codeforces Round 8,12,Magic Numbers,,D,1455894000,[dp],PROGRAMMING +628,Educational Codeforces Round 8,12,Zbazi in Zeydabad,,E,1455894000,"[data structures, implementation]",PROGRAMMING +628,Educational Codeforces Round 8,12,Bear and Fair Set,,F,1455894000,[flows],PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Far Relative’s Birthday Cake,500,A,1455986100,"[brute force, constructive algorithms, implementation]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Far Relative’s Problem,1000,B,1455986100,[brute force],PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Famil Door and Brackets,1750,C,1455986100,"[dp, strings]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Babaei and Birthday Cake,2000,D,1455986100,"[data structures, dp]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Famil Door and Roads,2500,E,1455986100,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Again Twenty Five!,,A,1455807600,[number theory],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Moore's Law,,B,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Lucky Numbers,,C,1455807600,"[combinatorics, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Hexagons!,,D,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,A rectangle,,E,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Selection of Personnel,,F,1455807600,"[combinatorics, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Challenge Pennants,,G,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Benches,,H,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Parking Lot,,I,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Divisibility,,J,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Indivisibility,,K,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Cracking the Code,,L,1455807600,[implementation],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Turn,,M,1455807600,"[geometry, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Forecast,,N,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Arrow,,O,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Area of a Star,,P,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Pyramids,,Q,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Game,,R,1455807600,[games],PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Interview,500,A,1457022900,"[brute force, implementation]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Print Check,1000,B,1457022900,"[constructive algorithms, implementation]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Report,1500,C,1457022900,"[data structures, sortings]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Messenger,2000,D,1457022900,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Product Sum,2500,E,1457022900,"[data structures, dp, geometry]",PROGRAMMING +632,Educational Codeforces Round 9,12,Grandma Laura and Apples,,A,1456844400,[],PROGRAMMING +632,Educational Codeforces Round 9,12,"Alice, Bob, Two Teams",,B,1456844400,"[brute force, constructive algorithms]",PROGRAMMING +632,Educational Codeforces Round 9,12,The Smallest String Concatenation,,C,1456844400,"[sortings, strings]",PROGRAMMING +632,Educational Codeforces Round 9,12,Longest Subsequence,,D,1456844400,"[brute force, math, number theory]",PROGRAMMING +632,Educational Codeforces Round 9,12,Thief in a Shop,,E,1456844400,"[divide and conquer, dp, fft]",PROGRAMMING +632,Educational Codeforces Round 9,12,Magic Matrix,,F,1456844400,"[brute force, divide and conquer, graphs, trees]",PROGRAMMING +633,"Manthan, Codefest 16",12,Ebony and Ivory,250,A,1456506900,"[brute force, math]",PROGRAMMING +633,"Manthan, Codefest 16",12,A Trivial Problem,500,B,1456506900,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING +633,"Manthan, Codefest 16",12,Spy Syndrome 2,1500,C,1456506900,"[data structures, dp, hashing, implementation, sortings, string suffix structures, strings]",PROGRAMMING +633,"Manthan, Codefest 16",12,Fibonacci-ish,1750,D,1456506900,"[brute force, hashing, implementation, math]",PROGRAMMING +633,"Manthan, Codefest 16",12,Startup Funding,2500,E,1456506900,"[binary search, data structures, probabilities, two pointers]",PROGRAMMING +633,"Manthan, Codefest 16",12,The Chocolate Spree,2750,F,1456506900,"[dfs and similar, dp, trees]",PROGRAMMING +633,"Manthan, Codefest 16",12,Yash And Trees,3000,G,1456506900,"[bitmasks, data structures, dfs and similar]",PROGRAMMING +633,"Manthan, Codefest 16",12,Fibonacci-ish II,3000,H,1456506900,"[data structures, implementation]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Island Puzzle,500,A,1456683000,"[constructive algorithms, implementation]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,XOR Equation,1000,B,1456683000,"[constructive algorithms, dp, implementation]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Factory Repairs,1500,C,1456683000,[data structures],PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Package Delivery,2000,D,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Preorder Test,2500,E,1456683000,[],PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Orchestra,3000,F,1456683000,[two pointers],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Orchestra,500,A,1456683000,"[brute force, implementation]",PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Island Puzzle,1000,B,1456683000,[],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,XOR Equation,1500,C,1456683000,[dp],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Factory Repairs,2000,D,1456683000,[],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Package Delivery,2500,E,1456683000,"[data structures, greedy]",PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Preorder Test,3000,F,1456683000,[],PROGRAMMING +636,VeeRoute Marathon,12,Transfer,,A,1456765200,[*special],PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Voting for Photos,500,A,1457870400,[implementation],PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Chat Order,1000,B,1457870400,"[binary search, data structures, sortings]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Promocodes with Mistakes,1500,C,1457870400,"[brute force, constructive algorithms, implementation]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Running with Obstacles,2000,D,1457870400,"[data structures, dp, greedy]",PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Home Numbers,500,A,1458475200,[constructive algorithms],PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Making Genome in Berland,1000,B,1458475200,"[*special, dfs and similar, strings]",PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Road Improvement,1500,C,1458475200,"[dfs and similar, greedy, trees]",PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Three-dimensional Turtle Super Computer ,2000,D,1458475200,"[brute force, dfs and similar, graphs]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Displayed Friends,500,A,1459182900,[implementation],PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Forgotten Tree 3,750,B,1459182900,"[constructive algorithms, graphs, trees]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Polynomials,1000,C,1459182900,"[hashing, implementation, math]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Contribution,1500,D,1459182900,"[data structures, greedy, sortings]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Paradox,2000,E,1459182900,"[greedy, math, sortings]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Chemistry,3000,F,1459182900,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Seasons,,B,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Array Sum,,C,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Grasshopper,500,A,1461515700,[implementation],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Matrix,750,B,1461515700,[implementation],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Dance,1000,C,1461515700,"[brute force, constructive algorithms, implementation]",PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Random Variable,1500,D,1461515700,"[dp, implementation, math, probabilities]",PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Time Machine,2000,E,1461515700,[data structures],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and 2-SAT,3000,F,1461515700,[],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Graph,3000,G,1461515700,[],PROGRAMMING +642,VK Cup 2016 - Wild Card Round 2,12,Scheduler for Invokers,,A,1461596400,[*special],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Colors,500,A,1462633500,[implementation],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Two Paths,1000,B,1462633500,[constructive algorithms],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Levels and Regions,1750,C,1462633500,[dp],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bearish Fanpages,2250,D,1462633500,[],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Destroying Subtrees,2250,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bears and Juice,3000,F,1462633500,[math],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Choosing Ads,3000,G,1462633500,[],PROGRAMMING +644,CROC 2016 - Qualification,12,Parliament of Berland,500,A,1458118800,[constructive algorithms],PROGRAMMING +644,CROC 2016 - Qualification,12,Processing Queries,1000,B,1458118800,"[data structures, two pointers]",PROGRAMMING +644,CROC 2016 - Qualification,12,Hostname Aliases,1500,C,1458118800,"[binary search, data structures, sortings, strings]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Amity Assessment,500,A,1458318900,"[brute force, constructive algorithms, implementation]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Mischievous Mess Makers,1000,B,1458318900,"[greedy, math]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Enduring Exodus,1500,C,1458318900,"[binary search, two pointers]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Robot Rapping Results Report,2000,D,1458318900,"[binary search, dp, graphs]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Intellectual Inquiry,2500,E,1458318900,"[dp, greedy, strings]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Cowslip Collections,3000,F,1458318900,"[combinatorics, math, number theory]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Armistice Area Apportionment,3500,G,1458318900,"[binary search, geometry]",PROGRAMMING +646,Технокубок 2016 - Ознакомительный Раунд 1,12,Три брата,500,A,1458568800,[],PROGRAMMING +646,Технокубок 2016 - Ознакомительный Раунд 1,12,Ошибка передачи сообщения,1000,B,1458568800,[strings],PROGRAMMING +647,Технокубок 2016 - Ознакомительный Раунд 2,12,Оценки Васи,500,A,1458799200,[],PROGRAMMING +647,Технокубок 2016 - Ознакомительный Раунд 2,12,Звёздное небо,1000,B,1458799200,[],PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Наибольший подъем,500,A,1458745200,[constructive algorithms],PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собери стол,1000,B,1458745200,"[constructive algorithms, sortings]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Путь Робота,1500,C,1458745200,"[dfs and similar, graphs]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собачки и миски,2000,D,1458745200,"[greedy, sortings]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собери число,2500,E,1458745200,[],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Любимые числа Поликарпа,500,A,1458975600,[constructive algorithms],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Этажи,1000,B,1458975600,[constructive algorithms],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Печать условий,1500,C,1458975600,"[greedy, sortings]",PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Дефрагментация памяти,2000,D,1458975600,"[greedy, implementation]",PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Автобус,2500,E,1458975600,"[binary search, data structures, greedy, sortings]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Watchmen,500,A,1457342700,"[data structures, math]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Image Preview,1000,B,1457342700,"[binary search, dp, two pointers]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Table Compression,1500,C,1457342700,"[dfs and similar, dp, dsu, graphs, greedy]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Zip-line,2000,D,1457342700,"[binary search, data structures, dp]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Clockwork Bomb,2500,E,1457342700,"[data structures, dfs and similar, dsu, trees]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Joysticks,500,A,1457342700,"[dp, greedy]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Beautiful Paintings,1000,B,1457342700,"[greedy, sortings]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Watchmen,1500,C,1457342700,"[data structures, geometry, implementation, sortings]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Image Preview,2000,D,1457342700,"[binary search, dp, two pointers]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Table Compression,2500,E,1457342700,"[dsu, graphs, greedy]",PROGRAMMING +652,Educational Codeforces Round 10,12,Gabriel and Caterpillar,,A,1458910800,[implementation],PROGRAMMING +652,Educational Codeforces Round 10,12,z-sort,,B,1458910800,[sortings],PROGRAMMING +652,Educational Codeforces Round 10,12,Foe Pairs,,C,1458910800,[two pointers],PROGRAMMING +652,Educational Codeforces Round 10,12,Nested Segments,,D,1458910800,"[data structures, sortings]",PROGRAMMING +652,Educational Codeforces Round 10,12,Pursuit For Artifacts,,E,1458910800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +652,Educational Codeforces Round 10,12,Ants on a Circle,,F,1458910800,"[constructive algorithms, math]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Three Balls,500,A,1458376500,"[brute force, implementation, sortings]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Compressing,1000,B,1458376500,"[brute force, dfs and similar, dp, strings]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Up-Down,1500,C,1458376500,"[brute force, implementation]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Delivery Bears,2000,D,1458376500,"[binary search, flows]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Forgotten Tree 2,2500,E,1458376500,"[dfs and similar, dsu, graphs]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Paper task,3500,F,1458376500,"[data structures, string suffix structures]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Move by Prime,3500,G,1458376500,[combinatorics],PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Amity Assessment,500,A,1458318900,[],PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Mischievous Mess Makers,1000,B,1458318900,[],PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Enduring Exodus,1500,C,1458318900,"[binary search, two pointers]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Robot Rapping Results Report,2000,D,1458318900,"[binary search, graphs]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Intellectual Inquiry,2500,E,1458318900,"[dp, greedy, strings]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Cowslip Collections,3000,F,1458318900,"[combinatorics, number theory]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Armistice Area Apportionment,3500,G,1458318900,[],PROGRAMMING +656,April Fools Day Contest 2016,12,Da Vinci Powers,,A,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Scrambled,,B,1459526400,"[*special, implementation]",PROGRAMMING +656,April Fools Day Contest 2016,12,Without Text,,C,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Rosetta Problem,,D,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Out of Controls,,E,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Ace It!,,F,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,You're a Professional,,G,1459526400,[*special],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Forgotten Tree 3,500,A,1459182900,[graphs],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Polynomials,1000,B,1459182900,[math],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Contribution,1500,C,1459182900,[sortings],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Paradox,2000,D,1459182900,[sortings],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Chemistry,3000,E,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Reverse Radewoosh,500,A,1459182900,[implementation],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Displayed Friends,1000,B,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Forgotten Tree 3,1500,C,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Polynomials,2000,D,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Contribution,2500,E,1459182900,[],PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Round House,500,A,1459353900,"[implementation, math]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Qualifying Contest,1000,B,1459353900,[sortings],PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Tanya and Toys,1000,C,1459353900,"[greedy, implementation]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Bicycle Race,1250,D,1459353900,"[geometry, implementation, math]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,New Reform,1500,E,1459353900,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Polycarp and Hay,2000,F,1459353900,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Fence Divercity,2500,G,1459353900,"[combinatorics, dp]",PROGRAMMING +660,Educational Codeforces Round 11,12,Co-prime Array,,A,1460127600,"[greedy, implementation]",PROGRAMMING +660,Educational Codeforces Round 11,12,Seating On Bus,,B,1460127600,[implementation],PROGRAMMING +660,Educational Codeforces Round 11,12,Hard Process,,C,1460127600,"[binary search, dp, two pointers]",PROGRAMMING +660,Educational Codeforces Round 11,12,Number of Parallelograms,,D,1460127600,[geometry],PROGRAMMING +660,Educational Codeforces Round 11,12,Different Subsets For All Tuples,,E,1460127600,[combinatorics],PROGRAMMING +660,Educational Codeforces Round 11,12,Bear and Bowling 4,,F,1460127600,"[binary search, data structures, geometry, ternary search]",PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Seasons,,B,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Array Sum,,C,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Gambling Nim,500,A,1460729700,"[bitmasks, math, matrices, probabilities]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Graph Coloring,250,B,1460729700,[dfs and similar],PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Binary Table,2250,C,1460729700,"[bitmasks, brute force, divide and conquer, dp, fft, math]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,International Olympiad,250,D,1460729700,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,To Hack or not to Hack,2250,E,1460729700,"[brute force, dp, greedy]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Rebus,500,A,1460824500,"[constructive algorithms, expression parsing, greedy, math]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,International Olympiad,1000,B,1460824500,"[brute force, constructive algorithms, greedy, strings]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Graph Coloring,1500,C,1460824500,[dfs and similar],PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,To Hack or not to Hack,2500,D,1460824500,"[brute force, dp, greedy]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Binary Table,2500,E,1460824500,"[bitmasks, divide and conquer, dp]",PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Complicated GCD,500,A,1460824500,[math],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Rebus,1000,B,1460824500,[greedy],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,International Olympiad,1500,C,1460824500,[greedy],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Graph Coloring,2000,D,1460824500,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,To Hack or not to Hack,3000,E,1460824500,[],PROGRAMMING +665,Educational Codeforces Round 12,12,Buses Between Cities,,A,1461164400,[implementation],PROGRAMMING +665,Educational Codeforces Round 12,12,Shopping,,B,1461164400,[brute force],PROGRAMMING +665,Educational Codeforces Round 12,12,Simple Strings,,C,1461164400,"[dp, greedy, strings]",PROGRAMMING +665,Educational Codeforces Round 12,12,Simple Subset,,D,1461164400,"[constructive algorithms, greedy]",PROGRAMMING +665,Educational Codeforces Round 12,12,Beautiful Subarrays,,E,1461164400,"[data structures, divide and conquer]",PROGRAMMING +665,Educational Codeforces Round 12,12,Four Divisors,,F,1461164400,"[dp, math, number theory]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Reberland Linguistics,500,A,1461947700,"[dp, implementation]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,World Tour,1000,B,1461947700,"[graphs, shortest paths]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Codeword,2000,C,1461947700,[combinatorics],PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Chain Reaction,2000,D,1461947700,[brute force],PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Forensic Examination,3000,E,1461947700,"[data structures, string suffix structures]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Pouring Rain,500,A,1461947700,"[geometry, math]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Coat of Anticubism,1000,B,1461947700,"[constructive algorithms, geometry]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Reberland Linguistics,1500,C,1461947700,"[dp, strings]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,World Tour,2000,D,1461947700,"[brute force, graphs, shortest paths]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Chain Reaction,3000,E,1461947700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Matrix,500,A,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Dance,1000,B,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Random Variable,1500,C,1461515700,[math],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Time Machine,2000,D,1461515700,[data structures],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and 2-SAT,3000,E,1461515700,[graphs],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Graph,3000,F,1461515700,[dp],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Presents,500,A,1461515700,[math],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Grasshopper,1000,B,1461515700,[],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Matrix,1500,C,1461515700,"[constructive algorithms, implementation]",PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Dance,2000,D,1461515700,"[data structures, implementation, math]",PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Time Machine,2500,E,1461515700,[data structures],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Holidays,500,A,1462464300,"[brute force, constructive algorithms]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Game of Robots,750,B,1462464300,[implementation],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Cinema,1000,C,1462464300,"[implementation, sortings]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Magic Powder - 1,1000,D1,1462464300,"[binary search, brute force]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Magic Powder - 2,500,D2,1462464300,[binary search],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Correct Bracket Sequence Editor,2000,E,1462464300,"[data structures, dsu]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Restore a Number,2500,F,1462464300,"[constructive algorithms, strings]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Recycling Bottles,500,A,1462984500,"[dp, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Robin Hood,1000,B,1462984500,"[binary search, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Ultimate Weirdness of an Array,1500,C,1462984500,"[data structures, number theory]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Roads in Yusland,2000,D,1462984500,"[data structures, dp, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Organizing a Race,3000,E,1462984500,"[data structures, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Summer Camp,500,A,1462984500,[implementation],PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Different is Good,1000,B,1462984500,"[constructive algorithms, implementation, strings]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Recycling Bottles,1500,C,1462984500,"[brute force, geometry, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Robin Hood,2000,D,1462984500,"[binary search, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Ultimate Weirdness of an Array,2500,E,1462984500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Game,500,A,1462633500,[implementation],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Problems for Round,750,B,1462633500,"[greedy, implementation]",PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Colors,1000,C,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Two Paths,1500,D,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Levels and Regions,2250,E,1462633500,"[divide and conquer, dp]",PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bearish Fanpages,3000,F,1462633500,[],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Colors,500,A,1462633500,"[brute force, data structures, implementation]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Two Paths,1000,B,1462633500,"[constructive algorithms, graphs]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Levels and Regions,1750,C,1462633500,"[divide and conquer, dp]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bearish Fanpages,2250,D,1462633500,[],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Destroying Subtrees,2250,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bears and Juice,3000,F,1462633500,[combinatorics],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Choosing Ads,3000,G,1462633500,[],PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Infinite Sequence,500,A,1463416500,[math],PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Restoring Painting,1000,B,1463416500,"[brute force, constructive algorithms, math]",PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Money Transfers,1500,C,1463416500,"[data structures, greedy, sortings]",PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Tree Construction,2000,D,1463416500,"[data structures, trees]",PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Trains and Statistic,2500,E,1463416500,"[data structures, dp, greedy]",PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Nicholas and Permutation,500,A,1464188700,[implementation],PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Pyramid of Glasses,1000,B,1464188700,[implementation],PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Vasya and String,1500,C,1464188700,"[binary search, dp, two pointers]",PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Theseus and labyrinth,2250,D,1464188700,"[implementation, shortest paths]",PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,The Last Fight Between Human and AI,2250,E,1464188700,[math],PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Fence,500,A,1464798900,[implementation],PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Food Processor,1000,B,1464798900,"[implementation, math]",PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Label,1500,C,1464798900,[implementation],PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Treasure,2250,D,1464798900,"[data structures, graphs]",PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Balloons,2250,E,1464798900,"[binary search, brute force, dp, implementation]",PROGRAMMING +678,Educational Codeforces Round 13,12,Johny Likes Numbers,,A,1465834200,[implementation],PROGRAMMING +678,Educational Codeforces Round 13,12,The Same Calendar,,B,1465834200,[implementation],PROGRAMMING +678,Educational Codeforces Round 13,12,Joty and Chocolate,,C,1465834200,"[implementation, math, number theory]",PROGRAMMING +678,Educational Codeforces Round 13,12,Iterated Linear Function,,D,1465834200,"[math, number theory]",PROGRAMMING +678,Educational Codeforces Round 13,12,Another Sith Tournament,,E,1465834200,"[bitmasks, dp]",PROGRAMMING +678,Educational Codeforces Round 13,12,Lena and Queries,,F,1465834200,"[data structures, divide and conquer, geometry]",PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Prime 100,750,A,1465403700,[constructive algorithms],PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Tower of Cubes,1250,B,1465403700,"[dp, greedy]",PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Square Grid,1500,C,1465403700,"[dfs and similar, dsu, implementation]",PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Chase,2000,D,1465403700,"[brute force, dfs and similar, implementation]",PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Bad Powers of 42,2500,E,1465403700,[data structures],PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Five Cards,500,A,1465403700,"[constructive algorithms, implementation]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Finding Criminals,1000,B,1465403700,"[constructive algorithms, implementation]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Prime 100,1750,C,1465403700,"[constructive algorithms, number theory]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Tower of Cubes,2250,D,1465403700,"[brute force, constructive algorithms, greedy]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Square Grid,2750,E,1465403700,[],PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,A Good Contest,500,A,1465922100,[implementation],PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Economy Game,1000,B,1465922100,[brute force],PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Heap Operations,1500,C,1465922100,"[data structures, greedy]",PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Gifts by the List,2000,D,1465922100,"[dfs and similar, trees]",PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Runaway to a Shadow,2500,E,1465922100,[geometry],PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Numbers,500,A,1466181300,"[constructive algorithms, number theory]",PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Mex,1000,B,1466181300,[sortings],PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and the Tree,1500,C,1466181300,"[dfs and similar, dp, trees]",PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Strings,2000,D,1466181300,"[dp, strings]",PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Triangles,3000,E,1466181300,"[geometry, two pointers]",PROGRAMMING +683,Surprise Language Round #8,12,The Check of the Point,,A,1466092800,[],PROGRAMMING +683,Surprise Language Round #8,12,The Teacher of Physical Education,,B,1466092800,[],PROGRAMMING +683,Surprise Language Round #8,12,Symmetric Difference,,C,1466092800,[],PROGRAMMING +683,Surprise Language Round #8,12,Chocolate Bar,,D,1466092800,[],PROGRAMMING +683,Surprise Language Round #8,12,Hammer throwing,,E,1466092800,[],PROGRAMMING +683,Surprise Language Round #8,12,Reformat the String,,F,1466092800,[],PROGRAMMING +683,Surprise Language Round #8,12,The Fraction,,G,1466092800,[],PROGRAMMING +683,Surprise Language Round #8,12,Exchange of Books,,H,1466092800,[],PROGRAMMING +683,Surprise Language Round #8,12,Loader,,I,1466092800,[],PROGRAMMING +683,Surprise Language Round #8,12,The Hero with Bombs,,J,1466092800,[],PROGRAMMING +684,Codeforces Marathon Round 1,12,Online Exam,,A2,1465722000,[],PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Robbers' watch,500,A,1466699700,"[brute force, dp, math]",PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Kay and Snowflake,1250,B,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Optimal Point,1250,C,1466699700,"[binary search, math]",PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Kay and Eternity,2000,D,1466699700,[brute force],PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Travelling Through the Snow Queen's Kingdom,2500,E,1466699700,"[brute force, graphs]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Free Ice Cream,500,A,1466699700,"[constructive algorithms, implementation]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Little Robber Girl's Zoo,1000,B,1466699700,"[constructive algorithms, implementation, sortings]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Robbers' watch,1500,C,1466699700,"[brute force, math]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Kay and Snowflake,2250,D,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Optimal Point,2250,E,1466699700,[],PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,NP-Hard Problem,500,A,1467219900,"[dfs and similar, graphs]",PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,Remainders Game,1000,B,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,The Values You Can Make,1500,C,1467219900,[dp],PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,Dividing Kingdom II,2000,D,1467219900,"[brute force, data structures, dsu, sortings]",PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,TOF,2500,E,1467219900,[],PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,Opponents,500,A,1467219900,[implementation],PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,Lovely Palindromes,1000,B,1467219900,"[constructive algorithms, math]",PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,NP-Hard Problem,1500,C,1467219900,"[dfs and similar, graphs]",PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,Remainders Game,2000,D,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,The Values You Can Make,2500,E,1467219900,[dp],PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Cellphone,500,A,1467822900,"[brute force, constructive algorithms, implementation]",PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Shortcuts,1000,B,1467822900,[dfs and similar],PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Chocolate Thieves,1500,C,1467822900,"[binary search, math]",PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Friends and Subsequences,2000,D,1467822900,"[binary search, data structures]",PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Geometry Problem,2500,E,1467822900,"[combinatorics, data structures, implementation]",PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (easy),,A1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (medium),,A2,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (hard),,A3,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (easy),,B1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (medium),,B2,1468137600,[geometry],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (hard),,B3,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (easy),,C1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (medium),,C2,1468137600,"[dfs and similar, graphs, trees]",PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (hard),,C3,1468137600,[trees],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (easy),,D1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (medium),,D2,1468137600,[combinatorics],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (hard),,D3,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (I),,E1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (II),,E2,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (easy),,F1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (medium),,F2,1468137600,"[constructive algorithms, hashing, trees]",PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (hard),,F3,1468137600,[trees],PROGRAMMING +691,Educational Codeforces Round 14,12,Fashion in Berland,,A,1468425600,[implementation],PROGRAMMING +691,Educational Codeforces Round 14,12,s-palindrome,,B,1468425600,[implementation],PROGRAMMING +691,Educational Codeforces Round 14,12,Exponential notation,,C,1468425600,[implementation],PROGRAMMING +691,Educational Codeforces Round 14,12,Swaps in Permutation,,D,1468425600,"[dfs and similar, dsu]",PROGRAMMING +691,Educational Codeforces Round 14,12,Xor-sequences,,E,1468425600,[matrices],PROGRAMMING +691,Educational Codeforces Round 14,12,Couple Cover,,F,1468425600,"[brute force, dp, number theory]",PROGRAMMING +695,VK Cup 2016 - Finals,12,LRU,1250,A,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Break Up,1250,B,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Limak and Shooting Points,1250,C,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Cron,1750,D,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Huffman Coding on Segment,2500,E,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Coprime Permutation,2500,F,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Cool Slogans,3000,G,1467534000,[],PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,Lorenzo Von Matterhorn,500,A,1468514100,"[data structures, implementation, trees]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,Puzzles,1000,B,1468514100,"[dfs and similar, math, probabilities, trees]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,PLEASE,1500,C,1468514100,"[combinatorics, dp, implementation, math, matrices]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,Legen...,2000,D,1468514100,"[data structures, dp, matrices, strings]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,...Wait for it...,2500,E,1468514100,"[data structures, dsu, trees]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,...Dary!,3000,F,1468514100,"[binary search, geometry, two pointers]",PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Pineapple Incident,500,A,1468514100,[math],PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Barnicle,1000,B,1468514100,[implementation],PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Lorenzo Von Matterhorn,1500,C,1468514100,"[data structures, implementation, trees]",PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Puzzles,2000,D,1468514100,[],PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,PLEASE,2500,E,1468514100,"[math, number theory]",PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Legen...,3000,F,1468514100,[],PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Vacations,500,A,1468933500,[dp],PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Fix a Tree,1000,B,1468933500,"[constructive algorithms, dfs and similar, dsu, trees]",PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,LRU,1500,C,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Limak and Shooting Points,2000,D,1468933500,"[brute force, geometry]",PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Cron,2500,E,1468933500,[],PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Coprime Permutation,3000,F,1468933500,"[combinatorics, number theory]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Launch of Collider,500,A,1468933500,[implementation],PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,One Bomb,1000,B,1468933500,[implementation],PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Vacations,1500,C,1468933500,"[brute force, dp]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Fix a Tree,2000,D,1468933500,"[constructive algorithms, dfs and similar, dsu]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,LRU,2500,E,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Limak and Shooting Points,3000,F,1468933500,[],PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,As Fast As Possible,500,A,1469205300,"[binary search, math]",PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Connecting Universities,1000,B,1469205300,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Break Up,1500,C,1469205300,[dfs and similar],PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Huffman Coding on Segment,2250,D,1469205300,"[data structures, greedy]",PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Cool Slogans,3000,E,1469205300,"[string suffix structures, strings]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Cards,500,A,1469205300,[greedy],PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Cells Not Under Attack,750,B,1469205300,[math],PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,They Are Everywhere,1000,C,1469205300,"[binary search, two pointers]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,As Fast As Possible,1500,D,1469205300,"[binary search, math]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Connecting Universities,2000,E,1469205300,"[dfs and similar, graphs]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Break Up,2500,F,1469205300,[graphs],PROGRAMMING +702,Educational Codeforces Round 15,12,Maximum Increase,,A,1469804400,"[dp, greedy, implementation]",PROGRAMMING +702,Educational Codeforces Round 15,12,Powers of Two,,B,1469804400,"[brute force, data structures, implementation]",PROGRAMMING +702,Educational Codeforces Round 15,12,Cellular Network,,C,1469804400,"[binary search, two pointers]",PROGRAMMING +702,Educational Codeforces Round 15,12,Road to Post Office,,D,1469804400,[math],PROGRAMMING +702,Educational Codeforces Round 15,12,Analysis of Pathes in Functional Graph,,E,1469804400,"[data structures, graphs]",PROGRAMMING +702,Educational Codeforces Round 15,12,T-Shirts,,F,1469804400,[data structures],PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and Game,500,A,1470323700,[implementation],PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and trip,1000,B,1470323700,"[implementation, math]",PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Chris and Road,1750,C,1470323700,"[geometry, implementation]",PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and Interesting sum,2000,D,1470323700,[data structures],PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and Divisors,2250,E,1470323700,"[dp, number theory]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Thor,500,A,1470578700,"[brute force, data structures, implementation]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Ant Man,1250,B,1470578700,"[dp, graphs, greedy]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Black Widow,1250,C,1470578700,[dp],PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Captain America,2000,D,1470578700,[flows],PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Iron Man,2500,E,1470578700,[],PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Hulk,500,A,1470578700,[],PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Spider Man,1000,B,1470578700,[games],PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Thor,1500,C,1470578700,"[data structures, implementation]",PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Ant Man,2250,D,1470578700,"[dp, graphs]",PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Black Widow,2250,E,1470578700,[],PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Beru-taxi,500,A,1470933300,"[brute force, geometry]",PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Interesting drink,1000,B,1470933300,"[binary search, implementation]",PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Hard problem,1500,C,1470933300,[dp],PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Vasiliy's Multiset,2000,D,1470933300,"[binary search, data structures, trees]",PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Working routine,2500,E,1470933300,"[data structures, implementation, matrices]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Brain's Photos,500,A,1471698300,[implementation],PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Bakery,1000,B,1471698300,[graphs],PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Pythagorean Triples,1500,C,1471698300,"[math, number theory]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Persistent Bookcase ,2000,D,1471698300,"[data structures, dfs and similar, implementation]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Garlands,2500,E,1471698300,[data structures],PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Letters Cyclic Shift,500,A,1472056500,"[constructive algorithms, implementation]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Recover the String,1000,B,1472056500,"[constructive algorithms, implementation, math]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Centroids,1500,C,1472056500,"[data structures, dfs and similar, dp, greedy, trees]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Incorrect Flow,2000,D,1472056500,[flows],PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Student's Camp,2500,E,1472056500,"[dp, math]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Juicer,500,A,1472056500,[implementation],PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Checkpoints,1000,B,1472056500,"[implementation, sortings]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Letters Cyclic Shift,1500,C,1472056500,[greedy],PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Recover the String,2000,D,1472056500,"[greedy, math]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Centroids,2500,E,1472056500,"[dp, trees]",PROGRAMMING +710,Educational Codeforces Round 16,12,King Moves,,A,1471875000,[implementation],PROGRAMMING +710,Educational Codeforces Round 16,12,Optimal Point on a Line,,B,1471875000,"[brute force, sortings]",PROGRAMMING +710,Educational Codeforces Round 16,12,Magic Odd Square,,C,1471875000,[constructive algorithms],PROGRAMMING +710,Educational Codeforces Round 16,12,Two Arithmetic Progressions,,D,1471875000,[math],PROGRAMMING +710,Educational Codeforces Round 16,12,Generate a String,,E,1471875000,"[dfs and similar, dp]",PROGRAMMING +710,Educational Codeforces Round 16,12,String Set Queries,,F,1471875000,"[brute force, data structures, hashing, string suffix structures, strings]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Bus to Udayland,500,A,1472472300,"[brute force, implementation]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Chris and Magic Square,1000,B,1472472300,[constructive algorithms],PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Coloring Trees,1500,C,1472472300,[dp],PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Directed Roads,2000,D,1472472300,"[combinatorics, dfs and similar, graphs]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,ZS and The Birthday Paradox,2500,E,1472472300,"[math, number theory, probabilities]",PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Crow,500,A,1473525900,[implementation],PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Trident,1000,B,1473525900,[implementation],PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and De-Evolution,1500,C,1473525900,"[greedy, math]",PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Scores,2250,D,1473525900,"[combinatorics, dp]",PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Casinos,2500,E,1473525900,"[data structures, math, probabilities]",PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Sonya and Queries,500,A,1473784500,[data structures],PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Searching Rectangles,1000,B,1473784500,"[binary search, constructive algorithms]",PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Sonya and Problem Wihtout a Legend,2000,C,1473784500,"[dp, sortings]",PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Animals and Puzzle,2000,D,1473784500,"[binary search, data structures]",PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Sonya Partymaker,2000,E,1473784500,[],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Meeting of Old Friends,500,A,1473784500,[math],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Filya and Homework,1000,B,1473784500,[implementation],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Sonya and Queries,1000,C,1473784500,[data structures],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Searching Rectangles,2000,D,1473784500,[binary search],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Sonya and Problem Wihtout a Legend,3000,E,1473784500,"[dp, flows, sortings]",PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Plus and Square Root,500,A,1474119900,"[constructive algorithms, math]",PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Complete The Graph,1000,B,1474119900,"[binary search, constructive algorithms, graphs, shortest paths]",PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Digit Tree,1500,C,1474119900,"[divide and conquer, dsu]",PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Create a Maze,2500,D,1474119900,[constructive algorithms],PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Complete the Permutations,2750,E,1474119900,[],PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Crazy Computer,500,A,1474119900,[implementation],PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Complete the Word,1000,B,1474119900,[two pointers],PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Plus and Square Root,1500,C,1474119900,"[constructive algorithms, math, number theory]",PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Complete The Graph,2000,D,1474119900,"[graphs, shortest paths]",PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Digit Tree,2500,E,1474119900,[divide and conquer],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Festival Organization,,A,1473584400,"[math, number theory]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,R3D3’s Summer Adventure,,B,1473584400,[greedy],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Potions Homework,,C,1473584400,"[implementation, sortings]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Dexterina’s Lab,,D,1473584400,"[games, matrices, probabilities]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,"Paint it really, really dark gray",,E,1473584400,[dfs and similar],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Heroes of Making Magic III,,F,1473584400,[data structures],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Underfail,,G,1473584400,[flows],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Pokermon League challenge,,H,1473584400,[probabilities],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Cowboy Beblop at his computer,,I,1473584400,[],PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Efim and Strange Grade,500,A,1474635900,[implementation],PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Sasha and Array,1250,C,1474635900,"[data structures, math, matrices]",PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Andrew and Chemistry,2000,D,1474635900,"[hashing, trees]",PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Matvey's Birthday,2500,E,1474635900,[graphs],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Vitya in the Countryside,500,A,1474635900,[implementation],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Anatoly and Cockroaches,1000,B,1474635900,[greedy],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Efim and Strange Grade,1500,C,1474635900,[implementation],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Sasha and Array,2250,E,1474635900,"[data structures, math, matrices]",PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Closing ceremony,,A,1474196700,[greedy],PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cactusophobia,,B,1474196700,"[dfs and similar, flows]",PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Homework,,C,1474196700,[],PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Slalom,,D,1474196700,"[data structures, dp]",PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cipher,,E,1474196700,[],PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Array Covering,,F,1474196700,[],PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,One-dimensional Japanese Crossword,500,A,1475244300,[implementation],PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Passwords,1000,B,1475244300,"[sortings, strings]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Journey,1500,C,1475244300,"[dp, graphs]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Maxim and Array,2000,D,1475244300,"[constructive algorithms, data structures, greedy]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Road to Home,2750,E,1475244300,"[binary search, dp]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Broken Clock,500,A,1475330700,"[brute force, implementation]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Verse Pattern,500,B,1475330700,"[implementation, strings]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Destroying Array,1000,C,1475330700,"[data structures, dsu]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Generating Sets,1500,D,1475330700,"[binary search, data structures, dfs and similar, greedy]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Research Rover,2000,E,1475330700,"[combinatorics, dp]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Cyclic Cipher,2500,F,1475330700,"[chinese remainder theorem, implementation, number theory, two pointers]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,The New Year: Meeting Friends,500,A,1475494500,[sortings],PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,Text Document Analysis,1000,B,1475494500,"[expression parsing, implementation]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,Polycarp at the Radio,1500,C,1475494500,[greedy],PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,Lakes in Berland,2000,D,1475494500,"[dfs and similar, dsu, greedy]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,One-Way Reform,2500,E,1475494500,"[constructive algorithms, dfs and similar, flows, graphs, greedy]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,st-Spanning Tree,3000,F,1475494500,"[dsu, graphs, greedy, implementation]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Checking the Calendar,500,A,1475928900,[implementation],PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Batch Sort,1000,B,1475928900,"[brute force, greedy, implementation]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Ray Tracing,1500,C,1475928900,"[greedy, hashing, implementation, math, number theory]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Dense Subsequence,1500,D,1475928900,"[data structures, greedy]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Goods transportation,2500,E,1475928900,"[dp, flows]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Uniformly Branched Trees,2500,F,1475928900,[combinatorics],PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Xor-matic Number of the Graph,2500,G,1475928900,"[bitmasks, graphs, math, trees]",PROGRAMMING +725,Canada Cup 2016,12,Jumping Ball,500,A,1477148700,[implementation],PROGRAMMING +725,Canada Cup 2016,12,Food on the Plane,1000,B,1477148700,[math],PROGRAMMING +725,Canada Cup 2016,12,Hidden Word,1500,C,1477148700,"[brute force, constructive algorithms, implementation]",PROGRAMMING +725,Canada Cup 2016,12,Contest Balloons,2250,D,1477148700,"[data structures, greedy]",PROGRAMMING +725,Canada Cup 2016,12,Too Much Money,2500,E,1477148700,[brute force],PROGRAMMING +725,Canada Cup 2016,12,Family Photos,3250,F,1477148700,[greedy],PROGRAMMING +725,Canada Cup 2016,12,Messages on a Tree,3500,G,1477148700,[],PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Transformation: from A to B,1000,A,1476522300,"[brute force, dfs and similar]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Bill Total Value,1000,B,1476522300,"[expression parsing, implementation]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Guess the Array,1500,C,1476522300,"[constructive algorithms, math]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,T-shirts Distribution,1500,D,1476522300,"[constructive algorithms, flows, greedy]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Games on a CD,2500,E,1476522300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Polycarp's problems,3000,F,1476522300,"[binary search, dp, greedy]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Interview with Oleg,500,A,1479632700,"[implementation, strings]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Spotlights,1000,B,1479632700,"[dp, implementation]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Road to Cinema,1750,C,1479632700,"[binary search, greedy, sortings]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Sea Battle,1750,D,1479632700,"[constructive algorithms, greedy]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Subordinates,2000,E,1479632700,"[constructive algorithms, data structures, greedy, sortings]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Financiers Game,2500,F,1479632700,[dp],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Toda 2,,A,1477209600,[greedy],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Minimum and Maximum,,B,1477209600,[constructive algorithms],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bulmart,,C,1477209600,"[binary search, dfs and similar]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Running Over The Bridges,,D,1477209600,"[greedy, implementation]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Award Ceremony,,E,1477209600,[greedy],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Ber Patio,,F,1477209600,[],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Car Repair Shop,,G,1477209600,[implementation],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Delete Them,,H,1477209600,[implementation],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Olympiad in Programming and Sports,,I,1477209600,"[dp, flows, greedy]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bottles,,J,1477209600,[dp],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Roads Orientation Problem,,K,1477209600,[],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Expression Queries,,L,1477209600,[],PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Night at the Museum,500,A,1476611100,"[implementation, strings]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Coupons and Discounts,1000,B,1476611100,"[constructive algorithms, greedy]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Socks,1500,C,1476611100,"[dsu, graphs, greedy]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,80-th Level Archeology,2000,D,1476611100,"[brute force, data structures, greedy, sortings]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Funny Game,2500,E,1476611100,"[dp, games]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Video Cards,3000,F,1476611100,"[brute force, data structures, implementation, number theory]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Buy a Shovel,500,A,1476714900,"[brute force, constructive algorithms, math]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Cormen --- The Best Friend Of a Man,1000,B,1476714900,"[dp, greedy]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Sanatorium,1500,C,1476714900,"[constructive algorithms, greedy]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Exams,2000,D,1476714900,"[binary search, greedy, sortings]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Sockets,2000,E,1476714900,"[greedy, sortings]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Tourist Reform,2500,F,1476714900,[dfs and similar],PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Grasshopper And the String,500,A,1477922700,[implementation],PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Parade,1000,B,1477922700,[math],PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Epidemic in Monstropolis,2000,C,1477922700,"[constructive algorithms, dp, greedy, two pointers]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Kostya the Sculptor,2000,D,1477922700,"[data structures, hashing]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Sleep in Class,2750,E,1477922700,"[data structures, math, two pointers]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Drivers Dissatisfaction,3000,F,1477922700,"[data structures, dsu, graphs, trees]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Danik,500,A,1479227700,"[implementation, strings]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Digits,750,B,1479227700,"[implementation, math]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Making Potions,1250,C,1479227700,"[binary search, dp, greedy, two pointers]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Chess,1500,D,1479227700,[implementation],PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Tree,2000,E,1479227700,"[dfs and similar, dp, trees]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and School,2750,F,1479227700,"[bitmasks, constructive algorithms, implementation, math]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Ostap and Grasshopper,500,A,1480264500,"[implementation, strings]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Urbanization,1000,B,1480264500,"[greedy, sortings]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Tennis Championship,1750,C,1480264500,"[greedy, math]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Taxes,1750,D,1480264500,"[math, number theory]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Ostap and Tree,2500,E,1480264500,"[dp, trees]",PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Tennis Championship,750,A,1480264500,"[dfs and similar, dp, math]",PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Taxes,750,B,1480264500,"[math, number theory]",PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Ostap and Tree,1500,C,1480264500,[dp],PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Permutations,2000,D,1480264500,[matrices],PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Chess Championship,2500,E,1480264500,"[constructive algorithms, flows, greedy]",PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Road to Cinema,750,A,1479632700,[binary search],PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Sea Battle,750,B,1479632700,"[greedy, implementation]",PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Subordinates,1000,C,1479632700,[greedy],PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Financiers Game,1500,D,1479632700,"[dp, games]",PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Tanya is 5!,2000,E,1479632700,"[graph matchings, graphs, greedy, schedules]",PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Dirty plates,2500,F,1479632700,"[constructive algorithms, math]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Interview with Oleg,500,A,1479632700,"[implementation, strings]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Spotlights,1000,B,1479632700,"[brute force, dp, implementation]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Road to Cinema,1750,C,1479632700,[binary search],PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Sea Battle,1750,D,1479632700,"[binary search, constructive algorithms, greedy]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Subordinates,2000,E,1479632700,"[constructive algorithms, greedy]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Financiers Game,2500,F,1479632700,"[dp, games]",PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Alyona and mex,500,A,1479918900,"[constructive algorithms, greedy]",PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Alyona and a tree,1000,B,1479918900,"[binary search, data structures, dfs and similar, graphs, trees]",PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Alyona and towers,1500,C,1479918900,[data structures],PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Recover a functional graph,2000,D,1479918900,[graph matchings],PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Gosha is hunting,2500,E,1479918900,"[brute force, dp, flows, sortings]",PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and copybooks,500,A,1479918900,"[brute force, implementation]",PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and flowers,1000,B,1479918900,[constructive algorithms],PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and mex,1500,C,1479918900,[constructive algorithms],PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and a tree,2000,D,1479918900,"[binary search, data structures, dfs and similar, graph matchings, graphs]",PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and towers,2500,E,1479918900,[],PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa's loud Owf and Mehrdad's evil plan,500,A,1481034900,"[dfs and similar, math]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa's weak amphitheater and Mehrdad's valuable Hoses,1000,B,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa’s overnight party and Mehrdad’s silent entering,1250,C,1481034900,"[constructive algorithms, dfs and similar]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths,2000,D,1481034900,"[data structures, trees]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa’s abnormal DNA and Mehrdad’s deep interest,2500,E,1481034900,"[data structures, string suffix structures]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa’s hard exam and Mehrdad’s naive cheat,500,A,1481034900,"[implementation, math, number theory]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa’s obvious problem and Mehrdad’s terrible solution,1000,B,1481034900,"[math, number theory]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa's loud Owf and Mehrdad's evil plan,1500,C,1481034900,"[dfs and similar, math]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa's weak amphitheater and Mehrdad's valuable Hoses,2000,D,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa’s overnight party and Mehrdad’s silent entering,2250,E,1481034900,[],PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Vladik and flights,500,A,1481726100,"[constructive algorithms, greedy, implementation]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Chloe and the sequence ,1000,B,1481726100,"[binary search, bitmasks, constructive algorithms, implementation]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Vladik and fractions,1250,C,1481726100,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Chloe and pleasant prizes,2000,D,1481726100,"[dfs and similar, dp, trees]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Vladik and cards,2500,E,1481726100,"[binary search, bitmasks, brute force, dp]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Builds A Nation,500,A,1481992500,"[dfs and similar, graphs]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow's Game,1250,B,1481992500,"[bitmasks, divide and conquer]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Buys a Deck of Cards,1750,C,1481992500,"[bitmasks, brute force, dp]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Draws a Circle,2250,D,1481992500,[geometry],PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Masters the Cyclic Shift,2500,E,1481992500,[strings],PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Learns the Cyclic Shift,500,A,1481992500,"[implementation, strings]",PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Solves A Puzzle,1000,B,1481992500,[implementation],PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Builds A Nation,1500,C,1481992500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow's Game,2250,D,1481992500,[bitmasks],PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Buys a Deck of Cards,2750,E,1481992500,[],PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Compote,500,A,1482057300,[math],PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Decoding,1000,B,1482057300,"[implementation, strings]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Tram,1500,C,1482057300,"[constructive algorithms, implementation, math]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Green and Black Tea,2000,D,1482057300,"[constructive algorithms, greedy]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Numbers Exchange,2500,E,1482057300,"[greedy, implementation]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Music in Car,3000,F,1482057300,"[data structures, greedy, two pointers]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,New Roads,3000,G,1482057300,"[constructive algorithms, trees]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Display Size,500,A,1482113100,"[brute force, math]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Mammoth's Genome Decoding,1000,B,1482113100,"[implementation, strings]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Servers,1500,C,1482113100,[implementation],PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Winter Is Coming,2000,D,1482113100,"[greedy, sortings]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Comments,2000,E,1482113100,"[dfs and similar, expression parsing]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Igor and Interesting Numbers,2500,F,1482113100,"[brute force, combinatorics, dp]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Place in a Class,500,A,1482656700,"[implementation, math]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Keyboard Check,1000,B,1482656700,"[implementation, strings]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Robot,1500,C,1482656700,"[constructive algorithms, math]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Palindrome,2000,D,1482656700,"[constructive algorithms, data structures, greedy]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Tangerines,2500,E,1482656700,"[binary search, greedy, two pointers]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Clauses and a Soccer Championship,2500,F,1482656700,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Bachgold Problem,500,A,1482165300,"[greedy, implementation, math, number theory]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Parallelogram is Back,1000,B,1482165300,"[brute force, constructive algorithms, geometry]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Voting,1500,C,1482165300,"[greedy, implementation, two pointers]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Leaving Auction,2000,D,1482165300,"[binary search, data structures]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Inversions After Shuffle,2500,E,1482165300,"[data structures, probabilities]",PROGRAMMING +750,Good Bye 2016,12,New Year and Hurry,500,A,1483107300,"[binary search, brute force, implementation, math]",PROGRAMMING +750,Good Bye 2016,12,New Year and North Pole,750,B,1483107300,[implementation],PROGRAMMING +750,Good Bye 2016,12,New Year and Rating,1000,C,1483107300,"[binary search, greedy, math]",PROGRAMMING +750,Good Bye 2016,12,New Year and Fireworks,1500,D,1483107300,"[brute force, data structures, dfs and similar, dp, implementation]",PROGRAMMING +750,Good Bye 2016,12,New Year and Old Subsequence,2250,E,1483107300,"[data structures, divide and conquer, dp]",PROGRAMMING +750,Good Bye 2016,12,New Year and Finding Roots,3000,F,1483107300,"[constructive algorithms, implementation, trees]",PROGRAMMING +750,Good Bye 2016,12,New Year and Binary Tree Paths,3250,G,1483107300,"[bitmasks, brute force, combinatorics, dp]",PROGRAMMING +750,Good Bye 2016,12,New Year and Snowy Grid,3500,H,1483107300,"[dfs and similar, dsu, graphs]",PROGRAMMING +751,Технокубок 2017 - Ознакомительный Раунд 3,12,Оценки Васи,500,A,1482395400,[],PROGRAMMING +751,Технокубок 2017 - Ознакомительный Раунд 3,12,Путь Поликарпа,1000,B,1482395400,[],PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Place in a Class,500,A,1482656700,"[constructive algorithms, math]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Keyboard Check,1000,B,1482656700,"[greedy, implementation, strings]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Robot,1500,C,1482656700,"[greedy, shortest paths]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Palindrome,2000,D,1482656700,"[data structures, greedy, hashing, strings]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Tangerines,2500,E,1482656700,"[binary search, dp, two pointers]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Clauses and a Soccer Championship,2500,F,1482656700,[trees],PROGRAMMING +753,Testing Round #13,12,Santa Claus and Candies,500,A,1483002300,"[dp, greedy, math]",PROGRAMMING +753,Testing Round #13,12,Interactive Bulls and Cows (Easy),1000,B,1483002300,"[brute force, constructive algorithms, implementation]",PROGRAMMING +753,Testing Round #13,12,Interactive Bulls and Cows (Hard),1500,C,1483002300,"[brute force, constructive algorithms]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Lesha and array splitting,500,A,1483713300,"[constructive algorithms, greedy]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Ilya and tic-tac-toe game,1000,B,1483713300,"[brute force, implementation]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Vladik and chat,1500,C,1483713300,"[brute force, constructive algorithms, dp, implementation, strings]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Fedor and coupons,2000,D,1483713300,"[binary search, data structures, greedy, sortings]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Dasha and cyclic table,2500,E,1483713300,"[bitmasks, brute force, fft]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Hypothesis,500,A,1484499900,"[brute force, graphs, math]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Game,1000,B,1484499900,"[binary search, data structures, games, greedy, sortings]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Forest,1500,C,1484499900,"[dfs and similar, dsu, graphs]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Polygon,2250,D,1484499900,[data structures],PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and White-Red graph,2500,E,1484499900,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Gifts,2750,F,1484499900,"[bitmasks, dp, greedy]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Many Other Balls,3500,G,1484499900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Pavel and barbecue,500,A,1485108900,[dfs and similar],PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Travel Card,1000,B,1485108900,"[binary search, dp]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Nikita and stack,1500,C,1485108900,[data structures],PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Bacterial Melee,2000,D,1485108900,"[brute force, combinatorics, dp, string suffix structures]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Byteland coins,2500,E,1485108900,"[combinatorics, dp, math]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Long number,3000,F,1485108900,"[expression parsing, math, number theory]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Gotta Catch Em' All!,500,A,1484235300,[implementation],PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash's Big Day,1000,B,1484235300,"[greedy, math, number theory]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity is Coming!,1500,C,1484235300,"[data structures, hashing, sortings, strings]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity's Big Secret Revealed,2000,D,1484235300,"[bitmasks, dp]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash Plays with Functions,2500,E,1484235300,"[brute force, combinatorics, dp, number theory]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Team Rocket Rises Again,2750,F,1484235300,"[data structures, graphs, shortest paths]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Can Bash Save the Day?,3500,G,1484235300,"[data structures, divide and conquer, graphs, trees]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Holiday Of Equality,500,A,1484838300,"[implementation, math]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Blown Garland,1000,B,1484838300,[implementation],PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Unfair Poll,1500,C,1484838300,"[binary search, implementation, math]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Ability To Convert,1750,D,1484838300,"[dp, greedy, strings]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Broken Tree,2500,E,1484838300,"[dfs and similar, greedy, trees]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Geometrical Progression,3000,F,1484838300,"[brute force, math, number theory]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Pavel and barbecue,500,A,1485108900,"[dfs and similar, dsu]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Travel Card,1000,B,1485108900,"[binary search, dp, greedy, two pointers]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Nikita and stack,1500,C,1485108900,"[binary search, data structures]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Bacterial Melee,2000,D,1485108900,[dp],PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Byteland coins,2500,E,1485108900,"[dp, math]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Long number,3000,F,1485108900,[],PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Petr and a calendar,500,A,1485108900,"[implementation, math]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Frodo and pillows,1000,B,1485108900,"[binary search, greedy]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Pavel and barbecue,1500,C,1485108900,"[dfs and similar, graphs]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Travel Card,2000,D,1485108900,"[binary search, dp, two pointers]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Nikita and stack,2500,E,1485108900,[],PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Bacterial Melee,3000,F,1485108900,[],PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Stairs,500,A,1485873300,"[brute force, constructive algorithms, math]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and friends,1000,B,1485873300,"[brute force, implementation, math]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Password,1500,C,1485873300,"[brute force, dp, implementation]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Very Difficult Problem,2000,D,1485873300,"[binary search, brute force, constructive algorithms, greedy, sortings]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Puzzle,2500,E,1485873300,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Photos,3000,F,1485873300,"[brute force, data structures]",PROGRAMMING +762,Educational Codeforces Round 17,12,k-th divisor,,A,1485354900,"[math, number theory]",PROGRAMMING +762,Educational Codeforces Round 17,12,USB vs. PS/2,,B,1485354900,"[greedy, sortings, two pointers]",PROGRAMMING +762,Educational Codeforces Round 17,12,Two strings,,C,1485354900,"[binary search, hashing, two pointers]",PROGRAMMING +762,Educational Codeforces Round 17,12,Maximum path,,D,1485354900,"[dp, implementation]",PROGRAMMING +762,Educational Codeforces Round 17,12,Radio stations,,E,1485354900,"[binary search, data structures]",PROGRAMMING +762,Educational Codeforces Round 17,12,Tree nesting,,F,1485354900,"[combinatorics, graphs, trees]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and a tree,500,A,1486042500,"[dfs and similar, dp, dsu, trees]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and rectangles,750,B,1486042500,[constructive algorithms],PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and remoduling,1500,C,1486042500,"[brute force, number theory]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and a flat tree,2000,D,1486042500,"[data structures, hashing, trees]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and our friends animals,2500,E,1486042500,[dsu],PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Taymyr is calling you,500,A,1486042500,"[brute force, implementation, math]",PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and cubes,1000,B,1486042500,"[constructive algorithms, implementation]",PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and a tree,1500,C,1486042500,[dfs and similar],PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and rectangles,1750,D,1486042500,[],PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and remoduling,2500,E,1486042500,[],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Neverending competitions,500,A,1487059500,[implementation],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Code obfuscation,1000,B,1487059500,"[implementation, strings]",PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Table Tennis Game 2,1250,C,1487059500,[math],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Artsem and Saunders,2000,D,1487059500,"[constructive algorithms, dsu, math]",PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Tree Folding,2500,E,1487059500,"[dfs and similar, dp, implementation, trees]",PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Souvenirs,3250,F,1487059500,[data structures],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,"Math, math everywhere",3500,G,1487059500,[],PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and Longest Uncommon Subsequence,500,A,1486487100,"[constructive algorithms, strings]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Triangle,1000,B,1486487100,"[constructive algorithms, geometry, greedy, sortings]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Message,1500,C,1486487100,"[brute force, dp, strings]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Dictionary,2000,D,1486487100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a xor trip,2500,E,1486487100,"[bitmasks, constructive algorithms, data structures, dfs and similar, dp, trees]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Snacktower,500,A,1487408700,"[data structures, implementation]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,The Queue,1250,B,1487408700,"[brute force, greedy]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Garland,1500,C,1487408700,"[dfs and similar, graphs, greedy, trees]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Cartons of milk,2000,D,1487408700,"[binary search, data structures, greedy, sortings, two pointers]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Change-free,2500,E,1487408700,[greedy],PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Oath of the Night's Watch,500,A,1487606700,"[constructive algorithms, sortings]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Code For 1,1000,B,1487606700,"[constructive algorithms, dfs and similar, divide and conquer]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon Snow and his Favourite Number,1250,C,1487606700,"[brute force, dp, implementation, sortings]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon and Orbs,1750,D,1487606700,"[dp, math, probabilities]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Game of Stones,2000,E,1487606700,"[dp, games]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Barrels and boxes,2250,F,1487606700,"[brute force, combinatorics, number theory, probabilities]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,The Winds of Winter,2750,G,1487606700,[data structures],PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,Year of University Entrance,500,A,1488628800,[sortings],PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,News About Credit,1000,B,1488628800,"[greedy, two pointers]",PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,Cycle In Maze,1500,C,1488628800,"[dfs and similar, greedy, shortest paths]",PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,k-Interesting Pairs Of Integers,2000,D,1488628800,"[bitmasks, brute force]",PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,New Password,500,A,1489233600,[implementation],PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,Maximize Sum of Digits,1000,B,1489233600,[implementation],PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,Online Courses In BSU,1500,C,1489233600,"[dfs and similar, graphs]",PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,Draw Brackets!,1500,D,1489233600,[implementation],PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Friendship Condition,250,A,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Different Names,500,B,1489851300,"[constructive algorithms, greedy]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Tree Jumps,1000,C,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Company,1500,D,1489851300,[dp],PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Rectangle Strips,2250,E,1489851300,"[dp, greedy]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Isomorphic Points,2500,F,1489851300,"[geometry, two pointers]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Voltage Keepsake,500,A,1492356900,"[binary search, math]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Volatile Kite,1000,B,1492356900,[geometry],PROGRAMMING +772,VK Cup 2017 - Round 2,12,Vulnerable Kerbals,1750,C,1492356900,"[dp, graphs, number theory]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Varying Kibibits,2250,D,1492356900,"[bitmasks, dp]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Verifying Kingdom,2250,E,1492356900,"[binary search, trees]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Success Rate,500,A,1494171900,"[binary search, math]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Dynamic Problem Scoring,1000,B,1494171900,"[brute force, greedy]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Prairie Partition,1750,C,1494171900,"[binary search, constructive algorithms, greedy, math]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Perishable Roads,2500,D,1494171900,"[dp, graphs, shortest paths]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Blog Post Rating,2750,E,1494171900,"[data structures, sortings]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Test Data Generation,3500,F,1494171900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Amusement Park,,A,1491406500,"[*special, ternary search]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Significant Cups,,B,1491406500,"[*special, binary search, data structures, two pointers]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Lie or Truth,,D,1491406500,"[*special, constructive algorithms, sortings]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Big Number and Remainder,,E,1491406500,"[*special, math, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Pens And Days Of Week,,F,1491406500,"[*special, binary search, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING +775,VK Cup 2017 - Wild Card Round 2,12,University Schedule,,A,1493220900,[*special],PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,A Serial Killer,500,A,1487861100,[implementation],PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and his girlfriend,1000,B,1487861100,[number theory],PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Molly's Chemicals,1500,C,1487861100,"[binary search, data structures, math]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Door Problem,2000,D,1487861100,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Holmes Children,2250,E,1487861100,"[math, number theory]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock's bet to Moriarty,3000,F,1487861100,"[constructive algorithms, geometry, graphs, trees]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and the Encrypted Data,3250,G,1487861100,"[bitmasks, combinatorics, dp]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Shell Game,500,A,1487930700,"[constructive algorithms, implementation]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Game of Credit Cards,1000,B,1487930700,"[data structures, dp, greedy, sortings]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Alyona and Spreadsheet,1500,C,1487930700,"[binary search, dp, implementation, two pointers]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Cloud of Hashtags,2000,D,1487930700,"[binary search, greedy, implementation, strings]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Hanoi Factory,2500,E,1487930700,"[brute force, data structures, dp, greedy, sortings]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,String Game,500,A,1488096300,"[binary search, greedy, strings]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Bitwise Formula,1000,B,1488096300,"[bitmasks, brute force, dfs and similar, expression parsing, implementation]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Peterson Polyglot,1500,C,1488096300,"[brute force, dfs and similar, dsu, hashing, trees]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Parquet Re-laying,2250,D,1488096300,[constructive algorithms],PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Selling Numbers,2250,E,1488096300,"[dp, sortings]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Pupils Redistribution,500,A,1488096300,"[constructive algorithms, math]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Weird Rounding,1000,B,1488096300,"[brute force, greedy]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Dishonest Sellers,1000,C,1488096300,"[greedy, sortings]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,String Game,1500,D,1488096300,"[binary search, strings]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Bitwise Formula,2000,E,1488096300,"[data structures, expression parsing, greedy]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Peterson Polyglot,2500,F,1488096300,[],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Socks,500,A,1488705300,[implementation],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,The Meeting Place Cannot Be Changed,1000,B,1488705300,[binary search],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Colored Balloons,1250,C,1488705300,[dfs and similar],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Innokenty and a Football League,1500,D,1488705300,"[2-sat, graphs, greedy, implementation]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Underground Lab,1750,E,1488705300,"[dfs and similar, graphs]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Axel and Marston in Bitland,2500,F,1488705300,"[bitmasks, graphs, matrices]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Nervous Barriers,3000,G,1488705300,"[data structures, dp]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Intranet of Buses,3500,H,1488705300,"[binary search, geometry, implementation, two pointers]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Colored Balloons,500,A,1488719100,"[brute force, constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Innokenty and a Football League,1000,B,1488719100,"[2-sat, brute force, graph matchings, greedy, implementation]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Underground Lab,1250,C,1488719100,"[brute force, constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Axel and Marston in Bitland,1750,D,1488719100,"[bitmasks, brute force, dp, matrices]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Nervous Barriers,2250,E,1488719100,[data structures],PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Intranet of Buses,2750,F,1488719100,"[binary search, geometry, two pointers]",PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Socks,500,A,1488719100,[implementation],PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,The Meeting Place Cannot Be Changed,1000,B,1488719100,"[binary search, ternary search]",PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Colored Balloons,1250,C,1488719100,[dfs and similar],PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Innokenty and a Football League,1500,D,1488719100,[greedy],PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Underground Lab,1750,E,1488719100,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Axel and Marston in Bitland,2500,F,1488719100,[matrices],PROGRAMMING +784,April Fools Contest 2017,12,Numbers Joke,,A,1490972400,[*special],PROGRAMMING +784,April Fools Contest 2017,12,Kids' Riddle,,B,1490972400,[*special],PROGRAMMING +784,April Fools Contest 2017,12,INTERCALC,,C,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Touchy-Feely Palindromes,,D,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Twisted Circuit,,E,1490972400,"[*special, brute force, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Crunching Numbers Just for You,,F,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,BF Calculator,,G,1490972400,[*special],PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Polyhedrons,500,A,1489590300,[implementation],PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Classes,1000,B,1489590300,"[greedy, sortings]",PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Fairy Tale,1500,C,1489590300,"[binary search, math]",PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and School - 2,2250,D,1489590300,"[combinatorics, math, number theory]",PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Permutation,2500,E,1489590300,"[brute force, data structures]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Berzerk,750,A,1490281500,"[dfs and similar, dp, games]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Legacy,1000,B,1490281500,"[data structures, graphs, shortest paths]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Till I Collapse,1500,C,1490281500,"[data structures, divide and conquer]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Rap God,2000,D,1490281500,"[data structures, dfs and similar, hashing, strings, trees]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,ALT,2500,E,1490281500,"[data structures, flows, graphs, trees]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,The Monster,500,A,1490281500,"[brute force, math]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Not Afraid,1000,B,1490281500,"[greedy, implementation]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Berzerk,1750,C,1490281500,"[dp, games]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Legacy,2000,D,1490281500,"[data structures, shortest paths]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Till I Collapse,2500,E,1490281500,[],PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Functions again,500,A,1490803500,[dp],PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Weird journey,1250,B,1490803500,"[combinatorics, dfs and similar, graphs]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,The Great Mixing,1500,C,1490803500,"[dfs and similar, dp, math]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Finding lines,2000,D,1490803500,"[constructive algorithms, divide and conquer]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,New task,2250,E,1490803500,[],PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Anastasia and pebbles,500,A,1490803500,"[greedy, implementation, math]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Masha and geometric depression,1000,B,1490803500,"[brute force, implementation, math]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Functions again,1500,C,1490803500,"[data structures, dp, greedy]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Weird journey,2250,D,1490803500,[graphs],PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,The Great Mixing,2500,E,1490803500,"[brute force, dfs and similar, dp, math]",PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Different Names,500,A,1489851300,"[constructive algorithms, greedy]",PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Tree Jumps,1000,B,1489851300,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Company,1500,C,1489851300,[dp],PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Rectangle Strips,2250,D,1489851300,[dp],PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Isomorphic Points,2500,E,1489851300,[],PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Big Brother,500,A,1489851300,[implementation],PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Friendship Condition,1000,B,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Different Names,1500,C,1489851300,"[constructive algorithms, greedy]",PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Tree Jumps,2000,D,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Company,2500,E,1489851300,[],PROGRAMMING +792,Educational Codeforces Round 18,12,New Bus Route,,A,1490625300,"[implementation, sortings]",PROGRAMMING +792,Educational Codeforces Round 18,12,Counting-out Rhyme,,B,1490625300,[implementation],PROGRAMMING +792,Educational Codeforces Round 18,12,Divide by Three,,C,1490625300,"[dp, greedy, math, number theory]",PROGRAMMING +792,Educational Codeforces Round 18,12,Paths in a Complete Binary Tree,,D,1490625300,"[bitmasks, trees]",PROGRAMMING +792,Educational Codeforces Round 18,12,Colored Balls,,E,1490625300,"[greedy, math]",PROGRAMMING +792,Educational Codeforces Round 18,12,Mages and Monsters,,F,1490625300,"[data structures, geometry]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Oleg and shares,500,A,1492965900,"[implementation, math]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Igor and his way to work,1000,B,1492965900,"[dfs and similar, shortest paths]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Mice problem,1500,C,1492965900,"[geometry, implementation, sortings]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Presents in Bankopolis,2000,D,1492965900,"[dp, graphs, shortest paths]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Problem of offices,2500,E,1492965900,"[constructive algorithms, dfs and similar, dp, trees]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Julia the snail,3000,F,1492965900,"[data structures, divide and conquer]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Oleg and chess,3500,G,1492965900,"[flows, graph matchings]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Bank Robbery,500,A,1494668100,[implementation],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Cutting Carrot,1000,B,1494668100,"[geometry, math]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Naming Company,1750,C,1494668100,"[games, greedy, sortings]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Labelling Cities,2000,D,1494668100,"[dfs and similar, graphs, hashing]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Choosing Carrot,2500,E,1494668100,[games],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Leha and security system,2750,F,1494668100,[data structures],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Replace All,3500,G,1494668100,"[combinatorics, dp, math]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Amusement Park,,A,1491406500,"[*special, brute force, ternary search]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Significant Cups,,B,1491406500,"[*special, binary search, sortings, two pointers]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Lie or Truth,,D,1491406500,"[*special, implementation, sortings]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Big Number and Remainder,,E,1491406500,"[*special, brute force, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Pens And Days Of Week,,F,1491406500,"[*special, brute force, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Buying A House,500,A,1491842100,"[brute force, implementation]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Find The Bone,750,B,1491842100,[implementation],PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Bank Hacking,1000,C,1491842100,"[constructive algorithms, data structures, dp, trees]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Police Stations,1500,D,1491842100,"[constructive algorithms, shortest paths, trees]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Exam Cheating,2000,E,1491842100,"[binary search, dp]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Sequence Recovery,2500,F,1491842100,"[bitmasks, data structures, greedy]",PROGRAMMING +797,Educational Codeforces Round 19,12,k-Factorization,,A,1492266900,"[implementation, math, number theory]",PROGRAMMING +797,Educational Codeforces Round 19,12,Odd sum,,B,1492266900,"[dp, greedy]",PROGRAMMING +797,Educational Codeforces Round 19,12,Minimal string,,C,1492266900,"[greedy, strings]",PROGRAMMING +797,Educational Codeforces Round 19,12,Broken BST,,D,1492266900,"[data structures, dfs and similar]",PROGRAMMING +797,Educational Codeforces Round 19,12,Array Queries,,E,1492266900,"[brute force, data structures, dp]",PROGRAMMING +797,Educational Codeforces Round 19,12,Mice and Holes,,F,1492266900,"[data structures, dp, greedy, sortings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and palindrome,500,A,1492785300,"[brute force, constructive algorithms, strings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and strings,1000,B,1492785300,"[brute force, strings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and gcd problem,1500,C,1492785300,"[dp, greedy, number theory]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and distribution,2000,D,1492785300,"[constructive algorithms, sortings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and code of a permutation,2500,E,1492785300,"[constructive algorithms, data structures, graphs, sortings]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Carrot Cakes,500,A,1494516900,"[brute force, implementation]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,T-shirt buying,1000,B,1494516900,"[data structures, implementation]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Fountains,1500,C,1494516900,"[binary search, data structures]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Field expansion,2000,D,1494516900,"[brute force, dp, meet-in-the-middle]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Aquarium decoration,2500,E,1494516900,"[data structures, greedy, two pointers]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Beautiful fountains rows,3250,F,1494516900,[data structures],PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Cut the pie,3500,G,1494516900,"[binary search, data structures, geometry]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Voltage Keepsake,500,A,1492356900,"[binary search, greedy]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Volatile Kite,1000,B,1492356900,[geometry],PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Vulnerable Kerbals,1750,C,1492356900,[number theory],PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Varying Kibibits,2250,D,1492356900,"[combinatorics, dp]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Verifying Kingdom,2250,E,1492356900,[],PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vicious Keyboard,500,A,1492356900,[brute force],PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Valued Keys,1000,B,1492356900,"[constructive algorithms, greedy, strings]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Voltage Keepsake,1500,C,1492356900,"[binary search, math]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Volatile Kite,2000,D,1492356900,"[brute force, geometry, greedy]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vulnerable Kerbals,2750,E,1492356900,[],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (easy),,A,1495958700,[greedy],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (medium),,B,1495958700,"[data structures, greedy]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (hard),,C,1495958700,[flows],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (easy),,D,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (medium),,E,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (hard),,F,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (easy),,G,1495958700,[implementation],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (medium),,H,1495958700,[constructive algorithms],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (hard),,I,1495958700,[string suffix structures],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (easy),,J,1495958700,"[dfs and similar, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (medium),,K,1495958700,"[dp, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (hard),,L,1495958700,"[dfs and similar, dp, math, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (easy),,M,1495958700,"[greedy, sortings]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (medium),,N,1495958700,"[binary search, flows]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (hard),,O,1495958700,"[binary search, flows]",PROGRAMMING +803,Educational Codeforces Round 20,12,Maximal Binary Matrix,,A,1493391900,[constructive algorithms],PROGRAMMING +803,Educational Codeforces Round 20,12,Distances to Zero,,B,1493391900,[constructive algorithms],PROGRAMMING +803,Educational Codeforces Round 20,12,Maximal GCD,,C,1493391900,"[greedy, math]",PROGRAMMING +803,Educational Codeforces Round 20,12,Magazine Ad,,D,1493391900,"[binary search, greedy]",PROGRAMMING +803,Educational Codeforces Round 20,12,Roma and Poker,,E,1493391900,[dp],PROGRAMMING +803,Educational Codeforces Round 20,12,Coprime Subsequences,,F,1493391900,"[bitmasks, combinatorics, number theory]",PROGRAMMING +803,Educational Codeforces Round 20,12,Periodic RMQ Problem,,G,1493391900,[data structures],PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Find Amir,500,A,1493909400,"[greedy, math]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Minimum number of steps,1000,B,1493909400,"[greedy, implementation, math]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Ice cream coloring,1500,C,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Expected diameter of a tree,2000,D,1493909400,"[binary search, brute force, dfs and similar, dp, sortings, trees]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,The same permutation ,2500,E,1493909400,[constructive algorithms],PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Fake bullions,3000,F,1493909400,"[dfs and similar, dp, graphs]",PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Fake NP,500,A,1493909400,[math],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,3-palindrome,1000,B,1493909400,[constructive algorithms],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Find Amir,1500,C,1493909400,[constructive algorithms],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Minimum number of steps,2000,D,1493909400,[],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Ice cream coloring,2500,E,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Expected diameter of a tree,3000,F,1493909400,"[graphs, probabilities]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Success Rate,500,A,1494171900,"[binary search, math]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Dynamic Problem Scoring,1000,B,1494171900,"[brute force, greedy]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Prairie Partition,1750,C,1494171900,"[binary search, greedy]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Perishable Roads,2500,D,1494171900,[graphs],PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Blog Post Rating,2750,E,1494171900,[data structures],PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Test Data Generation,3500,F,1494171900,[],PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Is it rated?,500,A,1494171900,"[implementation, sortings]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,T-Shirt Hunt,1000,B,1494171900,[brute force],PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Success Rate,1500,C,1494171900,"[binary search, math]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Dynamic Problem Scoring,2000,D,1494171900,"[brute force, greedy]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Prairie Partition,2750,E,1494171900,"[binary search, greedy]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Perishable Roads,3500,F,1494171900,[],PROGRAMMING +808,Educational Codeforces Round 21,12,Lucky Year,,A,1494860700,[implementation],PROGRAMMING +808,Educational Codeforces Round 21,12,Average Sleep Time,,B,1494860700,"[data structures, math]",PROGRAMMING +808,Educational Codeforces Round 21,12,Tea Party,,C,1494860700,"[constructive algorithms, greedy]",PROGRAMMING +808,Educational Codeforces Round 21,12,Array Division,,D,1494860700,"[binary search, data structures, implementation]",PROGRAMMING +808,Educational Codeforces Round 21,12,Selling Souvenirs,,E,1494860700,"[dp, greedy, ternary search]",PROGRAMMING +808,Educational Codeforces Round 21,12,Card Game,,F,1494860700,"[binary search, flows, graphs]",PROGRAMMING +808,Educational Codeforces Round 21,12,Anthem of Berland,,G,1494860700,"[dp, strings]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Do you want a date?,500,A,1495303500,"[math, sortings]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Glad to see you!,1000,B,1495303500,[binary search],PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Find a car,1500,C,1495303500,"[combinatorics, divide and conquer, dp]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Hitchhiking in the Baltic States,2000,D,1495303500,"[data structures, dp]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Surprise me!,2500,E,1495303500,"[divide and conquer, math, trees]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Straight <>,500,A,1495303500,"[implementation, math]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Summer sell-off,1000,B,1495303500,"[greedy, sortings]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Do you want a date?,1500,C,1495303500,"[math, sortings]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Glad to see you!,2000,D,1495303500,[binary search],PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Find a car,2500,E,1495303500,"[divide and conquer, dp]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Courtesy,500,A,1495877700,"[brute force, implementation]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Complicated Book,1000,B,1495877700,"[implementation, sortings]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Memorable Trip,1500,C,1495877700,"[dp, implementation]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Favorite Game,2000,D,1495877700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Entertaining Flags,2500,E,1495877700,"[data structures, dsu, graphs]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Crossroads,500,A,1496326500,[implementation],PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,"Sagheer, the Hausmeister",1000,B,1496326500,"[bitmasks, brute force, dp]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Nubian Market,1500,C,1496326500,[binary search],PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Kindergarten,2000,D,1496326500,"[dfs and similar, graphs, implementation]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Apple Tree,2500,E,1496326500,[games],PROGRAMMING +813,Educational Codeforces Round 22,12,The Contest,,A,1496675100,[implementation],PROGRAMMING +813,Educational Codeforces Round 22,12,The Golden Age,,B,1496675100,"[brute force, math]",PROGRAMMING +813,Educational Codeforces Round 22,12,The Tag Game,,C,1496675100,[dfs and similar],PROGRAMMING +813,Educational Codeforces Round 22,12,Two Melodies,,D,1496675100,"[dp, flows]",PROGRAMMING +813,Educational Codeforces Round 22,12,Army Creation,,E,1496675100,"[binary search, data structures]",PROGRAMMING +813,Educational Codeforces Round 22,12,Bipartite Checking,,F,1496675100,"[data structures, dsu, graphs]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An abandoned sentiment from past,500,A,1496837700,"[implementation, sortings]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An express train to reveries,1000,B,1496837700,[constructive algorithms],PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An impassioned circulation of affection,1750,C,1496837700,"[brute force, dp, two pointers]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An overnight dance in discotheque,1750,D,1496837700,"[dfs and similar, dp, geometry, greedy, trees]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An unavoidable detour for home,2500,E,1496837700,"[combinatorics, dp]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Game,500,A,1497710100,"[brute force, greedy, implementation]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Test,1250,B,1497710100,"[brute force, constructive algorithms, math]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Supermarket,1500,C,1497710100,"[brute force, dp, trees]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Cards,2250,D,1497710100,"[binary search, combinatorics, data structures, geometry]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Neighborhood,2250,E,1497710100,"[binary search, constructive algorithms]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Morning,500,A,1497710100,"[brute force, implementation]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Coffee,1000,B,1497710100,"[binary search, data structures]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Game,1500,C,1497710100,"[brute force, greedy]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Test,2000,D,1497710100,[combinatorics],PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Supermarket,2750,E,1497710100,"[dp, trees]",PROGRAMMING +817,Educational Codeforces Round 23,12,Treasure Hunt,,A,1497539100,"[implementation, number theory]",PROGRAMMING +817,Educational Codeforces Round 23,12,Makes And The Product,,B,1497539100,"[combinatorics, sortings]",PROGRAMMING +817,Educational Codeforces Round 23,12,Really Big Numbers,,C,1497539100,"[binary search, brute force, dp, math]",PROGRAMMING +817,Educational Codeforces Round 23,12,Imbalanced Array,,D,1497539100,"[data structures, divide and conquer, dsu, sortings]",PROGRAMMING +817,Educational Codeforces Round 23,12,Choosing The Commander,,E,1497539100,"[bitmasks, data structures, trees]",PROGRAMMING +817,Educational Codeforces Round 23,12,MEX Queries,,F,1497539100,"[binary search, data structures, trees]",PROGRAMMING +818,Educational Codeforces Round 24,12,Diplomas and Certificates,,A,1498748700,"[implementation, math]",PROGRAMMING +818,Educational Codeforces Round 24,12,Permutation Game,,B,1498748700,[implementation],PROGRAMMING +818,Educational Codeforces Round 24,12,Sofa Thief,,C,1498748700,"[brute force, implementation]",PROGRAMMING +818,Educational Codeforces Round 24,12,Multicolored Cars,,D,1498748700,"[data structures, implementation]",PROGRAMMING +818,Educational Codeforces Round 24,12,Card Game Again,,E,1498748700,"[binary search, data structures, number theory, two pointers]",PROGRAMMING +818,Educational Codeforces Round 24,12,Level Generation,,F,1498748700,"[binary search, math, ternary search]",PROGRAMMING +818,Educational Codeforces Round 24,12,Four Melodies,,G,1498748700,[flows],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Boring Game,500,A,1498574100,[],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and PR Shifts,1000,B,1498574100,"[data structures, implementation]",PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Beacons on Field,1500,C,1498574100,[number theory],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Astronomers,2000,D,1498574100,[number theory],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Flight to the Moon,2500,E,1498574100,"[constructive algorithms, graphs]",PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Book Reading,500,A,1498574100,[implementation],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Angle in Polygon,1000,B,1498574100,"[constructive algorithms, geometry]",PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Boring Game,1500,C,1498574100,[],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and PR Shifts,2000,D,1498574100,[],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Beacons on Field,2500,E,1498574100,[],PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Future Gadget Laboratory,500,A,1498401300,[implementation],PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Banana Trees,1000,B,1498401300,"[brute force, math]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Boxes,1500,C,1498401300,"[data structures, trees]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and City,2000,D,1498401300,"[graphs, shortest paths]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and El Psy Kongroo,2500,E,1498401300,"[dp, matrices]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,I'm bored with life,500,A,1499011500,"[implementation, math, number theory]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Crossword solving,750,B,1499011500,"[brute force, implementation]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,"Hacker, pack your bags!",1250,C,1499011500,"[binary search, greedy, sortings]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,My pretty girl Noora,1750,D,1499011500,"[brute force, dp, greedy, math, number theory]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Liar,2250,E,1499011500,"[binary search, dp, hashing, string suffix structures]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Madness,2500,F,1499011500,"[dfs and similar, trees]",PROGRAMMING +823,VK Cup 2017 - Finals,12,High Load,500,A,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,DNA Evolution,1000,B,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Bamboo Partition,1500,C,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Rusty String,2000,D,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Singer House,2750,E,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Perpetual Motion Machine,2750,F,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Dirty Arkady's Kitchen,3500,G,1499587500,[],PROGRAMMING +825,Educational Codeforces Round 25,12,Binary Protocol,,A,1500217500,[implementation],PROGRAMMING +825,Educational Codeforces Round 25,12,Five-In-a-Row,,B,1500217500,"[brute force, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Multi-judge Solving,,C,1500217500,"[greedy, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Suitable Replacement,,D,1500217500,"[greedy, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Minimal Labels,,E,1500217500,"[data structures, graphs, greedy]",PROGRAMMING +825,Educational Codeforces Round 25,12,String Compression,,F,1500217500,"[dp, hashing, string suffix structures, strings]",PROGRAMMING +825,Educational Codeforces Round 25,12,Tree Queries,,G,1500217500,"[dfs and similar, trees]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,String Reconstruction,500,A,1499791500,"[data structures, greedy]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,High Load,750,B,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,DNA Evolution,1500,C,1499791500,[data structures],PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Best Edge Weight,1750,D,1499791500,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Rusty String,1750,E,1499791500,"[fft, math]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Dirty Arkady's Kitchen,2500,F,1499791500,"[dp, shortest paths]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Restaurant Tables,500,A,1499791500,[implementation],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Black Square,750,B,1499791500,[implementation],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,String Reconstruction,1250,C,1499791500,"[data structures, sortings]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,High Load,1750,D,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,DNA Evolution,2000,E,1499791500,[data structures],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Best Edge Weight,2750,F,1499791500,[data structures],PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Office Keys,500,A,1499958300,"[binary search, brute force, dp, greedy, sortings]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Cards Sorting,1000,B,1499958300,"[data structures, implementation, sortings]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Bamboo Partition,1500,C,1499958300,"[brute force, math, number theory, sortings, two pointers]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Singer House,2250,D,1499958300,"[combinatorics, dp, trees]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Perpetual Motion Machine,2250,E,1499958300,"[constructive algorithms, implementation, math, trees]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Unimodal Array,500,A,1499958300,[implementation],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Keyboard Layouts,750,B,1499958300,"[implementation, strings]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Jury Marks,1000,C,1499958300,[brute force],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Office Keys,1500,D,1499958300,"[binary search, brute force, dp, greedy]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Cards Sorting,2000,E,1499958300,[data structures],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Bamboo Partition,2500,F,1499958300,[],PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Sasha and Sticks,500,A,1500906900,"[games, math]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Petya and Exam,1000,B,1500906900,[implementation],PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Strange Radiation,1750,C,1500906900,"[binary search, implementation, math]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,"Misha, Grisha and Underground",2000,D,1500906900,"[dfs and similar, trees]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Vasya and Shifts,2500,E,1500906900,[matrices],PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,The Meaningless Game,500,A,1501425300,"[math, number theory]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,The Bakery,1250,B,1501425300,"[binary search, data structures, dp, two pointers]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Ever-Hungry Krakozyabra,1500,C,1501425300,"[brute force, greedy]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Red-Black Cobweb,2250,D,1501425300,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Caramel Clouds,2500,E,1501425300,"[data structures, dp, sortings]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Useless Toy,500,A,1501425300,[implementation],PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Festive Evening,1000,B,1501425300,"[data structures, implementation]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Meaningless Game,1500,C,1501425300,[math],PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Bakery,2250,D,1501425300,"[data structures, divide and conquer, dp]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,Ever-Hungry Krakozyabra,2500,E,1501425300,[],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Key races,500,A,1501511700,[math],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,The number on the board,750,B,1501511700,[greedy],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Star sky,1250,C,1501511700,"[dp, implementation]",PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Palindromic characteristics,1500,D,1501511700,"[brute force, dp, hashing, strings]",PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,The penguin's game,2250,E,1501511700,[constructive algorithms],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Roads in the Kingdom,2250,F,1501511700,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +837,Educational Codeforces Round 26,12,Text Volume,,A,1501773300,[implementation],PROGRAMMING +837,Educational Codeforces Round 26,12,Flag of Berland,,B,1501773300,"[brute force, implementation]",PROGRAMMING +837,Educational Codeforces Round 26,12,Two Seals,,C,1501773300,[brute force],PROGRAMMING +837,Educational Codeforces Round 26,12,Round Subset,,D,1501773300,[dp],PROGRAMMING +837,Educational Codeforces Round 26,12,Vasya's Function,,E,1501773300,"[binary search, implementation, math]",PROGRAMMING +837,Educational Codeforces Round 26,12,Prefix Sums,,F,1501773300,"[binary search, brute force, combinatorics, math, matrices]",PROGRAMMING +837,Educational Codeforces Round 26,12,Functions On The Segments,,G,1501773300,[data structures],PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Binary Blocks,,A,1502085900,[brute force],PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Diverging Directions,,B,1502085900,"[data structures, dfs and similar, trees]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Future Failure,,C,1502085900,"[dp, games]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Airplane Arrangements,,D,1502085900,"[math, number theory]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Convex Countour,,E,1502085900,[dp],PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Expected Earnings,,F,1502085900,[],PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Arya and Bran,500,A,1502548500,[implementation],PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Game of the Rows,1000,B,1502548500,"[brute force, greedy, implementation]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Journey,1500,C,1502548500,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Winter is here,2000,D,1502548500,"[combinatorics, dp, math, number theory]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Mother of Dragons,2500,E,1502548500,"[brute force, graphs, math, meet-in-the-middle]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Leha and Function,500,A,1503068700,"[combinatorics, greedy, math, number theory, sortings]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Leha and another game about graph,1000,B,1503068700,"[constructive algorithms, data structures, dfs and similar, dp, graphs]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,On the Bench,1500,C,1503068700,"[combinatorics, dp]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Destiny,2000,D,1503068700,"[data structures, probabilities]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,In a Trap,2500,E,1503068700,[trees],PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Generous Kefa,500,A,1503068700,"[brute force, implementation]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Godsend,1000,B,1503068700,"[games, math]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Leha and Function,1500,C,1503068700,[greedy],PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Leha and another game about graph,2000,D,1503068700,"[dfs and similar, graphs]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,On the Bench,2500,E,1503068700,[],PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Kirill And The Game,500,A,1504019100,"[brute force, two pointers]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Gleb And Pizza,1000,B,1504019100,[geometry],PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Ilya And The Tree,1500,C,1504019100,"[dfs and similar, math, trees]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Vitya and Strange Lesson,2000,D,1504019100,"[binary search, data structures]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Nikita and game,2500,E,1504019100,"[binary search, dfs and similar, divide and conquer, trees]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Sorting by Subsequences,500,A,1503592500,"[dfs and similar, dsu, implementation, sortings]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Interactive LowerBound,1000,B,1503592500,"[brute force, probabilities]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Upgrading Tree,1750,C,1503592500,"[constructive algorithms, dfs and similar, math]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Dynamic Shortest Path,2250,D,1503592500,"[graphs, shortest paths]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Maximum Flow,2250,E,1503592500,[flows],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Diversity,500,A,1503592500,[implementation],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Rectangles,1000,B,1503592500,"[combinatorics, math]",PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Sorting by Subsequences,1500,C,1503592500,[dfs and similar],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Interactive LowerBound,2000,D,1503592500,"[brute force, probabilities]",PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Upgrading Tree,3000,E,1503592500,[],PROGRAMMING +845,Educational Codeforces Round 27,12,Chess Tourney,,A,1503327900,[sortings],PROGRAMMING +845,Educational Codeforces Round 27,12,Luba And The Ticket,,B,1503327900,"[brute force, greedy]",PROGRAMMING +845,Educational Codeforces Round 27,12,Two TVs,,C,1503327900,"[data structures, greedy, sortings]",PROGRAMMING +845,Educational Codeforces Round 27,12,Driving Test,,D,1503327900,"[data structures, dp, greedy]",PROGRAMMING +845,Educational Codeforces Round 27,12,Fire in the City,,E,1503327900,"[binary search, data structures]",PROGRAMMING +845,Educational Codeforces Round 27,12,Guards In The Storehouse,,F,1503327900,[dp],PROGRAMMING +845,Educational Codeforces Round 27,12,Shortest Path Problem?,,G,1503327900,"[dfs and similar, math]",PROGRAMMING +846,Educational Codeforces Round 28,12,Curriculum Vitae,,A,1504623900,[brute force],PROGRAMMING +846,Educational Codeforces Round 28,12,Math Show,,B,1504623900,"[brute force, greedy]",PROGRAMMING +846,Educational Codeforces Round 28,12,Four Segments,,C,1504623900,"[brute force, dp]",PROGRAMMING +846,Educational Codeforces Round 28,12,Monitor,,D,1504623900,"[binary search, data structures]",PROGRAMMING +846,Educational Codeforces Round 28,12,Chemistry in Berland,,E,1504623900,"[dfs and similar, greedy, trees]",PROGRAMMING +846,Educational Codeforces Round 28,12,Random Query,,F,1504623900,"[math, two pointers]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Union of Doubly Linked Lists,,A,1505739900,[implementation],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Preparing for Merge Sort,,B,1505739900,[binary search],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Sum of Nestings,,C,1505739900,[],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Dog Show,,D,1505739900,"[data structures, greedy]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen,,E,1505739900,[binary search],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Elections,,F,1505739900,[greedy],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,University Classes,,G,1505739900,[implementation],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Load Testing,,H,1505739900,[],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Noise Level,,I,1505739900,[dfs and similar],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Students Initiation,,J,1505739900,"[binary search, flows]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Travel Cards,,K,1505739900,[sortings],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland SU Computer Network,,L,1505739900,"[dfs and similar, hashing, trees]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Weather Tomorrow,,M,1505739900,[implementation],PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,From Y to Y,500,A,1504272900,[constructive algorithms],PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Rooter's Song,1000,B,1504272900,"[constructive algorithms, data structures, geometry, implementation, sortings, two pointers]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Goodbye Souvenir,1750,C,1504272900,"[data structures, divide and conquer]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Shake It!,1750,D,1504272900,"[combinatorics, dp, flows, graphs]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Days of Floral Colours,2500,E,1504272900,"[combinatorics, dp, fft, math]",PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Odds and Ends,500,A,1504272900,[implementation],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Tell Your World,1000,B,1504272900,"[brute force, geometry]",PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,From Y to Y,1500,C,1504272900,[constructive algorithms],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Rooter's Song,2000,D,1504272900,[],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Goodbye Souvenir,2500,E,1504272900,[data structures],PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Five Dimensional Points,500,A,1504535700,"[brute force, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a list of numbers,1000,B,1504535700,[number theory],PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a game with Mojtaba,1250,C,1504535700,"[bitmasks, dp, games]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Tournament Construction,1750,D,1504535700,"[dp, graphs, greedy, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Random Elections,2000,E,1504535700,"[bitmasks, brute force, fft, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Rainbow Balls,2500,F,1504535700,[math],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a research in Mexican wave,500,A,1504535700,[implementation],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and an exam about geometry,1000,B,1504535700,"[geometry, math]",PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Five Dimensional Points,1500,C,1504535700,"[brute force, math]",PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a list of numbers,2000,D,1504535700,[],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a game with Mojtaba,2500,E,1504535700,"[bitmasks, games]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Digits,,A,1504432800,"[brute force, implementation, math]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Neural Network country,,B,1504432800,"[dp, matrices]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Property,,C,1504432800,"[greedy, sortings]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Exploration plan,,D,1504432800,"[binary search, flows, graph matchings, shortest paths]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Casinos and travel,,E,1504432800,[dp],PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Product transformation,,F,1504432800,"[combinatorics, math, number theory]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Bathroom terminal,,G,1504432800,[implementation],PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Bob and stages,,H,1504432800,"[dp, geometry]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Dating,,I,1504432800,"[brute force, dfs and similar, graphs, trees]",PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Planning,750,A,1504702500,[greedy],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Jury Meeting,750,B,1504702500,"[greedy, sortings, two pointers]",PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Boredom,1750,C,1504702500,[data structures],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Michael and Charging Stations,1750,D,1504702500,"[binary search, dp]",PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Lada Malina,2500,E,1504702500,"[data structures, geometry]",PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Fraction,500,A,1504702500,"[brute force, constructive algorithms, math]",PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Maxim Buys an Apartment,1000,B,1504702500,[constructive algorithms],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Planning,1750,C,1504702500,[],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Jury Meeting,1750,D,1504702500,[greedy],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Boredom,2500,E,1504702500,[data structures],PROGRAMMING +855,"Manthan, Codefest 17",12,Tom Riddle's Diary,500,A,1506263700,[implementation],PROGRAMMING +855,"Manthan, Codefest 17",12,Marvolo Gaunt's Ring,1000,B,1506263700,"[data structures, dp]",PROGRAMMING +855,"Manthan, Codefest 17",12,Helga Hufflepuff's Cup,1500,C,1506263700,"[dp, trees]",PROGRAMMING +855,"Manthan, Codefest 17",12,Rowena Ravenclaw's Diadem,2000,D,1506263700,[trees],PROGRAMMING +855,"Manthan, Codefest 17",12,Salazar Slytherin's Locket,2500,E,1506263700,"[bitmasks, dp]",PROGRAMMING +855,"Manthan, Codefest 17",12,Nagini,3000,F,1506263700,[data structures],PROGRAMMING +855,"Manthan, Codefest 17",12,Harry Vs Voldemort,3500,G,1506263700,"[dp, graphs, trees]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Set Theory,,A,1505050500,"[brute force, constructive algorithms]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Similar Words,,B,1505050500,"[dp, strings]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Eleventh Birthday,,C,1505050500,"[combinatorics, dp, math]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Masha and Cactus,,D,1505050500,[],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Satellites,,E,1505050500,[],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,To Play or not to Play,,F,1505050500,[],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,k-rounding,750,A,1505653500,"[brute force, number theory]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Which floor?,750,B,1505653500,[brute force],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Did you mean...,1500,C,1505653500,"[dp, greedy]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Polycarp's phone book,2000,D,1505653500,"[data structures, sortings]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Tests Renumeration,2500,E,1505653500,[implementation],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Wizard's Tour,3000,F,1505653500,"[constructive algorithms, dfs and similar]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Declined Finalists,500,A,1505583300,[greedy],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Lazy Security Guard,750,B,1505583300,"[brute force, math]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Pie Rules,1000,C,1505583300,"[dp, games]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Third Month Insanity,1500,D,1505583300,"[dp, probabilities]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Desk Disorder,2000,E,1505583300,"[combinatorics, dfs and similar, dsu, graphs, trees]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Ordering T-Shirts,2750,F,1505583300,[greedy],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Circle of Numbers,3000,G,1505583300,[math],PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Did you mean...,500,A,1505653500,[greedy],PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Polycarp's phone book,1000,B,1505653500,"[brute force, data structures, hashing, strings]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Tests Renumeration,1500,C,1505653500,[greedy],PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Wizard's Tour,2000,D,1505653500,"[dfs and similar, graphs, greedy]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Arkady and a Nobody-men,2250,E,1505653500,"[data structures, dfs and similar, trees]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,k-rounding,750,A,1505653500,"[math, number theory]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Which floor?,750,B,1505653500,[brute force],PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Did you mean...,1500,C,1505653500,"[brute force, strings]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Polycarp's phone book,2000,D,1505653500,"[brute force, data structures, strings]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Tests Renumeration,2500,E,1505653500,[],PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Wizard's Tour,3000,F,1505653500,[dfs and similar],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the MEX,500,A,1505833500,[implementation],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the bipartiteness,1000,B,1505833500,"[dfs and similar, graphs]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the xor,1500,C,1505833500,[constructive algorithms],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the binary string,1750,D,1505833500,"[binary search, divide and conquer]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the function,2000,E,1505833500,"[binary search, data structures]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the final stage,2750,F,1505833500,"[data structures, strings]",PROGRAMMING +863,Educational Codeforces Round 29,12,Quasi-palindrome,,A,1506006300,"[brute force, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Kayaking,,B,1506006300,"[brute force, greedy, sortings]",PROGRAMMING +863,Educational Codeforces Round 29,12,1-2-3,,C,1506006300,"[graphs, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Yet Another Array Queries Problem,,D,1506006300,"[data structures, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Turn Off The TV,,E,1506006300,"[data structures, sortings]",PROGRAMMING +863,Educational Codeforces Round 29,12,Almost Permutation,,F,1506006300,[flows],PROGRAMMING +863,Educational Codeforces Round 29,12,Graphic Settings,,G,1506006300,[],PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Fair Game,500,A,1506335700,"[implementation, sortings]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Polycarp and Letters,1000,B,1506335700,"[brute force, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Bus,1500,C,1506335700,"[greedy, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Make a Permutation!,2000,D,1506335700,"[greedy, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Fire,2500,E,1506335700,"[dp, sortings]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Cities Excursions,3000,F,1506335700,[dfs and similar],PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Save the problem!,500,A,1506791100,[constructive algorithms],PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Ordering Pizza,1000,B,1506791100,"[binary search, sortings, ternary search]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Gotta Go Fast,1500,C,1506791100,"[binary search, dp]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Buy Low Sell High,2000,D,1506791100,"[constructive algorithms, data structures, greedy]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Hex Dyslexia,2500,E,1506791100,"[bitmasks, brute force, dp, graphs]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Egg Roulette,3000,F,1506791100,"[bitmasks, brute force, divide and conquer, math, meet-in-the-middle]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Flowers and Chocolate,3500,G,1506791100,"[combinatorics, math, matrices]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Save the problem!,500,A,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Ordering Pizza,1000,B,1506791100,"[greedy, implementation, sortings]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Gotta Go Fast,1500,C,1506791100,"[binary search, dp, probabilities]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Buy Low Sell High,2000,D,1506791100,"[data structures, greedy, two pointers]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Hex Dyslexia,2500,E,1506791100,[],PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Egg Roulette,3000,F,1506791100,[],PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Flowers and Chocolate,3500,G,1506791100,[math],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Between the Offices,500,A,1506791100,[implementation],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Save the problem!,1000,B,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Ordering Pizza,1500,C,1506791100,"[greedy, implementation, sortings, ternary search]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Gotta Go Fast,2000,D,1506791100,[],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Buy Low Sell High,2500,E,1506791100,"[data structures, greedy]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Hex Dyslexia,3000,F,1506791100,[],PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Bark to Unlock,250,A,1507187100,"[brute force, strings]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Race Against Time,500,B,1507187100,[implementation],PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Qualification Rounds,1000,C,1507187100,"[bitmasks, brute force, constructive algorithms, dp]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Huge Strings,1500,D,1507187100,"[bitmasks, brute force, dp, strings]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Policeman and a Tree,2250,E,1507187100,"[dp, graphs, trees]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Yet Another Minimization Problem,2500,F,1507187100,"[divide and conquer, dp]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,El Toll Caves,3500,G,1507187100,[math],PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Artful Expedient,500,A,1507296900,"[brute force, implementation]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Eternal Immortality,1000,B,1507296900,[math],PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Intriguing Obsession,1500,C,1507296900,"[combinatorics, dp, math]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Overdosing Ubiquity,2250,D,1507296900,"[brute force, dfs and similar, graphs]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Untended Antiquity,2500,E,1507296900,"[data structures, hashing]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Search for Pretty Integers,500,A,1508054700,[brute force],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Maximum of Maximums of Minimums,1000,B,1508054700,[greedy],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Maximum splitting,1500,C,1508054700,"[dp, greedy, number theory]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Something with XOR Queries,2250,D,1508054700,"[brute force, probabilities]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,"Points, Lines and Ready-made Titles",2500,E,1508054700,"[dfs and similar, dsu, trees]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Paths,3250,F,1508054700,"[data structures, number theory]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Maximum splitting,500,A,1508054700,"[dp, greedy, math, number theory]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Something with XOR Queries,1250,B,1508054700,"[brute force, implementation]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,"Points, Lines and Ready-made Titles",1500,C,1508054700,[dfs and similar],PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Paths,2250,D,1508054700,"[number theory, sortings]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Restore the Tree,2250,E,1508054700,"[graphs, greedy, trees]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Search for Pretty Integers,500,A,1508054700,[implementation],PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum of Maximums of Minimums,1000,B,1508054700,[implementation],PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum splitting,1500,C,1508054700,"[greedy, math, number theory]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Something with XOR Queries,2250,D,1508054700,"[brute force, implementation]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,"Points, Lines and Ready-made Titles",2500,E,1508054700,[],PROGRAMMING +873,Educational Codeforces Round 30,12,Chores,,A,1507817100,[implementation],PROGRAMMING +873,Educational Codeforces Round 30,12,Balanced Substring,,B,1507817100,"[dp, implementation]",PROGRAMMING +873,Educational Codeforces Round 30,12,Strange Game On Matrix,,C,1507817100,"[greedy, two pointers]",PROGRAMMING +873,Educational Codeforces Round 30,12,Merge Sort,,D,1507817100,[divide and conquer],PROGRAMMING +873,Educational Codeforces Round 30,12,Awards For Contestants,,E,1507817100,"[brute force, data structures, dp]",PROGRAMMING +873,Educational Codeforces Round 30,12,Forbidden Indices,,F,1507817100,"[dsu, string suffix structures, strings]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Classroom Watch,500,A,1508151900,[brute force],PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Sorting the Coins,1000,B,1508151900,"[dsu, sortings, two pointers]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,National Property,1500,C,1508151900,"[2-sat, dfs and similar, graphs, implementation]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,High Cry,1750,D,1508151900,"[binary search, bitmasks, data structures, divide and conquer]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Delivery Club,2000,E,1508151900,"[binary search, data structures, dp]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Royal Questions,2500,F,1508151900,"[dsu, greedy]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Trip For Meal,500,A,1508151900,[math],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Divisiblity of Differences,1000,B,1508151900,[math],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Classroom Watch,1500,C,1508151900,[brute force],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Sorting the Coins,2000,D,1508151900,"[dsu, sortings, trees, two pointers]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,National Property,2500,E,1508151900,"[2-sat, dfs and similar, graphs]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,High Cry,2750,F,1508151900,[data structures],PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Alex and broken contest,500,A,1508773500,"[implementation, strings]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Nikita and string,1000,B,1508773500,"[brute force, dp]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Slava and tanks,1500,C,1508773500,[constructive algorithms],PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Olya and Energy Drinks,2000,D,1508773500,"[data structures, dfs and similar, shortest paths]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Danil and a Part-time Job,2250,E,1508773500,"[bitmasks, data structures, trees]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Ann and Books,2750,F,1508773500,"[data structures, flows, hashing]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Short Program,500,A,1509029100,"[bitmasks, constructive algorithms]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Teams Formation,1250,B,1509029100,[implementation],PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Tournament,1250,C,1509029100,"[data structures, graphs]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Magic Breeding,2000,D,1509029100,[],PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Numbers on the blackboard,2500,E,1509029100,"[combinatorics, dp]",PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Borya's Diagnosis,500,A,1509029100,[implementation],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Table Tennis,1000,B,1509029100,[implementation],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Short Program,1500,C,1509029100,"[bitmasks, constructive algorithms, graph matchings]",PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Teams Formation,2250,D,1509029100,[],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Tournament,2250,E,1509029100,[],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Automatic Door,,A,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Army,,B,1508573100,"[constructive algorithms, graphs, greedy]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Downloading B++,,C,1508573100,[binary search],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen Strike Back,,D,1508573100,"[binary search, dp]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Field of Wonders,,E,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lost in Transliteration,,F,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Orientation of Edges,,G,1508573100,[graphs],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Palindromic Cut,,H,1508573100,"[brute force, implementation]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Photo Processing,,I,1508573100,[binary search],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Renovation,,J,1508573100,"[greedy, sortings]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Road Widening,,K,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland.Taxi,,L,1508573100,[data structures],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Quadcopter Competition,,M,1508573100,[greedy],PROGRAMMING +884,Educational Codeforces Round 31,12,Book Reading,,A,1509113100,[implementation],PROGRAMMING +884,Educational Codeforces Round 31,12,Japanese Crosswords Strike Back,,B,1509113100,[implementation],PROGRAMMING +884,Educational Codeforces Round 31,12,Bertown Subway,,C,1509113100,"[dfs and similar, greedy]",PROGRAMMING +884,Educational Codeforces Round 31,12,Boxes And Balls,,D,1509113100,"[data structures, greedy]",PROGRAMMING +884,Educational Codeforces Round 31,12,Binary Matrix,,E,1509113100,[dsu],PROGRAMMING +884,Educational Codeforces Round 31,12,Anti-Palindromize,,F,1509113100,[flows],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,ACM ICPC,500,A,1510502700,[brute force],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Vlad and Cafes,1000,B,1510502700,[],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Petya and Catacombs,1500,C,1510502700,"[dsu, greedy]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Restoration of string,2000,D,1510502700,"[constructive algorithms, graphs, implementation]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Maximum Element,2500,E,1510502700,"[combinatorics, dp]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Symmetric Projections,3000,F,1510502700,[geometry],PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Div. 64,500,A,1509725100,[implementation],PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Cubes for Masha,1000,B,1509725100,[brute force],PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Solution for Cube,1500,C,1509725100,"[brute force, implementation]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Ratings and Reality Shows,2000,D,1509725100,"[data structures, two pointers]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Little Brother,2500,E,1509725100,"[binary search, geometry]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Row of Models,3000,F,1509725100,[],PROGRAMMING +888,Educational Codeforces Round 32,12,Local Extrema,,A,1510239900,"[brute force, implementation]",PROGRAMMING +888,Educational Codeforces Round 32,12,Buggy Robot,,B,1510239900,"[dp, greedy]",PROGRAMMING +888,Educational Codeforces Round 32,12,K-Dominant Character,,C,1510239900,"[binary search, implementation, two pointers]",PROGRAMMING +888,Educational Codeforces Round 32,12,Almost Identity Permutations,,D,1510239900,"[combinatorics, dp, math]",PROGRAMMING +888,Educational Codeforces Round 32,12,Maximum Subsequence,,E,1510239900,"[bitmasks, divide and conquer, meet-in-the-middle]",PROGRAMMING +888,Educational Codeforces Round 32,12,Connecting Vertices,,F,1510239900,[dp],PROGRAMMING +888,Educational Codeforces Round 32,12,Xor-MST,,G,1510239900,"[bitmasks, constructive algorithms, data structures]",PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Petya and Catacombs,500,A,1510502700,[greedy],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Restoration of string,1000,B,1510502700,"[dsu, graphs, strings]",PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Maximum Element,1500,C,1510502700,[dp],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Symmetric Projections,2000,D,1510502700,[geometry],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Mod Mod Mod,2250,E,1510502700,"[binary search, dp, math]",PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,ACM ICPC,500,A,1510502700,[],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Vlad and Cafes,1000,B,1510502700,[],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Petya and Catacombs,1500,C,1510502700,[greedy],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Restoration of string,2000,D,1510502700,"[graphs, greedy, strings]",PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Maximum Element,2500,E,1510502700,[dp],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Symmetric Projections,3000,F,1510502700,[],PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Pride,500,A,1510929300,"[brute force, dp, greedy, math, number theory]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Gluttony,1000,B,1510929300,[constructive algorithms],PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Envy,1500,C,1510929300,"[data structures, dsu, graphs]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Sloth,2000,D,1510929300,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Lust,2500,E,1510929300,"[combinatorics, math]",PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Greed,500,A,1510929300,[implementation],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Wrath,1000,B,1510929300,"[implementation, two pointers]",PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Pride,1500,C,1510929300,[greedy],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Gluttony,2000,D,1510929300,[constructive algorithms],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Envy,2500,E,1510929300,[],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Chess For Three,,A,1511449500,[implementation],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Beautiful Divisors,,B,1511449500,[brute force],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Rumor,,C,1511449500,[dfs and similar],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Credit Card,,D,1511449500,"[data structures, dp, greedy, implementation]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Counting Arrays,,E,1511449500,"[combinatorics, dp, number theory]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Subtree Minimum Query,,F,1511449500,"[data structures, trees]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,QAQ,500,A,1511099700,"[brute force, dp]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph And His Magic Field,1000,B,1511099700,"[combinatorics, math, number theory]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Marco and GCD Sequence,1500,C,1511099700,"[constructive algorithms, math]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph And His Tour in Binary Country,2000,D,1511099700,"[data structures, trees]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph and Mushrooms,2500,E,1511099700,"[dp, graphs]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Pizza Separation,500,A,1511712300,[brute force],PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,XK Segments,1000,B,1511712300,"[binary search, sortings, two pointers]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Square Subsets,1750,C,1511712300,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,String Mark,2000,D,1511712300,"[combinatorics, math, strings]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Eyes Closed,2250,E,1511712300,"[data structures, probabilities]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Nephren gives a riddle,500,A,1512223500,[dfs and similar],PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Ithea Plays With Chtholly,1000,B,1512223500,"[games, greedy]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,"Willem, Chtholly and Seniorious",1500,C,1512223500,[probabilities],PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Nephren Runs a Cinema,2000,D,1512223500,"[chinese remainder theorem, combinatorics, math, number theory]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,"Welcome home, Chtholly",2500,E,1512223500,"[data structures, dsu]",PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Scarborough Fair,500,A,1512223500,[implementation],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Chtholly's request,1000,B,1512223500,[brute force],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Nephren gives a riddle,1500,C,1512223500,"[combinatorics, math]",PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Ithea Plays With Chtholly,2000,D,1512223500,[implementation],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,"Willem, Chtholly and Seniorious",2500,E,1512223500,[],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Rounding,500,A,1513424100,[implementation],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Proper Nutrition,750,B,1513424100,"[brute force, number theory]",PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Phone Numbers,1500,C,1513424100,"[implementation, strings]",PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Alarm Clock,1750,D,1513424100,[greedy],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Squares and not squares,2000,E,1513424100,[greedy],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Restoring the Expression,2500,F,1513424100,"[brute force, hashing, math]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Splitting in Teams,500,A,1513492500,[greedy],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Months and Years,1000,B,1513492500,[implementation],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Dividing the numbers,1500,C,1513492500,"[constructive algorithms, graphs]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Shovel Sale,1750,D,1513492500,[math],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Segments Removal,2250,E,1513492500,"[data structures, dsu, flows, two pointers]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Letters Removing,2500,F,1513492500,[data structures],PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Find Extra One,500,A,1513008300,[implementation],PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Position in Fraction,1000,B,1513008300,[math],PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Remove Extra One,1500,C,1513008300,"[brute force, data structures]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Unusual Sequences,2000,D,1513008300,"[bitmasks, combinatorics, dp, math, number theory]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Maximum Questions,2500,E,1513008300,"[data structures, dp, strings]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Hashing Trees,500,A,1513697700,"[constructive algorithms, trees]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,GCD of Polynomials,1000,B,1513697700,"[constructive algorithms, math]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Bipartite Segments,1750,C,1513697700,"[binary search, data structures, dfs and similar, dsu, graphs, two pointers]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Weighting a Tree,2000,D,1513697700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Cyclic Cipher,2500,E,1513697700,[fft],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Visiting a Friend,500,A,1513697700,[implementation],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Coloring a Tree,1000,B,1513697700,"[dfs and similar, dsu]",PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Hashing Trees,1500,C,1513697700,[],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,GCD of Polynomials,2000,D,1513697700,[math],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Bipartite Segments,2750,E,1513697700,"[data structures, dfs and similar]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Hungry Student Problem,,A,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,The Modcrab,,B,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Boxes Packing,,C,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Almost Difference,,D,1513091100,[math],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Swapping Characters,,E,1513091100,"[hashing, implementation, strings]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Clear The Matrix,,F,1513091100,"[bitmasks, dp]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Yet Another Maxflow Problem,,G,1513091100,"[data structures, flows]",PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Masha and Bears,500,A,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Tic-Tac-Toe,1000,B,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Shockers,1500,C,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Seating of Students,2250,D,1514037900,[constructive algorithms],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Party,2250,E,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Power Tower,3000,F,1514037900,[],PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Shockers,500,A,1514037900,[implementation],PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Seating of Students,1250,B,1514037900,"[brute force, constructive algorithms, math]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Party,1250,C,1514037900,"[bitmasks, brute force, dp, graphs]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Power Tower,2000,D,1514037900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Reverses,2500,E,1514037900,"[dp, string suffix structures, strings]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Masha and Bears,500,A,1514037900,"[brute force, implementation]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Tic-Tac-Toe,1000,B,1514037900,[implementation],PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Shockers,1500,C,1514037900,"[bitmasks, implementation]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Seating of Students,2250,D,1514037900,[],PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Party,2250,E,1514037900,"[bitmasks, dp]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Power Tower,3000,F,1514037900,[],PROGRAMMING +908,Good Bye 2017,12,New Year and Counting Cards,500,A,1514562000,[implementation],PROGRAMMING +908,Good Bye 2017,12,New Year and Buggy Bot,750,B,1514562000,"[brute force, implementation]",PROGRAMMING +908,Good Bye 2017,12,New Year and Curling,1000,C,1514562000,"[brute force, geometry, implementation, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Arbitrary Arrangement,1750,D,1514562000,"[dp, math, probabilities]",PROGRAMMING +908,Good Bye 2017,12,New Year and Entity Enumeration,1750,E,1514562000,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Rainbow Roads,2000,F,1514562000,"[graphs, greedy, implementation]",PROGRAMMING +908,Good Bye 2017,12,New Year and Original Order,2750,G,1514562000,"[dp, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Boolean Bridges,3500,H,1514562000,[],PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Generate Login,500,A,1514392500,"[brute force, greedy, sortings]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Segments,1000,B,1514392500,"[constructive algorithms, math]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Python Indentation,1500,C,1514392500,[dp],PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Colorful Points,1750,D,1514392500,"[data structures, greedy, implementation]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Coprocessor,2000,E,1514392500,"[dfs and similar, dp, graphs, greedy]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,AND-permutations,2500,F,1514392500,[constructive algorithms],PROGRAMMING +910,Testing Round #14 (Unrated),12,The Way to Home,500,A,1513940700,"[dfs and similar, dp, greedy]",PROGRAMMING +910,Testing Round #14 (Unrated),12,Door Frames,1000,B,1513940700,"[greedy, implementation]",PROGRAMMING +910,Testing Round #14 (Unrated),12,Minimum Sum,1500,C,1513940700,[greedy],PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Nearest Minimums,,A,1514469900,[implementation],PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Two Cakes,,B,1514469900,"[binary search, brute force, implementation]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Three Garlands,,C,1514469900,"[brute force, constructive algorithms]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Inversion Counting,,D,1514469900,"[brute force, math]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Stack Sorting,,E,1514469900,"[data structures, implementation]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Tree Destruction,,F,1514469900,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Mass Change Queries,,G,1514469900,[data structures],PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Tricky Alchemy,500,A,1515162900,[implementation],PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,New Year's Eve,1000,B,1515162900,"[bitmasks, constructive algorithms]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,"Perun, Ult!",1750,C,1515162900,"[brute force, greedy, sortings]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Fishes,2000,D,1515162900,"[data structures, probabilities]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Prime Gift,2500,E,1515162900,"[binary search, dfs and similar, math, meet-in-the-middle, number theory, two pointers]",PROGRAMMING +913,Hello 2018,12,Modular Exponentiation,500,A,1515422700,[implementation],PROGRAMMING +913,Hello 2018,12,Christmas Spruce,750,B,1515422700,"[implementation, trees]",PROGRAMMING +913,Hello 2018,12,Party Lemonade,1000,C,1515422700,"[bitmasks, dp, greedy]",PROGRAMMING +913,Hello 2018,12,Too Easy Problems,1250,D,1515422700,"[binary search, brute force, data structures, greedy, sortings]",PROGRAMMING +913,Hello 2018,12,Logical Expression,1750,E,1515422700,"[bitmasks, dp, shortest paths]",PROGRAMMING +913,Hello 2018,12,Strongly Connected Tournament,2250,F,1515422700,"[dp, graphs, probabilities]",PROGRAMMING +913,Hello 2018,12,Power Substring,3000,G,1515422700,"[math, number theory]",PROGRAMMING +913,Hello 2018,12,Don't Exceed,3500,H,1515422700,"[math, probabilities]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Perfect Squares,500,A,1516462500,"[implementation, math]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Conan and Agasa play a Card Game,1000,B,1516462500,"[games, greedy]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Travelling Salesman and Special Numbers,1500,C,1516462500,"[brute force, combinatorics, dp]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Bash and a Tough Math Puzzle,2000,D,1516462500,"[data structures, number theory]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Palindromes in a Tree,2500,E,1516462500,"[bitmasks, divide and conquer, trees]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Substrings in a String,3000,F,1516462500,"[bitmasks, brute force, string suffix structures, strings]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Sum the Fibonacci,3500,G,1516462500,"[bitmasks, divide and conquer]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Ember and Storm's Tree Game,3750,H,1516462500,"[combinatorics, dp, games, trees]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Garden,,A,1515848700,[implementation],PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Browser,,B,1515848700,[implementation],PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Permute Digits,,C,1515848700,"[dp, greedy]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Almost Acyclic Graph,,D,1515848700,"[dfs and similar, graphs]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Physical Education Lessons,,E,1515848700,"[data structures, implementation, sortings]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Imbalance Value of a Tree,,F,1515848700,"[data structures, dsu, graphs, trees]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Coprime Arrays,,G,1515848700,"[math, number theory]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Alarm Snooze,500,A,1516372500,"[brute force, implementation]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Binary Sequence (changed after round),1000,B,1516372500,"[bitmasks, greedy]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Interesting Graph,1500,C,1516372500,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and To-do List,2250,D,1516372500,"[data structures, trees]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Tree,2500,E,1516372500,"[data structures, trees]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,The Monster,500,A,1517236500,[greedy],PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,MADMAX,750,B,1517236500,"[dp, games, graphs]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Pollywog,1500,C,1517236500,[dp],PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Stranger Trees,2000,D,1517236500,"[dp, math, matrices, trees]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Upside Down,2750,E,1517236500,"[data structures, string suffix structures, strings, trees]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Eleven,500,A,1517236500,[implementation],PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Radio Station,1000,B,1517236500,[implementation],PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,The Monster,1500,C,1517236500,"[data structures, greedy]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,MADMAX,1750,D,1517236500,"[dfs and similar, dp, games]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Pollywog,2500,E,1517236500,[],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Supermarket,500,A,1517403900,[greedy],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Perfect Number,750,B,1517403900,"[binary search, brute force, dp, implementation, number theory]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Seat Arrangements,1000,C,1517403900,[implementation],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Substring,1500,D,1517403900,"[dfs and similar, dp, graphs]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Congruence Equation,2000,E,1517403900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,A Game With Numbers,2500,F,1517403900,"[games, graphs]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Water The Garden,,A,1517582100,[implementation],PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tea Queue,,B,1517582100,[implementation],PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Swap Adjacent Elements,,C,1517582100,"[dfs and similar, greedy, sortings, two pointers]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tanks,,D,1517582100,"[dp, greedy, implementation]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Connected Components?,,E,1517582100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,SUM and REPLACE,,F,1517582100,"[brute force, data structures, number theory]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,List Of Integers,,G,1517582100,"[binary search, bitmasks, brute force, combinatorics, math, number theory]",PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-1,,1,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-2,,2,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-3,,3,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-4,,4,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-5,,5,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-6,,6,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-7,,7,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-8,,8,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-9,,9,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-10,,10,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-11,,11,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-12,,12,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-13,,13,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-14,,14,1517500800,[],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Cloning Toys,500,A,1518023700,[implementation],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Magic Forest,1000,B,1518023700,[brute force],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Cave Painting,1250,C,1518023700,"[brute force, number theory]",PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Robot Vacuum Cleaner,1500,D,1518023700,"[greedy, sortings]",PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Birds,2000,E,1518023700,[dp],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Divisibility,2750,F,1518023700,"[constructive algorithms, dp, greedy, number theory]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Primal Sport,500,A,1520696100,"[math, number theory]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Producing Snow,1000,B,1520696100,"[binary search, data structures]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Perfect Security,1500,C,1520696100,"[data structures, greedy]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Picking Strings,1750,D,1520696100,"[constructive algorithms, implementation, strings]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Perpetual Subtraction,2250,E,1520696100,"[fft, math, matrices]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Public Service,3000,F,1520696100,[],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Mystical Mosaic,500,A,1521905700,[implementation],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Three-level Laser,1000,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING +924,VK Cup 2018 - Round 2,12,Riverside Curio,1250,C,1521905700,"[data structures, greedy]",PROGRAMMING +924,VK Cup 2018 - Round 2,12,Contact ATC,2000,D,1521905700,[],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Wardrobe,2250,E,1521905700,[],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Minimal Subset Difference,3000,F,1521905700,[],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Stairs and Elevators,500,A,1525007700,[binary search],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Resource Distribution,1000,B,1525007700,"[binary search, implementation, sortings]",PROGRAMMING +925,VK Cup 2018 - Round 3,12,Big Secret,1500,C,1525007700,[],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Aztec Catacombs,2000,D,1525007700,[constructive algorithms],PROGRAMMING +925,VK Cup 2018 - Round 3,12,May Holidays,2750,E,1525007700,[trees],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Parametric Circulation,3250,F,1525007700,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,2-3-numbers,,A,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Add Points,,B,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Choose Place,,D,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Mobile Communications,,F,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Large Bouquets,,G,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,A Vital Problem,,I,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Segments,,J,1521300900,[data structures],PROGRAMMING +927,VK Cup 2018 - Wild-card Round 2,12,BuberPool Taxi Optimization,,A,1524152100,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Login Verification,500,A,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Chat,1250,B,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Dependency management,2000,C,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Autocompletion,2250,D,1519486500,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Прокат велосипедов,500,A,1520004900,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Места в самолёте,1000,B,1520004900,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Красивая команда,1750,C,1520004900,[combinatorics],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Пограничные врата,2500,D,1520004900,[],PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Peculiar apple-tree,500,A,1520177700,[dfs and similar],PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with String,1000,B,1520177700,"[implementation, probabilities, strings]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Teodor is not a liar!,1500,C,1520177700,"[data structures, dp]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with Tokens,2000,D,1520177700,"[data structures, games, implementation]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Coins Exhibition,2500,E,1520177700,"[data structures, dp]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Friends Meeting,500,A,1520177700,"[brute force, implementation, math]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,World Cup,1000,B,1520177700,[implementation],PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Laboratory Work,1750,C,1520177700,"[implementation, math]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Peculiar apple-tree,1750,D,1520177700,[dfs and similar],PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Game with String,2500,E,1520177700,"[implementation, math, probabilities]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Teodor is not a liar!,3000,F,1520177700,"[data structures, dp]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindromic Supersequence,500,A,1518705300,[constructive algorithms],PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Recursive Queries,1000,B,1518705300,"[data structures, dfs and similar]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Permutation Cycle,1500,C,1518705300,"[brute force, constructive algorithms]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Tree,2000,D,1518705300,"[binary search, dp, trees]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Team Work,2500,E,1518705300,"[combinatorics, dp]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Escape Through Leaf,2500,F,1518705300,"[data structures, dp, geometry]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindrome Partition,3000,G,1518705300,"[dp, strings]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Twisty Movement,500,A,1518609900,"[data structures, dp]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Determined Cleanup,750,B,1518609900,[math],PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Colourful Prospect,1500,C,1518609900,[geometry],PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Creative Cutout,2250,D,1518609900,"[brute force, combinatorics, math]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Preponderant Reunion,2500,E,1518609900,"[constructive algorithms, dp]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Compatible Pair,500,A,1518609900,[brute force],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Prosperous Lot,1000,B,1518609900,[implementation],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Twisty Movement,1500,C,1518609900,"[brute force, dp]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Determined Cleanup,2000,D,1518609900,[math],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Colourful Prospect,2500,E,1518609900,[],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and his Company,500,A,1519058100,[brute force],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and the Gates,750,B,1519058100,[implementation],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fifa and Fafa,1250,C,1519058100,[geometry],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Alphabet,1750,D,1519058100,"[math, probabilities]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Mathematics,2250,E,1519058100,"[dp, trees]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Array,2750,F,1519058100,[data structures],PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Save Energy!,500,A,1519574700,"[binary search, implementation, math]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Sleepy Game,1000,B,1519574700,"[dfs and similar, dp, graphs]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Lock Puzzle,1500,C,1519574700,"[constructive algorithms, implementation]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,World of Tank,2000,D,1519574700,"[dp, greedy]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Iqea,2500,E,1519574700,"[data structures, dfs and similar, divide and conquer, dsu, shortest paths, trees]",PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Olympiad,500,A,1519574700,[implementation],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Vile Grasshoppers,1000,B,1519574700,[math],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Save Energy!,1500,C,1519574700,[math],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Sleepy Game,2000,D,1519574700,"[dfs and similar, graphs]",PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Lock Puzzle,2500,E,1519574700,[constructive algorithms],PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Word Correction,,A,1518793500,[implementation],PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Run For Your Prize,,B,1518793500,[brute force],PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Constructing Tests,,C,1518793500,"[binary search, brute force]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Buy a Ticket,,D,1518793500,"[data structures, graphs, shortest paths]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Max History,,E,1518793500,"[combinatorics, math]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Erasing Substrings,,F,1518793500,"[bitmasks, dp, greedy]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Shortest Path Queries,,G,1518793500,"[bitmasks, data structures, graphs]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Love Triangle,500,A,1518861900,"[brute force, implementation]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Hamster Farm,1000,B,1518861900,[implementation],PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Convenient For Everybody,1500,C,1518861900,"[binary search, two pointers]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Love Rescue,2000,D,1518861900,"[dfs and similar, dsu]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Maximize!,2500,E,1518861900,"[binary search, greedy, ternary search, two pointers]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Cutlet,2750,F,1518861900,"[data structures, dp]",PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Points on the line,500,A,1519464900,[brute force],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Our Tanya is Crying Out Loud,1250,B,1519464900,[greedy],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Phone Numbers,1250,C,1519464900,[constructive algorithms],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Alena And The Heater,1500,D,1519464900,[implementation],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Cashback,2000,E,1519464900,"[data structures, dp, greedy, math]",PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Machine Learning,2750,F,1519464900,"[brute force, data structures]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,World Cup,500,A,1520152800,[implementation],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Laboratory Work,1250,B,1520152800,[],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Peculiar apple-tree,1250,C,1520152800,[dfs and similar],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with String,2000,D,1520152800,[],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Teodor is not a liar!,2500,E,1520152800,"[binary search, data structures, dp]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with Tokens,3000,F,1520152800,"[data structures, games]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Coins Exhibition,3500,G,1520152800,[],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Partition,,A,1520348700,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Weird Subtraction Process,,B,1520348700,[number theory],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,String Transformation,,C,1520348700,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Timetable,,D,1520348700,[dp],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Largest Beautiful Number,,E,1520348700,"[greedy, implementation]",PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Fibonacci String Subsequences,,F,1520348700,"[combinatorics, dp, matrices]",PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Almost Increasing Array,,G,1520348700,"[data structures, dp]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Primal Sport,500,A,1520696100,"[brute force, math, number theory]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Producing Snow,1000,B,1520696100,"[binary search, data structures, implementation]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perfect Security,1500,C,1520696100,"[data structures, strings]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Picking Strings,1750,D,1520696100,"[constructive algorithms, implementation]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perpetual Subtraction,2250,E,1520696100,"[fft, math, matrices]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Public Service,3000,F,1520696100,[],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Protect Sheep,500,A,1520696100,[brute force],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Primal Sport,1000,B,1520696100,"[brute force, math, number theory]",PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Producing Snow,1500,C,1520696100,"[binary search, data structures]",PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Perfect Security,2000,D,1520696100,[data structures],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Picking Strings,2250,E,1520696100,"[constructive algorithms, implementation]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Zebras,500,A,1520583000,[greedy],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,A Leapfrog in the Array,1000,B,1520583000,[math],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Data Center Maintenance,1250,C,1520583000,"[dfs and similar, graphs]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Curfew,1750,D,1520583000,"[binary search, brute force]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Binary Cards,2250,E,1520583000,[brute force],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Astronomy,2500,F,1520583000,"[geometry, probabilities]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,"Left-handers, Right-handers and Ambidexters",500,A,1520583000,[implementation],PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Intercepted Message,1000,B,1520583000,[greedy],PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Zebras,1500,C,1520583000,"[constructive algorithms, greedy]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,A Leapfrog in the Array,2000,D,1520583000,"[constructive algorithms, math]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Data Center Maintenance,2250,E,1520583000,"[2-sat, graphs]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Curfew,2750,F,1520583000,[greedy],PROGRAMMING +952,April Fools Contest 2018,12,Quirky Quantifiers,,A,1522596900,[math],PROGRAMMING +952,April Fools Contest 2018,12,A Map of the Cat,,B,1522596900,[brute force],PROGRAMMING +952,April Fools Contest 2018,12,Ravioli Sort,,C,1522596900,[implementation],PROGRAMMING +952,April Fools Contest 2018,12,I'm Feeling Lucky!,,D,1522596900,[probabilities],PROGRAMMING +952,April Fools Contest 2018,12,Cheese Board,,E,1522596900,[],PROGRAMMING +952,April Fools Contest 2018,12,2 + 2 != 4,,F,1522596900,[],PROGRAMMING +952,April Fools Contest 2018,12,Puzzling Language,,G,1522596900,[constructive algorithms],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,2-3-numbers,,A,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Add Points,,B,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Choose Place,,D,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Mobile Communications,,F,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Large Bouquets,,G,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,A Vital Problem,,I,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Segments,,J,1521300900,[],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Diagonal Walking,,A,1521698700,[implementation],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,String Typing,,B,1521698700,[strings],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Matrix Walk,,C,1521698700,[implementation],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Fight Against Traffic,,D,1521698700,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Water Taps,,E,1521698700,"[binary search, greedy, sortings]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Runner's Problem,,F,1521698700,"[dp, matrices, sortings]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Castle Defense,,G,1521698700,"[binary search, two pointers]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Path Counting,,H,1521698700,"[combinatorics, dp]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Yet Another String Matching Problem,,I,1521698700,[fft],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Feed the cat,500,A,1521822900,"[greedy, math]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Not simply beatiful strings,1000,B,1521822900,[implementation],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Sad powers,1500,C,1521822900,"[binary search, math, number theory]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Scissors,2000,D,1521822900,"[brute force, strings]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Icicles,2500,E,1521822900,[],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Heaps,3000,F,1521822900,"[dp, trees]",PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Mystical Mosaic,500,A,1521905700,[implementation],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Three-level Laser,1000,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Riverside Curio,1250,C,1521905700,"[data structures, greedy, implementation]",PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Contact ATC,2000,D,1521905700,[],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Wardrobe,2250,E,1521905700,[dp],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Minimal Subset Difference,3000,F,1521905700,"[bitmasks, dp]",PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Tritonic Iridescence,500,A,1521905700,[implementation],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Mystical Mosaic,1000,B,1521905700,[brute force],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Three-level Laser,1500,C,1521905700,"[binary search, math]",PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Riverside Curio,1750,D,1521905700,[greedy],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Contact ATC,2500,E,1521905700,[],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (easy),,A1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (medium),,A2,1523689500,"[hashing, strings]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (hard),,A3,1523689500,[],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (easy),,B1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (medium),,B2,1523689500,"[data structures, greedy, trees]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (easy),,C1,1523689500,[brute force],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (medium),,C2,1523689500,[dp],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (hard),,C3,1523689500,"[data structures, dp]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (easy),,D1,1523689500,"[expression parsing, math]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (hard),,D2,1523689500,[],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (easy),,E1,1523689500,"[brute force, geometry, greedy, math]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (medium),,E2,1523689500,"[binary search, dp, greedy, sortings]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (hard),,E3,1523689500,[geometry],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (easy),,F1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (medium),,F2,1523689500,"[binary search, two pointers]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (hard),,F3,1523689500,[fft],PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the even-odd game,500,A,1522771500,"[games, math]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the message,1000,B,1522771500,"[dsu, implementation]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the wrong algorithm,1250,C,1522771500,"[constructive algorithms, trees]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and another array construction task,1750,D,1522771500,"[constructive algorithms, greedy, number theory]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the xor-MST,2000,E,1522771500,"[bitmasks, dp, graphs, implementation, math]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and yet another xor task,2500,F,1522771500,"[bitmasks, dp, math, matrices]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Check the string,500,A,1523117100,[implementation],PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Minimize the error,1000,B,1523117100,"[data structures, greedy, sortings]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Subsequence Counting,1500,C,1523117100,"[bitmasks, constructive algorithms, greedy, implementation]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Full Binary Tree Queries,2000,D,1523117100,"[brute force, implementation, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Alternating Tree,2250,E,1523117100,"[combinatorics, dfs and similar, divide and conquer, dp, probabilities, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Pathwalks,2500,F,1523117100,"[data structures, dp, graphs]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Bandit Blues,3000,G,1523117100,"[combinatorics, dp, fft, math]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Santa's Gift,3500,H,1523117100,"[data structures, trees]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tetris,,A,1522850700,[implementation],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Lecture Sleep,,B,1522850700,"[data structures, dp, implementation, two pointers]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Chessboard,,C,1522850700,"[bitmasks, brute force, implementation]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Pair Of Lines,,D,1522850700,[geometry],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tufurama,,E,1522850700,[data structures],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,k-substrings,,F,1522850700,"[binary search, hashing, string suffix structures]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Partitions,,G,1522850700,"[combinatorics, math, number theory]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Equator,,A,1523370900,[implementation],PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Students in Railway Carriage,,B,1523370900,"[constructive algorithms, greedy, implementation]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Make a Square,,C,1523370900,"[brute force, implementation, math]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Merge Equals,,D,1523370900,"[data structures, implementation]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,"Byteland, Berland and Disputed Cities",,E,1523370900,"[constructive algorithms, greedy]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Simple Cycles Edges,,F,1523370900,"[dfs and similar, graphs, trees]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Visible Black Areas,,G,1523370900,"[data structures, dsu, geometry, trees]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Alternating Sum,500,A,1523973900,"[math, number theory]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Destruction of a Tree,1000,B,1523973900,"[constructive algorithms, dfs and similar, dp, greedy, trees]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Cutting Rectangle,1500,C,1523973900,"[brute force, math, number theory]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Frequency of String,2000,D,1523973900,"[hashing, string suffix structures, strings]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Circles of Waiting,2500,E,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Splits,500,A,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Messages,1000,B,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Alternating Sum,1500,C,1523973900,"[math, matrices, number theory]",PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Destruction of a Tree,2000,D,1523973900,"[dfs and similar, dp, trees]",PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Cutting Rectangle,2500,E,1523973900,[math],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Paper Airplanes,500,A,1524677700,[math],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Battleship,1000,B,1524677700,[implementation],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Greedy Arkady,1500,C,1524677700,[math],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Single-use Stones,2000,D,1524677700,"[binary search, flows, greedy, two pointers]",PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Short Code,2500,E,1524677700,"[data structures, dp, greedy, strings, trees]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Stairs and Elevators,500,A,1525007700,"[binary search, data structures, greedy]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Resource Distribution,1000,B,1525007700,"[binary search, data structures, greedy, two pointers]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Big Secret,1500,C,1525007700,"[constructive algorithms, data structures, greedy]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Aztec Catacombs,2000,D,1525007700,"[constructive algorithms, graphs]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,May Holidays,2750,E,1525007700,[],PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Parametric Circulation,3250,F,1525007700,[flows],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Mind the Gap,500,A,1525007700,[implementation],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Watering System,1000,B,1525007700,[sortings],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Stairs and Elevators,1500,C,1525007700,[binary search],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Resource Distribution,2000,D,1525007700,"[binary search, sortings]",PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Big Secret,2750,E,1525007700,[],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Aztec Catacombs,3250,F,1525007700,[],PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Aramic script,500,A,1525183500,"[implementation, strings]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Mancala,1000,B,1525183500,"[brute force, implementation]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Valhalla Siege,1500,C,1525183500,[binary search],PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Ghosts,2000,D,1525183500,"[geometry, math]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Hag's Khashba,2500,E,1525183500,[geometry],PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimum Binary Number,,A,1525099200,[implementation],PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Lara Croft and the New Game,,B,1525099200,"[implementation, math]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Nested Segments,,C,1525099200,"[greedy, implementation, sortings]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Degree Set,,D,1525099200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Well played!,,E,1525099200,"[greedy, sortings]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimal k-covering,,F,1525099200,[flows],PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Wrong Subtraction,,A,1525615500,[implementation],PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Two-gram,,B,1525615500,"[implementation, strings]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Less or Equal,,C,1525615500,[sortings],PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,"Divide by three, multiply by two",,D,1525615500,"[dfs and similar, math, sortings]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Cyclic Components,,E,1525615500,"[dfs and similar, dsu, graphs]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Consecutive Subsequence,,F,1525615500,[dp],PROGRAMMING +A,Links and Pearls,500.0,"[implementation, math]",PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2 +B,Marlin,1000.0,[constructive algorithms],PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2 +C,Posterized,1500.0,[greedy],PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2 +D,Perfect Groups,2000.0,"[dp, math, number theory]",PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2 +E,The Number Games,2500.0,"[data structures, greedy, trees]",PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2 +F,Cactus to Tree,3000.0,"[dp, graphs, trees]",PROGRAMMING,980,Codeforces Round #480 (Div. 2),1525791900,2 +980,Codeforces Round #480 (Div. 2),2,Links and Pearls,500.0,A,1525791900,"[implementation, math]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Marlin,1000.0,B,1525791900,[constructive algorithms],PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Posterized,1500.0,C,1525791900,[greedy],PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Perfect Groups,2000.0,D,1525791900,"[dp, math, number theory]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,The Number Games,2500.0,E,1525791900,"[data structures, greedy, trees]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Cactus to Tree,3000.0,F,1525791900,"[dp, graphs, trees]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Wrong Subtraction,,A,1525615500,[implementation],PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Two-gram,,B,1525615500,"[implementation, strings]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Less or Equal,,C,1525615500,[sortings],PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,"Divide by three, multiply by two",,D,1525615500,"[dfs and similar, math, sortings]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Cyclic Components,,E,1525615500,"[dfs and similar, dsu, graphs]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Consecutive Subsequence,,F,1525615500,[dp],PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Aramic script,500.0,A,1525183500,"[implementation, strings]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Mancala,1000.0,B,1525183500,"[brute force, implementation]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Valhalla Siege,1500.0,C,1525183500,[binary search],PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Ghosts,2000.0,D,1525183500,"[geometry, math]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Hag's Khashba,2500.0,E,1525183500,[geometry],PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimum Binary Number,,A,1525099200,[implementation],PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Lara Croft and the New Game,,B,1525099200,"[implementation, math]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Nested Segments,,C,1525099200,"[greedy, implementation, sortings]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Degree Set,,D,1525099200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Well played!,,E,1525099200,"[greedy, sortings]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimal k-covering,,F,1525099200,[flows],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Stairs and Elevators,500.0,A,1525007700,[binary search],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Resource Distribution,1000.0,B,1525007700,"[binary search, implementation, sortings]",PROGRAMMING +925,VK Cup 2018 - Round 3,12,Big Secret,1500.0,C,1525007700,[],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Aztec Catacombs,2000.0,D,1525007700,[constructive algorithms],PROGRAMMING +925,VK Cup 2018 - Round 3,12,May Holidays,2750.0,E,1525007700,"[data structures, trees]",PROGRAMMING +925,VK Cup 2018 - Round 3,12,Parametric Circulation,3250.0,F,1525007700,[],PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Stairs and Elevators,500.0,A,1525007700,"[binary search, data structures, greedy]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Resource Distribution,1000.0,B,1525007700,"[binary search, data structures, greedy, two pointers]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Big Secret,1500.0,C,1525007700,"[constructive algorithms, data structures, greedy]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Aztec Catacombs,2000.0,D,1525007700,"[constructive algorithms, graphs]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,May Holidays,2750.0,E,1525007700,[],PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Parametric Circulation,3250.0,F,1525007700,[flows],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Mind the Gap,500.0,A,1525007700,[implementation],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Watering System,1000.0,B,1525007700,[sortings],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Stairs and Elevators,1500.0,C,1525007700,[binary search],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Resource Distribution,2000.0,D,1525007700,"[binary search, sortings]",PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Big Secret,2750.0,E,1525007700,[],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Aztec Catacombs,3250.0,F,1525007700,[],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Paper Airplanes,500.0,A,1524677700,[math],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Battleship,1000.0,B,1524677700,[implementation],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Greedy Arkady,1500.0,C,1524677700,[math],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Single-use Stones,2000.0,D,1524677700,"[binary search, flows, greedy, two pointers]",PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Short Code,2500.0,E,1524677700,"[data structures, dp, greedy, strings, trees]",PROGRAMMING +927,VK Cup 2018 - Wild-card Round 2,12,BuberPool Taxi Optimization,,A,1524152100,[],PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Alternating Sum,500.0,A,1523973900,"[math, number theory]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Destruction of a Tree,1000.0,B,1523973900,"[constructive algorithms, dfs and similar, dp, greedy, trees]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Cutting Rectangle,1500.0,C,1523973900,"[brute force, math, number theory]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Frequency of String,2000.0,D,1523973900,"[hashing, string suffix structures, strings]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Circles of Waiting,2500.0,E,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Splits,500.0,A,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Messages,1000.0,B,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Alternating Sum,1500.0,C,1523973900,"[math, matrices, number theory]",PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Destruction of a Tree,2000.0,D,1523973900,"[dfs and similar, dp, trees]",PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Cutting Rectangle,2500.0,E,1523973900,[math],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (easy),,A1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (medium),,A2,1523689500,"[hashing, strings]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (hard),,A3,1523689500,[],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (easy),,B1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (medium),,B2,1523689500,"[data structures, greedy, trees]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (easy),,C1,1523689500,[brute force],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (medium),,C2,1523689500,[dp],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (hard),,C3,1523689500,"[data structures, dp]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (easy),,D1,1523689500,"[expression parsing, math]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (hard),,D2,1523689500,[],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (easy),,E1,1523689500,"[brute force, geometry, greedy, math]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (medium),,E2,1523689500,"[binary search, dp, greedy, sortings]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (hard),,E3,1523689500,[geometry],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (easy),,F1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (medium),,F2,1523689500,"[binary search, two pointers]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (hard),,F3,1523689500,[fft],PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Equator,,A,1523370900,[implementation],PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Students in Railway Carriage,,B,1523370900,"[constructive algorithms, greedy, implementation]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Make a Square,,C,1523370900,"[brute force, implementation, math]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Merge Equals,,D,1523370900,"[data structures, implementation]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,"Byteland, Berland and Disputed Cities",,E,1523370900,"[constructive algorithms, greedy]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Simple Cycles Edges,,F,1523370900,"[dfs and similar, graphs, trees]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Visible Black Areas,,G,1523370900,"[data structures, dsu, geometry, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Check the string,500.0,A,1523117100,[implementation],PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Minimize the error,1000.0,B,1523117100,"[data structures, greedy, sortings]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Subsequence Counting,1500.0,C,1523117100,"[bitmasks, constructive algorithms, greedy, implementation]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Full Binary Tree Queries,2000.0,D,1523117100,"[brute force, implementation, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Alternating Tree,2250.0,E,1523117100,"[combinatorics, dfs and similar, divide and conquer, dp, probabilities, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Pathwalks,2500.0,F,1523117100,"[data structures, dp, graphs]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Bandit Blues,3000.0,G,1523117100,"[combinatorics, dp, fft, math]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Santa's Gift,3500.0,H,1523117100,"[data structures, trees]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tetris,,A,1522850700,[implementation],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Lecture Sleep,,B,1522850700,"[data structures, dp, implementation, two pointers]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Chessboard,,C,1522850700,"[bitmasks, brute force, implementation]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Pair Of Lines,,D,1522850700,[geometry],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tufurama,,E,1522850700,[data structures],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,k-substrings,,F,1522850700,"[binary search, hashing, string suffix structures]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Partitions,,G,1522850700,"[combinatorics, math, number theory]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the even-odd game,500.0,A,1522771500,"[games, math]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the message,1000.0,B,1522771500,"[dsu, implementation]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the wrong algorithm,1250.0,C,1522771500,"[constructive algorithms, trees]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and another array construction task,1750.0,D,1522771500,"[constructive algorithms, greedy, number theory]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the xor-MST,2000.0,E,1522771500,"[bitmasks, dp, graphs, implementation, math]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and yet another xor task,2500.0,F,1522771500,"[bitmasks, dp, math, matrices]",PROGRAMMING +952,April Fools Contest 2018,12,Quirky Quantifiers,,A,1522596900,[math],PROGRAMMING +952,April Fools Contest 2018,12,A Map of the Cat,,B,1522596900,[brute force],PROGRAMMING +952,April Fools Contest 2018,12,Ravioli Sort,,C,1522596900,[implementation],PROGRAMMING +952,April Fools Contest 2018,12,I'm Feeling Lucky!,,D,1522596900,[probabilities],PROGRAMMING +952,April Fools Contest 2018,12,Cheese Board,,E,1522596900,[],PROGRAMMING +952,April Fools Contest 2018,12,2 + 2 != 4,,F,1522596900,[],PROGRAMMING +952,April Fools Contest 2018,12,Puzzling Language,,G,1522596900,[constructive algorithms],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING +924,VK Cup 2018 - Round 2,12,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy]",PROGRAMMING +924,VK Cup 2018 - Round 2,12,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Wardrobe,2250.0,E,1521905700,[],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Minimal Subset Difference,3000.0,F,1521905700,[],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy, implementation]",PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Wardrobe,2250.0,E,1521905700,[dp],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Minimal Subset Difference,3000.0,F,1521905700,"[bitmasks, dp]",PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Tritonic Iridescence,500.0,A,1521905700,[implementation],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Mystical Mosaic,1000.0,B,1521905700,[brute force],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Three-level Laser,1500.0,C,1521905700,"[binary search, math]",PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Riverside Curio,1750.0,D,1521905700,[greedy],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Contact ATC,2500.0,E,1521905700,[],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Feed the cat,500.0,A,1521822900,"[greedy, math]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Not simply beatiful strings,1000.0,B,1521822900,[implementation],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Sad powers,1500.0,C,1521822900,"[binary search, math, number theory]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Scissors,2000.0,D,1521822900,"[brute force, strings]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Icicles,2500.0,E,1521822900,[],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Heaps,3000.0,F,1521822900,"[dp, trees]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Diagonal Walking,,A,1521698700,[implementation],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,String Typing,,B,1521698700,[strings],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Matrix Walk,,C,1521698700,[implementation],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Fight Against Traffic,,D,1521698700,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Water Taps,,E,1521698700,"[binary search, greedy, sortings]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Runner's Problem,,F,1521698700,"[dp, matrices, sortings]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Castle Defense,,G,1521698700,"[binary search, two pointers]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Path Counting,,H,1521698700,"[combinatorics, dp]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Yet Another String Matching Problem,,I,1521698700,[fft],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,2-3-numbers,,A,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Add Points,,B,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Choose Place,,D,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Mobile Communications,,F,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Large Bouquets,,G,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,A Vital Problem,,I,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Segments,,J,1521300900,[data structures],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,2-3-numbers,,A,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Add Points,,B,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Choose Place,,D,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Mobile Communications,,F,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Large Bouquets,,G,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,A Vital Problem,,I,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Segments,,J,1521300900,[],PROGRAMMING +923,VK Cup 2018 - Round 1,12,Primal Sport,500.0,A,1520696100,"[math, number theory]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Producing Snow,1000.0,B,1520696100,"[binary search, data structures]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Perfect Security,1500.0,C,1520696100,"[data structures, greedy]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation, strings]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Public Service,3000.0,F,1520696100,[],PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Primal Sport,500.0,A,1520696100,"[brute force, math, number theory]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Producing Snow,1000.0,B,1520696100,"[binary search, data structures, implementation]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perfect Security,1500.0,C,1520696100,"[data structures, strings]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Public Service,3000.0,F,1520696100,[],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Protect Sheep,500.0,A,1520696100,[brute force],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Primal Sport,1000.0,B,1520696100,"[brute force, math, number theory]",PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Producing Snow,1500.0,C,1520696100,"[binary search, data structures]",PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Perfect Security,2000.0,D,1520696100,[data structures],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Picking Strings,2250.0,E,1520696100,"[constructive algorithms, implementation]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Zebras,500.0,A,1520583000,[greedy],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,A Leapfrog in the Array,1000.0,B,1520583000,[math],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Data Center Maintenance,1250.0,C,1520583000,"[dfs and similar, graphs]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Curfew,1750.0,D,1520583000,"[binary search, brute force]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Binary Cards,2250.0,E,1520583000,[brute force],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Astronomy,2500.0,F,1520583000,"[geometry, probabilities]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,"Left-handers, Right-handers and Ambidexters",500.0,A,1520583000,[implementation],PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Intercepted Message,1000.0,B,1520583000,[greedy],PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Zebras,1500.0,C,1520583000,"[constructive algorithms, greedy]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,A Leapfrog in the Array,2000.0,D,1520583000,"[constructive algorithms, math]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Data Center Maintenance,2250.0,E,1520583000,"[2-sat, graphs]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Curfew,2750.0,F,1520583000,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Partition,,A,1520348700,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Weird Subtraction Process,,B,1520348700,[number theory],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,String Transformation,,C,1520348700,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Timetable,,D,1520348700,[dp],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Largest Beautiful Number,,E,1520348700,"[greedy, implementation]",PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Fibonacci String Subsequences,,F,1520348700,"[combinatorics, dp, matrices]",PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Almost Increasing Array,,G,1520348700,"[data structures, dp]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Peculiar apple-tree,500.0,A,1520177700,[dfs and similar],PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with String,1000.0,B,1520177700,"[implementation, probabilities, strings]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Teodor is not a liar!,1500.0,C,1520177700,"[data structures, dp]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with Tokens,2000.0,D,1520177700,"[data structures, games, implementation]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Coins Exhibition,2500.0,E,1520177700,"[data structures, dp]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Friends Meeting,500.0,A,1520177700,"[brute force, implementation, math]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,World Cup,1000.0,B,1520177700,[implementation],PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Laboratory Work,1750.0,C,1520177700,"[implementation, math]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Peculiar apple-tree,1750.0,D,1520177700,[dfs and similar],PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Game with String,2500.0,E,1520177700,"[implementation, math, probabilities]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Teodor is not a liar!,3000.0,F,1520177700,"[data structures, dp]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,World Cup,500.0,A,1520152800,[implementation],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Laboratory Work,1250.0,B,1520152800,[],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Peculiar apple-tree,1250.0,C,1520152800,[dfs and similar],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with String,2000.0,D,1520152800,[],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Teodor is not a liar!,2500.0,E,1520152800,"[binary search, data structures, dp]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with Tokens,3000.0,F,1520152800,"[data structures, games]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Coins Exhibition,3500.0,G,1520152800,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Прокат велосипедов,500.0,A,1520004900,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Места в самолёте,1000.0,B,1520004900,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Красивая команда,1750.0,C,1520004900,[combinatorics],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Пограничные врата,2500.0,D,1520004900,[],PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Save Energy!,500.0,A,1519574700,"[binary search, implementation, math]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Sleepy Game,1000.0,B,1519574700,"[dfs and similar, dp, graphs]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Lock Puzzle,1500.0,C,1519574700,"[constructive algorithms, implementation]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,World of Tank,2000.0,D,1519574700,"[dp, greedy]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Iqea,2500.0,E,1519574700,"[data structures, dfs and similar, divide and conquer, dsu, shortest paths, trees]",PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Olympiad,500.0,A,1519574700,[implementation],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Vile Grasshoppers,1000.0,B,1519574700,[math],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Save Energy!,1500.0,C,1519574700,[math],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Sleepy Game,2000.0,D,1519574700,"[dfs and similar, graphs]",PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Lock Puzzle,2500.0,E,1519574700,[constructive algorithms],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Login Verification,500.0,A,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Chat,1250.0,B,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Dependency management,2000.0,C,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Autocompletion,2250.0,D,1519486500,[],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Points on the line,500.0,A,1519464900,[brute force],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Our Tanya is Crying Out Loud,1250.0,B,1519464900,[greedy],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Phone Numbers,1250.0,C,1519464900,[constructive algorithms],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Alena And The Heater,1500.0,D,1519464900,[implementation],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Cashback,2000.0,E,1519464900,"[data structures, dp, greedy, math]",PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Machine Learning,2750.0,F,1519464900,"[brute force, data structures]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and his Company,500.0,A,1519058100,[brute force],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and the Gates,750.0,B,1519058100,[implementation],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fifa and Fafa,1250.0,C,1519058100,[geometry],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Alphabet,1750.0,D,1519058100,"[math, probabilities]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Mathematics,2250.0,E,1519058100,"[dp, trees]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Array,2750.0,F,1519058100,[data structures],PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Love Triangle,500.0,A,1518861900,[],PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Hamster Farm,1000.0,B,1518861900,[implementation],PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Convenient For Everybody,1500.0,C,1518861900,"[binary search, two pointers]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Love Rescue,2000.0,D,1518861900,"[dsu, greedy]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Maximize!,2500.0,E,1518861900,"[binary search, greedy, ternary search, two pointers]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Cutlet,2750.0,F,1518861900,"[data structures, dp]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Word Correction,,A,1518793500,[implementation],PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Run For Your Prize,,B,1518793500,"[brute force, greedy]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Constructing Tests,,C,1518793500,"[binary search, brute force]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Buy a Ticket,,D,1518793500,"[data structures, graphs, shortest paths]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Max History,,E,1518793500,"[combinatorics, math]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Erasing Substrings,,F,1518793500,"[bitmasks, dp, greedy]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Shortest Path Queries,,G,1518793500,"[bitmasks, data structures, dsu, graphs]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindromic Supersequence,500.0,A,1518705300,[constructive algorithms],PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Recursive Queries,1000.0,B,1518705300,"[data structures, dfs and similar]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Permutation Cycle,1500.0,C,1518705300,"[brute force, constructive algorithms]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Tree,2000.0,D,1518705300,"[binary search, dp, trees]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Team Work,2500.0,E,1518705300,"[combinatorics, dp]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Escape Through Leaf,2500.0,F,1518705300,"[data structures, dp, geometry]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindrome Partition,3000.0,G,1518705300,"[dp, string suffix structures, strings]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Twisty Movement,500.0,A,1518609900,[dp],PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Determined Cleanup,750.0,B,1518609900,[math],PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Colourful Prospect,1500.0,C,1518609900,[geometry],PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Creative Cutout,2250.0,D,1518609900,"[brute force, combinatorics, math]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Preponderant Reunion,2500.0,E,1518609900,"[constructive algorithms, dp]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Compatible Pair,500.0,A,1518609900,"[brute force, games]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Prosperous Lot,1000.0,B,1518609900,[implementation],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Twisty Movement,1500.0,C,1518609900,"[brute force, dp, implementation]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Determined Cleanup,2000.0,D,1518609900,[math],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Colourful Prospect,2500.0,E,1518609900,[],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Cloning Toys,500.0,A,1518023700,[implementation],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Magic Forest,1000.0,B,1518023700,[brute force],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Cave Painting,1250.0,C,1518023700,"[brute force, number theory]",PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Robot Vacuum Cleaner,1500.0,D,1518023700,"[greedy, sortings]",PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Birds,2000.0,E,1518023700,[dp],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Divisibility,2750.0,F,1518023700,"[constructive algorithms, dp, greedy, number theory]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Water The Garden,,A,1517582100,[implementation],PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tea Queue,,B,1517582100,[implementation],PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Swap Adjacent Elements,,C,1517582100,"[dfs and similar, greedy, sortings, two pointers]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tanks,,D,1517582100,"[dp, greedy, implementation]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Connected Components?,,E,1517582100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,SUM and REPLACE,,F,1517582100,"[brute force, data structures, number theory]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,List Of Integers,,G,1517582100,"[binary search, bitmasks, brute force, combinatorics, math, number theory]",PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-1,,01,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-2,,02,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-3,,03,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-4,,04,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-5,,05,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-6,,06,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-7,,07,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-8,,08,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-9,,09,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-10,,10,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-11,,11,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-12,,12,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-13,,13,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-14,,14,1517500800,[],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Supermarket,500.0,A,1517403900,[greedy],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Perfect Number,750.0,B,1517403900,"[binary search, brute force, dp, implementation, number theory]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Seat Arrangements,1000.0,C,1517403900,[implementation],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Substring,1500.0,D,1517403900,"[dfs and similar, dp, graphs]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Congruence Equation,2000.0,E,1517403900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,A Game With Numbers,2500.0,F,1517403900,"[games, graphs, shortest paths]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,The Monster,500.0,A,1517236500,[greedy],PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,MADMAX,750.0,B,1517236500,"[dp, games, graphs]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Pollywog,1500.0,C,1517236500,[dp],PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Stranger Trees,2000.0,D,1517236500,"[dp, math, matrices, trees]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Upside Down,2750.0,E,1517236500,"[data structures, string suffix structures, strings, trees]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Eleven,500.0,A,1517236500,[implementation],PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Radio Station,1000.0,B,1517236500,[implementation],PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,The Monster,1500.0,C,1517236500,"[data structures, greedy]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,MADMAX,1750.0,D,1517236500,"[dfs and similar, dp, games]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Pollywog,2500.0,E,1517236500,[],PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Perfect Squares,500.0,A,1516462500,"[implementation, math]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Conan and Agasa play a Card Game,1000.0,B,1516462500,"[games, greedy]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Travelling Salesman and Special Numbers,1500.0,C,1516462500,"[brute force, combinatorics, dp]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Bash and a Tough Math Puzzle,2000.0,D,1516462500,"[data structures, number theory]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Palindromes in a Tree,2500.0,E,1516462500,"[bitmasks, divide and conquer, trees]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Substrings in a String,3000.0,F,1516462500,"[bitmasks, brute force, string suffix structures, strings]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Sum the Fibonacci,3500.0,G,1516462500,"[bitmasks, divide and conquer]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Ember and Storm's Tree Game,3750.0,H,1516462500,"[combinatorics, dp, games, trees]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Alarm Snooze,500.0,A,1516372500,"[brute force, implementation]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Binary Sequence (changed after round),1000.0,B,1516372500,"[bitmasks, greedy]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Interesting Graph,1500.0,C,1516372500,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and To-do List,2250.0,D,1516372500,"[data structures, trees]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Tree,2500.0,E,1516372500,"[data structures, trees]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Garden,,A,1515848700,[implementation],PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Browser,,B,1515848700,[implementation],PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Permute Digits,,C,1515848700,"[dp, greedy]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Almost Acyclic Graph,,D,1515848700,"[dfs and similar, graphs]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Physical Education Lessons,,E,1515848700,"[data structures, implementation, sortings]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Imbalance Value of a Tree,,F,1515848700,"[data structures, dsu, graphs, trees]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Coprime Arrays,,G,1515848700,"[math, number theory]",PROGRAMMING +913,Hello 2018,12,Modular Exponentiation,500.0,A,1515422700,"[implementation, math]",PROGRAMMING +913,Hello 2018,12,Christmas Spruce,750.0,B,1515422700,"[implementation, trees]",PROGRAMMING +913,Hello 2018,12,Party Lemonade,1000.0,C,1515422700,"[bitmasks, dp, greedy]",PROGRAMMING +913,Hello 2018,12,Too Easy Problems,1250.0,D,1515422700,"[binary search, brute force, data structures, greedy, sortings]",PROGRAMMING +913,Hello 2018,12,Logical Expression,1750.0,E,1515422700,"[bitmasks, dp, shortest paths]",PROGRAMMING +913,Hello 2018,12,Strongly Connected Tournament,2250.0,F,1515422700,"[dp, graphs, probabilities]",PROGRAMMING +913,Hello 2018,12,Power Substring,3000.0,G,1515422700,"[math, number theory]",PROGRAMMING +913,Hello 2018,12,Don't Exceed,3500.0,H,1515422700,"[math, probabilities]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Tricky Alchemy,500.0,A,1515162900,[implementation],PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,New Year's Eve,1000.0,B,1515162900,"[bitmasks, constructive algorithms]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,"Perun, Ult!",1750.0,C,1515162900,"[brute force, greedy, sortings]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Fishes,2000.0,D,1515162900,"[data structures, probabilities]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Prime Gift,2500.0,E,1515162900,"[binary search, dfs and similar, math, meet-in-the-middle, number theory, two pointers]",PROGRAMMING +908,Good Bye 2017,12,New Year and Counting Cards,500.0,A,1514562000,[implementation],PROGRAMMING +908,Good Bye 2017,12,New Year and Buggy Bot,750.0,B,1514562000,"[brute force, implementation]",PROGRAMMING +908,Good Bye 2017,12,New Year and Curling,1000.0,C,1514562000,"[brute force, geometry, implementation, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Arbitrary Arrangement,1750.0,D,1514562000,"[dp, math, probabilities]",PROGRAMMING +908,Good Bye 2017,12,New Year and Entity Enumeration,1750.0,E,1514562000,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Rainbow Roads,2000.0,F,1514562000,"[graphs, greedy, implementation]",PROGRAMMING +908,Good Bye 2017,12,New Year and Original Order,2750.0,G,1514562000,"[dp, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Boolean Bridges,3500.0,H,1514562000,[],PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Nearest Minimums,,A,1514469900,[implementation],PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Two Cakes,,B,1514469900,"[binary search, brute force, implementation]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Three Garlands,,C,1514469900,"[brute force, constructive algorithms]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Inversion Counting,,D,1514469900,"[brute force, math]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Stack Sorting,,E,1514469900,"[data structures, implementation]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Tree Destruction,,F,1514469900,"[constructive algorithms, dfs and similar, graphs, greedy, trees]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Mass Change Queries,,G,1514469900,[data structures],PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Generate Login,500.0,A,1514392500,"[brute force, greedy, sortings]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Segments,1000.0,B,1514392500,"[constructive algorithms, math]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Python Indentation,1500.0,C,1514392500,[dp],PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Colorful Points,1750.0,D,1514392500,"[data structures, greedy, implementation]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Coprocessor,2000.0,E,1514392500,"[dfs and similar, dp, graphs, greedy]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,AND-permutations,2500.0,F,1514392500,[constructive algorithms],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Masha and Bears,500.0,A,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Tic-Tac-Toe,1000.0,B,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Shockers,1500.0,C,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Seating of Students,2250.0,D,1514037900,[constructive algorithms],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Party,2250.0,E,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Power Tower,3000.0,F,1514037900,[],PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Shockers,500.0,A,1514037900,[implementation],PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Seating of Students,1250.0,B,1514037900,"[brute force, constructive algorithms, math]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Party,1250.0,C,1514037900,"[bitmasks, brute force, dp, graphs]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Power Tower,2000.0,D,1514037900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Reverses,2500.0,E,1514037900,"[dp, string suffix structures, strings]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Masha and Bears,500.0,A,1514037900,"[brute force, implementation]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Tic-Tac-Toe,1000.0,B,1514037900,[implementation],PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Shockers,1500.0,C,1514037900,"[bitmasks, implementation]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Seating of Students,2250.0,D,1514037900,[],PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Party,2250.0,E,1514037900,"[bitmasks, dp]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Power Tower,3000.0,F,1514037900,[],PROGRAMMING +910,Testing Round #14 (Unrated),12,The Way to Home,500.0,A,1513940700,"[dfs and similar, dp, greedy]",PROGRAMMING +910,Testing Round #14 (Unrated),12,Door Frames,1000.0,B,1513940700,"[greedy, implementation]",PROGRAMMING +910,Testing Round #14 (Unrated),12,Minimum Sum,1500.0,C,1513940700,[greedy],PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Hashing Trees,500.0,A,1513697700,"[constructive algorithms, trees]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,GCD of Polynomials,1000.0,B,1513697700,"[constructive algorithms, math]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Bipartite Segments,1750.0,C,1513697700,"[binary search, data structures, dfs and similar, dsu, graphs, two pointers]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Weighting a Tree,2000.0,D,1513697700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Cyclic Cipher,2500.0,E,1513697700,[fft],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Visiting a Friend,500.0,A,1513697700,[implementation],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Coloring a Tree,1000.0,B,1513697700,"[dfs and similar, dsu]",PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Hashing Trees,1500.0,C,1513697700,[],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,GCD of Polynomials,2000.0,D,1513697700,[math],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Bipartite Segments,2750.0,E,1513697700,"[data structures, dfs and similar]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Splitting in Teams,500.0,A,1513492500,[greedy],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Months and Years,1000.0,B,1513492500,[implementation],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Dividing the numbers,1500.0,C,1513492500,"[constructive algorithms, graphs]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Shovel Sale,1750.0,D,1513492500,[math],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Segments Removal,2250.0,E,1513492500,"[data structures, dsu, flows, two pointers]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Letters Removing,2500.0,F,1513492500,[data structures],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Rounding,500.0,A,1513424100,[implementation],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Proper Nutrition,750.0,B,1513424100,"[brute force, number theory]",PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Phone Numbers,1500.0,C,1513424100,"[implementation, strings]",PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Alarm Clock,1750.0,D,1513424100,[greedy],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Squares and not squares,2000.0,E,1513424100,[greedy],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Restoring the Expression,2500.0,F,1513424100,"[brute force, hashing, math]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Hungry Student Problem,,A,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,The Modcrab,,B,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Boxes Packing,,C,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Almost Difference,,D,1513091100,[math],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Swapping Characters,,E,1513091100,"[hashing, implementation, strings]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Clear The Matrix,,F,1513091100,"[bitmasks, dp]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Yet Another Maxflow Problem,,G,1513091100,"[data structures, flows]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Find Extra One,500.0,A,1513008300,[implementation],PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Position in Fraction,1000.0,B,1513008300,[math],PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Remove Extra One,1500.0,C,1513008300,"[brute force, data structures]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Unusual Sequences,2000.0,D,1513008300,"[bitmasks, combinatorics, dp, math, number theory]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Maximum Questions,2500.0,E,1513008300,"[data structures, dp, strings]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Nephren gives a riddle,500.0,A,1512223500,[dfs and similar],PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Ithea Plays With Chtholly,1000.0,B,1512223500,"[games, greedy]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,"Willem, Chtholly and Seniorious",1500.0,C,1512223500,[probabilities],PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Nephren Runs a Cinema,2000.0,D,1512223500,"[chinese remainder theorem, combinatorics, math, number theory]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,"Welcome home, Chtholly",2500.0,E,1512223500,"[data structures, dsu]",PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Scarborough Fair,500.0,A,1512223500,[implementation],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Chtholly's request,1000.0,B,1512223500,[brute force],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Nephren gives a riddle,1500.0,C,1512223500,"[combinatorics, math]",PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Ithea Plays With Chtholly,2000.0,D,1512223500,[implementation],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,"Willem, Chtholly and Seniorious",2500.0,E,1512223500,[],PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Pizza Separation,500.0,A,1511712300,[brute force],PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,XK Segments,1000.0,B,1511712300,"[binary search, sortings, two pointers]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Square Subsets,1750.0,C,1511712300,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,String Mark,2000.0,D,1511712300,"[combinatorics, math, strings]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Eyes Closed,2250.0,E,1511712300,"[data structures, probabilities]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Chess For Three,,A,1511449500,[implementation],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Beautiful Divisors,,B,1511449500,[brute force],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Rumor,,C,1511449500,[dfs and similar],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Credit Card,,D,1511449500,"[data structures, dp, greedy, implementation]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Counting Arrays,,E,1511449500,"[combinatorics, dp, number theory]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Subtree Minimum Query,,F,1511449500,"[data structures, trees]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,QAQ,500.0,A,1511099700,"[brute force, dp]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph And His Magic Field,1000.0,B,1511099700,"[combinatorics, math, number theory]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Marco and GCD Sequence,1500.0,C,1511099700,"[constructive algorithms, math]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph And His Tour in Binary Country,2000.0,D,1511099700,"[data structures, trees]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph and Mushrooms,2500.0,E,1511099700,"[dp, graphs]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Pride,500.0,A,1510929300,"[brute force, dp, greedy, math, number theory]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Gluttony,1000.0,B,1510929300,[constructive algorithms],PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Envy,1500.0,C,1510929300,"[data structures, dsu, graphs]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Sloth,2000.0,D,1510929300,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Lust,2500.0,E,1510929300,"[combinatorics, math]",PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Greed,500.0,A,1510929300,[implementation],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Wrath,1000.0,B,1510929300,"[implementation, two pointers]",PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Pride,1500.0,C,1510929300,[greedy],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Gluttony,2000.0,D,1510929300,"[constructive algorithms, greedy]",PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Envy,2500.0,E,1510929300,[],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,ACM ICPC,500.0,A,1510502700,[brute force],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Petya and Catacombs,1500.0,C,1510502700,"[dsu, greedy]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Restoration of string,2000.0,D,1510502700,"[constructive algorithms, graphs, implementation]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Maximum Element,2500.0,E,1510502700,"[combinatorics, dp]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Symmetric Projections,3000.0,F,1510502700,[geometry],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Petya and Catacombs,500.0,A,1510502700,[greedy],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Restoration of string,1000.0,B,1510502700,"[dsu, graphs, strings]",PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Maximum Element,1500.0,C,1510502700,[dp],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Symmetric Projections,2000.0,D,1510502700,[geometry],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Mod Mod Mod,2250.0,E,1510502700,"[binary search, dp, math]",PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,ACM ICPC,500.0,A,1510502700,[],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Petya and Catacombs,1500.0,C,1510502700,[greedy],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Restoration of string,2000.0,D,1510502700,"[graphs, greedy, strings]",PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Maximum Element,2500.0,E,1510502700,[dp],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Symmetric Projections,3000.0,F,1510502700,[],PROGRAMMING +888,Educational Codeforces Round 32,12,Local Extrema,,A,1510239900,"[brute force, implementation]",PROGRAMMING +888,Educational Codeforces Round 32,12,Buggy Robot,,B,1510239900,"[dp, greedy]",PROGRAMMING +888,Educational Codeforces Round 32,12,K-Dominant Character,,C,1510239900,"[binary search, implementation, two pointers]",PROGRAMMING +888,Educational Codeforces Round 32,12,Almost Identity Permutations,,D,1510239900,"[combinatorics, dp, math]",PROGRAMMING +888,Educational Codeforces Round 32,12,Maximum Subsequence,,E,1510239900,"[bitmasks, divide and conquer, meet-in-the-middle]",PROGRAMMING +888,Educational Codeforces Round 32,12,Connecting Vertices,,F,1510239900,[dp],PROGRAMMING +888,Educational Codeforces Round 32,12,Xor-MST,,G,1510239900,"[bitmasks, constructive algorithms, data structures]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Div. 64,500.0,A,1509725100,[implementation],PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Cubes for Masha,1000.0,B,1509725100,[brute force],PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Solution for Cube,1500.0,C,1509725100,"[brute force, implementation]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Ratings and Reality Shows,2000.0,D,1509725100,"[data structures, two pointers]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Little Brother,2500.0,E,1509725100,"[binary search, geometry]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Row of Models,3000.0,F,1509725100,"[greedy, sortings]",PROGRAMMING +884,Educational Codeforces Round 31,12,Book Reading,,A,1509113100,[implementation],PROGRAMMING +884,Educational Codeforces Round 31,12,Japanese Crosswords Strike Back,,B,1509113100,[implementation],PROGRAMMING +884,Educational Codeforces Round 31,12,Bertown Subway,,C,1509113100,"[dfs and similar, greedy, math]",PROGRAMMING +884,Educational Codeforces Round 31,12,Boxes And Balls,,D,1509113100,"[data structures, greedy]",PROGRAMMING +884,Educational Codeforces Round 31,12,Binary Matrix,,E,1509113100,[dsu],PROGRAMMING +884,Educational Codeforces Round 31,12,Anti-Palindromize,,F,1509113100,"[flows, graphs, greedy]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Short Program,500.0,A,1509029100,"[bitmasks, constructive algorithms]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Teams Formation,1250.0,B,1509029100,[implementation],PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Tournament,1250.0,C,1509029100,"[data structures, graphs]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Magic Breeding,2000.0,D,1509029100,[],PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Numbers on the blackboard,2500.0,E,1509029100,"[combinatorics, dp]",PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Borya's Diagnosis,500.0,A,1509029100,[implementation],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Table Tennis,1000.0,B,1509029100,[implementation],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Short Program,1500.0,C,1509029100,"[bitmasks, constructive algorithms, graph matchings]",PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Teams Formation,2250.0,D,1509029100,[],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Tournament,2250.0,E,1509029100,[],PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Alex and broken contest,500.0,A,1508773500,"[implementation, strings]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Nikita and string,1000.0,B,1508773500,"[brute force, dp]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Slava and tanks,1500.0,C,1508773500,[constructive algorithms],PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Olya and Energy Drinks,2000.0,D,1508773500,"[data structures, dfs and similar, shortest paths]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Danil and a Part-time Job,2250.0,E,1508773500,"[bitmasks, data structures, trees]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Ann and Books,2750.0,F,1508773500,"[data structures, flows, hashing]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Automatic Door,,A,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Army,,B,1508573100,"[constructive algorithms, graphs, greedy]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Downloading B++,,C,1508573100,[binary search],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen Strike Back,,D,1508573100,"[binary search, dp]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Field of Wonders,,E,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lost in Transliteration,,F,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Orientation of Edges,,G,1508573100,[graphs],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Palindromic Cut,,H,1508573100,"[brute force, implementation]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Photo Processing,,I,1508573100,"[binary search, dp]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Renovation,,J,1508573100,"[greedy, sortings]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Road Widening,,K,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland.Taxi,,L,1508573100,[data structures],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Quadcopter Competition,,M,1508573100,[greedy],PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Classroom Watch,500.0,A,1508151900,[brute force],PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Sorting the Coins,1000.0,B,1508151900,"[dsu, sortings, two pointers]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,National Property,1500.0,C,1508151900,"[2-sat, dfs and similar, graphs, implementation]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,High Cry,1750.0,D,1508151900,"[binary search, bitmasks, data structures, divide and conquer]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Delivery Club,2000.0,E,1508151900,"[binary search, data structures, dp]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Royal Questions,2500.0,F,1508151900,"[dsu, greedy]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Trip For Meal,500.0,A,1508151900,[math],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Divisiblity of Differences,1000.0,B,1508151900,[math],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Classroom Watch,1500.0,C,1508151900,[brute force],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Sorting the Coins,2000.0,D,1508151900,"[dsu, sortings, trees, two pointers]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,National Property,2500.0,E,1508151900,"[2-sat, dfs and similar, graphs]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,High Cry,2750.0,F,1508151900,[data structures],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Search for Pretty Integers,500.0,A,1508054700,[brute force],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Maximum of Maximums of Minimums,1000.0,B,1508054700,[greedy],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Maximum splitting,1500.0,C,1508054700,"[dp, greedy, number theory]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Something with XOR Queries,2250.0,D,1508054700,"[brute force, probabilities]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Paths,3250.0,F,1508054700,"[data structures, number theory]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Maximum splitting,500.0,A,1508054700,"[dp, greedy, math, number theory]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Something with XOR Queries,1250.0,B,1508054700,"[brute force, implementation]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,"Points, Lines and Ready-made Titles",1500.0,C,1508054700,"[dfs and similar, graphs]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Paths,2250.0,D,1508054700,"[number theory, sortings]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Restore the Tree,2250.0,E,1508054700,"[graphs, greedy, trees]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Search for Pretty Integers,500.0,A,1508054700,[implementation],PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum of Maximums of Minimums,1000.0,B,1508054700,[implementation],PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum splitting,1500.0,C,1508054700,"[greedy, math, number theory]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Something with XOR Queries,2250.0,D,1508054700,"[brute force, implementation]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,[],PROGRAMMING +873,Educational Codeforces Round 30,12,Chores,,A,1507817100,[implementation],PROGRAMMING +873,Educational Codeforces Round 30,12,Balanced Substring,,B,1507817100,"[dp, implementation]",PROGRAMMING +873,Educational Codeforces Round 30,12,Strange Game On Matrix,,C,1507817100,"[greedy, two pointers]",PROGRAMMING +873,Educational Codeforces Round 30,12,Merge Sort,,D,1507817100,"[constructive algorithms, divide and conquer]",PROGRAMMING +873,Educational Codeforces Round 30,12,Awards For Contestants,,E,1507817100,"[brute force, data structures, dp]",PROGRAMMING +873,Educational Codeforces Round 30,12,Forbidden Indices,,F,1507817100,"[dsu, string suffix structures, strings]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Artful Expedient,500.0,A,1507296900,"[brute force, implementation]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Eternal Immortality,1000.0,B,1507296900,[math],PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Intriguing Obsession,1500.0,C,1507296900,"[combinatorics, dp, math]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Overdosing Ubiquity,2250.0,D,1507296900,"[brute force, dfs and similar, graphs]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Untended Antiquity,2500.0,E,1507296900,"[data structures, hashing]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Bark to Unlock,250.0,A,1507187100,"[brute force, strings]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Race Against Time,500.0,B,1507187100,[implementation],PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Qualification Rounds,1000.0,C,1507187100,"[bitmasks, brute force, constructive algorithms, dp]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Huge Strings,1500.0,D,1507187100,"[bitmasks, brute force, dp, strings]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Policeman and a Tree,2250.0,E,1507187100,"[dp, graphs, trees]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Yet Another Minimization Problem,2500.0,F,1507187100,"[divide and conquer, dp]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,El Toll Caves,3500.0,G,1507187100,[math],PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Save the problem!,500.0,A,1506791100,[constructive algorithms],PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Ordering Pizza,1000.0,B,1506791100,"[binary search, sortings, ternary search]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Buy Low Sell High,2000.0,D,1506791100,"[constructive algorithms, data structures, greedy]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Hex Dyslexia,2500.0,E,1506791100,"[bitmasks, brute force, dp, graphs]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Egg Roulette,3000.0,F,1506791100,"[bitmasks, brute force, divide and conquer, math, meet-in-the-middle]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Flowers and Chocolate,3500.0,G,1506791100,"[combinatorics, math, matrices]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Save the problem!,500.0,A,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Ordering Pizza,1000.0,B,1506791100,"[greedy, implementation, sortings]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp, probabilities]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Buy Low Sell High,2000.0,D,1506791100,"[data structures, greedy, two pointers]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Hex Dyslexia,2500.0,E,1506791100,[],PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Egg Roulette,3000.0,F,1506791100,[],PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Flowers and Chocolate,3500.0,G,1506791100,[math],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Between the Offices,500.0,A,1506791100,[implementation],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Save the problem!,1000.0,B,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Ordering Pizza,1500.0,C,1506791100,"[greedy, implementation, sortings, ternary search]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Gotta Go Fast,2000.0,D,1506791100,[],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Buy Low Sell High,2500.0,E,1506791100,"[data structures, greedy]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Hex Dyslexia,3000.0,F,1506791100,[],PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Fair Game,500.0,A,1506335700,"[implementation, sortings]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Polycarp and Letters,1000.0,B,1506335700,"[brute force, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Bus,1500.0,C,1506335700,"[greedy, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Make a Permutation!,2000.0,D,1506335700,"[greedy, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Fire,2500.0,E,1506335700,"[dp, sortings]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Cities Excursions,3000.0,F,1506335700,[dfs and similar],PROGRAMMING +855,"Manthan, Codefest 17",12,Tom Riddle's Diary,500.0,A,1506263700,[implementation],PROGRAMMING +855,"Manthan, Codefest 17",12,Marvolo Gaunt's Ring,1000.0,B,1506263700,"[data structures, dp]",PROGRAMMING +855,"Manthan, Codefest 17",12,Helga Hufflepuff's Cup,1500.0,C,1506263700,"[dp, trees]",PROGRAMMING +855,"Manthan, Codefest 17",12,Rowena Ravenclaw's Diadem,2000.0,D,1506263700,[trees],PROGRAMMING +855,"Manthan, Codefest 17",12,Salazar Slytherin's Locket,2500.0,E,1506263700,"[bitmasks, dp]",PROGRAMMING +855,"Manthan, Codefest 17",12,Nagini,3000.0,F,1506263700,[data structures],PROGRAMMING +855,"Manthan, Codefest 17",12,Harry Vs Voldemort,3500.0,G,1506263700,"[dp, graphs, trees]",PROGRAMMING +863,Educational Codeforces Round 29,12,Quasi-palindrome,,A,1506006300,"[brute force, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Kayaking,,B,1506006300,"[brute force, greedy, sortings]",PROGRAMMING +863,Educational Codeforces Round 29,12,1-2-3,,C,1506006300,"[graphs, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Yet Another Array Queries Problem,,D,1506006300,"[data structures, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Turn Off The TV,,E,1506006300,"[data structures, sortings]",PROGRAMMING +863,Educational Codeforces Round 29,12,Almost Permutation,,F,1506006300,[flows],PROGRAMMING +863,Educational Codeforces Round 29,12,Graphic Settings,,G,1506006300,[],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the MEX,500.0,A,1505833500,[implementation],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the bipartiteness,1000.0,B,1505833500,"[dfs and similar, graphs]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the xor,1500.0,C,1505833500,[constructive algorithms],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the binary string,1750.0,D,1505833500,"[binary search, divide and conquer]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the function,2000.0,E,1505833500,"[binary search, data structures]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the final stage,2750.0,F,1505833500,"[data structures, strings]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Union of Doubly Linked Lists,,A,1505739900,[implementation],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Preparing for Merge Sort,,B,1505739900,[binary search],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Sum of Nestings,,C,1505739900,[],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Dog Show,,D,1505739900,"[data structures, greedy]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen,,E,1505739900,[binary search],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Elections,,F,1505739900,[greedy],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,University Classes,,G,1505739900,[implementation],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Load Testing,,H,1505739900,[],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Noise Level,,I,1505739900,[dfs and similar],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Students Initiation,,J,1505739900,"[binary search, flows]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Travel Cards,,K,1505739900,[sortings],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland SU Computer Network,,L,1505739900,"[dfs and similar, hashing, trees]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Weather Tomorrow,,M,1505739900,[implementation],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,k-rounding,750.0,A,1505653500,"[brute force, number theory]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Did you mean...,1500.0,C,1505653500,"[dp, greedy, implementation]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Polycarp's phone book,2000.0,D,1505653500,"[data structures, sortings]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Tests Renumeration,2500.0,E,1505653500,[implementation],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Wizard's Tour,3000.0,F,1505653500,"[constructive algorithms, dfs and similar]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Did you mean...,500.0,A,1505653500,[greedy],PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Polycarp's phone book,1000.0,B,1505653500,"[brute force, data structures, hashing, strings]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Tests Renumeration,1500.0,C,1505653500,[greedy],PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Wizard's Tour,2000.0,D,1505653500,"[dfs and similar, graphs, greedy]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Arkady and a Nobody-men,2250.0,E,1505653500,"[data structures, dfs and similar, trees]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,k-rounding,750.0,A,1505653500,"[math, number theory]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Did you mean...,1500.0,C,1505653500,"[brute force, strings]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Polycarp's phone book,2000.0,D,1505653500,"[brute force, data structures, strings]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Tests Renumeration,2500.0,E,1505653500,[],PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Wizard's Tour,3000.0,F,1505653500,[dfs and similar],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Declined Finalists,500.0,A,1505583300,[greedy],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Lazy Security Guard,750.0,B,1505583300,"[brute force, math]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Pie Rules,1000.0,C,1505583300,"[dp, games]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Third Month Insanity,1500.0,D,1505583300,"[dp, probabilities]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Desk Disorder,2000.0,E,1505583300,"[combinatorics, dfs and similar, dsu, graphs, trees]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Ordering T-Shirts,2750.0,F,1505583300,[greedy],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Circle of Numbers,3000.0,G,1505583300,[math],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Set Theory,,A,1505050500,"[brute force, constructive algorithms]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Similar Words,,B,1505050500,"[dp, strings]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Eleventh Birthday,,C,1505050500,"[combinatorics, dp, math]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Masha and Cactus,,D,1505050500,[],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Satellites,,E,1505050500,[],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,To Play or not to Play,,F,1505050500,[],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Planning,750.0,A,1504702500,[greedy],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Jury Meeting,750.0,B,1504702500,"[greedy, sortings, two pointers]",PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Boredom,1750.0,C,1504702500,[data structures],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Michael and Charging Stations,1750.0,D,1504702500,"[binary search, dp]",PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Lada Malina,2500.0,E,1504702500,"[data structures, geometry]",PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Fraction,500.0,A,1504702500,"[brute force, constructive algorithms, math]",PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Maxim Buys an Apartment,1000.0,B,1504702500,[constructive algorithms],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Planning,1750.0,C,1504702500,[],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Jury Meeting,1750.0,D,1504702500,[greedy],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Boredom,2500.0,E,1504702500,[data structures],PROGRAMMING +846,Educational Codeforces Round 28,12,Curriculum Vitae,,A,1504623900,[brute force],PROGRAMMING +846,Educational Codeforces Round 28,12,Math Show,,B,1504623900,"[brute force, greedy]",PROGRAMMING +846,Educational Codeforces Round 28,12,Four Segments,,C,1504623900,"[brute force, dp]",PROGRAMMING +846,Educational Codeforces Round 28,12,Monitor,,D,1504623900,"[binary search, data structures]",PROGRAMMING +846,Educational Codeforces Round 28,12,Chemistry in Berland,,E,1504623900,"[dfs and similar, greedy, trees]",PROGRAMMING +846,Educational Codeforces Round 28,12,Random Query,,F,1504623900,"[math, two pointers]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Five Dimensional Points,500.0,A,1504535700,"[brute force, geometry, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a list of numbers,1000.0,B,1504535700,[number theory],PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a game with Mojtaba,1250.0,C,1504535700,"[bitmasks, dp, games]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Tournament Construction,1750.0,D,1504535700,"[dp, graphs, greedy, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Random Elections,2000.0,E,1504535700,"[bitmasks, brute force, fft, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Rainbow Balls,2500.0,F,1504535700,[math],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a research in Mexican wave,500.0,A,1504535700,[implementation],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and an exam about geometry,1000.0,B,1504535700,"[geometry, math]",PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Five Dimensional Points,1500.0,C,1504535700,"[brute force, math]",PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a list of numbers,2000.0,D,1504535700,[],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a game with Mojtaba,2500.0,E,1504535700,"[bitmasks, games]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Digits,,A,1504432800,"[brute force, implementation, math]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Neural Network country,,B,1504432800,"[dp, matrices]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Property,,C,1504432800,"[greedy, sortings]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Exploration plan,,D,1504432800,"[binary search, flows, graph matchings, shortest paths]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Casinos and travel,,E,1504432800,[dp],PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Product transformation,,F,1504432800,"[combinatorics, math, number theory]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Bathroom terminal,,G,1504432800,[implementation],PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Bob and stages,,H,1504432800,"[dp, geometry]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Dating,,I,1504432800,"[brute force, dfs and similar, graphs, trees]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,From Y to Y,500.0,A,1504272900,[constructive algorithms],PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Rooter's Song,1000.0,B,1504272900,"[constructive algorithms, data structures, geometry, implementation, sortings, two pointers]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Goodbye Souvenir,1750.0,C,1504272900,"[data structures, divide and conquer]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Shake It!,1750.0,D,1504272900,"[combinatorics, dp, flows, graphs]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Days of Floral Colours,2500.0,E,1504272900,"[combinatorics, dp, fft, math]",PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Odds and Ends,500.0,A,1504272900,[implementation],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Tell Your World,1000.0,B,1504272900,"[brute force, geometry]",PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,From Y to Y,1500.0,C,1504272900,[constructive algorithms],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Rooter's Song,2000.0,D,1504272900,[],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Goodbye Souvenir,2500.0,E,1504272900,[data structures],PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Kirill And The Game,500.0,A,1504019100,"[brute force, two pointers]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Gleb And Pizza,1000.0,B,1504019100,[geometry],PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Ilya And The Tree,1500.0,C,1504019100,"[dfs and similar, math, trees]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Vitya and Strange Lesson,2000.0,D,1504019100,"[binary search, data structures]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Nikita and game,2500.0,E,1504019100,"[binary search, dfs and similar, divide and conquer, trees]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Sorting by Subsequences,500.0,A,1503592500,"[dfs and similar, dsu, implementation, sortings]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Interactive LowerBound,1000.0,B,1503592500,"[brute force, probabilities]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Upgrading Tree,1750.0,C,1503592500,"[constructive algorithms, dfs and similar, math]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Dynamic Shortest Path,2250.0,D,1503592500,"[graphs, shortest paths]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Maximum Flow,2250.0,E,1503592500,[flows],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Diversity,500.0,A,1503592500,[implementation],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Rectangles,1000.0,B,1503592500,"[combinatorics, math]",PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Sorting by Subsequences,1500.0,C,1503592500,[dfs and similar],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Interactive LowerBound,2000.0,D,1503592500,"[brute force, probabilities]",PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Upgrading Tree,3000.0,E,1503592500,[],PROGRAMMING +845,Educational Codeforces Round 27,12,Chess Tourney,,A,1503327900,[sortings],PROGRAMMING +845,Educational Codeforces Round 27,12,Luba And The Ticket,,B,1503327900,"[brute force, greedy]",PROGRAMMING +845,Educational Codeforces Round 27,12,Two TVs,,C,1503327900,"[data structures, greedy, sortings]",PROGRAMMING +845,Educational Codeforces Round 27,12,Driving Test,,D,1503327900,"[data structures, dp, greedy]",PROGRAMMING +845,Educational Codeforces Round 27,12,Fire in the City,,E,1503327900,"[binary search, data structures]",PROGRAMMING +845,Educational Codeforces Round 27,12,Guards In The Storehouse,,F,1503327900,[dp],PROGRAMMING +845,Educational Codeforces Round 27,12,Shortest Path Problem?,,G,1503327900,"[dfs and similar, math]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Leha and Function,500.0,A,1503068700,"[combinatorics, greedy, math, number theory, sortings]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Leha and another game about graph,1000.0,B,1503068700,"[constructive algorithms, data structures, dfs and similar, dp, graphs]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,On the Bench,1500.0,C,1503068700,"[combinatorics, dp]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Destiny,2000.0,D,1503068700,"[data structures, probabilities]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,In a Trap,2500.0,E,1503068700,[trees],PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Generous Kefa,500.0,A,1503068700,"[brute force, implementation]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Godsend,1000.0,B,1503068700,"[games, math]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Leha and Function,1500.0,C,1503068700,[greedy],PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Leha and another game about graph,2000.0,D,1503068700,"[dfs and similar, graphs]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,On the Bench,2500.0,E,1503068700,[],PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Arya and Bran,500.0,A,1502548500,[implementation],PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Game of the Rows,1000.0,B,1502548500,"[brute force, greedy, implementation]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Journey,1500.0,C,1502548500,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Winter is here,2000.0,D,1502548500,"[combinatorics, dp, math, number theory]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Mother of Dragons,2500.0,E,1502548500,"[brute force, graphs, math, meet-in-the-middle]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Binary Blocks,,A,1502085900,[brute force],PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Diverging Directions,,B,1502085900,"[data structures, dfs and similar, trees]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Future Failure,,C,1502085900,"[dp, games]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Airplane Arrangements,,D,1502085900,"[math, number theory]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Convex Countour,,E,1502085900,[dp],PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Expected Earnings,,F,1502085900,[],PROGRAMMING +837,Educational Codeforces Round 26,12,Text Volume,,A,1501773300,[implementation],PROGRAMMING +837,Educational Codeforces Round 26,12,Flag of Berland,,B,1501773300,"[brute force, implementation]",PROGRAMMING +837,Educational Codeforces Round 26,12,Two Seals,,C,1501773300,[brute force],PROGRAMMING +837,Educational Codeforces Round 26,12,Round Subset,,D,1501773300,[dp],PROGRAMMING +837,Educational Codeforces Round 26,12,Vasya's Function,,E,1501773300,"[binary search, implementation, math]",PROGRAMMING +837,Educational Codeforces Round 26,12,Prefix Sums,,F,1501773300,"[binary search, brute force, combinatorics, math, matrices]",PROGRAMMING +837,Educational Codeforces Round 26,12,Functions On The Segments,,G,1501773300,[data structures],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Key races,500.0,A,1501511700,[math],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,The number on the board,750.0,B,1501511700,[greedy],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Star sky,1250.0,C,1501511700,"[dp, implementation]",PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Palindromic characteristics,1500.0,D,1501511700,"[brute force, dp, hashing, strings]",PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,The penguin's game,2250.0,E,1501511700,[constructive algorithms],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Roads in the Kingdom,2250.0,F,1501511700,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,The Meaningless Game,500.0,A,1501425300,"[math, number theory]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,The Bakery,1250.0,B,1501425300,"[binary search, data structures, dp, two pointers]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Ever-Hungry Krakozyabra,1500.0,C,1501425300,"[brute force, greedy]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Red-Black Cobweb,2250.0,D,1501425300,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Caramel Clouds,2500.0,E,1501425300,"[data structures, dp, sortings]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Useless Toy,500.0,A,1501425300,[implementation],PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Festive Evening,1000.0,B,1501425300,"[data structures, implementation]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Meaningless Game,1500.0,C,1501425300,[math],PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Bakery,2250.0,D,1501425300,"[data structures, divide and conquer, dp]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,Ever-Hungry Krakozyabra,2500.0,E,1501425300,[],PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Sasha and Sticks,500.0,A,1500906900,"[games, math]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Petya and Exam,1000.0,B,1500906900,[implementation],PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Strange Radiation,1750.0,C,1500906900,"[binary search, implementation, math]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,"Misha, Grisha and Underground",2000.0,D,1500906900,"[dfs and similar, trees]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Vasya and Shifts,2500.0,E,1500906900,[matrices],PROGRAMMING +825,Educational Codeforces Round 25,12,Binary Protocol,,A,1500217500,[implementation],PROGRAMMING +825,Educational Codeforces Round 25,12,Five-In-a-Row,,B,1500217500,"[brute force, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Multi-judge Solving,,C,1500217500,"[greedy, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Suitable Replacement,,D,1500217500,"[greedy, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Minimal Labels,,E,1500217500,"[data structures, graphs, greedy]",PROGRAMMING +825,Educational Codeforces Round 25,12,String Compression,,F,1500217500,"[dp, hashing, string suffix structures, strings]",PROGRAMMING +825,Educational Codeforces Round 25,12,Tree Queries,,G,1500217500,"[dfs and similar, graphs, trees]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Office Keys,500.0,A,1499958300,"[binary search, brute force, dp, greedy, sortings]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Cards Sorting,1000.0,B,1499958300,"[data structures, implementation, sortings]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Bamboo Partition,1500.0,C,1499958300,"[brute force, math, number theory, sortings, two pointers]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Singer House,2250.0,D,1499958300,"[combinatorics, dp, trees]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Perpetual Motion Machine,2250.0,E,1499958300,"[constructive algorithms, implementation, math, trees]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Unimodal Array,500.0,A,1499958300,[implementation],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Keyboard Layouts,750.0,B,1499958300,"[implementation, strings]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Jury Marks,1000.0,C,1499958300,[brute force],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Office Keys,1500.0,D,1499958300,"[binary search, brute force, dp, greedy]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Cards Sorting,2000.0,E,1499958300,[data structures],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Bamboo Partition,2500.0,F,1499958300,[],PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,String Reconstruction,500.0,A,1499791500,"[data structures, greedy]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,High Load,750.0,B,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,DNA Evolution,1500.0,C,1499791500,[data structures],PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Best Edge Weight,1750.0,D,1499791500,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Rusty String,1750.0,E,1499791500,"[fft, math]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Dirty Arkady's Kitchen,2500.0,F,1499791500,"[dp, shortest paths]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Restaurant Tables,500.0,A,1499791500,[implementation],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Black Square,750.0,B,1499791500,[implementation],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,String Reconstruction,1250.0,C,1499791500,"[data structures, sortings]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,High Load,1750.0,D,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,DNA Evolution,2000.0,E,1499791500,[data structures],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Best Edge Weight,2750.0,F,1499791500,[data structures],PROGRAMMING +823,VK Cup 2017 - Finals,12,High Load,500.0,A,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,DNA Evolution,1000.0,B,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Bamboo Partition,1500.0,C,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Rusty String,2000.0,D,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Singer House,2750.0,E,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Perpetual Motion Machine,2750.0,F,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Dirty Arkady's Kitchen,3500.0,G,1499587500,[],PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,I'm bored with life,500.0,A,1499011500,"[implementation, math, number theory]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Crossword solving,750.0,B,1499011500,"[brute force, implementation, strings]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,"Hacker, pack your bags!",1250.0,C,1499011500,"[binary search, greedy, sortings]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,My pretty girl Noora,1750.0,D,1499011500,"[brute force, dp, greedy, math, number theory]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Liar,2250.0,E,1499011500,"[binary search, dp, hashing, string suffix structures]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Madness,2500.0,F,1499011500,"[dfs and similar, trees]",PROGRAMMING +818,Educational Codeforces Round 24,12,Diplomas and Certificates,,A,1498748700,"[implementation, math]",PROGRAMMING +818,Educational Codeforces Round 24,12,Permutation Game,,B,1498748700,[implementation],PROGRAMMING +818,Educational Codeforces Round 24,12,Sofa Thief,,C,1498748700,"[brute force, implementation]",PROGRAMMING +818,Educational Codeforces Round 24,12,Multicolored Cars,,D,1498748700,"[data structures, implementation]",PROGRAMMING +818,Educational Codeforces Round 24,12,Card Game Again,,E,1498748700,"[binary search, data structures, number theory, two pointers]",PROGRAMMING +818,Educational Codeforces Round 24,12,Level Generation,,F,1498748700,"[binary search, math, ternary search]",PROGRAMMING +818,Educational Codeforces Round 24,12,Four Melodies,,G,1498748700,[flows],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Boring Game,500.0,A,1498574100,[],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and PR Shifts,1000.0,B,1498574100,"[data structures, implementation]",PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Beacons on Field,1500.0,C,1498574100,[number theory],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Astronomers,2000.0,D,1498574100,[number theory],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Flight to the Moon,2500.0,E,1498574100,"[constructive algorithms, graphs]",PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Book Reading,500.0,A,1498574100,[implementation],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Angle in Polygon,1000.0,B,1498574100,"[constructive algorithms, geometry]",PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Boring Game,1500.0,C,1498574100,[],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and PR Shifts,2000.0,D,1498574100,[],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Beacons on Field,2500.0,E,1498574100,[],PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Future Gadget Laboratory,500.0,A,1498401300,[implementation],PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Banana Trees,1000.0,B,1498401300,"[brute force, math]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Boxes,1500.0,C,1498401300,"[data structures, trees]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and City,2000.0,D,1498401300,"[graphs, shortest paths]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and El Psy Kongroo,2500.0,E,1498401300,"[dp, matrices]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Game,500.0,A,1497710100,"[brute force, greedy, implementation]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Test,1250.0,B,1497710100,"[brute force, constructive algorithms, math]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Supermarket,1500.0,C,1497710100,"[brute force, dp, trees]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Cards,2250.0,D,1497710100,"[binary search, combinatorics, data structures, geometry]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Neighborhood,2250.0,E,1497710100,"[binary search, constructive algorithms]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Morning,500.0,A,1497710100,"[brute force, implementation]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Coffee,1000.0,B,1497710100,"[binary search, data structures]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Game,1500.0,C,1497710100,"[brute force, greedy]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Test,2000.0,D,1497710100,[combinatorics],PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Supermarket,2750.0,E,1497710100,"[dp, trees]",PROGRAMMING +817,Educational Codeforces Round 23,12,Treasure Hunt,,A,1497539100,"[implementation, number theory]",PROGRAMMING +817,Educational Codeforces Round 23,12,Makes And The Product,,B,1497539100,"[combinatorics, sortings]",PROGRAMMING +817,Educational Codeforces Round 23,12,Really Big Numbers,,C,1497539100,"[binary search, brute force, dp, math]",PROGRAMMING +817,Educational Codeforces Round 23,12,Imbalanced Array,,D,1497539100,"[data structures, divide and conquer, dsu, sortings]",PROGRAMMING +817,Educational Codeforces Round 23,12,Choosing The Commander,,E,1497539100,"[bitmasks, data structures, trees]",PROGRAMMING +817,Educational Codeforces Round 23,12,MEX Queries,,F,1497539100,"[binary search, data structures, trees]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An abandoned sentiment from past,500.0,A,1496837700,"[implementation, sortings]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An express train to reveries,1000.0,B,1496837700,[constructive algorithms],PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An impassioned circulation of affection,1750.0,C,1496837700,"[brute force, dp, strings, two pointers]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An overnight dance in discotheque,1750.0,D,1496837700,"[dfs and similar, dp, geometry, greedy, trees]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An unavoidable detour for home,2500.0,E,1496837700,"[combinatorics, dp]",PROGRAMMING +813,Educational Codeforces Round 22,12,The Contest,,A,1496675100,[implementation],PROGRAMMING +813,Educational Codeforces Round 22,12,The Golden Age,,B,1496675100,"[brute force, math]",PROGRAMMING +813,Educational Codeforces Round 22,12,The Tag Game,,C,1496675100,[dfs and similar],PROGRAMMING +813,Educational Codeforces Round 22,12,Two Melodies,,D,1496675100,"[dp, flows]",PROGRAMMING +813,Educational Codeforces Round 22,12,Army Creation,,E,1496675100,"[binary search, data structures]",PROGRAMMING +813,Educational Codeforces Round 22,12,Bipartite Checking,,F,1496675100,"[data structures, dsu, graphs]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Crossroads,500.0,A,1496326500,[implementation],PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,"Sagheer, the Hausmeister",1000.0,B,1496326500,"[bitmasks, brute force, dp]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Nubian Market,1500.0,C,1496326500,[binary search],PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Kindergarten,2000.0,D,1496326500,"[dfs and similar, graphs, implementation]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Apple Tree,2500.0,E,1496326500,[games],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (easy),,A,1495958700,[greedy],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (medium),,B,1495958700,"[data structures, greedy]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (hard),,C,1495958700,[flows],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (easy),,D,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (medium),,E,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (hard),,F,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (easy),,G,1495958700,[implementation],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (medium),,H,1495958700,[constructive algorithms],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (hard),,I,1495958700,[string suffix structures],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (easy),,J,1495958700,"[dfs and similar, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (medium),,K,1495958700,"[dp, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (hard),,L,1495958700,"[dfs and similar, dp, math, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (easy),,M,1495958700,"[greedy, sortings]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (medium),,N,1495958700,"[binary search, flows]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (hard),,O,1495958700,"[binary search, flows]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Courtesy,500.0,A,1495877700,"[brute force, implementation]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Complicated Book,1000.0,B,1495877700,"[implementation, sortings]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Memorable Trip,1500.0,C,1495877700,"[dp, implementation]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Favorite Game,2000.0,D,1495877700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Entertaining Flags,2500.0,E,1495877700,"[data structures, dsu, graphs]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Do you want a date?,500.0,A,1495303500,"[math, sortings]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Glad to see you!,1000.0,B,1495303500,[binary search],PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Find a car,1500.0,C,1495303500,"[combinatorics, divide and conquer, dp]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Hitchhiking in the Baltic States,2000.0,D,1495303500,"[data structures, dp]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Surprise me!,2500.0,E,1495303500,"[divide and conquer, math, trees]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Straight <>,500.0,A,1495303500,"[implementation, math]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Summer sell-off,1000.0,B,1495303500,"[greedy, sortings]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Do you want a date?,1500.0,C,1495303500,"[math, sortings]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Glad to see you!,2000.0,D,1495303500,[binary search],PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Find a car,2500.0,E,1495303500,"[divide and conquer, dp]",PROGRAMMING +808,Educational Codeforces Round 21,12,Lucky Year,,A,1494860700,[implementation],PROGRAMMING +808,Educational Codeforces Round 21,12,Average Sleep Time,,B,1494860700,"[data structures, math]",PROGRAMMING +808,Educational Codeforces Round 21,12,Tea Party,,C,1494860700,"[constructive algorithms, greedy]",PROGRAMMING +808,Educational Codeforces Round 21,12,Array Division,,D,1494860700,"[binary search, data structures, implementation]",PROGRAMMING +808,Educational Codeforces Round 21,12,Selling Souvenirs,,E,1494860700,"[dp, greedy, ternary search]",PROGRAMMING +808,Educational Codeforces Round 21,12,Card Game,,F,1494860700,"[binary search, flows, graphs]",PROGRAMMING +808,Educational Codeforces Round 21,12,Anthem of Berland,,G,1494860700,"[dp, strings]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Bank Robbery,500.0,A,1494668100,[implementation],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Cutting Carrot,1000.0,B,1494668100,"[geometry, math]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Naming Company,1750.0,C,1494668100,"[games, greedy, sortings]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Labelling Cities,2000.0,D,1494668100,"[dfs and similar, graphs, hashing]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Choosing Carrot,2500.0,E,1494668100,[games],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Leha and security system,2750.0,F,1494668100,[data structures],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Replace All,3500.0,G,1494668100,"[combinatorics, dp, math]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Carrot Cakes,500.0,A,1494516900,"[brute force, implementation]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,T-shirt buying,1000.0,B,1494516900,"[data structures, implementation]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Fountains,1500.0,C,1494516900,"[binary search, data structures]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Field expansion,2000.0,D,1494516900,"[brute force, dp, meet-in-the-middle]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Aquarium decoration,2500.0,E,1494516900,"[data structures, greedy, two pointers]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Beautiful fountains rows,3250.0,F,1494516900,[data structures],PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Cut the pie,3500.0,G,1494516900,"[binary search, data structures, geometry]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Prairie Partition,1750.0,C,1494171900,"[binary search, constructive algorithms, greedy, math]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Perishable Roads,2500.0,D,1494171900,"[dp, graphs, shortest paths]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Blog Post Rating,2750.0,E,1494171900,"[data structures, sortings]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Test Data Generation,3500.0,F,1494171900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Prairie Partition,1750.0,C,1494171900,"[binary search, greedy]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Perishable Roads,2500.0,D,1494171900,[graphs],PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Blog Post Rating,2750.0,E,1494171900,[data structures],PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Test Data Generation,3500.0,F,1494171900,[],PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Is it rated?,500.0,A,1494171900,"[implementation, sortings]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,T-Shirt Hunt,1000.0,B,1494171900,"[brute force, implementation]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Success Rate,1500.0,C,1494171900,"[binary search, math]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Dynamic Problem Scoring,2000.0,D,1494171900,"[brute force, greedy]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Prairie Partition,2750.0,E,1494171900,"[binary search, greedy]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Perishable Roads,3500.0,F,1494171900,[],PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Find Amir,500.0,A,1493909400,"[greedy, math]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Minimum number of steps,1000.0,B,1493909400,"[greedy, implementation, math]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Ice cream coloring,1500.0,C,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Expected diameter of a tree,2000.0,D,1493909400,"[binary search, brute force, dfs and similar, dp, sortings, trees]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,The same permutation ,2500.0,E,1493909400,[constructive algorithms],PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Fake bullions,3000.0,F,1493909400,"[dfs and similar, dp, graphs]",PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Fake NP,500.0,A,1493909400,[math],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,3-palindrome,1000.0,B,1493909400,[constructive algorithms],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Find Amir,1500.0,C,1493909400,[constructive algorithms],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Minimum number of steps,2000.0,D,1493909400,[],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Ice cream coloring,2500.0,E,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Expected diameter of a tree,3000.0,F,1493909400,"[graphs, probabilities]",PROGRAMMING +803,Educational Codeforces Round 20,12,Maximal Binary Matrix,,A,1493391900,[constructive algorithms],PROGRAMMING +803,Educational Codeforces Round 20,12,Distances to Zero,,B,1493391900,[constructive algorithms],PROGRAMMING +803,Educational Codeforces Round 20,12,Maximal GCD,,C,1493391900,"[greedy, math]",PROGRAMMING +803,Educational Codeforces Round 20,12,Magazine Ad,,D,1493391900,"[binary search, greedy]",PROGRAMMING +803,Educational Codeforces Round 20,12,Roma and Poker,,E,1493391900,[dp],PROGRAMMING +803,Educational Codeforces Round 20,12,Coprime Subsequences,,F,1493391900,"[bitmasks, combinatorics, number theory]",PROGRAMMING +803,Educational Codeforces Round 20,12,Periodic RMQ Problem,,G,1493391900,[data structures],PROGRAMMING +775,VK Cup 2017 - Wild Card Round 2,12,University Schedule,,A,1493220900,[*special],PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Oleg and shares,500.0,A,1492965900,"[implementation, math]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Igor and his way to work,1000.0,B,1492965900,"[dfs and similar, shortest paths]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Mice problem,1500.0,C,1492965900,"[geometry, implementation, sortings]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Presents in Bankopolis,2000.0,D,1492965900,"[dp, graphs, shortest paths]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Problem of offices,2500.0,E,1492965900,"[constructive algorithms, dfs and similar, dp, trees]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Julia the snail,3000.0,F,1492965900,"[data structures, divide and conquer]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Oleg and chess,3500.0,G,1492965900,"[flows, graph matchings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and palindrome,500.0,A,1492785300,"[brute force, constructive algorithms, strings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and strings,1000.0,B,1492785300,"[brute force, dp, strings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and gcd problem,1500.0,C,1492785300,"[dp, greedy, number theory]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and distribution,2000.0,D,1492785300,"[constructive algorithms, sortings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and code of a permutation,2500.0,E,1492785300,"[constructive algorithms, data structures, graphs, sortings]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Voltage Keepsake,500.0,A,1492356900,"[binary search, math]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING +772,VK Cup 2017 - Round 2,12,Vulnerable Kerbals,1750.0,C,1492356900,"[dp, graphs, number theory]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Varying Kibibits,2250.0,D,1492356900,"[bitmasks, dp]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Verifying Kingdom,2250.0,E,1492356900,"[binary search, trees]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Voltage Keepsake,500.0,A,1492356900,"[binary search, greedy]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Vulnerable Kerbals,1750.0,C,1492356900,[number theory],PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Varying Kibibits,2250.0,D,1492356900,"[combinatorics, dp]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Verifying Kingdom,2250.0,E,1492356900,[],PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vicious Keyboard,500.0,A,1492356900,[brute force],PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Valued Keys,1000.0,B,1492356900,"[constructive algorithms, greedy, strings]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Voltage Keepsake,1500.0,C,1492356900,"[binary search, math]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Volatile Kite,2000.0,D,1492356900,"[brute force, geometry, greedy]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vulnerable Kerbals,2750.0,E,1492356900,[],PROGRAMMING +797,Educational Codeforces Round 19,12,k-Factorization,,A,1492266900,"[implementation, math, number theory]",PROGRAMMING +797,Educational Codeforces Round 19,12,Odd sum,,B,1492266900,"[dp, greedy]",PROGRAMMING +797,Educational Codeforces Round 19,12,Minimal string,,C,1492266900,"[greedy, strings]",PROGRAMMING +797,Educational Codeforces Round 19,12,Broken BST,,D,1492266900,"[data structures, dfs and similar]",PROGRAMMING +797,Educational Codeforces Round 19,12,Array Queries,,E,1492266900,"[brute force, data structures, dp]",PROGRAMMING +797,Educational Codeforces Round 19,12,Mice and Holes,,F,1492266900,"[data structures, dp, greedy, sortings]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Buying A House,500.0,A,1491842100,"[brute force, implementation]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Find The Bone,750.0,B,1491842100,[implementation],PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Bank Hacking,1000.0,C,1491842100,"[constructive algorithms, data structures, dp, trees]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Police Stations,1500.0,D,1491842100,"[constructive algorithms, shortest paths, trees]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Exam Cheating,2000.0,E,1491842100,"[binary search, dp]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Sequence Recovery,2500.0,F,1491842100,"[bitmasks, data structures, greedy]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Amusement Park,,A,1491406500,"[*special, ternary search]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Significant Cups,,B,1491406500,"[*special, binary search, data structures, two pointers]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Lie or Truth,,D,1491406500,"[*special, constructive algorithms, sortings]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Big Number and Remainder,,E,1491406500,"[*special, math, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Pens And Days Of Week,,F,1491406500,"[*special, binary search, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Amusement Park,,A,1491406500,"[*special, brute force, ternary search]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Significant Cups,,B,1491406500,"[*special, binary search, sortings, two pointers]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Lie or Truth,,D,1491406500,"[*special, implementation, sortings]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Big Number and Remainder,,E,1491406500,"[*special, brute force, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Pens And Days Of Week,,F,1491406500,"[*special, brute force, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING +784,April Fools Contest 2017,12,Numbers Joke,,A,1490972400,[*special],PROGRAMMING +784,April Fools Contest 2017,12,Kids' Riddle,,B,1490972400,[*special],PROGRAMMING +784,April Fools Contest 2017,12,INTERCALC,,C,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Touchy-Feely Palindromes,,D,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Twisted Circuit,,E,1490972400,"[*special, brute force, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Crunching Numbers Just for You,,F,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,BF Calculator,,G,1490972400,[*special],PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Functions again,500.0,A,1490803500,"[dp, two pointers]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Weird journey,1250.0,B,1490803500,"[combinatorics, dfs and similar, dsu, graphs]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,The Great Mixing,1500.0,C,1490803500,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Finding lines,2000.0,D,1490803500,"[constructive algorithms, divide and conquer]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,New task,2250.0,E,1490803500,[data structures],PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Anastasia and pebbles,500.0,A,1490803500,"[implementation, math]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Masha and geometric depression,1000.0,B,1490803500,"[brute force, implementation, math]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Functions again,1500.0,C,1490803500,"[data structures, dp]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Weird journey,2250.0,D,1490803500,[graphs],PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,The Great Mixing,2500.0,E,1490803500,"[brute force, dfs and similar, dp, graph matchings, math]",PROGRAMMING +792,Educational Codeforces Round 18,12,New Bus Route,,A,1490625300,"[implementation, sortings]",PROGRAMMING +792,Educational Codeforces Round 18,12,Counting-out Rhyme,,B,1490625300,[implementation],PROGRAMMING +792,Educational Codeforces Round 18,12,Divide by Three,,C,1490625300,"[dp, greedy, math, number theory]",PROGRAMMING +792,Educational Codeforces Round 18,12,Paths in a Complete Binary Tree,,D,1490625300,"[bitmasks, trees]",PROGRAMMING +792,Educational Codeforces Round 18,12,Colored Balls,,E,1490625300,"[greedy, math]",PROGRAMMING +792,Educational Codeforces Round 18,12,Mages and Monsters,,F,1490625300,"[data structures, geometry]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Berzerk,750.0,A,1490281500,"[dfs and similar, dp, games]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Legacy,1000.0,B,1490281500,"[data structures, graphs, shortest paths]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Till I Collapse,1500.0,C,1490281500,"[data structures, divide and conquer]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Rap God,2000.0,D,1490281500,"[data structures, dfs and similar, hashing, strings, trees]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,ALT,2500.0,E,1490281500,"[data structures, flows, graphs, trees]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,The Monster,500.0,A,1490281500,"[brute force, math]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Not Afraid,1000.0,B,1490281500,"[greedy, implementation]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Berzerk,1750.0,C,1490281500,"[dp, games]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Legacy,2000.0,D,1490281500,"[data structures, shortest paths]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Till I Collapse,2500.0,E,1490281500,"[data structures, trees]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Friendship Condition,250.0,A,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Different Names,500.0,B,1489851300,"[constructive algorithms, greedy]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Tree Jumps,1000.0,C,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Company,1500.0,D,1489851300,[dp],PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Rectangle Strips,2250.0,E,1489851300,"[dp, greedy]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Isomorphic Points,2500.0,F,1489851300,"[geometry, two pointers]",PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Different Names,500.0,A,1489851300,"[constructive algorithms, greedy]",PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Tree Jumps,1000.0,B,1489851300,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Company,1500.0,C,1489851300,[dp],PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Rectangle Strips,2250.0,D,1489851300,[dp],PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Isomorphic Points,2500.0,E,1489851300,[],PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Big Brother,500.0,A,1489851300,[implementation],PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Friendship Condition,1000.0,B,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Different Names,1500.0,C,1489851300,"[constructive algorithms, greedy]",PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Tree Jumps,2000.0,D,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Company,2500.0,E,1489851300,[],PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Polyhedrons,500.0,A,1489590300,[implementation],PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Classes,1000.0,B,1489590300,"[greedy, sortings]",PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Fairy Tale,1500.0,C,1489590300,"[binary search, math]",PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and School - 2,2250.0,D,1489590300,"[combinatorics, math, number theory]",PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Permutation,2500.0,E,1489590300,"[brute force, data structures]",PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,New Password,500.0,A,1489233600,[implementation],PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,Maximize Sum of Digits,1000.0,B,1489233600,[implementation],PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,Online Courses In BSU,1500.0,C,1489233600,"[dfs and similar, graphs]",PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,Draw Brackets!,1500.0,D,1489233600,[implementation],PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Colored Balloons,500.0,A,1488719100,"[brute force, constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Innokenty and a Football League,1000.0,B,1488719100,"[2-sat, brute force, graph matchings, greedy, implementation]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Underground Lab,1250.0,C,1488719100,"[brute force, constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Axel and Marston in Bitland,1750.0,D,1488719100,"[bitmasks, brute force, dp, matrices]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Nervous Barriers,2250.0,E,1488719100,[data structures],PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Intranet of Buses,2750.0,F,1488719100,"[binary search, geometry, two pointers]",PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Socks,500.0,A,1488719100,[implementation],PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,The Meeting Place Cannot Be Changed,1000.0,B,1488719100,"[binary search, ternary search]",PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Colored Balloons,1250.0,C,1488719100,[dfs and similar],PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Innokenty and a Football League,1500.0,D,1488719100,[greedy],PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Underground Lab,1750.0,E,1488719100,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Axel and Marston in Bitland,2500.0,F,1488719100,[matrices],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Socks,500.0,A,1488705300,[implementation],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,The Meeting Place Cannot Be Changed,1000.0,B,1488705300,[binary search],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Colored Balloons,1250.0,C,1488705300,[dfs and similar],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Innokenty and a Football League,1500.0,D,1488705300,"[2-sat, graphs, greedy, implementation]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Underground Lab,1750.0,E,1488705300,"[dfs and similar, graphs]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Axel and Marston in Bitland,2500.0,F,1488705300,"[bitmasks, graphs, matrices]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Nervous Barriers,3000.0,G,1488705300,"[data structures, dp]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Intranet of Buses,3500.0,H,1488705300,"[binary search, geometry, implementation, two pointers]",PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,Year of University Entrance,500.0,A,1488628800,[sortings],PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,News About Credit,1000.0,B,1488628800,"[greedy, two pointers]",PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,Cycle In Maze,1500.0,C,1488628800,"[dfs and similar, greedy, shortest paths]",PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,k-Interesting Pairs Of Integers,2000.0,D,1488628800,"[bitmasks, brute force]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,String Game,500.0,A,1488096300,"[binary search, greedy, strings]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Bitwise Formula,1000.0,B,1488096300,"[bitmasks, brute force, dfs and similar, expression parsing, implementation]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Peterson Polyglot,1500.0,C,1488096300,"[brute force, dfs and similar, dsu, hashing, trees]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Parquet Re-laying,2250.0,D,1488096300,[constructive algorithms],PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Selling Numbers,2250.0,E,1488096300,"[dp, sortings]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Pupils Redistribution,500.0,A,1488096300,"[constructive algorithms, math]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Weird Rounding,1000.0,B,1488096300,"[brute force, greedy]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Dishonest Sellers,1000.0,C,1488096300,"[greedy, sortings]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,String Game,1500.0,D,1488096300,"[binary search, strings]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Bitwise Formula,2000.0,E,1488096300,"[data structures, expression parsing, greedy]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Peterson Polyglot,2500.0,F,1488096300,[],PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Shell Game,500.0,A,1487930700,"[constructive algorithms, implementation]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Game of Credit Cards,1000.0,B,1487930700,"[data structures, dp, greedy, sortings]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Alyona and Spreadsheet,1500.0,C,1487930700,"[binary search, dp, implementation, two pointers]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Cloud of Hashtags,2000.0,D,1487930700,"[binary search, greedy, implementation, strings]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Hanoi Factory,2500.0,E,1487930700,"[brute force, data structures, dp, greedy, sortings]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,A Serial Killer,500.0,A,1487861100,[implementation],PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and his girlfriend,1000.0,B,1487861100,[number theory],PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Molly's Chemicals,1500.0,C,1487861100,"[binary search, data structures, math]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Door Problem,2000.0,D,1487861100,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Holmes Children,2250.0,E,1487861100,"[math, number theory]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock's bet to Moriarty,3000.0,F,1487861100,"[constructive algorithms, geometry, graphs, trees]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and the Encrypted Data,3250.0,G,1487861100,"[bitmasks, combinatorics, dp]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Oath of the Night's Watch,500.0,A,1487606700,"[constructive algorithms, sortings]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Code For 1,1000.0,B,1487606700,"[constructive algorithms, dfs and similar, divide and conquer]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon Snow and his Favourite Number,1250.0,C,1487606700,"[brute force, dp, implementation, sortings]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon and Orbs,1750.0,D,1487606700,"[dp, math, probabilities]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Game of Stones,2000.0,E,1487606700,"[dp, games]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Barrels and boxes,2250.0,F,1487606700,"[brute force, combinatorics, number theory, probabilities]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,The Winds of Winter,2750.0,G,1487606700,[data structures],PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Snacktower,500.0,A,1487408700,"[data structures, implementation]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,The Queue,1250.0,B,1487408700,"[brute force, greedy]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Garland,1500.0,C,1487408700,"[dfs and similar, graphs, greedy, trees]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Cartons of milk,2000.0,D,1487408700,"[binary search, data structures, greedy, sortings, two pointers]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Change-free,2500.0,E,1487408700,[greedy],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Neverending competitions,500.0,A,1487059500,[implementation],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Code obfuscation,1000.0,B,1487059500,"[implementation, strings]",PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Table Tennis Game 2,1250.0,C,1487059500,[math],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Artsem and Saunders,2000.0,D,1487059500,"[constructive algorithms, dsu, math]",PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Tree Folding,2500.0,E,1487059500,"[dfs and similar, dp, implementation, trees]",PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Souvenirs,3250.0,F,1487059500,[data structures],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,"Math, math everywhere",3500.0,G,1487059500,[],PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and Longest Uncommon Subsequence,500.0,A,1486487100,"[constructive algorithms, strings]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Triangle,1000.0,B,1486487100,"[constructive algorithms, geometry, greedy, sortings]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Message,1500.0,C,1486487100,"[brute force, dp, strings]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Dictionary,2000.0,D,1486487100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a xor trip,2500.0,E,1486487100,"[bitmasks, constructive algorithms, data structures, dfs and similar, dp, trees]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and a tree,500.0,A,1486042500,"[dfs and similar, dp, dsu, trees]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and rectangles,750.0,B,1486042500,[constructive algorithms],PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and remoduling,1500.0,C,1486042500,"[brute force, number theory]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and a flat tree,2000.0,D,1486042500,"[data structures, hashing, trees]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and our friends animals,2500.0,E,1486042500,[dsu],PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Taymyr is calling you,500.0,A,1486042500,"[brute force, implementation, math]",PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and cubes,1000.0,B,1486042500,"[constructive algorithms, implementation]",PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and a tree,1500.0,C,1486042500,[dfs and similar],PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and rectangles,1750.0,D,1486042500,[],PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and remoduling,2500.0,E,1486042500,[],PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Stairs,500.0,A,1485873300,"[brute force, constructive algorithms, math]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and friends,1000.0,B,1485873300,"[brute force, implementation, math]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Password,1500.0,C,1485873300,"[brute force, dp, implementation]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Very Difficult Problem,2000.0,D,1485873300,"[binary search, brute force, constructive algorithms, greedy, sortings]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Puzzle,2500.0,E,1485873300,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Photos,3000.0,F,1485873300,"[brute force, data structures]",PROGRAMMING +762,Educational Codeforces Round 17,12,k-th divisor,,A,1485354900,"[math, number theory]",PROGRAMMING +762,Educational Codeforces Round 17,12,USB vs. PS/2,,B,1485354900,"[greedy, sortings, two pointers]",PROGRAMMING +762,Educational Codeforces Round 17,12,Two strings,,C,1485354900,"[binary search, hashing, two pointers]",PROGRAMMING +762,Educational Codeforces Round 17,12,Maximum path,,D,1485354900,"[dp, implementation]",PROGRAMMING +762,Educational Codeforces Round 17,12,Radio stations,,E,1485354900,"[binary search, data structures]",PROGRAMMING +762,Educational Codeforces Round 17,12,Tree nesting,,F,1485354900,"[combinatorics, graphs, trees]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Pavel and barbecue,500.0,A,1485108900,[dfs and similar],PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Travel Card,1000.0,B,1485108900,"[binary search, dp]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Nikita and stack,1500.0,C,1485108900,[data structures],PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Bacterial Melee,2000.0,D,1485108900,"[brute force, combinatorics, dp, string suffix structures]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Byteland coins,2500.0,E,1485108900,"[combinatorics, dp, math]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Long number,3000.0,F,1485108900,"[expression parsing, math, number theory]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Pavel and barbecue,500.0,A,1485108900,"[dfs and similar, dsu]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Travel Card,1000.0,B,1485108900,"[binary search, dp, greedy, two pointers]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Nikita and stack,1500.0,C,1485108900,"[binary search, data structures]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Bacterial Melee,2000.0,D,1485108900,[dp],PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Byteland coins,2500.0,E,1485108900,"[dp, math]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Long number,3000.0,F,1485108900,[],PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Petr and a calendar,500.0,A,1485108900,"[implementation, math]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Frodo and pillows,1000.0,B,1485108900,"[binary search, greedy]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Pavel and barbecue,1500.0,C,1485108900,"[dfs and similar, graphs]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Travel Card,2000.0,D,1485108900,"[binary search, dp, two pointers]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Nikita and stack,2500.0,E,1485108900,[],PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Bacterial Melee,3000.0,F,1485108900,[],PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Holiday Of Equality,500.0,A,1484838300,"[implementation, math]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Blown Garland,1000.0,B,1484838300,[implementation],PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Unfair Poll,1500.0,C,1484838300,"[binary search, implementation, math]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Ability To Convert,1750.0,D,1484838300,"[dp, greedy, strings]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Broken Tree,2500.0,E,1484838300,"[dfs and similar, greedy, trees]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Geometrical Progression,3000.0,F,1484838300,"[brute force, math, number theory]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Hypothesis,500.0,A,1484499900,"[brute force, graphs, math]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Game,1000.0,B,1484499900,"[binary search, data structures, games, greedy, sortings]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Forest,1500.0,C,1484499900,"[dfs and similar, dsu, graphs]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Polygon,2250.0,D,1484499900,[data structures],PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and White-Red graph,2500.0,E,1484499900,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Gifts,2750.0,F,1484499900,"[bitmasks, dp, greedy]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Many Other Balls,3500.0,G,1484499900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Gotta Catch Em' All!,500.0,A,1484235300,[implementation],PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash's Big Day,1000.0,B,1484235300,"[greedy, math, number theory]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity is Coming!,1500.0,C,1484235300,"[data structures, hashing, sortings, strings]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity's Big Secret Revealed,2000.0,D,1484235300,"[bitmasks, dp]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash Plays with Functions,2500.0,E,1484235300,"[brute force, combinatorics, dp, number theory]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Team Rocket Rises Again,2750.0,F,1484235300,"[data structures, graphs, shortest paths]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Can Bash Save the Day?,3500.0,G,1484235300,"[data structures, divide and conquer, graphs, trees]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Lesha and array splitting,500.0,A,1483713300,"[constructive algorithms, greedy]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Ilya and tic-tac-toe game,1000.0,B,1483713300,"[brute force, implementation]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Vladik and chat,1500.0,C,1483713300,"[brute force, constructive algorithms, dp, implementation, strings]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Fedor and coupons,2000.0,D,1483713300,"[binary search, data structures, greedy, sortings]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Dasha and cyclic table,2500.0,E,1483713300,"[bitmasks, brute force, fft]",PROGRAMMING +750,Good Bye 2016,12,New Year and Hurry,500.0,A,1483107300,"[binary search, brute force, implementation, math]",PROGRAMMING +750,Good Bye 2016,12,New Year and North Pole,750.0,B,1483107300,[implementation],PROGRAMMING +750,Good Bye 2016,12,New Year and Rating,1000.0,C,1483107300,"[binary search, greedy, math]",PROGRAMMING +750,Good Bye 2016,12,New Year and Fireworks,1500.0,D,1483107300,"[brute force, data structures, dfs and similar, dp, implementation]",PROGRAMMING +750,Good Bye 2016,12,New Year and Old Subsequence,2250.0,E,1483107300,"[data structures, divide and conquer, dp]",PROGRAMMING +750,Good Bye 2016,12,New Year and Finding Roots,3000.0,F,1483107300,"[constructive algorithms, implementation, trees]",PROGRAMMING +750,Good Bye 2016,12,New Year and Binary Tree Paths,3250.0,G,1483107300,"[bitmasks, brute force, combinatorics, dp]",PROGRAMMING +750,Good Bye 2016,12,New Year and Snowy Grid,3500.0,H,1483107300,"[dfs and similar, dsu, graphs]",PROGRAMMING +753,Testing Round #13,12,Santa Claus and Candies,500.0,A,1483002300,"[dp, greedy, math]",PROGRAMMING +753,Testing Round #13,12,Interactive Bulls and Cows (Easy),1000.0,B,1483002300,"[brute force, constructive algorithms, implementation]",PROGRAMMING +753,Testing Round #13,12,Interactive Bulls and Cows (Hard),1500.0,C,1483002300,"[brute force, constructive algorithms]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Place in a Class,500.0,A,1482656700,"[implementation, math]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Keyboard Check,1000.0,B,1482656700,"[implementation, strings]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Robot,1500.0,C,1482656700,"[constructive algorithms, math]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Palindrome,2000.0,D,1482656700,"[constructive algorithms, data structures, greedy]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Tangerines,2500.0,E,1482656700,"[binary search, greedy, two pointers]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Clauses and a Soccer Championship,2500.0,F,1482656700,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Place in a Class,500.0,A,1482656700,"[constructive algorithms, math]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Keyboard Check,1000.0,B,1482656700,"[greedy, implementation, strings]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Robot,1500.0,C,1482656700,"[greedy, shortest paths]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Palindrome,2000.0,D,1482656700,"[data structures, greedy, hashing, strings]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Tangerines,2500.0,E,1482656700,"[binary search, dp, two pointers]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Clauses and a Soccer Championship,2500.0,F,1482656700,[trees],PROGRAMMING +751,Технокубок 2017 - Ознакомительный Раунд 3,12,Оценки Васи,500.0,A,1482395400,[],PROGRAMMING +751,Технокубок 2017 - Ознакомительный Раунд 3,12,Путь Поликарпа,1000.0,B,1482395400,[],PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Bachgold Problem,500.0,A,1482165300,"[greedy, implementation, math, number theory]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Parallelogram is Back,1000.0,B,1482165300,"[brute force, constructive algorithms, geometry]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Voting,1500.0,C,1482165300,"[greedy, implementation, two pointers]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Leaving Auction,2000.0,D,1482165300,"[binary search, data structures]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Inversions After Shuffle,2500.0,E,1482165300,"[data structures, probabilities]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Display Size,500.0,A,1482113100,"[brute force, math]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Mammoth's Genome Decoding,1000.0,B,1482113100,"[implementation, strings]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Servers,1500.0,C,1482113100,[implementation],PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Winter Is Coming,2000.0,D,1482113100,"[greedy, sortings]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Comments,2000.0,E,1482113100,"[dfs and similar, expression parsing]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Igor and Interesting Numbers,2500.0,F,1482113100,"[brute force, combinatorics, dp]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Compote,500.0,A,1482057300,[math],PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Decoding,1000.0,B,1482057300,"[implementation, strings]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Tram,1500.0,C,1482057300,"[constructive algorithms, implementation, math]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Green and Black Tea,2000.0,D,1482057300,"[constructive algorithms, greedy]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Numbers Exchange,2500.0,E,1482057300,"[greedy, implementation]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Music in Car,3000.0,F,1482057300,"[data structures, greedy, two pointers]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,New Roads,3000.0,G,1482057300,"[constructive algorithms, trees]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Builds A Nation,500.0,A,1481992500,"[dfs and similar, graphs]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow's Game,1250.0,B,1481992500,"[bitmasks, divide and conquer]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Buys a Deck of Cards,1750.0,C,1481992500,"[bitmasks, brute force, dp]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Draws a Circle,2250.0,D,1481992500,[geometry],PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Masters the Cyclic Shift,2500.0,E,1481992500,[strings],PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Learns the Cyclic Shift,500.0,A,1481992500,"[implementation, strings]",PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Solves A Puzzle,1000.0,B,1481992500,[implementation],PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Builds A Nation,1500.0,C,1481992500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow's Game,2250.0,D,1481992500,[bitmasks],PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Buys a Deck of Cards,2750.0,E,1481992500,[],PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Vladik and flights,500.0,A,1481726100,"[constructive algorithms, greedy, implementation]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Chloe and the sequence ,1000.0,B,1481726100,"[binary search, bitmasks, constructive algorithms, implementation]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Vladik and fractions,1250.0,C,1481726100,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Chloe and pleasant prizes,2000.0,D,1481726100,"[dfs and similar, dp, trees]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Vladik and cards,2500.0,E,1481726100,"[binary search, bitmasks, brute force, dp]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa's loud Owf and Mehrdad's evil plan,500.0,A,1481034900,"[dfs and similar, math]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa's weak amphitheater and Mehrdad's valuable Hoses,1000.0,B,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa’s overnight party and Mehrdad’s silent entering,1250.0,C,1481034900,"[constructive algorithms, dfs and similar]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths,2000.0,D,1481034900,"[data structures, trees]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa’s abnormal DNA and Mehrdad’s deep interest,2500.0,E,1481034900,"[data structures, string suffix structures]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa’s hard exam and Mehrdad’s naive cheat,500.0,A,1481034900,"[implementation, math, number theory]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa’s obvious problem and Mehrdad’s terrible solution,1000.0,B,1481034900,"[math, number theory]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa's loud Owf and Mehrdad's evil plan,1500.0,C,1481034900,"[dfs and similar, math]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa's weak amphitheater and Mehrdad's valuable Hoses,2000.0,D,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa’s overnight party and Mehrdad’s silent entering,2250.0,E,1481034900,[],PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Ostap and Grasshopper,500.0,A,1480264500,"[implementation, strings]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Urbanization,1000.0,B,1480264500,"[greedy, sortings]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Tennis Championship,1750.0,C,1480264500,"[greedy, math]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Taxes,1750.0,D,1480264500,"[math, number theory]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Ostap and Tree,2500.0,E,1480264500,"[dp, trees]",PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Tennis Championship,750.0,A,1480264500,"[dfs and similar, dp, math]",PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Taxes,750.0,B,1480264500,"[math, number theory]",PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Ostap and Tree,1500.0,C,1480264500,[dp],PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Permutations,2000.0,D,1480264500,[matrices],PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Chess Championship,2500.0,E,1480264500,"[constructive algorithms, flows, greedy]",PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Alyona and mex,500.0,A,1479918900,"[constructive algorithms, greedy]",PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Alyona and a tree,1000.0,B,1479918900,"[binary search, data structures, dfs and similar, graphs, trees]",PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Alyona and towers,1500.0,C,1479918900,[data structures],PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Recover a functional graph,2000.0,D,1479918900,[graph matchings],PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Gosha is hunting,2500.0,E,1479918900,"[brute force, dp, flows, sortings]",PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and copybooks,500.0,A,1479918900,"[brute force, implementation]",PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and flowers,1000.0,B,1479918900,[constructive algorithms],PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and mex,1500.0,C,1479918900,[constructive algorithms],PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and a tree,2000.0,D,1479918900,"[binary search, data structures, dfs and similar, graph matchings, graphs]",PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and towers,2500.0,E,1479918900,[],PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Interview with Oleg,500.0,A,1479632700,"[implementation, strings]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Spotlights,1000.0,B,1479632700,"[dp, implementation]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Road to Cinema,1750.0,C,1479632700,"[binary search, greedy, sortings]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Sea Battle,1750.0,D,1479632700,"[constructive algorithms, greedy]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Subordinates,2000.0,E,1479632700,"[constructive algorithms, data structures, greedy, sortings]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Financiers Game,2500.0,F,1479632700,[dp],PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Road to Cinema,750.0,A,1479632700,[binary search],PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Sea Battle,750.0,B,1479632700,"[greedy, implementation]",PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Subordinates,1000.0,C,1479632700,[greedy],PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Financiers Game,1500.0,D,1479632700,"[dp, games]",PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Tanya is 5!,2000.0,E,1479632700,"[graph matchings, graphs, greedy, schedules]",PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Dirty plates,2500.0,F,1479632700,"[constructive algorithms, math]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Interview with Oleg,500.0,A,1479632700,"[implementation, strings]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Spotlights,1000.0,B,1479632700,"[brute force, dp, implementation]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Road to Cinema,1750.0,C,1479632700,[binary search],PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Sea Battle,1750.0,D,1479632700,"[binary search, constructive algorithms, greedy]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Subordinates,2000.0,E,1479632700,"[constructive algorithms, greedy]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Financiers Game,2500.0,F,1479632700,"[dp, games]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Danik,500.0,A,1479227700,"[implementation, strings]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Digits,750.0,B,1479227700,"[implementation, math]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Making Potions,1250.0,C,1479227700,"[binary search, dp, greedy, two pointers]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Chess,1500.0,D,1479227700,[implementation],PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Tree,2000.0,E,1479227700,"[dfs and similar, dp, trees]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and School,2750.0,F,1479227700,"[bitmasks, constructive algorithms, implementation, math]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Grasshopper And the String,500.0,A,1477922700,[implementation],PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Parade,1000.0,B,1477922700,[math],PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Epidemic in Monstropolis,2000.0,C,1477922700,"[constructive algorithms, dp, greedy, two pointers]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Kostya the Sculptor,2000.0,D,1477922700,"[data structures, hashing]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Sleep in Class,2750.0,E,1477922700,"[data structures, math, two pointers]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Drivers Dissatisfaction,3000.0,F,1477922700,"[data structures, dsu, graphs, trees]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Toda 2,,A,1477209600,[greedy],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Minimum and Maximum,,B,1477209600,[constructive algorithms],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bulmart,,C,1477209600,"[binary search, dfs and similar]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Running Over The Bridges,,D,1477209600,"[greedy, implementation]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Award Ceremony,,E,1477209600,[greedy],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Ber Patio,,F,1477209600,[],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Car Repair Shop,,G,1477209600,[implementation],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Delete Them,,H,1477209600,[implementation],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Olympiad in Programming and Sports,,I,1477209600,"[dp, flows, greedy]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bottles,,J,1477209600,[dp],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Roads Orientation Problem,,K,1477209600,[],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Expression Queries,,L,1477209600,[],PROGRAMMING +725,Canada Cup 2016,12,Jumping Ball,500.0,A,1477148700,[implementation],PROGRAMMING +725,Canada Cup 2016,12,Food on the Plane,1000.0,B,1477148700,[math],PROGRAMMING +725,Canada Cup 2016,12,Hidden Word,1500.0,C,1477148700,"[brute force, constructive algorithms, implementation]",PROGRAMMING +725,Canada Cup 2016,12,Contest Balloons,2250.0,D,1477148700,"[data structures, greedy]",PROGRAMMING +725,Canada Cup 2016,12,Too Much Money,2500.0,E,1477148700,[brute force],PROGRAMMING +725,Canada Cup 2016,12,Family Photos,3250.0,F,1477148700,[greedy],PROGRAMMING +725,Canada Cup 2016,12,Messages on a Tree,3500.0,G,1477148700,[],PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Buy a Shovel,500.0,A,1476714900,"[brute force, constructive algorithms, math]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Cormen --- The Best Friend Of a Man,1000.0,B,1476714900,"[dp, greedy]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Sanatorium,1500.0,C,1476714900,"[constructive algorithms, greedy]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Exams,2000.0,D,1476714900,"[binary search, greedy, sortings]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Sockets,2000.0,E,1476714900,"[greedy, sortings]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Tourist Reform,2500.0,F,1476714900,[dfs and similar],PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Night at the Museum,500.0,A,1476611100,"[implementation, strings]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Coupons and Discounts,1000.0,B,1476611100,"[constructive algorithms, greedy]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Socks,1500.0,C,1476611100,"[dsu, graphs, greedy]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,80-th Level Archeology,2000.0,D,1476611100,"[brute force, data structures, greedy, sortings]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Funny Game,2500.0,E,1476611100,"[dp, games]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Video Cards,3000.0,F,1476611100,"[brute force, data structures, implementation, number theory]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Transformation: from A to B,1000.0,A,1476522300,"[brute force, dfs and similar]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Bill Total Value,1000.0,B,1476522300,"[expression parsing, implementation]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Guess the Array,1500.0,C,1476522300,"[constructive algorithms, math]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,T-shirts Distribution,1500.0,D,1476522300,"[constructive algorithms, flows, greedy]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Games on a CD,2500.0,E,1476522300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Polycarp's problems,3000.0,F,1476522300,"[binary search, dp, greedy]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Checking the Calendar,500.0,A,1475928900,[implementation],PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Batch Sort,1000.0,B,1475928900,"[brute force, greedy, implementation]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Ray Tracing,1500.0,C,1475928900,"[greedy, hashing, implementation, math, number theory]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Dense Subsequence,1500.0,D,1475928900,"[data structures, greedy]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Goods transportation,2500.0,E,1475928900,"[dp, flows]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Uniformly Branched Trees,2500.0,F,1475928900,[combinatorics],PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Xor-matic Number of the Graph,2500.0,G,1475928900,"[bitmasks, graphs, math, trees]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,The New Year: Meeting Friends,500.0,A,1475494500,[sortings],PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,Text Document Analysis,1000.0,B,1475494500,"[expression parsing, implementation]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,Polycarp at the Radio,1500.0,C,1475494500,[greedy],PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,Lakes in Berland,2000.0,D,1475494500,"[dfs and similar, dsu, greedy]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,One-Way Reform,2500.0,E,1475494500,"[constructive algorithms, dfs and similar, flows, graphs, greedy]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,st-Spanning Tree,3000.0,F,1475494500,"[dsu, graphs, greedy, implementation]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Broken Clock,500.0,A,1475330700,"[brute force, implementation]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Verse Pattern,500.0,B,1475330700,"[implementation, strings]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Destroying Array,1000.0,C,1475330700,"[data structures, dsu]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Generating Sets,1500.0,D,1475330700,"[binary search, data structures, dfs and similar, greedy]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Research Rover,2000.0,E,1475330700,"[combinatorics, dp]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Cyclic Cipher,2500.0,F,1475330700,"[chinese remainder theorem, implementation, number theory, two pointers]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,One-dimensional Japanese Crossword,500.0,A,1475244300,[implementation],PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Passwords,1000.0,B,1475244300,"[sortings, strings]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Journey,1500.0,C,1475244300,"[dp, graphs]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Maxim and Array,2000.0,D,1475244300,"[constructive algorithms, data structures, greedy]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Road to Home,2750.0,E,1475244300,"[binary search, dp]",PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Efim and Strange Grade,500.0,A,1474635900,[implementation],PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Sasha and Array,1250.0,C,1474635900,"[data structures, math, matrices]",PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Andrew and Chemistry,2000.0,D,1474635900,"[hashing, trees]",PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Matvey's Birthday,2500.0,E,1474635900,[graphs],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Vitya in the Countryside,500.0,A,1474635900,[implementation],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Anatoly and Cockroaches,1000.0,B,1474635900,[greedy],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Efim and Strange Grade,1500.0,C,1474635900,[implementation],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Sasha and Array,2250.0,E,1474635900,"[data structures, math, matrices]",PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Closing ceremony,,A,1474196700,[greedy],PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cactusophobia,,B,1474196700,"[dfs and similar, flows]",PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Homework,,C,1474196700,[],PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Slalom,,D,1474196700,"[data structures, dp]",PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cipher,,E,1474196700,[],PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Array Covering,,F,1474196700,[],PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Plus and Square Root,500.0,A,1474119900,"[constructive algorithms, math]",PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Complete The Graph,1000.0,B,1474119900,"[binary search, constructive algorithms, graphs, shortest paths]",PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Digit Tree,1500.0,C,1474119900,"[divide and conquer, dsu]",PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Create a Maze,2500.0,D,1474119900,[constructive algorithms],PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Complete the Permutations,2750.0,E,1474119900,[],PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Crazy Computer,500.0,A,1474119900,[implementation],PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Complete the Word,1000.0,B,1474119900,[two pointers],PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Plus and Square Root,1500.0,C,1474119900,"[constructive algorithms, math, number theory]",PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Complete The Graph,2000.0,D,1474119900,"[graphs, shortest paths]",PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Digit Tree,2500.0,E,1474119900,[divide and conquer],PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Sonya and Queries,500.0,A,1473784500,[data structures],PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Searching Rectangles,1000.0,B,1473784500,"[binary search, constructive algorithms]",PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Sonya and Problem Wihtout a Legend,2000.0,C,1473784500,"[dp, sortings]",PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Animals and Puzzle,2000.0,D,1473784500,"[binary search, data structures]",PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Sonya Partymaker,2000.0,E,1473784500,[],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Meeting of Old Friends,500.0,A,1473784500,[math],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Filya and Homework,1000.0,B,1473784500,[implementation],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Sonya and Queries,1000.0,C,1473784500,[data structures],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Searching Rectangles,2000.0,D,1473784500,[binary search],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Sonya and Problem Wihtout a Legend,3000.0,E,1473784500,"[dp, flows, sortings]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Festival Organization,,A,1473584400,"[math, number theory]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,R3D3’s Summer Adventure,,B,1473584400,[greedy],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Potions Homework,,C,1473584400,"[implementation, sortings]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Dexterina’s Lab,,D,1473584400,"[games, matrices, probabilities]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,"Paint it really, really dark gray",,E,1473584400,[dfs and similar],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Heroes of Making Magic III,,F,1473584400,[data structures],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Underfail,,G,1473584400,[flows],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Pokermon League challenge,,H,1473584400,[probabilities],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Cowboy Beblop at his computer,,I,1473584400,[],PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Crow,500.0,A,1473525900,[implementation],PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Trident,1000.0,B,1473525900,[implementation],PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and De-Evolution,1500.0,C,1473525900,"[greedy, math]",PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Scores,2250.0,D,1473525900,"[combinatorics, dp]",PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Casinos,2500.0,E,1473525900,"[data structures, math, probabilities]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Bus to Udayland,500.0,A,1472472300,"[brute force, implementation]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Chris and Magic Square,1000.0,B,1472472300,[constructive algorithms],PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Coloring Trees,1500.0,C,1472472300,[dp],PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Directed Roads,2000.0,D,1472472300,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,ZS and The Birthday Paradox,2500.0,E,1472472300,"[math, number theory, probabilities]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Letters Cyclic Shift,500.0,A,1472056500,"[constructive algorithms, implementation]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Recover the String,1000.0,B,1472056500,"[constructive algorithms, implementation, math]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Centroids,1500.0,C,1472056500,"[data structures, dfs and similar, dp, greedy, trees]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Incorrect Flow,2000.0,D,1472056500,[flows],PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Student's Camp,2500.0,E,1472056500,"[dp, math]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Juicer,500.0,A,1472056500,[implementation],PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Checkpoints,1000.0,B,1472056500,"[implementation, sortings]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Letters Cyclic Shift,1500.0,C,1472056500,[greedy],PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Recover the String,2000.0,D,1472056500,"[greedy, math]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Centroids,2500.0,E,1472056500,"[dp, trees]",PROGRAMMING +710,Educational Codeforces Round 16,12,King Moves,,A,1471875000,[implementation],PROGRAMMING +710,Educational Codeforces Round 16,12,Optimal Point on a Line,,B,1471875000,"[brute force, sortings]",PROGRAMMING +710,Educational Codeforces Round 16,12,Magic Odd Square,,C,1471875000,[constructive algorithms],PROGRAMMING +710,Educational Codeforces Round 16,12,Two Arithmetic Progressions,,D,1471875000,[math],PROGRAMMING +710,Educational Codeforces Round 16,12,Generate a String,,E,1471875000,"[dfs and similar, dp]",PROGRAMMING +710,Educational Codeforces Round 16,12,String Set Queries,,F,1471875000,"[brute force, data structures, hashing, string suffix structures, strings]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Brain's Photos,500.0,A,1471698300,[implementation],PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Bakery,1000.0,B,1471698300,[graphs],PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Pythagorean Triples,1500.0,C,1471698300,"[math, number theory]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Persistent Bookcase ,2000.0,D,1471698300,"[data structures, dfs and similar, implementation]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Garlands,2500.0,E,1471698300,[data structures],PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Beru-taxi,500.0,A,1470933300,"[brute force, geometry, implementation]",PROGRAMMING 706,Codeforces Round #367 (Div. 2),2,Interesting drink,1000.0,B,1470933300,"[binary search, implementation]",PROGRAMMING 706,Codeforces Round #367 (Div. 2),2,Hard problem,1500.0,C,1470933300,[dp],PROGRAMMING 706,Codeforces Round #367 (Div. 2),2,Vasiliy's Multiset,2000.0,D,1470933300,"[binary search, data structures, trees]",PROGRAMMING -706,Codeforces Round #367 (Div. 2),2,Working routine,2500.0,E,1470933300,"[data structures, implementation, matrices]",PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Working routine,2500.0,E,1470933300,"[data structures, implementation]",PROGRAMMING 704,Codeforces Round #366 (Div. 1),1,Thor,500.0,A,1470578700,"[brute force, data structures, implementation]",PROGRAMMING 704,Codeforces Round #366 (Div. 1),1,Ant Man,1250.0,B,1470578700,"[dp, graphs, greedy]",PROGRAMMING -704,Codeforces Round #366 (Div. 1),1,Black Widow,1250.0,C,1470578700,[dp],PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Black Widow,1250.0,C,1470578700,"[dp, implementation]",PROGRAMMING 704,Codeforces Round #366 (Div. 1),1,Captain America,2000.0,D,1470578700,[flows],PROGRAMMING -704,Codeforces Round #366 (Div. 1),1,Iron Man,2500.0,E,1470578700,[],PROGRAMMING -705,Codeforces Round #366 (Div. 2),2,Hulk,500.0,A,1470578700,[],PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Iron Man,2500.0,E,1470578700,"[geometry, trees]",PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Hulk,500.0,A,1470578700,[implementation],PROGRAMMING 705,Codeforces Round #366 (Div. 2),2,Spider Man,1000.0,B,1470578700,[games],PROGRAMMING 705,Codeforces Round #366 (Div. 2),2,Thor,1500.0,C,1470578700,"[data structures, implementation]",PROGRAMMING 705,Codeforces Round #366 (Div. 2),2,Ant Man,2250.0,D,1470578700,"[dp, graphs]",PROGRAMMING @@ -2821,7 +6634,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 703,Codeforces Round #365 (Div. 2),2,Mishka and Interesting sum,2000.0,D,1470323700,[data structures],PROGRAMMING 703,Codeforces Round #365 (Div. 2),2,Mishka and Divisors,2250.0,E,1470323700,"[dp, number theory]",PROGRAMMING 702,Educational Codeforces Round 15,12,Maximum Increase,,A,1469804400,"[dp, greedy, implementation]",PROGRAMMING -702,Educational Codeforces Round 15,12,Powers of Two,,B,1469804400,"[brute force, data structures, implementation]",PROGRAMMING +702,Educational Codeforces Round 15,12,Powers of Two,,B,1469804400,"[brute force, data structures, implementation, math]",PROGRAMMING 702,Educational Codeforces Round 15,12,Cellular Network,,C,1469804400,"[binary search, two pointers]",PROGRAMMING 702,Educational Codeforces Round 15,12,Road to Post Office,,D,1469804400,[math],PROGRAMMING 702,Educational Codeforces Round 15,12,Analysis of Pathes in Functional Graph,,E,1469804400,"[data structures, graphs]",PROGRAMMING @@ -2831,7 +6644,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 700,Codeforces Round #364 (Div. 1),1,Break Up,1500.0,C,1469205300,[dfs and similar],PROGRAMMING 700,Codeforces Round #364 (Div. 1),1,Huffman Coding on Segment,2250.0,D,1469205300,"[data structures, greedy]",PROGRAMMING 700,Codeforces Round #364 (Div. 1),1,Cool Slogans,3000.0,E,1469205300,"[string suffix structures, strings]",PROGRAMMING -701,Codeforces Round #364 (Div. 2),2,Cards,500.0,A,1469205300,[greedy],PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Cards,500.0,A,1469205300,"[greedy, implementation]",PROGRAMMING 701,Codeforces Round #364 (Div. 2),2,Cells Not Under Attack,750.0,B,1469205300,[math],PROGRAMMING 701,Codeforces Round #364 (Div. 2),2,They Are Everywhere,1000.0,C,1469205300,"[binary search, two pointers]",PROGRAMMING 701,Codeforces Round #364 (Div. 2),2,As Fast As Possible,1500.0,D,1469205300,"[binary search, math]",PROGRAMMING @@ -2921,16 +6734,16 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 682,Codeforces Round #358 (Div. 2),2,Alyona and the Tree,1500.0,C,1466181300,"[dfs and similar, dp, trees]",PROGRAMMING 682,Codeforces Round #358 (Div. 2),2,Alyona and Strings,2000.0,D,1466181300,"[dp, strings]",PROGRAMMING 682,Codeforces Round #358 (Div. 2),2,Alyona and Triangles,3000.0,E,1466181300,"[geometry, two pointers]",PROGRAMMING -683,Surprise Language Round #8,12,The Check of the Point,,A,1466092800,[],PROGRAMMING -683,Surprise Language Round #8,12,The Teacher of Physical Education,,B,1466092800,[],PROGRAMMING -683,Surprise Language Round #8,12,Symmetric Difference,,C,1466092800,[],PROGRAMMING -683,Surprise Language Round #8,12,Chocolate Bar,,D,1466092800,[],PROGRAMMING -683,Surprise Language Round #8,12,Hammer throwing,,E,1466092800,[],PROGRAMMING -683,Surprise Language Round #8,12,Reformat the String,,F,1466092800,[],PROGRAMMING -683,Surprise Language Round #8,12,The Fraction,,G,1466092800,[],PROGRAMMING -683,Surprise Language Round #8,12,Exchange of Books,,H,1466092800,[],PROGRAMMING -683,Surprise Language Round #8,12,Loader,,I,1466092800,[],PROGRAMMING -683,Surprise Language Round #8,12,The Hero with Bombs,,J,1466092800,[],PROGRAMMING +683,Surprise Language Round #8,12,The Check of the Point,,A,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,The Teacher of Physical Education,,B,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Symmetric Difference,,C,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Chocolate Bar,,D,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Hammer throwing,,E,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Reformat the String,,F,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,The Fraction,,G,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Exchange of Books,,H,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Loader,,I,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,The Hero with Bombs,,J,1466092800,[*special],PROGRAMMING 681,Codeforces Round #357 (Div. 2),2,A Good Contest,500.0,A,1465922100,[implementation],PROGRAMMING 681,Codeforces Round #357 (Div. 2),2,Economy Game,1000.0,B,1465922100,[brute force],PROGRAMMING 681,Codeforces Round #357 (Div. 2),2,Heap Operations,1500.0,C,1465922100,"[data structures, greedy]",PROGRAMMING @@ -2942,7 +6755,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 678,Educational Codeforces Round 13,12,Iterated Linear Function,,D,1465834200,"[math, number theory]",PROGRAMMING 678,Educational Codeforces Round 13,12,Another Sith Tournament,,E,1465834200,"[bitmasks, dp]",PROGRAMMING 678,Educational Codeforces Round 13,12,Lena and Queries,,F,1465834200,"[data structures, divide and conquer, geometry]",PROGRAMMING -684,Codeforces Marathon Round 1,12,Online Exam,,A2,1465722000,[],PROGRAMMING +684,Codeforces Marathon Round 1,12,Online Exam,,A2,1465722000,[*special],PROGRAMMING 679,Codeforces Round #356 (Div. 1),1,Bear and Prime 100,750.0,A,1465403700,[constructive algorithms],PROGRAMMING 679,Codeforces Round #356 (Div. 1),1,Bear and Tower of Cubes,1250.0,B,1465403700,"[dp, greedy]",PROGRAMMING 679,Codeforces Round #356 (Div. 1),1,Bear and Square Grid,1500.0,C,1465403700,"[dfs and similar, dsu, implementation]",PROGRAMMING @@ -2968,42 +6781,4548 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 675,Codeforces Round #353 (Div. 2),2,Money Transfers,1500.0,C,1463416500,"[data structures, greedy, sortings]",PROGRAMMING 675,Codeforces Round #353 (Div. 2),2,Tree Construction,2000.0,D,1463416500,"[data structures, trees]",PROGRAMMING 675,Codeforces Round #353 (Div. 2),2,Trains and Statistic,2500.0,E,1463416500,"[data structures, dp, greedy]",PROGRAMMING -711,Codeforces Round #369 (Div. 2),2,Bus to Udayland,500.0,A,1472472300,"[brute force, implementation]",PROGRAMMING -711,Codeforces Round #369 (Div. 2),2,Chris and Magic Square,1000.0,B,1472472300,[constructive algorithms],PROGRAMMING -711,Codeforces Round #369 (Div. 2),2,Coloring Trees,1500.0,C,1472472300,[dp],PROGRAMMING -711,Codeforces Round #369 (Div. 2),2,Directed Roads,2000.0,D,1472472300,"[combinatorics, dfs and similar, graphs]",PROGRAMMING -711,Codeforces Round #369 (Div. 2),2,ZS and The Birthday Paradox,2500.0,E,1472472300,"[math, number theory, probabilities]",PROGRAMMING -708,AIM Tech Round 3 (Div. 1),1,Letters Cyclic Shift,500.0,A,1472056500,"[constructive algorithms, implementation]",PROGRAMMING -708,AIM Tech Round 3 (Div. 1),1,Recover the String,1000.0,B,1472056500,"[constructive algorithms, implementation, math]",PROGRAMMING -708,AIM Tech Round 3 (Div. 1),1,Centroids,1500.0,C,1472056500,"[data structures, dfs and similar, dp, greedy, trees]",PROGRAMMING -708,AIM Tech Round 3 (Div. 1),1,Incorrect Flow,2000.0,D,1472056500,[flows],PROGRAMMING -708,AIM Tech Round 3 (Div. 1),1,Student's Camp,2500.0,E,1472056500,"[dp, math]",PROGRAMMING -709,AIM Tech Round 3 (Div. 2),2,Juicer,500.0,A,1472056500,[implementation],PROGRAMMING -709,AIM Tech Round 3 (Div. 2),2,Checkpoints,1000.0,B,1472056500,"[implementation, sortings]",PROGRAMMING -709,AIM Tech Round 3 (Div. 2),2,Letters Cyclic Shift,1500.0,C,1472056500,[greedy],PROGRAMMING -709,AIM Tech Round 3 (Div. 2),2,Recover the String,2000.0,D,1472056500,"[greedy, math]",PROGRAMMING -709,AIM Tech Round 3 (Div. 2),2,Centroids,2500.0,E,1472056500,"[dp, trees]",PROGRAMMING -710,Educational Codeforces Round 16,12,King Moves,,A,1471875000,[implementation],PROGRAMMING -710,Educational Codeforces Round 16,12,Optimal Point on a Line,,B,1471875000,"[brute force, sortings]",PROGRAMMING -710,Educational Codeforces Round 16,12,Magic Odd Square,,C,1471875000,[constructive algorithms],PROGRAMMING -710,Educational Codeforces Round 16,12,Two Arithmetic Progressions,,D,1471875000,[math],PROGRAMMING -710,Educational Codeforces Round 16,12,Generate a String,,E,1471875000,"[dfs and similar, dp]",PROGRAMMING -710,Educational Codeforces Round 16,12,String Set Queries,,F,1471875000,"[brute force, data structures, hashing, string suffix structures, strings]",PROGRAMMING -707,Codeforces Round #368 (Div. 2),2,Brain's Photos,500.0,A,1471698300,[implementation],PROGRAMMING -707,Codeforces Round #368 (Div. 2),2,Bakery,1000.0,B,1471698300,[graphs],PROGRAMMING -707,Codeforces Round #368 (Div. 2),2,Pythagorean Triples,1500.0,C,1471698300,"[math, number theory]",PROGRAMMING -707,Codeforces Round #368 (Div. 2),2,Persistent Bookcase ,2000.0,D,1471698300,"[data structures, dfs and similar, implementation]",PROGRAMMING -707,Codeforces Round #368 (Div. 2),2,Garlands,2500.0,E,1471698300,[data structures],PROGRAMMING -788,Codeforces Round #407 (Div. 1),1,Functions again,500.0,A,1490803500,[dp],PROGRAMMING -788,Codeforces Round #407 (Div. 1),1,Weird journey,1250.0,B,1490803500,"[combinatorics, dfs and similar, graphs]",PROGRAMMING -788,Codeforces Round #407 (Div. 1),1,The Great Mixing,1500.0,C,1490803500,"[dfs and similar, dp, math]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Recycling Bottles,500.0,A,1462984500,"[dp, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Robin Hood,1000.0,B,1462984500,"[binary search, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Ultimate Weirdness of an Array,1500.0,C,1462984500,"[data structures, number theory]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Roads in Yusland,2000.0,D,1462984500,"[data structures, dp, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Organizing a Race,3000.0,E,1462984500,"[data structures, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Summer Camp,500.0,A,1462984500,[implementation],PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Different is Good,1000.0,B,1462984500,"[constructive algorithms, implementation, strings]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Recycling Bottles,1500.0,C,1462984500,"[brute force, geometry, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Robin Hood,2000.0,D,1462984500,"[binary search, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Ultimate Weirdness of an Array,2500.0,E,1462984500,[],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Colors,500.0,A,1462633500,[implementation],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Two Paths,1000.0,B,1462633500,[constructive algorithms],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Levels and Regions,1750.0,C,1462633500,[dp],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bears and Juice,3000.0,F,1462633500,[math],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Game,500.0,A,1462633500,[implementation],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Problems for Round,750.0,B,1462633500,"[greedy, implementation]",PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Colors,1000.0,C,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Two Paths,1500.0,D,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Levels and Regions,2250.0,E,1462633500,"[divide and conquer, dp]",PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bearish Fanpages,3000.0,F,1462633500,[],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Colors,500.0,A,1462633500,"[brute force, data structures, implementation]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Two Paths,1000.0,B,1462633500,"[constructive algorithms, graphs]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Levels and Regions,1750.0,C,1462633500,"[divide and conquer, dp]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bears and Juice,3000.0,F,1462633500,[combinatorics],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Holidays,500.0,A,1462464300,"[brute force, constructive algorithms]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Game of Robots,750.0,B,1462464300,[implementation],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Cinema,1000.0,C,1462464300,"[implementation, sortings]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Magic Powder - 1,1000.0,D1,1462464300,"[binary search, brute force]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Magic Powder - 2,500.0,D2,1462464300,[binary search],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Correct Bracket Sequence Editor,2000.0,E,1462464300,"[data structures, dsu]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Restore a Number,2500.0,F,1462464300,"[constructive algorithms, strings]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Reberland Linguistics,500.0,A,1461947700,"[dp, implementation, strings]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,World Tour,1000.0,B,1461947700,"[graphs, shortest paths]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Codeword,2000.0,C,1461947700,[combinatorics],PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Chain Reaction,2000.0,D,1461947700,[brute force],PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Forensic Examination,3000.0,E,1461947700,"[data structures, string suffix structures]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Pouring Rain,500.0,A,1461947700,"[geometry, math]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Coat of Anticubism,1000.0,B,1461947700,"[constructive algorithms, geometry]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Reberland Linguistics,1500.0,C,1461947700,"[dp, strings]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,World Tour,2000.0,D,1461947700,"[brute force, graphs, shortest paths]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Chain Reaction,3000.0,E,1461947700,[],PROGRAMMING +642,VK Cup 2016 - Wild Card Round 2,12,Scheduler for Invokers,,A,1461596400,[*special],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Grasshopper,500.0,A,1461515700,[implementation],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Matrix,750.0,B,1461515700,[implementation],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Dance,1000.0,C,1461515700,"[brute force, constructive algorithms, implementation]",PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Random Variable,1500.0,D,1461515700,"[dp, implementation, math, probabilities]",PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Time Machine,2000.0,E,1461515700,[data structures],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and 2-SAT,3000.0,F,1461515700,[],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Graph,3000.0,G,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Matrix,500.0,A,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Dance,1000.0,B,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Random Variable,1500.0,C,1461515700,[math],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Time Machine,2000.0,D,1461515700,[data structures],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and 2-SAT,3000.0,E,1461515700,[graphs],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Graph,3000.0,F,1461515700,[dp],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Presents,500.0,A,1461515700,[math],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Grasshopper,1000.0,B,1461515700,[],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Matrix,1500.0,C,1461515700,"[constructive algorithms, implementation]",PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Dance,2000.0,D,1461515700,"[data structures, implementation, math]",PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Time Machine,2500.0,E,1461515700,[data structures],PROGRAMMING +665,Educational Codeforces Round 12,12,Buses Between Cities,,A,1461164400,[implementation],PROGRAMMING +665,Educational Codeforces Round 12,12,Shopping,,B,1461164400,[brute force],PROGRAMMING +665,Educational Codeforces Round 12,12,Simple Strings,,C,1461164400,"[dp, greedy, strings]",PROGRAMMING +665,Educational Codeforces Round 12,12,Simple Subset,,D,1461164400,"[constructive algorithms, greedy]",PROGRAMMING +665,Educational Codeforces Round 12,12,Beautiful Subarrays,,E,1461164400,"[data structures, divide and conquer]",PROGRAMMING +665,Educational Codeforces Round 12,12,Four Divisors,,F,1461164400,"[dp, math, number theory]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Rebus,500.0,A,1460824500,"[constructive algorithms, expression parsing, greedy, math]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,International Olympiad,1000.0,B,1460824500,"[brute force, constructive algorithms, greedy, strings]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Graph Coloring,1500.0,C,1460824500,[dfs and similar],PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,To Hack or not to Hack,2500.0,D,1460824500,"[brute force, dp, greedy]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Binary Table,2500.0,E,1460824500,"[bitmasks, divide and conquer, dp]",PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Complicated GCD,500.0,A,1460824500,[math],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Rebus,1000.0,B,1460824500,[greedy],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,International Olympiad,1500.0,C,1460824500,[greedy],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Graph Coloring,2000.0,D,1460824500,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,To Hack or not to Hack,3000.0,E,1460824500,[],PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Gambling Nim,500.0,A,1460729700,"[bitmasks, math, matrices, probabilities]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Graph Coloring,250.0,B,1460729700,[dfs and similar],PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Binary Table,2250.0,C,1460729700,"[bitmasks, brute force, divide and conquer, dp, fft, math]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,International Olympiad,250.0,D,1460729700,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,To Hack or not to Hack,2250.0,E,1460729700,"[brute force, dp, greedy]",PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Seasons,,B,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Array Sum,,C,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Seasons,,B,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Array Sum,,C,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING +660,Educational Codeforces Round 11,12,Co-prime Array,,A,1460127600,"[greedy, implementation]",PROGRAMMING +660,Educational Codeforces Round 11,12,Seating On Bus,,B,1460127600,[implementation],PROGRAMMING +660,Educational Codeforces Round 11,12,Hard Process,,C,1460127600,"[binary search, dp, two pointers]",PROGRAMMING +660,Educational Codeforces Round 11,12,Number of Parallelograms,,D,1460127600,[geometry],PROGRAMMING +660,Educational Codeforces Round 11,12,Different Subsets For All Tuples,,E,1460127600,[combinatorics],PROGRAMMING +660,Educational Codeforces Round 11,12,Bear and Bowling 4,,F,1460127600,"[binary search, data structures, geometry, ternary search]",PROGRAMMING +656,April Fools Day Contest 2016,12,Da Vinci Powers,,A,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Scrambled,,B,1459526400,"[*special, implementation]",PROGRAMMING +656,April Fools Day Contest 2016,12,Without Text,,C,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Rosetta Problem,,D,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Out of Controls,,E,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Ace It!,,F,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,You're a Professional,,G,1459526400,[*special],PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Round House,500.0,A,1459353900,"[implementation, math]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Qualifying Contest,1000.0,B,1459353900,[sortings],PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Tanya and Toys,1000.0,C,1459353900,"[greedy, implementation]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Bicycle Race,1250.0,D,1459353900,"[geometry, implementation, math]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,New Reform,1500.0,E,1459353900,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Polycarp and Hay,2000.0,F,1459353900,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Fence Divercity,2500.0,G,1459353900,"[combinatorics, dp]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Displayed Friends,500.0,A,1459182900,[implementation],PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Forgotten Tree 3,750.0,B,1459182900,"[constructive algorithms, graphs, trees]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Polynomials,1000.0,C,1459182900,"[hashing, implementation, math]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Contribution,1500.0,D,1459182900,"[data structures, greedy, sortings]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Paradox,2000.0,E,1459182900,"[greedy, math, sortings]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Chemistry,3000.0,F,1459182900,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Forgotten Tree 3,500.0,A,1459182900,[graphs],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Polynomials,1000.0,B,1459182900,[math],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Contribution,1500.0,C,1459182900,[sortings],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Paradox,2000.0,D,1459182900,[sortings],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Chemistry,3000.0,E,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Reverse Radewoosh,500.0,A,1459182900,[implementation],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Displayed Friends,1000.0,B,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Forgotten Tree 3,1500.0,C,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Polynomials,2000.0,D,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Contribution,2500.0,E,1459182900,[],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Любимые числа Поликарпа,500.0,A,1458975600,[constructive algorithms],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Этажи,1000.0,B,1458975600,[constructive algorithms],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Печать условий,1500.0,C,1458975600,"[greedy, sortings]",PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Дефрагментация памяти,2000.0,D,1458975600,"[greedy, implementation]",PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Автобус,2500.0,E,1458975600,"[binary search, data structures, greedy, sortings]",PROGRAMMING +652,Educational Codeforces Round 10,12,Gabriel and Caterpillar,,A,1458910800,[implementation],PROGRAMMING +652,Educational Codeforces Round 10,12,z-sort,,B,1458910800,[sortings],PROGRAMMING +652,Educational Codeforces Round 10,12,Foe Pairs,,C,1458910800,[two pointers],PROGRAMMING +652,Educational Codeforces Round 10,12,Nested Segments,,D,1458910800,"[data structures, sortings]",PROGRAMMING +652,Educational Codeforces Round 10,12,Pursuit For Artifacts,,E,1458910800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +652,Educational Codeforces Round 10,12,Ants on a Circle,,F,1458910800,"[constructive algorithms, math]",PROGRAMMING +647,Технокубок 2016 - Ознакомительный Раунд 2,12,Оценки Васи,500.0,A,1458799200,[],PROGRAMMING +647,Технокубок 2016 - Ознакомительный Раунд 2,12,Звёздное небо,1000.0,B,1458799200,[],PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Наибольший подъем,500.0,A,1458745200,[constructive algorithms],PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собери стол,1000.0,B,1458745200,"[constructive algorithms, sortings]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Путь Робота,1500.0,C,1458745200,"[dfs and similar, graphs]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собачки и миски,2000.0,D,1458745200,"[greedy, sortings]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собери число,2500.0,E,1458745200,[],PROGRAMMING +646,Технокубок 2016 - Ознакомительный Раунд 1,12,Три брата,500.0,A,1458568800,[],PROGRAMMING +646,Технокубок 2016 - Ознакомительный Раунд 1,12,Ошибка передачи сообщения,1000.0,B,1458568800,[strings],PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Home Numbers,500.0,A,1458475200,[constructive algorithms],PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Making Genome in Berland,1000.0,B,1458475200,"[*special, dfs and similar, strings]",PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Road Improvement,1500.0,C,1458475200,"[dfs and similar, greedy, trees]",PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Three-dimensional Turtle Super Computer ,2000.0,D,1458475200,"[brute force, dfs and similar, graphs]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Three Balls,500.0,A,1458376500,"[brute force, implementation, sortings]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Compressing,1000.0,B,1458376500,"[brute force, dfs and similar, dp, strings]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Up-Down,1500.0,C,1458376500,"[brute force, implementation]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Delivery Bears,2000.0,D,1458376500,"[binary search, flows]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Forgotten Tree 2,2500.0,E,1458376500,"[dfs and similar, dsu, graphs]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Paper task,3500.0,F,1458376500,"[data structures, string suffix structures]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Move by Prime,3500.0,G,1458376500,[combinatorics],PROGRAMMING +645,CROC 2016 - Elimination Round,12,Amity Assessment,500.0,A,1458318900,"[brute force, constructive algorithms, implementation]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Mischievous Mess Makers,1000.0,B,1458318900,"[greedy, math]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, dp, graphs]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, math, number theory]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Armistice Area Apportionment,3500.0,G,1458318900,"[binary search, geometry]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Amity Assessment,500.0,A,1458318900,[],PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Mischievous Mess Makers,1000.0,B,1458318900,[],PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, graphs]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, number theory]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Armistice Area Apportionment,3500.0,G,1458318900,[geometry],PROGRAMMING +644,CROC 2016 - Qualification,12,Parliament of Berland,500.0,A,1458118800,[constructive algorithms],PROGRAMMING +644,CROC 2016 - Qualification,12,Processing Queries,1000.0,B,1458118800,"[data structures, two pointers]",PROGRAMMING +644,CROC 2016 - Qualification,12,Hostname Aliases,1500.0,C,1458118800,"[binary search, data structures, sortings, strings]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Voting for Photos,500.0,A,1457870400,[implementation],PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Chat Order,1000.0,B,1457870400,"[binary search, data structures, sortings]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Promocodes with Mistakes,1500.0,C,1457870400,"[brute force, constructive algorithms, implementation]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Running with Obstacles,2000.0,D,1457870400,"[data structures, dp, greedy]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Watchmen,500.0,A,1457342700,"[data structures, math]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Image Preview,1000.0,B,1457342700,"[binary search, dp, two pointers]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Table Compression,1500.0,C,1457342700,"[dfs and similar, dp, dsu, graphs, greedy]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Zip-line,2000.0,D,1457342700,"[binary search, data structures, dp]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Clockwork Bomb,2500.0,E,1457342700,"[data structures, dfs and similar, dsu, trees]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Joysticks,500.0,A,1457342700,"[dp, greedy]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Beautiful Paintings,1000.0,B,1457342700,"[greedy, sortings]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Watchmen,1500.0,C,1457342700,"[data structures, geometry, implementation, sortings]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Image Preview,2000.0,D,1457342700,"[binary search, dp, two pointers]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Table Compression,2500.0,E,1457342700,"[dsu, graphs, greedy]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Interview,500.0,A,1457022900,"[brute force, implementation]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Print Check,1000.0,B,1457022900,"[constructive algorithms, implementation]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Report,1500.0,C,1457022900,"[data structures, sortings]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Messenger,2000.0,D,1457022900,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Product Sum,2500.0,E,1457022900,"[data structures, dp, geometry]",PROGRAMMING +632,Educational Codeforces Round 9,12,Grandma Laura and Apples,,A,1456844400,[],PROGRAMMING +632,Educational Codeforces Round 9,12,"Alice, Bob, Two Teams",,B,1456844400,"[brute force, constructive algorithms]",PROGRAMMING +632,Educational Codeforces Round 9,12,The Smallest String Concatenation,,C,1456844400,"[sortings, strings]",PROGRAMMING +632,Educational Codeforces Round 9,12,Longest Subsequence,,D,1456844400,"[brute force, math, number theory]",PROGRAMMING +632,Educational Codeforces Round 9,12,Thief in a Shop,,E,1456844400,"[divide and conquer, dp, fft]",PROGRAMMING +632,Educational Codeforces Round 9,12,Magic Matrix,,F,1456844400,"[brute force, divide and conquer, graphs, trees]",PROGRAMMING +636,VeeRoute Marathon,12,Transfer,,A,1456765200,[*special],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,XOR Equation,500.0,A,1456683000,"[dp, math]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Factory Repairs,1000.0,B,1456683000,[data structures],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Package Delivery,1500.0,C,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Preorder Test,2000.0,D,1456683000,"[binary search, dp, trees]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Orchestra,2500.0,E,1456683000,[two pointers],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Island Puzzle,3000.0,F,1456683000,"[dfs and similar, graphs, trees]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Island Puzzle,500.0,A,1456683000,"[constructive algorithms, implementation]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,XOR Equation,1000.0,B,1456683000,"[constructive algorithms, dp, implementation]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Factory Repairs,1500.0,C,1456683000,[data structures],PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Package Delivery,2000.0,D,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Preorder Test,2500.0,E,1456683000,[],PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Orchestra,3000.0,F,1456683000,[two pointers],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Orchestra,500.0,A,1456683000,"[brute force, implementation]",PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Island Puzzle,1000.0,B,1456683000,[],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,XOR Equation,1500.0,C,1456683000,[dp],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Factory Repairs,2000.0,D,1456683000,[],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Package Delivery,2500.0,E,1456683000,"[data structures, greedy]",PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Preorder Test,3000.0,F,1456683000,[],PROGRAMMING +633,"Manthan, Codefest 16",12,Ebony and Ivory,250.0,A,1456506900,"[brute force, math, number theory]",PROGRAMMING +633,"Manthan, Codefest 16",12,A Trivial Problem,500.0,B,1456506900,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING +633,"Manthan, Codefest 16",12,Spy Syndrome 2,1500.0,C,1456506900,"[data structures, dp, hashing, implementation, sortings, string suffix structures, strings]",PROGRAMMING +633,"Manthan, Codefest 16",12,Fibonacci-ish,1750.0,D,1456506900,"[brute force, hashing, implementation, math]",PROGRAMMING +633,"Manthan, Codefest 16",12,Startup Funding,2500.0,E,1456506900,"[binary search, data structures, probabilities, two pointers]",PROGRAMMING +633,"Manthan, Codefest 16",12,The Chocolate Spree,2750.0,F,1456506900,"[dfs and similar, dp, trees]",PROGRAMMING +633,"Manthan, Codefest 16",12,Yash And Trees,3000.0,G,1456506900,"[bitmasks, data structures, dfs and similar]",PROGRAMMING +633,"Manthan, Codefest 16",12,Fibonacci-ish II,3000.0,H,1456506900,"[data structures, implementation]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Far Relative’s Birthday Cake,500.0,A,1455986100,"[brute force, constructive algorithms, implementation]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Far Relative’s Problem,1000.0,B,1455986100,[brute force],PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Famil Door and Brackets,1750.0,C,1455986100,"[dp, strings]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Babaei and Birthday Cake,2000.0,D,1455986100,"[data structures, dp]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Famil Door and Roads,2500.0,E,1455986100,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +628,Educational Codeforces Round 8,12,Tennis Tournament,,A,1455894000,[implementation],PROGRAMMING +628,Educational Codeforces Round 8,12,New Skateboard,,B,1455894000,[dp],PROGRAMMING +628,Educational Codeforces Round 8,12,Bear and String Distance,,C,1455894000,[greedy],PROGRAMMING +628,Educational Codeforces Round 8,12,Magic Numbers,,D,1455894000,[dp],PROGRAMMING +628,Educational Codeforces Round 8,12,Zbazi in Zeydabad,,E,1455894000,"[data structures, implementation]",PROGRAMMING +628,Educational Codeforces Round 8,12,Bear and Fair Set,,F,1455894000,[flows],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Again Twenty Five!,,A,1455807600,[number theory],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Moore's Law,,B,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Lucky Numbers,,C,1455807600,"[combinatorics, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Hexagons!,,D,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,A rectangle,,E,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Selection of Personnel,,F,1455807600,"[combinatorics, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Challenge Pennants,,G,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Benches,,H,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Parking Lot,,I,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Divisibility,,J,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Indivisibility,,K,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Cracking the Code,,L,1455807600,[implementation],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Turn,,M,1455807600,"[geometry, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Forecast,,N,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Arrow,,O,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Area of a Star,,P,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Pyramids,,Q,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Game,,R,1455807600,[games],PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Robot Sequence,500.0,A,1455384900,"[brute force, implementation]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Cards,750.0,B,1455384900,"[constructive algorithms, dp]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Block Towers,1000.0,C,1455384900,"[brute force, greedy]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Jerry's Protest,1500.0,D,1455384900,"[brute force, combinatorics, probabilities]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Simple Skewness,2000.0,E,1455384900,"[binary search, math, ternary search]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Group Projects,2500.0,F,1455384900,[dp],PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Raffles,3000.0,G,1455384900,"[data structures, greedy]",PROGRAMMING +622,Educational Codeforces Round 7,12,Infinite Sequence,,A,1455116400,"[implementation, math]",PROGRAMMING +622,Educational Codeforces Round 7,12,The Time,,B,1455116400,[implementation],PROGRAMMING +622,Educational Codeforces Round 7,12,Not Equal on a Segment,,C,1455116400,"[data structures, implementation]",PROGRAMMING +622,Educational Codeforces Round 7,12,Optimal Number Permutation,,D,1455116400,[constructive algorithms],PROGRAMMING +622,Educational Codeforces Round 7,12,Ants in Leaves,,E,1455116400,"[dfs and similar, greedy, trees]",PROGRAMMING +622,Educational Codeforces Round 7,12,The Sum of the k-th Powers,,F,1455116400,[math],PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Guest From the Past,750.0,A,1454835900,"[implementation, math]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,War of the Corporations,750.0,B,1454835900,"[constructive algorithms, strings]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,K-special Tables,1000.0,C,1454835900,"[constructive algorithms, implementation]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Finals in arithmetic,2000.0,D,1454835900,"[constructive algorithms, implementation]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Frog Fights,3000.0,E,1454835900,"[data structures, greedy]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Graph and String,500.0,A,1454605500,"[constructive algorithms, graphs]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Array GCD,1000.0,B,1454605500,"[dp, greedy, number theory]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Electric Charges,1750.0,C,1454605500,[binary search],PROGRAMMING +623,AIM Tech Round (Div. 1),1,Birthday,2000.0,D,1454605500,"[greedy, probabilities]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Transforming Sequence,2250.0,E,1454605500,"[combinatorics, dp, fft]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Save Luke,500.0,A,1454605500,[math],PROGRAMMING +624,AIM Tech Round (Div. 2),2,Making a String,1000.0,B,1454605500,"[greedy, sortings]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Graph and String,1500.0,C,1454605500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Array GCD,2000.0,D,1454605500,"[dp, greedy, number theory]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Electric Charges,3000.0,E,1454605500,[],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Odd and Even,500.0,A,1454249100,[implementation],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Bishops,1000.0,B,1454249100,[combinatorics],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Flowers,1500.0,C,1454249100,[probabilities],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Rat Kwesh and Cheese,2000.0,D,1454249100,"[brute force, math]",PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Blocks,2500.0,E,1454249100,"[dp, matrices]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Slime Combining,500.0,A,1454087400,[implementation],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Guess the Permutation,1000.0,B,1454087400,[constructive algorithms],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Constellation,1500.0,C,1454087400,"[geometry, implementation]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Hamiltonian Spanning Tree,1750.0,D,1454087400,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Robot Arm,2500.0,E,1454087400,[data structures],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Double Knapsack,2750.0,F,1454087400,"[constructive algorithms, two pointers]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Combining Slimes,3500.0,G,1454087400,"[dp, matrices, probabilities]",PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Elephant,500.0,A,1453563300,[math],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Chocolate,1000.0,B,1453563300,[combinatorics],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Watering Flowers,1250.0,C,1453563300,[implementation],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Polyline,1750.0,D,1453563300,[constructive algorithms],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,XOR and Favorite Number,2750.0,E,1453563300,[data structures],PROGRAMMING +620,Educational Codeforces Round 6,12,Professor GukiZ's Robot,,A,1453388400,"[implementation, math]",PROGRAMMING +620,Educational Codeforces Round 6,12,Grandfather Dovlet’s calculator,,B,1453388400,[implementation],PROGRAMMING +620,Educational Codeforces Round 6,12,Pearls in a Row,,C,1453388400,[greedy],PROGRAMMING +620,Educational Codeforces Round 6,12,Professor GukiZ and Two Arrays,,D,1453388400,"[binary search, two pointers]",PROGRAMMING +620,Educational Codeforces Round 6,12,New Year Tree,,E,1453388400,"[bitmasks, data structures]",PROGRAMMING +620,Educational Codeforces Round 6,12,Xors on Segments,,F,1453388400,[data structures],PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Peter and Snow Blower,750.0,A,1452789300,"[binary search, geometry, ternary search]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Skills,1250.0,B,1452789300,"[binary search, brute force, two pointers]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Necklace,1250.0,C,1452789300,[constructive algorithms],PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Kingdom and its Cities,2000.0,D,1452789300,"[dfs and similar, divide and conquer, graphs, sortings, trees]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Puzzle Lover,2500.0,E,1452789300,"[dp, hashing, strings]",PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Link/Cut Tree,500.0,A,1452789300,[brute force],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Gena's Code,1000.0,B,1452789300,[implementation],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Peter and Snow Blower,1750.0,C,1452789300,[],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Skills,2250.0,D,1452789300,[],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Necklace,2250.0,E,1452789300,[],PROGRAMMING +616,Educational Codeforces Round 5,12,Comparing Two Long Integers,,A,1452524400,"[implementation, strings]",PROGRAMMING +616,Educational Codeforces Round 5,12,Dinner with Emma,,B,1452524400,"[games, greedy]",PROGRAMMING +616,Educational Codeforces Round 5,12,The Labyrinth,,C,1452524400,[dfs and similar],PROGRAMMING +616,Educational Codeforces Round 5,12,Longest k-Good Segment,,D,1452524400,"[binary search, data structures, two pointers]",PROGRAMMING +616,Educational Codeforces Round 5,12,Sum of Remainders,,E,1452524400,"[implementation, math, number theory]",PROGRAMMING +616,Educational Codeforces Round 5,12,Expensive Strings,,F,1452524400,"[string suffix structures, strings]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Bulbs,500.0,A,1452261900,[implementation],PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Longtail Hedgehog,1250.0,B,1452261900,"[dp, graphs]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Running Track,1750.0,C,1452261900,"[dp, greedy, strings, trees]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Multipliers,2000.0,D,1452261900,"[math, number theory]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Hexagons,2500.0,E,1452261900,"[binary search, implementation, math]",PROGRAMMING +611,Good Bye 2015,12,New Year and Days,500.0,A,1451487900,[implementation],PROGRAMMING +611,Good Bye 2015,12,New Year and Old Property,750.0,B,1451487900,"[brute force, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Domino,1250.0,C,1451487900,"[dp, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Ancient Prophecy,1750.0,D,1451487900,"[hashing, strings]",PROGRAMMING +611,Good Bye 2015,12,New Year and Three Musketeers,2500.0,E,1451487900,"[data structures, greedy]",PROGRAMMING +611,Good Bye 2015,12,New Year and Cleaning,2500.0,F,1451487900,"[binary search, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Cake,3000.0,G,1451487900,"[geometry, two pointers]",PROGRAMMING +611,Good Bye 2015,12,New Year and Forgotten Tree,3500.0,H,1451487900,"[constructive algorithms, flows]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Pasha and Stick,500.0,A,1451215200,"[combinatorics, math]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Vika and Squares,1000.0,B,1451215200,[implementation],PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Harmony Analysis,1500.0,C,1451215200,[constructive algorithms],PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Vika and Segments,2500.0,D,1451215200,"[data structures, geometry, two pointers]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Alphabet Permutations,2500.0,E,1451215200,"[data structures, strings]",PROGRAMMING +612,Educational Codeforces Round 4,12,The Text Splitting,,A,1451055600,"[brute force, implementation, strings]",PROGRAMMING +612,Educational Codeforces Round 4,12,HDD is Outdated Technology,,B,1451055600,[implementation],PROGRAMMING +612,Educational Codeforces Round 4,12,Replace To Make Regular Bracket Sequence,,C,1451055600,"[data structures, expression parsing, math]",PROGRAMMING +612,Educational Codeforces Round 4,12,The Union of k-Segments,,D,1451055600,[sortings],PROGRAMMING +612,Educational Codeforces Round 4,12,Square Root of Permutation,,E,1451055600,"[combinatorics, constructive algorithms, dfs and similar, graphs]",PROGRAMMING +612,Educational Codeforces Round 4,12,Simba on the Circle,,F,1451055600,[dp],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Chain Reaction,500.0,A,1450888500,"[binary search, dp]",PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Zuma,1250.0,B,1450888500,[dp],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Marbles,1500.0,C,1450888500,"[hashing, strings]",PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Power Tree,2000.0,D,1450888500,[data structures],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Cross Sum,3000.0,E,1450888500,"[binary search, geometry]",PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Saitama Destroys Hotel,500.0,A,1450888500,"[implementation, math]",PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Hamming Distance Sum,1000.0,B,1450888500,[combinatorics],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Chain Reaction,1500.0,C,1450888500,[dp],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Zuma,2250.0,D,1450888500,[],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Marbles,2500.0,E,1450888500,[],PROGRAMMING +609,Educational Codeforces Round 3,12,USB Flash Drives,,A,1450537200,"[greedy, implementation, sortings]",PROGRAMMING +609,Educational Codeforces Round 3,12,The Best Gift,,B,1450537200,[implementation],PROGRAMMING +609,Educational Codeforces Round 3,12,Load Balancing,,C,1450537200,[implementation],PROGRAMMING +609,Educational Codeforces Round 3,12,Gadgets for dollars and pounds,,D,1450537200,"[binary search, two pointers]",PROGRAMMING +609,Educational Codeforces Round 3,12,Minimum spanning tree for each edge,,E,1450537200,"[data structures, dfs and similar, dsu, graphs, trees]",PROGRAMMING +609,Educational Codeforces Round 3,12,Frogs and mosquitoes,,F,1450537200,[data structures],PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Sorting Railway Cars,500.0,A,1449677100,"[constructive algorithms, greedy]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Lazy Student,1000.0,B,1449677100,"[constructive algorithms, data structures, graphs]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Freelancer's Dreams,1500.0,C,1449677100,[geometry],PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Board Game,2000.0,D,1449677100,"[data structures, dfs and similar]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Intergalaxy Trips,2500.0,E,1449677100,"[probabilities, shortest paths]",PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Magic Spheres,500.0,A,1449677100,[implementation],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Testing Robots,1000.0,B,1449677100,[implementation],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Sorting Railway Cars,1500.0,C,1449677100,[],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Lazy Student,2000.0,D,1449677100,[graphs],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Freelancer's Dreams,2500.0,E,1449677100,[],PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Alternative Thinking,500.0,A,1448984100,"[dp, greedy]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Moodular Arithmetic,1000.0,B,1448984100,"[dfs and similar, dsu, math, number theory]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Lieges of Legendre,1500.0,C,1448984100,[games],PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Ruminations on Ruminants,2000.0,D,1448984100,"[geometry, math]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Pastoral Oddities,3000.0,E,1448984100,"[data structures, divide and conquer, dsu, trees]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Uncowed Forces,500.0,A,1448984100,[implementation],PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,More Cowbell,1000.0,B,1448984100,"[binary search, greedy]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Alternative Thinking,1500.0,C,1448984100,"[constructive algorithms, dp, math]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Moodular Arithmetic,2000.0,D,1448984100,[dsu],PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Lieges of Legendre,2500.0,E,1448984100,[],PROGRAMMING +600,Educational Codeforces Round 2,12,Extract Numbers,,A,1448636400,[implementation],PROGRAMMING +600,Educational Codeforces Round 2,12,Queries about less or equal elements,,B,1448636400,"[binary search, sortings, two pointers]",PROGRAMMING +600,Educational Codeforces Round 2,12,Make Palindrome,,C,1448636400,[greedy],PROGRAMMING +600,Educational Codeforces Round 2,12,Area of Two Circles' Intersection,,D,1448636400,[geometry],PROGRAMMING +600,Educational Codeforces Round 2,12,Lomsat gelral,,E,1448636400,"[dfs and similar, dsu, trees]",PROGRAMMING +600,Educational Codeforces Round 2,12,Edge coloring of bipartite graph,,F,1448636400,[graphs],PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,The Two Routes,500.0,A,1448382900,"[graphs, shortest paths]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Lipshitz Sequence,1250.0,B,1448382900,[data structures],PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Kleofáš and the n-thlon,1250.0,C,1448382900,"[dp, probabilities]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Acyclic Organic Compounds,2000.0,D,1448382900,"[data structures, dfs and similar, dsu, hashing, trees]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,A Museum Robbery,2500.0,E,1448382900,"[data structures, dp]",PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Two Bases,500.0,A,1448382900,[implementation],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Approximating a Constant Range,1000.0,B,1448382900,"[dp, two pointers]",PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,The Two Routes,1500.0,C,1448382900,[],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Lipshitz Sequence,2250.0,D,1448382900,[],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Kleofáš and the n-thlon,2250.0,E,1448382900,[probabilities],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Patrick and Shopping,500.0,A,1448037300,[implementation],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Spongebob and Joke,1000.0,B,1448037300,[implementation],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Day at the Beach,1500.0,C,1448037300,[sortings],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Spongebob and Squares,2000.0,D,1448037300,"[brute force, math]",PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Sandy and Nuts,3000.0,E,1448037300,"[bitmasks, dp]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Swimming Pool,500.0,A,1447605300,[implementation],PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Array,1000.0,B,1447605300,[greedy],PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Points,1500.0,C,1447605300,"[greedy, sortings]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Trees,2250.0,D,1447605300,"[dp, probabilities, sortings]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Strings,2500.0,E,1447605300,"[dfs and similar, dp, graphs]",PROGRAMMING +598,Educational Codeforces Round 1,12,Tricky Sum,,A,1447426800,[math],PROGRAMMING +598,Educational Codeforces Round 1,12,Queries on a String,,B,1447426800,"[implementation, strings]",PROGRAMMING +598,Educational Codeforces Round 1,12,Nearest vectors,,C,1447426800,"[geometry, sortings]",PROGRAMMING +598,Educational Codeforces Round 1,12,Igor In the Museum,,D,1447426800,[dfs and similar],PROGRAMMING +598,Educational Codeforces Round 1,12,Chocolate Bar,,E,1447426800,"[brute force, dp]",PROGRAMMING +598,Educational Codeforces Round 1,12,Cut Length,,F,1447426800,[geometry],PROGRAMMING +597,Testing Round #12,12,Divisibility,500.0,A,1447264800,[math],PROGRAMMING +597,Testing Round #12,12,Restaurant,1000.0,B,1447264800,"[dp, greedy, sortings]",PROGRAMMING +597,Testing Round #12,12,Subsequences,1500.0,C,1447264800,"[data structures, dp]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Warrior and Archer,500.0,A,1447000200,[games],PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Max and Bike,1000.0,B,1447000200,"[binary search, geometry]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Edo and Magnets,1500.0,C,1447000200,"[brute force, two pointers]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,REQ,2000.0,D,1447000200,"[data structures, number theory]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Cutting the Line,3000.0,E,1447000200,"[string suffix structures, strings]",PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Vitaly and Night,500.0,A,1447000200,[implementation],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Pasha and Phone,1000.0,B,1447000200,"[binary search, math]",PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Warrior and Archer,1500.0,C,1447000200,[games],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Max and Bike,2000.0,D,1447000200,[],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Edo and Magnets,2500.0,E,1447000200,[],PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,2Char,250.0,A,1446655500,[brute force],PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Anton and Lines,1000.0,B,1446655500,"[geometry, sortings]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Beautiful Function,3000.0,C,1446655500,"[constructive algorithms, math]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Happy Tree Party,3000.0,D,1446655500,"[data structures, trees]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Strange Calculation and Cats,3000.0,E,1446655500,"[dp, matrices]",PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,PawnChess,500.0,A,1446309000,[implementation],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,The Monster and the Squirrel,1000.0,B,1446309000,[math],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,The Big Race,1500.0,C,1446309000,[math],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,Super M,2000.0,D,1446309000,"[dfs and similar, dp, trees]",PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,BCPC,3000.0,E,1446309000,"[binary search, geometry, two pointers]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Median Smoothing,750.0,A,1445763600,[],PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Chip 'n Dale Rescue Rangers,1000.0,B,1445763600,"[binary search, geometry, math]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Three States,1250.0,C,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Top Secret Task,1750.0,D,1445763600,[dp],PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Birthday,2500.0,E,1445763600,"[graph matchings, strings]",PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Wizards' Duel,500.0,A,1445763600,[math],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Rebranding,1000.0,B,1445763600,[implementation],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Median Smoothing,1750.0,C,1445763600,[constructive algorithms],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Chip 'n Dale Rescue Rangers,2000.0,D,1445763600,[],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Three States,2250.0,E,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Email Aliases,,A,1445068800,[implementation],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Layer Cake,,B,1445068800,[sortings],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Polycarp's Masterpiece,,C,1445068800,"[data structures, divide and conquer, dp]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Boulevard,,D,1445068800,"[brute force, implementation]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Training with Doors,,E,1445068800,[],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Gourmet and Banquet,,F,1445068800,"[binary search, flows, greedy]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Hiring,,G,1445068800,"[binary search, data structures]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Tourist Guide,,H,1445068800,[dfs and similar],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lottery,,I,1445068800,[implementation],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Cleaner Robot,,J,1445068800,"[dfs and similar, implementation]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Task processing,,K,1445068800,"[brute force, math]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Agricultural Archaeology,,L,1445068800,"[greedy, math]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Taxi in Berland,,M,1445068800,[shortest paths],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff and Weight Lifting,500.0,A,1444926600,[greedy],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in Beach,1000.0,B,1444926600,[dp],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in the Army,1500.0,C,1444926600,"[data structures, trees]",PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in Mafia,2000.0,D,1444926600,"[2-sat, binary search]",PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff as a Queen,2750.0,E,1444926600,[data structures],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff is Mad,2750.0,F,1444926600,"[data structures, strings]",PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff and Meat,750.0,A,1444926600,[greedy],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Love,1000.0,B,1444926600,[math],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff and Weight Lifting,1500.0,C,1444926600,[],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Beach,2000.0,D,1444926600,[],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in the Army,2500.0,E,1444926600,"[data structures, dfs and similar, trees]",PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Mafia,3000.0,F,1444926600,[],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Gennady the Dentist,500.0,A,1444641000,"[brute force, implementation]",PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Phillip and Trains,750.0,B,1444641000,[dfs and similar],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,"Alice, Bob, Oranges and Apples",1250.0,C,1444641000,[number theory],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Lizard Era: Beginning,1750.0,D,1444641000,[meet-in-the-middle],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Present for Vitalik the Philatelist ,2250.0,E,1444641000,"[combinatorics, math, number theory]",PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Digits of Number Pi,3000.0,F,1444641000,"[dp, implementation, strings]",PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Alena's Schedule,500.0,A,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Laurenty and Shop,1000.0,B,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Gennady the Dentist,1500.0,C,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Phillip and Trains,1750.0,D,1444641000,[dp],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,"Alice, Bob, Oranges and Apples",2250.0,E,1444641000,[number theory],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Lizard Era: Beginning,2750.0,F,1444641000,[meet-in-the-middle],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Olesya and Rodion,500.0,A,1444149000,[math],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Kolya and Tanya ,1000.0,B,1444149000,[combinatorics],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Marina and Vasya,1500.0,C,1444149000,"[constructive algorithms, greedy]",PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Dima and Lisa,2000.0,D,1444149000,[number theory],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Anton and Ira,2500.0,E,1444149000,"[constructive algorithms, greedy]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,GCD Table,750.0,A,1443890700,"[constructive algorithms, greedy]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Once Again...,1250.0,B,1443890700,"[dp, matrices]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Superior Periodic Subarrays,1500.0,C,1443890700,[number theory],PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Number of Binominal Coefficients,2250.0,D,1443890700,"[dp, number theory]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Boolean Function,2500.0,E,1443890700,"[bitmasks, dp, expression parsing]",PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Asphalting Roads,500.0,A,1443890700,[implementation],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Robot's Task,1000.0,B,1443890700,[implementation],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,GCD Table,1750.0,C,1443890700,[],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Once Again...,2250.0,D,1443890700,[],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Superior Periodic Subarrays,2500.0,E,1443890700,[number theory],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Vasya the Hipster,500.0,A,1443430800,[implementation],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Luxurious Houses,1000.0,B,1443430800,[implementation],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Developing Skills,1500.0,C,1443430800,"[implementation, sortings]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Three Logos,2000.0,D,1443430800,"[bitmasks, brute force, constructive algorithms, implementation, math]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Kojiro and Furrari,3000.0,E,1443430800,"[dp, greedy]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Zublicanes and Mumocrates,3000.0,F,1443430800,"[dp, trees, two pointers]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and First Steps,750.0,A,1442939400,"[brute force, dp, implementation]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Company,1250.0,B,1442939400,"[binary search, sortings, two pointers]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Park,1500.0,C,1442939400,"[dfs and similar, trees]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Dishes,2000.0,D,1442939400,"[bitmasks, dp]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Watch,2500.0,E,1442939400,"[data structures, hashing, strings]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,A Problem about Polyline,250.0,A,1442416500,"[geometry, math]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,"""Or"" Game",500.0,B,1442416500,"[brute force, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Weakness and Poorness,750.0,C,1442416500,[ternary search],PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,LCS Again,2500.0,D,1442416500,"[dp, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Walking!,2750.0,E,1442416500,"[constructive algorithms, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Mirror Box,3000.0,F,1442416500,"[matrices, trees]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Raising Bacteria,250.0,A,1442416500,[bitmasks],PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Finding Team Member,500.0,B,1442416500,"[brute force, implementation, sortings]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,A Problem about Polyline,1250.0,C,1442416500,"[binary search, math]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,"""Or"" Game",2000.0,D,1442416500,"[brute force, greedy, math]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Weakness and Poorness,3000.0,E,1442416500,[ternary search],PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,LCS Again,3000.0,F,1442416500,[],PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Vasya and Petya's Game,500.0,A,1441902600,"[math, number theory]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Invariance of Tree,1250.0,B,1441902600,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Points on Plane,1250.0,C,1441902600,"[constructive algorithms, divide and conquer, geometry, greedy, sortings]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Flights for Regular Customers,2000.0,D,1441902600,"[dp, matrices]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Painting Edges,2750.0,E,1441902600,"[binary search, data structures]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Multiplication Table,500.0,A,1441902600,"[implementation, number theory]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Modulo Sum,1250.0,B,1441902600,"[combinatorics, data structures, dp, two pointers]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Vasya and Petya's Game,1500.0,C,1441902600,"[implementation, number theory]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Invariance of Tree,2250.0,D,1441902600,[],PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Points on Plane,2250.0,E,1441902600,[constructive algorithms],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Fibonotci,,A,1441526400,"[math, matrices]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bribes,,B,1441526400,"[dfs and similar, trees]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Party,,C,1441526400,"[bitmasks, brute force, graph matchings]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Tablecity,,D,1441526400,[constructive algorithms],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Spectator Riots,,E,1441526400,[geometry],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bulbo,,F,1441526400,"[dp, greedy]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Run for beer,,G,1441526400,"[dfs and similar, shortest paths]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bots,,H,1441526400,"[combinatorics, number theory]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Robots protection,,I,1441526400,[data structures],PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Poker,500.0,A,1440865800,"[implementation, number theory]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Blocks,1000.0,B,1440865800,"[binary search, data structures, dp]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Drawing,1750.0,C,1440865800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Cavalry,2000.0,D,1440865800,"[data structures, divide and conquer, dp]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Bowling,2500.0,E,1440865800,[greedy],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Elections,500.0,A,1440865800,[implementation],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Three Musketeers,1000.0,B,1440865800,"[brute force, dfs and similar, graphs, hashing]",PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Poker,1500.0,C,1440865800,[number theory],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Blocks,2000.0,D,1440865800,"[data structures, dp, shortest paths]",PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Drawing,2750.0,E,1440865800,[],PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Lengthening Sticks,750.0,A,1440261000,"[combinatorics, implementation, math]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Minimization,1250.0,B,1440261000,"[dp, greedy, sortings]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,CNF 2,1500.0,C,1440261000,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Campus,2000.0,D,1440261000,"[binary search, data structures, dsu, trees]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Geometric Progressions,2750.0,E,1440261000,[math],PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Arrays,500.0,A,1440261000,[sortings],PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Order Book,1000.0,B,1440261000,"[data structures, greedy, implementation, sortings]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Lengthening Sticks,1750.0,C,1440261000,"[brute force, combinatorics, dp, math]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Minimization,2250.0,D,1440261000,"[dp, sortings]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,CNF 2,2500.0,E,1440261000,[],PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Elections,500.0,A,1439483400,[implementation],PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Simple Game,1000.0,B,1439483400,"[constructive algorithms, games, greedy, implementation, math]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Replacement,1500.0,C,1439483400,"[constructive algorithms, data structures, implementation]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Tree Requests,2000.0,D,1439483400,"[binary search, constructive algorithms, dfs and similar, trees]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Pig and Palindromes,2500.0,E,1439483400,"[combinatorics, dp]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Primes or Palindromes?,500.0,A,1439224200,"[brute force, implementation, math, number theory]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Symmetric and Transitive,1000.0,B,1439224200,"[combinatorics, dp, math]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,New Language,1500.0,C,1439224200,"[2-sat, greedy]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Sign Posts,2250.0,D,1439224200,"[brute force, math]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Longest Increasing Subsequence,2500.0,E,1439224200,"[data structures, dp]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Music,500.0,A,1439224200,"[implementation, math]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Inventory,1000.0,B,1439224200,[greedy],PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Primes or Palindromes?,1500.0,C,1439224200,"[binary search, brute force, number theory]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Symmetric and Transitive,2250.0,D,1439224200,"[brute force, dp, math]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,New Language,2750.0,E,1439224200,[],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Lineland Mail,500.0,A,1438790400,[implementation],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Berland National Library,1000.0,B,1438790400,[implementation],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Geometric Progression,1500.0,C,1438790400,"[binary search, data structures, dp]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,One-Dimensional Battle Ships,2000.0,D,1438790400,"[binary search, data structures, sortings]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,President and Roads,2500.0,E,1438790400,"[dfs and similar, graphs, hashing, shortest paths]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Mausoleum,2500.0,F,1438790400,[dp],PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Matching Names,1750.0,A,1438273200,"[dfs and similar, strings, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Replicating Processes,2500.0,B,1438273200,"[constructive algorithms, greedy]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Logistical Questions,3000.0,C,1438273200,"[dfs and similar, divide and conquer, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Restructuring Company,1000.0,D,1438273200,"[data structures, dsu]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Restoring Map,3000.0,E,1438273200,"[bitmasks, constructive algorithms, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Clique in the Divisibility Graph,500.0,F,1438273200,"[dp, math, number theory]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Max and Min,2500.0,G,1438273200,[geometry],PROGRAMMING +562,VK Cup 2015 - Finals,12,Logistical Questions,1500.0,A,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Clique in the Divisibility Graph,250.0,B,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Restoring Map,2250.0,C,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Restructuring Company,250.0,D,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Max and Min,500.0,E,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Matching Names,250.0,F,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Replicating Processes,500.0,G,1437898500,[],PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald's Hexagon,500.0,A,1437573600,"[brute force, geometry, math]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Equivalent Strings,1000.0,B,1437573600,"[divide and conquer, hashing, sortings, strings]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald and Giant Chess,1500.0,C,1437573600,"[combinatorics, dp, math, number theory]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Randomizer,2250.0,D,1437573600,"[combinatorics, geometry, probabilities]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald and Path,2250.0,E,1437573600,"[dp, sortings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Currency System in Geraldion,500.0,A,1437573600,"[geometry, implementation, sortings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald is into Art,1000.0,B,1437573600,"[constructive algorithms, implementation]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald's Hexagon,1500.0,C,1437573600,[geometry],PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Equivalent Strings,2000.0,D,1437573600,"[hashing, implementation, strings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald and Giant Chess,2500.0,E,1437573600,"[combinatorics, dp]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Lala Land and Apple Trees,500.0,A,1436886600,"[brute force, implementation, sortings]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Amr and The Large Array,1000.0,B,1436886600,[implementation],PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Amr and Chemistry,1500.0,C,1436886600,"[brute force, greedy]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Guess Your Way Out! II,2250.0,D,1436886600,"[data structures, implementation, sortings]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,A Simple Task,2500.0,E,1436886600,"[data structures, sortings, strings]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Ilya and Diplomas,500.0,A,1435676400,"[greedy, implementation]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Pasha and Tea,1000.0,B,1435676400,"[implementation, sortings]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Arthur and Table,1500.0,C,1435676400,"[brute force, data structures, dp, greedy]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Vitaly and Cycle,2000.0,D,1435676400,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Ann and Half-Palindrome,2500.0,E,1435676400,"[data structures, dp, string suffix structures, strings, trees]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Matryoshkas,250.0,A,1435414200,[implementation],PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Fugitive,750.0,B,1435414200,"[data structures, greedy, sortings]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Chocolate,1250.0,C,1435414200,[data structures],PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of a Top Secret,2000.0,D,1435414200,"[binary search, implementation, math]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Computer Network,3000.0,E,1435414200,"[dfs and similar, graphs, trees]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of the Zeros and Ones,250.0,A,1435414200,[greedy],PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Fake Numbers,250.0,B,1435414200,"[brute force, implementation]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Matryoshkas,1000.0,C,1435414200,[implementation],PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Fugitive,3000.0,D,1435414200,"[binary search, data structures, greedy]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Chocolate,3000.0,E,1435414200,"[binary search, data structures]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Colored Balls,250.0,A,1435163400,"[combinatorics, dp, math]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Permutation,500.0,B,1435163400,"[binary search, combinatorics, constructive algorithms, implementation, math]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Love Triangles,1000.0,C,1435163400,"[dfs and similar, dsu, graphs]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Nudist Beach,1500.0,D,1435163400,"[binary search, graphs, greedy]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Train,3000.0,E,1435163400,"[dp, fft, probabilities]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Photobooks,250.0,A,1435163400,"[brute force, math]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Ohana Cleans Up,500.0,B,1435163400,"[brute force, strings]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Colored Balls,1500.0,C,1435163400,"[combinatorics, dp, math]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Permutation,3000.0,D,1435163400,[math],PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Love Triangles,3000.0,E,1435163400,"[dfs and similar, dsu]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Table,500.0,A,1434645000,"[implementation, math]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Books,1000.0,B,1434645000,"[implementation, math]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Scales,1500.0,C,1434645000,"[brute force, dp, greedy, math, meet-in-the-middle]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Triangles,2000.0,D,1434645000,"[brute force, combinatorics, data structures, geometry, math, sortings]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Brackets,2500.0,E,1434645000,"[brute force, dp, expression parsing, greedy, implementation]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and Contest,500.0,A,1434127500,"[implementation, sortings]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,ZgukistringZ,1250.0,B,1434127500,"[brute force, constructive algorithms, implementation, strings]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ hates Boxes,1750.0,C,1434127500,"[binary search, greedy]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and Binary Operations,2000.0,D,1434127500,"[combinatorics, math, matrices, number theory]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and GukiZiana,2500.0,E,1434127500,"[binary search, data structures]",PROGRAMMING +549,Looksery Cup 2015,12,Face Detection,250.0,A,1433595600,[implementation],PROGRAMMING +549,Looksery Cup 2015,12,Looksery Party,1750.0,B,1433595600,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING +549,Looksery Cup 2015,12,The Game Of Parity,2000.0,C,1433595600,[games],PROGRAMMING +549,Looksery Cup 2015,12,Haar Features,1000.0,D,1433595600,"[greedy, implementation]",PROGRAMMING +549,Looksery Cup 2015,12,Sasha Circle,3000.0,E,1433595600,[math],PROGRAMMING +549,Looksery Cup 2015,12,Yura and Developers,3000.0,F,1433595600,"[data structures, divide and conquer]",PROGRAMMING +549,Looksery Cup 2015,12,Happy Line,1500.0,G,1433595600,"[greedy, sortings]",PROGRAMMING +549,Looksery Cup 2015,12,Degenerate Matrix,1500.0,H,1433595600,"[binary search, math]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Two Substrings,1000.0,A,1433435400,"[brute force, dp, implementation, strings]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Preparing Olympiad,750.0,B,1433435400,"[bitmasks, brute force]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Divisibility by Eight,1000.0,C,1433435400,"[brute force, dp, math]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Regular Bridge,2000.0,D,1433435400,"[constructive algorithms, graphs, implementation]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Brackets in Implications,3000.0,E,1433435400,"[constructive algorithms, greedy, implementation]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Frog,750.0,A,1432658100,"[brute force, implementation, math]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Feet,1000.0,B,1432658100,"[binary search, data structures, dp, dsu]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Foam,1750.0,C,1432658100,"[bitmasks, number theory]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Fish,1750.0,D,1432658100,"[dfs and similar, graphs]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Friends,2500.0,E,1432658100,"[data structures, string suffix structures, strings]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Fax,500.0,A,1432658100,"[brute force, implementation]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Fun,1000.0,B,1432658100,"[brute force, greedy, implementation]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Frog,1750.0,C,1432658100,[number theory],PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Feet,2000.0,D,1432658100,"[binary search, data structures]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Foam,2750.0,E,1432658100,[number theory],PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Bananas,500.0,A,1432312200,"[implementation, math]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Badges,1000.0,B,1432312200,"[brute force, greedy, implementation, sortings]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Cards,1250.0,C,1432312200,"[brute force, dfs and similar]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Number Game,1500.0,D,1432312200,"[constructive algorithms, dp, math, number theory]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Traveling,2250.0,E,1432312200,"[flows, math]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Toy Cars,500.0,A,1432053000,[implementation],PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Equidistant String,1000.0,B,1432053000,[greedy],PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Woodcutters,1750.0,C,1432053000,"[dp, greedy]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Queue,1750.0,D,1432053000,"[greedy, implementation, sortings]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Paths and Trees,2500.0,E,1432053000,"[graphs, greedy, shortest paths]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Writing Code,500.0,A,1431016200,[dp],PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Destroying Roads,1000.0,B,1431016200,"[graphs, shortest paths]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Remembering Strings,1750.0,C,1431016200,"[bitmasks, dp]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Road Improvement,1750.0,D,1431016200,"[dp, trees]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Listening to Music,2500.0,E,1431016200,"[constructive algorithms, data structures]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Set of Strings,500.0,A,1431016200,[implementation],PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Sea and Islands,1000.0,B,1431016200,"[constructive algorithms, implementation]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Writing Code,1500.0,C,1431016200,[dp],PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Destroying Roads,2000.0,D,1431016200,"[brute force, graphs, shortest paths]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Remembering Strings,2750.0,E,1431016200,"[bitmasks, dp]",PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Place Your Ad Here,750.0,A,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Duck Hunt,3000.0,B,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Idempotent functions,250.0,C,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Superhero's Job,1250.0,D,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Playing on Graph,750.0,E,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Quest,500.0,F,1430668800,[],PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Place Your Ad Here,2000.0,A,1430668800,"[data structures, sortings]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Duck Hunt,3000.0,B,1430668800,[data structures],PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Idempotent functions,750.0,C,1430668800,"[constructive algorithms, graphs, math]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Superhero's Job,2250.0,D,1430668800,"[dfs and similar, dp, hashing, math, number theory]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Playing on Graph,2250.0,E,1430668800,"[graphs, shortest paths]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Quest,1000.0,F,1430668800,"[dp, greedy]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Combination Lock,500.0,A,1430411400,[implementation],PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,School Marks,1000.0,B,1430411400,"[greedy, implementation]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Ice Cave,1500.0,C,1430411400,[dfs and similar],PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Bad Luck Island,2000.0,D,1430411400,"[dp, probabilities]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Infinite Inversions,2500.0,E,1430411400,"[binary search, data structures, implementation, sortings, trees]",PROGRAMMING +538,Codeforces Round #300,12,Cutting Banner,500.0,A,1430064000,"[brute force, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Quasi Binary,1000.0,B,1430064000,"[constructive algorithms, dp, greedy, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Tourist's Notes,1500.0,C,1430064000,"[binary search, brute force, greedy, implementation, math]",PROGRAMMING +538,Codeforces Round #300,12,Weird Chess,1500.0,D,1430064000,"[brute force, constructive algorithms, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Demiurges Play Again,2000.0,E,1430064000,"[dfs and similar, dp, math, trees]",PROGRAMMING +538,Codeforces Round #300,12,A Heap of Heaps,2500.0,F,1430064000,"[brute force, data structures, math, sortings]",PROGRAMMING +538,Codeforces Round #300,12,Berserk Robot ,3000.0,G,1430064000,"[constructive algorithms, math, sortings]",PROGRAMMING +538,Codeforces Round #300,12,Summer Dichotomy,3000.0,H,1430064000,"[2-sat, data structures, dfs and similar, greedy]",PROGRAMMING +537,VK Cup 2015 - Wild Card Round 2,12,Antiplagiarism,,A,1429381800,[*special],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Berland Miners,3000.0,A,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Work Group,500.0,B,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Board Game,250.0,C,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Landmarks,3000.0,D,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Correcting Mistakes,500.0,E,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Encoding,1250.0,F,1429286400,[],PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Berland Miners,3000.0,A,1429286400,"[binary search, data structures, dfs and similar, greedy, trees]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Work Group,750.0,B,1429286400,"[dfs and similar, dp, graphs, strings, trees]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Board Game,250.0,C,1429286400,"[games, greedy, implementation, math]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Landmarks,3000.0,D,1429286400,[data structures],PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Correcting Mistakes,500.0,E,1429286400,"[constructive algorithms, dp, greedy, hashing, strings, two pointers]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Encoding,1500.0,F,1429286400,"[hashing, string suffix structures, strings]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Nafas,500.0,A,1429029300,[implementation],PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and SaDDas,1000.0,B,1429029300,"[bitmasks, brute force, implementation]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Karafs,1500.0,C,1429029300,"[binary search, math]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Malekas,2000.0,D,1429029300,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Pashmaks,2500.0,E,1429029300,[geometry],PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Karafs,500.0,A,1429029300,"[binary search, math]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Malekas,1000.0,B,1429029300,"[hashing, string suffix structures, strings]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Pashmaks,1500.0,C,1429029300,[geometry],PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas in Kansas,2000.0,D,1429029300,"[dp, games]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas on the Path,2500.0,E,1429029300,"[data structures, divide and conquer, trees]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Exam,500.0,A,1428854400,"[constructive algorithms, implementation]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Covered Path,1000.0,B,1428854400,"[dp, greedy, math]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Polycarpus' Dice,1500.0,C,1428854400,[math],PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Handshakes,2000.0,D,1428854400,"[binary search, constructive algorithms, data structures, greedy]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Berland Local Positioning System,2500.0,E,1428854400,"[constructive algorithms, greedy, hashing, implementation]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Simplified Nonogram,3000.0,F,1428854400,"[bitmasks, dp, hashing, meet-in-the-middle]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,King of Thieves,500.0,A,1428165300,"[brute force, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Dark Park,500.0,B,1428165300,"[dfs and similar, greedy, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Candies,1250.0,C,1428165300,"[brute force, greedy, math]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Necklace,1750.0,D,1428165300,"[hashing, string suffix structures, strings]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Transmitting Levels,2250.0,E,1428165300,"[dp, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Pudding Monsters,3000.0,F,1428165300,"[data structures, divide and conquer]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Spiders Evil Plan,3000.0,G,1428165300,"[greedy, trees]",PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,String inside out,,B,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Set subtraction,,D,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Sum and product,,E,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Points in triangle,,H,1427562000,"[*special, geometry]",PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Different variables,,I,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,String inside out,,B,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Set subtraction,,D,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Sum and product,,E,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Points in triangle,,H,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Different variables,,I,1427562000,[*special],PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Vitaliy and Pie,250.0,A,1427387400,"[greedy, hashing]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Pasha and String,750.0,B,1427387400,[greedy],PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Ilya and Sticks,1000.0,C,1427387400,"[greedy, sortings]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Arthur and Walls,3000.0,D,1427387400,"[data structures, greedy]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Anya and Cubes,3000.0,E,1427387400,"[binary search, bitmasks, brute force, dp, meet-in-the-middle]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,And Yet Another Bracket Sequence,2500.0,A,1426956300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Group Photo 2 (online mirror version),500.0,B,1426956300,"[brute force, greedy, sortings]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Rooks and Rectangles,1500.0,C,1426956300,[data structures],PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Social Network,1250.0,D,1426956300,"[data structures, greedy]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,The Art of Dealing with ATM,500.0,E,1426956300,[brute force],PROGRAMMING +524,VK Cup 2015 - Round 1,12,"Возможно, вы знаете этих людей?",500.0,A,1426946400,[implementation],PROGRAMMING +524,VK Cup 2015 - Round 1,12,Фото на память - 2 (round version),500.0,B,1426946400,"[dp, greedy]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,The Art of Dealing with ATM,1000.0,C,1426946400,"[binary search, sortings]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,Social Network,1250.0,D,1426946400,"[greedy, two pointers]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,Rooks and Rectangles,1750.0,E,1426946400,[data structures],PROGRAMMING +524,VK Cup 2015 - Round 1,12,And Yet Another Bracket Sequence,3000.0,F,1426946400,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Playing with Paper,500.0,A,1426610700,"[implementation, math]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Error Correct System,1000.0,B,1426610700,[greedy],PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Glass Carving,1500.0,C,1426610700,"[binary search, data structures, implementation]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Clique Problem,2000.0,D,1426610700,"[data structures, dp, greedy, implementation, sortings]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Data Center Drama,2500.0,E,1426610700,"[dfs and similar, graphs]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Glass Carving,500.0,A,1426610700,"[data structures, implementation]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Clique Problem,1000.0,B,1426610700,"[dp, greedy]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Data Center Drama,1500.0,C,1426610700,"[constructive algorithms, graphs]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Fuzzy Search,2000.0,D,1426610700,"[bitmasks, brute force, fft]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Triangles 3000,2500.0,E,1426610700,"[geometry, sortings]",PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,"Rotate, Flip and Zoom",500.0,A,1426345200,[implementation],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Mean Requests,1000.0,B,1426345200,[implementation],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Name Quest,1500.0,C,1426345200,[greedy],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Statistics of Recompressing Videos,2000.0,D,1426345200,"[data structures, implementation]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Reposts,500.0,A,1425740400,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Photo to Remember,1000.0,B,1425740400,"[data structures, dp, implementation]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Chicken or Fish?,1500.0,C,1425740400,[greedy],PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Closest Equals,2000.0,D,1425740400,[data structures],PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Pangram,500.0,A,1425279600,"[implementation, strings]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Two Buttons,1000.0,B,1425279600,"[dfs and similar, graphs, greedy, implementation, math, shortest paths]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,DNA Alignment,1500.0,C,1425279600,"[math, strings]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Cubes,2000.0,D,1425279600,"[games, greedy, implementation]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Pluses everywhere,2500.0,E,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,DNA Alignment,500.0,A,1425279600,"[greedy, math]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Cubes,1000.0,B,1425279600,"[data structures, greedy, implementation]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Pluses everywhere,1500.0,C,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Shop,2000.0,D,1425279600,[greedy],PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Cycling City,2500.0,E,1425279600,"[dfs and similar, graphs]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Chess,500.0,A,1425128400,[implementation],PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Compilation Errors,1000.0,B,1425128400,"[data structures, implementation]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Team Training,1500.0,C,1425128400,"[greedy, implementation, math, number theory]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Interesting Substrings,2000.0,D,1425128400,"[data structures, dp, two pointers]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Lecture Rooms,2500.0,E,1425128400,"[binary search, data structures, dfs and similar, dp, trees]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Vitaly and Strings,500.0,A,1424795400,[strings],PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Tanya and Postcard,1000.0,B,1424795400,"[implementation, strings]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Anya and Smartphone,1500.0,C,1424795400,"[data structures, implementation]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Ilya and Escalator,2000.0,D,1424795400,"[combinatorics, dp, probabilities]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Arthur and Questions,2500.0,E,1424795400,"[greedy, implementation, ternary search]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Pasha and Pipe,2500.0,F,1424795400,"[binary search, brute force, combinatorics, dp, implementation]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Date,500.0,A,1424190900,[math],PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and His Happy Friends,1000.0,B,1424190900,"[brute force, dsu, meet-in-the-middle, number theory]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Factorial,1000.0,C,1424190900,"[greedy, math, sortings]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Tiles,3000.0,D,1424190900,"[constructive algorithms, greedy]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Park,3000.0,E,1424190900,[data structures],PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Factorial,500.0,A,1424190900,"[dp, greedy, implementation, math]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Tiles,1000.0,B,1424190900,"[data structures, graph matchings, greedy, implementation]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Park,1500.0,C,1424190900,[data structures],PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Morning Exercise,3000.0,D,1424190900,"[dfs and similar, dp, dsu, trees, two pointers]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and His Happy Friends,3000.0,E,1424190900,"[math, number theory]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Chewbaсca and Number,500.0,A,1423931400,"[greedy, implementation]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Han Solo and Lazer Gun,1000.0,B,1423931400,"[brute force, data structures, geometry, math]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Watto and Mechanism,2000.0,C,1423931400,"[binary search, hashing, string suffix structures, strings]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,R2D2 and Droid Army,2000.0,D,1423931400,"[binary search, data structures, two pointers]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Darth Vader and Tree,2500.0,E,1423931400,"[dp, matrices]",PROGRAMMING +513,Rockethon 2015,12,Game,3.0,A,1423328400,"[constructive algorithms, math]",PROGRAMMING +513,Rockethon 2015,12,Permutations,3.0,B1,1423328400,[brute force],PROGRAMMING +513,Rockethon 2015,12,Permutations,4.0,B2,1423328400,"[bitmasks, divide and conquer, math]",PROGRAMMING +513,Rockethon 2015,12,Second price auction,8.0,C,1423328400,"[bitmasks, probabilities]",PROGRAMMING +513,Rockethon 2015,12,Constrained Tree,9.0,D1,1423328400,[dfs and similar],PROGRAMMING +513,Rockethon 2015,12,Constrained Tree,8.0,D2,1423328400,"[constructive algorithms, data structures]",PROGRAMMING +513,Rockethon 2015,12,Subarray Cuts,9.0,E1,1423328400,[dp],PROGRAMMING +513,Rockethon 2015,12,Subarray Cuts,12.0,E2,1423328400,[dp],PROGRAMMING +513,Rockethon 2015,12,Scaygerboss,14.0,F1,1423328400,[flows],PROGRAMMING +513,Rockethon 2015,12,Scaygerboss,6.0,F2,1423328400,[flows],PROGRAMMING +513,Rockethon 2015,12,Inversions problem,3.0,G1,1423328400,"[brute force, dfs and similar, dp, meet-in-the-middle]",PROGRAMMING +513,Rockethon 2015,12,Inversions problem,5.0,G2,1423328400,"[dp, probabilities]",PROGRAMMING +513,Rockethon 2015,12,Inversions problem,16.0,G3,1423328400,[dp],PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Names,500.0,A,1422894600,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Jumping,1000.0,B,1422894600,"[data structures, dp, math, number theory, shortest paths]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Dinner,1500.0,C,1422894600,"[flows, graph matchings]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Travelling,2250.0,D,1422894600,"[dp, trees]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Polygon,2250.0,E,1422894600,"[constructive algorithms, divide and conquer]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Snake,500.0,A,1422894600,[implementation],PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Two Dots,1000.0,B,1422894600,[dfs and similar],PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Names,1500.0,C,1422894600,"[dfs and similar, graphs, sortings]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Jumping,2000.0,D,1422894600,"[bitmasks, brute force, dp, math]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Dinner,2500.0,E,1422894600,[flows],PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Maximum in Table,,A,1422705600,"[brute force, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Painting Pebbles,,B,1422705600,"[constructive algorithms, greedy, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Sums of Digits,,C,1422705600,"[dp, greedy, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Restoring Numbers,,D,1422705600,"[constructive algorithms, math]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Pretty Song,,E,1422705600,"[math, strings]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Progress Monitoring,,F,1422705600,[dp],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Pasha and Pixels,500.0,A,1422376200,[brute force],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Anton and currency you all know,1000.0,B,1422376200,[greedy],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Anya and Ghosts,1500.0,C,1422376200,[greedy],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Tanya and Password,2000.0,D,1422376200,"[dfs and similar, graphs]",PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Arthur and Brackets,2500.0,E,1422376200,"[dp, greedy]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Amr and Music,500.0,A,1422028800,"[greedy, implementation, sortings]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Amr and Pins,1000.0,B,1422028800,"[geometry, math]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Guess Your Way Out!,1500.0,C,1422028800,"[implementation, math]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,The Maths Lecture,2000.0,D,1422028800,"[dp, implementation]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Breaking Good,2500.0,E,1422028800,"[dfs and similar, dp, graphs, shortest paths]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Gift,500.0,A,1421586000,"[brute force, implementation, strings]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Colorful Graph,1000.0,B,1421586000,"[dfs and similar, dp, dsu, graphs]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,"Mr. Kitayuta, the Treasure Hunter",1500.0,C,1421586000,"[dfs and similar, dp, two pointers]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Technology,2000.0,D,1421586000,[dfs and similar],PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta vs. Bamboos,2750.0,E,1421586000,"[binary search, greedy]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,"Mr. Kitayuta, the Treasure Hunter",500.0,A,1421586000,[dp],PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Technology,1000.0,B,1421586000,"[dfs and similar, graphs]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta vs. Bamboos,1750.0,C,1421586000,[binary search],PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Colorful Graph,1750.0,D,1421586000,"[brute force, dfs and similar, dsu]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Gift,2500.0,E,1421586000,"[combinatorics, dp, matrices, strings]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Contest,500.0,A,1421053200,[implementation],PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Changing Handles,500.0,B,1421053200,"[data structures, dsu, strings]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Forest,1500.0,C,1421053200,"[constructive algorithms, data structures, greedy, sortings, trees]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Permutations Summation,3000.0,D,1421053200,[data structures],PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Palindrome Degree,3000.0,E,1421053200,"[binary search, combinatorics, implementation]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Forest,500.0,A,1421053200,"[constructive algorithms, data structures, graphs, greedy]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Permutations Summation,500.0,B,1421053200,"[binary search, data structures, math]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Palindrome Degree,2500.0,C,1421053200,[math],PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and XOR,2500.0,D,1421053200,[bitmasks],PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and LCP on Tree,3000.0,E,1421053200,"[binary search, dfs and similar, hashing, string suffix structures, trees]",PROGRAMMING +500,Good Bye 2014,12,New Year Transportation,500.0,A,1419951600,"[dfs and similar, graphs, implementation]",PROGRAMMING +500,Good Bye 2014,12,New Year Permutation,1000.0,B,1419951600,"[dfs and similar, dsu, graphs, greedy, math, sortings]",PROGRAMMING +500,Good Bye 2014,12,New Year Book Reading,1000.0,C,1419951600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +500,Good Bye 2014,12,New Year Santa Network,1500.0,D,1419951600,"[combinatorics, dfs and similar, graphs, trees]",PROGRAMMING +500,Good Bye 2014,12,New Year Domino,2750.0,E,1419951600,"[data structures, dp, dsu]",PROGRAMMING +500,Good Bye 2014,12,New Year Shopping,2750.0,F,1419951600,"[divide and conquer, dp]",PROGRAMMING +500,Good Bye 2014,12,New Year Running,3500.0,G,1419951600,"[number theory, trees]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Crazy Town,500.0,A,1419438600,[geometry],PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Name That Tune,2000.0,B,1419438600,"[dp, probabilities, two pointers]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Array and Operations,1000.0,C,1419438600,"[flows, graph matchings, number theory]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Traffic Jams in the Land,2000.0,D,1419438600,"[data structures, dp, number theory]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Stairs and Lines,2500.0,E,1419438600,"[dp, matrices]",PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Watching a movie,500.0,A,1419438600,[implementation],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Lecture,500.0,B,1419438600,[strings],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Crazy Town,1500.0,C,1419438600,[math],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Name That Tune,3000.0,D,1419438600,[],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Array and Operations,3000.0,E,1419438600,[],PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Minimum Difficulty,500.0,A,1418833800,"[brute force, implementation, math]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Secret Combination,1000.0,B,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Removing Columns,1750.0,C,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Tennis Game,2250.0,D,1418833800,[binary search],PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Distributing Parts ,2250.0,E,1418833800,"[greedy, sortings]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Removing Columns,750.0,A,1418833800,[greedy],PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Tennis Game,1250.0,B,1418833800,"[binary search, brute force, implementation]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Distributing Parts ,1250.0,C,1418833800,"[data structures, greedy, implementation, sortings, two pointers]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Gears,2000.0,D,1418833800,"[brute force, geometry, math]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Subsequences Return,2500.0,E,1418833800,"[dp, matrices]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Treasure,500.0,A,1418488200,[greedy],PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Obsessive String,1000.0,B,1418488200,"[dp, strings]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Helping People,1750.0,C,1418488200,"[dp, probabilities]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Birthday,1750.0,D,1418488200,"[data structures, dfs and similar, dp, trees]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Sharti,2500.0,E,1418488200,[games],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Digital Counter,500.0,A,1418488200,[implementation],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Modular Equations,1000.0,B,1418488200,[math],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Treasure,1500.0,C,1418488200,[implementation],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Obsessive String,2000.0,D,1418488200,"[binary search, dp, strings]",PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Helping People,2750.0,E,1418488200,[],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Football,500.0,A,1417618800,[implementation],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Wrestling,1000.0,B,1417618800,[implementation],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Basketball,2000.0,C,1417618800,"[binary search, brute force, data structures, implementation, sortings, two pointers]",PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Chess,1500.0,D,1417618800,"[constructive algorithms, games]",PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Polynomial,3000.0,E,1417618800,[math],PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Cubes,500.0,A,1417451400,[implementation],PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Lanterns,1000.0,B,1417451400,"[binary search, math, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Exams,1500.0,C,1417451400,"[greedy, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Computer Game,2000.0,D,1417451400,"[binary search, implementation, math, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Field,2500.0,E,1417451400,[math],PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Team Olympiad,500.0,A,1416733800,"[greedy, implementation, sortings]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Queue,1000.0,B,1416733800,"[dsu, implementation]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Hacking Cypher,1500.0,C,1416733800,"[brute force, math, strings]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Chocolate,2000.0,D,1416733800,"[brute force, dfs and similar, math, meet-in-the-middle, number theory]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Restoring Increasing Sequence,2000.0,E,1416733800,"[binary search, brute force, greedy, implementation]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Treeland Tour,2500.0,F,1416733800,"[data structures, dfs and similar, dp, trees]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Fight the Monster,500.0,A,1416590400,"[binary search, brute force]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Strip,1500.0,B,1416590400,"[binary search, data structures, dp, two pointers]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Prefix Product Sequence,1500.0,C,1416590400,"[constructive algorithms, number theory]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Conveyor Belts,2000.0,D,1416590400,[data structures],PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Tourists,2500.0,E,1416590400,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Giga Tower,500.0,A,1416590400,[brute force],PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Candy Boxes,1500.0,B,1416590400,"[brute force, constructive algorithms]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Fight the Monster,1500.0,C,1416590400,[brute force],PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Strip,2500.0,D,1416590400,"[data structures, dp, two pointers]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Prefix Product Sequence,2500.0,E,1416590400,"[constructive algorithms, math]",PROGRAMMING +491,Testing Round #11,12,Up the hill,500.0,A,1416519000,[implementation],PROGRAMMING +491,Testing Round #11,12,New York Hotel,1000.0,B,1416519000,"[greedy, math]",PROGRAMMING +491,Testing Round #11,12,Deciphering,1500.0,C,1416519000,"[flows, graph matchings]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,SwapSort,500.0,A,1416238500,"[implementation, sortings]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,BerSU Ball,1000.0,B,1416238500,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Given Length and Sum of Digits...,1500.0,C,1416238500,"[dp, greedy, implementation]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Unbearable Controversy of Being,2000.0,D,1416238500,"[brute force, combinatorics, dfs and similar, graphs]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Hiking,2500.0,E,1416238500,"[binary search, dp]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Special Matrices,2500.0,F,1416238500,"[combinatorics, dp]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Calculating Function,500.0,A,1415718000,"[implementation, math]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,OR in Matrix,1000.0,B,1415718000,"[greedy, hashing, implementation]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Palindrome Transformation,1500.0,C,1415718000,"[greedy, implementation]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Valid Sets,2000.0,D,1415718000,"[dfs and similar, dp, math, trees]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,LIS of Sequence,2500.0,E,1415718000,"[data structures, dp, greedy, hashing, math]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Bits,500.0,A,1415205000,"[bitmasks, constructive algorithms]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Maximum Value,1000.0,B,1415205000,"[binary search, math, sortings, two pointers]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Strange Sorting,3000.0,C,1415205000,"[implementation, math]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Kindergarten,2000.0,D,1415205000,"[data structures, dp, greedy]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Sign on Fence,3000.0,E,1415205000,"[binary search, constructive algorithms, data structures]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Factory,1000.0,A,1415205000,"[implementation, math, matrices]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Valuable Resources,500.0,B,1415205000,"[brute force, greedy]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Bits,1500.0,C,1415205000,"[implementation, math]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Maximum Value,3000.0,D,1415205000,"[binary search, sortings]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Strange Sorting,3000.0,E,1415205000,[],PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Diverse Permutation,500.0,A,1414170000,"[constructive algorithms, greedy]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Interesting Array,1500.0,B,1414170000,"[constructive algorithms, data structures, trees]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Game with Strings,1500.0,C,1414170000,"[bitmasks, dp, probabilities]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Random Function and Tree,2000.0,D,1414170000,"[combinatorics, dp, trees]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,ELCA,2500.0,E,1414170000,"[data structures, trees]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Counterexample ,500.0,A,1414170000,"[brute force, implementation]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Friends and Presents,1000.0,B,1414170000,"[binary search, math]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Diverse Permutation,1500.0,C,1414170000,"[constructive algorithms, implementation]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Interesting Array,2500.0,D,1414170000,[data structures],PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Game with Strings,2500.0,E,1414170000,[],PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Expression,500.0,A,1413709200,"[brute force, math]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Towers,1000.0,B,1413709200,"[brute force, greedy, implementation, sortings]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Exams,1500.0,C,1413709200,"[greedy, sortings]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Long Jumps,2000.0,D,1413709200,"[binary search, greedy, implementation]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Riding in a Lift,2500.0,E,1413709200,[dp],PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Exams,500.0,A,1413709200,"[greedy, sortings]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Long Jumps,1000.0,B,1413709200,"[binary search, greedy, hashing, implementation, sortings]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Riding in a Lift,1500.0,C,1413709200,"[dp, implementation]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Parcels,2000.0,D,1413709200,"[dp, graphs]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Parking Lot,2500.0,E,1413709200,"[data structures, divide and conquer]",PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Initial Bet,500.0,A,1413474000,[implementation],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Random Teams,1000.0,B,1413474000,"[combinatorics, constructive algorithms, greedy, math]",PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Table Decorations,1500.0,C,1413474000,[greedy],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Red-Green Towers,2000.0,D,1413474000,[dp],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Wavy numbers,2500.0,E,1413474000,"[brute force, dfs and similar, meet-in-the-middle, sortings]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Stairs,500.0,A,1413122400,"[implementation, math]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and WiFi,1500.0,B,1413122400,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sums,1500.0,C,1413122400,[math],PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sets,2000.0,D,1413122400,"[constructive algorithms, greedy, math]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Strings,2500.0,E,1413122400,"[dp, strings]",PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sums,500.0,A,1413122400,[math],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sets,1000.0,B,1413122400,[math],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Strings,1500.0,C,1413122400,[dp],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Binary,2000.0,D,1413122400,"[dp, strings]",PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Notepad,3000.0,E,1413122400,[data structures],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Keyboard,500.0,A,1412609400,[implementation],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Worms,1000.0,B,1412609400,"[binary search, implementation]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Captain Marmot,1500.0,C,1412609400,"[brute force, geometry]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Flowers,2000.0,D,1412609400,[dp],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Pillars,3000.0,E,1412609400,"[binary search, data structures, dp, sortings, trees]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Ant colony,3000.0,F,1412609400,"[data structures, number theory]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Bayan Bus,500.0,A,1412514000,[implementation],PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Strongly Connected City,1000.0,B,1412514000,"[brute force, dfs and similar, graphs, implementation]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Kamal-ol-molk's Painting,1500.0,C,1412514000,"[brute force, constructive algorithms, greedy]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,CGCDSSQ,2000.0,D,1412514000,"[brute force, data structures, math]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Strongly Connected City 2,2500.0,E,1412514000,[dfs and similar],PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Meta-universe,2500.0,F,1412514000,[data structures],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from Math,500.0,A,1411918500,"[math, number theory]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from Life,1000.0,B,1411918500,[],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Make It Nondeterministic,1500.0,C,1411918500,[greedy],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Inverse the Problem,2000.0,D,1411918500,"[dfs and similar, dsu, shortest paths, trees]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from a Game,3000.0,E,1411918500,"[constructive algorithms, implementation]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Change the Goal,3000.0,F,1411918500,"[constructive algorithms, math, matrices]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Increase the Constraints,3500.0,G,1411918500,"[bitmasks, data structures, fft]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Sticks,500.0,A,1411745400,[implementation],PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Important Things,1000.0,B,1411745400,[sortings],PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and House of Cards,2000.0,C,1411745400,"[binary search, brute force, greedy, math]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Cube Walls,2000.0,D,1411745400,"[string suffix structures, strings]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Lots and Lots of Segments,2500.0,E,1411745400,"[data structures, dsu]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,24 Game,500.0,A,1411218000,"[constructive algorithms, greedy, math]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Two Sets,1000.0,B,1411218000,"[2-sat, dfs and similar, dsu, graph matchings, greedy]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Hack it!,1500.0,C,1411218000,"[binary search, constructive algorithms, math]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Tree,2000.0,D,1411218000,[graph matchings],PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Permanent,2500.0,E,1411218000,"[dp, graph matchings, math, meet-in-the-middle]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,I Wanna Be the Guy,500.0,A,1411218000,"[greedy, implementation]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Chat Online,1000.0,B,1411218000,[implementation],PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,24 Game,1500.0,C,1411218000,"[constructive algorithms, implementation]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Two Sets,2000.0,D,1411218000,"[2-sat, data structures, graph matchings, greedy]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Hack it!,2500.0,E,1411218000,[constructive algorithms],PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,George and Accommodation,500.0,A,1411054200,[implementation],PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Fedor and New Game,1000.0,B,1411054200,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,George and Job,1500.0,C,1411054200,"[dp, implementation]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Fedor and Essay,2000.0,D,1411054200,"[dfs and similar, dp, graphs, hashing, strings]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Alex and Complicated Task,2500.0,E,1411054200,"[data structures, dp, greedy]",PROGRAMMING +470,Surprise Language Round #7,12,Crystal Ball Sequence,,A,1410622200,"[*special, implementation]",PROGRAMMING +470,Surprise Language Round #7,12,Hexakosioihexekontahexaphobia,,B,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Eval,,C,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Caesar Cipher,,D,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Chessboard,,E,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Pairwise Sums,,F,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Hamming Distance,,G,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Array Sorting,,H,1410622200,[*special],PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Cheap Travel,500.0,A,1410535800,[implementation],PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Wonder Room,1000.0,B,1410535800,"[brute force, math]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Number of Ways,1500.0,C,1410535800,"[binary search, brute force, data structures, dp, two pointers]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Increase Sequence,2000.0,D,1410535800,"[combinatorics, dp]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Information Graph,2500.0,E,1410535800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,No to Palindromes!,500.0,A,1410103800,"[greedy, strings]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,Restore Cube ,1500.0,B,1410103800,"[brute force, geometry]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,Substitutes in Number,1500.0,C,1410103800,[dp],PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,World of Darkraft - 2,2000.0,D,1410103800,"[dp, probabilities]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,The Classic Problem,2500.0,E,1410103800,"[data structures, graphs, shortest paths]",PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,inc ARG,500.0,A,1410103800,[implementation],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Inbox (100500),1000.0,B,1410103800,[implementation],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,No to Palindromes!,1500.0,C,1410103800,[brute force],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Restore Cube ,2500.0,D,1410103800,[brute force],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Substitutes in Number,2500.0,E,1410103800,"[constructive algorithms, dp]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Sugar,500.0,A,1409383800,[implementation],PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Pylons,1000.0,B,1409383800,[math],PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Gargari and Bishops,1500.0,C,1409383800,"[greedy, hashing, implementation]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Gargari and Permutations,2000.0,D,1409383800,"[dfs and similar, dp, graphs]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Tree,2500.0,E,1409383800,"[brute force, dfs and similar, trees]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Toastman,500.0,A,1409061600,"[greedy, sortings]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Tree,1000.0,B,1409061600,"[dfs and similar, dp, trees]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and a Sheet of Paper,1500.0,C,1409061600,"[data structures, implementation]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Complicated Task,2000.0,D,1409061600,"[dsu, math]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and a Game,2500.0,E,1409061600,[shortest paths],PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Easy Task,500.0,A,1409061600,"[brute force, implementation]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Card Game,1000.0,B,1409061600,[greedy],PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Toastman,1500.0,C,1409061600,"[implementation, sortings]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Tree,2000.0,D,1409061600,"[dp, graphs]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and a Sheet of Paper,2500.0,E,1409061600,[],PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Vasya and Socks,500.0,A,1408548600,"[brute force, implementation, math]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Little Dima and Equation,1000.0,B,1408548600,"[brute force, implementation, math]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Present,1500.0,C,1408548600,"[binary search, data structures, greedy]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Little Victor and Set,2000.0,D,1408548600,"[brute force, constructive algorithms]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Roland and Rose,2500.0,E,1408548600,"[brute force, geometry, math, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Garden,500.0,A,1408116600,[implementation],PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Flowers,500.0,B,1408116600,"[combinatorics, implementation, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Buses,2000.0,C,1408116600,"[combinatorics, constructive algorithms, math]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Parmida's problem,2000.0,D,1408116600,"[data structures, divide and conquer, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Graph,3000.0,E,1408116600,"[dp, sortings]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Golden System,1000.0,A,1407690000,"[math, meet-in-the-middle]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Elections,1500.0,C,1407690000,[brute force],PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Bingo!,2000.0,D,1407690000,"[combinatorics, math, probabilities]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Flow Optimality,2500.0,E,1407690000,"[constructive algorithms, flows, math]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,An easy problem about trees,3000.0,F,1407690000,"[dp, games, greedy, trees]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Golden System,1000.0,A,1407690000,[math],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Elections,1500.0,C,1407690000,"[data structures, ternary search]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Bingo!,2000.0,D,1407690000,"[combinatorics, probabilities]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Flow Optimality,2500.0,E,1407690000,[],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,An easy problem about trees,3000.0,F,1407690000,[],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Boredom,500.0,A,1407511800,[dp],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,A Lot of Games,1000.0,B,1407511800,"[dfs and similar, dp, games, implementation, strings, trees]",PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Civilization,1500.0,C,1407511800,"[dfs and similar, dp, dsu, ternary search, trees]",PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Serega and Fun,2000.0,D,1407511800,[data structures],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Function,2500.0,E,1407511800,[data structures],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Laptops,500.0,A,1407511800,[sortings],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Fedya and Maths,1000.0,B,1407511800,"[math, number theory]",PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Boredom,1500.0,C,1407511800,[dp],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,A Lot of Games,2000.0,D,1407511800,"[dp, games, strings]",PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Civilization,2500.0,E,1407511800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Expected Maximum,500.0,A,1406907000,[probabilities],PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Harmony Chest,1000.0,B,1406907000,"[bitmasks, brute force, dp]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Summer Sun Celebration,1500.0,C,1406907000,"[constructive algorithms, dfs and similar]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Elements of Harmony,2500.0,D,1406907000,"[dp, matrices]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Lord Tirek,2500.0,E,1406907000,[data structures],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Crystal Mine,500.0,A,1406907000,[implementation],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Sort by Shift,1000.0,B,1406907000,[implementation],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Expected Maximum,1500.0,C,1406907000,"[combinatorics, math, probabilities]",PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Harmony Chest,2000.0,D,1406907000,"[bitmasks, dp]",PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Summer Sun Celebration,2500.0,E,1406907000,[dfs and similar],PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Eevee,500.0,A,1406480400,"[brute force, implementation, strings]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,4-point polyline,1000.0,B,1406480400,"[brute force, constructive algorithms, geometry, trees]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Magic Trick,1000.0,C,1406480400,"[combinatorics, math, probabilities]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,"Washer, Dryer, Folder",1500.0,D,1406480400,"[greedy, implementation]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Three strings,2500.0,E,1406480400,"[data structures, dsu, string suffix structures, strings]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Permutation,2500.0,F,1406480400,"[data structures, divide and conquer, hashing]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Game With Sticks,500.0,A,1406215800,[implementation],PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Sort the Array,1000.0,B,1406215800,"[implementation, sortings]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Predict Outcome of the Game,1500.0,C,1406215800,"[brute force, implementation, math]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Count Good Substrings,2500.0,D,1406215800,[math],PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Devu and Flowers,3000.0,E,1406215800,"[bitmasks, combinatorics, number theory]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Chocolate,500.0,A,1405774800,[math],PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Cities,1000.0,B,1405774800,"[graphs, shortest paths]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Apples,1500.0,C,1405774800,"[constructive algorithms, number theory]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Numbers,2000.0,D,1405774800,"[bitmasks, combinatorics, dp]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Squares,2500.0,E,1405774800,"[dp, math, number theory]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Children,500.0,A,1405774800,[implementation],PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Sequences,1000.0,B,1405774800,"[implementation, math]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Chocolate,1500.0,C,1405774800,"[greedy, implementation]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Cities,2000.0,D,1405774800,"[graphs, shortest paths]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Apples,2500.0,E,1405774800,"[constructive algorithms, number theory]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Rewards,500.0,A,1405605600,[implementation],PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Suffix Structures,1000.0,B,1405605600,"[implementation, strings]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Painting Fence,2500.0,C,1405605600,"[divide and conquer, dp, greedy]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Multiplication Table,2000.0,D,1405605600,"[binary search, brute force]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Divisors,3000.0,E,1405605600,"[brute force, dfs and similar, implementation, number theory]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Sequences,500.0,A,1405256400,"[dp, implementation, two pointers]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Modification,1500.0,B,1405256400,"[brute force, greedy]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Fibonacci Numbers,1500.0,C,1405256400,"[data structures, number theory]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Games,2000.0,D,1405256400,"[math, matrices, probabilities]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Bridges,2500.0,E,1405256400,"[math, matrices]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Hash,500.0,A,1405256400,[implementation],PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Strings,1000.0,B,1405256400,"[greedy, implementation]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Sequences,1500.0,C,1405256400,[dp],PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Modification,2500.0,D,1405256400,"[data structures, greedy]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Fibonacci Numbers,2500.0,E,1405256400,[data structures],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Physics,500.0,A,1404651900,"[greedy, math]",PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves FFT,1000.0,B,1404651900,[probabilities],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Colors,2000.0,C,1404651900,[data structures],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Strings,2000.0,D,1404651900,"[binary search, hashing, strings, two pointers]",PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Planting,2500.0,E,1404651900,"[binary search, dsu, trees]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Chessboard,500.0,A,1404651900,"[dfs and similar, implementation]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Chemistry,1000.0,B,1404651900,"[dfs and similar, dsu, greedy]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Physics,1500.0,C,1404651900,"[graphs, greedy]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves FFT,2000.0,D,1404651900,[probabilities],PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Colors,3000.0,E,1404651900,[data structures],PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Borya and Hanabi,500.0,A,1403191800,"[bitmasks, brute force, implementation]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Andrey and Problem,1500.0,B,1403191800,"[greedy, math, probabilities]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Artem and Array ,1500.0,C,1403191800,"[data structures, greedy]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Adam and Tree,2000.0,D,1403191800,"[data structures, trees]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Gena and Second Distance,2500.0,E,1403191800,[geometry],PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Anton and Letters,500.0,A,1403191800,"[constructive algorithms, implementation]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Kolya and Tandem Repeat,1000.0,B,1403191800,[brute force],PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Borya and Hanabi,1500.0,C,1403191800,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Andrey and Problem,2500.0,D,1403191800,"[dp, greedy, math, probabilities, sortings]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Artem and Array ,2500.0,E,1403191800,[],PROGRAMMING +436,Zepto Code Rush 2014,12,Feed with Candy,1000.0,A,1402673400,[greedy],PROGRAMMING +436,Zepto Code Rush 2014,12,Om Nom and Spiders,1000.0,B,1402673400,"[implementation, math]",PROGRAMMING +436,Zepto Code Rush 2014,12,Dungeons and Candies,1500.0,C,1402673400,"[dsu, graphs, greedy, trees]",PROGRAMMING +436,Zepto Code Rush 2014,12,Pudding Monsters,2500.0,D,1402673400,[dp],PROGRAMMING +436,Zepto Code Rush 2014,12,Cardboard Box,2500.0,E,1402673400,"[data structures, greedy]",PROGRAMMING +436,Zepto Code Rush 2014,12,Banners,3000.0,F,1402673400,"[brute force, data structures, dp]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Antique Items,500.0,A,1402241400,[implementation],PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Fruits,1000.0,B,1402241400,"[greedy, implementation]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Tubes ,1500.0,C,1402241400,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Swaps,2000.0,D,1402241400,"[constructive algorithms, dsu, graphs, implementation, string suffix structures]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Number,2500.0,E,1402241400,"[bitmasks, dp]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,"Devu, the Singer and Churu, the Joker",500.0,A,1401895800,"[greedy, implementation]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,"Devu, the Dumb Guy",1000.0,B,1401895800,"[implementation, sortings]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and Partitioning of the Array,1500.0,C,1401895800,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and his Brother,2000.0,D,1401895800,"[binary search, sortings, ternary search, two pointers]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and Birthday Celebration,2500.0,E,1401895800,"[combinatorics, dp, math]",PROGRAMMING +440,Testing Round #10,12,Forgotten Episode,500.0,A,1401809400,[implementation],PROGRAMMING +440,Testing Round #10,12,Balancer,1000.0,B,1401809400,[implementation],PROGRAMMING +440,Testing Round #10,12,One-Based Arithmetic,1500.0,C,1401809400,"[dfs and similar, divide and conquer]",PROGRAMMING +440,Testing Round #10,12,Berland Federalization,2000.0,D,1401809400,"[dp, trees]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Homework,500.0,A,1401627600,[implementation],PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Set,1500.0,B,1401627600,"[bitmasks, greedy, implementation, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Toy,1500.0,C,1401627600,"[graphs, greedy, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Zoo,2000.0,D,1401627600,"[dsu, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Polygon,2500.0,E,1401627600,[],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Toy,500.0,A,1401627600,[greedy],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Zoo,1000.0,B,1401627600,"[dp, dsu, sortings]",PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Polygon,1500.0,C,1401627600,"[dp, geometry]",PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Sequence,2000.0,D,1401627600,[data structures],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Binary Tree,3000.0,E,1401627600,"[combinatorics, divide and conquer, fft, number theory]",PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Queue on Bus Stop,500.0,A,1401463800,[implementation],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Pasha Maximizes,1000.0,B,1401463800,[greedy],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Cardiogram,1500.0,C,1401463800,[implementation],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Special Grid,2000.0,D,1401463800,"[brute force, dp, greedy]",PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Special Graph,2500.0,E,1401463800,[],PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Kitahara Haruki's Gift,500.0,A,1400914800,"[brute force, implementation]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Kuriyama Mirai's Stones,1500.0,B,1400914800,"[dp, implementation, sortings]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Ryouko's Memory Note,1500.0,C,1400914800,"[implementation, math, sortings]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Nanami's Digital Board,2000.0,D,1400914800,"[dsu, implementation]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Tachibana Kanade's Tofu,2500.0,E,1400914800,[dp],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Ryouko's Memory Note,500.0,A,1400914800,"[math, sortings]",PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Nanami's Digital Board,1000.0,B,1400914800,"[divide and conquer, dp, dsu, implementation, two pointers]",PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Tachibana Kanade's Tofu,1500.0,C,1400914800,[dp],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Nanami's Power Plant,2000.0,D,1400914800,[flows],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Furukawa Nagisa's Tree,3000.0,E,1400914800,"[binary search, divide and conquer, sortings, trees]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Black Square,500.0,A,1400686200,[implementation],PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Shower Line,1500.0,B,1400686200,"[brute force, implementation]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,k-Tree,1500.0,C,1400686200,"[dp, implementation, trees]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Random Task,2000.0,D,1400686200,"[binary search, bitmasks, combinatorics, dp, math]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Chemistry Experiment,2500.0,E,1400686200,"[binary search, data structures, ternary search]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Choosing Teams,500.0,A,1400167800,"[greedy, implementation, sortings]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Football Kit,1000.0,B,1400167800,"[brute force, greedy, implementation]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Prime Swaps,1500.0,C,1400167800,"[greedy, sortings]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Prefixes and Suffixes,2000.0,D,1400167800,"[dp, string suffix structures, strings, two pointers]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Square Tiling,2500.0,E,1400167800,"[constructive algorithms, greedy]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Xor-tree,500.0,A,1399822800,"[dfs and similar, trees]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Working out,1000.0,B,1399822800,[dp],PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Guess the Tree,1500.0,C,1399822800,"[bitmasks, constructive algorithms, dp, greedy, trees]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Tricky Function,2000.0,D,1399822800,"[data structures, divide and conquer, geometry]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Points and Segments,2000.0,E,1399822800,[graphs],PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Points and Segments (easy),500.0,A,1399822800,"[constructive algorithms, sortings]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Balls Game,1000.0,B,1399822800,"[brute force, two pointers]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Xor-tree,1500.0,C,1399822800,"[brute force, data structures, dfs and similar, trees]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Working out,2000.0,D,1399822800,"[brute force, dp]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Guess the Tree,2500.0,E,1399822800,"[constructive algorithms, data structures, dfs and similar]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Police Recruits,500.0,A,1399044600,[implementation],PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Prison Transfer,1000.0,B,1399044600,"[data structures, implementation]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Checkposts,1500.0,C,1399044600,"[dfs and similar, graphs, two pointers]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Match & Catch,2000.0,D,1399044600,"[dp, string suffix structures, strings]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Police Patrol,2500.0,E,1399044600,"[greedy, implementation, math, ternary search]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Swaps,500.0,A,1398612600,"[brute force, sortings]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Table ,1000.0,B,1398612600,"[bitmasks, greedy]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Two Sequences,1500.0,C,1398612600,"[data structures, dp]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Squares,2000.0,D,1398612600,"[binary search, data structures, hashing]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Sets,2000.0,E,1398612600,[dp],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Mugs,500.0,A,1398612600,[implementation],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Mirroring,1000.0,B,1398612600,[implementation],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Swaps,1500.0,C,1398612600,"[brute force, sortings, two pointers]",PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Table ,2000.0,D,1398612600,[],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Two Sequences,2500.0,E,1398612600,[],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Squats,500.0,A,1398409200,[implementation],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Megacity,1000.0,B,1398409200,"[binary search, greedy, implementation, sortings]",PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Magic Formulas,1500.0,C,1398409200,[math],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Biathlon Track,2500.0,D,1398409200,"[binary search, brute force, constructive algorithms, data structures, dp]",PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Colored Jenga,3000.0,E,1398409200,"[dfs and similar, dp, probabilities]",PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Start Up,500.0,A,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Online Meeting,1500.0,B,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Bug in Code,1500.0,C,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Cup Trick,1500.0,D,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Playing the ball,2000.0,E,1398169200,[],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Start Up,500.0,A,1398169140,[implementation],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Online Meeting,1500.0,B,1398169140,[implementation],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Bug in Code,1500.0,C,1398169140,"[data structures, graphs, implementation, two pointers]",PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Cup Trick,1500.0,D,1398169140,[data structures],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Playing the ball,2000.0,E,1398169140,[geometry],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Pasha and Hamsters,500.0,A,1398168900,"[constructive algorithms, implementation]",PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Start Up,1000.0,B,1398168900,[implementation],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Online Meeting,2000.0,C,1398168900,[implementation],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Bug in Code,2000.0,D,1398168900,"[binary search, data structures, sortings]",PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Cup Trick,2000.0,E,1398168900,[data structures],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Data Recovery,500.0,A,1397977200,[implementation],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Spyke Chatting,1000.0,B,1397977200,[implementation],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Jeopardy!,1500.0,C,1397977200,"[greedy, math]",PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,2048,2000.0,D,1397977200,"[bitmasks, dp]",PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Maze 2D,2500.0,E,1397977200,"[data structures, divide and conquer]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Poster,500.0,A,1397837400,"[greedy, implementation]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Network Configuration,1000.0,B,1397837400,"[greedy, sortings]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Pattern,1500.0,C,1397837400,"[implementation, strings]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Giving Awards,2000.0,D,1397837400,[dfs and similar],PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,E-mail Addresses,2500.0,E,1397837400,[implementation],PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Elimination,500.0,A,1397749200,"[dp, implementation, math]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Crash,1000.0,B,1397749200,[implementation],PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Football,1500.0,C,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Cunning Gena,2000.0,D,1397749200,"[bitmasks, dp, greedy, sortings]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Square Table,2500.0,E,1397749200,"[constructive algorithms, math, probabilities]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Football,500.0,A,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Cunning Gena,1000.0,B,1397749200,"[bitmasks, dp, sortings]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Square Table,1500.0,C,1397749200,"[constructive algorithms, dp, math]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Big Problems for Organizers,2500.0,D,1397749200,"[data structures, graphs, trees]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Tricky Password,2500.0,E,1397749200,[data structures],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Password Check,,A,1397505600,[implementation],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Multi-core Processor,,B,1397505600,[implementation],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Kicker,,C,1397505600,[implementation],PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Guess a number!,500.0,A,1397376000,"[greedy, implementation, two pointers]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Art Union,1000.0,B,1397376000,"[brute force, dp, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Booking System,1500.0,C,1397376000,"[binary search, dp, greedy, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Population Size,2000.0,D,1397376000,"[greedy, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,President's Path,2500.0,E,1397376000,"[dp, graphs, shortest paths]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Numbers,500.0,A,1396798800,"[constructive algorithms, number theory]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and ACM,1000.0,B,1396798800,"[combinatorics, dp]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Reverse Operation,1500.0,C,1396798800,"[combinatorics, divide and conquer]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Water Tanks,1500.0,D,1396798800,"[binary search, data structures, greedy, two pointers]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh's Designed Problem,2500.0,E,1396798800,[data structures],PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Lights,500.0,A,1396798800,[implementation],PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Tokens,1000.0,B,1396798800,"[binary search, greedy, math]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Numbers,1500.0,C,1396798800,"[constructive algorithms, greedy, number theory]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and ACM,2000.0,D,1396798800,"[combinatorics, dp, number theory]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Reverse Operation,2500.0,E,1396798800,"[divide and conquer, sortings]",PROGRAMMING +409,April Fools Day Contest 2014,12,The Great Game,,A,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Mysterious Language,,B,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Magnum Opus,,C,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Big Data,,D,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Dome,,E,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,000001,,F,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,On a plane,,G,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,A + B Strikes Back,,H,1396366200,"[*special, brute force, constructive algorithms, dsu, implementation]",PROGRAMMING +409,April Fools Day Contest 2014,12,Feed the Golorp,,I,1396366200,[*special],PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Triangle,500.0,A,1396162800,"[brute force, implementation, math]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Long Path,1000.0,B,1396162800,"[dp, implementation]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Curious Array,2000.0,C,1396162800,"[brute force, implementation, math]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Largest Submatrix 3,2000.0,D,1396162800,"[dp, hashing]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,k-d-sequence,2500.0,E,1396162800,[data structures],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Line to Cashier,500.0,A,1396162800,[implementation],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Garland,1000.0,B,1396162800,[implementation],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Triangle,1500.0,C,1396162800,"[geometry, math]",PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Long Path,2000.0,D,1396162800,[dp],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Curious Array,3000.0,E,1396162800,[],PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Gravity Flip,500.0,A,1395502200,"[greedy, implementation, sortings]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Domino Effect,1000.0,B,1395502200,[],PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Unusual Product,1500.0,C,1395502200,"[implementation, math]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Toy Sum,2000.0,D,1395502200,"[greedy, implementation, math]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Graph Cutting,3000.0,E,1395502200,[dfs and similar],PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Unusual Product,500.0,A,1395502200,"[implementation, math]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Toy Sum,1000.0,B,1395502200,"[constructive algorithms, greedy]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Graph Cutting,2000.0,C,1395502200,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Hill Climbing,2000.0,D,1395502200,"[dfs and similar, geometry, trees]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Hamming Triples,2500.0,E,1395502200,"[implementation, math]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Valera and X,500.0,A,1395243000,[implementation],PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Marathon,1000.0,B,1395243000,"[implementation, math]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Restore Graph,1500.0,C,1395243000,"[dfs and similar, graphs, sortings]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Minesweeper 1D,2000.0,D,1395243000,"[dp, implementation]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Maze 1D,2500.0,E,1395243000,"[binary search, greedy, implementation]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Nuts,500.0,A,1394983800,"[greedy, math]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Trees in a Row,1000.0,B,1394983800,[brute force],PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Searching for Graph,1500.0,C,1394983800,"[brute force, constructive algorithms]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Upgrading Array,2000.0,D,1394983800,"[dp, greedy, math]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Strictly Positive Matrix,2500.0,E,1394983800,[graphs],PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Searching for Graph,500.0,A,1394983800,"[constructive algorithms, graphs]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Upgrading Array,1000.0,B,1394983800,"[dp, greedy, number theory]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Strictly Positive Matrix,1500.0,C,1394983800,[graphs],PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Beautiful Pairs of Numbers,1500.0,D,1394983800,"[combinatorics, dp]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Two Rooted Trees,2000.0,E,1394983800,"[data structures, implementation]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Vanya and Cards,500.0,A,1394465400,"[implementation, math]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Sereja and Contests,1000.0,B,1394465400,"[greedy, implementation, math]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Team,1500.0,C,1394465400,"[constructive algorithms, greedy, implementation]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Roman and Numbers,2000.0,D,1394465400,"[bitmasks, brute force, combinatorics, dp, number theory]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Olympic Games,2500.0,E,1394465400,[math],PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Choose Options,500.0,A,1394033400,"[dp, implementation]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and New Matrix of Candies,1000.0,B,1394033400,"[brute force, implementation, schedules]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Huge Candy Matrix,1500.0,C,1394033400,"[implementation, math]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Dima and Bacteria,2000.0,D,1394033400,"[dsu, graphs, shortest paths]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Binary Logic,2500.0,E,1394033400,"[binary search, bitmasks, data structures]",PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Cards,500.0,A,1393687800,[implementation],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Painting The Wall,1000.0,B,1393687800,"[dp, probabilities]",PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Tree and Array,1500.0,C,1393687800,[constructive algorithms],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Instant Messanger,2000.0,D,1393687800,[data structures],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Sorting Permutations,2500.0,E,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Pages,500.0,A,1393687800,[implementation],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Red and Blue Balls,1000.0,B,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Cards,1500.0,C,1393687800,[number theory],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Painting The Wall,2000.0,D,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Tree and Array,2500.0,E,1393687800,[],PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Number of Decompositions into Multipliers,500.0,A,1393428600,"[combinatorics, number theory]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Sum of Fractions,1000.0,B,1393428600,"[math, number theory]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Changing Tree,1500.0,C,1393428600,"[data structures, trees]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Sum of Number of Inversions in Permutations,2000.0,D,1393428600,[combinatorics],PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Iteration of One Well-Known Function,2500.0,E,1393428600,[],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Segment's Own Points,500.0,A,1393428600,[],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Corruption and Numbers,1000.0,B,1393428600,"[implementation, math]",PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Number of Decompositions into Multipliers,1500.0,C,1393428600,"[combinatorics, number theory]",PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Sum of Fractions,2000.0,D,1393428600,[math],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Changing Tree,2500.0,E,1393428600,"[data structures, trees]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Counting Sticks,500.0,A,1392910200,[implementation],PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Very Beautiful Number,1000.0,B,1392910200,[],PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Dominoes,1500.0,C,1392910200,"[constructive algorithms, greedy]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Physical Education and Buns,2000.0,D,1392910200,"[brute force, implementation, math]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Lightbulb for Minister,2500.0,E,1392910200,[geometry],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Blocked Points,500.0,A,1392728400,[math],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Tower of Hanoi,1000.0,B,1392728400,[dp],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Yet Another Number Sequence,1500.0,C,1392728400,"[combinatorics, math, matrices]",PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Three Arrays,2000.0,D,1392728400,[data structures],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Deleting Substrings,2500.0,E,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Nineteen,500.0,A,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Three matrices,1000.0,B,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Blocked Points,1500.0,C,1392728400,[geometry],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Tower of Hanoi,2000.0,D,1392728400,[dp],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Yet Another Number Sequence,2500.0,E,1392728400,[],PROGRAMMING +391,Rockethon 2014,12,Genetic Engineering,3.0,A,1392573600,"[implementation, two pointers]",PROGRAMMING +391,Rockethon 2014,12,Word Folding,5.0,B,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,The Tournament,4.0,C1,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,The Tournament,4.0,C2,1392573600,[greedy],PROGRAMMING +391,Rockethon 2014,12,The Tournament,8.0,C3,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Supercollider,3.0,D1,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,Supercollider,16.0,D2,1392573600,[data structures],PROGRAMMING +391,Rockethon 2014,12,Three Trees,11.0,E1,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Three Trees,13.0,E2,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,8.0,F1,1392573600,[dp],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,15.0,F2,1392573600,[greedy],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,10.0,F3,1392573600,[],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Alarm Clock,500.0,A,1392132600,[implementation],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,"Inna, Dima and Song",1000.0,B,1392132600,[implementation],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Candy Boxes,1500.0,C,1392132600,[data structures],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Sweet Matrix,2000.0,D,1392132600,[constructive algorithms],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Large Sweet Matrix,2500.0,E,1392132600,[],PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Box Accumulation,500.0,A,1391442000,"[greedy, sortings]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Minimal path,1000.0,B,1391442000,"[bitmasks, constructive algorithms, graphs, implementation, math]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Card Game,1500.0,C,1391442000,"[games, greedy, sortings]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Perfect Sets,2000.0,D,1391442000,[math],PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Meteor Shower,2500.0,E,1391442000,[geometry],PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Number Game,500.0,A,1391442000,"[greedy, math]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Cross,1000.0,B,1391442000,"[greedy, implementation]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Box Accumulation,1500.0,C,1391442000,"[binary search, dp, greedy]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Minimal path,2000.0,D,1391442000,"[constructive algorithms, graphs, implementation, shortest paths]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Card Game,2500.0,E,1391442000,"[greedy, implementation]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Sleep,500.0,A,1391095800,[implementation],PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Round,1000.0,B,1391095800,"[brute force, greedy, two pointers]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Number,1500.0,C,1391095800,"[greedy, implementation]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Interesting Graph,2000.0,D,1391095800,[graph matchings],PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Cards,2500.0,E,1391095800,"[binary search, data structures]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Raspberry,500.0,A,1390577700,"[brute force, greedy, implementation]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Strings,1000.0,B,1390577700,"[brute force, greedy, implementation, math, strings]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Prime Numbers,1500.0,C,1390577700,"[binary search, brute force, data structures, dp, implementation, math, number theory]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Floodlight,2000.0,D,1390577700,"[bitmasks, dp, geometry]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear in the Field,2500.0,E,1390577700,"[math, matrices]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Milking cows,500.0,A,1390231800,"[data structures, greedy]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Volcanoes,1500.0,B,1390231800,"[binary search, implementation, sortings, two pointers]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Propagating tree,1500.0,C,1390231800,"[data structures, dfs and similar, trees]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Antimatter,2000.0,D,1390231800,[dp],PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Vowels,2500.0,E,1390231800,"[combinatorics, divide and conquer, dp]",PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Coder,500.0,A,1390231800,[implementation],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Multitasking,1000.0,B,1390231800,"[greedy, implementation, sortings, two pointers]",PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Milking cows,1500.0,C,1390231800,[greedy],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Volcanoes,2500.0,D,1390231800,[implementation],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Propagating tree,2500.0,E,1390231800,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Pan Scales,500.0,A,1389972600,"[greedy, implementation]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Number Busters,2500.0,B,1389972600,"[binary search, math]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Arithmetic Progression,1500.0,C,1389972600,"[implementation, sortings]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Pawns,3000.0,D,1389972600,"[dfs and similar, graphs, implementation, trees]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Combinatorics,3000.0,E,1389972600,"[combinatorics, dp]",PROGRAMMING +386,Testing Round #9,12,Second-Price Auction,500.0,A,1389906900,[implementation],PROGRAMMING +386,Testing Round #9,12,"Fly, freebies, fly!",1000.0,B,1389906900,"[binary search, brute force, implementation]",PROGRAMMING +386,Testing Round #9,12,Diverse Substrings,1500.0,C,1389906900,"[dp, two pointers]",PROGRAMMING +386,Testing Round #9,12,Game with Points,2000.0,D,1389906900,"[dp, graphs, implementation, shortest paths]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Prefixes,500.0,A,1389540600,"[binary search, brute force]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Tree,1000.0,B,1389540600,"[graphs, implementation]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Brackets,1500.0,C,1389540600,"[data structures, schedules]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Cinema,2000.0,D,1389540600,"[combinatorics, math]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Dividing,2500.0,E,1389540600,[data structures],PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Dima,500.0,A,1389540600,"[greedy, implementation, two pointers]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Stairs,1000.0,B,1389540600,"[greedy, implementation, sortings]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Prefixes,1500.0,C,1389540600,"[binary search, implementation, two pointers]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Tree,2000.0,D,1389540600,[brute force],PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Brackets,2500.0,E,1389540600,[data structures],PROGRAMMING +379,Good Bye 2013,12,New Year Candles,500.0,A,1388417400,[implementation],PROGRAMMING +379,Good Bye 2013,12,New Year Present,1000.0,B,1388417400,"[constructive algorithms, implementation]",PROGRAMMING +379,Good Bye 2013,12,New Year Ratings Change,1500.0,C,1388417400,"[greedy, sortings]",PROGRAMMING +379,Good Bye 2013,12,New Year Letter,2000.0,D,1388417400,"[bitmasks, brute force, dp]",PROGRAMMING +379,Good Bye 2013,12,New Year Tree Decorations,2500.0,E,1388417400,"[geometry, schedules, sortings]",PROGRAMMING +379,Good Bye 2013,12,New Year Tree,3000.0,F,1388417400,"[data structures, divide and conquer, trees]",PROGRAMMING +379,Good Bye 2013,12,New Year Cactus,3500.0,G,1388417400,[dp],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Maze,500.0,A,1388331000,[dfs and similar],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Preparing for the Contest,1000.0,B,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Captains Mode,1000.0,C,1388331000,"[bitmasks, dp, games]",PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Developing Game,2000.0,D,1388331000,[data structures],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Cookie Clicker,2500.0,E,1388331000,"[dp, geometry]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Playing with Dice,500.0,A,1388331000,[brute force],PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Semifinals,1000.0,B,1388331000,"[implementation, sortings]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Maze,1500.0,C,1388331000,[dfs and similar],PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Preparing for the Contest,2000.0,D,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Captains Mode,2000.0,E,1388331000,"[bitmasks, brute force, dp, greedy]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Divisible by Seven,500.0,A,1387893600,"[math, number theory]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Maximum Submatrix 2,1000.0,B,1387893600,"[data structures, dp, implementation, sortings]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Circling Round Treasures,1500.0,C,1387893600,"[bitmasks, shortest paths]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Tree and Queries,2000.0,D,1387893600,"[data structures, dfs and similar, trees]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Red and Black Tree,2500.0,E,1387893600,"[dp, implementation, math]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Lever,500.0,A,1387893600,"[implementation, math]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,I.O.U.,1000.0,B,1387893600,[implementation],PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Divisible by Seven,1500.0,C,1387893600,"[math, number theory]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Maximum Submatrix 2,2000.0,D,1387893600,"[dp, implementation, sortings]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Circling Round Treasures,2500.0,E,1387893600,"[bitmasks, shortest paths]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Pink Pony,500.0,A,1387380600,"[greedy, implementation]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Nine,1000.0,B,1387380600,"[combinatorics, greedy]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Dima,1500.0,C,1387380600,"[dfs and similar, dp, graphs, implementation]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Sequence ,2000.0,D,1387380600,"[binary search, data structures, dp, trees]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Babies,2500.0,E,1387380600,"[binary search, data structures, dsu, geometry, implementation]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Counting Kangaroos is Fun,500.0,A,1386943200,"[binary search, greedy, sortings, two pointers]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Counting Rectangles is Fun,1000.0,B,1386943200,"[brute force, divide and conquer, dp]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Watching Fireworks is Fun,1500.0,C,1386943200,"[data structures, dp, math]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Choosing Subtree is Fun,2000.0,D,1386943200,"[binary search, data structures, dfs and similar, trees, two pointers]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Drawing Circles is Fun,2500.0,E,1386943200,"[combinatorics, geometry]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Collecting Beats is Fun,500.0,A,1386943200,[implementation],PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Making Sequences is Fun,1000.0,B,1386943200,"[binary search, implementation, math]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Counting Kangaroos is Fun,1500.0,C,1386943200,"[greedy, sortings, two pointers]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Counting Rectangles is Fun,2000.0,D,1386943200,[],PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Watching Fireworks is Fun,2500.0,E,1386943200,[dp],PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,K-Periodic Array,500.0,A,1386493200,"[implementation, math]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Fox Dividing Cheese,1000.0,B,1386493200,"[math, number theory]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Hamburgers,1500.0,C,1386493200,"[binary search, brute force]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Vessels,2000.0,D,1386493200,"[data structures, dsu, implementation, trees]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Subway Innovation,2500.0,E,1386493200,"[math, two pointers]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,"Rook, Bishop and King",500.0,A,1386399600,[math],PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Berland Bingo,500.0,B,1386399600,[implementation],PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Mittens,1500.0,C,1386399600,"[constructive algorithms, greedy, sortings]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Broken Monitor,3000.0,D,1386399600,"[brute force, constructive algorithms, implementation]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Summer Reading,3000.0,E,1386399600,"[dp, greedy]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Plates,500.0,A,1385739000,[implementation],PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Contest,1000.0,B,1385739000,"[constructive algorithms, implementation, math]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Elections,1500.0,C,1385739000,"[dfs and similar, graphs, trees]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Fools,2000.0,D,1385739000,"[dfs and similar, dp, shortest paths]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Queries,2500.0,E,1385739000,"[binary search, data structures]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Algorithm ,500.0,A,1385479800,"[data structures, implementation]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja ans Anagrams,1000.0,B,1385479800,"[binary search, data structures]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and the Arrangement of Numbers,1500.0,C,1385479800,"[graphs, greedy, sortings]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Sets,2000.0,D,1385479800,"[bitmasks, dfs and similar]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Intervals,2000.0,E,1385479800,"[combinatorics, dp]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Coat Rack,500.0,A,1385479800,[implementation],PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Suffixes,1000.0,B,1385479800,"[data structures, dp]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Algorithm ,1500.0,C,1385479800,"[brute force, implementation]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja ans Anagrams,2000.0,D,1385479800,"[data structures, two pointers]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and the Arrangement of Numbers,2500.0,E,1385479800,"[combinatorics, graphs, implementation]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Guards,500.0,A,1385307000,[implementation],PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and To-do List,1000.0,B,1385307000,"[brute force, implementation]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Salad,1500.0,C,1385307000,[dp],PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Trap Graph,2000.0,D,1385307000,"[binary search, data structures, dfs and similar, dsu, shortest paths, two pointers]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Magic Guitar,2500.0,E,1385307000,"[brute force, implementation, math]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Matrix,500.0,A,1384875000,"[combinatorics, data structures, implementation]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Free Market,1000.0,B,1384875000,"[dp, greedy]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Beautiful Set,1500.0,C,1384875000,"[brute force, number theory]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Ghd,2000.0,D,1384875000,"[brute force, math, probabilities]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Empty Rectangles,2500.0,E,1384875000,"[divide and conquer, two pointers]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Good Number,500.0,A,1384875000,[implementation],PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,The Fibonacci Segment,1000.0,B,1384875000,[implementation],PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Matrix,1500.0,C,1384875000,"[brute force, combinatorics, math, matrices]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Free Market,2000.0,D,1384875000,"[dp, greedy]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Beautiful Set,2500.0,E,1384875000,"[brute force, number theory]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Two Semiknights Meet,1000.0,A,1384443000,"[greedy, math]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Petya and Staircases,500.0,B,1384443000,"[implementation, sortings]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Insertion Sort,2500.0,C,1384443000,"[data structures, dp, implementation, math]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Fools and Foolproof Roads,3000.0,D,1384443000,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Petya and Pipes,3000.0,E,1384443000,"[flows, graphs, shortest paths]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Soroban,500.0,A,1384156800,[implementation],PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Fence,1000.0,B,1384156800,"[brute force, dp]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Fixing Typos,1500.0,C,1384156800,"[greedy, implementation]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Renting Bikes,2000.0,D,1384156800,"[binary search, greedy]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Two Circles,2500.0,E,1384156800,"[brute force, data structures, implementation]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Array Recovery,500.0,A,1384102800,"[greedy, implementation]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Array,1000.0,B,1384102800,"[binary search, dp]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Strings,1500.0,C,1384102800,"[combinatorics, dp]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Sets,1500.0,D,1384102800,[number theory],PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Game,2000.0,E,1384102800,"[graphs, greedy, shortest paths]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Table,500.0,A,1384102800,"[constructive algorithms, implementation]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Permutation,1000.0,B,1384102800,"[constructive algorithms, math, number theory]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Array Recovery,1500.0,C,1384102800,"[brute force, constructive algorithms, greedy]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Array,2000.0,D,1384102800,"[binary search, dp]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Strings,2500.0,E,1384102800,[],PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Table,500.0,A,1383379200,"[greedy, implementation]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Permutation,1000.0,B,1383379200,"[constructive algorithms, dp, math]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Prime Number,1500.0,C,1383379200,[math],PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Pair of Numbers,2500.0,D,1383379200,"[binary search, brute force, data structures, math, two pointers]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Neatness,2500.0,E,1383379200,[dfs and similar],PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Continuous Line,500.0,A,1382715000,"[brute force, implementation]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Text Messages,1000.0,B,1382715000,"[brute force, strings]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Containers,1500.0,C,1382715000,"[constructive algorithms, greedy, implementation]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Hares,2000.0,D,1382715000,"[dp, greedy]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Kicks,3000.0,E,1382715000,"[brute force, dsu, graphs, implementation]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Knight Tournament,500.0,A,1381838400,"[data structures, dsu]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Xenia and Hamming,1000.0,B,1381838400,"[implementation, math]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Compartments,1500.0,C,1381838400,"[combinatorics, constructive algorithms, greedy, implementation]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Bags and Coins,2000.0,D,1381838400,"[bitmasks, constructive algorithms, dp, greedy]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Xenia and String Problem,2500.0,E,1381838400,"[dp, hashing, implementation, string suffix structures, strings]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Group of Students,500.0,A,1381838400,"[brute force, greedy, implementation]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Flag Day,1000.0,B,1381838400,"[constructive algorithms, implementation]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Knight Tournament,1500.0,C,1381838400,[data structures],PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Xenia and Hamming,2000.0,D,1381838400,[number theory],PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Compartments,2500.0,E,1381838400,[],PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Vasya and Robot,500.0,A,1381678200,"[brute force, greedy, math]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Game with Strings,1000.0,B,1381678200,"[bitmasks, dp, games]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Vasya and Beautiful Arrays,1500.0,C,1381678200,"[brute force, dp, number theory]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Transferring Pyramid,2000.0,D,1381678200,[dp],PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Lucky Number Representation,2500.0,E,1381678200,"[constructive algorithms, dfs and similar, dp]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Digital Root,500.0,A,1381678200,"[constructive algorithms, implementation]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Public Transport,1000.0,B,1381678200,"[greedy, implementation]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Robot,1500.0,C,1381678200,"[brute force, dp]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Game with Strings,2000.0,D,1381678200,[],PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Beautiful Arrays,2500.0,E,1381678200,"[binary search, brute force, data structures]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Domino,500.0,A,1381419000,"[implementation, math]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Two Heaps,1500.0,B,1381419000,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Find Maximum,1000.0,C,1381419000,"[implementation, math, number theory]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Queue,2500.0,D,1381419000,[constructive algorithms],PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Antichain,3000.0,E,1381419000,"[dp, graph matchings, greedy]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Rounding,1000.0,A,1380900600,"[dp, greedy, implementation, math]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Furik,1000.0,B,1380900600,"[combinatorics, dp, probabilities]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Brackets,1500.0,C,1380900600,"[dp, matrices]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Removing Periods,2000.0,D,1380900600,[data structures],PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Permutation,2000.0,E,1380900600,[greedy],PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Digits,500.0,A,1380900600,"[brute force, implementation, math]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Periods,1000.0,B,1380900600,"[implementation, sortings]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Rounding,1500.0,C,1380900600,"[dp, greedy, implementation]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Furik,2000.0,D,1380900600,[math],PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Brackets,2500.0,E,1380900600,[],PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,TL,500.0,A,1380641400,"[brute force, greedy, implementation]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Resort,1000.0,B,1380641400,[graphs],PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Bombs,1000.0,C,1380641400,"[greedy, implementation, sortings]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Looking for Owls,3000.0,D,1380641400,"[binary search, geometry, hashing, sortings]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Wrong Floyd,3000.0,E,1380641400,"[brute force, constructive algorithms, dfs and similar, graphs]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Mafia,500.0,A,1380295800,"[binary search, math, sortings]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Apple Tree,1000.0,B,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Subset Sums,1500.0,C,1380295800,"[brute force, data structures]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Turtles,2000.0,D,1380295800,"[dp, matrices]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Pilgrims,2500.0,E,1380295800,"[dfs and similar, dp, trees]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Cinema Line,500.0,A,1380295800,"[greedy, implementation]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Color the Fence,1000.0,B,1380295800,"[data structures, dp, greedy]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Mafia,1500.0,C,1380295800,[implementation],PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Apple Tree,2000.0,D,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Subset Sums,2500.0,E,1380295800,[],PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Alice and Bob,500.0,A,1379691000,"[games, math, number theory]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Lucky Common Subsequence,1000.0,B,1379691000,"[dp, strings]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Number Transformation II,1500.0,C,1379691000,"[greedy, math]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Robot Control,2000.0,D,1379691000,[shortest paths],PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Doodle Jump,2500.0,E,1379691000,[math],PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Difference Row,500.0,A,1379691000,"[implementation, sortings]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Fixed Points,1000.0,B,1379691000,"[implementation, math]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Alice and Bob,1500.0,C,1379691000,"[games, math, number theory]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Lucky Common Subsequence,2000.0,D,1379691000,"[dp, strings]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Number Transformation II,2500.0,E,1379691000,"[dp, greedy, number theory]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Rational Resistance,500.0,A,1379172600,"[math, number theory]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Alternating Current,1000.0,B,1379172600,"[data structures, greedy, implementation]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Read Time,1500.0,C,1379172600,"[binary search, greedy, two pointers]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Water Tree,2000.0,D,1379172600,"[data structures, dfs and similar, trees]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Pumping Stations,2500.0,E,1379172600,"[brute force, dfs and similar, divide and conquer, flows, greedy]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Magnets,500.0,A,1379172600,[implementation],PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Simple Molecules,1000.0,B,1379172600,"[brute force, math]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Rational Resistance,1500.0,C,1379172600,[math],PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Alternating Current,2000.0,D,1379172600,"[data structures, greedy, implementation]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Read Time,2500.0,E,1379172600,"[binary search, two pointers]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Expecting Trouble,,A,1379086800,"[*special, probabilities]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Triskaidekaphobia,,B,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Counting Fridays,,C,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Chain Letter,,D,1379086800,"[*special, dfs and similar, graphs]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Black Cat Rush,,E,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Superstitions Inspection,,F,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Suffix Subgroup,,G,1379086800,"[*special, strings]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Divisors,500.0,A,1378540800,"[greedy, implementation]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Spies,1000.0,B,1378540800,"[brute force, greedy, implementation]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Cupboard and Balloons,1500.0,C,1378540800,[geometry],PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Dominoes,2000.0,D,1378540800,"[bitmasks, dfs and similar, dp]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Tree,2500.0,E,1378540800,"[data structures, divide and conquer, trees]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,The Wall,500.0,A,1377876600,[math],PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Maximal Area Quadrilateral,3000.0,B,1377876600,"[brute force, geometry]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Tourist Problem,2000.0,C,1377876600,"[combinatorics, implementation, math]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Bubble Sort Graph,2000.0,D,1377876600,"[binary search, data structures, dp]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Iahub and Permutations,3000.0,E,1377876600,"[combinatorics, math]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Tourist Problem,500.0,A,1377876600,[math],PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Bubble Sort Graph,500.0,B,1377876600,"[binary search, data structures, dp]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Iahub and Permutations,1000.0,C,1377876600,"[combinatorics, dp, math]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Iahub and Xors,2500.0,D,1377876600,[data structures],PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Candies Game,3000.0,E,1377876600,"[constructive algorithms, greedy]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Helpful Maths,500.0,A,1377531000,"[greedy, implementation, sortings, strings]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Ringroad,1000.0,B,1377531000,[implementation],PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Weights,1500.0,C,1377531000,"[constructive algorithms, dfs and similar, dp, greedy]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Bit Operations,2000.0,D,1377531000,"[data structures, trees]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Three Swaps,3000.0,E,1377531000,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Puzzles,500.0,A,1376668800,"[dp, graph matchings, greedy]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Routine Problem,1000.0,B,1376668800,"[greedy, math, number theory]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Quiz,1500.0,C,1376668800,"[binary search, greedy, math, matrices, number theory]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Book of Evil,2000.0,D,1376668800,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Divisor Tree,2500.0,E,1376668800,"[brute force, number theory, trees]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Quiz,500.0,A,1376668800,"[greedy, math, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Book of Evil,1000.0,B,1376668800,"[dfs and similar, dp, trees]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Divisor Tree,1500.0,C,1376668800,"[brute force, dp, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,GCD Table,2000.0,D,1376668800,"[chinese remainder theorem, math, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Optimize!,2500.0,E,1376668800,[data structures],PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Triangle,500.0,A,1376062200,"[implementation, math]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Fly,1000.0,B,1376062200,[math],PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Sequence,1500.0,C,1376062200,"[brute force, greedy, implementation, number theory]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Beautiful Strings,2000.0,D,1376062200,"[combinatorics, math]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Painting Square,2500.0,E,1376062200,"[bitmasks, combinatorics, dp, implementation]",PROGRAMMING +326,MemSQL start[c]up Round 2,12,Banana,500.0,A,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Palindrome,1000.0,B,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,More Reclamation,1000.0,C,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Rectangles and Square,2000.0,D,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Counting Skyscrapers,2500.0,E,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,"Buy One, Get One Free",3000.0,F,1375549200,[],PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Banana,500.0,A,1375549200,"[binary search, constructive algorithms, greedy]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Palindrome,1000.0,B,1375549200,"[constructive algorithms, dp]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,More Reclamation,1000.0,C,1375549200,[games],PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Rectangles and Square,2000.0,D,1375549200,"[brute force, dp]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Counting Skyscrapers,2500.0,E,1375549200,"[dp, math, probabilities]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,"Buy One, Get One Free",3000.0,F,1375549200,"[dp, greedy]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Secrets,500.0,A,1374913800,[greedy],PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Chips,1000.0,B,1374913800,[greedy],PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Lucky Tickets,1500.0,C,1374913800,"[brute force, constructive algorithms]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Characteristics of Rectangles,2000.0,D,1374913800,"[binary search, bitmasks, brute force, implementation, sortings]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Summer Earnings,2500.0,E,1374913800,"[binary search, bitmasks, brute force, geometry, sortings]",PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Candy Bags,500.0,A,1374913800,[implementation],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Eight Point Sets,1000.0,B,1374913800,[sortings],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Secrets,1500.0,C,1374913800,[math],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Chips,2000.0,D,1374913800,"[greedy, implementation, two pointers]",PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Lucky Tickets,2500.0,E,1374913800,[],PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Down the Hatch!,500.0,A,1374679800,[implementation],PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Maximum Absurdity,1000.0,B,1374679800,"[data structures, dp, implementation]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Students' Revenge,3000.0,C,1374679800,"[data structures, greedy, sortings]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Theft of Blueprints,3000.0,D,1374679800,"[graphs, math]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Binary Key,3000.0,E,1374679800,"[dp, greedy, implementation]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Purification,500.0,A,1374327000,"[constructive algorithms, greedy]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Biridian Forest,1000.0,B,1374327000,"[dfs and similar, shortest paths]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Graph Reconstruction,1500.0,C,1374327000,[constructive algorithms],PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,The Evil Temple and the Moving Rocks,1500.0,D,1374327000,[constructive algorithms],PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Evil,2500.0,E,1374327000,[math],PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Cakeminator,500.0,A,1374327000,"[brute force, implementation]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Road Construction,1000.0,B,1374327000,"[constructive algorithms, graphs]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Purification,1500.0,C,1374327000,[matrices],PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Biridian Forest,2000.0,D,1374327000,"[dfs and similar, implementation, shortest paths]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Graph Reconstruction,2500.0,E,1374327000,[],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,30.0,A1,1374075000,"[brute force, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,70.0,A2,1374075000,"[data structures, sortings]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,30.0,B1,1374075000,[implementation],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,70.0,B2,1374075000,[data structures],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C1,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C2,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,60.0,C3,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D1,1374075000,"[dfs and similar, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D2,1374075000,[graphs],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,40.0,D3,1374075000,"[data structures, implementation, trees]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E1,1374075000,"[constructive algorithms, graphs, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E2,1374075000,"[constructive algorithms, dp]",PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,30.0,A1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,70.0,A2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,30.0,B1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,70.0,B2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,60.0,C3,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,40.0,D3,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E2,1374043200,[],PROGRAMMING +325,MemSQL start[c]up Round 1,12,Square and Rectangles,500.0,A,1373734800,[implementation],PROGRAMMING +325,MemSQL start[c]up Round 1,12,Stadium and Games,1000.0,B,1373734800,"[binary search, math]",PROGRAMMING +325,MemSQL start[c]up Round 1,12,Monsters and Diamonds,2000.0,C,1373734800,"[dfs and similar, shortest paths]",PROGRAMMING +325,MemSQL start[c]up Round 1,12,Reclamation,2000.0,D,1373734800,[dsu],PROGRAMMING +325,MemSQL start[c]up Round 1,12,The Red Button,2500.0,E,1373734800,"[combinatorics, dfs and similar, dsu, greedy]",PROGRAMMING +328,Testing Round #8,12,IQ Test,500.0,A,1373662800,[implementation],PROGRAMMING +328,Testing Round #8,12,Sheldon and Ice Pieces,500.0,B,1373662800,[greedy],PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Flipping Game,500.0,A,1372941000,"[brute force, dp, implementation]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Hungry Sequence,500.0,B,1372941000,[math],PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Magic Five,1500.0,C,1372941000,"[combinatorics, math]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Block Tower,2000.0,D,1372941000,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Axis Walking,3000.0,E,1372941000,"[bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Robot,500.0,A,1372433400,"[binary search, implementation, math]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Duel,1000.0,B,1372433400,"[dp, flows, greedy]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel the Commander,1500.0,C,1372433400,"[constructive algorithms, dfs and similar, divide and conquer, greedy, trees]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Flipboard,2000.0,D,1372433400,"[dp, greedy, math]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Gondolas,2500.0,E,1372433400,"[data structures, divide and conquer, dp]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Dancing,500.0,A,1372433400,[greedy],PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Flowers,1000.0,B,1372433400,"[combinatorics, math]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Robot,1500.0,C,1372433400,"[implementation, math, number theory]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Duel,2000.0,D,1372433400,"[dp, flows, greedy, two pointers]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel the Commander,2500.0,E,1372433400,[divide and conquer],PROGRAMMING +323,Testing Round #7,12,Black-and-White Cube,500.0,A,1372363200,"[combinatorics, constructive algorithms]",PROGRAMMING +323,Testing Round #7,12,Tournament-graph,1000.0,B,1372363200,[constructive algorithms],PROGRAMMING +323,Testing Round #7,12,Two permutations,1500.0,C,1372363200,[data structures],PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Malek Dance Club,500.0,A,1371992400,"[combinatorics, math]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Psychos in a Line,1000.0,B,1371992400,"[data structures, implementation]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Kalila and Dimna in the Logging Industry,1500.0,C,1371992400,"[dp, geometry]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Have You Ever Heard About the Word?,2500.0,D,1371992400,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Ping-Pong,2500.0,E,1371992400,[data structures],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Magic Numbers,500.0,A,1371992400,"[brute force, greedy]",PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Ping-Pong (Easy Version),1000.0,B,1371992400,"[dfs and similar, graphs]",PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Malek Dance Club,1500.0,C,1371992400,[math],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Psychos in a Line,2000.0,D,1371992400,[data structures],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Kalila and Dimna in the Logging Industry,2500.0,E,1371992400,[dp],PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Perfect Pair,500.0,A,1371223800,[brute force],PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Ants,1000.0,B,1371223800,"[brute force, implementation]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Balance,2500.0,C,1371223800,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Game with Powers,1500.0,D,1371223800,"[dp, games]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Princess and Her Shadow,3000.0,E,1371223800,"[constructive algorithms, shortest paths]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Even Odds,500.0,A,1371223800,[math],PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Strings of Power,500.0,B,1371223800,"[implementation, strings, two pointers]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Perfect Pair,1000.0,C,1371223800,"[greedy, math]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Ants,2500.0,D,1371223800,[dfs and similar],PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Balance,3000.0,E,1371223800,"[constructive algorithms, dfs and similar]",PROGRAMMING +316,ABBYY Cup 3.0,12,Special Task,30.0,A1,1371042000,[greedy],PROGRAMMING +316,ABBYY Cup 3.0,12,Special Task,70.0,A2,1371042000,[math],PROGRAMMING +316,ABBYY Cup 3.0,12,EKG,30.0,B1,1371042000,"[brute force, dfs and similar]",PROGRAMMING +316,ABBYY Cup 3.0,12,EKG,70.0,B2,1371042000,"[dfs and similar, dp]",PROGRAMMING +316,ABBYY Cup 3.0,12,Tidying Up,30.0,C1,1371042000,[flows],PROGRAMMING +316,ABBYY Cup 3.0,12,Tidying Up,70.0,C2,1371042000,"[flows, graph matchings]",PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,30.0,D1,1371042000,"[brute force, dp]",PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,40.0,D2,1371042000,[dp],PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,30.0,D3,1371042000,"[dp, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,30.0,E1,1371042000,"[brute force, data structures]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,40.0,E2,1371042000,"[data structures, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,30.0,E3,1371042000,"[data structures, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F1,1371042000,"[dfs and similar, implementation]",PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,40.0,F2,1371042000,[],PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F3,1371042000,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,30.0,G1,1371042000,"[hashing, strings]",PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,40.0,G2,1371042000,[string suffix structures],PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,30.0,G3,1371042000,[string suffix structures],PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Contest,500.0,A,1370619000,[implementation],PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Periods,1000.0,B,1370619000,"[binary search, dfs and similar, strings]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Subsequences,1500.0,C,1370619000,"[data structures, dp]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Straight Lines,2000.0,D,1370619000,"[binary search, data structures, geometry, sortings, two pointers]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Squares,2500.0,E,1370619000,[dp],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Bottles,500.0,A,1370619000,[brute force],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Array,1000.0,B,1370619000,[implementation],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Contest,1500.0,C,1370619000,"[dp, greedy, implementation]",PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Periods,2000.0,D,1370619000,"[dfs and similar, strings]",PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Subsequences,2500.0,E,1370619000,"[combinatorics, data structures]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Bank Account,500.0,A,1369927800,"[implementation, number theory]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Queries,1000.0,B,1369927800,"[dp, implementation]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Matrix,1500.0,C,1369927800,"[constructive algorithms, greedy, implementation, sortings]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Roads,2500.0,D,1369927800,[dp],PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Two Numbers,2500.0,E,1369927800,"[constructive algorithms, data structures, dsu, greedy]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,The Closest Pair,500.0,A,1369582200,"[constructive algorithms, implementation]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Cats Transport,1000.0,B,1369582200,"[data structures, dp]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Fetch the Treasure,1500.0,C,1369582200,"[brute force, data structures, shortest paths]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Interval Cubing,2000.0,D,1369582200,"[data structures, math]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Biologist,2500.0,E,1369582200,[flows],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Whose sentence is it?,500.0,A,1369582200,[implementation],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Archer,1000.0,B,1369582200,"[math, probabilities]",PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,The Closest Pair,1500.0,C,1369582200,[constructive algorithms],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Cats Transport,2000.0,D,1369582200,[],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Fetch the Treasure,2500.0,E,1369582200,[],PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Strange Addition,500.0,A,1368968400,"[brute force, constructive algorithms]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Continued Fractions,1000.0,B,1368968400,"[brute force, math]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Ivan and Powers of Two,1500.0,C,1368968400,[],PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Olya and Graph,2000.0,D,1368968400,"[combinatorics, math]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Playing with String,2500.0,E,1368968400,[games],PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Morning run,500.0,A,1368803400,"[binary search, math, two pointers]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Context Advertising,500.0,B,1368803400,[two pointers],PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Memory for Arrays,1000.0,C,1368803400,"[binary search, bitmasks, greedy]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Tennis Rackets,2000.0,D,1368803400,"[brute force, geometry]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Sheep,2500.0,E,1368803400,"[binary search, greedy]",PROGRAMMING +308,Croc Champ 2013 - Finals,12,Morning run,500.0,A,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Context Advertising,500.0,B,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Memory for Arrays,1000.0,C,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Tennis Rackets,2000.0,D,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Sheep,2500.0,E,1368784800,[],PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Lucky Permutation Triple,500.0,A,1368363600,"[constructive algorithms, implementation, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Rectangle Puzzle II,500.0,B,1368363600,"[implementation, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Minimum Modular,2000.0,C,1368363600,"[brute force, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Rotatable Number,2500.0,D,1368363600,"[math, number theory]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Random Ranking,3000.0,E,1368363600,[dp],PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Pythagorean Theorem II,500.0,A,1368363600,"[brute force, math]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Calendar,1000.0,B,1368363600,"[brute force, implementation]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Lucky Permutation Triple,1000.0,C,1368363600,[constructive algorithms],PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Rectangle Puzzle II,2000.0,D,1368363600,"[math, ternary search]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Minimum Modular,3000.0,E,1368363600,[math],PROGRAMMING +306,Testing Round #6,12,Candies,500.0,A,1368302400,[implementation],PROGRAMMING +306,Testing Round #6,12,Optimizer,1000.0,B,1368302400,"[data structures, greedy, sortings]",PROGRAMMING +306,Testing Round #6,12,"White, Black and White Again",1500.0,C,1368302400,"[combinatorics, number theory]",PROGRAMMING +306,Testing Round #6,12,Polygon,2000.0,D,1368302400,"[constructive algorithms, geometry]",PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Sequence,500.0,A,1367769900,[constructive algorithms],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Time,1000.0,B,1367769900,"[binary search, graphs, shortest paths]",PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Algorithm,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Divisors,2000.0,D,1367769900,[data structures],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Arrangements,2500.0,E,1367769900,[dp],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Eugeny and Array,500.0,A,1367769900,[implementation],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Eugeny and Play List,1000.0,B,1367769900,"[binary search, implementation, two pointers]",PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Sequence,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Time,2000.0,D,1367769900,"[binary search, dfs and similar, dp, shortest paths]",PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Algorithm,2500.0,E,1367769900,[],PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Array,500.0,A,1366903800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Coach,1000.0,B,1366903800,"[brute force, dfs and similar]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Beautiful Numbers,2000.0,C,1366903800,"[brute force, combinatorics]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Painting Square,3000.0,D,1366903800,"[dp, fft]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Empire Strikes Back,3000.0,E,1366903800,"[binary search, math]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Weird Game,500.0,A,1366644900,"[games, greedy]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Distinct Paths,1500.0,B,1366644900,"[brute force, combinatorics]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Cube Problem,1500.0,C,1366644900,"[brute force, math, number theory]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Ksusha and Square,2000.0,D,1366644900,"[geometry, math, probabilities, two pointers]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Close Vertices,2500.0,E,1366644900,"[data structures, divide and conquer, trees]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha and Array,500.0,A,1366644600,"[brute force, number theory, sortings]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha the Squirrel,1000.0,B,1366644600,"[brute force, implementation]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Weird Game,1500.0,C,1366644600,"[games, greedy]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Distinct Paths,2500.0,D,1366644600,[],PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Cube Problem,2500.0,E,1366644600,[],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Parity Game,500.0,A,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Fish Weight,500.0,B,1366385400,"[constructive algorithms, greedy]",PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Splitting the Uniqueness,2000.0,C,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Color the Carpet,2500.0,D,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Mystic Carvings,3000.0,E,1366385400,[data structures],PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Snow Footprints,500.0,A,1366385400,"[greedy, implementation]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Sail,500.0,B,1366385400,"[brute force, greedy, implementation]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Parity Game,1500.0,C,1366385400,"[combinatorics, constructive algorithms, math, number theory]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Fish Weight,1500.0,D,1366385400,"[greedy, math, sortings]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Splitting the Uniqueness,3000.0,E,1366385400,"[constructive algorithms, sortings]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,SMSC,1000.0,A,1366040100,[implementation],PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Network Topology,1000.0,B,1366040100,"[graphs, implementation]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Beautiful IP Addresses,1500.0,C,1366040100,[brute force],PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Connected Components,2000.0,D,1366040100,"[data structures, dfs and similar, dp, dsu]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Copying Data,2500.0,E,1366040100,[data structures],PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Spyke Talks,500.0,A,1365796800,"[implementation, sortings]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Command Line Arguments,1000.0,B,1365796800,"[implementation, strings]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Network Mask,1500.0,C,1365796800,"[brute force, implementation]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Parallel Programming,2000.0,D,1365796800,[greedy],PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Tree-String Problem,2500.0,E,1365796800,"[dfs and similar, hashing, strings]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Array,500.0,A,1365694200,"[data structures, implementation]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Graph,1000.0,B,1365694200,"[dp, graphs, shortest paths]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Friends,1500.0,C,1365694200,"[combinatorics, dp, graphs, shortest paths]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Caves,2000.0,D,1365694200,"[combinatorics, dp]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Yaroslav and Points,2500.0,E,1365694200,[data structures],PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Yaroslav and Permutations,500.0,A,1365694200,"[greedy, math]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Yaroslav and Two Strings,1500.0,B,1365694200,"[combinatorics, dp]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Array,1500.0,C,1365694200,"[data structures, dp, implementation]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Graph,2000.0,D,1365694200,"[dp, graphs]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Friends,2500.0,E,1365694200,"[combinatorics, dfs and similar, dp]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Oskols,500.0,A,1365348600,"[implementation, math]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Bookshelf,1000.0,B,1365348600,"[dp, greedy]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Lights,1500.0,C,1365348600,"[combinatorics, number theory]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Painter Robot,2000.0,D,1365348600,"[brute force, implementation, number theory]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass the Great,2500.0,E,1365348600,"[dp, trees]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Strings,500.0,A,1364916600,[greedy],PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Houses ,1000.0,B,1364916600,[combinatorics],PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and XOR operation,1500.0,C,1364916600,"[implementation, math]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Trees ,2000.0,D,1364916600,"[combinatorics, dfs and similar, trees]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Lucky Numbers,2500.0,E,1364916600,"[dp, implementation, math]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Segments ,500.0,A,1364916600,"[brute force, implementation]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Matrix,1000.0,B,1364916600,"[brute force, dp, implementation, sortings, ternary search]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Strings,1500.0,C,1364916600,"[constructive algorithms, implementation]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Houses ,2000.0,D,1364916600,"[brute force, combinatorics, dfs and similar, math]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and XOR operation,2500.0,E,1364916600,"[data structures, greedy, implementation, math]",PROGRAMMING +290,April Fools Day Contest 2013,12,Mysterious strings,,A,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,QR code,,B,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,WTF?,,C,1364830200,"[*special, graph matchings, implementation, trees]",PROGRAMMING +290,April Fools Day Contest 2013,12,Orange,,D,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,HQ,,E,1364830200,"[*special, constructive algorithms]",PROGRAMMING +290,April Fools Day Contest 2013,12,Greedy Petya,,F,1364830200,"[*special, dfs and similar, graphs, greedy]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Lucky Permutation,500.0,A,1364025600,"[constructive algorithms, math]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Shifting,1500.0,B,1364025600,[implementation],PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Main Sequence,1500.0,C,1364025600,"[greedy, implementation]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Tourists,2000.0,D,1364025600,"[data structures, sortings]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Ladies' Shop,2500.0,E,1364025600,"[constructive algorithms, fft, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,IQ Test,500.0,A,1364025600,"[brute force, implementation]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Pipeline,1500.0,B,1364025600,"[binary search, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Lucky Permutation,1500.0,C,1364025600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Shifting,2500.0,D,1364025600,[],PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Main Sequence,2500.0,E,1364025600,"[data structures, greedy]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Slightly Decreasing Permutations,500.0,A,1363879800,"[greedy, implementation]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Find Marble,1000.0,B,1363879800,[implementation],PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Building Permutation,1500.0,C,1363879800,"[greedy, implementation, sortings]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Permutation Sum,2000.0,D,1363879800,"[bitmasks, combinatorics, dp, implementation, meet-in-the-middle]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Positions in Permutations,2500.0,E,1363879800,"[combinatorics, dp, math]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cows and Sequence,1000.0,A,1363534200,"[constructive algorithms, implementation]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cow Program,1000.0,B,1363534200,"[dfs and similar, dp, graphs]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Coin Troubles,1500.0,C,1363534200,[dp],PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cows and Cool Sequences,2000.0,D,1363534200,"[dp, math, number theory]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cow Tennis Tournament,2500.0,E,1363534200,"[combinatorics, data structures, math]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Primitive Roots,500.0,A,1363534200,"[implementation, math, number theory]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Poker Game,1000.0,B,1363534200,"[brute force, implementation]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Sequence,2000.0,C,1363534200,"[constructive algorithms, data structures, dp]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cow Program,2000.0,D,1363534200,"[dfs and similar, dp]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Coin Troubles,2500.0,E,1363534200,"[dfs and similar, dp]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Bit++,500.0,A,1363188600,[implementation],PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Painting Eggs,1000.0,B,1363188600,"[greedy, math]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,XOR and OR,1500.0,C,1363188600,"[constructive algorithms, implementation, math]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Yet Another Number Game,2000.0,D,1363188600,"[dp, games]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Sausage Maximization,2500.0,E,1363188600,"[bitmasks, data structures, trees]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Rectangle Puzzle,500.0,A,1362929400,[geometry],PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Maximum Xor Secondary,1000.0,B,1362929400,"[data structures, implementation, two pointers]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Game on Tree,1500.0,C,1362929400,"[implementation, math, probabilities, trees]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,k-Maximum Subsequence Sum,2000.0,D,1362929400,"[data structures, flows]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Sequence Transformation,2500.0,E,1362929400,"[data structures, dp, implementation, math]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Word Capitalization,500.0,A,1362929400,[strings],PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Nearest Fraction,1000.0,B,1362929400,"[brute force, implementation, two pointers]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Rectangle Puzzle,1500.0,C,1362929400,"[geometry, implementation]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Maximum Xor Secondary,2000.0,D,1362929400,[two pointers],PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Game on Tree,2500.0,E,1362929400,[math],PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Point on Spiral,500.0,A,1362411000,"[brute force, geometry, implementation]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Books,1000.0,B,1362411000,"[binary search, brute force, implementation, two pointers]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Ladder,1500.0,C,1362411000,"[dp, implementation, two pointers]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,The Minimum Number of Variables,2000.0,D,1362411000,"[bitmasks, dp]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Beautiful Decomposition,2000.0,E,1362411000,"[games, greedy]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Learning Languages,500.0,A,1362065400,"[dfs and similar, dsu]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Set of Points,1500.0,B,1362065400,"[constructive algorithms, geometry]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Game,2000.0,C,1362065400,"[games, implementation]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Google Code Jam,3000.0,D,1362065400,"[dp, probabilities]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Binary Tree on Plane,2000.0,E,1362065400,[flows],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Circle Line,500.0,A,1362065400,[implementation],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,New Problem,1000.0,B,1362065400,"[brute force, strings]",PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Learning Languages,1000.0,C,1362065400,[dsu],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Set of Points,3000.0,D,1362065400,"[constructive algorithms, geometry]",PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Game,3000.0,E,1362065400,[games],PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Lunch Rush,500.0,A,1361719800,[implementation],PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Game,1000.0,B,1361719800,"[games, greedy]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum Sum,1500.0,C,1361719800,"[data structures, implementation, sortings]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum XOR,2000.0,D,1361719800,"[bitmasks, dp, greedy, implementation, math]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Problem on Trees,2500.0,E,1361719800,"[data structures, trees]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,k-Multiple Free Set,500.0,A,1361374200,"[binary search, greedy, sortings]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Zero Tree,1000.0,B,1361374200,"[dfs and similar, dp, greedy, trees]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,The Last Hole!,1500.0,C,1361374200,"[brute force, geometry]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Lovely Matrix,2000.0,D,1361374200,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Mirror Room,2000.0,E,1361374200,"[data structures, implementation]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Lights Out,500.0,A,1361374200,[implementation],PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Convex Shape,1000.0,B,1361374200,"[constructive algorithms, implementation]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,k-Multiple Free Set,1500.0,C,1361374200,"[binary search, greedy, sortings]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Zero Tree,2000.0,D,1361374200,"[dfs and similar, dp, trees]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,The Last Hole!,2500.0,E,1361374200,[],PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Friends,500.0,A,1360769400,"[implementation, math]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Sequence,1000.0,B,1360769400,"[implementation, math]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Staircase,1500.0,C,1360769400,"[data structures, implementation]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Two Sequences,2000.0,D,1360769400,"[combinatorics, math, sortings]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Horses,2500.0,E,1360769400,"[combinatorics, constructive algorithms, graphs]",PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Staircase,500.0,A,1360769400,[],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Two Sequences,1000.0,B,1360769400,[combinatorics],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Horses,1500.0,C,1360769400,"[graphs, greedy]",PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Figure,2000.0,D,1360769400,[dp],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Game,2500.0,E,1360769400,"[dp, games]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Beautiful Year,500.0,A,1360596600,[brute force],PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Prime Matrix,1000.0,B,1360596600,"[binary search, brute force, math, number theory]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Secret,1500.0,C,1360596600,"[constructive algorithms, implementation]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Good Substrings,2000.0,D,1360596600,"[data structures, strings]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Three Horses,3000.0,E,1360596600,"[constructive algorithms, math, number theory]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Magical Boxes,500.0,A,1359732600,"[greedy, math]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Greenhouse Effect,1000.0,B,1359732600,[dp],PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Flawed Flow,1500.0,C,1359732600,"[constructive algorithms, flows, graphs]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Maximum Waterfall,2000.0,D,1359732600,"[data structures, dp]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,String Theory,2500.0,E,1359732600,[],PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Fancy Fence,500.0,A,1359732600,"[geometry, implementation, math]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Multithreading,1500.0,B,1359732600,"[data structures, greedy, implementation]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Magical Boxes,1500.0,C,1359732600,"[binary search, greedy, implementation, math, sortings]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Greenhouse Effect,2000.0,D,1359732600,[dp],PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Flawed Flow,2500.0,E,1359732600,"[dfs and similar, sortings]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Games,500.0,A,1359387000,[brute force],PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Buttons,1000.0,B,1359387000,"[implementation, math]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Beautiful Sets of Points,1500.0,C,1359387000,"[constructive algorithms, implementation]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Wall Bars,2500.0,D,1359387000,[dp],PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Playlist,2500.0,E,1359387000,"[math, probabilities, sortings]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Stones on the Table,500.0,A,1358868600,[implementation],PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Queue at the School,500.0,B,1358868600,"[constructive algorithms, graph matchings, implementation, shortest paths]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Below the Diagonal,2500.0,C,1358868600,"[constructive algorithms, greedy, math]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,BerDonalds,3000.0,D,1358868600,"[graphs, math, shortest paths]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,More Queries to Array...,3000.0,E,1358868600,"[data structures, math]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Escape from Stones,500.0,A,1358686800,"[constructive algorithms, data structures, implementation, two pointers]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Good Sequences,1000.0,B,1358686800,"[dp, number theory]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Choosing Balls,1500.0,C,1358686800,[dp],PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Colorful Stones,2000.0,D,1358686800,"[dp, two pointers]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Roadside Trees,2500.0,E,1358686800,"[data structures, dp]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Colorful Stones (Simplified Edition),500.0,A,1358686800,[implementation],PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Roadside Trees (Simplified Edition),1000.0,B,1358686800,"[greedy, implementation]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Escape from Stones,1500.0,C,1358686800,"[greedy, implementation]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Good Sequences,2000.0,D,1358686800,"[dp, number theory]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Choosing Balls,2500.0,E,1358686800,"[schedules, sortings]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Beautiful Matrix,500.0,A,1358350200,[implementation],PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Squares,500.0,B,1358350200,"[greedy, implementation, sortings]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Circle of Numbers,2500.0,C,1358350200,"[dfs and similar, implementation]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Cycle in Graph,2000.0,D,1358350200,"[dfs and similar, graphs]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Rhombus,3000.0,E,1358350200,"[brute force, data structures, dp]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Discounts,500.0,A,1358091000,"[greedy, sortings]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Restaurant,1000.0,B,1358091000,"[dp, math, probabilities]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Matrix,1500.0,C,1358091000,"[constructive algorithms, dp, math]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Increasing Subsequence,2000.0,D,1358091000,[dp],PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Calculator,2500.0,E,1358091000,"[brute force, dp, two pointers]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Roma and Lucky Numbers,500.0,A,1358091000,[implementation],PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Roma and Changing Signs,1000.0,B,1358091000,[greedy],PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Discounts,1500.0,C,1358091000,"[greedy, sortings]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Restaurant,2000.0,D,1358091000,"[combinatorics, dp]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Matrix,2500.0,E,1358091000,[dp],PROGRAMMING +267,Codeforces Testing Round #5,12,Subtractions,500.0,A,1358002800,"[math, number theory]",PROGRAMMING +267,Codeforces Testing Round #5,12,Dominoes,1000.0,B,1358002800,"[dfs and similar, graphs]",PROGRAMMING +267,Codeforces Testing Round #5,12,Berland Traffic,1500.0,C,1358002800,"[math, matrices]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Sockets,500.0,A,1357659000,"[greedy, implementation, sortings]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Playing Cubes,500.0,B,1357659000,"[games, greedy, implementation]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,View Angle,1500.0,C,1357659000,"[brute force, geometry, math]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Sum,2000.0,D,1357659000,"[greedy, math]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Greedy Elevator,3000.0,E,1357659000,"[data structures, implementation]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Adding Digits,500.0,A,1356622500,"[implementation, math]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Ancient Prophesy,1000.0,B,1356622500,"[brute force, implementation, strings]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Balls and Boxes,1500.0,C,1356622500,"[greedy, implementation]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Black and White Tree,2000.0,D,1356622500,"[constructive algorithms, dsu, graphs, greedy, trees]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Dividing Kingdom,2500.0,E,1356622500,"[binary search, brute force, data structures]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Bits,500.0,A,1356190200,"[greedy, math]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Elections,1000.0,B,1356190200,"[brute force, combinatorics, dp]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and LCM,1500.0,C,1356190200,"[binary search, combinatorics, dp, math]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Broken Sorting,2000.0,D,1356190200,"[dp, math, probabilities]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Tree,2500.0,E,1356190200,"[data structures, dfs and similar, trees]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Chess,500.0,A,1356190200,"[brute force, strings]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Magic Square,1000.0,B,1356190200,"[brute force, implementation]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Bits,1500.0,C,1356190200,"[greedy, strings]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Elections,2000.0,D,1356190200,"[brute force, combinatorics, dp, math]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and LCM,2500.0,E,1356190200,"[binary search, combinatorics, math]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Almost Arithmetical Progression,500.0,A,1355671800,"[binary search, dp, two pointers]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Mr. Bender and Square,1000.0,B,1355671800,"[binary search, brute force, math]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Furlo and Rublo and Game,1500.0,C,1355671800,[games],PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Liars and Serge,2000.0,D,1355671800,[dp],PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Lucky Arrays,2500.0,E,1355671800,[data structures],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Greg's Workout,500.0,A,1355671800,[implementation],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Code Parsing,1000.0,B,1355671800,[implementation],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Almost Arithmetical Progression,1500.0,C,1355671800,"[brute force, dp]",PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Mr. Bender and Square,2000.0,D,1355671800,"[binary search, implementation, math]",PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Furlo and Rublo and Game,2500.0,E,1355671800,"[games, implementation, math]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Cards with Numbers,500.0,A,1355047200,"[constructive algorithms, sortings]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Jury Size,1000.0,B,1355047200,"[brute force, implementation]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Anagram,1500.0,C,1355047200,[greedy],PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Rats,2000.0,D,1355047200,"[brute force, dfs and similar, implementation]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Dormitory,2500.0,E,1355047200,"[dp, implementation]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Boys and Girls,500.0,A,1354960800,[greedy],PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Physics Practical,1000.0,B,1354960800,"[binary search, dp, two pointers]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Text Editor,1500.0,C,1354960800,"[data structures, dfs and similar, greedy, shortest paths]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Table with Letters - 2,2000.0,D,1354960800,"[brute force, two pointers]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Printer,2500.0,E,1354960800,"[binary search, data structures, implementation, sortings]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Points on Line,500.0,A,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Playing with Permutations,1000.0,B,1354807800,"[implementation, math]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Number Transformation,1500.0,C,1354807800,"[dp, greedy, number theory]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Two Sets,2000.0,D,1354807800,"[bitmasks, math]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Tree and Table,2500.0,E,1354807800,"[dfs and similar, dp, implementation, trees]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Little Xor,500.0,A,1354807800,"[brute force, implementation]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Unsorting Array,1000.0,B,1354807800,"[brute force, sortings]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Points on Line,1500.0,C,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Playing with Permutations,2000.0,D,1354807800,"[brute force, combinatorics, implementation]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Number Transformation,2500.0,E,1354807800,"[dp, number theory]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Paper Work,500.0,A,1353938400,[greedy],PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Restoring IPv6,1000.0,B,1353938400,"[implementation, strings]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Movie Critics,1500.0,C,1353938400,[greedy],PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Building Bridge,1500.0,D,1353938400,"[geometry, ternary search, two pointers]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Mad Joe,2000.0,E,1353938400,[brute force],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Paper Work,500.0,A,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Restoring IPv6,1000.0,B,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Movie Critics,1500.0,C,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Building Bridge,1500.0,D,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Mad Joe,2000.0,E,1353927300,[],PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Cupboards,500.0,A,1353857400,[implementation],PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Chilly Willy,1000.0,B,1353857400,"[math, number theory]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Robo-Footballer,2000.0,C,1353857400,"[binary search, geometry]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Sweets for Everyone!,2000.0,D,1353857400,"[binary search, greedy, implementation]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Piglet's Birthday,2500.0,E,1353857400,"[dp, probabilities]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Robo-Footballer,1000.0,A,1353857400,[geometry],PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Sweets for Everyone!,1000.0,B,1353857400,"[binary search, greedy]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Piglet's Birthday,1500.0,C,1353857400,"[dp, probabilities]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Donkey and Stars,1500.0,D,1353857400,"[data structures, dp, math, sortings]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Endless Matrix,2500.0,E,1353857400,[math],PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Buggy Sorting,500.0,A,1353511800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Increase and Decrease,1000.0,B,1353511800,"[greedy, math]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Beauty Pageant,1500.0,C,1353511800,"[brute force, constructive algorithms, greedy]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Colorful Graph,2000.0,D,1353511800,"[brute force, dfs and similar, graphs]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Blood Cousins Return,2500.0,E,1353511800,"[binary search, data structures, dfs and similar, dp, sortings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,System Administrator,,A,1353339000,[implementation],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Internet Address,,B,1353339000,"[implementation, strings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Game with Coins,,C,1353339000,[greedy],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Restoring Table,,D,1353339000,"[constructive algorithms, greedy]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Mishap in Club,,E,1353339000,[implementation],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Log Stream Analysis,,F,1353339000,"[binary search, brute force, implementation, strings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Suggested Friends,,G,1353339000,"[brute force, graphs]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Queries for Number of Palindromes,,H,1353339000,"[dp, hashing, strings]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,The Brand New Function,500.0,A,1353079800,[bitmasks],PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Hydra,1000.0,B,1353079800,"[graphs, sortings]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Colorado Potato Beetle,1500.0,C,1353079800,"[dfs and similar, implementation]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Cubes,2000.0,D,1353079800,"[data structures, dp, geometry, two pointers]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Matrix,2500.0,E,1353079800,[data structures],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Dividing Orange,500.0,A,1353079800,[implementation],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Undoubtedly Lucky Numbers,1000.0,B,1353079800,"[bitmasks, brute force, dfs and similar]",PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,The Brand New Function,1500.0,C,1353079800,"[bitmasks, divide and conquer, math]",PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Hydra,2000.0,D,1353079800,[],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Colorado Potato Beetle,2500.0,E,1353079800,[],PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Heads or Tails,500.0,A,1352647800,"[brute force, implementation]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Big Segment,1000.0,B,1352647800,"[implementation, sortings]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,King's Path,1500.0,C,1352647800,"[dfs and similar, hashing, shortest paths]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Dispute,2000.0,D,1352647800,"[dfs and similar, greedy]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,XOR on Segment,2500.0,E,1352647800,"[bitmasks, data structures]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Not Wool Sequences,500.0,A,1352044800,"[constructive algorithms, math]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Boring Partition,1000.0,B,1352044800,[constructive algorithms],PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,World Eater Brothers,1500.0,C,1352044800,"[dfs and similar, dp, greedy, trees]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Tape Programming,2000.0,D,1352044800,"[data structures, implementation]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Meeting Her,2500.0,E,1352044800,"[dp, graphs, shortest paths]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Two Bags of Potatoes,500.0,A,1352044800,"[greedy, implementation, math]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Easy Tape Programming,1000.0,B,1352044800,"[brute force, implementation]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Not Wool Sequences,1500.0,C,1352044800,"[combinatorics, constructive algorithms, math]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Boring Partition,2000.0,D,1352044800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,World Eater Brothers,2500.0,E,1352044800,[],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Old Peykan,,A,1351783800,[greedy],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Friends,,B,1351783800,"[binary search, bitmasks, data structures, math]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Mirror Box,,C,1351783800,"[geometry, implementation]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Numbers,,D,1351783800,[],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Flights,,E,1351783800,"[graphs, shortest paths]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Race,,F,1351783800,"[brute force, implementation]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Challenging Balloons,,G,1351783800,[constructive algorithms],PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Free Cash,500.0,A,1351179000,[implementation],PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Young Table,1000.0,B,1351179000,"[implementation, sortings]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Primes on Interval,1500.0,C,1351179000,"[binary search, number theory, two pointers]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,T-decomposition,2000.0,D,1351179000,"[dfs and similar, graphs, greedy]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Build String,2500.0,E,1351179000,"[flows, graphs]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,LCM Challenge,500.0,A,1350803400,[number theory],PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Let's Play Osu!,1000.0,B,1350803400,"[dp, math, probabilities]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Cyclical Quest,1500.0,C,1350803400,"[string suffix structures, strings]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Graph Game,2000.0,D,1350803400,[graphs],PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Number Challenge,2500.0,E,1350803400,"[combinatorics, dp, implementation, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Boy or Girl,500.0,A,1350803400,[implementation],PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Easy Number Challenge,1000.0,B,1350803400,"[implementation, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,LCM Challenge,1500.0,C,1350803400,"[greedy, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Let's Play Osu!,2000.0,D,1350803400,"[dp, probabilities]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Cyclical Quest,2500.0,E,1350803400,[],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Lefthanders and Righthanders ,,A,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Reading,,B,1350370800,[sortings],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Weather,,C,1350370800,"[dp, implementation]",PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Cinema,,D,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Champions' League,,E,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Fence,,F,1350370800,[dp],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Practice,,G,1350370800,"[constructive algorithms, divide and conquer, implementation]",PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Merging Two Decks,,H,1350370800,"[constructive algorithms, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Cinema,,A,1350370800,[implementation],PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Fence,,B,1350370800,[dp],PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Practice,,C,1350370800,"[constructive algorithms, implementation]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Merging Two Decks,,D,1350370800,"[constructive algorithms, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Road Repairs,,E,1350370800,"[dfs and similar, graphs, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,TorCoder,,F,1350370800,[data structures],PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Cycles,500.0,A,1349969400,"[binary search, constructive algorithms, graphs, greedy]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Table,1000.0,B,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Doe Graphs,1500.0,C,1349969400,"[constructive algorithms, divide and conquer, dp, graphs, shortest paths]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Fence,2000.0,D,1349969400,"[binary search, data structures, string suffix structures]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Quick Tortoise,2500.0,E,1349969400,"[bitmasks, divide and conquer, dp]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Perfect Permutation,500.0,A,1349969400,"[implementation, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Non-square Equation,1000.0,B,1349969400,"[binary search, brute force, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Cycles,1500.0,C,1349969400,"[combinatorics, graphs, matrices]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Table,2000.0,D,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Doe Graphs,2500.0,E,1349969400,[],PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Team,500.0,A,1349623800,"[brute force, greedy]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,"Magic, Wizardry and Wonders",1000.0,B,1349623800,"[constructive algorithms, greedy]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,To Add or Not to Add,1500.0,C,1349623800,"[binary search, sortings, two pointers]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Magic Box,2000.0,D,1349623800,"[brute force, geometry]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Cactus,2500.0,E,1349623800,"[data structures, dfs and similar, dp, graphs, trees]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Shifts,500.0,A,1349105400,"[brute force, two pointers]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Planets,500.0,B,1349105400,"[binary search, data structures, shortest paths]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Triangles,1000.0,C,1349105400,"[combinatorics, graphs, math]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Towers,1000.0,D,1349105400,"[dp, greedy, two pointers]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Gifts,3000.0,E,1349105400,"[combinatorics, dp, probabilities]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Dragons,500.0,A,1349105400,"[greedy, sortings]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,T-primes,500.0,B,1349105400,"[implementation, math, number theory]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Shifts,1500.0,C,1349105400,"[binary search, data structures, dp, implementation]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Planets,2500.0,D,1349105400,"[binary search, graphs, shortest paths]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Triangles,3000.0,E,1349105400,"[combinatorics, graphs, math]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Is your horseshoe on the other hoof?,500.0,A,1348759800,[implementation],PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Two Tables,1000.0,B,1348759800,"[brute force, implementation]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Fractal Detector,1500.0,C,1348759800,"[dp, hashing]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Zigzag,2000.0,D,1348759800,[data structures],PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,The Road to Berland is Paved With Good Intentions,2500.0,E,1348759800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Flying Saucer Segments,500.0,A,1348500600,[math],PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Naughty Stone Piles,1000.0,B,1348500600,[greedy],PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Anniversary,1500.0,C,1348500600,"[data structures, implementation, math, matrices, number theory]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,The table,2000.0,D,1348500600,"[constructive algorithms, greedy]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Noble Knight's Path,2500.0,E,1348500600,"[data structures, trees]",PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Where do I Turn?,500.0,A,1348500600,[geometry],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Effective Approach,1000.0,B,1348500600,[implementation],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Flying Saucer Segments,1500.0,C,1348500600,[math],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Naughty Stone Piles,2000.0,D,1348500600,"[math, sortings]",PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Anniversary,2500.0,E,1348500600,"[matrices, number theory]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Dice Tower,500.0,A,1348069500,"[constructive algorithms, greedy]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Well-known Numbers,1000.0,B,1348069500,"[binary search, greedy, number theory]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Barcode,1500.0,C,1348069500,"[dp, matrices]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Snake,3000.0,D,1348069500,"[bitmasks, dfs and similar, graphs, implementation]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Unsolvable,3000.0,E,1348069500,"[math, number theory]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Bracket Sequence,500.0,A,1347809400,"[data structures, expression parsing, implementation]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Two Strings,1000.0,B,1347809400,"[data structures, dp, strings]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Partial Sums,1500.0,C,1347809400,"[combinatorics, math]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Spider,2000.0,D,1347809400,"[geometry, graphs]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Planar Graph,2500.0,E,1347809400,"[flows, geometry, graphs]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Parallelepiped,500.0,A,1347809400,"[brute force, math]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Array,1000.0,B,1347809400,"[bitmasks, implementation, two pointers]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Bracket Sequence,1500.0,C,1347809400,[data structures],PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Two Strings,2000.0,D,1347809400,"[data structures, strings]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Partial Sums,2500.0,E,1347809400,"[combinatorics, math]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Shooshuns and Sequence ,500.0,A,1347291900,"[brute force, implementation]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Cosmic Tables,1000.0,B,1347291900,[implementation],PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Reducing Fractions,1500.0,C,1347291900,"[implementation, number theory, sortings]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Olympiad,2000.0,D,1347291900,"[binary search, greedy, sortings, two pointers]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Decoding Genome,2500.0,E,1347291900,[matrices],PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Problem,500.0,A,1346427000,"[implementation, sortings]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Array,1000.0,B,1346427000,"[constructive algorithms, data structures]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Shifts,1500.0,C,1346427000,[data structures],PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Triangle,2000.0,D,1346427000,"[chinese remainder theorem, geometry, math]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Inversions,2500.0,E,1346427000,"[data structures, two pointers]",PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Function,500.0,A,1346427000,"[implementation, math]",PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Numbers,1000.0,B,1346427000,[implementation],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Problem,1500.0,C,1346427000,[sortings],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Array,2000.0,D,1346427000,[data structures],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Shifts,2500.0,E,1346427000,[],PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,k-String,500.0,A,1346081400,"[implementation, strings]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Special Offer! Super Price 999 Bourles!,1000.0,B,1346081400,[implementation],PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Color Stripe,1500.0,C,1346081400,"[brute force, dp, greedy]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Choosing Capital for Treeland,2000.0,D,1346081400,"[dfs and similar, dp, trees]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Parking Lot,3000.0,E,1346081400,[data structures],PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Ice Skating,500.0,A,1345273500,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Blackboard Fibonacci,1000.0,B,1345273500,"[brute force, math]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Formurosa,2500.0,C,1345273500,"[divide and conquer, dp, expression parsing]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Bitonix' Patrol,3000.0,D,1345273500,"[bitmasks, brute force, combinatorics, dfs and similar, math]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Alien DNA,3000.0,E,1345273500,"[data structures, dsu, trees]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Mountain Scenery,500.0,A,1345273500,"[brute force, constructive algorithms, implementation]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Airport,500.0,B,1345273500,[implementation],PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Ice Skating,1000.0,C,1345273500,"[dfs and similar, dsu, graphs]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Blackboard Fibonacci,3000.0,D,1345273500,[implementation],PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Formurosa,3000.0,E,1345273500,[],PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Tiling with Hexagons,500.0,A,1344958200,"[implementation, math]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Forming Teams,1500.0,B,1344958200,"[dfs and similar, implementation]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Hiring Staff,2000.0,C,1344958200,[greedy],PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Spider's Web,2000.0,D,1344958200,"[binary search, sortings, two pointers]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Martian Luck,3000.0,E,1344958200,"[math, number theory]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Bicycle Chain,500.0,A,1344267000,"[brute force, implementation]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Olympic Medal,500.0,B,1344267000,"[greedy, math]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Crosses,3000.0,C,1344267000,"[brute force, implementation]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Hot Days,2000.0,D,1344267000,[greedy],PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Periodical Numbers,3000.0,E,1344267000,"[combinatorics, dp, number theory]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Game,1000.0,A,1343662200,"[dfs and similar, greedy]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Numbers,1000.0,B,1343662200,"[combinatorics, dp]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Relay Race,1500.0,C,1343662200,[dp],PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Stars,2000.0,D,1343662200,"[constructive algorithms, geometry]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Two Permutations,2500.0,E,1343662200,"[data structures, hashing, strings]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,System of Equations,500.0,A,1343662200,[brute force],PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Hometask,1000.0,B,1343662200,"[brute force, constructive algorithms, greedy, math]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Game,2000.0,C,1343662200,"[brute force, greedy]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Numbers,2000.0,D,1343662200,"[combinatorics, dp, math]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Relay Race,2500.0,E,1343662200,[dp],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Dubstep,500.0,A,1343057400,[strings],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Solitaire,2000.0,B,1343057400,"[dfs and similar, dp]",PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Police Station,2500.0,C,1343057400,"[dp, graphs, shortest paths]",PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,"Prizes, Prizes, more Prizes",500.0,D,1343057400,[implementation],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Blood Cousins,3000.0,E,1343057400,"[binary search, data structures, dfs and similar, trees]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Privatization,3000.0,A,1342450800,"[flows, graphs]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Polycarpus is Looking for Good Substrings,2000.0,B,1342450800,"[bitmasks, hashing, implementation]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Cowboys,1500.0,C,1342450800,"[dp, math]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Cutting a Fence,2500.0,D,1342450800,"[binary search, data structures, dsu]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,IT Restaurants,500.0,E,1342450800,"[dfs and similar, dp, trees]",PROGRAMMING +211,VK Cup 2012 Finals,12,Privatization,3000.0,A,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Polycarpus is Looking for Good Substrings,1000.0,B,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Cowboys,500.0,C,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Cutting a Fence,1000.0,D,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,IT Restaurants,500.0,E,1342335600,[],PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Multicolored Marbles,500.0,A,1342252500,"[dp, math]",PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Pixels,500.0,B,1342252500,"[constructive algorithms, math]",PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Trails and Glades,1000.0,C,1342252500,"[constructive algorithms, dsu, graphs, greedy]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Interval,500.0,A,1342020600,"[binary search, combinatorics, dp]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Cards,500.0,B,1342020600,"[binary search, data structures]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Furik and Rubik,1500.0,C,1342020600,"[math, probabilities]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Retro Strings,2000.0,D,1342020600,[dp],PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Strings,2500.0,E,1342020600,"[data structures, implementation, string suffix structures, two pointers]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Rozdil,500.0,A,1342020600,"[brute force, implementation]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Sorting,1000.0,B,1342020600,"[brute force, greedy]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Interval,1500.0,C,1342020600,"[binary search, brute force, combinatorics, dp, math]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Cards,1500.0,D,1342020600,"[binary search, brute force, sortings]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Furik and Rubik,2500.0,E,1342020600,"[brute force, combinatorics, probabilities]",PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,20.0,A1,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,30.0,A2,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,50.0,A3,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,20.0,B1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,30.0,B2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,50.0,B3,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,20.0,C1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,30.0,C2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,50.0,C3,1341730800,[data structures],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D10,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D3,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D4,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D5,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D6,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D7,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D8,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D9,1341730800,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,20.0,A1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,30.0,A2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,50.0,A3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,20.0,B1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,30.0,B2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,50.0,B3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,20.0,C1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,30.0,C2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,50.0,C3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D10,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D4,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D5,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D6,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D7,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D8,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D9,1341576900,[],PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Two Problems,500.0,A,1341329400,"[brute force, implementation]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Game on Paper,1000.0,B,1341329400,"[brute force, implementation]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Photographer,1500.0,C,1341329400,"[greedy, sortings]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Hit Ball,2000.0,D,1341329400,"[geometry, implementation, math]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Transportation,2500.0,E,1341329400,"[greedy, sortings, two pointers]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Clear Symmetry,1000.0,A,1340983800,"[constructive algorithms, dp, math]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Guess That Car!,1000.0,B,1340983800,"[math, ternary search]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Fragile Bridges,1500.0,C,1340983800,[dp],PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Brand New Problem,2000.0,D,1340983800,"[bitmasks, brute force, dp]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Thoroughly Bureaucratic Organization,2500.0,E,1340983800,"[binary search, combinatorics]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,LLPS,500.0,A,1340983800,"[binary search, bitmasks, brute force, greedy, implementation, strings]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Brand New Easy Problem,1000.0,B,1340983800,[brute force],PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Clear Symmetry,2000.0,C,1340983800,"[binary search, math]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Guess That Car!,2000.0,D,1340983800,"[dp, math]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Fragile Bridges,2500.0,E,1340983800,"[data structures, dp]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Cinema,3000.0,A,1340551800,"[brute force, data structures]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Drinks,500.0,B,1340551800,"[implementation, math]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Football Championship,2000.0,C,1340551800,"[brute force, implementation]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Programming Language,1500.0,D,1340551800,"[binary search, brute force, expression parsing, implementation]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Tractor College,3000.0,E,1340551800,"[implementation, math, number theory, ternary search]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,About Bacteria,500.0,A,1340379000,"[implementation, math]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Jumping on Walls,1000.0,B,1340379000,[shortest paths],PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Delivering Carcinogen,1500.0,C,1340379000,"[binary search, geometry]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Cube Snake,2000.0,D,1340379000,[constructive algorithms],PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Gripping Story,2500.0,E,1340379000,"[binary search, data structures, sortings]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Hexadecimal's theorem,500.0,A,1340379000,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Special Olympics,1000.0,B,1340379000,[geometry],PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,About Bacteria,1500.0,C,1340379000,[math],PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Jumping on Walls,2000.0,D,1340379000,"[dfs and similar, shortest paths]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Delivering Carcinogen,2500.0,E,1340379000,"[binary search, geometry]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Lexicographically Maximum Subsequence,500.0,A,1339506000,[greedy],PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Infinite Maze,1000.0,B,1339506000,[dfs and similar],PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Paint Tree,1500.0,C,1339506000,"[divide and conquer, geometry, sortings, trees]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,The Next Good String,3000.0,D,1339506000,"[data structures, greedy, hashing, strings]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Opening Portals,2500.0,E,1339506000,"[dsu, graphs, shortest paths]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Plate Game,1000.0,A,1339506000,"[constructive algorithms, games, math]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Limit,500.0,B,1339506000,[math],PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Lexicographically Maximum Subsequence,500.0,C,1339506000,"[greedy, implementation, sortings]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Infinite Maze,3000.0,D,1339506000,[hashing],PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Paint Tree,3000.0,E,1339506000,"[constructive algorithms, dfs and similar, geometry]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Let's Watch Football,500.0,A,1339342200,"[binary search, brute force, math]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,After Training,1000.0,B,1339342200,"[data structures, implementation, math]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Try and Catch,1500.0,C,1339342200,"[expression parsing, implementation]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Analyzing Polyline,2000.0,D,1339342200,"[math, sortings]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Building Forest,2500.0,E,1339342200,"[data structures, dsu]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Cutting Figure,500.0,A,1338737400,"[2-sat, chinese remainder theorem, trees]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Xor,1000.0,B,1338737400,[brute force],PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Hamming Distance,2000.0,C,1338737400,"[constructive algorithms, greedy, math, matrices]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Two Segments,2000.0,D,1338737400,[data structures],PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Fibonacci Number,2500.0,E,1338737400,"[brute force, math, matrices]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Exams,500.0,A,1338737400,"[implementation, math]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Square,1000.0,B,1338737400,[math],PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Cutting Figure,1500.0,C,1338737400,"[dfs and similar, graphs, implementation, matrices, strings]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Xor,2000.0,D,1338737400,[],PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Hamming Distance,3000.0,E,1338737400,[math],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Dynasty Puzzles,500.0,A,1338132600,[dp],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Demonstration,1000.0,B,1338132600,[greedy],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Fools and Roads,1500.0,C,1338132600,"[data structures, dfs and similar, trees]",PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Metro Scheme,2000.0,D,1338132600,"[graphs, greedy]",PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Thwarting Demonstrations,2500.0,E,1338132600,"[binary search, data structures, trees]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Funky Numbers,500.0,A,1338132600,"[binary search, brute force, implementation]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Walking in the Rain,1000.0,B,1338132600,"[brute force, implementation]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Dynasty Puzzles,1500.0,C,1338132600,[dp],PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Demonstration,2000.0,D,1338132600,"[brute force, constructive algorithms]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Fools and Roads,2500.0,E,1338132600,"[data structures, trees]",PROGRAMMING +188,Surprise Language Round #6,12,Hexagonal Numbers,,A,1337959800,[*special],PROGRAMMING +188,Surprise Language Round #6,12,A + Reverse B,,B,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,LCM,,C,1337959800,"[*special, implementation, math]",PROGRAMMING +188,Surprise Language Round #6,12,Asterisks,,D,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,HQ9+,,E,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Binary Notation,,F,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Array Sorting,,G,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Stack,,H,1337959800,"[*special, expression parsing, implementation]",PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Vasya and the Bus,500.0,A,1337182200,"[greedy, math]",PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Surrounded,1000.0,B,1337182200,[geometry],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,STL,1500.0,C,1337182200,[dfs and similar],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Non-Secret Cypher,2000.0,D,1337182200,[two pointers],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Counter Attack,2500.0,E,1337182200,"[data structures, dsu, graphs, hashing, sortings]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Permutations,500.0,A,1336663800,[greedy],PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,AlgoRace,1000.0,B,1336663800,"[dp, shortest paths]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Weak Memory,1500.0,C,1336663800,"[dfs and similar, dsu]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,BRT Contract ,2000.0,D,1336663800,[data structures],PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Heaven Tour,2500.0,E,1336663800,"[data structures, greedy]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Cut Ribbon,500.0,A,1336663800,"[brute force, dp]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Counting Rhombi,1000.0,B,1336663800,"[brute force, math]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Permutations,1500.0,C,1336663800,"[greedy, implementation]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,AlgoRace,2000.0,D,1336663800,"[dp, shortest paths]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Weak Memory,2500.0,E,1336663800,"[binary search, shortest paths]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Plant,500.0,A,1336145400,[math],PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Mushroom Scientists,1000.0,B,1336145400,"[math, ternary search]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Clever Fat Rat,1500.0,C,1336145400,[dp],PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Visit of the Great,2000.0,D,1336145400,"[math, number theory]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Soap Time! - 2,2500.0,E,1336145400,"[binary search, data structures]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Comparing Strings,500.0,A,1336145400,"[implementation, strings]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Growing Mushrooms,1000.0,B,1336145400,"[greedy, sortings]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Plant,1500.0,C,1336145400,"[dp, math, matrices, number theory]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Mushroom Scientists,2000.0,D,1336145400,"[math, number theory, probabilities]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Clever Fat Rat,2500.0,E,1336145400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,20.0,A1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,30.0,A2,1335614400,[greedy],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,50.0,A3,1335614400,[greedy],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,20.0,B1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,30.0,B2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,50.0,B3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,20.0,C1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,30.0,C2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,50.0,C3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,20.0,D1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,30.0,D2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,50.0,D3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,20.0,E1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,30.0,E2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,50.0,E3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,20.0,F1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,30.0,F2,1335614400,"[dp, sortings, strings]",PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,50.0,F3,1335614400,[],PROGRAMMING +183,Croc Champ 2012 - Final,12,Headquarters,500.0,A,1335532800,"[constructive algorithms, math]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Zoo,1000.0,B,1335532800,"[brute force, geometry]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Cyclic Coloring,1500.0,C,1335532800,[dfs and similar],PROGRAMMING +183,Croc Champ 2012 - Final,12,T-shirt,2000.0,D,1335532800,"[dp, greedy, probabilities]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Candy Shop,2500.0,E,1335532800,[greedy],PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Battlefield,3000.0,A,1335280200,"[geometry, graphs, implementation, shortest paths]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Vasya's Calendar,500.0,B,1335280200,[implementation],PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Optimal Sum,3000.0,C,1335280200,"[data structures, greedy]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Common Divisors,1000.0,D,1335280200,"[brute force, hashing, implementation, math, strings]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Wooden Fence,1500.0,E,1335280200,[dp],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Defragmentation,,A,1335078000,[implementation],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Divisibility Rules,,B,1335078000,"[math, number theory]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Letter,,C,1335078000,[dp],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Name,,D,1335078000,"[greedy, strings]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Cubes,,E,1335078000,"[binary search, dp, two pointers]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Mathematical Analysis Rocks!,,F,1335078000,"[constructive algorithms, implementation, math]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,30.0,A1,1335016800,[implementation],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,70.0,A2,1335016800,[implementation],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,30.0,B1,1335016800,[number theory],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,70.0,B2,1335016800,[number theory],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Party,30.0,C1,1335016800,"[dfs and similar, dsu, graphs]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Party,70.0,C2,1335016800,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,30.0,D1,1335016800,[brute force],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,70.0,D2,1335016800,[data structures],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Space Voyage,30.0,E1,1335016800,[binary search],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Space Voyage,70.0,E2,1335016800,[binary search],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Script Generation,30.0,F1,1335016800,[],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Script Generation,70.0,F2,1335016800,[],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,30.0,G1,1335016800,[strings],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,70.0,G2,1335016800,"[matrices, strings]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Trading Business,500.0,A,1334934300,"[greedy, sortings]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Word Cut,1000.0,B,1334934300,[dp],PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Playing with Superglue,1500.0,C,1334934300,"[combinatorics, constructive algorithms]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Hyper String,2000.0,D,1334934300,[dp],PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Archaeology,2500.0,E,1334934300,"[data structures, dfs and similar, trees]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Series of Crimes,500.0,A,1334934300,"[brute force, geometry, implementation]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Number of Triplets,1000.0,B,1334934300,"[binary search, brute force]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Trading Business,1500.0,C,1334934300,"[games, graph matchings, greedy]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Word Cut,2000.0,D,1334934300,[dp],PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Playing with Superglue,2500.0,E,1334934300,[games],PROGRAMMING +175,Codeforces Round #115,12,Robot Bicorn Attack,500.0,A,1334390400,"[brute force, implementation]",PROGRAMMING +175,Codeforces Round #115,12,Plane of Tanks: Pro,500.0,B,1334390400,[implementation],PROGRAMMING +175,Codeforces Round #115,12,Geometry Horse,1000.0,C,1334390400,"[greedy, implementation, sortings]",PROGRAMMING +175,Codeforces Round #115,12,Plane of Tanks: Duel,2500.0,D,1334390400,"[brute force, dp, math, probabilities]",PROGRAMMING +175,Codeforces Round #115,12,Power Defence,3000.0,E,1334390400,"[brute force, dp, geometry, greedy]",PROGRAMMING +175,Codeforces Round #115,12,Gnomes of Might and Magic,3000.0,F,1334390400,"[data structures, graphs, implementation, shortest paths]",PROGRAMMING +164,VK Cup 2012 Round 3,12,"Variable, or There and Back Again",500.0,A,1333897500,"[dfs and similar, graphs]",PROGRAMMING +164,VK Cup 2012 Round 3,12,Ancient Berland Hieroglyphs,1000.0,B,1333897500,[two pointers],PROGRAMMING +164,VK Cup 2012 Round 3,12,Machine Programming,1500.0,C,1333897500,[flows],PROGRAMMING +164,VK Cup 2012 Round 3,12,Minimum Diameter,2500.0,D,1333897500,"[binary search, brute force]",PROGRAMMING +164,VK Cup 2012 Round 3,12,Polycarpus and Tasks,2500.0,E,1333897500,[],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Problem About Equation,500.0,A,1333897500,[math],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,File List,1000.0,B,1333897500,"[dp, greedy, implementation]",PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Range Increments,1500.0,C,1333897500,"[data structures, greedy]",PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,"Variable, or There and Back Again",2500.0,D,1333897500,[graphs],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Ancient Berland Hieroglyphs,3000.0,E,1333897500,[],PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Rock-Paper-Scissors,500.0,A,1333724400,"[implementation, math]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Chamber of Secrets,1000.0,B,1333724400,"[dfs and similar, shortest paths]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Spiral Maximum,1500.0,C,1333724400,"[brute force, dp]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Deputies,2000.0,D,1333724400,"[constructive algorithms, graphs, greedy, implementation]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Camping Groups,2500.0,E,1333724400,"[data structures, sortings]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Phone Code,1000.0,A,1333440000,"[brute force, implementation]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Pseudorandom Sequence Period,1000.0,B,1333440000,"[implementation, number theory]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Bus,1500.0,C,1333440000,"[implementation, sortings]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Calendar Reform,1500.0,D,1333440000,[number theory],PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,BHTML+BCSS,2000.0,E,1333440000,"[dfs and similar, expression parsing]",PROGRAMMING +171,April Fools Day Contest,12,Mysterious numbers - 1,,A,1333292400,"[*special, constructive algorithms]",PROGRAMMING +171,April Fools Day Contest,12,Star,,B,1333292400,"[*special, combinatorics]",PROGRAMMING +171,April Fools Day Contest,12,A Piece of Cake,,C,1333292400,"[*special, implementation]",PROGRAMMING +171,April Fools Day Contest,12,Broken checker,,D,1333292400,"[*special, brute force]",PROGRAMMING +171,April Fools Day Contest,12,MYSTERIOUS LANGUAGE,,E,1333292400,[*special],PROGRAMMING +171,April Fools Day Contest,12,ucyhf,,F,1333292400,"[*special, brute force, implementation, number theory]",PROGRAMMING +171,April Fools Day Contest,12,Mysterious numbers - 2,,G,1333292400,[*special],PROGRAMMING +171,April Fools Day Contest,12,A polyline,,H,1333292400,"[*special, implementation]",PROGRAMMING +170,VK Cup 2012 Wild-card Round 2,12,Placing Rectangles,,A,1332954000,[*special],PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Trolleybuses,500.0,A,1332860400,[implementation],PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Huge Prize,1000.0,B,1332860400,"[dp, probabilities]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Numbers,1500.0,C,1332860400,"[games, math]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Roads,2000.0,D,1332860400,"[data structures, divide and conquer, graph matchings]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Bets,2500.0,E,1332860400,"[math, matrices]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Demonstration,500.0,A,1332860400,"[implementation, math]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Minimal Spell,1000.0,B,1332860400,"[implementation, strings]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Trolleybuses,1500.0,C,1332860400,"[implementation, math]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Huge Prize,2000.0,D,1332860400,"[dp, probabilities]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Numbers,2500.0,E,1332860400,[],PROGRAMMING +163,VK Cup 2012 Round 2,12,Substring and Subsequence,1000.0,A,1332687900,[dp],PROGRAMMING +163,VK Cup 2012 Round 2,12,Lemmings,1000.0,B,1332687900,[binary search],PROGRAMMING +163,VK Cup 2012 Round 2,12,Conveyor,1500.0,C,1332687900,[sortings],PROGRAMMING +163,VK Cup 2012 Round 2,12,Large Refrigerator,2000.0,D,1332687900,[brute force],PROGRAMMING +163,VK Cup 2012 Round 2,12,e-Government,2500.0,E,1332687900,"[data structures, dfs and similar, dp, strings, trees]",PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Chores,500.0,A,1332687900,[sortings],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Replacing Digits,1000.0,B,1332687900,[greedy],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Substring and Subsequence,1500.0,C,1332687900,[dp],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Lemmings,2000.0,D,1332687900,[],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Conveyor,2500.0,E,1332687900,[],PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Rank List,500.0,A,1332516600,"[binary search, implementation, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Polygons,3000.0,B,1332516600,"[geometry, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Median,1000.0,C,1332516600,"[greedy, math, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Shoe Store,3000.0,D,1332516600,"[dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Tetrahedron,1000.0,E,1332516600,"[dp, math, matrices]",PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Pentagonal numbers,,A,1332083400,"[*special, implementation]",PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Binary notation,,B,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Prime factorization,,C,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Remove digits,,D,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,HQ9+,,E,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Factorial zeros,,F,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Non-decimal sum,,G,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Alternating case,,H,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Truncatable primes,,I,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Brackets,,J,1332083400,[*special],PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Supercentral Point,500.0,A,1331911800,[implementation],PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Burning Midnight Oil,1000.0,B,1331911800,"[binary search, implementation]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Another Problem on Strings,1500.0,C,1331911800,"[binary search, brute force, dp, math, strings, two pointers]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Beard Graph,2000.0,D,1331911800,"[data structures, dsu, trees]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Compatible Numbers,2500.0,E,1331911800,"[bitmasks, brute force, dfs and similar, dp]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Dress'em in Vests!,1000.0,A,1331478300,"[binary search, brute force, greedy, two pointers]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Discounts,1000.0,B,1331478300,"[constructive algorithms, greedy, sortings]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Abracadabra,2000.0,C,1331478300,[divide and conquer],PROGRAMMING +161,VK Cup 2012 Round 1,12,Distance in Tree,2000.0,D,1331478300,"[dfs and similar, dp, trees]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Polycarpus the Safecracker,2500.0,E,1331478300,"[brute force, dp]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Friends or Not,500.0,A,1331280000,"[*special, greedy, implementation]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Matchmaker,1000.0,B,1331280000,"[greedy, sortings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,String Manipulation 1.0,1500.0,C,1331280000,"[binary search, brute force, data structures, strings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Palindrome pairs,2000.0,D,1331280000,"[*special, brute force, dp, strings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Zebra Tower,2500.0,E,1331280000,"[data structures, greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Twins,500.0,A,1331046000,"[greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Unlucky Ticket,1000.0,B,1331046000,"[greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Find Pair,1500.0,C,1331046000,"[implementation, math, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Edges in MST,2000.0,D,1331046000,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Buses and People,2500.0,E,1331046000,"[binary search, data structures, sortings]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Next Round,500.0,A,1330804800,[implementation],PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Taxi,1000.0,B,1330804800,"[greedy, implementation]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Cd and pwd commands,1000.0,C,1330804800,"[data structures, implementation]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Ice Sculptures,1500.0,D,1330804800,"[brute force, number theory]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Phone Talks,2000.0,E,1330804800,"[dp, sortings]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Message,500.0,A,1330536600,[brute force],PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Suspects,1000.0,B,1330536600,"[constructive algorithms, data structures, implementation]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Cipher,1500.0,C,1330536600,"[combinatorics, dp]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Clues,2500.0,D,1330536600,"[combinatorics, graphs]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Mrs. Hudson's Pancakes,2500.0,E,1330536600,"[brute force, dp]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Game Outcome,500.0,A,1330536600,[brute force],PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Trace,1000.0,B,1330536600,"[geometry, sortings]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Message,1500.0,C,1330536600,"[brute force, dp, strings]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Suspects,2000.0,D,1330536600,[implementation],PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Cipher,2500.0,E,1330536600,"[dp, math]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Hometask,500.0,A,1330095600,[greedy],PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Colliders,1000.0,B,1330095600,"[math, number theory]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Double Profiles,1500.0,C,1330095600,"[graphs, hashing, sortings]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Flatland Fencing,2000.0,D,1330095600,"[games, math]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Martian Colony,2500.0,E,1330095600,[geometry],PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,I_love_\%username\%,500.0,A,1330095600,[brute force],PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Combination,1000.0,B,1330095600,"[greedy, sortings]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Hometask,1500.0,C,1330095600,"[dp, greedy]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Colliders,2000.0,D,1330095600,"[math, number theory]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Double Profiles,2500.0,E,1330095600,"[hashing, sortings]",PROGRAMMING +153,Surprise Language Round #5,12,A + B,,A,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Binary notation,,B,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Caesar Cipher,,C,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Date Change,,D,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Euclidean Distance,,E,1329922800,[*special],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Marks,500.0,A,1329750000,[implementation],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Steps,1000.0,B,1329750000,"[binary search, implementation]",PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Pocket Book,1500.0,C,1329750000,[combinatorics],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Frames,2500.0,D,1329750000,[brute force],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Garden,2500.0,E,1329750000,"[bitmasks, dp, graphs, trees]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Win or Freeze,500.0,A,1329490800,"[games, number theory]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Quantity of Strings,500.0,B,1329490800,"[combinatorics, dfs and similar, math]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Smart Cheater,1000.0,C,1329490800,"[data structures, math, probabilities]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Mission Impassable,1500.0,D,1329490800,[dp],PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Freezing with Style,3000.0,E,1329490800,"[binary search, data structures, divide and conquer, trees]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Soft Drinking,500.0,A,1329490800,"[implementation, math]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Phone Numbers,1000.0,B,1329490800,"[implementation, strings]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Win or Freeze,1500.0,C,1329490800,"[games, greedy, number theory]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Quantity of Strings,1500.0,D,1329490800,"[combinatorics, dsu]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Smart Cheater,3000.0,E,1329490800,[],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Business trip,500.0,A,1328886000,"[greedy, implementation, sortings]",PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Martian Clock,1000.0,B,1328886000,[implementation],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Division into Teams,1500.0,C,1328886000,"[greedy, math, sortings]",PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Coloring Brackets,2500.0,D,1328886000,[dp],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Martian Strings,2500.0,E,1328886000,"[string suffix structures, strings]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Insomnia cure,1000.0,A,1328198400,"[constructive algorithms, implementation, math]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Escape,1000.0,B,1328198400,"[implementation, math]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Terse princess,1000.0,C,1328198400,"[constructive algorithms, greedy]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Bag of mice,1000.0,D,1328198400,"[dp, games, math, probabilities]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Porcelain,1000.0,E,1328198400,[dp],PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Conversion,500.0,A,1327215600,"[greedy, implementation]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Number 2,1000.0,B,1327215600,[constructive algorithms],PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Subsequence,1500.0,C,1327215600,"[combinatorics, dp, math]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Pair,2500.0,D,1327215600,"[combinatorics, data structures, implementation]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Queries,2500.0,E,1327215600,[data structures],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Ticket,500.0,A,1327215600,[implementation],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Mask,1000.0,B,1327215600,"[brute force, implementation]",PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Conversion,1500.0,C,1327215600,[greedy],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Number 2,2000.0,D,1327215600,"[brute force, constructive algorithms, implementation]",PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Subsequence,2500.0,E,1327215600,"[combinatorics, dp]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Arrival of the General,500.0,A,1326899100,[implementation],PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Meeting,1000.0,B,1326899100,[implementation],PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Anagram Search,1500.0,C,1326899100,"[implementation, strings]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Missile Silos,2000.0,D,1326899100,"[data structures, dfs and similar, graphs, shortest paths]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Competition,2500.0,E,1326899100,"[data structures, greedy]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Farmer,500.0,A,1326380700,"[brute force, math]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help General,1000.0,B,1326380700,"[constructive algorithms, greedy, implementation]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Caretaker,1500.0,C,1326380700,"[brute force, dp]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Shrek and Donkey 2,2000.0,D,1326380700,[games],PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Greg the Dwarf 2,2500.0,E,1326380700,[geometry],PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Vasilisa the Wise 2,500.0,A,1326380700,"[brute force, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Kingdom of Far Far Away 2,1000.0,B,1326380700,"[implementation, strings]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Farmer,1500.0,C,1326380700,"[implementation, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help General,2000.0,D,1326380700,"[graph matchings, greedy, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Caretaker,2500.0,E,1326380700,[],PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Amusing Joke,500.0,A,1326034800,"[implementation, sortings, strings]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Hopscotch,1000.0,B,1326034800,"[geometry, math]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Queue,2000.0,C,1326034800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Take-off Ramps,2000.0,D,1326034800,"[graphs, shortest paths]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Clearing Up,2500.0,E,1326034800,"[constructive algorithms, dp, dsu, graphs]",PROGRAMMING +140,Codeforces Round #100,12,New Year Table,500.0,A,1325689200,"[geometry, math]",PROGRAMMING +140,Codeforces Round #100,12,New Year Cards,1000.0,B,1325689200,"[brute force, greedy, implementation]",PROGRAMMING +140,Codeforces Round #100,12,New Year Snowmen,1500.0,C,1325689200,"[binary search, data structures, greedy]",PROGRAMMING +140,Codeforces Round #100,12,New Year Contest,2000.0,D,1325689200,"[greedy, sortings]",PROGRAMMING +140,Codeforces Round #100,12,New Year Garland,2500.0,E,1325689200,"[combinatorics, dp]",PROGRAMMING +140,Codeforces Round #100,12,New Year Snowflake,3000.0,F,1325689200,"[geometry, sortings]",PROGRAMMING +147,Codeforces Testing Round #4,12,Punctuation,500.0,A,1325602800,"[implementation, strings]",PROGRAMMING +147,Codeforces Testing Round #4,12,Smile House,1000.0,B,1325602800,"[binary search, graphs, matrices]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Literature Lesson,500.0,A,1324728000,[implementation],PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Digits Permutations,1000.0,B,1324728000,[greedy],PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Mushroom Gnomes - 2,2000.0,C,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,World of Darkraft,2000.0,D,1324728000,"[dp, games]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Hellish Constraints,2500.0,E,1324728000,"[brute force, dp, two pointers]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Petr and Book,500.0,A,1324728000,[implementation],PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Wallpaper,1000.0,B,1324728000,"[implementation, math]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Literature Lesson,1500.0,C,1324728000,"[implementation, strings]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Digits Permutations,2000.0,D,1324728000,[implementation],PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Mushroom Gnomes - 2,3000.0,E,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Postcards and photos,500.0,A,1324015200,[implementation],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Permutation,1000.0,B,1324015200,[greedy],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,History,1500.0,C,1324015200,[sortings],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Palindromes,2000.0,D,1324015200,[dp],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Last Chance,2500.0,E,1324015200,"[data structures, implementation]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Replacement,500.0,A,1323443100,"[implementation, sortings]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Rectangle and Square,1000.0,B,1323443100,"[brute force, geometry, math]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Zero-One,1500.0,C,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Cycle,2000.0,D,1323443100,"[brute force, dfs and similar, implementation]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Weak Subsequence,2500.0,E,1323443100,[combinatorics],PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Presents,500.0,A,1323443100,[implementation],PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Ternary Logic,1000.0,B,1323443100,"[implementation, math]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Replacement,1500.0,C,1323443100,"[implementation, sortings]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Rectangle and Square,2000.0,D,1323443100,"[geometry, implementation]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Zero-One,2500.0,E,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Turing Tape,500.0,A,1322924400,[implementation],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Piet,1500.0,B,1322924400,[implementation],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Logo Turtle,1500.0,C,1322924400,[dp],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Constants in the language of Shakespeare,2000.0,D,1322924400,"[constructive algorithms, dp, greedy]",PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Bits of merry old England,2500.0,E,1322924400,[flows],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,HQ9+,500.0,A,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Unary,1000.0,B,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Turing Tape,1500.0,C,1322924400,"[implementation, math]",PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Piet,2500.0,D,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Logo Turtle,2500.0,E,1322924400,"[dp, implementation]",PROGRAMMING +134,Codeforces Testing Round #3,12,Average Numbers,500.0,A,1322838000,"[brute force, implementation]",PROGRAMMING +134,Codeforces Testing Round #3,12,Pairs of Numbers,1000.0,B,1322838000,"[brute force, dfs and similar, math, number theory]",PROGRAMMING +134,Codeforces Testing Round #3,12,Swaps,1500.0,C,1322838000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,cAPS lOCK,500.0,A,1322233200,"[implementation, strings]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Opposites Attract,1000.0,B,1322233200,"[implementation, math]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,The World is a Theatre,1500.0,C,1322233200,"[combinatorics, math]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Subway,2000.0,D,1322233200,"[dfs and similar, graphs]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Yet Another Task with Queens,2500.0,E,1322233200,[sortings],PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Present to Mom,2500.0,F,1322233200,"[binary search, two pointers]",PROGRAMMING +130,Unknown Language Round #4,12,Hexagonal numbers,,A,1321801200,"[*special, implementation]",PROGRAMMING +130,Unknown Language Round #4,12,Gnikool Ssalg,,B,1321801200,"[*special, implementation, strings]",PROGRAMMING +130,Unknown Language Round #4,12,Decimal sum,,C,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Exponentiation,,D,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Tribonacci numbers,,E,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Prime factorization,,F,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,CAPS LOCK ON,,G,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Balanced brackets,,H,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Array sorting,,I,1321801200,"[*special, sortings]",PROGRAMMING +130,Unknown Language Round #4,12,Date calculation,,J,1321801200,[*special],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Statues,1000.0,A,1321337400,[dfs and similar],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,String,1500.0,B,1321337400,"[brute force, constructive algorithms, hashing, string suffix structures, strings]",PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Games with Rectangle,1500.0,C,1321337400,"[combinatorics, dp]",PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Numbers,2000.0,D,1321337400,[constructive algorithms],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Birthday,2500.0,E,1321337400,"[geometry, math]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Cookies,500.0,A,1321337400,[implementation],PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Students and Shoelaces,1000.0,B,1321337400,"[brute force, dfs and similar, graphs]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Statues,2000.0,C,1321337400,"[dfs and similar, graphs, implementation]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,String,2500.0,D,1321337400,"[implementation, string suffix structures, strings]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Games with Rectangle,2500.0,E,1321337400,"[combinatorics, dp]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Hot Bath,500.0,A,1320858000,"[binary search, brute force, math]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Password,1000.0,B,1320858000,"[binary search, dp, hashing, string suffix structures, strings]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,E-reader Display,1500.0,C,1320858000,"[constructive algorithms, greedy]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Fibonacci Sums,2000.0,D,1320858000,"[dp, math]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Pills,2500.0,E,1320858000,"[brute force, flows]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Wasted Time,500.0,A,1320858000,[geometry],PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Canvas Frames,1000.0,B,1320858000,[implementation],PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Hot Bath,1500.0,C,1320858000,"[binary search, math]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Password,2000.0,D,1320858000,"[hashing, strings]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,E-reader Display,2500.0,E,1320858000,[implementation],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Prime Permutation,1000.0,A,1320333000,"[implementation, number theory, strings]",PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Squares,1000.0,B,1320333000,[math],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Brackets,1500.0,C,1320333000,"[combinatorics, dp, greedy]",PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,String,2000.0,D,1320333000,[string suffix structures],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Maze,2500.0,E,1320333000,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,The number of positions,500.0,A,1320333000,[math],PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Permutations,1000.0,B,1320333000,"[brute force, combinatorics, implementation]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Prime Permutation,2000.0,C,1320333000,"[constructive algorithms, dfs and similar, dsu, greedy, number theory, sortings, strings]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Squares,2000.0,D,1320333000,"[brute force, constructive algorithms, number theory]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Brackets,2500.0,E,1320333000,[],PROGRAMMING +125,Codeforces Testing Round #2,12,Measuring Lengths in Baden,1000.0,A,1319893200,[math],PROGRAMMING +125,Codeforces Testing Round #2,12,Simple XML,1500.0,B,1319893200,[implementation],PROGRAMMING +125,Codeforces Testing Round #2,12,Hobbits' Party,2000.0,C,1319893200,"[constructive algorithms, greedy]",PROGRAMMING +125,Codeforces Testing Round #2,12,Two progressions,3000.0,D,1319893200,"[constructive algorithms, greedy]",PROGRAMMING +125,Codeforces Testing Round #2,12,MST Company,5000.0,E,1319893200,"[binary search, graphs]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Sum,500.0,A,1319727600,[implementation],PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Transformation,1000.0,B,1319727600,[strings],PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Permutation,1500.0,C,1319727600,"[brute force, combinatorics, number theory]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Segments,2000.0,D,1319727600,"[binary search, implementation, two pointers]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Array,2500.0,E,1319727600,[data structures],PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Division,500.0,A,1319727600,"[brute force, number theory]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Substring,1000.0,B,1319727600,"[brute force, implementation]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Sum,1500.0,C,1319727600,"[brute force, math]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Transformation,2000.0,D,1319727600,[brute force],PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Permutation,2500.0,E,1319727600,[],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Elevator,,A,1318919400,"[brute force, implementation, math]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Quiz League,,B,1318919400,[implementation],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Winnie-the-Pooh and honey,,C,1318919400,"[implementation, math]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Three Sons,,D,1318919400,[brute force],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Put Knight!,,E,1318919400,[games],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Spiders,,F,1318919400,"[dp, greedy, trees]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Boom,,G,1318919400,[implementation],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Brevity is Soul of Wit,,H,1318919400,[graph matchings],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Luck is in Numbers,,I,1318919400,[greedy],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Minimum Sum,,J,1318919400,"[divide and conquer, geometry, sortings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Epic Game,500.0,A,1318604400,[implementation],PROGRAMMING +119,Codeforces Beta Round #90,12,Before Exam,1000.0,B,1318604400,"[constructive algorithms, implementation, sortings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Education Reform,1500.0,C,1318604400,[dp],PROGRAMMING +119,Codeforces Beta Round #90,12,String Transformation,2000.0,D,1318604400,"[hashing, strings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Alternative Reality,2500.0,E,1318604400,[geometry],PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,String Task,500.0,A,1317999600,"[implementation, strings]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Present from Lena,1000.0,B,1317999600,"[constructive algorithms, implementation]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Fancy Number,1500.0,C,1317999600,"[brute force, greedy, sortings, strings]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Caesar's Legions,2000.0,D,1317999600,[dp],PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Bertown roads,2500.0,E,1317999600,"[dfs and similar, graphs]",PROGRAMMING +117,Codeforces Beta Round #88,12,Elevator,500.0,A,1316790000,"[implementation, math]",PROGRAMMING +117,Codeforces Beta Round #88,12,Very Interesting Game,1000.0,B,1316790000,"[brute force, number theory]",PROGRAMMING +117,Codeforces Beta Round #88,12,Cycle,1500.0,C,1316790000,"[dfs and similar, graphs]",PROGRAMMING +117,Codeforces Beta Round #88,12,Not Quick Transformation,2000.0,D,1316790000,"[divide and conquer, math]",PROGRAMMING +117,Codeforces Beta Round #88,12,Tree or not Tree,2500.0,E,1316790000,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Party,500.0,A,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Lawnmower,1000.0,B,1316098800,"[greedy, sortings]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Plumber,1500.0,C,1316098800,[math],PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Unambiguous Arithmetic Expression,2000.0,D,1316098800,"[dp, expression parsing]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Linear Kingdom Races,2500.0,E,1316098800,"[data structures, dp]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Tram,500.0,A,1316098800,[implementation],PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Little Pigs and Wolves,1000.0,B,1316098800,"[greedy, implementation]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Party,1500.0,C,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Lawnmower,2000.0,D,1316098800,"[dp, greedy]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Plumber,2500.0,E,1316098800,[],PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Grammar Lessons,500.0,A,1315494000,"[implementation, strings]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Petr#,1000.0,B,1315494000,"[brute force, data structures, hashing, strings]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Double Happiness,1500.0,C,1315494000,"[brute force, number theory]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Museum,2000.0,D,1315494000,"[matrices, probabilities]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Sleeping,2500.0,E,1315494000,"[combinatorics, implementation, math]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Cifera,500.0,A,1315494000,[math],PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,PFAST Inc.,1000.0,B,1315494000,"[bitmasks, brute force]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Grammar Lessons,1500.0,C,1315494000,[implementation],PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Petr#,2000.0,D,1315494000,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Double Happiness,2500.0,E,1315494000,[number theory],PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Inequiations,500.0,A,1315051200,[greedy],PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Divisors,1000.0,B,1315051200,"[binary search, data structures, number theory]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Spiders,1500.0,C,1315051200,"[bitmasks, dp, dsu]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Coloring,2000.0,D,1315051200,"[combinatorics, dp]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Rectangle,2500.0,E,1315051200,[],PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Strings,500.0,A,1315051200,"[implementation, strings]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Square,1000.0,B,1315051200,"[implementation, math]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Inequiations,1500.0,C,1315051200,"[greedy, math]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Divisors,2000.0,D,1315051200,"[implementation, number theory]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Spiders,2500.0,E,1315051200,"[bitmasks, dp]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sum of Digits,500.0,A,1314633600,"[brute force, implementation]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Probability,1000.0,B,1314633600,"[brute force, probabilities]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Tree,1500.0,C,1314633600,"[dp, dsu, trees]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sorting,2000.0,D,1314633600,"[constructive algorithms, sortings]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Interval,2500.0,E,1314633600,"[brute force, math]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Nearly Lucky Number,500.0,A,1314633600,[implementation],PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky String,1000.0,B,1314633600,"[constructive algorithms, strings]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Sum of Digits,1500.0,C,1314633600,"[implementation, math]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Probability,2000.0,D,1314633600,"[brute force, combinatorics, dfs and similar, probabilities]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Tree,2500.0,E,1314633600,"[combinatorics, dfs and similar, trees]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Dorm Water Supply,500.0,A,1314111600,"[dfs and similar, graphs]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Basketball Team,1000.0,B,1314111600,"[combinatorics, dp, probabilities]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Arrangement,1500.0,C,1314111600,"[bitmasks, dp]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Crime Management,2000.0,D,1314111600,"[dp, matrices]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Darts,2500.0,E,1314111600,"[geometry, probabilities]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Palindromic Times,500.0,A,1314111600,"[implementation, strings]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Datatypes,1000.0,B,1314111600,"[math, sortings]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Dorm Water Supply,1500.0,C,1314111600,"[dfs and similar, implementation]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Basketball Team,2000.0,D,1314111600,"[combinatorics, math, probabilities]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Arrangement,2500.0,E,1314111600,[],PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Card Game,500.0,A,1313766000,[implementation],PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Choosing Laptop,1000.0,B,1313766000,"[brute force, implementation]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Buns,1500.0,C,1313766000,"[chinese remainder theorem, geometry]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Treasure Island,2000.0,D,1313766000,"[brute force, implementation]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Space Rescuers,2500.0,E,1313766000,"[geometry, ternary search]",PROGRAMMING +105,Codeforces Beta Round #81,12,Transmigration,500.0,A,1313247600,[implementation],PROGRAMMING +105,Codeforces Beta Round #81,12,Dark Assembly,1000.0,B,1313247600,"[brute force, probabilities]",PROGRAMMING +105,Codeforces Beta Round #81,12,Item World,1500.0,C,1313247600,"[brute force, implementation, sortings]",PROGRAMMING +105,Codeforces Beta Round #81,12,Entertaining Geodetics,2000.0,D,1313247600,"[brute force, dsu, implementation]",PROGRAMMING +105,Codeforces Beta Round #81,12,Lift and Throw,2500.0,E,1313247600,[brute force],PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Testing Pants for Sadness,500.0,A,1312714800,"[greedy, implementation, math]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Cthulhu,1000.0,B,1312714800,"[dfs and similar, dsu, graphs]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Russian Roulette,1500.0,C,1312714800,"[constructive algorithms, greedy]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Time to Raid Cowavans,2000.0,D,1312714800,"[brute force, data structures, sortings]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Buying Sets,2500.0,E,1312714800,"[flows, graph matchings]",PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Blackjack,500.0,A,1312714800,[implementation],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Testing Pants for Sadness,1000.0,B,1312714800,[math],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Cthulhu,1500.0,C,1312714800,"[dsu, trees]",PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Russian Roulette,2000.0,D,1312714800,[math],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Time to Raid Cowavans,2500.0,E,1312714800,[],PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Homework,500.0,A,1312390800,[greedy],PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Buses,1000.0,B,1312390800,"[binary search, data structures, dp]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Vectors,1500.0,C,1312390800,"[implementation, math]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Castle,2000.0,D,1312390800,"[dp, greedy, probabilities, sortings, trees]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Candies and Stones,2500.0,E,1312390800,"[divide and conquer, dp]",PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Clothes,500.0,A,1312390800,[brute force],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Sum of Digits,1000.0,B,1312390800,[implementation],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Homework,1500.0,C,1312390800,[greedy],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Buses,2000.0,D,1312390800,"[binary search, data structures, dp]",PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Vectors,2500.0,E,1312390800,[],PROGRAMMING +100,Unknown Language Round #3,12,Carpeting the Room,,A,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Friendly Numbers,,B,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,A+B,,C,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,World of Mouth,,D,1312005600,"[*special, strings]",PROGRAMMING +100,Unknown Language Round #3,12,Lamps in a Line,,E,1312005600,"[*special, math]",PROGRAMMING +100,Unknown Language Round #3,12,Polynom,,F,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Name the album,,G,1312005600,"[*special, data structures, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Battleship,,H,1312005600,"[*special, dfs and similar, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Rotation,,I,1312005600,"[*special, geometry, math]",PROGRAMMING +100,Unknown Language Round #3,12,Interval Coloring,,J,1312005600,"[*special, greedy, math]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Victoria the Wise,500.0,A,1311346800,"[brute force, implementation]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help King,1000.0,B,1311346800,"[implementation, probabilities, trees]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Greg the Dwarf,1500.0,C,1311346800,"[geometry, ternary search]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Monks,2000.0,D,1311346800,[constructive algorithms],PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Shrek and Donkey,2500.0,E,1311346800,"[dp, games, math, probabilities]",PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Far Away Kingdom,500.0,A,1311346800,[strings],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Chef Gerasim,1000.0,B,1311346800,"[implementation, sortings]",PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Victoria the Wise,1500.0,C,1311346800,[brute force],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help King,2000.0,D,1311346800,[],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Greg the Dwarf,2500.0,E,1311346800,"[binary search, geometry, ternary search]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Domino,500.0,A,1310731200,"[brute force, implementation]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Superset,1500.0,B,1310731200,"[constructive algorithms, divide and conquer]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Winning Strategy,2000.0,C,1310731200,"[binary search, graphs, math, shortest paths]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Robot in Basement,2000.0,D,1310731200,"[bitmasks, brute force, implementation]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Leaders,2500.0,E,1310731200,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Hockey,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Numbers,1000.0,B,1310137200,"[dp, greedy]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Volleyball,1500.0,C,1310137200,[shortest paths],PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Horse Races,2000.0,D,1310137200,"[dp, math]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Country,2500.0,E,1310137200,"[dp, dsu, graphs]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Football,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Lucky Numbers (easy),1000.0,B,1310137200,"[binary search, bitmasks, brute force]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Hockey,1500.0,C,1310137200,"[implementation, strings]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Volleyball,2000.0,D,1310137200,"[graphs, shortest paths]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Horse Races,2500.0,E,1310137200,[],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Frames,500.0,A,1309446000,[implementation],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,End of Exams,1000.0,B,1309446000,[greedy],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Azembler,1500.0,C,1309446000,"[brute force, implementation]",PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Flags,2000.0,D,1309446000,"[dp, math, matrices]",PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Lostborn,2500.0,E,1309446000,"[dp, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Restoring Password,500.0,A,1309446000,"[implementation, strings]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Friends,1000.0,B,1309446000,"[implementation, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Frames,1500.0,C,1309446000,[math],PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,End of Exams,2000.0,D,1309446000,"[greedy, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Azembler,2500.0,E,1309446000,[brute force],PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Newspaper Headline,500.0,A,1308582000,"[greedy, strings]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Queue,1000.0,B,1308582000,"[binary search, data structures]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Ski Base,1500.0,C,1308582000,"[combinatorics, dsu, graphs]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Grocer's Problem,2500.0,D,1308582000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Igloo Skyscraper,2500.0,E,1308582000,"[data structures, geometry]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Chips,500.0,A,1308582000,"[implementation, math]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Binary Number,1000.0,B,1308582000,[greedy],PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Newspaper Headline,1500.0,C,1308582000,"[binary search, data structures, dp, greedy]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Queue,2000.0,D,1308582000,"[binary search, data structures, dp]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Ski Base,2500.0,E,1308582000,"[data structures, dsu, graphs]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Robbery,500.0,A,1308236400,[greedy],PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Widget Library,1000.0,B,1308236400,"[dp, expression parsing, graphs, implementation]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Chip Play,1000.0,C,1308236400,"[brute force, data structures, implementation]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Space mines,1500.0,D,1308236400,[geometry],PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Fire and Ice,2500.0,E,1308236400,[greedy],PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Cableway,500.0,A,1308236400,"[greedy, math]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,African Crossword,1000.0,B,1308236400,"[implementation, strings]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Robbery,1500.0,C,1308236400,"[greedy, math]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Widget Library,2000.0,D,1308236400,[],PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Chip Play,2000.0,E,1308236400,[],PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Trains,500.0,A,1307458800,[math],PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Vasya and Types,1000.0,B,1307458800,"[implementation, strings]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Interesting Game,1500.0,C,1307458800,"[dp, games]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Beautiful Road,2000.0,D,1307458800,"[dfs and similar, dp, dsu, implementation, sortings, trees]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Mogohu-Rea Idol,2500.0,E,1307458800,[geometry],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Chord,500.0,A,1307458800,"[brute force, implementation]",PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Keyboard,1000.0,B,1307458800,[implementation],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Trains,1500.0,C,1307458800,[number theory],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Vasya and Types,2000.0,D,1307458800,[implementation],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Interesting Game,2500.0,E,1307458800,[],PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Reflection,500.0,A,1306077000,[math],PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Tetris revisited,1000.0,B,1306077000,"[constructive algorithms, graph matchings, greedy, math]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Genetic engineering,2000.0,C,1306077000,"[dp, string suffix structures, trees]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Powerful array,2500.0,D,1306077000,"[data structures, implementation, math, two pointers]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Long sequence,2500.0,E,1306077000,"[brute force, math, matrices]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Domino,500.0,A,1305903600,"[constructive algorithms, implementation]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Embassy Queue,1000.0,B,1305903600,[data structures],PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Petya and Tree,1500.0,C,1305903600,"[binary search, dfs and similar, probabilities, sortings, trees]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Sum of Medians,2000.0,D,1305903600,"[binary search, brute force, data structures, implementation]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Guard Towers,2500.0,E,1305903600,"[binary search, dsu, geometry, graphs, sortings]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Magical Array,500.0,A,1305299400,[math],PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Doctor,1000.0,B,1305299400,"[binary search, math, sortings]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Track,1500.0,C,1305299400,"[graphs, greedy, shortest paths]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Numbers,2000.0,D,1305299400,"[dp, math, number theory]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Two Subsequences,2500.0,E,1305299400,"[bitmasks, dp]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Toy Army,500.0,A,1305299400,"[math, number theory]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Magical Array,1000.0,B,1305299400,"[combinatorics, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Biathlon,1500.0,C,1305299400,"[binary search, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Doctor,2000.0,D,1305299400,"[binary search, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Track,2500.0,E,1305299400,"[brute force, shortest paths]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Double Cola,500.0,A,1304694000,"[implementation, math]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Sets,1000.0,B,1304694000,"[constructive algorithms, hashing, implementation]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,General Mobilization,1500.0,C,1304694000,"[data structures, dfs and similar, sortings]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Two out of Three,2000.0,D,1304694000,[dp],PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Corridor,2500.0,E,1304694000,[geometry],PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Plug-in,500.0,A,1304485200,[implementation],PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Sequence Formatting,1000.0,B,1304485200,"[implementation, strings]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Average Score,1500.0,C,1304485200,"[math, sortings]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Polycarp's Picture Gallery,2000.0,D,1304485200,"[constructive algorithms, greedy]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Pairs,2500.0,E,1304485200,"[dfs and similar, dp, dsu, graphs, implementation, trees]",PROGRAMMING +79,Codeforces Beta Round #71,12,Bus Game,500.0,A,1304175600,[greedy],PROGRAMMING +79,Codeforces Beta Round #71,12,Colorful Field,1000.0,B,1304175600,"[implementation, sortings]",PROGRAMMING +79,Codeforces Beta Round #71,12,Beaver,1500.0,C,1304175600,"[data structures, dp, greedy, hashing, strings, two pointers]",PROGRAMMING +79,Codeforces Beta Round #71,12,Password,2000.0,D,1304175600,"[bitmasks, dp, shortest paths]",PROGRAMMING +79,Codeforces Beta Round #71,12,Security System,2500.0,E,1304175600,[math],PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Haiku,500.0,A,1303916400,"[implementation, strings]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Easter Eggs,1000.0,B,1303916400,"[constructive algorithms, implementation]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Beaver Game,1500.0,C,1303916400,"[dp, games, number theory]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Archer's Shot,2000.0,D,1303916400,"[binary search, geometry, math, two pointers]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Evacuation,2500.0,E,1303916400,"[flows, graphs, shortest paths]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Heroes,500.0,A,1303226100,"[brute force, implementation]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Falling Anvils,1000.0,B,1303226100,"[math, probabilities]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Beavermuncher-0xFF,1500.0,C,1303226100,"[dfs and similar, dp, dsu, greedy, trees]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Domino Carpet,2000.0,D,1303226100,"[dp, implementation]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Martian Food,2000.0,E,1303226100,[geometry],PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Panoramix's Prediction,500.0,A,1303226100,[brute force],PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Depression,1000.0,B,1303226100,"[geometry, math]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Heroes,1500.0,C,1303226100,"[brute force, implementation]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Falling Anvils,2000.0,D,1303226100,"[geometry, probabilities]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Beavermuncher-0xFF,2500.0,E,1303226100,[],PROGRAMMING +74,Codeforces Beta Round #68,12,Room Leader,500.0,A,1302879600,[implementation],PROGRAMMING +74,Codeforces Beta Round #68,12,Train,1000.0,B,1302879600,"[dp, games, greedy]",PROGRAMMING +74,Codeforces Beta Round #68,12,Chessboard Billiard,1500.0,C,1302879600,"[dfs and similar, dsu, graphs, number theory]",PROGRAMMING +74,Codeforces Beta Round #68,12,Hanger,2000.0,D,1302879600,[data structures],PROGRAMMING +74,Codeforces Beta Round #68,12,Shift It!,2500.0,E,1302879600,[constructive algorithms],PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Life Without Zeros,500.0,A,1302706800,[implementation],PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Facetook Priority Wall,1000.0,B,1302706800,"[expression parsing, implementation, strings]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Modified GCD,1500.0,C,1302706800,"[binary search, number theory]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Big Maximum Sum,2000.0,D,1302706800,"[data structures, dp, greedy, implementation, math, trees]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Ship's Shortest Path,2500.0,E,1302706800,"[geometry, shortest paths]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Gift,,A,1302609600,"[dsu, graphs, sortings, trees]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Mice,,B,1302609600,"[greedy, two pointers]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Mutation,,C,1302609600,"[bitmasks, dp, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Plus and xor,,D,1302609600,"[dp, greedy, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Points,,E,1302609600,"[implementation, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Tourist,,F,1302609600,"[binary search, data structures, dp]",PROGRAMMING +73,Codeforces Beta Round #66,12,The Elder Trolls IV: Oblivon,500.0,A,1302422400,"[greedy, math]",PROGRAMMING +73,Codeforces Beta Round #66,12,Need For Brake,1000.0,B,1302422400,"[binary search, greedy, sortings]",PROGRAMMING +73,Codeforces Beta Round #66,12,LionAge II,1000.0,C,1302422400,[dp],PROGRAMMING +73,Codeforces Beta Round #66,12,FreeDiv,1500.0,D,1302422400,"[dfs and similar, graphs, greedy]",PROGRAMMING +73,Codeforces Beta Round #66,12,Morrowindows,1500.0,E,1302422400,"[math, number theory]",PROGRAMMING +73,Codeforces Beta Round #66,12,Plane of Tanks,2000.0,F,1302422400,"[brute force, geometry]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Way Too Long Words,500.0,A,1301410800,[strings],PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Progress Bar,1000.0,B,1301410800,"[implementation, math]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Round Table Knights,1500.0,C,1301410800,"[dp, math, number theory]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Solitaire,2000.0,D,1301410800,"[brute force, implementation]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Nuclear Fusion,2500.0,E,1301410800,"[bitmasks, dp]",PROGRAMMING +70,Codeforces Beta Round #64,12,Cookies,500.0,A,1301155200,[math],PROGRAMMING +70,Codeforces Beta Round #64,12,Text Messaging,1000.0,B,1301155200,"[expression parsing, greedy, strings]",PROGRAMMING +70,Codeforces Beta Round #64,12,Lucky Tickets,1500.0,C,1301155200,"[binary search, data structures, sortings, two pointers]",PROGRAMMING +70,Codeforces Beta Round #64,12,Professor's task,2000.0,D,1301155200,"[data structures, geometry]",PROGRAMMING +70,Codeforces Beta Round #64,12,Information Reform,2500.0,E,1301155200,"[dp, implementation, trees]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Young Physicist,500.0,A,1300809600,"[implementation, math]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Bets,1000.0,B,1300809600,"[greedy, implementation]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Game,1500.0,C,1300809600,[implementation],PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Dot,2000.0,D,1300809600,"[dp, games]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Subsegments,2500.0,E,1300809600,"[data structures, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,"Goshtasp, Vishtasp and Eidi",,A,1300637400,"[*special, greedy, math]",PROGRAMMING +72,Unknown Language Round #2,12,INI-file,,B,1300637400,"[*special, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,Extraordinarily Nice Numbers,,C,1300637400,"[*special, math]",PROGRAMMING +72,Unknown Language Round #2,12,Perse-script,,D,1300637400,"[*special, expression parsing]",PROGRAMMING +72,Unknown Language Round #2,12,Ali goes shopping,,E,1300637400,"[*special, brute force, strings]",PROGRAMMING +72,Unknown Language Round #2,12,Oil,,F,1300637400,"[*special, greedy, math]",PROGRAMMING +72,Unknown Language Round #2,12,Fibonacci army,,G,1300637400,"[*special, dp]",PROGRAMMING +72,Unknown Language Round #2,12,Reverse It!,,H,1300637400,"[*special, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,Goofy Numbers,,I,1300637400,"[*special, implementation]",PROGRAMMING +68,Codeforces Beta Round #62,12,Irrational problem,500.0,A,1300464000,"[implementation, number theory]",PROGRAMMING +68,Codeforces Beta Round #62,12,Energy exchange,1000.0,B,1300464000,[binary search],PROGRAMMING +68,Codeforces Beta Round #62,12,Synchrophasotron,1500.0,C,1300464000,[brute force],PROGRAMMING +68,Codeforces Beta Round #62,12,Half-decay tree,2000.0,D,1300464000,"[data structures, divide and conquer, dp, probabilities]",PROGRAMMING +68,Codeforces Beta Round #62,12,Contact,2500.0,E,1300464000,[geometry],PROGRAMMING +67,Manthan 2011,12,Partial Teacher,500.0,A,1300033800,"[dp, graphs, greedy, implementation]",PROGRAMMING +67,Manthan 2011,12,Restoration of the Permutation,1000.0,B,1300033800,[greedy],PROGRAMMING +67,Manthan 2011,12,Sequence of Balls,1500.0,C,1300033800,[dp],PROGRAMMING +67,Manthan 2011,12,Optical Experiment,2000.0,D,1300033800,"[binary search, data structures, dp]",PROGRAMMING +67,Manthan 2011,12,Save the City!,2500.0,E,1300033800,[geometry],PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Java,500.0,A,1299513600,"[implementation, strings]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Countryside,1000.0,B,1299513600,"[brute force, implementation]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and File System,1500.0,C,1299513600,"[data structures, implementation]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and His Friends,2000.0,D,1299513600,"[constructive algorithms, math, number theory]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Post,2500.0,E,1299513600,"[data structures, dp]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and Three Spells,500.0,A,1299340800,"[implementation, math]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the History of Magic,1000.0,B,1299340800,"[brute force, greedy, implementation]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the Golden Snitch,1500.0,C,1299340800,"[binary search, geometry]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the Sorting Hat,2000.0,D,1299340800,"[brute force, dfs and similar, hashing]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and Moving Staircases,2500.0,E,1299340800,"[dfs and similar, implementation]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Sinking Ship,500.0,A,1298908800,"[implementation, sortings, strings]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Settlers' Training,1000.0,B,1298908800,[implementation],PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Bulls and Cows,1500.0,C,1298908800,"[brute force, implementation]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Dividing Island,2000.0,D,1298908800,[constructive algorithms],PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Sweets Game,2500.0,E,1298908800,"[bitmasks, dfs and similar, dp, games, implementation]",PROGRAMMING +62,Codeforces Beta Round #58,12,A Student's Dream,500.0,A,1298649600,"[greedy, math]",PROGRAMMING +62,Codeforces Beta Round #58,12,Tyndex.Brome,1000.0,B,1298649600,"[binary search, implementation]",PROGRAMMING +62,Codeforces Beta Round #58,12,Inquisition,1500.0,C,1298649600,"[geometry, implementation, sortings]",PROGRAMMING +62,Codeforces Beta Round #58,12,Wormhouse,2000.0,D,1298649600,"[dfs and similar, graphs]",PROGRAMMING +62,Codeforces Beta Round #58,12,World Evil,2500.0,E,1298649600,"[dp, flows]",PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Ultra-Fast Mathematician,500.0,A,1298390400,[implementation],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Hard Work,1000.0,B,1298390400,[strings],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Capture Valerian,1500.0,C,1298390400,[math],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Eternal Victory,2000.0,D,1298390400,"[dfs and similar, graphs, greedy, shortest paths, trees]",PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Enemy is weak,2500.0,E,1298390400,"[data structures, trees]",PROGRAMMING +64,Unknown Language Round #1,12,Factorial,,A,1298304000,"[*special, implementation]",PROGRAMMING +64,Unknown Language Round #1,12,Expression,,B,1298304000,"[*special, expression parsing]",PROGRAMMING +64,Unknown Language Round #1,12,Table,,C,1298304000,"[*special, greedy, implementation, math]",PROGRAMMING +64,Unknown Language Round #1,12,Presents,,D,1298304000,"[*special, greedy]",PROGRAMMING +64,Unknown Language Round #1,12,Prime Segment,,E,1298304000,"[*special, brute force]",PROGRAMMING +64,Unknown Language Round #1,12,Domain,,F,1298304000,"[*special, expression parsing]",PROGRAMMING +64,Unknown Language Round #1,12,Path Canonization,,G,1298304000,[*special],PROGRAMMING +64,Unknown Language Round #1,12,Table Bowling,,H,1298304000,"[*special, sortings]",PROGRAMMING +64,Unknown Language Round #1,12,Sort the Table,,I,1298304000,"[*special, sortings]",PROGRAMMING +60,Codeforces Beta Round #56,12,Where Are My Flakes?,500.0,A,1298131200,"[implementation, two pointers]",PROGRAMMING +60,Codeforces Beta Round #56,12,Serial Time!,1000.0,B,1298131200,"[dfs and similar, dsu]",PROGRAMMING +60,Codeforces Beta Round #56,12,Mushroom Strife,1500.0,C,1298131200,"[brute force, dfs and similar]",PROGRAMMING +60,Codeforces Beta Round #56,12,Savior,2000.0,D,1298131200,"[brute force, dsu, math]",PROGRAMMING +60,Codeforces Beta Round #56,12,Mushroom Gnomes,2500.0,E,1298131200,"[math, matrices]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Word,500.0,A,1297440000,"[implementation, strings]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Fortune Telling,1000.0,B,1297440000,"[implementation, number theory]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Title,1500.0,C,1297440000,[expression parsing],PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Team Arrangement,2000.0,D,1297440000,"[constructive algorithms, greedy, implementation]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Shortest Path,2500.0,E,1297440000,"[graphs, shortest paths]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Chat room,500.0,A,1296489600,"[greedy, strings]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Coins,1000.0,B,1296489600,[greedy],PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Trees,1500.0,C,1296489600,[brute force],PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Calendar,2000.0,D,1296489600,"[greedy, strings]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Expression,2500.0,E,1296489600,[dp],PROGRAMMING +57,Codeforces Beta Round #53,12,Square Earth?,500.0,A,1295971200,"[dfs and similar, greedy, implementation]",PROGRAMMING +57,Codeforces Beta Round #53,12,Martian Architecture,1000.0,B,1295971200,[implementation],PROGRAMMING +57,Codeforces Beta Round #53,12,Array,1500.0,C,1295971200,"[combinatorics, math]",PROGRAMMING +57,Codeforces Beta Round #53,12,Journey,2000.0,D,1295971200,"[dp, math]",PROGRAMMING +57,Codeforces Beta Round #53,12,Chess,2500.0,E,1295971200,"[math, shortest paths]",PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Bar,500.0,A,1295626200,[implementation],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Spoilt Permutation,1000.0,B,1295626200,[implementation],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Corporation Mail,1500.0,C,1295626200,"[data structures, expression parsing, implementation]",PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Changing a String,2000.0,D,1295626200,[dp],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Domino Principle,2500.0,E,1295626200,"[binary search, data structures, sortings]",PROGRAMMING +55,Codeforces Beta Round #51,12,Flea travel,500.0,A,1294992000,"[implementation, math]",PROGRAMMING +55,Codeforces Beta Round #51,12,Smallest number,1000.0,B,1294992000,[brute force],PROGRAMMING +55,Codeforces Beta Round #51,12,Pie or die,1500.0,C,1294992000,[games],PROGRAMMING +55,Codeforces Beta Round #51,12,Beautiful numbers,2000.0,D,1294992000,"[dp, number theory]",PROGRAMMING +55,Codeforces Beta Round #51,12,Very simple problem,2500.0,E,1294992000,"[geometry, two pointers]",PROGRAMMING +54,Codeforces Beta Round #50,12,Presents,500.0,A,1294733700,[implementation],PROGRAMMING +54,Codeforces Beta Round #50,12,Cutting Jigsaw Puzzle,1000.0,B,1294733700,"[hashing, implementation]",PROGRAMMING +54,Codeforces Beta Round #50,12,First Digit Law,1500.0,C,1294733700,"[dp, math, probabilities]",PROGRAMMING +54,Codeforces Beta Round #50,12,Writing a Song,2000.0,D,1294733700,"[brute force, dp]",PROGRAMMING +54,Codeforces Beta Round #50,12,Vacuum Сleaner,2500.0,E,1294733700,[geometry],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Autocomplete,500.0,A,1294329600,[implementation],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Blog Photo,1000.0,B,1294329600,"[binary search, implementation]",PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Little Frog,1500.0,C,1294329600,[constructive algorithms],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Physical Education,2000.0,D,1294329600,[sortings],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Dead Ends,2500.0,E,1294329600,"[bitmasks, dp]",PROGRAMMING +52,Codeforces Testing Round #1,12,123-sequence,500.0,A,1294160400,[implementation],PROGRAMMING +52,Codeforces Testing Round #1,12,Right Triangles,1000.0,B,1294160400,[combinatorics],PROGRAMMING +52,Codeforces Testing Round #1,12,Circular RMQ,1500.0,C,1294160400,[data structures],PROGRAMMING +51,Codeforces Beta Round #48,12,Cheaterius's Problem,500.0,A,1293552000,[implementation],PROGRAMMING +51,Codeforces Beta Round #48,12,bHTML Tables Analisys,1000.0,B,1293552000,[expression parsing],PROGRAMMING +51,Codeforces Beta Round #48,12,Three Base Stations,1500.0,C,1293552000,"[binary search, greedy]",PROGRAMMING +51,Codeforces Beta Round #48,12,Geometrical problem,2000.0,D,1293552000,[implementation],PROGRAMMING +51,Codeforces Beta Round #48,12,Pentagon,2500.0,E,1293552000,"[combinatorics, graphs, matrices]",PROGRAMMING +51,Codeforces Beta Round #48,12,Caterpillar,3000.0,F,1293552000,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +50,Codeforces Beta Round #47,12,Domino piling,500.0,A,1292862000,"[greedy, math]",PROGRAMMING +50,Codeforces Beta Round #47,12,Choosing Symbol Pairs,1000.0,B,1292862000,[strings],PROGRAMMING +50,Codeforces Beta Round #47,12,Happy Farm 5,1500.0,C,1292862000,[geometry],PROGRAMMING +50,Codeforces Beta Round #47,12,Bombing,2000.0,D,1292862000,"[binary search, dp, probabilities]",PROGRAMMING +50,Codeforces Beta Round #47,12,Square Equation Roots,2500.0,E,1292862000,[math],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Sleuth,500.0,A,1292601600,[implementation],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Sum,1000.0,B,1292601600,[math],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Disposition,1500.0,C,1292601600,"[constructive algorithms, math]",PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Game,2000.0,D,1292601600,"[brute force, dp, implementation]",PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Common ancestor,2500.0,E,1292601600,[dp],PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Rock-paper-scissors,,A,1292140800,"[implementation, schedules]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Land Lot,,B,1292140800,"[brute force, implementation]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,The Race,,C,1292140800,[math],PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Permutations,,D,1292140800,[greedy],PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Ivan the Fool VS Gorynych the Dragon,,E,1292140800,"[dp, games, graphs]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Snow sellers,,F,1292140800,"[greedy, sortings]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Galaxy Union,,G,1292140800,"[dp, trees, two pointers]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Black and White,,H,1292140800,[constructive algorithms],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Triangular numbers,500.0,A,1291737600,"[brute force, math]",PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Coins,1000.0,B,1291737600,[implementation],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Crossword,1500.0,C,1291737600,[implementation],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Safe,2000.0,D,1291737600,[brute force],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Cannon,2500.0,E,1291737600,"[data structures, geometry, sortings]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Ball Game,,A,1291536000,"[brute force, implementation]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,T-shirts from Sponsor,,B,1291536000,[implementation],PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hamsters and Tigers,,C,1291536000,[two pointers],PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Parking Lot,,D,1291536000,"[data structures, implementation]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Comb,,E,1291536000,"[data structures, dp]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hercule Poirot Problem,,F,1291536000,"[dsu, graphs]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Emperor's Problem,,G,1291536000,[geometry],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Football,500.0,A,1291046400,[strings],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Letter,1000.0,B,1291046400,"[implementation, strings]",PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Lucky Tickets,1500.0,C,1291046400,[greedy],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Journey,2000.0,D,1291046400,"[brute force, constructive algorithms, implementation]",PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Race,2500.0,E,1291046400,"[brute force, implementation, two pointers]",PROGRAMMING +42,Codeforces Beta Round #41,12,Guilty --- to the kitchen!,500.0,A,1290096000,"[greedy, implementation]",PROGRAMMING +42,Codeforces Beta Round #41,12,Game of chess unfinished,1000.0,B,1290096000,[implementation],PROGRAMMING +42,Codeforces Beta Round #41,12,Safe cracking,1500.0,C,1290096000,"[brute force, constructive algorithms]",PROGRAMMING +42,Codeforces Beta Round #41,12,Strange town,2000.0,D,1290096000,"[constructive algorithms, math]",PROGRAMMING +42,Codeforces Beta Round #41,12,Baldman and the military,2500.0,E,1290096000,"[dfs and similar, graphs]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Codecraft III,,A,1289646000,[implementation],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,School,,B,1289646000,"[dp, dsu]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Dancing Lessons,,C,1289646000,[data structures],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Event Dates,,D,1289646000,"[greedy, meet-in-the-middle, sortings]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Director,,E,1289646000,"[constructive algorithms, greedy]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Goats and Wolves,,F,1289646000,[greedy],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Prime Problem,,G,1289646000,[number theory],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Road Problem,,H,1289646000,[graphs],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,TCMCF+++,,I,1289646000,[greedy],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Planting Trees,,J,1289646000,[constructive algorithms],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Translation,500.0,A,1289232000,"[implementation, strings]",PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Martian Dollar,1000.0,B,1289232000,[brute force],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Email address,1500.0,C,1289232000,"[expression parsing, implementation]",PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Pawn,2000.0,D,1289232000,[dp],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,3-cycles,2500.0,E,1289232000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Indian Summer,,A,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Cola,,B,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Holidays,,C,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Hyperdrive,,D,1289041200,[math],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Anfisa the Monkey,,E,1289041200,[dp],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,BerPaint,,F,1289041200,"[geometry, graphs]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Shooting Gallery,,G,1289041200,"[data structures, implementation]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Phone Number,,H,1289041200,[dp],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Toys,,I,1289041200,"[brute force, combinatorics]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Triminoes,,J,1289041200,"[constructive algorithms, greedy]",PROGRAMMING +40,Codeforces Beta Round #39,12,Find Color,500.0,A,1288972800,"[constructive algorithms, implementation, math]",PROGRAMMING +40,Codeforces Beta Round #39,12,Repaintings,1000.0,B,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Berland Square,1500.0,C,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Interesting Sequence,2000.0,D,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Number Table,2500.0,E,1288972800,[combinatorics],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Army,,A,1288440000,[implementation],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Chess,,B,1288440000,"[brute force, implementation, math]",PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Blinds,,C,1288440000,[brute force],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Vasya the Architect,,D,1288440000,[implementation],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Let's Go Rolling!,,E,1288440000,"[dp, sortings]",PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Smart Boy,,F,1288440000,"[dp, games, strings]",PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Queue,,G,1288440000,[data structures],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,The Great Marathon,,H,1288440000,[dp],PROGRAMMING +37,Codeforces Beta Round #37,12,Towers,500.0,A,1288018800,[sortings],PROGRAMMING +37,Codeforces Beta Round #37,12,Computer Game,1000.0,B,1288018800,"[greedy, implementation]",PROGRAMMING +37,Codeforces Beta Round #37,12,Old Berland Language,1500.0,C,1288018800,"[data structures, greedy, trees]",PROGRAMMING +37,Codeforces Beta Round #37,12,Lesson Timetable,2000.0,D,1288018800,"[combinatorics, dp, math]",PROGRAMMING +37,Codeforces Beta Round #37,12,Trial for Chief,2500.0,E,1288018800,"[graphs, greedy, shortest paths]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,C*++ Calculations,,A,1287904200,"[expression parsing, greedy]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Company Income Growth,,B,1287904200,[greedy],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Moon Craters,,C,1287904200,"[dp, sortings]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Cubical Planet,,D,1287904200,[math],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,What Has Dirichlet Got to Do with That?,,E,1287904200,"[dp, games]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Pacifist frogs,,F,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Inverse Function,,G,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Multiplication Table,,H,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Tram,,I,1287904200,[],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Spelling Check,,J,1287904200,"[hashing, implementation, strings]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Testing,,K,1287904200,[],PROGRAMMING +36,Codeforces Beta Round #36,12,Extra-terrestrial Intelligence,500.0,A,1287482400,[implementation],PROGRAMMING +36,Codeforces Beta Round #36,12,Fractal,1000.0,B,1287482400,[implementation],PROGRAMMING +36,Codeforces Beta Round #36,12,Bowls,1500.0,C,1287482400,"[geometry, implementation]",PROGRAMMING +36,Codeforces Beta Round #36,12,New Game with a Chess Piece,2000.0,D,1287482400,[games],PROGRAMMING +36,Codeforces Beta Round #36,12,Two Paths,2500.0,E,1287482400,"[constructive algorithms, dsu, graphs, implementation]",PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Shell Game,500.0,A,1287471600,[implementation],PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Warehouse,1000.0,B,1287471600,[implementation],PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Fire Again,1500.0,C,1287471600,"[brute force, dfs and similar, shortest paths]",PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Animals,2000.0,D,1287471600,"[dp, greedy]",PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Parade,2500.0,E,1287471600,"[data structures, sortings]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Reconnaissance 2,500.0,A,1286802000,[implementation],PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Sale,1000.0,B,1286802000,"[greedy, sortings]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Page Numbers,1500.0,C,1286802000,"[expression parsing, implementation, sortings, strings]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Road Map,2000.0,D,1286802000,"[dfs and similar, graphs]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Collisions,2500.0,E,1286802000,"[brute force, implementation, math]",PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,What is for dinner?,500.0,A,1286463600,"[greedy, implementation]",PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,String Problem,1000.0,B,1286463600,[shortest paths],PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,Wonderful Randomized Sum,1500.0,C,1286463600,[greedy],PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,Knights,2000.0,D,1286463600,"[geometry, graphs, shortest paths, sortings]",PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,Helper,2500.0,E,1286463600,[],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Reconnaissance,500.0,A,1286002800,[brute force],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Borze,1000.0,B,1286002800,"[expression parsing, implementation]",PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Flea,1500.0,C,1286002800,[math],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Constellation,2000.0,D,1286002800,[implementation],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Hide-and-Seek,2500.0,E,1286002800,"[geometry, implementation]",PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Worms Evolution,500.0,A,1285599600,[implementation],PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Sysadmin Bob,1000.0,B,1285599600,[strings],PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Schedule,1500.0,C,1285599600,[implementation],PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Chocolate,2000.0,D,1285599600,"[dfs and similar, implementation]",PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,TV Game,2500.0,E,1285599600,[dp],PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Accounting,500.0,A,1285340400,"[brute force, math]",PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Codeforces World Finals,1000.0,B,1285340400,[implementation],PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Shooting Gallery,1500.0,C,1285340400,"[dp, probabilities]",PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,King's Problem?,2000.0,D,1285340400,"[geometry, greedy]",PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Tricky and Clever Password,2500.0,E,1285340400,"[binary search, constructive algorithms, data structures, greedy, hashing, strings]",PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Spit Problem,500.0,A,1284994800,[brute force],PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Traffic Lights,1000.0,B,1284994800,[implementation],PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Mail Stamps,1500.0,C,1284994800,"[data structures, dfs and similar, graphs, implementation]",PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Ant on the Tree,2000.0,D,1284994800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Quarrel,2500.0,E,1284994800,"[graphs, shortest paths]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,Bender Problem,500.0,A,1284735600,[implementation],PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,pSort,1000.0,B,1284735600,"[dfs and similar, dsu, graphs]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,Bath Queue,1500.0,C,1284735600,"[combinatorics, dp, probabilities]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,"Don't fear, DravDe is kind",2000.0,D,1284735600,"[binary search, data structures, dp, hashing]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,DravDe saves the world,2500.0,E,1284735600,"[geometry, math]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Next Test,500.0,A,1284130800,"[implementation, sortings]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Tournament,1000.0,B,1284130800,"[bitmasks, brute force, dfs and similar, greedy]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Unordered Subsequence,1500.0,C,1284130800,"[constructive algorithms, greedy]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Ring Road 2,2000.0,D,1284130800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Number With The Given Amount Of Divisors,2500.0,E,1284130800,"[brute force, dp, number theory]",PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Almost Prime,500.0,A,1281970800,[number theory],PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Regular Bracket Sequence,1000.0,B,1281970800,[greedy],PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Parquet,1500.0,C,1281970800,"[combinatorics, constructive algorithms]",PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Tickets,2000.0,D,1281970800,"[combinatorics, probabilities]",PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Multithreading,2500.0,E,1281970800,[constructive algorithms],PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,IQ test,,A,1280761200,[brute force],PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Phone numbers,,B,1280761200,[implementation],PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads in Berland,,C,1280761200,"[graphs, shortest paths]",PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads not only in Berland,,D,1280761200,"[dsu, graphs, trees]",PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Test,,E,1280761200,"[hashing, strings]",PROGRAMMING +24,Codeforces Beta Round #24,12,Ring road,,A,1280149200,[graphs],PROGRAMMING +24,Codeforces Beta Round #24,12,F1 Champions,,B,1280149200,[implementation],PROGRAMMING +24,Codeforces Beta Round #24,12,Sequence of points,,C,1280149200,"[geometry, implementation, math]",PROGRAMMING +24,Codeforces Beta Round #24,12,Broken robot,,D,1280149200,"[dp, probabilities]",PROGRAMMING +24,Codeforces Beta Round #24,12,Berland collider,,E,1280149200,[binary search],PROGRAMMING +23,Codeforces Beta Round #23,12,You're Given a String...,,A,1278687600,"[brute force, greedy]",PROGRAMMING +23,Codeforces Beta Round #23,12,Party,,B,1278687600,"[constructive algorithms, graphs, math]",PROGRAMMING +23,Codeforces Beta Round #23,12,Oranges and Apples,,C,1278687600,"[constructive algorithms, sortings]",PROGRAMMING +23,Codeforces Beta Round #23,12,Tetragon,,D,1278687600,"[geometry, math]",PROGRAMMING +23,Codeforces Beta Round #23,12,Tree,,E,1278687600,[dp],PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Second Order Statistics,,A,1277823600,[brute force],PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Bargaining Table,,B,1277823600,"[brute force, dp]",PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,System Administrator,,C,1277823600,[graphs],PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Segments,,D,1277823600,"[greedy, sortings]",PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Scheme,,E,1277823600,"[dfs and similar, graphs, trees]",PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Jabber ID,500.0,A,1277730300,[implementation],PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Intersection,1000.0,B,1277730300,"[implementation, math]",PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Stripe 2,1500.0,C,1277730300,"[binary search, dp, sortings]",PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Traveling Graph,2000.0,D,1277730300,"[bitmasks, graph matchings, graphs]",PROGRAMMING +19,Codeforces Beta Round #19,12,World Football Cup,,A,1277391600,[implementation],PROGRAMMING +19,Codeforces Beta Round #19,12,Checkout Assistant,,B,1277391600,[dp],PROGRAMMING +19,Codeforces Beta Round #19,12,Deletion of Repeats,,C,1277391600,"[greedy, hashing, string suffix structures]",PROGRAMMING +19,Codeforces Beta Round #19,12,Points,,D,1277391600,[data structures],PROGRAMMING +19,Codeforces Beta Round #19,12,Fairy,,E,1277391600,"[dfs and similar, divide and conquer, dsu]",PROGRAMMING +20,Codeforces Alpha Round #20 (Codeforces format),12,BerOS file system,500.0,A,1276875000,[implementation],PROGRAMMING +20,Codeforces Alpha Round #20 (Codeforces format),12,Equation,1000.0,B,1276875000,[math],PROGRAMMING +20,Codeforces Alpha Round #20 (Codeforces format),12,Dijkstra?,1500.0,C,1276875000,"[graphs, shortest paths]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Triangle,,A,1276700400,"[brute force, geometry]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Platforms,,B,1276700400,"[brute force, math]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Stripe,,C,1276700400,"[data structures, implementation]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Seller Bob,,D,1276700400,"[brute force, dp, greedy]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Flag 2,,E,1276700400,[dp],PROGRAMMING +17,Codeforces Beta Round #17,12,Noldbach problem,,A,1276182000,"[brute force, math, number theory]",PROGRAMMING +17,Codeforces Beta Round #17,12,Hierarchy,,B,1276182000,"[dfs and similar, dsu, greedy, shortest paths]",PROGRAMMING +17,Codeforces Beta Round #17,12,Balance,,C,1276182000,[dp],PROGRAMMING +17,Codeforces Beta Round #17,12,Notepad,,D,1276182000,[number theory],PROGRAMMING +17,Codeforces Beta Round #17,12,Palisection,,E,1276182000,[strings],PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Flag,,A,1275570000,[implementation],PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Burglar and Matches,,B,1275570000,"[greedy, implementation, sortings]",PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Monitor,,C,1275570000,"[binary search, number theory]",PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Logging,,D,1275570000,"[implementation, strings]",PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Fish,,E,1275570000,"[bitmasks, dp, probabilities]",PROGRAMMING +15,Codeforces Beta Round #15,12,Cottage Village,,A,1275145200,"[implementation, sortings]",PROGRAMMING +15,Codeforces Beta Round #15,12,Laser,,B,1275145200,[math],PROGRAMMING +15,Codeforces Beta Round #15,12,Industrial Nim,,C,1275145200,[games],PROGRAMMING +15,Codeforces Beta Round #15,12,Map,,D,1275145200,"[data structures, implementation, sortings]",PROGRAMMING +15,Codeforces Beta Round #15,12,Triangles,,E,1275145200,"[combinatorics, dp]",PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Letter,,A,1274283000,[implementation],PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Young Photographer,,B,1274283000,[implementation],PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Four Segments,,C,1274283000,"[brute force, constructive algorithms, geometry, implementation, math]",PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Two Paths,,D,1274283000,"[dfs and similar, dp, graphs, shortest paths, trees, two pointers]",PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Camels,,E,1274283000,[dp],PROGRAMMING +13,Codeforces Beta Round #13,12,Numbers,,A,1273154400,"[implementation, math]",PROGRAMMING +13,Codeforces Beta Round #13,12,Letter A,,B,1273154400,"[geometry, implementation]",PROGRAMMING +13,Codeforces Beta Round #13,12,Sequence,,C,1273154400,"[dp, sortings]",PROGRAMMING +13,Codeforces Beta Round #13,12,Triangles,,D,1273154400,"[dp, geometry]",PROGRAMMING +13,Codeforces Beta Round #13,12,Holes,,E,1273154400,"[data structures, dsu]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Super Agent,,A,1272538800,[implementation],PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Correct Solution?,,B,1272538800,"[implementation, sortings]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Fruits,,C,1272538800,"[implementation, sortings]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Ball,,D,1272538800,"[data structures, sortings]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Start of the session,,E,1272538800,[constructive algorithms],PROGRAMMING +11,Codeforces Beta Round #11,12,Increasing Sequence,,A,1272294000,"[constructive algorithms, implementation, math]",PROGRAMMING +11,Codeforces Beta Round #11,12,Jumping Jack,,B,1272294000,[math],PROGRAMMING +11,Codeforces Beta Round #11,12,How Many Squares?,,C,1272294000,[implementation],PROGRAMMING +11,Codeforces Beta Round #11,12,A Simple Task,,D,1272294000,"[bitmasks, dp, graphs]",PROGRAMMING +11,Codeforces Beta Round #11,12,"Forward, march!",,E,1272294000,"[binary search, dp, greedy]",PROGRAMMING +10,Codeforces Beta Round #10,12,Power Consumption Calculation,,A,1271346300,[implementation],PROGRAMMING +10,Codeforces Beta Round #10,12,Cinema Cashier,,B,1271346300,"[dp, implementation]",PROGRAMMING +10,Codeforces Beta Round #10,12,Digital Root,,C,1271346300,[number theory],PROGRAMMING +10,Codeforces Beta Round #10,12,LCIS,,D,1271346300,[dp],PROGRAMMING +10,Codeforces Beta Round #10,12,Greedy Change,,E,1271346300,[constructive algorithms],PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Die Roll,,A,1270983600,"[math, probabilities]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Running Student,,B,1270983600,"[brute force, geometry, implementation]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Hexadecimal's Numbers,,C,1270983600,"[brute force, implementation, math]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,How many trees?,,D,1270983600,"[combinatorics, divide and conquer, dp]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Interestring graph and Apples,,E,1270983600,"[dfs and similar, dsu, graphs]",PROGRAMMING +8,Codeforces Beta Round #8,12,Train and Peter,,A,1270741500,[strings],PROGRAMMING +8,Codeforces Beta Round #8,12,Obsession with Robots,,B,1270741500,"[constructive algorithms, graphs, implementation]",PROGRAMMING +8,Codeforces Beta Round #8,12,Looking for Order,,C,1270741500,"[bitmasks, dp]",PROGRAMMING +8,Codeforces Beta Round #8,12,Two Friends,,D,1270741500,"[binary search, geometry]",PROGRAMMING +8,Codeforces Beta Round #8,12,Beads,,E,1270741500,"[dp, graphs]",PROGRAMMING +7,Codeforces Beta Round #7,12,Kalevitch and Chess,,A,1270136700,"[brute force, constructive algorithms]",PROGRAMMING +7,Codeforces Beta Round #7,12,Memory Manager,,B,1270136700,[implementation],PROGRAMMING +7,Codeforces Beta Round #7,12,Line,,C,1270136700,"[math, number theory]",PROGRAMMING +7,Codeforces Beta Round #7,12,Palindrome Degree,,D,1270136700,"[hashing, strings]",PROGRAMMING +7,Codeforces Beta Round #7,12,Defining Macros,,E,1270136700,"[dp, expression parsing, implementation]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,Triangle,,A,1269673200,"[brute force, geometry]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,President's Office,,B,1269673200,[implementation],PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,"Alice, Bob and Chocolate",,C,1269673200,"[greedy, two pointers]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,Lizards and Basements 2,,D,1269673200,"[brute force, dp]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,Exposition,,E,1269673200,"[binary search, data structures, dsu, trees, two pointers]",PROGRAMMING +5,Codeforces Beta Round #5,12,Chat Servers Outgoing Traffic,,A,1269100800,[implementation],PROGRAMMING +5,Codeforces Beta Round #5,12,Center Alignment,,B,1269100800,"[implementation, strings]",PROGRAMMING +5,Codeforces Beta Round #5,12,Longest Regular Bracket Sequence,,C,1269100800,"[constructive algorithms, data structures, dp, greedy, sortings, strings]",PROGRAMMING +5,Codeforces Beta Round #5,12,Follow Traffic Rules,,D,1269100800,"[implementation, math]",PROGRAMMING +5,Codeforces Beta Round #5,12,Bindian Signalizing,,E,1269100800,[data structures],PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Watermelon,,A,1268395200,"[brute force, math]",PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Before an Exam,,B,1268395200,"[constructive algorithms, greedy]",PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Registration System,,C,1268395200,"[data structures, hashing, implementation]",PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Mysterious Present,,D,1268395200,"[dp, sortings]",PROGRAMMING +3,Codeforces Beta Round #3,12,Shortest path of the king,,A,1267963200,"[greedy, shortest paths]",PROGRAMMING +3,Codeforces Beta Round #3,12,Lorry,,B,1267963200,"[greedy, sortings]",PROGRAMMING +3,Codeforces Beta Round #3,12,Tic-tac-toe,,C,1267963200,"[brute force, games, implementation]",PROGRAMMING +3,Codeforces Beta Round #3,12,Least Cost Bracket Sequence,,D,1267963200,[greedy],PROGRAMMING +2,Codeforces Beta Round #2,12,Winner,,A,1267117200,"[hashing, implementation]",PROGRAMMING +2,Codeforces Beta Round #2,12,The least round way,,B,1267117200,"[dp, math]",PROGRAMMING +2,Codeforces Beta Round #2,12,Commentator problem,,C,1267117200,[geometry],PROGRAMMING +1,Codeforces Beta Round #1,12,Theatre Square,,A,1266580800,[math],PROGRAMMING +1,Codeforces Beta Round #1,12,Spreadsheet,,B,1266580800,"[implementation, math]",PROGRAMMING +1,Codeforces Beta Round #1,12,Ancient Berland Circus,,C,1266580800,"[geometry, math]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Links and Pearls,500.0,A,1525791900,"[implementation, math]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Marlin,1000.0,B,1525791900,[constructive algorithms],PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Posterized,1500.0,C,1525791900,[greedy],PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Perfect Groups,2000.0,D,1525791900,"[dp, math, number theory]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,The Number Games,2500.0,E,1525791900,"[data structures, greedy, trees]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Cactus to Tree,3000.0,F,1525791900,"[dp, graphs, trees]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Wrong Subtraction,,A,1525615500,[implementation],PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Two-gram,,B,1525615500,"[implementation, strings]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Less or Equal,,C,1525615500,[sortings],PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,"Divide by three, multiply by two",,D,1525615500,"[dfs and similar, math, sortings]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Cyclic Components,,E,1525615500,"[dfs and similar, dsu, graphs]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Consecutive Subsequence,,F,1525615500,[dp],PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Aramic script,500.0,A,1525183500,"[implementation, strings]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Mancala,1000.0,B,1525183500,"[brute force, implementation]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Valhalla Siege,1500.0,C,1525183500,[binary search],PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Ghosts,2000.0,D,1525183500,"[geometry, math]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Hag's Khashba,2500.0,E,1525183500,[geometry],PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimum Binary Number,,A,1525099200,[implementation],PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Lara Croft and the New Game,,B,1525099200,"[implementation, math]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Nested Segments,,C,1525099200,"[greedy, implementation, sortings]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Degree Set,,D,1525099200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Well played!,,E,1525099200,"[greedy, sortings]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimal k-covering,,F,1525099200,[flows],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Stairs and Elevators,500.0,A,1525007700,[binary search],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Resource Distribution,1000.0,B,1525007700,"[binary search, implementation, sortings]",PROGRAMMING +925,VK Cup 2018 - Round 3,12,Big Secret,1500.0,C,1525007700,[],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Aztec Catacombs,2000.0,D,1525007700,[constructive algorithms],PROGRAMMING +925,VK Cup 2018 - Round 3,12,May Holidays,2750.0,E,1525007700,"[data structures, trees]",PROGRAMMING +925,VK Cup 2018 - Round 3,12,Parametric Circulation,3250.0,F,1525007700,[],PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Stairs and Elevators,500.0,A,1525007700,"[binary search, data structures, greedy]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Resource Distribution,1000.0,B,1525007700,"[binary search, data structures, greedy, two pointers]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Big Secret,1500.0,C,1525007700,"[constructive algorithms, data structures, greedy]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Aztec Catacombs,2000.0,D,1525007700,"[constructive algorithms, graphs]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,May Holidays,2750.0,E,1525007700,[],PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Parametric Circulation,3250.0,F,1525007700,[flows],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Mind the Gap,500.0,A,1525007700,[implementation],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Watering System,1000.0,B,1525007700,[sortings],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Stairs and Elevators,1500.0,C,1525007700,[binary search],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Resource Distribution,2000.0,D,1525007700,"[binary search, sortings]",PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Big Secret,2750.0,E,1525007700,[],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Aztec Catacombs,3250.0,F,1525007700,[],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Paper Airplanes,500.0,A,1524677700,[math],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Battleship,1000.0,B,1524677700,[implementation],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Greedy Arkady,1500.0,C,1524677700,[math],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Single-use Stones,2000.0,D,1524677700,"[binary search, flows, greedy, two pointers]",PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Short Code,2500.0,E,1524677700,"[data structures, dp, greedy, strings, trees]",PROGRAMMING +927,VK Cup 2018 - Wild-card Round 2,12,BuberPool Taxi Optimization,,A,1524152100,[],PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Alternating Sum,500.0,A,1523973900,"[math, number theory]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Destruction of a Tree,1000.0,B,1523973900,"[constructive algorithms, dfs and similar, dp, greedy, trees]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Cutting Rectangle,1500.0,C,1523973900,"[brute force, math, number theory]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Frequency of String,2000.0,D,1523973900,"[hashing, string suffix structures, strings]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Circles of Waiting,2500.0,E,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Splits,500.0,A,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Messages,1000.0,B,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Alternating Sum,1500.0,C,1523973900,"[math, matrices, number theory]",PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Destruction of a Tree,2000.0,D,1523973900,"[dfs and similar, dp, trees]",PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Cutting Rectangle,2500.0,E,1523973900,[math],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (easy),,A1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (medium),,A2,1523689500,"[hashing, strings]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (hard),,A3,1523689500,[],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (easy),,B1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (medium),,B2,1523689500,"[data structures, greedy, trees]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (easy),,C1,1523689500,[brute force],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (medium),,C2,1523689500,[dp],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (hard),,C3,1523689500,"[data structures, dp]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (easy),,D1,1523689500,"[expression parsing, math]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (hard),,D2,1523689500,[],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (easy),,E1,1523689500,"[brute force, geometry, greedy, math]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (medium),,E2,1523689500,"[binary search, dp, greedy, sortings]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (hard),,E3,1523689500,[geometry],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (easy),,F1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (medium),,F2,1523689500,"[binary search, two pointers]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (hard),,F3,1523689500,[fft],PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Equator,,A,1523370900,[implementation],PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Students in Railway Carriage,,B,1523370900,"[constructive algorithms, greedy, implementation]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Make a Square,,C,1523370900,"[brute force, implementation, math]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Merge Equals,,D,1523370900,"[data structures, implementation]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,"Byteland, Berland and Disputed Cities",,E,1523370900,"[constructive algorithms, greedy]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Simple Cycles Edges,,F,1523370900,"[dfs and similar, graphs, trees]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Visible Black Areas,,G,1523370900,"[data structures, dsu, geometry, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Check the string,500.0,A,1523117100,[implementation],PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Minimize the error,1000.0,B,1523117100,"[data structures, greedy, sortings]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Subsequence Counting,1500.0,C,1523117100,"[bitmasks, constructive algorithms, greedy, implementation]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Full Binary Tree Queries,2000.0,D,1523117100,"[brute force, implementation, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Alternating Tree,2250.0,E,1523117100,"[combinatorics, dfs and similar, divide and conquer, dp, probabilities, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Pathwalks,2500.0,F,1523117100,"[data structures, dp, graphs]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Bandit Blues,3000.0,G,1523117100,"[combinatorics, dp, fft, math]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Santa's Gift,3500.0,H,1523117100,"[data structures, trees]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tetris,,A,1522850700,[implementation],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Lecture Sleep,,B,1522850700,"[data structures, dp, implementation, two pointers]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Chessboard,,C,1522850700,"[bitmasks, brute force, implementation]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Pair Of Lines,,D,1522850700,[geometry],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tufurama,,E,1522850700,[data structures],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,k-substrings,,F,1522850700,"[binary search, hashing, string suffix structures]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Partitions,,G,1522850700,"[combinatorics, math, number theory]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the even-odd game,500.0,A,1522771500,"[games, math]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the message,1000.0,B,1522771500,"[dsu, implementation]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the wrong algorithm,1250.0,C,1522771500,"[constructive algorithms, trees]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and another array construction task,1750.0,D,1522771500,"[constructive algorithms, greedy, number theory]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the xor-MST,2000.0,E,1522771500,"[bitmasks, dp, graphs, implementation, math]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and yet another xor task,2500.0,F,1522771500,"[bitmasks, dp, math, matrices]",PROGRAMMING +952,April Fools Contest 2018,12,Quirky Quantifiers,,A,1522596900,[math],PROGRAMMING +952,April Fools Contest 2018,12,A Map of the Cat,,B,1522596900,[brute force],PROGRAMMING +952,April Fools Contest 2018,12,Ravioli Sort,,C,1522596900,[implementation],PROGRAMMING +952,April Fools Contest 2018,12,I'm Feeling Lucky!,,D,1522596900,[probabilities],PROGRAMMING +952,April Fools Contest 2018,12,Cheese Board,,E,1522596900,[],PROGRAMMING +952,April Fools Contest 2018,12,2 + 2 != 4,,F,1522596900,[],PROGRAMMING +952,April Fools Contest 2018,12,Puzzling Language,,G,1522596900,[constructive algorithms],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING +924,VK Cup 2018 - Round 2,12,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy]",PROGRAMMING +924,VK Cup 2018 - Round 2,12,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Wardrobe,2250.0,E,1521905700,[],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Minimal Subset Difference,3000.0,F,1521905700,[],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy, implementation]",PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Wardrobe,2250.0,E,1521905700,[dp],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Minimal Subset Difference,3000.0,F,1521905700,"[bitmasks, dp]",PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Tritonic Iridescence,500.0,A,1521905700,[implementation],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Mystical Mosaic,1000.0,B,1521905700,[brute force],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Three-level Laser,1500.0,C,1521905700,"[binary search, math]",PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Riverside Curio,1750.0,D,1521905700,[greedy],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Contact ATC,2500.0,E,1521905700,[],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Feed the cat,500.0,A,1521822900,"[greedy, math]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Not simply beatiful strings,1000.0,B,1521822900,[implementation],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Sad powers,1500.0,C,1521822900,"[binary search, math, number theory]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Scissors,2000.0,D,1521822900,"[brute force, strings]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Icicles,2500.0,E,1521822900,[],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Heaps,3000.0,F,1521822900,"[dp, trees]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Diagonal Walking,,A,1521698700,[implementation],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,String Typing,,B,1521698700,[strings],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Matrix Walk,,C,1521698700,[implementation],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Fight Against Traffic,,D,1521698700,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Water Taps,,E,1521698700,"[binary search, greedy, sortings]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Runner's Problem,,F,1521698700,"[dp, matrices, sortings]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Castle Defense,,G,1521698700,"[binary search, two pointers]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Path Counting,,H,1521698700,"[combinatorics, dp]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Yet Another String Matching Problem,,I,1521698700,[fft],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,2-3-numbers,,A,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Add Points,,B,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Choose Place,,D,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Mobile Communications,,F,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Large Bouquets,,G,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,A Vital Problem,,I,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Segments,,J,1521300900,[data structures],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,2-3-numbers,,A,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Add Points,,B,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Choose Place,,D,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Mobile Communications,,F,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Large Bouquets,,G,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,A Vital Problem,,I,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Segments,,J,1521300900,[],PROGRAMMING +923,VK Cup 2018 - Round 1,12,Primal Sport,500.0,A,1520696100,"[math, number theory]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Producing Snow,1000.0,B,1520696100,"[binary search, data structures]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Perfect Security,1500.0,C,1520696100,"[data structures, greedy]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation, strings]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Public Service,3000.0,F,1520696100,[],PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Primal Sport,500.0,A,1520696100,"[brute force, math, number theory]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Producing Snow,1000.0,B,1520696100,"[binary search, data structures, implementation]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perfect Security,1500.0,C,1520696100,"[data structures, strings]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Public Service,3000.0,F,1520696100,[],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Protect Sheep,500.0,A,1520696100,[brute force],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Primal Sport,1000.0,B,1520696100,"[brute force, math, number theory]",PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Producing Snow,1500.0,C,1520696100,"[binary search, data structures]",PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Perfect Security,2000.0,D,1520696100,[data structures],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Picking Strings,2250.0,E,1520696100,"[constructive algorithms, implementation]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Zebras,500.0,A,1520583000,[greedy],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,A Leapfrog in the Array,1000.0,B,1520583000,[math],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Data Center Maintenance,1250.0,C,1520583000,"[dfs and similar, graphs]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Curfew,1750.0,D,1520583000,"[binary search, brute force]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Binary Cards,2250.0,E,1520583000,[brute force],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Astronomy,2500.0,F,1520583000,"[geometry, probabilities]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,"Left-handers, Right-handers and Ambidexters",500.0,A,1520583000,[implementation],PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Intercepted Message,1000.0,B,1520583000,[greedy],PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Zebras,1500.0,C,1520583000,"[constructive algorithms, greedy]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,A Leapfrog in the Array,2000.0,D,1520583000,"[constructive algorithms, math]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Data Center Maintenance,2250.0,E,1520583000,"[2-sat, graphs]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Curfew,2750.0,F,1520583000,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Partition,,A,1520348700,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Weird Subtraction Process,,B,1520348700,[number theory],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,String Transformation,,C,1520348700,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Timetable,,D,1520348700,[dp],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Largest Beautiful Number,,E,1520348700,"[greedy, implementation]",PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Fibonacci String Subsequences,,F,1520348700,"[combinatorics, dp, matrices]",PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Almost Increasing Array,,G,1520348700,"[data structures, dp]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Peculiar apple-tree,500.0,A,1520177700,[dfs and similar],PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with String,1000.0,B,1520177700,"[implementation, probabilities, strings]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Teodor is not a liar!,1500.0,C,1520177700,"[data structures, dp]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with Tokens,2000.0,D,1520177700,"[data structures, games, implementation]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Coins Exhibition,2500.0,E,1520177700,"[data structures, dp]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Friends Meeting,500.0,A,1520177700,"[brute force, implementation, math]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,World Cup,1000.0,B,1520177700,[implementation],PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Laboratory Work,1750.0,C,1520177700,"[implementation, math]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Peculiar apple-tree,1750.0,D,1520177700,[dfs and similar],PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Game with String,2500.0,E,1520177700,"[implementation, math, probabilities]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Teodor is not a liar!,3000.0,F,1520177700,"[data structures, dp]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,World Cup,500.0,A,1520152800,[implementation],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Laboratory Work,1250.0,B,1520152800,[],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Peculiar apple-tree,1250.0,C,1520152800,[dfs and similar],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with String,2000.0,D,1520152800,[],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Teodor is not a liar!,2500.0,E,1520152800,"[binary search, data structures, dp]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with Tokens,3000.0,F,1520152800,"[data structures, games]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Coins Exhibition,3500.0,G,1520152800,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Прокат велосипедов,500.0,A,1520004900,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Места в самолёте,1000.0,B,1520004900,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Красивая команда,1750.0,C,1520004900,[combinatorics],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Пограничные врата,2500.0,D,1520004900,[],PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Save Energy!,500.0,A,1519574700,"[binary search, implementation, math]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Sleepy Game,1000.0,B,1519574700,"[dfs and similar, dp, graphs]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Lock Puzzle,1500.0,C,1519574700,"[constructive algorithms, implementation]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,World of Tank,2000.0,D,1519574700,"[dp, greedy]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Iqea,2500.0,E,1519574700,"[data structures, dfs and similar, divide and conquer, dsu, shortest paths, trees]",PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Olympiad,500.0,A,1519574700,[implementation],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Vile Grasshoppers,1000.0,B,1519574700,[math],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Save Energy!,1500.0,C,1519574700,[math],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Sleepy Game,2000.0,D,1519574700,"[dfs and similar, graphs]",PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Lock Puzzle,2500.0,E,1519574700,[constructive algorithms],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Login Verification,500.0,A,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Chat,1250.0,B,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Dependency management,2000.0,C,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Autocompletion,2250.0,D,1519486500,[],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Points on the line,500.0,A,1519464900,[brute force],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Our Tanya is Crying Out Loud,1250.0,B,1519464900,[greedy],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Phone Numbers,1250.0,C,1519464900,[constructive algorithms],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Alena And The Heater,1500.0,D,1519464900,[implementation],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Cashback,2000.0,E,1519464900,"[data structures, dp, greedy, math]",PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Machine Learning,2750.0,F,1519464900,"[brute force, data structures]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and his Company,500.0,A,1519058100,[brute force],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and the Gates,750.0,B,1519058100,[implementation],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fifa and Fafa,1250.0,C,1519058100,[geometry],PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Alphabet,1750.0,D,1519058100,"[math, probabilities]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Mathematics,2250.0,E,1519058100,"[dp, trees]",PROGRAMMING +935,Codeforces Round #465 (Div. 2),2,Fafa and Array,2750.0,F,1519058100,[data structures],PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Love Triangle,500.0,A,1518861900,[],PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Hamster Farm,1000.0,B,1518861900,[implementation],PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Convenient For Everybody,1500.0,C,1518861900,"[binary search, two pointers]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Love Rescue,2000.0,D,1518861900,"[dsu, greedy]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Maximize!,2500.0,E,1518861900,"[binary search, greedy, ternary search, two pointers]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Cutlet,2750.0,F,1518861900,"[data structures, dp]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Word Correction,,A,1518793500,[implementation],PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Run For Your Prize,,B,1518793500,"[brute force, greedy]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Constructing Tests,,C,1518793500,"[binary search, brute force]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Buy a Ticket,,D,1518793500,"[data structures, graphs, shortest paths]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Max History,,E,1518793500,"[combinatorics, math]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Erasing Substrings,,F,1518793500,"[bitmasks, dp, greedy]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Shortest Path Queries,,G,1518793500,"[bitmasks, data structures, dsu, graphs]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindromic Supersequence,500.0,A,1518705300,[constructive algorithms],PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Recursive Queries,1000.0,B,1518705300,"[data structures, dfs and similar]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Permutation Cycle,1500.0,C,1518705300,"[brute force, constructive algorithms]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Tree,2000.0,D,1518705300,"[binary search, dp, trees]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Team Work,2500.0,E,1518705300,"[combinatorics, dp]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Escape Through Leaf,2500.0,F,1518705300,"[data structures, dp, geometry]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindrome Partition,3000.0,G,1518705300,"[dp, string suffix structures, strings]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Twisty Movement,500.0,A,1518609900,[dp],PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Determined Cleanup,750.0,B,1518609900,[math],PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Colourful Prospect,1500.0,C,1518609900,[geometry],PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Creative Cutout,2250.0,D,1518609900,"[brute force, combinatorics, math]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Preponderant Reunion,2500.0,E,1518609900,"[constructive algorithms, dp]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Compatible Pair,500.0,A,1518609900,"[brute force, games]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Prosperous Lot,1000.0,B,1518609900,[implementation],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Twisty Movement,1500.0,C,1518609900,"[brute force, dp, implementation]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Determined Cleanup,2000.0,D,1518609900,[math],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Colourful Prospect,2500.0,E,1518609900,[],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Cloning Toys,500.0,A,1518023700,[implementation],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Magic Forest,1000.0,B,1518023700,[brute force],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Cave Painting,1250.0,C,1518023700,"[brute force, number theory]",PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Robot Vacuum Cleaner,1500.0,D,1518023700,"[greedy, sortings]",PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Birds,2000.0,E,1518023700,[dp],PROGRAMMING +922,Codeforces Round #461 (Div. 2),2,Divisibility,2750.0,F,1518023700,"[constructive algorithms, dp, greedy, number theory]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Water The Garden,,A,1517582100,[implementation],PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tea Queue,,B,1517582100,[implementation],PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Swap Adjacent Elements,,C,1517582100,"[dfs and similar, greedy, sortings, two pointers]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Tanks,,D,1517582100,"[dp, greedy, implementation]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,Connected Components?,,E,1517582100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,SUM and REPLACE,,F,1517582100,"[brute force, data structures, number theory]",PROGRAMMING +920,Educational Codeforces Round 37 (Rated for Div. 2),2,List Of Integers,,G,1517582100,"[binary search, bitmasks, brute force, combinatorics, math, number theory]",PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-1,,01,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-2,,02,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-3,,03,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-4,,04,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-5,,05,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-6,,06,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-7,,07,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-8,,08,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-9,,09,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-10,,10,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-11,,11,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-12,,12,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-13,,13,1517500800,[],PROGRAMMING +921,AIM Tech Mini Marathon 1,12,Labyrinth-14,,14,1517500800,[],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Supermarket,500.0,A,1517403900,[greedy],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Perfect Number,750.0,B,1517403900,"[binary search, brute force, dp, implementation, number theory]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Seat Arrangements,1000.0,C,1517403900,[implementation],PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Substring,1500.0,D,1517403900,"[dfs and similar, dp, graphs]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,Congruence Equation,2000.0,E,1517403900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,A Game With Numbers,2500.0,F,1517403900,"[games, graphs, shortest paths]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,The Monster,500.0,A,1517236500,[greedy],PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,MADMAX,750.0,B,1517236500,"[dp, games, graphs]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Pollywog,1500.0,C,1517236500,[dp],PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Stranger Trees,2000.0,D,1517236500,"[dp, math, matrices, trees]",PROGRAMMING +917,Codeforces Round #459 (Div. 1),1,Upside Down,2750.0,E,1517236500,"[data structures, string suffix structures, strings, trees]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Eleven,500.0,A,1517236500,[implementation],PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Radio Station,1000.0,B,1517236500,[implementation],PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,The Monster,1500.0,C,1517236500,"[data structures, greedy]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,MADMAX,1750.0,D,1517236500,"[dfs and similar, dp, games]",PROGRAMMING +918,Codeforces Round #459 (Div. 2),2,Pollywog,2500.0,E,1517236500,[],PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Perfect Squares,500.0,A,1516462500,"[implementation, math]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Conan and Agasa play a Card Game,1000.0,B,1516462500,"[games, greedy]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Travelling Salesman and Special Numbers,1500.0,C,1516462500,"[brute force, combinatorics, dp]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Bash and a Tough Math Puzzle,2000.0,D,1516462500,"[data structures, number theory]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Palindromes in a Tree,2500.0,E,1516462500,"[bitmasks, divide and conquer, trees]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Substrings in a String,3000.0,F,1516462500,"[bitmasks, brute force, string suffix structures, strings]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Sum the Fibonacci,3500.0,G,1516462500,"[bitmasks, divide and conquer]",PROGRAMMING +914,"Codecraft-18 and Codeforces Round #458 (Div. 1 + Div. 2, combined)",12,Ember and Storm's Tree Game,3750.0,H,1516462500,"[combinatorics, dp, games, trees]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Alarm Snooze,500.0,A,1516372500,"[brute force, implementation]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Binary Sequence (changed after round),1000.0,B,1516372500,"[bitmasks, greedy]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Interesting Graph,1500.0,C,1516372500,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and To-do List,2250.0,D,1516372500,"[data structures, trees]",PROGRAMMING +916,Codeforces Round #457 (Div. 2),2,Jamie and Tree,2500.0,E,1516372500,"[data structures, trees]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Garden,,A,1515848700,[implementation],PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Browser,,B,1515848700,[implementation],PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Permute Digits,,C,1515848700,"[dp, greedy]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Almost Acyclic Graph,,D,1515848700,"[dfs and similar, graphs]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Physical Education Lessons,,E,1515848700,"[data structures, implementation, sortings]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Imbalance Value of a Tree,,F,1515848700,"[data structures, dsu, graphs, trees]",PROGRAMMING +915,Educational Codeforces Round 36 (Rated for Div. 2),2,Coprime Arrays,,G,1515848700,"[math, number theory]",PROGRAMMING +913,Hello 2018,12,Modular Exponentiation,500.0,A,1515422700,"[implementation, math]",PROGRAMMING +913,Hello 2018,12,Christmas Spruce,750.0,B,1515422700,"[implementation, trees]",PROGRAMMING +913,Hello 2018,12,Party Lemonade,1000.0,C,1515422700,"[bitmasks, dp, greedy]",PROGRAMMING +913,Hello 2018,12,Too Easy Problems,1250.0,D,1515422700,"[binary search, brute force, data structures, greedy, sortings]",PROGRAMMING +913,Hello 2018,12,Logical Expression,1750.0,E,1515422700,"[bitmasks, dp, shortest paths]",PROGRAMMING +913,Hello 2018,12,Strongly Connected Tournament,2250.0,F,1515422700,"[dp, graphs, probabilities]",PROGRAMMING +913,Hello 2018,12,Power Substring,3000.0,G,1515422700,"[math, number theory]",PROGRAMMING +913,Hello 2018,12,Don't Exceed,3500.0,H,1515422700,"[math, probabilities]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Tricky Alchemy,500.0,A,1515162900,[implementation],PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,New Year's Eve,1000.0,B,1515162900,"[bitmasks, constructive algorithms]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,"Perun, Ult!",1750.0,C,1515162900,"[brute force, greedy, sortings]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Fishes,2000.0,D,1515162900,"[data structures, probabilities]",PROGRAMMING +912,Codeforces Round #456 (Div. 2),2,Prime Gift,2500.0,E,1515162900,"[binary search, dfs and similar, math, meet-in-the-middle, number theory, two pointers]",PROGRAMMING +908,Good Bye 2017,12,New Year and Counting Cards,500.0,A,1514562000,[implementation],PROGRAMMING +908,Good Bye 2017,12,New Year and Buggy Bot,750.0,B,1514562000,"[brute force, implementation]",PROGRAMMING +908,Good Bye 2017,12,New Year and Curling,1000.0,C,1514562000,"[brute force, geometry, implementation, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Arbitrary Arrangement,1750.0,D,1514562000,"[dp, math, probabilities]",PROGRAMMING +908,Good Bye 2017,12,New Year and Entity Enumeration,1750.0,E,1514562000,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Rainbow Roads,2000.0,F,1514562000,"[graphs, greedy, implementation]",PROGRAMMING +908,Good Bye 2017,12,New Year and Original Order,2750.0,G,1514562000,"[dp, math]",PROGRAMMING +908,Good Bye 2017,12,New Year and Boolean Bridges,3500.0,H,1514562000,[],PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Nearest Minimums,,A,1514469900,[implementation],PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Two Cakes,,B,1514469900,"[binary search, brute force, implementation]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Three Garlands,,C,1514469900,"[brute force, constructive algorithms]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Inversion Counting,,D,1514469900,"[brute force, math]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Stack Sorting,,E,1514469900,"[data structures, implementation]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Tree Destruction,,F,1514469900,"[constructive algorithms, dfs and similar, graphs, greedy, trees]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Mass Change Queries,,G,1514469900,[data structures],PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Generate Login,500.0,A,1514392500,"[brute force, greedy, sortings]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Segments,1000.0,B,1514392500,"[constructive algorithms, math]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Python Indentation,1500.0,C,1514392500,[dp],PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Colorful Points,1750.0,D,1514392500,"[data structures, greedy, implementation]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,Coprocessor,2000.0,E,1514392500,"[dfs and similar, dp, graphs, greedy]",PROGRAMMING +909,Codeforces Round #455 (Div. 2),2,AND-permutations,2500.0,F,1514392500,[constructive algorithms],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Masha and Bears,500.0,A,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Tic-Tac-Toe,1000.0,B,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Shockers,1500.0,C,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Seating of Students,2250.0,D,1514037900,[constructive algorithms],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Party,2250.0,E,1514037900,[],PROGRAMMING +904,Технокубок 2018 - Отборочный Раунд 4,12,Power Tower,3000.0,F,1514037900,[],PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Shockers,500.0,A,1514037900,[implementation],PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Seating of Students,1250.0,B,1514037900,"[brute force, constructive algorithms, math]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Party,1250.0,C,1514037900,"[bitmasks, brute force, dp, graphs]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Power Tower,2000.0,D,1514037900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +906,"Codeforces Round #454 (Div. 1, based on Technocup 2018 Elimination Round 4)",1,Reverses,2500.0,E,1514037900,"[dp, string suffix structures, strings]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Masha and Bears,500.0,A,1514037900,"[brute force, implementation]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Tic-Tac-Toe,1000.0,B,1514037900,[implementation],PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Shockers,1500.0,C,1514037900,"[bitmasks, implementation]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Seating of Students,2250.0,D,1514037900,[],PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Party,2250.0,E,1514037900,"[bitmasks, dp]",PROGRAMMING +907,"Codeforces Round #454 (Div. 2, based on Technocup 2018 Elimination Round 4)",2,Power Tower,3000.0,F,1514037900,[],PROGRAMMING +910,Testing Round #14 (Unrated),12,The Way to Home,500.0,A,1513940700,"[dfs and similar, dp, greedy]",PROGRAMMING +910,Testing Round #14 (Unrated),12,Door Frames,1000.0,B,1513940700,"[greedy, implementation]",PROGRAMMING +910,Testing Round #14 (Unrated),12,Minimum Sum,1500.0,C,1513940700,[greedy],PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Hashing Trees,500.0,A,1513697700,"[constructive algorithms, trees]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,GCD of Polynomials,1000.0,B,1513697700,"[constructive algorithms, math]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Bipartite Segments,1750.0,C,1513697700,"[binary search, data structures, dfs and similar, dsu, graphs, two pointers]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Weighting a Tree,2000.0,D,1513697700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +901,Codeforces Round #453 (Div. 1),1,Cyclic Cipher,2500.0,E,1513697700,[fft],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Visiting a Friend,500.0,A,1513697700,[implementation],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Coloring a Tree,1000.0,B,1513697700,"[dfs and similar, dsu]",PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Hashing Trees,1500.0,C,1513697700,[],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,GCD of Polynomials,2000.0,D,1513697700,[math],PROGRAMMING +902,Codeforces Round #453 (Div. 2),2,Bipartite Segments,2750.0,E,1513697700,"[data structures, dfs and similar]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Splitting in Teams,500.0,A,1513492500,[greedy],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Months and Years,1000.0,B,1513492500,[implementation],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Dividing the numbers,1500.0,C,1513492500,"[constructive algorithms, graphs]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Shovel Sale,1750.0,D,1513492500,[math],PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Segments Removal,2250.0,E,1513492500,"[data structures, dsu, flows, two pointers]",PROGRAMMING +899,Codeforces Round #452 (Div. 2),2,Letters Removing,2500.0,F,1513492500,[data structures],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Rounding,500.0,A,1513424100,[implementation],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Proper Nutrition,750.0,B,1513424100,"[brute force, implementation, number theory]",PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Phone Numbers,1500.0,C,1513424100,"[implementation, strings]",PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Alarm Clock,1750.0,D,1513424100,[greedy],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Squares and not squares,2000.0,E,1513424100,[greedy],PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Restoring the Expression,2500.0,F,1513424100,"[brute force, hashing, math]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Hungry Student Problem,,A,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,The Modcrab,,B,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Boxes Packing,,C,1513091100,[greedy],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Almost Difference,,D,1513091100,[math],PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Swapping Characters,,E,1513091100,"[hashing, implementation, strings]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Clear The Matrix,,F,1513091100,"[bitmasks, dp]",PROGRAMMING +903,Educational Codeforces Round 34 (Rated for Div. 2),2,Yet Another Maxflow Problem,,G,1513091100,"[data structures, flows]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Find Extra One,500.0,A,1513008300,[implementation],PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Position in Fraction,1000.0,B,1513008300,[math],PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Remove Extra One,1500.0,C,1513008300,"[brute force, data structures]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Unusual Sequences,2000.0,D,1513008300,"[bitmasks, combinatorics, dp, math, number theory]",PROGRAMMING +900,Codeforces Round #450 (Div. 2),2,Maximum Questions,2500.0,E,1513008300,"[data structures, dp, strings]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Nephren gives a riddle,500.0,A,1512223500,[dfs and similar],PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Ithea Plays With Chtholly,1000.0,B,1512223500,"[games, greedy]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,"Willem, Chtholly and Seniorious",1500.0,C,1512223500,[probabilities],PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,Nephren Runs a Cinema,2000.0,D,1512223500,"[chinese remainder theorem, combinatorics, math, number theory]",PROGRAMMING +896,Codeforces Round #449 (Div. 1),1,"Welcome home, Chtholly",2500.0,E,1512223500,"[data structures, dsu]",PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Scarborough Fair,500.0,A,1512223500,[implementation],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Chtholly's request,1000.0,B,1512223500,[brute force],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Nephren gives a riddle,1500.0,C,1512223500,"[combinatorics, math]",PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,Ithea Plays With Chtholly,2000.0,D,1512223500,[implementation],PROGRAMMING +897,Codeforces Round #449 (Div. 2),2,"Willem, Chtholly and Seniorious",2500.0,E,1512223500,[],PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Pizza Separation,500.0,A,1511712300,[brute force],PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,XK Segments,1000.0,B,1511712300,"[binary search, sortings, two pointers]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Square Subsets,1750.0,C,1511712300,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,String Mark,2000.0,D,1511712300,"[combinatorics, math, strings]",PROGRAMMING +895,Codeforces Round #448 (Div. 2),2,Eyes Closed,2250.0,E,1511712300,"[data structures, probabilities]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Chess For Three,,A,1511449500,[implementation],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Beautiful Divisors,,B,1511449500,[brute force],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Rumor,,C,1511449500,[dfs and similar],PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Credit Card,,D,1511449500,"[data structures, dp, greedy, implementation]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Counting Arrays,,E,1511449500,"[combinatorics, dp, number theory]",PROGRAMMING +893,Educational Codeforces Round 33 (Rated for Div. 2),2,Subtree Minimum Query,,F,1511449500,"[data structures, trees]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,QAQ,500.0,A,1511099700,"[brute force, dp]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph And His Magic Field,1000.0,B,1511099700,"[combinatorics, math, number theory]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Marco and GCD Sequence,1500.0,C,1511099700,"[constructive algorithms, math]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph And His Tour in Binary Country,2000.0,D,1511099700,"[data structures, trees]",PROGRAMMING +894,Codeforces Round #447 (Div. 2),2,Ralph and Mushrooms,2500.0,E,1511099700,"[dp, graphs]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Pride,500.0,A,1510929300,"[brute force, dp, greedy, math, number theory]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Gluttony,1000.0,B,1510929300,"[constructive algorithms, greedy]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Envy,1500.0,C,1510929300,"[data structures, dsu, graphs]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Sloth,2000.0,D,1510929300,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Lust,2500.0,E,1510929300,"[combinatorics, math, matrices]",PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Greed,500.0,A,1510929300,[implementation],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Wrath,1000.0,B,1510929300,"[implementation, two pointers]",PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Pride,1500.0,C,1510929300,[greedy],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Gluttony,2000.0,D,1510929300,"[constructive algorithms, greedy]",PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Envy,2500.0,E,1510929300,[],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,ACM ICPC,500.0,A,1510502700,[brute force],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Petya and Catacombs,1500.0,C,1510502700,"[dsu, greedy]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Restoration of string,2000.0,D,1510502700,"[constructive algorithms, graphs, implementation]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Maximum Element,2500.0,E,1510502700,"[combinatorics, dp]",PROGRAMMING +886,Технокубок 2018 - Отборочный Раунд 3,12,Symmetric Projections,3000.0,F,1510502700,[geometry],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Petya and Catacombs,500.0,A,1510502700,[greedy],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Restoration of string,1000.0,B,1510502700,"[dsu, graphs, strings]",PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Maximum Element,1500.0,C,1510502700,[dp],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Symmetric Projections,2000.0,D,1510502700,[geometry],PROGRAMMING +889,"Codeforces Round #445 (Div. 1, based on Technocup 2018 Elimination Round 3)",1,Mod Mod Mod,2250.0,E,1510502700,"[binary search, dp, math]",PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,ACM ICPC,500.0,A,1510502700,[],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Petya and Catacombs,1500.0,C,1510502700,[greedy],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Restoration of string,2000.0,D,1510502700,"[graphs, greedy, strings]",PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Maximum Element,2500.0,E,1510502700,[dp],PROGRAMMING +890,"Codeforces Round #445 (Div. 2, based on Technocup 2018 Elimination Round 3)",2,Symmetric Projections,3000.0,F,1510502700,[],PROGRAMMING +888,Educational Codeforces Round 32,12,Local Extrema,,A,1510239900,"[brute force, implementation]",PROGRAMMING +888,Educational Codeforces Round 32,12,Buggy Robot,,B,1510239900,"[dp, greedy]",PROGRAMMING +888,Educational Codeforces Round 32,12,K-Dominant Character,,C,1510239900,"[binary search, implementation, two pointers]",PROGRAMMING +888,Educational Codeforces Round 32,12,Almost Identity Permutations,,D,1510239900,"[combinatorics, dp, math]",PROGRAMMING +888,Educational Codeforces Round 32,12,Maximum Subsequence,,E,1510239900,"[bitmasks, divide and conquer, meet-in-the-middle]",PROGRAMMING +888,Educational Codeforces Round 32,12,Connecting Vertices,,F,1510239900,[dp],PROGRAMMING +888,Educational Codeforces Round 32,12,Xor-MST,,G,1510239900,"[bitmasks, constructive algorithms, data structures]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Div. 64,500.0,A,1509725100,[implementation],PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Cubes for Masha,1000.0,B,1509725100,[brute force],PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Solution for Cube,1500.0,C,1509725100,"[brute force, implementation]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Ratings and Reality Shows,2000.0,D,1509725100,"[data structures, two pointers]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Little Brother,2500.0,E,1509725100,"[binary search, geometry]",PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Row of Models,3000.0,F,1509725100,"[greedy, sortings]",PROGRAMMING +884,Educational Codeforces Round 31,12,Book Reading,,A,1509113100,[implementation],PROGRAMMING +884,Educational Codeforces Round 31,12,Japanese Crosswords Strike Back,,B,1509113100,[implementation],PROGRAMMING +884,Educational Codeforces Round 31,12,Bertown Subway,,C,1509113100,"[dfs and similar, greedy, math]",PROGRAMMING +884,Educational Codeforces Round 31,12,Boxes And Balls,,D,1509113100,"[data structures, greedy]",PROGRAMMING +884,Educational Codeforces Round 31,12,Binary Matrix,,E,1509113100,[dsu],PROGRAMMING +884,Educational Codeforces Round 31,12,Anti-Palindromize,,F,1509113100,"[flows, graphs, greedy]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Short Program,500.0,A,1509029100,"[bitmasks, constructive algorithms]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Teams Formation,1250.0,B,1509029100,[implementation],PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Tournament,1250.0,C,1509029100,"[data structures, graphs]",PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Magic Breeding,2000.0,D,1509029100,[],PROGRAMMING +878,Codeforces Round #443 (Div. 1),1,Numbers on the blackboard,2500.0,E,1509029100,"[combinatorics, dp]",PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Borya's Diagnosis,500.0,A,1509029100,[implementation],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Table Tennis,1000.0,B,1509029100,[implementation],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Short Program,1500.0,C,1509029100,"[bitmasks, constructive algorithms, graph matchings]",PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Teams Formation,2250.0,D,1509029100,[],PROGRAMMING +879,Codeforces Round #443 (Div. 2),2,Tournament,2250.0,E,1509029100,[],PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Alex and broken contest,500.0,A,1508773500,"[implementation, strings]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Nikita and string,1000.0,B,1508773500,"[brute force, dp]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Slava and tanks,1500.0,C,1508773500,[constructive algorithms],PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Olya and Energy Drinks,2000.0,D,1508773500,"[data structures, dfs and similar, shortest paths]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Danil and a Part-time Job,2250.0,E,1508773500,"[bitmasks, data structures, trees]",PROGRAMMING +877,Codeforces Round #442 (Div. 2),2,Ann and Books,2750.0,F,1508773500,"[data structures, flows, hashing]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Automatic Door,,A,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Army,,B,1508573100,"[constructive algorithms, graphs, greedy]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Downloading B++,,C,1508573100,[binary search],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen Strike Back,,D,1508573100,"[binary search, dp]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Field of Wonders,,E,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lost in Transliteration,,F,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Orientation of Edges,,G,1508573100,[graphs],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Palindromic Cut,,H,1508573100,"[brute force, implementation]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Photo Processing,,I,1508573100,"[binary search, dp]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Renovation,,J,1508573100,"[greedy, sortings]",PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Road Widening,,K,1508573100,[implementation],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland.Taxi,,L,1508573100,[data structures],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Quadcopter Competition,,M,1508573100,[greedy],PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Classroom Watch,500.0,A,1508151900,[brute force],PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Sorting the Coins,1000.0,B,1508151900,"[dsu, sortings, two pointers]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,National Property,1500.0,C,1508151900,"[2-sat, dfs and similar, graphs, implementation]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,High Cry,1750.0,D,1508151900,"[binary search, bitmasks, data structures, divide and conquer]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Delivery Club,2000.0,E,1508151900,"[binary search, data structures, dp]",PROGRAMMING +875,"Codeforces Round #441 (Div. 1, by Moscow Team Olympiad)",1,Royal Questions,2500.0,F,1508151900,"[dsu, greedy]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Trip For Meal,500.0,A,1508151900,[math],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Divisiblity of Differences,1000.0,B,1508151900,[math],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Classroom Watch,1500.0,C,1508151900,[brute force],PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Sorting the Coins,2000.0,D,1508151900,"[dsu, sortings, trees, two pointers]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,National Property,2500.0,E,1508151900,"[2-sat, dfs and similar, graphs]",PROGRAMMING +876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,High Cry,2750.0,F,1508151900,[data structures],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Search for Pretty Integers,500.0,A,1508054700,"[brute force, implementation]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Maximum of Maximums of Minimums,1000.0,B,1508054700,[greedy],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Maximum splitting,1500.0,C,1508054700,"[dp, greedy, number theory]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Something with XOR Queries,2250.0,D,1508054700,"[brute force, probabilities]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Paths,3250.0,F,1508054700,"[data structures, number theory]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Maximum splitting,500.0,A,1508054700,"[dp, greedy, math, number theory]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Something with XOR Queries,1250.0,B,1508054700,"[brute force, implementation]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,"Points, Lines and Ready-made Titles",1500.0,C,1508054700,"[dfs and similar, graphs]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Paths,2250.0,D,1508054700,"[number theory, sortings]",PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Restore the Tree,2250.0,E,1508054700,"[graphs, greedy, trees]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Search for Pretty Integers,500.0,A,1508054700,[implementation],PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum of Maximums of Minimums,1000.0,B,1508054700,[implementation],PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Maximum splitting,1500.0,C,1508054700,"[greedy, math, number theory]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Something with XOR Queries,2250.0,D,1508054700,"[brute force, implementation]",PROGRAMMING +872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,[],PROGRAMMING +873,Educational Codeforces Round 30,12,Chores,,A,1507817100,[implementation],PROGRAMMING +873,Educational Codeforces Round 30,12,Balanced Substring,,B,1507817100,"[dp, implementation]",PROGRAMMING +873,Educational Codeforces Round 30,12,Strange Game On Matrix,,C,1507817100,"[greedy, two pointers]",PROGRAMMING +873,Educational Codeforces Round 30,12,Merge Sort,,D,1507817100,"[constructive algorithms, divide and conquer]",PROGRAMMING +873,Educational Codeforces Round 30,12,Awards For Contestants,,E,1507817100,"[brute force, data structures, dp]",PROGRAMMING +873,Educational Codeforces Round 30,12,Forbidden Indices,,F,1507817100,"[dsu, string suffix structures, strings]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Artful Expedient,500.0,A,1507296900,"[brute force, implementation]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Eternal Immortality,1000.0,B,1507296900,[math],PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Intriguing Obsession,1500.0,C,1507296900,"[combinatorics, dp, math]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Overdosing Ubiquity,2250.0,D,1507296900,"[brute force, dfs and similar, graphs]",PROGRAMMING +869,Codeforces Round #439 (Div. 2),2,The Untended Antiquity,2500.0,E,1507296900,"[data structures, hashing]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Bark to Unlock,250.0,A,1507187100,"[brute force, strings]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Race Against Time,500.0,B,1507187100,[implementation],PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Qualification Rounds,1000.0,C,1507187100,"[bitmasks, brute force, constructive algorithms, dp]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Huge Strings,1500.0,D,1507187100,"[bitmasks, brute force, dp, strings]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Policeman and a Tree,2250.0,E,1507187100,"[dp, graphs, trees]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Yet Another Minimization Problem,2500.0,F,1507187100,"[divide and conquer, dp]",PROGRAMMING +868,Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,El Toll Caves,3500.0,G,1507187100,[math],PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Save the problem!,500.0,A,1506791100,[constructive algorithms],PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Ordering Pizza,1000.0,B,1506791100,"[binary search, sortings, ternary search]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Buy Low Sell High,2000.0,D,1506791100,"[constructive algorithms, data structures, greedy]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Hex Dyslexia,2500.0,E,1506791100,"[bitmasks, brute force, dp, graphs]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Egg Roulette,3000.0,F,1506791100,"[bitmasks, brute force, divide and conquer, math, meet-in-the-middle]",PROGRAMMING +865,MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists),12,Flowers and Chocolate,3500.0,G,1506791100,"[combinatorics, math, matrices]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Save the problem!,500.0,A,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Ordering Pizza,1000.0,B,1506791100,"[greedy, implementation, sortings]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Gotta Go Fast,1500.0,C,1506791100,"[binary search, dp, probabilities]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Buy Low Sell High,2000.0,D,1506791100,"[data structures, greedy, two pointers]",PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Hex Dyslexia,2500.0,E,1506791100,[],PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Egg Roulette,3000.0,F,1506791100,[],PROGRAMMING +866,MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1),1,Flowers and Chocolate,3500.0,G,1506791100,[math],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Between the Offices,500.0,A,1506791100,[implementation],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Save the problem!,1000.0,B,1506791100,"[combinatorics, constructive algorithms, math]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Ordering Pizza,1500.0,C,1506791100,"[greedy, implementation, sortings, ternary search]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Gotta Go Fast,2000.0,D,1506791100,[],PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Buy Low Sell High,2500.0,E,1506791100,"[data structures, greedy]",PROGRAMMING +867,"Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)",2,Hex Dyslexia,3000.0,F,1506791100,[],PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Fair Game,500.0,A,1506335700,"[implementation, sortings]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Polycarp and Letters,1000.0,B,1506335700,"[brute force, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Bus,1500.0,C,1506335700,"[greedy, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Make a Permutation!,2000.0,D,1506335700,"[greedy, implementation]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Fire,2500.0,E,1506335700,"[dp, sortings]",PROGRAMMING +864,Codeforces Round #436 (Div. 2),2,Cities Excursions,3000.0,F,1506335700,[dfs and similar],PROGRAMMING +855,"Manthan, Codefest 17",12,Tom Riddle's Diary,500.0,A,1506263700,[implementation],PROGRAMMING +855,"Manthan, Codefest 17",12,Marvolo Gaunt's Ring,1000.0,B,1506263700,"[data structures, dp]",PROGRAMMING +855,"Manthan, Codefest 17",12,Helga Hufflepuff's Cup,1500.0,C,1506263700,"[dp, trees]",PROGRAMMING +855,"Manthan, Codefest 17",12,Rowena Ravenclaw's Diadem,2000.0,D,1506263700,[trees],PROGRAMMING +855,"Manthan, Codefest 17",12,Salazar Slytherin's Locket,2500.0,E,1506263700,"[bitmasks, dp]",PROGRAMMING +855,"Manthan, Codefest 17",12,Nagini,3000.0,F,1506263700,[data structures],PROGRAMMING +855,"Manthan, Codefest 17",12,Harry Vs Voldemort,3500.0,G,1506263700,"[dp, graphs, trees]",PROGRAMMING +863,Educational Codeforces Round 29,12,Quasi-palindrome,,A,1506006300,"[brute force, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Kayaking,,B,1506006300,"[brute force, greedy, sortings]",PROGRAMMING +863,Educational Codeforces Round 29,12,1-2-3,,C,1506006300,"[graphs, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Yet Another Array Queries Problem,,D,1506006300,"[data structures, implementation]",PROGRAMMING +863,Educational Codeforces Round 29,12,Turn Off The TV,,E,1506006300,"[data structures, sortings]",PROGRAMMING +863,Educational Codeforces Round 29,12,Almost Permutation,,F,1506006300,[flows],PROGRAMMING +863,Educational Codeforces Round 29,12,Graphic Settings,,G,1506006300,[],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the MEX,500.0,A,1505833500,[implementation],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the bipartiteness,1000.0,B,1505833500,"[dfs and similar, graphs]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the xor,1500.0,C,1505833500,[constructive algorithms],PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the binary string,1750.0,D,1505833500,"[binary search, divide and conquer]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the function,2000.0,E,1505833500,"[binary search, data structures]",PROGRAMMING +862,Codeforces Round #435 (Div. 2),2,Mahmoud and Ehab and the final stage,2750.0,F,1505833500,"[data structures, strings]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Union of Doubly Linked Lists,,A,1505739900,[implementation],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Preparing for Merge Sort,,B,1505739900,[binary search],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Sum of Nestings,,C,1505739900,[],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Dog Show,,D,1505739900,"[data structures, greedy]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Packmen,,E,1505739900,[binary search],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland Elections,,F,1505739900,[greedy],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,University Classes,,G,1505739900,[implementation],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Load Testing,,H,1505739900,[],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Noise Level,,I,1505739900,[dfs and similar],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Students Initiation,,J,1505739900,"[binary search, flows]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Travel Cards,,K,1505739900,[sortings],PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland SU Computer Network,,L,1505739900,"[dfs and similar, hashing, trees]",PROGRAMMING +847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Weather Tomorrow,,M,1505739900,[implementation],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,k-rounding,750.0,A,1505653500,"[brute force, number theory]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Did you mean...,1500.0,C,1505653500,"[dp, greedy, implementation]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Polycarp's phone book,2000.0,D,1505653500,"[data structures, sortings]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Tests Renumeration,2500.0,E,1505653500,[implementation],PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Wizard's Tour,3000.0,F,1505653500,"[constructive algorithms, dfs and similar]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Did you mean...,500.0,A,1505653500,[greedy],PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Polycarp's phone book,1000.0,B,1505653500,"[brute force, data structures, hashing, strings]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Tests Renumeration,1500.0,C,1505653500,[greedy],PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Wizard's Tour,2000.0,D,1505653500,"[dfs and similar, graphs, greedy]",PROGRAMMING +860,"Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1)",1,Arkady and a Nobody-men,2250.0,E,1505653500,"[data structures, dfs and similar, trees]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,k-rounding,750.0,A,1505653500,"[math, number theory]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Did you mean...,1500.0,C,1505653500,"[brute force, strings]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Polycarp's phone book,2000.0,D,1505653500,"[brute force, data structures, strings]",PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Tests Renumeration,2500.0,E,1505653500,[],PROGRAMMING +861,"Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)",2,Wizard's Tour,3000.0,F,1505653500,[dfs and similar],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Declined Finalists,500.0,A,1505583300,[greedy],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Lazy Security Guard,750.0,B,1505583300,"[brute force, math]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Pie Rules,1000.0,C,1505583300,"[dp, games]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Third Month Insanity,1500.0,D,1505583300,"[dp, probabilities]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Desk Disorder,2000.0,E,1505583300,"[combinatorics, dfs and similar, dsu, graphs, trees]",PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Ordering T-Shirts,2750.0,F,1505583300,[greedy],PROGRAMMING +859,MemSQL Start[c]UP 3.0 - Round 1,12,Circle of Numbers,3000.0,G,1505583300,[math],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Set Theory,,A,1505050500,"[brute force, constructive algorithms]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Similar Words,,B,1505050500,"[dp, strings]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Eleventh Birthday,,C,1505050500,"[combinatorics, dp, math]",PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Masha and Cactus,,D,1505050500,[],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,Satellites,,E,1505050500,[],PROGRAMMING +856,"Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed]",1,To Play or not to Play,,F,1505050500,[],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Planning,750.0,A,1504702500,[greedy],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Jury Meeting,750.0,B,1504702500,"[greedy, sortings, two pointers]",PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Boredom,1750.0,C,1504702500,[data structures],PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Michael and Charging Stations,1750.0,D,1504702500,"[binary search, dp]",PROGRAMMING +853,"Codeforces Round #433 (Div. 1, based on Olympiad of Metropolises)",1,Lada Malina,2500.0,E,1504702500,"[data structures, geometry]",PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Fraction,500.0,A,1504702500,"[brute force, constructive algorithms, math]",PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Maxim Buys an Apartment,1000.0,B,1504702500,[constructive algorithms],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Planning,1750.0,C,1504702500,[],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Jury Meeting,1750.0,D,1504702500,[greedy],PROGRAMMING +854,"Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)",2,Boredom,2500.0,E,1504702500,[data structures],PROGRAMMING +846,Educational Codeforces Round 28,12,Curriculum Vitae,,A,1504623900,[brute force],PROGRAMMING +846,Educational Codeforces Round 28,12,Math Show,,B,1504623900,"[brute force, greedy]",PROGRAMMING +846,Educational Codeforces Round 28,12,Four Segments,,C,1504623900,"[brute force, dp]",PROGRAMMING +846,Educational Codeforces Round 28,12,Monitor,,D,1504623900,"[binary search, data structures]",PROGRAMMING +846,Educational Codeforces Round 28,12,Chemistry in Berland,,E,1504623900,"[dfs and similar, greedy, trees]",PROGRAMMING +846,Educational Codeforces Round 28,12,Random Query,,F,1504623900,"[math, two pointers]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Five Dimensional Points,500.0,A,1504535700,"[brute force, geometry, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a list of numbers,1000.0,B,1504535700,[number theory],PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a game with Mojtaba,1250.0,C,1504535700,"[bitmasks, dp, games]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Tournament Construction,1750.0,D,1504535700,"[dp, graphs, greedy, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Random Elections,2000.0,E,1504535700,"[bitmasks, brute force, fft, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Rainbow Balls,2500.0,F,1504535700,[math],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a research in Mexican wave,500.0,A,1504535700,[implementation],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and an exam about geometry,1000.0,B,1504535700,"[geometry, math]",PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Five Dimensional Points,1500.0,C,1504535700,"[brute force, math]",PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a list of numbers,2000.0,D,1504535700,[],PROGRAMMING +851,"Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)",2,Arpa and a game with Mojtaba,2500.0,E,1504535700,"[bitmasks, games]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Digits,,A,1504432800,"[brute force, implementation, math]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Neural Network country,,B,1504432800,"[dp, matrices]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Property,,C,1504432800,"[greedy, sortings]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Exploration plan,,D,1504432800,"[binary search, flows, graph matchings, shortest paths]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Casinos and travel,,E,1504432800,[dp],PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Product transformation,,F,1504432800,"[combinatorics, math, number theory]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Bathroom terminal,,G,1504432800,[implementation],PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Bob and stages,,H,1504432800,"[dp, geometry]",PROGRAMMING +852,Bubble Cup X - Finals [Online Mirror],12,Dating,,I,1504432800,"[brute force, dfs and similar, graphs, trees]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,From Y to Y,500.0,A,1504272900,[constructive algorithms],PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Rooter's Song,1000.0,B,1504272900,"[constructive algorithms, data structures, geometry, implementation, sortings, two pointers]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Goodbye Souvenir,1750.0,C,1504272900,"[data structures, divide and conquer]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Shake It!,1750.0,D,1504272900,"[combinatorics, dp, flows, graphs]",PROGRAMMING +848,Codeforces Round #431 (Div. 1),1,Days of Floral Colours,2500.0,E,1504272900,"[combinatorics, dp, fft, math]",PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Odds and Ends,500.0,A,1504272900,[implementation],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Tell Your World,1000.0,B,1504272900,"[brute force, geometry]",PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,From Y to Y,1500.0,C,1504272900,[constructive algorithms],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Rooter's Song,2000.0,D,1504272900,[],PROGRAMMING +849,Codeforces Round #431 (Div. 2),2,Goodbye Souvenir,2500.0,E,1504272900,[data structures],PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Kirill And The Game,500.0,A,1504019100,"[brute force, two pointers]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Gleb And Pizza,1000.0,B,1504019100,[geometry],PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Ilya And The Tree,1500.0,C,1504019100,"[dfs and similar, math, trees]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Vitya and Strange Lesson,2000.0,D,1504019100,"[binary search, data structures]",PROGRAMMING +842,Codeforces Round #430 (Div. 2),2,Nikita and game,2500.0,E,1504019100,"[binary search, dfs and similar, divide and conquer, trees]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Sorting by Subsequences,500.0,A,1503592500,"[dfs and similar, dsu, implementation, sortings]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Interactive LowerBound,1000.0,B,1503592500,"[brute force, probabilities]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Upgrading Tree,1750.0,C,1503592500,"[constructive algorithms, dfs and similar, math]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Dynamic Shortest Path,2250.0,D,1503592500,"[graphs, shortest paths]",PROGRAMMING +843,AIM Tech Round 4 (Div. 1),1,Maximum Flow,2250.0,E,1503592500,[flows],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Diversity,500.0,A,1503592500,[implementation],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Rectangles,1000.0,B,1503592500,"[combinatorics, math]",PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Sorting by Subsequences,1500.0,C,1503592500,[dfs and similar],PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Interactive LowerBound,2000.0,D,1503592500,"[brute force, probabilities]",PROGRAMMING +844,AIM Tech Round 4 (Div. 2),2,Upgrading Tree,3000.0,E,1503592500,[],PROGRAMMING +845,Educational Codeforces Round 27,12,Chess Tourney,,A,1503327900,[sortings],PROGRAMMING +845,Educational Codeforces Round 27,12,Luba And The Ticket,,B,1503327900,"[brute force, greedy]",PROGRAMMING +845,Educational Codeforces Round 27,12,Two TVs,,C,1503327900,"[data structures, greedy, sortings]",PROGRAMMING +845,Educational Codeforces Round 27,12,Driving Test,,D,1503327900,"[data structures, dp, greedy]",PROGRAMMING +845,Educational Codeforces Round 27,12,Fire in the City,,E,1503327900,"[binary search, data structures]",PROGRAMMING +845,Educational Codeforces Round 27,12,Guards In The Storehouse,,F,1503327900,[dp],PROGRAMMING +845,Educational Codeforces Round 27,12,Shortest Path Problem?,,G,1503327900,"[dfs and similar, math]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Leha and Function,500.0,A,1503068700,"[combinatorics, greedy, math, number theory, sortings]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Leha and another game about graph,1000.0,B,1503068700,"[constructive algorithms, data structures, dfs and similar, dp, graphs]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,On the Bench,1500.0,C,1503068700,"[combinatorics, dp]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,Destiny,2000.0,D,1503068700,"[data structures, probabilities]",PROGRAMMING +840,Codeforces Round #429 (Div. 1),1,In a Trap,2500.0,E,1503068700,[trees],PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Generous Kefa,500.0,A,1503068700,"[brute force, implementation]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Godsend,1000.0,B,1503068700,"[games, math]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Leha and Function,1500.0,C,1503068700,[greedy],PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,Leha and another game about graph,2000.0,D,1503068700,"[dfs and similar, graphs]",PROGRAMMING +841,Codeforces Round #429 (Div. 2),2,On the Bench,2500.0,E,1503068700,[],PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Arya and Bran,500.0,A,1502548500,[implementation],PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Game of the Rows,1000.0,B,1502548500,"[brute force, greedy, implementation]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Journey,1500.0,C,1502548500,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Winter is here,2000.0,D,1502548500,"[combinatorics, dp, math, number theory]",PROGRAMMING +839,Codeforces Round #428 (Div. 2),2,Mother of Dragons,2500.0,E,1502548500,"[brute force, graphs, math, meet-in-the-middle]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Binary Blocks,,A,1502085900,[brute force],PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Diverging Directions,,B,1502085900,"[data structures, dfs and similar, trees]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Future Failure,,C,1502085900,"[dp, games]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Airplane Arrangements,,D,1502085900,"[math, number theory]",PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Convex Countour,,E,1502085900,[dp],PROGRAMMING +838,"IndiaHacks 2nd Elimination 2017 (unofficial, unrated mirror, ICPC rules)",12,Expected Earnings,,F,1502085900,[],PROGRAMMING +837,Educational Codeforces Round 26,12,Text Volume,,A,1501773300,[implementation],PROGRAMMING +837,Educational Codeforces Round 26,12,Flag of Berland,,B,1501773300,"[brute force, implementation]",PROGRAMMING +837,Educational Codeforces Round 26,12,Two Seals,,C,1501773300,[brute force],PROGRAMMING +837,Educational Codeforces Round 26,12,Round Subset,,D,1501773300,[dp],PROGRAMMING +837,Educational Codeforces Round 26,12,Vasya's Function,,E,1501773300,"[binary search, implementation, math]",PROGRAMMING +837,Educational Codeforces Round 26,12,Prefix Sums,,F,1501773300,"[binary search, brute force, combinatorics, math, matrices]",PROGRAMMING +837,Educational Codeforces Round 26,12,Functions On The Segments,,G,1501773300,[data structures],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Key races,500.0,A,1501511700,[math],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,The number on the board,750.0,B,1501511700,[greedy],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Star sky,1250.0,C,1501511700,"[dp, implementation]",PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Palindromic characteristics,1500.0,D,1501511700,"[brute force, dp, hashing, strings]",PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,The penguin's game,2250.0,E,1501511700,[constructive algorithms],PROGRAMMING +835,Codeforces Round #427 (Div. 2),2,Roads in the Kingdom,2250.0,F,1501511700,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,The Meaningless Game,500.0,A,1501425300,"[math, number theory]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,The Bakery,1250.0,B,1501425300,"[binary search, data structures, dp, two pointers]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Ever-Hungry Krakozyabra,1500.0,C,1501425300,"[brute force, greedy]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Red-Black Cobweb,2250.0,D,1501425300,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING +833,Codeforces Round #426 (Div. 1),1,Caramel Clouds,2500.0,E,1501425300,"[data structures, dp, sortings]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Useless Toy,500.0,A,1501425300,[implementation],PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Festive Evening,1000.0,B,1501425300,"[data structures, implementation]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Meaningless Game,1500.0,C,1501425300,[math],PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,The Bakery,2250.0,D,1501425300,"[data structures, divide and conquer, dp]",PROGRAMMING +834,Codeforces Round #426 (Div. 2),2,Ever-Hungry Krakozyabra,2500.0,E,1501425300,[],PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Sasha and Sticks,500.0,A,1500906900,"[games, math]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Petya and Exam,1000.0,B,1500906900,[implementation],PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Strange Radiation,1750.0,C,1500906900,"[binary search, implementation, math]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,"Misha, Grisha and Underground",2000.0,D,1500906900,"[dfs and similar, trees]",PROGRAMMING +832,Codeforces Round #425 (Div. 2),2,Vasya and Shifts,2500.0,E,1500906900,[matrices],PROGRAMMING +825,Educational Codeforces Round 25,12,Binary Protocol,,A,1500217500,[implementation],PROGRAMMING +825,Educational Codeforces Round 25,12,Five-In-a-Row,,B,1500217500,"[brute force, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Multi-judge Solving,,C,1500217500,"[greedy, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Suitable Replacement,,D,1500217500,"[greedy, implementation]",PROGRAMMING +825,Educational Codeforces Round 25,12,Minimal Labels,,E,1500217500,"[data structures, graphs, greedy]",PROGRAMMING +825,Educational Codeforces Round 25,12,String Compression,,F,1500217500,"[dp, hashing, string suffix structures, strings]",PROGRAMMING +825,Educational Codeforces Round 25,12,Tree Queries,,G,1500217500,"[dfs and similar, graphs, trees]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Office Keys,500.0,A,1499958300,"[binary search, brute force, dp, greedy, sortings]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Cards Sorting,1000.0,B,1499958300,"[data structures, implementation, sortings]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Bamboo Partition,1500.0,C,1499958300,"[brute force, math, number theory, sortings, two pointers]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Singer House,2250.0,D,1499958300,"[combinatorics, dp, trees]",PROGRAMMING +830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Perpetual Motion Machine,2250.0,E,1499958300,"[constructive algorithms, implementation, math, trees]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Unimodal Array,500.0,A,1499958300,[implementation],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Keyboard Layouts,750.0,B,1499958300,"[implementation, strings]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Jury Marks,1000.0,C,1499958300,[brute force],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Office Keys,1500.0,D,1499958300,"[binary search, brute force, dp, greedy]",PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Cards Sorting,2000.0,E,1499958300,[data structures],PROGRAMMING +831,"Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)",2,Bamboo Partition,2500.0,F,1499958300,[],PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,String Reconstruction,500.0,A,1499791500,"[data structures, greedy]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,High Load,750.0,B,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,DNA Evolution,1500.0,C,1499791500,[data structures],PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Best Edge Weight,1750.0,D,1499791500,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Rusty String,1750.0,E,1499791500,"[fft, math]",PROGRAMMING +827,"Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)",1,Dirty Arkady's Kitchen,2500.0,F,1499791500,"[dp, shortest paths]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Restaurant Tables,500.0,A,1499791500,[implementation],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Black Square,750.0,B,1499791500,[implementation],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,String Reconstruction,1250.0,C,1499791500,"[data structures, sortings]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,High Load,1750.0,D,1499791500,"[constructive algorithms, greedy, trees]",PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,DNA Evolution,2000.0,E,1499791500,[data structures],PROGRAMMING +828,"Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals)",2,Best Edge Weight,2750.0,F,1499791500,[data structures],PROGRAMMING +823,VK Cup 2017 - Finals,12,High Load,500.0,A,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,DNA Evolution,1000.0,B,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Bamboo Partition,1500.0,C,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Rusty String,2000.0,D,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Singer House,2750.0,E,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Perpetual Motion Machine,2750.0,F,1499587500,[],PROGRAMMING +823,VK Cup 2017 - Finals,12,Dirty Arkady's Kitchen,3500.0,G,1499587500,[],PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,I'm bored with life,500.0,A,1499011500,"[implementation, math, number theory]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Crossword solving,750.0,B,1499011500,"[brute force, implementation, strings]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,"Hacker, pack your bags!",1250.0,C,1499011500,"[binary search, greedy, sortings]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,My pretty girl Noora,1750.0,D,1499011500,"[brute force, dp, greedy, math, number theory]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Liar,2250.0,E,1499011500,"[binary search, dp, hashing, string suffix structures]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Madness,2500.0,F,1499011500,"[dfs and similar, trees]",PROGRAMMING +818,Educational Codeforces Round 24,12,Diplomas and Certificates,,A,1498748700,"[implementation, math]",PROGRAMMING +818,Educational Codeforces Round 24,12,Permutation Game,,B,1498748700,[implementation],PROGRAMMING +818,Educational Codeforces Round 24,12,Sofa Thief,,C,1498748700,"[brute force, implementation]",PROGRAMMING +818,Educational Codeforces Round 24,12,Multicolored Cars,,D,1498748700,"[data structures, implementation]",PROGRAMMING +818,Educational Codeforces Round 24,12,Card Game Again,,E,1498748700,"[binary search, data structures, number theory, two pointers]",PROGRAMMING +818,Educational Codeforces Round 24,12,Level Generation,,F,1498748700,"[binary search, math, ternary search]",PROGRAMMING +818,Educational Codeforces Round 24,12,Four Melodies,,G,1498748700,[flows],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Boring Game,500.0,A,1498574100,[],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and PR Shifts,1000.0,B,1498574100,"[data structures, implementation]",PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Beacons on Field,1500.0,C,1498574100,[number theory],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Astronomers,2000.0,D,1498574100,[number theory],PROGRAMMING +819,Codeforces Round #421 (Div. 1),1,Mister B and Flight to the Moon,2500.0,E,1498574100,"[constructive algorithms, graphs]",PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Book Reading,500.0,A,1498574100,[implementation],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Angle in Polygon,1000.0,B,1498574100,"[constructive algorithms, geometry]",PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Boring Game,1500.0,C,1498574100,[],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and PR Shifts,2000.0,D,1498574100,[],PROGRAMMING +820,Codeforces Round #421 (Div. 2),2,Mister B and Beacons on Field,2500.0,E,1498574100,[],PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Future Gadget Laboratory,500.0,A,1498401300,[implementation],PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Banana Trees,1000.0,B,1498401300,"[brute force, math]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and Boxes,1500.0,C,1498401300,"[data structures, trees]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and City,2000.0,D,1498401300,"[graphs, shortest paths]",PROGRAMMING +821,Codeforces Round #420 (Div. 2),2,Okabe and El Psy Kongroo,2500.0,E,1498401300,"[dp, matrices]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Game,500.0,A,1497710100,"[brute force, greedy, implementation]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Test,1250.0,B,1497710100,"[brute force, constructive algorithms, math]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Supermarket,1500.0,C,1497710100,"[brute force, dp, trees]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Cards,2250.0,D,1497710100,"[binary search, combinatorics, data structures, geometry]",PROGRAMMING +815,Codeforces Round #419 (Div. 1),1,Karen and Neighborhood,2250.0,E,1497710100,"[binary search, constructive algorithms]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Morning,500.0,A,1497710100,"[brute force, implementation]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Coffee,1000.0,B,1497710100,"[binary search, data structures]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Game,1500.0,C,1497710100,"[brute force, greedy]",PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Test,2000.0,D,1497710100,[combinatorics],PROGRAMMING +816,Codeforces Round #419 (Div. 2),2,Karen and Supermarket,2750.0,E,1497710100,"[dp, trees]",PROGRAMMING +817,Educational Codeforces Round 23,12,Treasure Hunt,,A,1497539100,"[implementation, number theory]",PROGRAMMING +817,Educational Codeforces Round 23,12,Makes And The Product,,B,1497539100,"[combinatorics, sortings]",PROGRAMMING +817,Educational Codeforces Round 23,12,Really Big Numbers,,C,1497539100,"[binary search, brute force, dp, math]",PROGRAMMING +817,Educational Codeforces Round 23,12,Imbalanced Array,,D,1497539100,"[data structures, divide and conquer, dsu, sortings]",PROGRAMMING +817,Educational Codeforces Round 23,12,Choosing The Commander,,E,1497539100,"[bitmasks, data structures, trees]",PROGRAMMING +817,Educational Codeforces Round 23,12,MEX Queries,,F,1497539100,"[binary search, data structures, trees]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An abandoned sentiment from past,500.0,A,1496837700,"[implementation, sortings]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An express train to reveries,1000.0,B,1496837700,[constructive algorithms],PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An impassioned circulation of affection,1750.0,C,1496837700,"[brute force, dp, strings, two pointers]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An overnight dance in discotheque,1750.0,D,1496837700,"[dfs and similar, dp, geometry, greedy, trees]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An unavoidable detour for home,2500.0,E,1496837700,"[combinatorics, dp]",PROGRAMMING +813,Educational Codeforces Round 22,12,The Contest,,A,1496675100,[implementation],PROGRAMMING +813,Educational Codeforces Round 22,12,The Golden Age,,B,1496675100,"[brute force, math]",PROGRAMMING +813,Educational Codeforces Round 22,12,The Tag Game,,C,1496675100,[dfs and similar],PROGRAMMING +813,Educational Codeforces Round 22,12,Two Melodies,,D,1496675100,"[dp, flows]",PROGRAMMING +813,Educational Codeforces Round 22,12,Army Creation,,E,1496675100,"[binary search, data structures]",PROGRAMMING +813,Educational Codeforces Round 22,12,Bipartite Checking,,F,1496675100,"[data structures, dsu, graphs]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Crossroads,500.0,A,1496326500,[implementation],PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,"Sagheer, the Hausmeister",1000.0,B,1496326500,"[bitmasks, brute force, dp]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Nubian Market,1500.0,C,1496326500,[binary search],PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Kindergarten,2000.0,D,1496326500,"[dfs and similar, graphs, implementation]",PROGRAMMING +812,Codeforces Round #417 (Div. 2),2,Sagheer and Apple Tree,2500.0,E,1496326500,[games],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (easy),,A,1495958700,[greedy],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (medium),,B,1495958700,"[data structures, greedy]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Heidi and Library (hard),,C,1495958700,[flows],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (easy),,D,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (medium),,E,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Marmots (hard),,F,1495958700,[math],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (easy),,G,1495958700,[implementation],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (medium),,H,1495958700,[constructive algorithms],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Fake News (hard),,I,1495958700,[string suffix structures],PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (easy),,J,1495958700,"[dfs and similar, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (medium),,K,1495958700,"[dp, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,Send the Fool Further! (hard),,L,1495958700,"[dfs and similar, dp, math, trees]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (easy),,M,1495958700,"[greedy, sortings]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (medium),,N,1495958700,"[binary search, flows]",PROGRAMMING +802,"Helvetic Coding Contest 2017 online mirror (teams allowed, unrated)",12,April Fools' Problem (hard),,O,1495958700,"[binary search, flows]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Courtesy,500.0,A,1495877700,"[brute force, implementation]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Complicated Book,1000.0,B,1495877700,"[implementation, sortings]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Memorable Trip,1500.0,C,1495877700,"[dp, implementation]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Favorite Game,2000.0,D,1495877700,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +811,Codeforces Round #416 (Div. 2),2,Vladik and Entertaining Flags,2500.0,E,1495877700,"[data structures, dsu, graphs]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Do you want a date?,500.0,A,1495303500,"[math, sortings]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Glad to see you!,1000.0,B,1495303500,[binary search],PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Find a car,1500.0,C,1495303500,"[combinatorics, divide and conquer, dp]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Hitchhiking in the Baltic States,2000.0,D,1495303500,"[data structures, dp]",PROGRAMMING +809,Codeforces Round #415 (Div. 1),1,Surprise me!,2500.0,E,1495303500,"[divide and conquer, math, trees]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Straight <>,500.0,A,1495303500,"[implementation, math]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Summer sell-off,1000.0,B,1495303500,"[greedy, sortings]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Do you want a date?,1500.0,C,1495303500,"[math, sortings]",PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Glad to see you!,2000.0,D,1495303500,[binary search],PROGRAMMING +810,Codeforces Round #415 (Div. 2),2,Find a car,2500.0,E,1495303500,"[divide and conquer, dp]",PROGRAMMING +808,Educational Codeforces Round 21,12,Lucky Year,,A,1494860700,[implementation],PROGRAMMING +808,Educational Codeforces Round 21,12,Average Sleep Time,,B,1494860700,"[data structures, math]",PROGRAMMING +808,Educational Codeforces Round 21,12,Tea Party,,C,1494860700,"[constructive algorithms, greedy]",PROGRAMMING +808,Educational Codeforces Round 21,12,Array Division,,D,1494860700,"[binary search, data structures, implementation]",PROGRAMMING +808,Educational Codeforces Round 21,12,Selling Souvenirs,,E,1494860700,"[dp, greedy, ternary search]",PROGRAMMING +808,Educational Codeforces Round 21,12,Card Game,,F,1494860700,"[binary search, flows, graphs]",PROGRAMMING +808,Educational Codeforces Round 21,12,Anthem of Berland,,G,1494860700,"[dp, strings]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Bank Robbery,500.0,A,1494668100,[implementation],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Cutting Carrot,1000.0,B,1494668100,"[geometry, math]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Naming Company,1750.0,C,1494668100,"[games, greedy, sortings]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Labelling Cities,2000.0,D,1494668100,"[dfs and similar, graphs, hashing]",PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Choosing Carrot,2500.0,E,1494668100,[games],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Leha and security system,2750.0,F,1494668100,[data structures],PROGRAMMING +794,"Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)",12,Replace All,3500.0,G,1494668100,"[combinatorics, dp, math]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Carrot Cakes,500.0,A,1494516900,"[brute force, implementation]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,T-shirt buying,1000.0,B,1494516900,"[data structures, implementation]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Fountains,1500.0,C,1494516900,"[binary search, data structures]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Field expansion,2000.0,D,1494516900,"[brute force, dp, meet-in-the-middle]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Aquarium decoration,2500.0,E,1494516900,"[data structures, greedy, two pointers]",PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Beautiful fountains rows,3250.0,F,1494516900,[data structures],PROGRAMMING +799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Cut the pie,3500.0,G,1494516900,"[binary search, data structures, geometry]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Prairie Partition,1750.0,C,1494171900,"[binary search, constructive algorithms, greedy, math]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Perishable Roads,2500.0,D,1494171900,"[dp, graphs, shortest paths]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Blog Post Rating,2750.0,E,1494171900,"[data structures, sortings]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Test Data Generation,3500.0,F,1494171900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Prairie Partition,1750.0,C,1494171900,"[binary search, greedy]",PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Perishable Roads,2500.0,D,1494171900,[graphs],PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Blog Post Rating,2750.0,E,1494171900,[data structures],PROGRAMMING +806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Test Data Generation,3500.0,F,1494171900,[],PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Is it rated?,500.0,A,1494171900,"[implementation, sortings]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,T-Shirt Hunt,1000.0,B,1494171900,"[brute force, implementation]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Success Rate,1500.0,C,1494171900,"[binary search, math]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Dynamic Problem Scoring,2000.0,D,1494171900,"[brute force, greedy]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Prairie Partition,2750.0,E,1494171900,"[binary search, greedy]",PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Perishable Roads,3500.0,F,1494171900,[],PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Find Amir,500.0,A,1493909400,"[greedy, math]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Minimum number of steps,1000.0,B,1493909400,"[greedy, implementation, math]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Ice cream coloring,1500.0,C,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Expected diameter of a tree,2000.0,D,1493909400,"[binary search, brute force, dfs and similar, dp, sortings, trees]",PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,The same permutation ,2500.0,E,1493909400,[constructive algorithms],PROGRAMMING +804,Codeforces Round #411 (Div. 1),1,Fake bullions,3000.0,F,1493909400,"[dfs and similar, dp, graphs]",PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Fake NP,500.0,A,1493909400,[math],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,3-palindrome,1000.0,B,1493909400,[constructive algorithms],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Find Amir,1500.0,C,1493909400,[constructive algorithms],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Minimum number of steps,2000.0,D,1493909400,[],PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Ice cream coloring,2500.0,E,1493909400,"[constructive algorithms, dfs and similar]",PROGRAMMING +805,Codeforces Round #411 (Div. 2),2,Expected diameter of a tree,3000.0,F,1493909400,"[graphs, probabilities]",PROGRAMMING +803,Educational Codeforces Round 20,12,Maximal Binary Matrix,,A,1493391900,[constructive algorithms],PROGRAMMING +803,Educational Codeforces Round 20,12,Distances to Zero,,B,1493391900,[constructive algorithms],PROGRAMMING +803,Educational Codeforces Round 20,12,Maximal GCD,,C,1493391900,"[greedy, math]",PROGRAMMING +803,Educational Codeforces Round 20,12,Magazine Ad,,D,1493391900,"[binary search, greedy]",PROGRAMMING +803,Educational Codeforces Round 20,12,Roma and Poker,,E,1493391900,[dp],PROGRAMMING +803,Educational Codeforces Round 20,12,Coprime Subsequences,,F,1493391900,"[bitmasks, combinatorics, number theory]",PROGRAMMING +803,Educational Codeforces Round 20,12,Periodic RMQ Problem,,G,1493391900,[data structures],PROGRAMMING +775,VK Cup 2017 - Wild Card Round 2,12,University Schedule,,A,1493220900,[*special],PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Oleg and shares,500.0,A,1492965900,"[implementation, math]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Igor and his way to work,1000.0,B,1492965900,"[dfs and similar, shortest paths]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Mice problem,1500.0,C,1492965900,"[geometry, implementation, sortings]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Presents in Bankopolis,2000.0,D,1492965900,"[dp, graphs, shortest paths]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Problem of offices,2500.0,E,1492965900,"[constructive algorithms, dfs and similar, dp, trees]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Julia the snail,3000.0,F,1492965900,"[data structures, divide and conquer]",PROGRAMMING +793,Tinkoff Challenge - Elimination Round,12,Oleg and chess,3500.0,G,1492965900,"[flows, graph matchings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and palindrome,500.0,A,1492785300,"[brute force, constructive algorithms, strings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and strings,1000.0,B,1492785300,"[brute force, dp, strings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and gcd problem,1500.0,C,1492785300,"[dp, greedy, number theory]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and distribution,2000.0,D,1492785300,"[constructive algorithms, sortings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and code of a permutation,2500.0,E,1492785300,"[constructive algorithms, data structures, graphs, sortings]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Voltage Keepsake,500.0,A,1492356900,"[binary search, math]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING +772,VK Cup 2017 - Round 2,12,Vulnerable Kerbals,1750.0,C,1492356900,"[dp, graphs, number theory]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Varying Kibibits,2250.0,D,1492356900,"[bitmasks, dp]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Verifying Kingdom,2250.0,E,1492356900,"[binary search, trees]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Voltage Keepsake,500.0,A,1492356900,"[binary search, greedy]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Vulnerable Kerbals,1750.0,C,1492356900,[number theory],PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Varying Kibibits,2250.0,D,1492356900,"[combinatorics, dp]",PROGRAMMING +800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Verifying Kingdom,2250.0,E,1492356900,[],PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vicious Keyboard,500.0,A,1492356900,[brute force],PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Valued Keys,1000.0,B,1492356900,"[constructive algorithms, greedy, strings]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Voltage Keepsake,1500.0,C,1492356900,"[binary search, math]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Volatile Kite,2000.0,D,1492356900,"[brute force, geometry, greedy]",PROGRAMMING +801,"Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)",2,Vulnerable Kerbals,2750.0,E,1492356900,[],PROGRAMMING +797,Educational Codeforces Round 19,12,k-Factorization,,A,1492266900,"[implementation, math, number theory]",PROGRAMMING +797,Educational Codeforces Round 19,12,Odd sum,,B,1492266900,"[dp, greedy]",PROGRAMMING +797,Educational Codeforces Round 19,12,Minimal string,,C,1492266900,"[greedy, strings]",PROGRAMMING +797,Educational Codeforces Round 19,12,Broken BST,,D,1492266900,"[data structures, dfs and similar]",PROGRAMMING +797,Educational Codeforces Round 19,12,Array Queries,,E,1492266900,"[brute force, data structures, dp]",PROGRAMMING +797,Educational Codeforces Round 19,12,Mice and Holes,,F,1492266900,"[data structures, dp, greedy, sortings]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Buying A House,500.0,A,1491842100,"[brute force, implementation]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Find The Bone,750.0,B,1491842100,[implementation],PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Bank Hacking,1000.0,C,1491842100,"[constructive algorithms, data structures, dp, trees]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Police Stations,1500.0,D,1491842100,"[constructive algorithms, shortest paths, trees]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Exam Cheating,2000.0,E,1491842100,"[binary search, dp]",PROGRAMMING +796,Codeforces Round #408 (Div. 2),2,Sequence Recovery,2500.0,F,1491842100,"[bitmasks, data structures, greedy]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Amusement Park,,A,1491406500,"[*special, ternary search]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Significant Cups,,B,1491406500,"[*special, binary search, data structures, two pointers]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Lie or Truth,,D,1491406500,"[*special, constructive algorithms, sortings]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Big Number and Remainder,,E,1491406500,"[*special, math, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Pens And Days Of Week,,F,1491406500,"[*special, binary search, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Amusement Park,,A,1491406500,"[*special, brute force, ternary search]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Significant Cups,,B,1491406500,"[*special, binary search, sortings, two pointers]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Lie or Truth,,D,1491406500,"[*special, implementation, sortings]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Big Number and Remainder,,E,1491406500,"[*special, brute force, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Pens And Days Of Week,,F,1491406500,"[*special, brute force, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING +795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING +784,April Fools Contest 2017,12,Numbers Joke,,A,1490972400,[*special],PROGRAMMING +784,April Fools Contest 2017,12,Kids' Riddle,,B,1490972400,[*special],PROGRAMMING +784,April Fools Contest 2017,12,INTERCALC,,C,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Touchy-Feely Palindromes,,D,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Twisted Circuit,,E,1490972400,"[*special, brute force, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Crunching Numbers Just for You,,F,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,BF Calculator,,G,1490972400,[*special],PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Functions again,500.0,A,1490803500,"[dp, two pointers]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Weird journey,1250.0,B,1490803500,"[combinatorics, dfs and similar, dsu, graphs]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,The Great Mixing,1500.0,C,1490803500,"[dfs and similar, graphs, shortest paths]",PROGRAMMING 788,Codeforces Round #407 (Div. 1),1,Finding lines,2000.0,D,1490803500,"[constructive algorithms, divide and conquer]",PROGRAMMING -788,Codeforces Round #407 (Div. 1),1,New task,2250.0,E,1490803500,[],PROGRAMMING -789,Codeforces Round #407 (Div. 2),2,Anastasia and pebbles,500.0,A,1490803500,"[greedy, implementation, math]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,New task,2250.0,E,1490803500,[data structures],PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Anastasia and pebbles,500.0,A,1490803500,"[implementation, math]",PROGRAMMING 789,Codeforces Round #407 (Div. 2),2,Masha and geometric depression,1000.0,B,1490803500,"[brute force, implementation, math]",PROGRAMMING -789,Codeforces Round #407 (Div. 2),2,Functions again,1500.0,C,1490803500,"[data structures, dp, greedy]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Functions again,1500.0,C,1490803500,"[data structures, dp]",PROGRAMMING 789,Codeforces Round #407 (Div. 2),2,Weird journey,2250.0,D,1490803500,[graphs],PROGRAMMING -789,Codeforces Round #407 (Div. 2),2,The Great Mixing,2500.0,E,1490803500,"[brute force, dfs and similar, dp, math]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,The Great Mixing,2500.0,E,1490803500,"[brute force, dfs and similar, dp, graph matchings, math]",PROGRAMMING 792,Educational Codeforces Round 18,12,New Bus Route,,A,1490625300,"[implementation, sortings]",PROGRAMMING 792,Educational Codeforces Round 18,12,Counting-out Rhyme,,B,1490625300,[implementation],PROGRAMMING 792,Educational Codeforces Round 18,12,Divide by Three,,C,1490625300,"[dp, greedy, math, number theory]",PROGRAMMING @@ -3019,7 +11338,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 787,Codeforces Round #406 (Div. 2),2,Not Afraid,1000.0,B,1490281500,"[greedy, implementation]",PROGRAMMING 787,Codeforces Round #406 (Div. 2),2,Berzerk,1750.0,C,1490281500,"[dp, games]",PROGRAMMING 787,Codeforces Round #406 (Div. 2),2,Legacy,2000.0,D,1490281500,"[data structures, shortest paths]",PROGRAMMING -787,Codeforces Round #406 (Div. 2),2,Till I Collapse,2500.0,E,1490281500,[],PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Till I Collapse,2500.0,E,1490281500,"[data structures, trees]",PROGRAMMING 771,VK Cup 2017 - Round 1,12,Bear and Friendship Condition,250.0,A,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING 771,VK Cup 2017 - Round 1,12,Bear and Different Names,500.0,B,1489851300,"[constructive algorithms, greedy]",PROGRAMMING 771,VK Cup 2017 - Round 1,12,Bear and Tree Jumps,1000.0,C,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING @@ -3349,12 +11668,12 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 723,Codeforces Round #375 (Div. 2),2,Lakes in Berland,2000.0,D,1475494500,"[dfs and similar, dsu, greedy]",PROGRAMMING 723,Codeforces Round #375 (Div. 2),2,One-Way Reform,2500.0,E,1475494500,"[constructive algorithms, dfs and similar, flows, graphs, greedy]",PROGRAMMING 723,Codeforces Round #375 (Div. 2),2,st-Spanning Tree,3000.0,F,1475494500,"[dsu, graphs, greedy, implementation]",PROGRAMMING -722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Broken Clock,500.0,A,1475330700,"[brute force, implementation]",PROGRAMMING -722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Verse Pattern,500.0,B,1475330700,"[implementation, strings]",PROGRAMMING -722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Destroying Array,1000.0,C,1475330700,"[data structures, dsu]",PROGRAMMING -722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Generating Sets,1500.0,D,1475330700,"[binary search, data structures, dfs and similar, greedy]",PROGRAMMING -722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Research Rover,2000.0,E,1475330700,"[combinatorics, dp]",PROGRAMMING -722,"Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)",12,Cyclic Cipher,2500.0,F,1475330700,"[chinese remainder theorem, implementation, number theory, two pointers]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Broken Clock,500.0,A,1475330700,"[brute force, implementation]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Verse Pattern,500.0,B,1475330700,"[implementation, strings]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Destroying Array,1000.0,C,1475330700,"[data structures, dsu]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Generating Sets,1500.0,D,1475330700,"[binary search, data structures, dfs and similar, greedy]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Research Rover,2000.0,E,1475330700,"[combinatorics, dp]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Cyclic Cipher,2500.0,F,1475330700,"[chinese remainder theorem, implementation, number theory, two pointers]",PROGRAMMING 721,Codeforces Round #374 (Div. 2),2,One-dimensional Japanese Crossword,500.0,A,1475244300,[implementation],PROGRAMMING 721,Codeforces Round #374 (Div. 2),2,Passwords,1000.0,B,1475244300,"[sortings, strings]",PROGRAMMING 721,Codeforces Round #374 (Div. 2),2,Journey,1500.0,C,1475244300,"[dp, graphs]",PROGRAMMING @@ -3408,40 +11727,3970 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 712,Codeforces Round #370 (Div. 2),2,Memory and De-Evolution,1500.0,C,1473525900,"[greedy, math]",PROGRAMMING 712,Codeforces Round #370 (Div. 2),2,Memory and Scores,2250.0,D,1473525900,"[combinatorics, dp]",PROGRAMMING 712,Codeforces Round #370 (Div. 2),2,Memory and Casinos,2500.0,E,1473525900,"[data structures, math, probabilities]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Bus to Udayland,500.0,A,1472472300,"[brute force, implementation]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Chris and Magic Square,1000.0,B,1472472300,[constructive algorithms],PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Coloring Trees,1500.0,C,1472472300,[dp],PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Directed Roads,2000.0,D,1472472300,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,ZS and The Birthday Paradox,2500.0,E,1472472300,"[math, number theory, probabilities]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Letters Cyclic Shift,500.0,A,1472056500,"[constructive algorithms, implementation]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Recover the String,1000.0,B,1472056500,"[constructive algorithms, implementation, math]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Centroids,1500.0,C,1472056500,"[data structures, dfs and similar, dp, greedy, trees]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Incorrect Flow,2000.0,D,1472056500,[flows],PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Student's Camp,2500.0,E,1472056500,"[dp, math]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Juicer,500.0,A,1472056500,[implementation],PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Checkpoints,1000.0,B,1472056500,"[implementation, sortings]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Letters Cyclic Shift,1500.0,C,1472056500,[greedy],PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Recover the String,2000.0,D,1472056500,"[greedy, math]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Centroids,2500.0,E,1472056500,"[dp, trees]",PROGRAMMING +710,Educational Codeforces Round 16,12,King Moves,,A,1471875000,[implementation],PROGRAMMING +710,Educational Codeforces Round 16,12,Optimal Point on a Line,,B,1471875000,"[brute force, sortings]",PROGRAMMING +710,Educational Codeforces Round 16,12,Magic Odd Square,,C,1471875000,[constructive algorithms],PROGRAMMING +710,Educational Codeforces Round 16,12,Two Arithmetic Progressions,,D,1471875000,[math],PROGRAMMING +710,Educational Codeforces Round 16,12,Generate a String,,E,1471875000,"[dfs and similar, dp]",PROGRAMMING +710,Educational Codeforces Round 16,12,String Set Queries,,F,1471875000,"[brute force, data structures, hashing, string suffix structures, strings]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Brain's Photos,500.0,A,1471698300,[implementation],PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Bakery,1000.0,B,1471698300,[graphs],PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Pythagorean Triples,1500.0,C,1471698300,"[math, number theory]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Persistent Bookcase ,2000.0,D,1471698300,"[data structures, dfs and similar, implementation]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Garlands,2500.0,E,1471698300,[data structures],PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Beru-taxi,500.0,A,1470933300,"[brute force, geometry, implementation]",PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Interesting drink,1000.0,B,1470933300,"[binary search, implementation]",PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Hard problem,1500.0,C,1470933300,[dp],PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Vasiliy's Multiset,2000.0,D,1470933300,"[binary search, data structures, trees]",PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Working routine,2500.0,E,1470933300,"[data structures, implementation]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Thor,500.0,A,1470578700,"[brute force, data structures, implementation]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Ant Man,1250.0,B,1470578700,"[dp, graphs, greedy]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Black Widow,1250.0,C,1470578700,"[dp, implementation]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Captain America,2000.0,D,1470578700,[flows],PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Iron Man,2500.0,E,1470578700,"[geometry, trees]",PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Hulk,500.0,A,1470578700,[implementation],PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Spider Man,1000.0,B,1470578700,[games],PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Thor,1500.0,C,1470578700,"[data structures, implementation]",PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Ant Man,2250.0,D,1470578700,"[dp, graphs]",PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Black Widow,2250.0,E,1470578700,[],PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and Game,500.0,A,1470323700,[implementation],PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and trip,1000.0,B,1470323700,"[implementation, math]",PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Chris and Road,1750.0,C,1470323700,"[geometry, implementation]",PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and Interesting sum,2000.0,D,1470323700,[data structures],PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and Divisors,2250.0,E,1470323700,"[dp, number theory]",PROGRAMMING +702,Educational Codeforces Round 15,12,Maximum Increase,,A,1469804400,"[dp, greedy, implementation]",PROGRAMMING +702,Educational Codeforces Round 15,12,Powers of Two,,B,1469804400,"[brute force, data structures, implementation, math]",PROGRAMMING +702,Educational Codeforces Round 15,12,Cellular Network,,C,1469804400,"[binary search, two pointers]",PROGRAMMING +702,Educational Codeforces Round 15,12,Road to Post Office,,D,1469804400,[math],PROGRAMMING +702,Educational Codeforces Round 15,12,Analysis of Pathes in Functional Graph,,E,1469804400,"[data structures, graphs]",PROGRAMMING +702,Educational Codeforces Round 15,12,T-Shirts,,F,1469804400,[data structures],PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,As Fast As Possible,500.0,A,1469205300,"[binary search, math]",PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Connecting Universities,1000.0,B,1469205300,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Break Up,1500.0,C,1469205300,[dfs and similar],PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Huffman Coding on Segment,2250.0,D,1469205300,"[data structures, greedy]",PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Cool Slogans,3000.0,E,1469205300,"[string suffix structures, strings]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Cards,500.0,A,1469205300,"[greedy, implementation]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Cells Not Under Attack,750.0,B,1469205300,[math],PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,They Are Everywhere,1000.0,C,1469205300,"[binary search, two pointers]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,As Fast As Possible,1500.0,D,1469205300,"[binary search, math]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Connecting Universities,2000.0,E,1469205300,"[dfs and similar, graphs]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Break Up,2500.0,F,1469205300,[graphs],PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Vacations,500.0,A,1468933500,[dp],PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Fix a Tree,1000.0,B,1468933500,"[constructive algorithms, dfs and similar, dsu, trees]",PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,LRU,1500.0,C,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Limak and Shooting Points,2000.0,D,1468933500,"[brute force, geometry]",PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Cron,2500.0,E,1468933500,[],PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Coprime Permutation,3000.0,F,1468933500,"[combinatorics, number theory]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Launch of Collider,500.0,A,1468933500,[implementation],PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,One Bomb,1000.0,B,1468933500,[implementation],PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Vacations,1500.0,C,1468933500,"[brute force, dp]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Fix a Tree,2000.0,D,1468933500,"[constructive algorithms, dfs and similar, dsu]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,LRU,2500.0,E,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Limak and Shooting Points,3000.0,F,1468933500,[],PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,Lorenzo Von Matterhorn,500.0,A,1468514100,"[data structures, implementation, trees]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,Puzzles,1000.0,B,1468514100,"[dfs and similar, math, probabilities, trees]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,PLEASE,1500.0,C,1468514100,"[combinatorics, dp, implementation, math, matrices]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,Legen...,2000.0,D,1468514100,"[data structures, dp, matrices, strings]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,...Wait for it...,2500.0,E,1468514100,"[data structures, dsu, trees]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,...Dary!,3000.0,F,1468514100,"[binary search, geometry, two pointers]",PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Pineapple Incident,500.0,A,1468514100,[math],PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Barnicle,1000.0,B,1468514100,[implementation],PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Lorenzo Von Matterhorn,1500.0,C,1468514100,"[data structures, implementation, trees]",PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Puzzles,2000.0,D,1468514100,[],PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,PLEASE,2500.0,E,1468514100,"[math, number theory]",PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Legen...,3000.0,F,1468514100,[],PROGRAMMING +691,Educational Codeforces Round 14,12,Fashion in Berland,,A,1468425600,[implementation],PROGRAMMING +691,Educational Codeforces Round 14,12,s-palindrome,,B,1468425600,[implementation],PROGRAMMING +691,Educational Codeforces Round 14,12,Exponential notation,,C,1468425600,[implementation],PROGRAMMING +691,Educational Codeforces Round 14,12,Swaps in Permutation,,D,1468425600,"[dfs and similar, dsu]",PROGRAMMING +691,Educational Codeforces Round 14,12,Xor-sequences,,E,1468425600,[matrices],PROGRAMMING +691,Educational Codeforces Round 14,12,Couple Cover,,F,1468425600,"[brute force, dp, number theory]",PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (easy),,A1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (medium),,A2,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (hard),,A3,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (easy),,B1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (medium),,B2,1468137600,[geometry],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (hard),,B3,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (easy),,C1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (medium),,C2,1468137600,"[dfs and similar, graphs, trees]",PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (hard),,C3,1468137600,[trees],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (easy),,D1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (medium),,D2,1468137600,[combinatorics],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (hard),,D3,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (I),,E1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (II),,E2,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (easy),,F1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (medium),,F2,1468137600,"[constructive algorithms, hashing, trees]",PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (hard),,F3,1468137600,[trees],PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Cellphone,500.0,A,1467822900,"[brute force, constructive algorithms, implementation]",PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Shortcuts,1000.0,B,1467822900,[dfs and similar],PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Chocolate Thieves,1500.0,C,1467822900,"[binary search, math]",PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Friends and Subsequences,2000.0,D,1467822900,"[binary search, data structures]",PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Geometry Problem,2500.0,E,1467822900,"[combinatorics, data structures, implementation]",PROGRAMMING +695,VK Cup 2016 - Finals,12,LRU,1250.0,A,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Break Up,1250.0,B,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Limak and Shooting Points,1250.0,C,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Cron,1750.0,D,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Huffman Coding on Segment,2500.0,E,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Coprime Permutation,2500.0,F,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Cool Slogans,3000.0,G,1467534000,[],PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,NP-Hard Problem,500.0,A,1467219900,"[dfs and similar, graphs]",PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,Remainders Game,1000.0,B,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,The Values You Can Make,1500.0,C,1467219900,[dp],PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,Dividing Kingdom II,2000.0,D,1467219900,"[brute force, data structures, dsu, sortings]",PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,TOF,2500.0,E,1467219900,[],PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,Opponents,500.0,A,1467219900,[implementation],PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,Lovely Palindromes,1000.0,B,1467219900,"[constructive algorithms, math]",PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,NP-Hard Problem,1500.0,C,1467219900,"[dfs and similar, graphs]",PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,Remainders Game,2000.0,D,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,The Values You Can Make,2500.0,E,1467219900,[dp],PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Robbers' watch,500.0,A,1466699700,"[brute force, dp, math]",PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Kay and Snowflake,1250.0,B,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Optimal Point,1250.0,C,1466699700,"[binary search, math]",PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Kay and Eternity,2000.0,D,1466699700,[brute force],PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Travelling Through the Snow Queen's Kingdom,2500.0,E,1466699700,"[brute force, graphs]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Free Ice Cream,500.0,A,1466699700,"[constructive algorithms, implementation]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Little Robber Girl's Zoo,1000.0,B,1466699700,"[constructive algorithms, implementation, sortings]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Robbers' watch,1500.0,C,1466699700,"[brute force, math]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Kay and Snowflake,2250.0,D,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Optimal Point,2250.0,E,1466699700,[],PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Numbers,500.0,A,1466181300,"[constructive algorithms, number theory]",PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Mex,1000.0,B,1466181300,[sortings],PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and the Tree,1500.0,C,1466181300,"[dfs and similar, dp, trees]",PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Strings,2000.0,D,1466181300,"[dp, strings]",PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Triangles,3000.0,E,1466181300,"[geometry, two pointers]",PROGRAMMING +683,Surprise Language Round #8,12,The Check of the Point,,A,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,The Teacher of Physical Education,,B,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Symmetric Difference,,C,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Chocolate Bar,,D,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Hammer throwing,,E,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Reformat the String,,F,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,The Fraction,,G,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Exchange of Books,,H,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Loader,,I,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,The Hero with Bombs,,J,1466092800,[*special],PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,A Good Contest,500.0,A,1465922100,[implementation],PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Economy Game,1000.0,B,1465922100,[brute force],PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Heap Operations,1500.0,C,1465922100,"[data structures, greedy]",PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Gifts by the List,2000.0,D,1465922100,"[dfs and similar, trees]",PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Runaway to a Shadow,2500.0,E,1465922100,[geometry],PROGRAMMING +678,Educational Codeforces Round 13,12,Johny Likes Numbers,,A,1465834200,[implementation],PROGRAMMING +678,Educational Codeforces Round 13,12,The Same Calendar,,B,1465834200,[implementation],PROGRAMMING +678,Educational Codeforces Round 13,12,Joty and Chocolate,,C,1465834200,"[implementation, math, number theory]",PROGRAMMING +678,Educational Codeforces Round 13,12,Iterated Linear Function,,D,1465834200,"[math, number theory]",PROGRAMMING +678,Educational Codeforces Round 13,12,Another Sith Tournament,,E,1465834200,"[bitmasks, dp]",PROGRAMMING +678,Educational Codeforces Round 13,12,Lena and Queries,,F,1465834200,"[data structures, divide and conquer, geometry]",PROGRAMMING +684,Codeforces Marathon Round 1,12,Online Exam,,A2,1465722000,[*special],PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Prime 100,750.0,A,1465403700,[constructive algorithms],PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Tower of Cubes,1250.0,B,1465403700,"[dp, greedy]",PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Square Grid,1500.0,C,1465403700,"[dfs and similar, dsu, implementation]",PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Chase,2000.0,D,1465403700,"[brute force, dfs and similar, implementation]",PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Bad Powers of 42,2500.0,E,1465403700,[data structures],PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Five Cards,500.0,A,1465403700,"[constructive algorithms, implementation]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Finding Criminals,1000.0,B,1465403700,"[constructive algorithms, implementation]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Prime 100,1750.0,C,1465403700,"[constructive algorithms, number theory]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Tower of Cubes,2250.0,D,1465403700,"[brute force, constructive algorithms, greedy]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Square Grid,2750.0,E,1465403700,[],PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Fence,500.0,A,1464798900,[implementation],PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Food Processor,1000.0,B,1464798900,"[implementation, math]",PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Label,1500.0,C,1464798900,[implementation],PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Treasure,2250.0,D,1464798900,"[data structures, graphs]",PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Balloons,2250.0,E,1464798900,"[binary search, brute force, dp, implementation]",PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Nicholas and Permutation,500.0,A,1464188700,[implementation],PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Pyramid of Glasses,1000.0,B,1464188700,[implementation],PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Vasya and String,1500.0,C,1464188700,"[binary search, dp, two pointers]",PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Theseus and labyrinth,2250.0,D,1464188700,"[implementation, shortest paths]",PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,The Last Fight Between Human and AI,2250.0,E,1464188700,[math],PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Infinite Sequence,500.0,A,1463416500,[math],PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Restoring Painting,1000.0,B,1463416500,"[brute force, constructive algorithms, math]",PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Money Transfers,1500.0,C,1463416500,"[data structures, greedy, sortings]",PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Tree Construction,2000.0,D,1463416500,"[data structures, trees]",PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Trains and Statistic,2500.0,E,1463416500,"[data structures, dp, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Recycling Bottles,500.0,A,1462984500,"[dp, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Robin Hood,1000.0,B,1462984500,"[binary search, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Ultimate Weirdness of an Array,1500.0,C,1462984500,"[data structures, number theory]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Roads in Yusland,2000.0,D,1462984500,"[data structures, dp, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Organizing a Race,3000.0,E,1462984500,"[data structures, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Summer Camp,500.0,A,1462984500,[implementation],PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Different is Good,1000.0,B,1462984500,"[constructive algorithms, implementation, strings]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Recycling Bottles,1500.0,C,1462984500,"[brute force, geometry, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Robin Hood,2000.0,D,1462984500,"[binary search, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Ultimate Weirdness of an Array,2500.0,E,1462984500,[],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Colors,500.0,A,1462633500,[implementation],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Two Paths,1000.0,B,1462633500,[constructive algorithms],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Levels and Regions,1750.0,C,1462633500,[dp],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bears and Juice,3000.0,F,1462633500,[math],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Game,500.0,A,1462633500,[implementation],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Problems for Round,750.0,B,1462633500,"[greedy, implementation]",PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Colors,1000.0,C,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Two Paths,1500.0,D,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Levels and Regions,2250.0,E,1462633500,"[divide and conquer, dp]",PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bearish Fanpages,3000.0,F,1462633500,[],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Colors,500.0,A,1462633500,"[brute force, data structures, implementation]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Two Paths,1000.0,B,1462633500,"[constructive algorithms, graphs]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Levels and Regions,1750.0,C,1462633500,"[divide and conquer, dp]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bears and Juice,3000.0,F,1462633500,[combinatorics],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Holidays,500.0,A,1462464300,"[brute force, constructive algorithms]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Game of Robots,750.0,B,1462464300,[implementation],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Cinema,1000.0,C,1462464300,"[implementation, sortings]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Magic Powder - 1,1000.0,D1,1462464300,"[binary search, brute force]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Magic Powder - 2,500.0,D2,1462464300,[binary search],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Correct Bracket Sequence Editor,2000.0,E,1462464300,"[data structures, dsu]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Restore a Number,2500.0,F,1462464300,"[constructive algorithms, strings]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Reberland Linguistics,500.0,A,1461947700,"[dp, implementation, strings]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,World Tour,1000.0,B,1461947700,"[graphs, shortest paths]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Codeword,2000.0,C,1461947700,[combinatorics],PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Chain Reaction,2000.0,D,1461947700,[brute force],PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Forensic Examination,3000.0,E,1461947700,"[data structures, string suffix structures]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Pouring Rain,500.0,A,1461947700,"[geometry, math]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Coat of Anticubism,1000.0,B,1461947700,"[constructive algorithms, geometry]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Reberland Linguistics,1500.0,C,1461947700,"[dp, strings]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,World Tour,2000.0,D,1461947700,"[brute force, graphs, shortest paths]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Chain Reaction,3000.0,E,1461947700,[],PROGRAMMING +642,VK Cup 2016 - Wild Card Round 2,12,Scheduler for Invokers,,A,1461596400,[*special],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Grasshopper,500.0,A,1461515700,[implementation],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Matrix,750.0,B,1461515700,[implementation],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Dance,1000.0,C,1461515700,"[brute force, constructive algorithms, implementation]",PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Random Variable,1500.0,D,1461515700,"[dp, implementation, math, probabilities]",PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Time Machine,2000.0,E,1461515700,[data structures],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and 2-SAT,3000.0,F,1461515700,[],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Graph,3000.0,G,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Matrix,500.0,A,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Dance,1000.0,B,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Random Variable,1500.0,C,1461515700,[math],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Time Machine,2000.0,D,1461515700,[data structures],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and 2-SAT,3000.0,E,1461515700,[graphs],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Graph,3000.0,F,1461515700,[dp],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Presents,500.0,A,1461515700,[math],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Grasshopper,1000.0,B,1461515700,[],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Matrix,1500.0,C,1461515700,"[constructive algorithms, implementation]",PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Dance,2000.0,D,1461515700,"[data structures, implementation, math]",PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Time Machine,2500.0,E,1461515700,[data structures],PROGRAMMING +665,Educational Codeforces Round 12,12,Buses Between Cities,,A,1461164400,[implementation],PROGRAMMING +665,Educational Codeforces Round 12,12,Shopping,,B,1461164400,[brute force],PROGRAMMING +665,Educational Codeforces Round 12,12,Simple Strings,,C,1461164400,"[dp, greedy, strings]",PROGRAMMING +665,Educational Codeforces Round 12,12,Simple Subset,,D,1461164400,"[constructive algorithms, greedy]",PROGRAMMING +665,Educational Codeforces Round 12,12,Beautiful Subarrays,,E,1461164400,"[data structures, divide and conquer]",PROGRAMMING +665,Educational Codeforces Round 12,12,Four Divisors,,F,1461164400,"[dp, math, number theory]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Rebus,500.0,A,1460824500,"[constructive algorithms, expression parsing, greedy, math]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,International Olympiad,1000.0,B,1460824500,"[brute force, constructive algorithms, greedy, strings]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Graph Coloring,1500.0,C,1460824500,[dfs and similar],PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,To Hack or not to Hack,2500.0,D,1460824500,"[brute force, dp, greedy]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Binary Table,2500.0,E,1460824500,"[bitmasks, divide and conquer, dp]",PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Complicated GCD,500.0,A,1460824500,[math],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Rebus,1000.0,B,1460824500,[greedy],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,International Olympiad,1500.0,C,1460824500,[greedy],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Graph Coloring,2000.0,D,1460824500,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,To Hack or not to Hack,3000.0,E,1460824500,[],PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Gambling Nim,500.0,A,1460729700,"[bitmasks, math, matrices, probabilities]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Graph Coloring,250.0,B,1460729700,[dfs and similar],PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Binary Table,2250.0,C,1460729700,"[bitmasks, brute force, divide and conquer, dp, fft, math]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,International Olympiad,250.0,D,1460729700,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,To Hack or not to Hack,2250.0,E,1460729700,"[brute force, dp, greedy]",PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Seasons,,B,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Array Sum,,C,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Seasons,,B,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Array Sum,,C,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING +660,Educational Codeforces Round 11,12,Co-prime Array,,A,1460127600,"[greedy, implementation]",PROGRAMMING +660,Educational Codeforces Round 11,12,Seating On Bus,,B,1460127600,[implementation],PROGRAMMING +660,Educational Codeforces Round 11,12,Hard Process,,C,1460127600,"[binary search, dp, two pointers]",PROGRAMMING +660,Educational Codeforces Round 11,12,Number of Parallelograms,,D,1460127600,[geometry],PROGRAMMING +660,Educational Codeforces Round 11,12,Different Subsets For All Tuples,,E,1460127600,[combinatorics],PROGRAMMING +660,Educational Codeforces Round 11,12,Bear and Bowling 4,,F,1460127600,"[binary search, data structures, geometry, ternary search]",PROGRAMMING +656,April Fools Day Contest 2016,12,Da Vinci Powers,,A,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Scrambled,,B,1459526400,"[*special, implementation]",PROGRAMMING +656,April Fools Day Contest 2016,12,Without Text,,C,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Rosetta Problem,,D,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Out of Controls,,E,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Ace It!,,F,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,You're a Professional,,G,1459526400,[*special],PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Round House,500.0,A,1459353900,"[implementation, math]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Qualifying Contest,1000.0,B,1459353900,[sortings],PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Tanya and Toys,1000.0,C,1459353900,"[greedy, implementation]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Bicycle Race,1250.0,D,1459353900,"[geometry, implementation, math]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,New Reform,1500.0,E,1459353900,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Polycarp and Hay,2000.0,F,1459353900,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Fence Divercity,2500.0,G,1459353900,"[combinatorics, dp]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Displayed Friends,500.0,A,1459182900,[implementation],PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Forgotten Tree 3,750.0,B,1459182900,"[constructive algorithms, graphs, trees]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Polynomials,1000.0,C,1459182900,"[hashing, implementation, math]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Contribution,1500.0,D,1459182900,"[data structures, greedy, sortings]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Paradox,2000.0,E,1459182900,"[greedy, math, sortings]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Chemistry,3000.0,F,1459182900,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Forgotten Tree 3,500.0,A,1459182900,[graphs],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Polynomials,1000.0,B,1459182900,[math],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Contribution,1500.0,C,1459182900,[sortings],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Paradox,2000.0,D,1459182900,[sortings],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Chemistry,3000.0,E,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Reverse Radewoosh,500.0,A,1459182900,[implementation],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Displayed Friends,1000.0,B,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Forgotten Tree 3,1500.0,C,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Polynomials,2000.0,D,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Contribution,2500.0,E,1459182900,[],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Любимые числа Поликарпа,500.0,A,1458975600,[constructive algorithms],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Этажи,1000.0,B,1458975600,[constructive algorithms],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Печать условий,1500.0,C,1458975600,"[greedy, sortings]",PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Дефрагментация памяти,2000.0,D,1458975600,"[greedy, implementation]",PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Автобус,2500.0,E,1458975600,"[binary search, data structures, greedy, sortings]",PROGRAMMING +652,Educational Codeforces Round 10,12,Gabriel and Caterpillar,,A,1458910800,[implementation],PROGRAMMING +652,Educational Codeforces Round 10,12,z-sort,,B,1458910800,[sortings],PROGRAMMING +652,Educational Codeforces Round 10,12,Foe Pairs,,C,1458910800,[two pointers],PROGRAMMING +652,Educational Codeforces Round 10,12,Nested Segments,,D,1458910800,"[data structures, sortings]",PROGRAMMING +652,Educational Codeforces Round 10,12,Pursuit For Artifacts,,E,1458910800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +652,Educational Codeforces Round 10,12,Ants on a Circle,,F,1458910800,"[constructive algorithms, math]",PROGRAMMING +647,Технокубок 2016 - Ознакомительный Раунд 2,12,Оценки Васи,500.0,A,1458799200,[],PROGRAMMING +647,Технокубок 2016 - Ознакомительный Раунд 2,12,Звёздное небо,1000.0,B,1458799200,[],PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Наибольший подъем,500.0,A,1458745200,[constructive algorithms],PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собери стол,1000.0,B,1458745200,"[constructive algorithms, sortings]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Путь Робота,1500.0,C,1458745200,"[dfs and similar, graphs]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собачки и миски,2000.0,D,1458745200,"[greedy, sortings]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собери число,2500.0,E,1458745200,[],PROGRAMMING +646,Технокубок 2016 - Ознакомительный Раунд 1,12,Три брата,500.0,A,1458568800,[],PROGRAMMING +646,Технокубок 2016 - Ознакомительный Раунд 1,12,Ошибка передачи сообщения,1000.0,B,1458568800,[strings],PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Home Numbers,500.0,A,1458475200,[constructive algorithms],PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Making Genome in Berland,1000.0,B,1458475200,"[*special, dfs and similar, strings]",PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Road Improvement,1500.0,C,1458475200,"[dfs and similar, greedy, trees]",PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Three-dimensional Turtle Super Computer ,2000.0,D,1458475200,"[brute force, dfs and similar, graphs]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Three Balls,500.0,A,1458376500,"[brute force, implementation, sortings]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Compressing,1000.0,B,1458376500,"[brute force, dfs and similar, dp, strings]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Up-Down,1500.0,C,1458376500,"[brute force, implementation]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Delivery Bears,2000.0,D,1458376500,"[binary search, flows]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Forgotten Tree 2,2500.0,E,1458376500,"[dfs and similar, dsu, graphs]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Paper task,3500.0,F,1458376500,"[data structures, string suffix structures]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Move by Prime,3500.0,G,1458376500,[combinatorics],PROGRAMMING +645,CROC 2016 - Elimination Round,12,Amity Assessment,500.0,A,1458318900,"[brute force, constructive algorithms, implementation]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Mischievous Mess Makers,1000.0,B,1458318900,"[greedy, math]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, dp, graphs]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, math, number theory]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Armistice Area Apportionment,3500.0,G,1458318900,"[binary search, geometry]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Amity Assessment,500.0,A,1458318900,[],PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Mischievous Mess Makers,1000.0,B,1458318900,[],PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, graphs]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, number theory]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Armistice Area Apportionment,3500.0,G,1458318900,[geometry],PROGRAMMING +644,CROC 2016 - Qualification,12,Parliament of Berland,500.0,A,1458118800,[constructive algorithms],PROGRAMMING +644,CROC 2016 - Qualification,12,Processing Queries,1000.0,B,1458118800,"[data structures, two pointers]",PROGRAMMING +644,CROC 2016 - Qualification,12,Hostname Aliases,1500.0,C,1458118800,"[binary search, data structures, sortings, strings]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Voting for Photos,500.0,A,1457870400,[implementation],PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Chat Order,1000.0,B,1457870400,"[binary search, data structures, sortings]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Promocodes with Mistakes,1500.0,C,1457870400,"[brute force, constructive algorithms, implementation]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Running with Obstacles,2000.0,D,1457870400,"[data structures, dp, greedy]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Watchmen,500.0,A,1457342700,"[data structures, math]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Image Preview,1000.0,B,1457342700,"[binary search, dp, two pointers]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Table Compression,1500.0,C,1457342700,"[dfs and similar, dp, dsu, graphs, greedy]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Zip-line,2000.0,D,1457342700,"[binary search, data structures, dp]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Clockwork Bomb,2500.0,E,1457342700,"[data structures, dfs and similar, dsu, trees]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Joysticks,500.0,A,1457342700,"[dp, greedy]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Beautiful Paintings,1000.0,B,1457342700,"[greedy, sortings]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Watchmen,1500.0,C,1457342700,"[data structures, geometry, implementation, sortings]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Image Preview,2000.0,D,1457342700,"[binary search, dp, two pointers]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Table Compression,2500.0,E,1457342700,"[dsu, graphs, greedy]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Interview,500.0,A,1457022900,"[brute force, implementation]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Print Check,1000.0,B,1457022900,"[constructive algorithms, implementation]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Report,1500.0,C,1457022900,"[data structures, sortings]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Messenger,2000.0,D,1457022900,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Product Sum,2500.0,E,1457022900,"[data structures, dp, geometry]",PROGRAMMING +632,Educational Codeforces Round 9,12,Grandma Laura and Apples,,A,1456844400,[],PROGRAMMING +632,Educational Codeforces Round 9,12,"Alice, Bob, Two Teams",,B,1456844400,"[brute force, constructive algorithms]",PROGRAMMING +632,Educational Codeforces Round 9,12,The Smallest String Concatenation,,C,1456844400,"[sortings, strings]",PROGRAMMING +632,Educational Codeforces Round 9,12,Longest Subsequence,,D,1456844400,"[brute force, math, number theory]",PROGRAMMING +632,Educational Codeforces Round 9,12,Thief in a Shop,,E,1456844400,"[divide and conquer, dp, fft]",PROGRAMMING +632,Educational Codeforces Round 9,12,Magic Matrix,,F,1456844400,"[brute force, divide and conquer, graphs, trees]",PROGRAMMING +636,VeeRoute Marathon,12,Transfer,,A,1456765200,[*special],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,XOR Equation,500.0,A,1456683000,"[dp, math]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Factory Repairs,1000.0,B,1456683000,[data structures],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Package Delivery,1500.0,C,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Preorder Test,2000.0,D,1456683000,"[binary search, dp, trees]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Orchestra,2500.0,E,1456683000,[two pointers],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Island Puzzle,3000.0,F,1456683000,"[dfs and similar, graphs, trees]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Island Puzzle,500.0,A,1456683000,"[constructive algorithms, implementation]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,XOR Equation,1000.0,B,1456683000,"[constructive algorithms, dp, implementation]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Factory Repairs,1500.0,C,1456683000,[data structures],PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Package Delivery,2000.0,D,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Preorder Test,2500.0,E,1456683000,[],PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Orchestra,3000.0,F,1456683000,[two pointers],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Orchestra,500.0,A,1456683000,"[brute force, implementation]",PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Island Puzzle,1000.0,B,1456683000,[],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,XOR Equation,1500.0,C,1456683000,[dp],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Factory Repairs,2000.0,D,1456683000,[],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Package Delivery,2500.0,E,1456683000,"[data structures, greedy]",PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Preorder Test,3000.0,F,1456683000,[],PROGRAMMING +633,"Manthan, Codefest 16",12,Ebony and Ivory,250.0,A,1456506900,"[brute force, math, number theory]",PROGRAMMING +633,"Manthan, Codefest 16",12,A Trivial Problem,500.0,B,1456506900,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING +633,"Manthan, Codefest 16",12,Spy Syndrome 2,1500.0,C,1456506900,"[data structures, dp, hashing, implementation, sortings, string suffix structures, strings]",PROGRAMMING +633,"Manthan, Codefest 16",12,Fibonacci-ish,1750.0,D,1456506900,"[brute force, hashing, implementation, math]",PROGRAMMING +633,"Manthan, Codefest 16",12,Startup Funding,2500.0,E,1456506900,"[binary search, data structures, probabilities, two pointers]",PROGRAMMING +633,"Manthan, Codefest 16",12,The Chocolate Spree,2750.0,F,1456506900,"[dfs and similar, dp, trees]",PROGRAMMING +633,"Manthan, Codefest 16",12,Yash And Trees,3000.0,G,1456506900,"[bitmasks, data structures, dfs and similar]",PROGRAMMING +633,"Manthan, Codefest 16",12,Fibonacci-ish II,3000.0,H,1456506900,"[data structures, implementation]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Far Relative’s Birthday Cake,500.0,A,1455986100,"[brute force, constructive algorithms, implementation]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Far Relative’s Problem,1000.0,B,1455986100,[brute force],PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Famil Door and Brackets,1750.0,C,1455986100,"[dp, strings]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Babaei and Birthday Cake,2000.0,D,1455986100,"[data structures, dp]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Famil Door and Roads,2500.0,E,1455986100,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +628,Educational Codeforces Round 8,12,Tennis Tournament,,A,1455894000,[implementation],PROGRAMMING +628,Educational Codeforces Round 8,12,New Skateboard,,B,1455894000,[dp],PROGRAMMING +628,Educational Codeforces Round 8,12,Bear and String Distance,,C,1455894000,[greedy],PROGRAMMING +628,Educational Codeforces Round 8,12,Magic Numbers,,D,1455894000,[dp],PROGRAMMING +628,Educational Codeforces Round 8,12,Zbazi in Zeydabad,,E,1455894000,"[data structures, implementation]",PROGRAMMING +628,Educational Codeforces Round 8,12,Bear and Fair Set,,F,1455894000,[flows],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Again Twenty Five!,,A,1455807600,[number theory],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Moore's Law,,B,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Lucky Numbers,,C,1455807600,"[combinatorics, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Hexagons!,,D,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,A rectangle,,E,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Selection of Personnel,,F,1455807600,"[combinatorics, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Challenge Pennants,,G,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Benches,,H,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Parking Lot,,I,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Divisibility,,J,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Indivisibility,,K,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Cracking the Code,,L,1455807600,[implementation],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Turn,,M,1455807600,"[geometry, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Forecast,,N,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Arrow,,O,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Area of a Star,,P,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Pyramids,,Q,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Game,,R,1455807600,[games],PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Robot Sequence,500.0,A,1455384900,"[brute force, implementation]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Cards,750.0,B,1455384900,"[constructive algorithms, dp]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Block Towers,1000.0,C,1455384900,"[brute force, greedy]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Jerry's Protest,1500.0,D,1455384900,"[brute force, combinatorics, probabilities]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Simple Skewness,2000.0,E,1455384900,"[binary search, math, ternary search]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Group Projects,2500.0,F,1455384900,[dp],PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Raffles,3000.0,G,1455384900,"[data structures, greedy]",PROGRAMMING +622,Educational Codeforces Round 7,12,Infinite Sequence,,A,1455116400,"[implementation, math]",PROGRAMMING +622,Educational Codeforces Round 7,12,The Time,,B,1455116400,[implementation],PROGRAMMING +622,Educational Codeforces Round 7,12,Not Equal on a Segment,,C,1455116400,"[data structures, implementation]",PROGRAMMING +622,Educational Codeforces Round 7,12,Optimal Number Permutation,,D,1455116400,[constructive algorithms],PROGRAMMING +622,Educational Codeforces Round 7,12,Ants in Leaves,,E,1455116400,"[dfs and similar, greedy, trees]",PROGRAMMING +622,Educational Codeforces Round 7,12,The Sum of the k-th Powers,,F,1455116400,[math],PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Guest From the Past,750.0,A,1454835900,"[implementation, math]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,War of the Corporations,750.0,B,1454835900,"[constructive algorithms, strings]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,K-special Tables,1000.0,C,1454835900,"[constructive algorithms, implementation]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Finals in arithmetic,2000.0,D,1454835900,"[constructive algorithms, implementation]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Frog Fights,3000.0,E,1454835900,"[data structures, greedy]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Graph and String,500.0,A,1454605500,"[constructive algorithms, graphs]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Array GCD,1000.0,B,1454605500,"[dp, greedy, number theory]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Electric Charges,1750.0,C,1454605500,[binary search],PROGRAMMING +623,AIM Tech Round (Div. 1),1,Birthday,2000.0,D,1454605500,"[greedy, probabilities]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Transforming Sequence,2250.0,E,1454605500,"[combinatorics, dp, fft]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Save Luke,500.0,A,1454605500,[math],PROGRAMMING +624,AIM Tech Round (Div. 2),2,Making a String,1000.0,B,1454605500,"[greedy, sortings]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Graph and String,1500.0,C,1454605500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Array GCD,2000.0,D,1454605500,"[dp, greedy, number theory]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Electric Charges,3000.0,E,1454605500,[],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Odd and Even,500.0,A,1454249100,[implementation],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Bishops,1000.0,B,1454249100,[combinatorics],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Flowers,1500.0,C,1454249100,[probabilities],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Rat Kwesh and Cheese,2000.0,D,1454249100,"[brute force, math]",PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Blocks,2500.0,E,1454249100,"[dp, matrices]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Slime Combining,500.0,A,1454087400,[implementation],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Guess the Permutation,1000.0,B,1454087400,[constructive algorithms],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Constellation,1500.0,C,1454087400,"[geometry, implementation]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Hamiltonian Spanning Tree,1750.0,D,1454087400,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Robot Arm,2500.0,E,1454087400,[data structures],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Double Knapsack,2750.0,F,1454087400,"[constructive algorithms, two pointers]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Combining Slimes,3500.0,G,1454087400,"[dp, matrices, probabilities]",PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Elephant,500.0,A,1453563300,[math],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Chocolate,1000.0,B,1453563300,[combinatorics],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Watering Flowers,1250.0,C,1453563300,[implementation],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Polyline,1750.0,D,1453563300,[constructive algorithms],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,XOR and Favorite Number,2750.0,E,1453563300,[data structures],PROGRAMMING +620,Educational Codeforces Round 6,12,Professor GukiZ's Robot,,A,1453388400,"[implementation, math]",PROGRAMMING +620,Educational Codeforces Round 6,12,Grandfather Dovlet’s calculator,,B,1453388400,[implementation],PROGRAMMING +620,Educational Codeforces Round 6,12,Pearls in a Row,,C,1453388400,[greedy],PROGRAMMING +620,Educational Codeforces Round 6,12,Professor GukiZ and Two Arrays,,D,1453388400,"[binary search, two pointers]",PROGRAMMING +620,Educational Codeforces Round 6,12,New Year Tree,,E,1453388400,"[bitmasks, data structures]",PROGRAMMING +620,Educational Codeforces Round 6,12,Xors on Segments,,F,1453388400,[data structures],PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Peter and Snow Blower,750.0,A,1452789300,"[binary search, geometry, ternary search]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Skills,1250.0,B,1452789300,"[binary search, brute force, two pointers]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Necklace,1250.0,C,1452789300,[constructive algorithms],PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Kingdom and its Cities,2000.0,D,1452789300,"[dfs and similar, divide and conquer, graphs, sortings, trees]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Puzzle Lover,2500.0,E,1452789300,"[dp, hashing, strings]",PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Link/Cut Tree,500.0,A,1452789300,[brute force],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Gena's Code,1000.0,B,1452789300,[implementation],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Peter and Snow Blower,1750.0,C,1452789300,[],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Skills,2250.0,D,1452789300,[],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Necklace,2250.0,E,1452789300,[],PROGRAMMING +616,Educational Codeforces Round 5,12,Comparing Two Long Integers,,A,1452524400,"[implementation, strings]",PROGRAMMING +616,Educational Codeforces Round 5,12,Dinner with Emma,,B,1452524400,"[games, greedy]",PROGRAMMING +616,Educational Codeforces Round 5,12,The Labyrinth,,C,1452524400,[dfs and similar],PROGRAMMING +616,Educational Codeforces Round 5,12,Longest k-Good Segment,,D,1452524400,"[binary search, data structures, two pointers]",PROGRAMMING +616,Educational Codeforces Round 5,12,Sum of Remainders,,E,1452524400,"[implementation, math, number theory]",PROGRAMMING +616,Educational Codeforces Round 5,12,Expensive Strings,,F,1452524400,"[string suffix structures, strings]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Bulbs,500.0,A,1452261900,[implementation],PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Longtail Hedgehog,1250.0,B,1452261900,"[dp, graphs]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Running Track,1750.0,C,1452261900,"[dp, greedy, strings, trees]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Multipliers,2000.0,D,1452261900,"[math, number theory]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Hexagons,2500.0,E,1452261900,"[binary search, implementation, math]",PROGRAMMING +611,Good Bye 2015,12,New Year and Days,500.0,A,1451487900,[implementation],PROGRAMMING +611,Good Bye 2015,12,New Year and Old Property,750.0,B,1451487900,"[brute force, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Domino,1250.0,C,1451487900,"[dp, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Ancient Prophecy,1750.0,D,1451487900,"[hashing, strings]",PROGRAMMING +611,Good Bye 2015,12,New Year and Three Musketeers,2500.0,E,1451487900,"[data structures, greedy]",PROGRAMMING +611,Good Bye 2015,12,New Year and Cleaning,2500.0,F,1451487900,"[binary search, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Cake,3000.0,G,1451487900,"[geometry, two pointers]",PROGRAMMING +611,Good Bye 2015,12,New Year and Forgotten Tree,3500.0,H,1451487900,"[constructive algorithms, flows]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Pasha and Stick,500.0,A,1451215200,"[combinatorics, math]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Vika and Squares,1000.0,B,1451215200,[implementation],PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Harmony Analysis,1500.0,C,1451215200,[constructive algorithms],PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Vika and Segments,2500.0,D,1451215200,"[data structures, geometry, two pointers]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Alphabet Permutations,2500.0,E,1451215200,"[data structures, strings]",PROGRAMMING +612,Educational Codeforces Round 4,12,The Text Splitting,,A,1451055600,"[brute force, implementation, strings]",PROGRAMMING +612,Educational Codeforces Round 4,12,HDD is Outdated Technology,,B,1451055600,[implementation],PROGRAMMING +612,Educational Codeforces Round 4,12,Replace To Make Regular Bracket Sequence,,C,1451055600,"[data structures, expression parsing, math]",PROGRAMMING +612,Educational Codeforces Round 4,12,The Union of k-Segments,,D,1451055600,[sortings],PROGRAMMING +612,Educational Codeforces Round 4,12,Square Root of Permutation,,E,1451055600,"[combinatorics, constructive algorithms, dfs and similar, graphs]",PROGRAMMING +612,Educational Codeforces Round 4,12,Simba on the Circle,,F,1451055600,[dp],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Chain Reaction,500.0,A,1450888500,"[binary search, dp]",PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Zuma,1250.0,B,1450888500,[dp],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Marbles,1500.0,C,1450888500,"[hashing, strings]",PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Power Tree,2000.0,D,1450888500,[data structures],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Cross Sum,3000.0,E,1450888500,"[binary search, geometry]",PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Saitama Destroys Hotel,500.0,A,1450888500,"[implementation, math]",PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Hamming Distance Sum,1000.0,B,1450888500,[combinatorics],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Chain Reaction,1500.0,C,1450888500,[dp],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Zuma,2250.0,D,1450888500,[],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Marbles,2500.0,E,1450888500,[],PROGRAMMING +609,Educational Codeforces Round 3,12,USB Flash Drives,,A,1450537200,"[greedy, implementation, sortings]",PROGRAMMING +609,Educational Codeforces Round 3,12,The Best Gift,,B,1450537200,[implementation],PROGRAMMING +609,Educational Codeforces Round 3,12,Load Balancing,,C,1450537200,[implementation],PROGRAMMING +609,Educational Codeforces Round 3,12,Gadgets for dollars and pounds,,D,1450537200,"[binary search, two pointers]",PROGRAMMING +609,Educational Codeforces Round 3,12,Minimum spanning tree for each edge,,E,1450537200,"[data structures, dfs and similar, dsu, graphs, trees]",PROGRAMMING +609,Educational Codeforces Round 3,12,Frogs and mosquitoes,,F,1450537200,[data structures],PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Sorting Railway Cars,500.0,A,1449677100,"[constructive algorithms, greedy]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Lazy Student,1000.0,B,1449677100,"[constructive algorithms, data structures, graphs]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Freelancer's Dreams,1500.0,C,1449677100,[geometry],PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Board Game,2000.0,D,1449677100,"[data structures, dfs and similar]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Intergalaxy Trips,2500.0,E,1449677100,"[probabilities, shortest paths]",PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Magic Spheres,500.0,A,1449677100,[implementation],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Testing Robots,1000.0,B,1449677100,[implementation],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Sorting Railway Cars,1500.0,C,1449677100,[],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Lazy Student,2000.0,D,1449677100,[graphs],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Freelancer's Dreams,2500.0,E,1449677100,[],PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Alternative Thinking,500.0,A,1448984100,"[dp, greedy]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Moodular Arithmetic,1000.0,B,1448984100,"[dfs and similar, dsu, math, number theory]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Lieges of Legendre,1500.0,C,1448984100,[games],PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Ruminations on Ruminants,2000.0,D,1448984100,"[geometry, math]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Pastoral Oddities,3000.0,E,1448984100,"[data structures, divide and conquer, dsu, trees]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Uncowed Forces,500.0,A,1448984100,[implementation],PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,More Cowbell,1000.0,B,1448984100,"[binary search, greedy]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Alternative Thinking,1500.0,C,1448984100,"[constructive algorithms, dp, math]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Moodular Arithmetic,2000.0,D,1448984100,[dsu],PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Lieges of Legendre,2500.0,E,1448984100,[],PROGRAMMING +600,Educational Codeforces Round 2,12,Extract Numbers,,A,1448636400,[implementation],PROGRAMMING +600,Educational Codeforces Round 2,12,Queries about less or equal elements,,B,1448636400,"[binary search, sortings, two pointers]",PROGRAMMING +600,Educational Codeforces Round 2,12,Make Palindrome,,C,1448636400,[greedy],PROGRAMMING +600,Educational Codeforces Round 2,12,Area of Two Circles' Intersection,,D,1448636400,[geometry],PROGRAMMING +600,Educational Codeforces Round 2,12,Lomsat gelral,,E,1448636400,"[dfs and similar, dsu, trees]",PROGRAMMING +600,Educational Codeforces Round 2,12,Edge coloring of bipartite graph,,F,1448636400,[graphs],PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,The Two Routes,500.0,A,1448382900,"[graphs, shortest paths]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Lipshitz Sequence,1250.0,B,1448382900,[data structures],PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Kleofáš and the n-thlon,1250.0,C,1448382900,"[dp, probabilities]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Acyclic Organic Compounds,2000.0,D,1448382900,"[data structures, dfs and similar, dsu, hashing, trees]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,A Museum Robbery,2500.0,E,1448382900,"[data structures, dp]",PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Two Bases,500.0,A,1448382900,[implementation],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Approximating a Constant Range,1000.0,B,1448382900,"[dp, two pointers]",PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,The Two Routes,1500.0,C,1448382900,[],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Lipshitz Sequence,2250.0,D,1448382900,[],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Kleofáš and the n-thlon,2250.0,E,1448382900,[probabilities],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Patrick and Shopping,500.0,A,1448037300,[implementation],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Spongebob and Joke,1000.0,B,1448037300,[implementation],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Day at the Beach,1500.0,C,1448037300,[sortings],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Spongebob and Squares,2000.0,D,1448037300,"[brute force, math]",PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Sandy and Nuts,3000.0,E,1448037300,"[bitmasks, dp]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Swimming Pool,500.0,A,1447605300,[implementation],PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Array,1000.0,B,1447605300,[greedy],PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Points,1500.0,C,1447605300,"[greedy, sortings]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Trees,2250.0,D,1447605300,"[dp, probabilities, sortings]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Strings,2500.0,E,1447605300,"[dfs and similar, dp, graphs]",PROGRAMMING +598,Educational Codeforces Round 1,12,Tricky Sum,,A,1447426800,[math],PROGRAMMING +598,Educational Codeforces Round 1,12,Queries on a String,,B,1447426800,"[implementation, strings]",PROGRAMMING +598,Educational Codeforces Round 1,12,Nearest vectors,,C,1447426800,"[geometry, sortings]",PROGRAMMING +598,Educational Codeforces Round 1,12,Igor In the Museum,,D,1447426800,[dfs and similar],PROGRAMMING +598,Educational Codeforces Round 1,12,Chocolate Bar,,E,1447426800,"[brute force, dp]",PROGRAMMING +598,Educational Codeforces Round 1,12,Cut Length,,F,1447426800,[geometry],PROGRAMMING +597,Testing Round #12,12,Divisibility,500.0,A,1447264800,[math],PROGRAMMING +597,Testing Round #12,12,Restaurant,1000.0,B,1447264800,"[dp, greedy, sortings]",PROGRAMMING +597,Testing Round #12,12,Subsequences,1500.0,C,1447264800,"[data structures, dp]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Warrior and Archer,500.0,A,1447000200,[games],PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Max and Bike,1000.0,B,1447000200,"[binary search, geometry]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Edo and Magnets,1500.0,C,1447000200,"[brute force, two pointers]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,REQ,2000.0,D,1447000200,"[data structures, number theory]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Cutting the Line,3000.0,E,1447000200,"[string suffix structures, strings]",PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Vitaly and Night,500.0,A,1447000200,[implementation],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Pasha and Phone,1000.0,B,1447000200,"[binary search, math]",PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Warrior and Archer,1500.0,C,1447000200,[games],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Max and Bike,2000.0,D,1447000200,[],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Edo and Magnets,2500.0,E,1447000200,[],PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,2Char,250.0,A,1446655500,[brute force],PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Anton and Lines,1000.0,B,1446655500,"[geometry, sortings]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Beautiful Function,3000.0,C,1446655500,"[constructive algorithms, math]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Happy Tree Party,3000.0,D,1446655500,"[data structures, trees]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Strange Calculation and Cats,3000.0,E,1446655500,"[dp, matrices]",PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,PawnChess,500.0,A,1446309000,[implementation],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,The Monster and the Squirrel,1000.0,B,1446309000,[math],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,The Big Race,1500.0,C,1446309000,[math],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,Super M,2000.0,D,1446309000,"[dfs and similar, dp, trees]",PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,BCPC,3000.0,E,1446309000,"[binary search, geometry, two pointers]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Median Smoothing,750.0,A,1445763600,[],PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Chip 'n Dale Rescue Rangers,1000.0,B,1445763600,"[binary search, geometry, math]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Three States,1250.0,C,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Top Secret Task,1750.0,D,1445763600,[dp],PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Birthday,2500.0,E,1445763600,"[graph matchings, strings]",PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Wizards' Duel,500.0,A,1445763600,[math],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Rebranding,1000.0,B,1445763600,[implementation],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Median Smoothing,1750.0,C,1445763600,[constructive algorithms],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Chip 'n Dale Rescue Rangers,2000.0,D,1445763600,[],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Three States,2250.0,E,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Email Aliases,,A,1445068800,[implementation],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Layer Cake,,B,1445068800,[sortings],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Polycarp's Masterpiece,,C,1445068800,"[data structures, divide and conquer, dp]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Boulevard,,D,1445068800,"[brute force, implementation]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Training with Doors,,E,1445068800,[],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Gourmet and Banquet,,F,1445068800,"[binary search, flows, greedy]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Hiring,,G,1445068800,"[binary search, data structures]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Tourist Guide,,H,1445068800,[dfs and similar],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lottery,,I,1445068800,[implementation],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Cleaner Robot,,J,1445068800,"[dfs and similar, implementation]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Task processing,,K,1445068800,"[brute force, math]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Agricultural Archaeology,,L,1445068800,"[greedy, math]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Taxi in Berland,,M,1445068800,[shortest paths],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff and Weight Lifting,500.0,A,1444926600,[greedy],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in Beach,1000.0,B,1444926600,[dp],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in the Army,1500.0,C,1444926600,"[data structures, trees]",PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in Mafia,2000.0,D,1444926600,"[2-sat, binary search]",PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff as a Queen,2750.0,E,1444926600,[data structures],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff is Mad,2750.0,F,1444926600,"[data structures, strings]",PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff and Meat,750.0,A,1444926600,[greedy],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Love,1000.0,B,1444926600,[math],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff and Weight Lifting,1500.0,C,1444926600,[],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Beach,2000.0,D,1444926600,[],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in the Army,2500.0,E,1444926600,"[data structures, dfs and similar, trees]",PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Mafia,3000.0,F,1444926600,[],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Gennady the Dentist,500.0,A,1444641000,"[brute force, implementation]",PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Phillip and Trains,750.0,B,1444641000,[dfs and similar],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,"Alice, Bob, Oranges and Apples",1250.0,C,1444641000,[number theory],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Lizard Era: Beginning,1750.0,D,1444641000,[meet-in-the-middle],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Present for Vitalik the Philatelist ,2250.0,E,1444641000,"[combinatorics, math, number theory]",PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Digits of Number Pi,3000.0,F,1444641000,"[dp, implementation, strings]",PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Alena's Schedule,500.0,A,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Laurenty and Shop,1000.0,B,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Gennady the Dentist,1500.0,C,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Phillip and Trains,1750.0,D,1444641000,[dp],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,"Alice, Bob, Oranges and Apples",2250.0,E,1444641000,[number theory],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Lizard Era: Beginning,2750.0,F,1444641000,[meet-in-the-middle],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Olesya and Rodion,500.0,A,1444149000,[math],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Kolya and Tanya ,1000.0,B,1444149000,[combinatorics],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Marina and Vasya,1500.0,C,1444149000,"[constructive algorithms, greedy]",PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Dima and Lisa,2000.0,D,1444149000,[number theory],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Anton and Ira,2500.0,E,1444149000,"[constructive algorithms, greedy]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,GCD Table,750.0,A,1443890700,"[constructive algorithms, greedy]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Once Again...,1250.0,B,1443890700,"[dp, matrices]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Superior Periodic Subarrays,1500.0,C,1443890700,[number theory],PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Number of Binominal Coefficients,2250.0,D,1443890700,"[dp, number theory]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Boolean Function,2500.0,E,1443890700,"[bitmasks, dp, expression parsing]",PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Asphalting Roads,500.0,A,1443890700,[implementation],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Robot's Task,1000.0,B,1443890700,[implementation],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,GCD Table,1750.0,C,1443890700,[],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Once Again...,2250.0,D,1443890700,[],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Superior Periodic Subarrays,2500.0,E,1443890700,[number theory],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Vasya the Hipster,500.0,A,1443430800,[implementation],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Luxurious Houses,1000.0,B,1443430800,[implementation],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Developing Skills,1500.0,C,1443430800,"[implementation, sortings]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Three Logos,2000.0,D,1443430800,"[bitmasks, brute force, constructive algorithms, implementation, math]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Kojiro and Furrari,3000.0,E,1443430800,"[dp, greedy]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Zublicanes and Mumocrates,3000.0,F,1443430800,"[dp, trees, two pointers]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and First Steps,750.0,A,1442939400,"[brute force, dp, implementation]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Company,1250.0,B,1442939400,"[binary search, sortings, two pointers]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Park,1500.0,C,1442939400,"[dfs and similar, trees]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Dishes,2000.0,D,1442939400,"[bitmasks, dp]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Watch,2500.0,E,1442939400,"[data structures, hashing, strings]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,A Problem about Polyline,250.0,A,1442416500,"[geometry, math]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,"""Or"" Game",500.0,B,1442416500,"[brute force, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Weakness and Poorness,750.0,C,1442416500,[ternary search],PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,LCS Again,2500.0,D,1442416500,"[dp, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Walking!,2750.0,E,1442416500,"[constructive algorithms, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Mirror Box,3000.0,F,1442416500,"[matrices, trees]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Raising Bacteria,250.0,A,1442416500,[bitmasks],PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Finding Team Member,500.0,B,1442416500,"[brute force, implementation, sortings]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,A Problem about Polyline,1250.0,C,1442416500,"[binary search, math]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,"""Or"" Game",2000.0,D,1442416500,"[brute force, greedy, math]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Weakness and Poorness,3000.0,E,1442416500,[ternary search],PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,LCS Again,3000.0,F,1442416500,[],PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Vasya and Petya's Game,500.0,A,1441902600,"[math, number theory]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Invariance of Tree,1250.0,B,1441902600,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Points on Plane,1250.0,C,1441902600,"[constructive algorithms, divide and conquer, geometry, greedy, sortings]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Flights for Regular Customers,2000.0,D,1441902600,"[dp, matrices]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Painting Edges,2750.0,E,1441902600,"[binary search, data structures]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Multiplication Table,500.0,A,1441902600,"[implementation, number theory]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Modulo Sum,1250.0,B,1441902600,"[combinatorics, data structures, dp, two pointers]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Vasya and Petya's Game,1500.0,C,1441902600,"[implementation, number theory]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Invariance of Tree,2250.0,D,1441902600,[],PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Points on Plane,2250.0,E,1441902600,[constructive algorithms],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Fibonotci,,A,1441526400,"[math, matrices]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bribes,,B,1441526400,"[dfs and similar, trees]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Party,,C,1441526400,"[bitmasks, brute force, graph matchings]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Tablecity,,D,1441526400,[constructive algorithms],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Spectator Riots,,E,1441526400,[geometry],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bulbo,,F,1441526400,"[dp, greedy]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Run for beer,,G,1441526400,"[dfs and similar, shortest paths]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bots,,H,1441526400,"[combinatorics, number theory]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Robots protection,,I,1441526400,[data structures],PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Poker,500.0,A,1440865800,"[implementation, number theory]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Blocks,1000.0,B,1440865800,"[binary search, data structures, dp]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Drawing,1750.0,C,1440865800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Cavalry,2000.0,D,1440865800,"[data structures, divide and conquer, dp]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Bowling,2500.0,E,1440865800,[greedy],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Elections,500.0,A,1440865800,[implementation],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Three Musketeers,1000.0,B,1440865800,"[brute force, dfs and similar, graphs, hashing]",PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Poker,1500.0,C,1440865800,[number theory],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Blocks,2000.0,D,1440865800,"[data structures, dp, shortest paths]",PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Drawing,2750.0,E,1440865800,[],PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Lengthening Sticks,750.0,A,1440261000,"[combinatorics, implementation, math]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Minimization,1250.0,B,1440261000,"[dp, greedy, sortings]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,CNF 2,1500.0,C,1440261000,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Campus,2000.0,D,1440261000,"[binary search, data structures, dsu, trees]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Geometric Progressions,2750.0,E,1440261000,[math],PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Arrays,500.0,A,1440261000,[sortings],PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Order Book,1000.0,B,1440261000,"[data structures, greedy, implementation, sortings]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Lengthening Sticks,1750.0,C,1440261000,"[brute force, combinatorics, dp, math]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Minimization,2250.0,D,1440261000,"[dp, sortings]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,CNF 2,2500.0,E,1440261000,[],PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Elections,500.0,A,1439483400,[implementation],PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Simple Game,1000.0,B,1439483400,"[constructive algorithms, games, greedy, implementation, math]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Replacement,1500.0,C,1439483400,"[constructive algorithms, data structures, implementation]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Tree Requests,2000.0,D,1439483400,"[binary search, constructive algorithms, dfs and similar, trees]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Pig and Palindromes,2500.0,E,1439483400,"[combinatorics, dp]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Primes or Palindromes?,500.0,A,1439224200,"[brute force, implementation, math, number theory]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Symmetric and Transitive,1000.0,B,1439224200,"[combinatorics, dp, math]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,New Language,1500.0,C,1439224200,"[2-sat, greedy]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Sign Posts,2250.0,D,1439224200,"[brute force, math]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Longest Increasing Subsequence,2500.0,E,1439224200,"[data structures, dp]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Music,500.0,A,1439224200,"[implementation, math]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Inventory,1000.0,B,1439224200,[greedy],PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Primes or Palindromes?,1500.0,C,1439224200,"[binary search, brute force, number theory]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Symmetric and Transitive,2250.0,D,1439224200,"[brute force, dp, math]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,New Language,2750.0,E,1439224200,[],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Lineland Mail,500.0,A,1438790400,[implementation],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Berland National Library,1000.0,B,1438790400,[implementation],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Geometric Progression,1500.0,C,1438790400,"[binary search, data structures, dp]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,One-Dimensional Battle Ships,2000.0,D,1438790400,"[binary search, data structures, sortings]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,President and Roads,2500.0,E,1438790400,"[dfs and similar, graphs, hashing, shortest paths]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Mausoleum,2500.0,F,1438790400,[dp],PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Matching Names,1750.0,A,1438273200,"[dfs and similar, strings, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Replicating Processes,2500.0,B,1438273200,"[constructive algorithms, greedy]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Logistical Questions,3000.0,C,1438273200,"[dfs and similar, divide and conquer, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Restructuring Company,1000.0,D,1438273200,"[data structures, dsu]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Restoring Map,3000.0,E,1438273200,"[bitmasks, constructive algorithms, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Clique in the Divisibility Graph,500.0,F,1438273200,"[dp, math, number theory]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Max and Min,2500.0,G,1438273200,[geometry],PROGRAMMING +562,VK Cup 2015 - Finals,12,Logistical Questions,1500.0,A,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Clique in the Divisibility Graph,250.0,B,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Restoring Map,2250.0,C,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Restructuring Company,250.0,D,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Max and Min,500.0,E,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Matching Names,250.0,F,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Replicating Processes,500.0,G,1437898500,[],PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald's Hexagon,500.0,A,1437573600,"[brute force, geometry, math]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Equivalent Strings,1000.0,B,1437573600,"[divide and conquer, hashing, sortings, strings]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald and Giant Chess,1500.0,C,1437573600,"[combinatorics, dp, math, number theory]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Randomizer,2250.0,D,1437573600,"[combinatorics, geometry, probabilities]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald and Path,2250.0,E,1437573600,"[dp, sortings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Currency System in Geraldion,500.0,A,1437573600,"[geometry, implementation, sortings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald is into Art,1000.0,B,1437573600,"[constructive algorithms, implementation]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald's Hexagon,1500.0,C,1437573600,[geometry],PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Equivalent Strings,2000.0,D,1437573600,"[hashing, implementation, strings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald and Giant Chess,2500.0,E,1437573600,"[combinatorics, dp]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Lala Land and Apple Trees,500.0,A,1436886600,"[brute force, implementation, sortings]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Amr and The Large Array,1000.0,B,1436886600,[implementation],PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Amr and Chemistry,1500.0,C,1436886600,"[brute force, greedy]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Guess Your Way Out! II,2250.0,D,1436886600,"[data structures, implementation, sortings]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,A Simple Task,2500.0,E,1436886600,"[data structures, sortings, strings]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Ilya and Diplomas,500.0,A,1435676400,"[greedy, implementation]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Pasha and Tea,1000.0,B,1435676400,"[implementation, sortings]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Arthur and Table,1500.0,C,1435676400,"[brute force, data structures, dp, greedy]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Vitaly and Cycle,2000.0,D,1435676400,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Ann and Half-Palindrome,2500.0,E,1435676400,"[data structures, dp, string suffix structures, strings, trees]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Matryoshkas,250.0,A,1435414200,[implementation],PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Fugitive,750.0,B,1435414200,"[data structures, greedy, sortings]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Chocolate,1250.0,C,1435414200,[data structures],PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of a Top Secret,2000.0,D,1435414200,"[binary search, implementation, math]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Computer Network,3000.0,E,1435414200,"[dfs and similar, graphs, trees]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of the Zeros and Ones,250.0,A,1435414200,[greedy],PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Fake Numbers,250.0,B,1435414200,"[brute force, implementation]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Matryoshkas,1000.0,C,1435414200,[implementation],PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Fugitive,3000.0,D,1435414200,"[binary search, data structures, greedy]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Chocolate,3000.0,E,1435414200,"[binary search, data structures]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Colored Balls,250.0,A,1435163400,"[combinatorics, dp, math]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Permutation,500.0,B,1435163400,"[binary search, combinatorics, constructive algorithms, implementation, math]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Love Triangles,1000.0,C,1435163400,"[dfs and similar, dsu, graphs]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Nudist Beach,1500.0,D,1435163400,"[binary search, graphs, greedy]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Train,3000.0,E,1435163400,"[dp, fft, probabilities]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Photobooks,250.0,A,1435163400,"[brute force, math]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Ohana Cleans Up,500.0,B,1435163400,"[brute force, strings]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Colored Balls,1500.0,C,1435163400,"[combinatorics, dp, math]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Permutation,3000.0,D,1435163400,[math],PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Love Triangles,3000.0,E,1435163400,"[dfs and similar, dsu]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Table,500.0,A,1434645000,"[implementation, math]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Books,1000.0,B,1434645000,"[implementation, math]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Scales,1500.0,C,1434645000,"[brute force, dp, greedy, math, meet-in-the-middle]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Triangles,2000.0,D,1434645000,"[brute force, combinatorics, data structures, geometry, math, sortings]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Brackets,2500.0,E,1434645000,"[brute force, dp, expression parsing, greedy, implementation]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and Contest,500.0,A,1434127500,"[implementation, sortings]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,ZgukistringZ,1250.0,B,1434127500,"[brute force, constructive algorithms, implementation, strings]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ hates Boxes,1750.0,C,1434127500,"[binary search, greedy]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and Binary Operations,2000.0,D,1434127500,"[combinatorics, math, matrices, number theory]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and GukiZiana,2500.0,E,1434127500,"[binary search, data structures]",PROGRAMMING +549,Looksery Cup 2015,12,Face Detection,250.0,A,1433595600,[implementation],PROGRAMMING +549,Looksery Cup 2015,12,Looksery Party,1750.0,B,1433595600,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING +549,Looksery Cup 2015,12,The Game Of Parity,2000.0,C,1433595600,[games],PROGRAMMING +549,Looksery Cup 2015,12,Haar Features,1000.0,D,1433595600,"[greedy, implementation]",PROGRAMMING +549,Looksery Cup 2015,12,Sasha Circle,3000.0,E,1433595600,[math],PROGRAMMING +549,Looksery Cup 2015,12,Yura and Developers,3000.0,F,1433595600,"[data structures, divide and conquer]",PROGRAMMING +549,Looksery Cup 2015,12,Happy Line,1500.0,G,1433595600,"[greedy, sortings]",PROGRAMMING +549,Looksery Cup 2015,12,Degenerate Matrix,1500.0,H,1433595600,"[binary search, math]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Two Substrings,1000.0,A,1433435400,"[brute force, dp, implementation, strings]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Preparing Olympiad,750.0,B,1433435400,"[bitmasks, brute force]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Divisibility by Eight,1000.0,C,1433435400,"[brute force, dp, math]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Regular Bridge,2000.0,D,1433435400,"[constructive algorithms, graphs, implementation]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Brackets in Implications,3000.0,E,1433435400,"[constructive algorithms, greedy, implementation]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Frog,750.0,A,1432658100,"[brute force, implementation, math]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Feet,1000.0,B,1432658100,"[binary search, data structures, dp, dsu]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Foam,1750.0,C,1432658100,"[bitmasks, number theory]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Fish,1750.0,D,1432658100,"[dfs and similar, graphs]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Friends,2500.0,E,1432658100,"[data structures, string suffix structures, strings]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Fax,500.0,A,1432658100,"[brute force, implementation]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Fun,1000.0,B,1432658100,"[brute force, greedy, implementation]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Frog,1750.0,C,1432658100,[number theory],PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Feet,2000.0,D,1432658100,"[binary search, data structures]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Foam,2750.0,E,1432658100,[number theory],PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Bananas,500.0,A,1432312200,"[implementation, math]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Badges,1000.0,B,1432312200,"[brute force, greedy, implementation, sortings]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Cards,1250.0,C,1432312200,"[brute force, dfs and similar]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Number Game,1500.0,D,1432312200,"[constructive algorithms, dp, math, number theory]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Traveling,2250.0,E,1432312200,"[flows, math]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Toy Cars,500.0,A,1432053000,[implementation],PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Equidistant String,1000.0,B,1432053000,[greedy],PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Woodcutters,1750.0,C,1432053000,"[dp, greedy]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Queue,1750.0,D,1432053000,"[greedy, implementation, sortings]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Paths and Trees,2500.0,E,1432053000,"[graphs, greedy, shortest paths]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Writing Code,500.0,A,1431016200,[dp],PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Destroying Roads,1000.0,B,1431016200,"[graphs, shortest paths]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Remembering Strings,1750.0,C,1431016200,"[bitmasks, dp]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Road Improvement,1750.0,D,1431016200,"[dp, trees]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Listening to Music,2500.0,E,1431016200,"[constructive algorithms, data structures]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Set of Strings,500.0,A,1431016200,[implementation],PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Sea and Islands,1000.0,B,1431016200,"[constructive algorithms, implementation]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Writing Code,1500.0,C,1431016200,[dp],PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Destroying Roads,2000.0,D,1431016200,"[brute force, graphs, shortest paths]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Remembering Strings,2750.0,E,1431016200,"[bitmasks, dp]",PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Place Your Ad Here,750.0,A,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Duck Hunt,3000.0,B,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Idempotent functions,250.0,C,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Superhero's Job,1250.0,D,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Playing on Graph,750.0,E,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Quest,500.0,F,1430668800,[],PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Place Your Ad Here,2000.0,A,1430668800,"[data structures, sortings]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Duck Hunt,3000.0,B,1430668800,[data structures],PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Idempotent functions,750.0,C,1430668800,"[constructive algorithms, graphs, math]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Superhero's Job,2250.0,D,1430668800,"[dfs and similar, dp, hashing, math, number theory]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Playing on Graph,2250.0,E,1430668800,"[graphs, shortest paths]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Quest,1000.0,F,1430668800,"[dp, greedy]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Combination Lock,500.0,A,1430411400,[implementation],PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,School Marks,1000.0,B,1430411400,"[greedy, implementation]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Ice Cave,1500.0,C,1430411400,[dfs and similar],PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Bad Luck Island,2000.0,D,1430411400,"[dp, probabilities]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Infinite Inversions,2500.0,E,1430411400,"[binary search, data structures, implementation, sortings, trees]",PROGRAMMING +538,Codeforces Round #300,12,Cutting Banner,500.0,A,1430064000,"[brute force, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Quasi Binary,1000.0,B,1430064000,"[constructive algorithms, dp, greedy, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Tourist's Notes,1500.0,C,1430064000,"[binary search, brute force, greedy, implementation, math]",PROGRAMMING +538,Codeforces Round #300,12,Weird Chess,1500.0,D,1430064000,"[brute force, constructive algorithms, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Demiurges Play Again,2000.0,E,1430064000,"[dfs and similar, dp, math, trees]",PROGRAMMING +538,Codeforces Round #300,12,A Heap of Heaps,2500.0,F,1430064000,"[brute force, data structures, math, sortings]",PROGRAMMING +538,Codeforces Round #300,12,Berserk Robot ,3000.0,G,1430064000,"[constructive algorithms, math, sortings]",PROGRAMMING +538,Codeforces Round #300,12,Summer Dichotomy,3000.0,H,1430064000,"[2-sat, data structures, dfs and similar, greedy]",PROGRAMMING +537,VK Cup 2015 - Wild Card Round 2,12,Antiplagiarism,,A,1429381800,[*special],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Berland Miners,3000.0,A,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Work Group,500.0,B,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Board Game,250.0,C,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Landmarks,3000.0,D,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Correcting Mistakes,500.0,E,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Encoding,1250.0,F,1429286400,[],PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Berland Miners,3000.0,A,1429286400,"[binary search, data structures, dfs and similar, greedy, trees]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Work Group,750.0,B,1429286400,"[dfs and similar, dp, graphs, strings, trees]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Board Game,250.0,C,1429286400,"[games, greedy, implementation, math]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Landmarks,3000.0,D,1429286400,[data structures],PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Correcting Mistakes,500.0,E,1429286400,"[constructive algorithms, dp, greedy, hashing, strings, two pointers]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Encoding,1500.0,F,1429286400,"[hashing, string suffix structures, strings]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Nafas,500.0,A,1429029300,[implementation],PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and SaDDas,1000.0,B,1429029300,"[bitmasks, brute force, implementation]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Karafs,1500.0,C,1429029300,"[binary search, math]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Malekas,2000.0,D,1429029300,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Pashmaks,2500.0,E,1429029300,[geometry],PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Karafs,500.0,A,1429029300,"[binary search, math]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Malekas,1000.0,B,1429029300,"[hashing, string suffix structures, strings]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Pashmaks,1500.0,C,1429029300,[geometry],PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas in Kansas,2000.0,D,1429029300,"[dp, games]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas on the Path,2500.0,E,1429029300,"[data structures, divide and conquer, trees]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Exam,500.0,A,1428854400,"[constructive algorithms, implementation]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Covered Path,1000.0,B,1428854400,"[dp, greedy, math]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Polycarpus' Dice,1500.0,C,1428854400,[math],PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Handshakes,2000.0,D,1428854400,"[binary search, constructive algorithms, data structures, greedy]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Berland Local Positioning System,2500.0,E,1428854400,"[constructive algorithms, greedy, hashing, implementation]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Simplified Nonogram,3000.0,F,1428854400,"[bitmasks, dp, hashing, meet-in-the-middle]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,King of Thieves,500.0,A,1428165300,"[brute force, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Dark Park,500.0,B,1428165300,"[dfs and similar, greedy, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Candies,1250.0,C,1428165300,"[brute force, greedy, math]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Necklace,1750.0,D,1428165300,"[hashing, string suffix structures, strings]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Transmitting Levels,2250.0,E,1428165300,"[dp, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Pudding Monsters,3000.0,F,1428165300,"[data structures, divide and conquer]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Spiders Evil Plan,3000.0,G,1428165300,"[greedy, trees]",PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,String inside out,,B,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Set subtraction,,D,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Sum and product,,E,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Points in triangle,,H,1427562000,"[*special, geometry]",PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Different variables,,I,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,String inside out,,B,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Set subtraction,,D,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Sum and product,,E,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Points in triangle,,H,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Different variables,,I,1427562000,[*special],PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Vitaliy and Pie,250.0,A,1427387400,"[greedy, hashing]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Pasha and String,750.0,B,1427387400,[greedy],PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Ilya and Sticks,1000.0,C,1427387400,"[greedy, sortings]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Arthur and Walls,3000.0,D,1427387400,"[data structures, greedy]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Anya and Cubes,3000.0,E,1427387400,"[binary search, bitmasks, brute force, dp, meet-in-the-middle]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,And Yet Another Bracket Sequence,2500.0,A,1426956300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Group Photo 2 (online mirror version),500.0,B,1426956300,"[brute force, greedy, sortings]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Rooks and Rectangles,1500.0,C,1426956300,[data structures],PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Social Network,1250.0,D,1426956300,"[data structures, greedy]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,The Art of Dealing with ATM,500.0,E,1426956300,[brute force],PROGRAMMING +524,VK Cup 2015 - Round 1,12,"Возможно, вы знаете этих людей?",500.0,A,1426946400,[implementation],PROGRAMMING +524,VK Cup 2015 - Round 1,12,Фото на память - 2 (round version),500.0,B,1426946400,"[dp, greedy]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,The Art of Dealing with ATM,1000.0,C,1426946400,"[binary search, sortings]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,Social Network,1250.0,D,1426946400,"[greedy, two pointers]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,Rooks and Rectangles,1750.0,E,1426946400,[data structures],PROGRAMMING +524,VK Cup 2015 - Round 1,12,And Yet Another Bracket Sequence,3000.0,F,1426946400,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Playing with Paper,500.0,A,1426610700,"[implementation, math]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Error Correct System,1000.0,B,1426610700,[greedy],PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Glass Carving,1500.0,C,1426610700,"[binary search, data structures, implementation]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Clique Problem,2000.0,D,1426610700,"[data structures, dp, greedy, implementation, sortings]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Data Center Drama,2500.0,E,1426610700,"[dfs and similar, graphs]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Glass Carving,500.0,A,1426610700,"[data structures, implementation]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Clique Problem,1000.0,B,1426610700,"[dp, greedy]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Data Center Drama,1500.0,C,1426610700,"[constructive algorithms, graphs]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Fuzzy Search,2000.0,D,1426610700,"[bitmasks, brute force, fft]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Triangles 3000,2500.0,E,1426610700,"[geometry, sortings]",PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,"Rotate, Flip and Zoom",500.0,A,1426345200,[implementation],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Mean Requests,1000.0,B,1426345200,[implementation],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Name Quest,1500.0,C,1426345200,[greedy],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Statistics of Recompressing Videos,2000.0,D,1426345200,"[data structures, implementation]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Reposts,500.0,A,1425740400,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Photo to Remember,1000.0,B,1425740400,"[data structures, dp, implementation]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Chicken or Fish?,1500.0,C,1425740400,[greedy],PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Closest Equals,2000.0,D,1425740400,[data structures],PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Pangram,500.0,A,1425279600,"[implementation, strings]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Two Buttons,1000.0,B,1425279600,"[dfs and similar, graphs, greedy, implementation, math, shortest paths]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,DNA Alignment,1500.0,C,1425279600,"[math, strings]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Cubes,2000.0,D,1425279600,"[games, greedy, implementation]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Pluses everywhere,2500.0,E,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,DNA Alignment,500.0,A,1425279600,"[greedy, math]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Cubes,1000.0,B,1425279600,"[data structures, greedy, implementation]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Pluses everywhere,1500.0,C,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Shop,2000.0,D,1425279600,[greedy],PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Cycling City,2500.0,E,1425279600,"[dfs and similar, graphs]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Chess,500.0,A,1425128400,[implementation],PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Compilation Errors,1000.0,B,1425128400,"[data structures, implementation]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Team Training,1500.0,C,1425128400,"[greedy, implementation, math, number theory]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Interesting Substrings,2000.0,D,1425128400,"[data structures, dp, two pointers]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Lecture Rooms,2500.0,E,1425128400,"[binary search, data structures, dfs and similar, dp, trees]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Vitaly and Strings,500.0,A,1424795400,[strings],PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Tanya and Postcard,1000.0,B,1424795400,"[implementation, strings]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Anya and Smartphone,1500.0,C,1424795400,"[data structures, implementation]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Ilya and Escalator,2000.0,D,1424795400,"[combinatorics, dp, probabilities]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Arthur and Questions,2500.0,E,1424795400,"[greedy, implementation, ternary search]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Pasha and Pipe,2500.0,F,1424795400,"[binary search, brute force, combinatorics, dp, implementation]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Date,500.0,A,1424190900,[math],PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and His Happy Friends,1000.0,B,1424190900,"[brute force, dsu, meet-in-the-middle, number theory]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Factorial,1000.0,C,1424190900,"[greedy, math, sortings]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Tiles,3000.0,D,1424190900,"[constructive algorithms, greedy]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Park,3000.0,E,1424190900,[data structures],PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Factorial,500.0,A,1424190900,"[dp, greedy, implementation, math]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Tiles,1000.0,B,1424190900,"[data structures, graph matchings, greedy, implementation]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Park,1500.0,C,1424190900,[data structures],PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Morning Exercise,3000.0,D,1424190900,"[dfs and similar, dp, dsu, trees, two pointers]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and His Happy Friends,3000.0,E,1424190900,"[math, number theory]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Chewbaсca and Number,500.0,A,1423931400,"[greedy, implementation]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Han Solo and Lazer Gun,1000.0,B,1423931400,"[brute force, data structures, geometry, math]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Watto and Mechanism,2000.0,C,1423931400,"[binary search, hashing, string suffix structures, strings]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,R2D2 and Droid Army,2000.0,D,1423931400,"[binary search, data structures, two pointers]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Darth Vader and Tree,2500.0,E,1423931400,"[dp, matrices]",PROGRAMMING +513,Rockethon 2015,12,Game,3.0,A,1423328400,"[constructive algorithms, math]",PROGRAMMING +513,Rockethon 2015,12,Permutations,3.0,B1,1423328400,[brute force],PROGRAMMING +513,Rockethon 2015,12,Permutations,4.0,B2,1423328400,"[bitmasks, divide and conquer, math]",PROGRAMMING +513,Rockethon 2015,12,Second price auction,8.0,C,1423328400,"[bitmasks, probabilities]",PROGRAMMING +513,Rockethon 2015,12,Constrained Tree,9.0,D1,1423328400,[dfs and similar],PROGRAMMING +513,Rockethon 2015,12,Constrained Tree,8.0,D2,1423328400,"[constructive algorithms, data structures]",PROGRAMMING +513,Rockethon 2015,12,Subarray Cuts,9.0,E1,1423328400,[dp],PROGRAMMING +513,Rockethon 2015,12,Subarray Cuts,12.0,E2,1423328400,[dp],PROGRAMMING +513,Rockethon 2015,12,Scaygerboss,14.0,F1,1423328400,[flows],PROGRAMMING +513,Rockethon 2015,12,Scaygerboss,6.0,F2,1423328400,[flows],PROGRAMMING +513,Rockethon 2015,12,Inversions problem,3.0,G1,1423328400,"[brute force, dfs and similar, dp, meet-in-the-middle]",PROGRAMMING +513,Rockethon 2015,12,Inversions problem,5.0,G2,1423328400,"[dp, probabilities]",PROGRAMMING +513,Rockethon 2015,12,Inversions problem,16.0,G3,1423328400,[dp],PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Names,500.0,A,1422894600,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Jumping,1000.0,B,1422894600,"[data structures, dp, math, number theory, shortest paths]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Dinner,1500.0,C,1422894600,"[flows, graph matchings]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Travelling,2250.0,D,1422894600,"[dp, trees]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Polygon,2250.0,E,1422894600,"[constructive algorithms, divide and conquer]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Snake,500.0,A,1422894600,[implementation],PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Two Dots,1000.0,B,1422894600,[dfs and similar],PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Names,1500.0,C,1422894600,"[dfs and similar, graphs, sortings]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Jumping,2000.0,D,1422894600,"[bitmasks, brute force, dp, math]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Dinner,2500.0,E,1422894600,[flows],PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Maximum in Table,,A,1422705600,"[brute force, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Painting Pebbles,,B,1422705600,"[constructive algorithms, greedy, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Sums of Digits,,C,1422705600,"[dp, greedy, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Restoring Numbers,,D,1422705600,"[constructive algorithms, math]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Pretty Song,,E,1422705600,"[math, strings]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Progress Monitoring,,F,1422705600,[dp],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Pasha and Pixels,500.0,A,1422376200,[brute force],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Anton and currency you all know,1000.0,B,1422376200,[greedy],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Anya and Ghosts,1500.0,C,1422376200,[greedy],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Tanya and Password,2000.0,D,1422376200,"[dfs and similar, graphs]",PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Arthur and Brackets,2500.0,E,1422376200,"[dp, greedy]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Amr and Music,500.0,A,1422028800,"[greedy, implementation, sortings]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Amr and Pins,1000.0,B,1422028800,"[geometry, math]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Guess Your Way Out!,1500.0,C,1422028800,"[implementation, math]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,The Maths Lecture,2000.0,D,1422028800,"[dp, implementation]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Breaking Good,2500.0,E,1422028800,"[dfs and similar, dp, graphs, shortest paths]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Gift,500.0,A,1421586000,"[brute force, implementation, strings]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Colorful Graph,1000.0,B,1421586000,"[dfs and similar, dp, dsu, graphs]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,"Mr. Kitayuta, the Treasure Hunter",1500.0,C,1421586000,"[dfs and similar, dp, two pointers]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Technology,2000.0,D,1421586000,[dfs and similar],PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta vs. Bamboos,2750.0,E,1421586000,"[binary search, greedy]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,"Mr. Kitayuta, the Treasure Hunter",500.0,A,1421586000,[dp],PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Technology,1000.0,B,1421586000,"[dfs and similar, graphs]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta vs. Bamboos,1750.0,C,1421586000,[binary search],PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Colorful Graph,1750.0,D,1421586000,"[brute force, dfs and similar, dsu]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Gift,2500.0,E,1421586000,"[combinatorics, dp, matrices, strings]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Contest,500.0,A,1421053200,[implementation],PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Changing Handles,500.0,B,1421053200,"[data structures, dsu, strings]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Forest,1500.0,C,1421053200,"[constructive algorithms, data structures, greedy, sortings, trees]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Permutations Summation,3000.0,D,1421053200,[data structures],PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Palindrome Degree,3000.0,E,1421053200,"[binary search, combinatorics, implementation]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Forest,500.0,A,1421053200,"[constructive algorithms, data structures, graphs, greedy]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Permutations Summation,500.0,B,1421053200,"[binary search, data structures, math]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Palindrome Degree,2500.0,C,1421053200,[math],PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and XOR,2500.0,D,1421053200,[bitmasks],PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and LCP on Tree,3000.0,E,1421053200,"[binary search, dfs and similar, hashing, string suffix structures, trees]",PROGRAMMING +500,Good Bye 2014,12,New Year Transportation,500.0,A,1419951600,"[dfs and similar, graphs, implementation]",PROGRAMMING +500,Good Bye 2014,12,New Year Permutation,1000.0,B,1419951600,"[dfs and similar, dsu, graphs, greedy, math, sortings]",PROGRAMMING +500,Good Bye 2014,12,New Year Book Reading,1000.0,C,1419951600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +500,Good Bye 2014,12,New Year Santa Network,1500.0,D,1419951600,"[combinatorics, dfs and similar, graphs, trees]",PROGRAMMING +500,Good Bye 2014,12,New Year Domino,2750.0,E,1419951600,"[data structures, dp, dsu]",PROGRAMMING +500,Good Bye 2014,12,New Year Shopping,2750.0,F,1419951600,"[divide and conquer, dp]",PROGRAMMING +500,Good Bye 2014,12,New Year Running,3500.0,G,1419951600,"[number theory, trees]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Crazy Town,500.0,A,1419438600,[geometry],PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Name That Tune,2000.0,B,1419438600,"[dp, probabilities, two pointers]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Array and Operations,1000.0,C,1419438600,"[flows, graph matchings, number theory]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Traffic Jams in the Land,2000.0,D,1419438600,"[data structures, dp, number theory]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Stairs and Lines,2500.0,E,1419438600,"[dp, matrices]",PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Watching a movie,500.0,A,1419438600,[implementation],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Lecture,500.0,B,1419438600,[strings],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Crazy Town,1500.0,C,1419438600,[math],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Name That Tune,3000.0,D,1419438600,[],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Array and Operations,3000.0,E,1419438600,[],PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Minimum Difficulty,500.0,A,1418833800,"[brute force, implementation, math]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Secret Combination,1000.0,B,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Removing Columns,1750.0,C,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Tennis Game,2250.0,D,1418833800,[binary search],PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Distributing Parts ,2250.0,E,1418833800,"[greedy, sortings]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Removing Columns,750.0,A,1418833800,[greedy],PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Tennis Game,1250.0,B,1418833800,"[binary search, brute force, implementation]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Distributing Parts ,1250.0,C,1418833800,"[data structures, greedy, implementation, sortings, two pointers]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Gears,2000.0,D,1418833800,"[brute force, geometry, math]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Subsequences Return,2500.0,E,1418833800,"[dp, matrices]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Treasure,500.0,A,1418488200,[greedy],PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Obsessive String,1000.0,B,1418488200,"[dp, strings]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Helping People,1750.0,C,1418488200,"[dp, probabilities]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Birthday,1750.0,D,1418488200,"[data structures, dfs and similar, dp, trees]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Sharti,2500.0,E,1418488200,[games],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Digital Counter,500.0,A,1418488200,[implementation],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Modular Equations,1000.0,B,1418488200,[math],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Treasure,1500.0,C,1418488200,[implementation],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Obsessive String,2000.0,D,1418488200,"[binary search, dp, strings]",PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Helping People,2750.0,E,1418488200,[],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Football,500.0,A,1417618800,[implementation],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Wrestling,1000.0,B,1417618800,[implementation],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Basketball,2000.0,C,1417618800,"[binary search, brute force, data structures, implementation, sortings, two pointers]",PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Chess,1500.0,D,1417618800,"[constructive algorithms, games]",PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Polynomial,3000.0,E,1417618800,[math],PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Cubes,500.0,A,1417451400,[implementation],PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Lanterns,1000.0,B,1417451400,"[binary search, math, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Exams,1500.0,C,1417451400,"[greedy, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Computer Game,2000.0,D,1417451400,"[binary search, implementation, math, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Field,2500.0,E,1417451400,[math],PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Team Olympiad,500.0,A,1416733800,"[greedy, implementation, sortings]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Queue,1000.0,B,1416733800,"[dsu, implementation]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Hacking Cypher,1500.0,C,1416733800,"[brute force, math, strings]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Chocolate,2000.0,D,1416733800,"[brute force, dfs and similar, math, meet-in-the-middle, number theory]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Restoring Increasing Sequence,2000.0,E,1416733800,"[binary search, brute force, greedy, implementation]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Treeland Tour,2500.0,F,1416733800,"[data structures, dfs and similar, dp, trees]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Fight the Monster,500.0,A,1416590400,"[binary search, brute force]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Strip,1500.0,B,1416590400,"[binary search, data structures, dp, two pointers]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Prefix Product Sequence,1500.0,C,1416590400,"[constructive algorithms, number theory]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Conveyor Belts,2000.0,D,1416590400,[data structures],PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Tourists,2500.0,E,1416590400,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Giga Tower,500.0,A,1416590400,[brute force],PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Candy Boxes,1500.0,B,1416590400,"[brute force, constructive algorithms]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Fight the Monster,1500.0,C,1416590400,[brute force],PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Strip,2500.0,D,1416590400,"[data structures, dp, two pointers]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Prefix Product Sequence,2500.0,E,1416590400,"[constructive algorithms, math]",PROGRAMMING +491,Testing Round #11,12,Up the hill,500.0,A,1416519000,[implementation],PROGRAMMING +491,Testing Round #11,12,New York Hotel,1000.0,B,1416519000,"[greedy, math]",PROGRAMMING +491,Testing Round #11,12,Deciphering,1500.0,C,1416519000,"[flows, graph matchings]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,SwapSort,500.0,A,1416238500,"[implementation, sortings]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,BerSU Ball,1000.0,B,1416238500,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Given Length and Sum of Digits...,1500.0,C,1416238500,"[dp, greedy, implementation]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Unbearable Controversy of Being,2000.0,D,1416238500,"[brute force, combinatorics, dfs and similar, graphs]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Hiking,2500.0,E,1416238500,"[binary search, dp]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Special Matrices,2500.0,F,1416238500,"[combinatorics, dp]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Calculating Function,500.0,A,1415718000,"[implementation, math]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,OR in Matrix,1000.0,B,1415718000,"[greedy, hashing, implementation]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Palindrome Transformation,1500.0,C,1415718000,"[greedy, implementation]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Valid Sets,2000.0,D,1415718000,"[dfs and similar, dp, math, trees]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,LIS of Sequence,2500.0,E,1415718000,"[data structures, dp, greedy, hashing, math]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Bits,500.0,A,1415205000,"[bitmasks, constructive algorithms]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Maximum Value,1000.0,B,1415205000,"[binary search, math, sortings, two pointers]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Strange Sorting,3000.0,C,1415205000,"[implementation, math]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Kindergarten,2000.0,D,1415205000,"[data structures, dp, greedy]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Sign on Fence,3000.0,E,1415205000,"[binary search, constructive algorithms, data structures]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Factory,1000.0,A,1415205000,"[implementation, math, matrices]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Valuable Resources,500.0,B,1415205000,"[brute force, greedy]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Bits,1500.0,C,1415205000,"[implementation, math]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Maximum Value,3000.0,D,1415205000,"[binary search, sortings]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Strange Sorting,3000.0,E,1415205000,[],PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Diverse Permutation,500.0,A,1414170000,"[constructive algorithms, greedy]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Interesting Array,1500.0,B,1414170000,"[constructive algorithms, data structures, trees]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Game with Strings,1500.0,C,1414170000,"[bitmasks, dp, probabilities]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Random Function and Tree,2000.0,D,1414170000,"[combinatorics, dp, trees]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,ELCA,2500.0,E,1414170000,"[data structures, trees]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Counterexample ,500.0,A,1414170000,"[brute force, implementation]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Friends and Presents,1000.0,B,1414170000,"[binary search, math]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Diverse Permutation,1500.0,C,1414170000,"[constructive algorithms, implementation]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Interesting Array,2500.0,D,1414170000,[data structures],PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Game with Strings,2500.0,E,1414170000,[],PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Expression,500.0,A,1413709200,"[brute force, math]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Towers,1000.0,B,1413709200,"[brute force, greedy, implementation, sortings]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Exams,1500.0,C,1413709200,"[greedy, sortings]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Long Jumps,2000.0,D,1413709200,"[binary search, greedy, implementation]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Riding in a Lift,2500.0,E,1413709200,[dp],PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Exams,500.0,A,1413709200,"[greedy, sortings]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Long Jumps,1000.0,B,1413709200,"[binary search, greedy, hashing, implementation, sortings]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Riding in a Lift,1500.0,C,1413709200,"[dp, implementation]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Parcels,2000.0,D,1413709200,"[dp, graphs]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Parking Lot,2500.0,E,1413709200,"[data structures, divide and conquer]",PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Initial Bet,500.0,A,1413474000,[implementation],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Random Teams,1000.0,B,1413474000,"[combinatorics, constructive algorithms, greedy, math]",PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Table Decorations,1500.0,C,1413474000,[greedy],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Red-Green Towers,2000.0,D,1413474000,[dp],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Wavy numbers,2500.0,E,1413474000,"[brute force, dfs and similar, meet-in-the-middle, sortings]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Stairs,500.0,A,1413122400,"[implementation, math]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and WiFi,1500.0,B,1413122400,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sums,1500.0,C,1413122400,[math],PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sets,2000.0,D,1413122400,"[constructive algorithms, greedy, math]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Strings,2500.0,E,1413122400,"[dp, strings]",PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sums,500.0,A,1413122400,[math],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sets,1000.0,B,1413122400,[math],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Strings,1500.0,C,1413122400,[dp],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Binary,2000.0,D,1413122400,"[dp, strings]",PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Notepad,3000.0,E,1413122400,[data structures],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Keyboard,500.0,A,1412609400,[implementation],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Worms,1000.0,B,1412609400,"[binary search, implementation]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Captain Marmot,1500.0,C,1412609400,"[brute force, geometry]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Flowers,2000.0,D,1412609400,[dp],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Pillars,3000.0,E,1412609400,"[binary search, data structures, dp, sortings, trees]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Ant colony,3000.0,F,1412609400,"[data structures, number theory]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Bayan Bus,500.0,A,1412514000,[implementation],PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Strongly Connected City,1000.0,B,1412514000,"[brute force, dfs and similar, graphs, implementation]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Kamal-ol-molk's Painting,1500.0,C,1412514000,"[brute force, constructive algorithms, greedy]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,CGCDSSQ,2000.0,D,1412514000,"[brute force, data structures, math]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Strongly Connected City 2,2500.0,E,1412514000,[dfs and similar],PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Meta-universe,2500.0,F,1412514000,[data structures],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from Math,500.0,A,1411918500,"[math, number theory]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from Life,1000.0,B,1411918500,[],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Make It Nondeterministic,1500.0,C,1411918500,[greedy],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Inverse the Problem,2000.0,D,1411918500,"[dfs and similar, dsu, shortest paths, trees]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from a Game,3000.0,E,1411918500,"[constructive algorithms, implementation]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Change the Goal,3000.0,F,1411918500,"[constructive algorithms, math, matrices]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Increase the Constraints,3500.0,G,1411918500,"[bitmasks, data structures, fft]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Sticks,500.0,A,1411745400,[implementation],PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Important Things,1000.0,B,1411745400,[sortings],PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and House of Cards,2000.0,C,1411745400,"[binary search, brute force, greedy, math]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Cube Walls,2000.0,D,1411745400,"[string suffix structures, strings]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Lots and Lots of Segments,2500.0,E,1411745400,"[data structures, dsu]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,24 Game,500.0,A,1411218000,"[constructive algorithms, greedy, math]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Two Sets,1000.0,B,1411218000,"[2-sat, dfs and similar, dsu, graph matchings, greedy]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Hack it!,1500.0,C,1411218000,"[binary search, constructive algorithms, math]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Tree,2000.0,D,1411218000,[graph matchings],PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Permanent,2500.0,E,1411218000,"[dp, graph matchings, math, meet-in-the-middle]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,I Wanna Be the Guy,500.0,A,1411218000,"[greedy, implementation]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Chat Online,1000.0,B,1411218000,[implementation],PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,24 Game,1500.0,C,1411218000,"[constructive algorithms, implementation]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Two Sets,2000.0,D,1411218000,"[2-sat, data structures, graph matchings, greedy]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Hack it!,2500.0,E,1411218000,[constructive algorithms],PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,George and Accommodation,500.0,A,1411054200,[implementation],PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Fedor and New Game,1000.0,B,1411054200,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,George and Job,1500.0,C,1411054200,"[dp, implementation]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Fedor and Essay,2000.0,D,1411054200,"[dfs and similar, dp, graphs, hashing, strings]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Alex and Complicated Task,2500.0,E,1411054200,"[data structures, dp, greedy]",PROGRAMMING +470,Surprise Language Round #7,12,Crystal Ball Sequence,,A,1410622200,"[*special, implementation]",PROGRAMMING +470,Surprise Language Round #7,12,Hexakosioihexekontahexaphobia,,B,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Eval,,C,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Caesar Cipher,,D,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Chessboard,,E,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Pairwise Sums,,F,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Hamming Distance,,G,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Array Sorting,,H,1410622200,[*special],PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Cheap Travel,500.0,A,1410535800,[implementation],PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Wonder Room,1000.0,B,1410535800,"[brute force, math]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Number of Ways,1500.0,C,1410535800,"[binary search, brute force, data structures, dp, two pointers]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Increase Sequence,2000.0,D,1410535800,"[combinatorics, dp]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Information Graph,2500.0,E,1410535800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,No to Palindromes!,500.0,A,1410103800,"[greedy, strings]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,Restore Cube ,1500.0,B,1410103800,"[brute force, geometry]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,Substitutes in Number,1500.0,C,1410103800,[dp],PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,World of Darkraft - 2,2000.0,D,1410103800,"[dp, probabilities]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,The Classic Problem,2500.0,E,1410103800,"[data structures, graphs, shortest paths]",PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,inc ARG,500.0,A,1410103800,[implementation],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Inbox (100500),1000.0,B,1410103800,[implementation],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,No to Palindromes!,1500.0,C,1410103800,[brute force],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Restore Cube ,2500.0,D,1410103800,[brute force],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Substitutes in Number,2500.0,E,1410103800,"[constructive algorithms, dp]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Sugar,500.0,A,1409383800,[implementation],PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Pylons,1000.0,B,1409383800,[math],PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Gargari and Bishops,1500.0,C,1409383800,"[greedy, hashing, implementation]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Gargari and Permutations,2000.0,D,1409383800,"[dfs and similar, dp, graphs]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Tree,2500.0,E,1409383800,"[brute force, dfs and similar, trees]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Toastman,500.0,A,1409061600,"[greedy, sortings]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Tree,1000.0,B,1409061600,"[dfs and similar, dp, trees]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and a Sheet of Paper,1500.0,C,1409061600,"[data structures, implementation]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Complicated Task,2000.0,D,1409061600,"[dsu, math]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and a Game,2500.0,E,1409061600,[shortest paths],PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Easy Task,500.0,A,1409061600,"[brute force, implementation]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Card Game,1000.0,B,1409061600,[greedy],PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Toastman,1500.0,C,1409061600,"[implementation, sortings]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Tree,2000.0,D,1409061600,"[dp, graphs]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and a Sheet of Paper,2500.0,E,1409061600,[],PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Vasya and Socks,500.0,A,1408548600,"[brute force, implementation, math]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Little Dima and Equation,1000.0,B,1408548600,"[brute force, implementation, math]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Present,1500.0,C,1408548600,"[binary search, data structures, greedy]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Little Victor and Set,2000.0,D,1408548600,"[brute force, constructive algorithms]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Roland and Rose,2500.0,E,1408548600,"[brute force, geometry, math, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Garden,500.0,A,1408116600,[implementation],PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Flowers,500.0,B,1408116600,"[combinatorics, implementation, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Buses,2000.0,C,1408116600,"[combinatorics, constructive algorithms, math]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Parmida's problem,2000.0,D,1408116600,"[data structures, divide and conquer, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Graph,3000.0,E,1408116600,"[dp, sortings]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Golden System,1000.0,A,1407690000,"[math, meet-in-the-middle]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Elections,1500.0,C,1407690000,[brute force],PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Bingo!,2000.0,D,1407690000,"[combinatorics, math, probabilities]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Flow Optimality,2500.0,E,1407690000,"[constructive algorithms, flows, math]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,An easy problem about trees,3000.0,F,1407690000,"[dp, games, greedy, trees]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Golden System,1000.0,A,1407690000,[math],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Elections,1500.0,C,1407690000,"[data structures, ternary search]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Bingo!,2000.0,D,1407690000,"[combinatorics, probabilities]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Flow Optimality,2500.0,E,1407690000,[],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,An easy problem about trees,3000.0,F,1407690000,[],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Boredom,500.0,A,1407511800,[dp],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,A Lot of Games,1000.0,B,1407511800,"[dfs and similar, dp, games, implementation, strings, trees]",PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Civilization,1500.0,C,1407511800,"[dfs and similar, dp, dsu, ternary search, trees]",PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Serega and Fun,2000.0,D,1407511800,[data structures],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Function,2500.0,E,1407511800,[data structures],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Laptops,500.0,A,1407511800,[sortings],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Fedya and Maths,1000.0,B,1407511800,"[math, number theory]",PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Boredom,1500.0,C,1407511800,[dp],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,A Lot of Games,2000.0,D,1407511800,"[dp, games, strings]",PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Civilization,2500.0,E,1407511800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Expected Maximum,500.0,A,1406907000,[probabilities],PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Harmony Chest,1000.0,B,1406907000,"[bitmasks, brute force, dp]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Summer Sun Celebration,1500.0,C,1406907000,"[constructive algorithms, dfs and similar]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Elements of Harmony,2500.0,D,1406907000,"[dp, matrices]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Lord Tirek,2500.0,E,1406907000,[data structures],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Crystal Mine,500.0,A,1406907000,[implementation],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Sort by Shift,1000.0,B,1406907000,[implementation],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Expected Maximum,1500.0,C,1406907000,"[combinatorics, math, probabilities]",PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Harmony Chest,2000.0,D,1406907000,"[bitmasks, dp]",PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Summer Sun Celebration,2500.0,E,1406907000,[dfs and similar],PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Eevee,500.0,A,1406480400,"[brute force, implementation, strings]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,4-point polyline,1000.0,B,1406480400,"[brute force, constructive algorithms, geometry, trees]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Magic Trick,1000.0,C,1406480400,"[combinatorics, math, probabilities]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,"Washer, Dryer, Folder",1500.0,D,1406480400,"[greedy, implementation]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Three strings,2500.0,E,1406480400,"[data structures, dsu, string suffix structures, strings]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Permutation,2500.0,F,1406480400,"[data structures, divide and conquer, hashing]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Game With Sticks,500.0,A,1406215800,[implementation],PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Sort the Array,1000.0,B,1406215800,"[implementation, sortings]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Predict Outcome of the Game,1500.0,C,1406215800,"[brute force, implementation, math]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Count Good Substrings,2500.0,D,1406215800,[math],PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Devu and Flowers,3000.0,E,1406215800,"[bitmasks, combinatorics, number theory]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Chocolate,500.0,A,1405774800,[math],PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Cities,1000.0,B,1405774800,"[graphs, shortest paths]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Apples,1500.0,C,1405774800,"[constructive algorithms, number theory]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Numbers,2000.0,D,1405774800,"[bitmasks, combinatorics, dp]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Squares,2500.0,E,1405774800,"[dp, math, number theory]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Children,500.0,A,1405774800,[implementation],PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Sequences,1000.0,B,1405774800,"[implementation, math]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Chocolate,1500.0,C,1405774800,"[greedy, implementation]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Cities,2000.0,D,1405774800,"[graphs, shortest paths]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Apples,2500.0,E,1405774800,"[constructive algorithms, number theory]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Rewards,500.0,A,1405605600,[implementation],PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Suffix Structures,1000.0,B,1405605600,"[implementation, strings]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Painting Fence,2500.0,C,1405605600,"[divide and conquer, dp, greedy]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Multiplication Table,2000.0,D,1405605600,"[binary search, brute force]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Divisors,3000.0,E,1405605600,"[brute force, dfs and similar, implementation, number theory]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Sequences,500.0,A,1405256400,"[dp, implementation, two pointers]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Modification,1500.0,B,1405256400,"[brute force, greedy]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Fibonacci Numbers,1500.0,C,1405256400,"[data structures, number theory]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Games,2000.0,D,1405256400,"[math, matrices, probabilities]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Bridges,2500.0,E,1405256400,"[math, matrices]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Hash,500.0,A,1405256400,[implementation],PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Strings,1000.0,B,1405256400,"[greedy, implementation]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Sequences,1500.0,C,1405256400,[dp],PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Modification,2500.0,D,1405256400,"[data structures, greedy]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Fibonacci Numbers,2500.0,E,1405256400,[data structures],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Physics,500.0,A,1404651900,"[greedy, math]",PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves FFT,1000.0,B,1404651900,[probabilities],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Colors,2000.0,C,1404651900,[data structures],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Strings,2000.0,D,1404651900,"[binary search, hashing, strings, two pointers]",PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Planting,2500.0,E,1404651900,"[binary search, dsu, trees]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Chessboard,500.0,A,1404651900,"[dfs and similar, implementation]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Chemistry,1000.0,B,1404651900,"[dfs and similar, dsu, greedy]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Physics,1500.0,C,1404651900,"[graphs, greedy]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves FFT,2000.0,D,1404651900,[probabilities],PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Colors,3000.0,E,1404651900,[data structures],PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Borya and Hanabi,500.0,A,1403191800,"[bitmasks, brute force, implementation]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Andrey and Problem,1500.0,B,1403191800,"[greedy, math, probabilities]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Artem and Array ,1500.0,C,1403191800,"[data structures, greedy]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Adam and Tree,2000.0,D,1403191800,"[data structures, trees]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Gena and Second Distance,2500.0,E,1403191800,[geometry],PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Anton and Letters,500.0,A,1403191800,"[constructive algorithms, implementation]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Kolya and Tandem Repeat,1000.0,B,1403191800,"[brute force, implementation, strings]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Borya and Hanabi,1500.0,C,1403191800,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Andrey and Problem,2500.0,D,1403191800,"[dp, greedy, math, probabilities, sortings]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Artem and Array ,2500.0,E,1403191800,[],PROGRAMMING +436,Zepto Code Rush 2014,12,Feed with Candy,1000.0,A,1402673400,[greedy],PROGRAMMING +436,Zepto Code Rush 2014,12,Om Nom and Spiders,1000.0,B,1402673400,"[implementation, math]",PROGRAMMING +436,Zepto Code Rush 2014,12,Dungeons and Candies,1500.0,C,1402673400,"[dsu, graphs, greedy, trees]",PROGRAMMING +436,Zepto Code Rush 2014,12,Pudding Monsters,2500.0,D,1402673400,[dp],PROGRAMMING +436,Zepto Code Rush 2014,12,Cardboard Box,2500.0,E,1402673400,"[data structures, greedy]",PROGRAMMING +436,Zepto Code Rush 2014,12,Banners,3000.0,F,1402673400,"[brute force, data structures, dp]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Antique Items,500.0,A,1402241400,[implementation],PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Fruits,1000.0,B,1402241400,"[greedy, implementation]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Tubes ,1500.0,C,1402241400,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Swaps,2000.0,D,1402241400,"[constructive algorithms, dsu, graphs, implementation, string suffix structures]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Number,2500.0,E,1402241400,"[bitmasks, dp]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,"Devu, the Singer and Churu, the Joker",500.0,A,1401895800,"[greedy, implementation]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,"Devu, the Dumb Guy",1000.0,B,1401895800,"[implementation, sortings]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and Partitioning of the Array,1500.0,C,1401895800,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and his Brother,2000.0,D,1401895800,"[binary search, sortings, ternary search, two pointers]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and Birthday Celebration,2500.0,E,1401895800,"[combinatorics, dp, math]",PROGRAMMING +440,Testing Round #10,12,Forgotten Episode,500.0,A,1401809400,[implementation],PROGRAMMING +440,Testing Round #10,12,Balancer,1000.0,B,1401809400,[implementation],PROGRAMMING +440,Testing Round #10,12,One-Based Arithmetic,1500.0,C,1401809400,"[dfs and similar, divide and conquer]",PROGRAMMING +440,Testing Round #10,12,Berland Federalization,2000.0,D,1401809400,"[dp, trees]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Homework,500.0,A,1401627600,[implementation],PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Set,1500.0,B,1401627600,"[bitmasks, greedy, implementation, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Toy,1500.0,C,1401627600,"[graphs, greedy, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Zoo,2000.0,D,1401627600,"[dsu, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Polygon,2500.0,E,1401627600,[],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Toy,500.0,A,1401627600,[greedy],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Zoo,1000.0,B,1401627600,"[dp, dsu, sortings]",PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Polygon,1500.0,C,1401627600,"[dp, geometry]",PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Sequence,2000.0,D,1401627600,[data structures],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Binary Tree,3000.0,E,1401627600,"[combinatorics, divide and conquer, fft, number theory]",PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Queue on Bus Stop,500.0,A,1401463800,[implementation],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Pasha Maximizes,1000.0,B,1401463800,[greedy],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Cardiogram,1500.0,C,1401463800,[implementation],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Special Grid,2000.0,D,1401463800,"[brute force, dp, greedy]",PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Special Graph,2500.0,E,1401463800,[],PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Kitahara Haruki's Gift,500.0,A,1400914800,"[brute force, implementation]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Kuriyama Mirai's Stones,1500.0,B,1400914800,"[dp, implementation, sortings]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Ryouko's Memory Note,1500.0,C,1400914800,"[implementation, math, sortings]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Nanami's Digital Board,2000.0,D,1400914800,"[dsu, implementation]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Tachibana Kanade's Tofu,2500.0,E,1400914800,[dp],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Ryouko's Memory Note,500.0,A,1400914800,"[math, sortings]",PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Nanami's Digital Board,1000.0,B,1400914800,"[divide and conquer, dp, dsu, implementation, two pointers]",PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Tachibana Kanade's Tofu,1500.0,C,1400914800,[dp],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Nanami's Power Plant,2000.0,D,1400914800,[flows],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Furukawa Nagisa's Tree,3000.0,E,1400914800,"[binary search, divide and conquer, sortings, trees]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Black Square,500.0,A,1400686200,[implementation],PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Shower Line,1500.0,B,1400686200,"[brute force, implementation]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,k-Tree,1500.0,C,1400686200,"[dp, implementation, trees]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Random Task,2000.0,D,1400686200,"[binary search, bitmasks, combinatorics, dp, math]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Chemistry Experiment,2500.0,E,1400686200,"[binary search, data structures, ternary search]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Choosing Teams,500.0,A,1400167800,"[greedy, implementation, sortings]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Football Kit,1000.0,B,1400167800,"[brute force, greedy, implementation]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Prime Swaps,1500.0,C,1400167800,"[greedy, sortings]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Prefixes and Suffixes,2000.0,D,1400167800,"[dp, string suffix structures, strings, two pointers]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Square Tiling,2500.0,E,1400167800,"[constructive algorithms, greedy]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Xor-tree,500.0,A,1399822800,"[dfs and similar, trees]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Working out,1000.0,B,1399822800,[dp],PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Guess the Tree,1500.0,C,1399822800,"[bitmasks, constructive algorithms, dp, greedy, trees]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Tricky Function,2000.0,D,1399822800,"[data structures, divide and conquer, geometry]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Points and Segments,2000.0,E,1399822800,[graphs],PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Points and Segments (easy),500.0,A,1399822800,"[constructive algorithms, sortings]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Balls Game,1000.0,B,1399822800,"[brute force, two pointers]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Xor-tree,1500.0,C,1399822800,"[brute force, data structures, dfs and similar, trees]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Working out,2000.0,D,1399822800,"[brute force, dp]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Guess the Tree,2500.0,E,1399822800,"[constructive algorithms, data structures, dfs and similar]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Police Recruits,500.0,A,1399044600,[implementation],PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Prison Transfer,1000.0,B,1399044600,"[data structures, implementation]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Checkposts,1500.0,C,1399044600,"[dfs and similar, graphs, two pointers]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Match & Catch,2000.0,D,1399044600,"[dp, string suffix structures, strings]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Police Patrol,2500.0,E,1399044600,"[greedy, implementation, math, ternary search]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Swaps,500.0,A,1398612600,"[brute force, sortings]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Table ,1000.0,B,1398612600,"[bitmasks, greedy]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Two Sequences,1500.0,C,1398612600,"[data structures, dp]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Squares,2000.0,D,1398612600,"[binary search, data structures, hashing]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Sets,2000.0,E,1398612600,[dp],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Mugs,500.0,A,1398612600,[implementation],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Mirroring,1000.0,B,1398612600,[implementation],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Swaps,1500.0,C,1398612600,"[brute force, sortings, two pointers]",PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Table ,2000.0,D,1398612600,[],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Two Sequences,2500.0,E,1398612600,[],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Squats,500.0,A,1398409200,[implementation],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Megacity,1000.0,B,1398409200,"[binary search, greedy, implementation, sortings]",PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Magic Formulas,1500.0,C,1398409200,[math],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Biathlon Track,2500.0,D,1398409200,"[binary search, brute force, constructive algorithms, data structures, dp]",PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Colored Jenga,3000.0,E,1398409200,"[dfs and similar, dp, probabilities]",PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Start Up,500.0,A,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Online Meeting,1500.0,B,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Bug in Code,1500.0,C,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Cup Trick,1500.0,D,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Playing the ball,2000.0,E,1398169200,[],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Start Up,500.0,A,1398169140,[implementation],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Online Meeting,1500.0,B,1398169140,[implementation],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Bug in Code,1500.0,C,1398169140,"[data structures, graphs, implementation, two pointers]",PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Cup Trick,1500.0,D,1398169140,[data structures],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Playing the ball,2000.0,E,1398169140,[geometry],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Pasha and Hamsters,500.0,A,1398168900,"[constructive algorithms, implementation]",PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Start Up,1000.0,B,1398168900,[implementation],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Online Meeting,2000.0,C,1398168900,[implementation],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Bug in Code,2000.0,D,1398168900,"[binary search, data structures, sortings]",PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Cup Trick,2000.0,E,1398168900,[data structures],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Data Recovery,500.0,A,1397977200,[implementation],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Spyke Chatting,1000.0,B,1397977200,[implementation],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Jeopardy!,1500.0,C,1397977200,"[greedy, math]",PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,2048,2000.0,D,1397977200,"[bitmasks, dp]",PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Maze 2D,2500.0,E,1397977200,"[data structures, divide and conquer]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Poster,500.0,A,1397837400,"[greedy, implementation]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Network Configuration,1000.0,B,1397837400,"[greedy, sortings]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Pattern,1500.0,C,1397837400,"[implementation, strings]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Giving Awards,2000.0,D,1397837400,[dfs and similar],PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,E-mail Addresses,2500.0,E,1397837400,[implementation],PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Elimination,500.0,A,1397749200,"[dp, implementation, math]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Crash,1000.0,B,1397749200,[implementation],PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Football,1500.0,C,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Cunning Gena,2000.0,D,1397749200,"[bitmasks, dp, greedy, sortings]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Square Table,2500.0,E,1397749200,"[constructive algorithms, math, probabilities]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Football,500.0,A,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Cunning Gena,1000.0,B,1397749200,"[bitmasks, dp, sortings]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Square Table,1500.0,C,1397749200,"[constructive algorithms, dp, math]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Big Problems for Organizers,2500.0,D,1397749200,"[data structures, graphs, trees]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Tricky Password,2500.0,E,1397749200,[data structures],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Password Check,,A,1397505600,[implementation],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Multi-core Processor,,B,1397505600,[implementation],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Kicker,,C,1397505600,[implementation],PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Guess a number!,500.0,A,1397376000,"[greedy, implementation, two pointers]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Art Union,1000.0,B,1397376000,"[brute force, dp, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Booking System,1500.0,C,1397376000,"[binary search, dp, greedy, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Population Size,2000.0,D,1397376000,"[greedy, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,President's Path,2500.0,E,1397376000,"[dp, graphs, shortest paths]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Numbers,500.0,A,1396798800,"[constructive algorithms, number theory]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and ACM,1000.0,B,1396798800,"[combinatorics, dp]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Reverse Operation,1500.0,C,1396798800,"[combinatorics, divide and conquer]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Water Tanks,1500.0,D,1396798800,"[binary search, data structures, greedy, two pointers]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh's Designed Problem,2500.0,E,1396798800,[data structures],PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Lights,500.0,A,1396798800,[implementation],PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Tokens,1000.0,B,1396798800,"[binary search, greedy, math]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Numbers,1500.0,C,1396798800,"[constructive algorithms, greedy, number theory]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and ACM,2000.0,D,1396798800,"[combinatorics, dp, number theory]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Reverse Operation,2500.0,E,1396798800,"[divide and conquer, sortings]",PROGRAMMING +409,April Fools Day Contest 2014,12,The Great Game,,A,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Mysterious Language,,B,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Magnum Opus,,C,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Big Data,,D,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Dome,,E,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,000001,,F,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,On a plane,,G,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,A + B Strikes Back,,H,1396366200,"[*special, brute force, constructive algorithms, dsu, implementation]",PROGRAMMING +409,April Fools Day Contest 2014,12,Feed the Golorp,,I,1396366200,[*special],PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Triangle,500.0,A,1396162800,"[brute force, implementation, math]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Long Path,1000.0,B,1396162800,"[dp, implementation]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Curious Array,2000.0,C,1396162800,"[brute force, implementation, math]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Largest Submatrix 3,2000.0,D,1396162800,"[dp, hashing]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,k-d-sequence,2500.0,E,1396162800,[data structures],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Line to Cashier,500.0,A,1396162800,[implementation],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Garland,1000.0,B,1396162800,[implementation],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Triangle,1500.0,C,1396162800,"[geometry, math]",PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Long Path,2000.0,D,1396162800,[dp],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Curious Array,3000.0,E,1396162800,[],PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Gravity Flip,500.0,A,1395502200,"[greedy, implementation, sortings]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Domino Effect,1000.0,B,1395502200,[],PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Unusual Product,1500.0,C,1395502200,"[implementation, math]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Toy Sum,2000.0,D,1395502200,"[greedy, implementation, math]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Graph Cutting,3000.0,E,1395502200,[dfs and similar],PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Unusual Product,500.0,A,1395502200,"[implementation, math]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Toy Sum,1000.0,B,1395502200,"[constructive algorithms, greedy]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Graph Cutting,2000.0,C,1395502200,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Hill Climbing,2000.0,D,1395502200,"[dfs and similar, geometry, trees]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Hamming Triples,2500.0,E,1395502200,"[implementation, math]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Valera and X,500.0,A,1395243000,[implementation],PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Marathon,1000.0,B,1395243000,"[implementation, math]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Restore Graph,1500.0,C,1395243000,"[dfs and similar, graphs, sortings]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Minesweeper 1D,2000.0,D,1395243000,"[dp, implementation]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Maze 1D,2500.0,E,1395243000,"[binary search, greedy, implementation]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Nuts,500.0,A,1394983800,"[greedy, math]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Trees in a Row,1000.0,B,1394983800,[brute force],PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Searching for Graph,1500.0,C,1394983800,"[brute force, constructive algorithms]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Upgrading Array,2000.0,D,1394983800,"[dp, greedy, math]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Strictly Positive Matrix,2500.0,E,1394983800,[graphs],PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Searching for Graph,500.0,A,1394983800,"[constructive algorithms, graphs]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Upgrading Array,1000.0,B,1394983800,"[dp, greedy, number theory]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Strictly Positive Matrix,1500.0,C,1394983800,[graphs],PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Beautiful Pairs of Numbers,1500.0,D,1394983800,"[combinatorics, dp]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Two Rooted Trees,2000.0,E,1394983800,"[data structures, implementation]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Vanya and Cards,500.0,A,1394465400,"[implementation, math]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Sereja and Contests,1000.0,B,1394465400,"[greedy, implementation, math]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Team,1500.0,C,1394465400,"[constructive algorithms, greedy, implementation]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Roman and Numbers,2000.0,D,1394465400,"[bitmasks, brute force, combinatorics, dp, number theory]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Olympic Games,2500.0,E,1394465400,[math],PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Choose Options,500.0,A,1394033400,"[dp, implementation]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and New Matrix of Candies,1000.0,B,1394033400,"[brute force, implementation, schedules]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Huge Candy Matrix,1500.0,C,1394033400,"[implementation, math]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Dima and Bacteria,2000.0,D,1394033400,"[dsu, graphs, shortest paths]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Binary Logic,2500.0,E,1394033400,"[binary search, bitmasks, data structures]",PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Cards,500.0,A,1393687800,[implementation],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Painting The Wall,1000.0,B,1393687800,"[dp, probabilities]",PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Tree and Array,1500.0,C,1393687800,[constructive algorithms],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Instant Messanger,2000.0,D,1393687800,[data structures],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Sorting Permutations,2500.0,E,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Pages,500.0,A,1393687800,[implementation],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Red and Blue Balls,1000.0,B,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Cards,1500.0,C,1393687800,[number theory],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Painting The Wall,2000.0,D,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Tree and Array,2500.0,E,1393687800,[],PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Number of Decompositions into Multipliers,500.0,A,1393428600,"[combinatorics, number theory]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Sum of Fractions,1000.0,B,1393428600,"[math, number theory]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Changing Tree,1500.0,C,1393428600,"[data structures, trees]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Sum of Number of Inversions in Permutations,2000.0,D,1393428600,[combinatorics],PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Iteration of One Well-Known Function,2500.0,E,1393428600,[],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Segment's Own Points,500.0,A,1393428600,[],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Corruption and Numbers,1000.0,B,1393428600,"[implementation, math]",PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Number of Decompositions into Multipliers,1500.0,C,1393428600,"[combinatorics, number theory]",PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Sum of Fractions,2000.0,D,1393428600,[math],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Changing Tree,2500.0,E,1393428600,"[data structures, trees]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Counting Sticks,500.0,A,1392910200,[implementation],PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Very Beautiful Number,1000.0,B,1392910200,[],PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Dominoes,1500.0,C,1392910200,"[constructive algorithms, greedy]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Physical Education and Buns,2000.0,D,1392910200,"[brute force, implementation, math]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Lightbulb for Minister,2500.0,E,1392910200,[geometry],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Blocked Points,500.0,A,1392728400,[math],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Tower of Hanoi,1000.0,B,1392728400,[dp],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Yet Another Number Sequence,1500.0,C,1392728400,"[combinatorics, math, matrices]",PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Three Arrays,2000.0,D,1392728400,[data structures],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Deleting Substrings,2500.0,E,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Nineteen,500.0,A,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Three matrices,1000.0,B,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Blocked Points,1500.0,C,1392728400,[geometry],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Tower of Hanoi,2000.0,D,1392728400,[dp],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Yet Another Number Sequence,2500.0,E,1392728400,[],PROGRAMMING +391,Rockethon 2014,12,Genetic Engineering,3.0,A,1392573600,"[implementation, two pointers]",PROGRAMMING +391,Rockethon 2014,12,Word Folding,5.0,B,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,The Tournament,4.0,C1,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,The Tournament,4.0,C2,1392573600,[greedy],PROGRAMMING +391,Rockethon 2014,12,The Tournament,8.0,C3,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Supercollider,3.0,D1,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,Supercollider,16.0,D2,1392573600,[data structures],PROGRAMMING +391,Rockethon 2014,12,Three Trees,11.0,E1,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Three Trees,13.0,E2,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,8.0,F1,1392573600,[dp],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,15.0,F2,1392573600,[greedy],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,10.0,F3,1392573600,[],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Alarm Clock,500.0,A,1392132600,[implementation],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,"Inna, Dima and Song",1000.0,B,1392132600,[implementation],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Candy Boxes,1500.0,C,1392132600,[data structures],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Sweet Matrix,2000.0,D,1392132600,[constructive algorithms],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Large Sweet Matrix,2500.0,E,1392132600,[],PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Box Accumulation,500.0,A,1391442000,"[greedy, sortings]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Minimal path,1000.0,B,1391442000,"[bitmasks, constructive algorithms, graphs, implementation, math]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Card Game,1500.0,C,1391442000,"[games, greedy, sortings]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Perfect Sets,2000.0,D,1391442000,[math],PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Meteor Shower,2500.0,E,1391442000,[geometry],PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Number Game,500.0,A,1391442000,"[greedy, math]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Cross,1000.0,B,1391442000,"[greedy, implementation]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Box Accumulation,1500.0,C,1391442000,"[binary search, dp, greedy]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Minimal path,2000.0,D,1391442000,"[constructive algorithms, graphs, implementation, shortest paths]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Card Game,2500.0,E,1391442000,"[greedy, implementation]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Sleep,500.0,A,1391095800,[implementation],PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Round,1000.0,B,1391095800,"[brute force, greedy, two pointers]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Number,1500.0,C,1391095800,"[greedy, implementation]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Interesting Graph,2000.0,D,1391095800,[graph matchings],PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Cards,2500.0,E,1391095800,"[binary search, data structures]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Raspberry,500.0,A,1390577700,"[brute force, greedy, implementation]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Strings,1000.0,B,1390577700,"[brute force, greedy, implementation, math, strings]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Prime Numbers,1500.0,C,1390577700,"[binary search, brute force, data structures, dp, implementation, math, number theory]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Floodlight,2000.0,D,1390577700,"[bitmasks, dp, geometry]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear in the Field,2500.0,E,1390577700,"[math, matrices]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Milking cows,500.0,A,1390231800,"[data structures, greedy]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Volcanoes,1500.0,B,1390231800,"[binary search, implementation, sortings, two pointers]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Propagating tree,1500.0,C,1390231800,"[data structures, dfs and similar, trees]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Antimatter,2000.0,D,1390231800,[dp],PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Vowels,2500.0,E,1390231800,"[combinatorics, divide and conquer, dp]",PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Coder,500.0,A,1390231800,[implementation],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Multitasking,1000.0,B,1390231800,"[greedy, implementation, sortings, two pointers]",PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Milking cows,1500.0,C,1390231800,[greedy],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Volcanoes,2500.0,D,1390231800,[implementation],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Propagating tree,2500.0,E,1390231800,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Pan Scales,500.0,A,1389972600,"[greedy, implementation]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Number Busters,2500.0,B,1389972600,"[binary search, math]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Arithmetic Progression,1500.0,C,1389972600,"[implementation, sortings]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Pawns,3000.0,D,1389972600,"[dfs and similar, graphs, implementation, trees]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Combinatorics,3000.0,E,1389972600,"[combinatorics, dp]",PROGRAMMING +386,Testing Round #9,12,Second-Price Auction,500.0,A,1389906900,[implementation],PROGRAMMING +386,Testing Round #9,12,"Fly, freebies, fly!",1000.0,B,1389906900,"[binary search, brute force, implementation]",PROGRAMMING +386,Testing Round #9,12,Diverse Substrings,1500.0,C,1389906900,"[dp, two pointers]",PROGRAMMING +386,Testing Round #9,12,Game with Points,2000.0,D,1389906900,"[dp, graphs, implementation, shortest paths]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Prefixes,500.0,A,1389540600,"[binary search, brute force]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Tree,1000.0,B,1389540600,"[graphs, implementation]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Brackets,1500.0,C,1389540600,"[data structures, schedules]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Cinema,2000.0,D,1389540600,"[combinatorics, math]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Dividing,2500.0,E,1389540600,[data structures],PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Dima,500.0,A,1389540600,"[greedy, implementation, two pointers]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Stairs,1000.0,B,1389540600,"[greedy, implementation, sortings]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Prefixes,1500.0,C,1389540600,"[binary search, implementation, two pointers]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Tree,2000.0,D,1389540600,[brute force],PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Brackets,2500.0,E,1389540600,[data structures],PROGRAMMING +379,Good Bye 2013,12,New Year Candles,500.0,A,1388417400,[implementation],PROGRAMMING +379,Good Bye 2013,12,New Year Present,1000.0,B,1388417400,"[constructive algorithms, implementation]",PROGRAMMING +379,Good Bye 2013,12,New Year Ratings Change,1500.0,C,1388417400,"[greedy, sortings]",PROGRAMMING +379,Good Bye 2013,12,New Year Letter,2000.0,D,1388417400,"[bitmasks, brute force, dp]",PROGRAMMING +379,Good Bye 2013,12,New Year Tree Decorations,2500.0,E,1388417400,"[geometry, schedules, sortings]",PROGRAMMING +379,Good Bye 2013,12,New Year Tree,3000.0,F,1388417400,"[data structures, divide and conquer, trees]",PROGRAMMING +379,Good Bye 2013,12,New Year Cactus,3500.0,G,1388417400,[dp],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Maze,500.0,A,1388331000,[dfs and similar],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Preparing for the Contest,1000.0,B,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Captains Mode,1000.0,C,1388331000,"[bitmasks, dp, games]",PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Developing Game,2000.0,D,1388331000,[data structures],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Cookie Clicker,2500.0,E,1388331000,"[dp, geometry]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Playing with Dice,500.0,A,1388331000,[brute force],PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Semifinals,1000.0,B,1388331000,"[implementation, sortings]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Maze,1500.0,C,1388331000,[dfs and similar],PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Preparing for the Contest,2000.0,D,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Captains Mode,2000.0,E,1388331000,"[bitmasks, brute force, dp, greedy]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Divisible by Seven,500.0,A,1387893600,"[math, number theory]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Maximum Submatrix 2,1000.0,B,1387893600,"[data structures, dp, implementation, sortings]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Circling Round Treasures,1500.0,C,1387893600,"[bitmasks, shortest paths]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Tree and Queries,2000.0,D,1387893600,"[data structures, dfs and similar, trees]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Red and Black Tree,2500.0,E,1387893600,"[dp, implementation, math]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Lever,500.0,A,1387893600,"[implementation, math]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,I.O.U.,1000.0,B,1387893600,[implementation],PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Divisible by Seven,1500.0,C,1387893600,"[math, number theory]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Maximum Submatrix 2,2000.0,D,1387893600,"[dp, implementation, sortings]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Circling Round Treasures,2500.0,E,1387893600,"[bitmasks, shortest paths]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Pink Pony,500.0,A,1387380600,"[greedy, implementation]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Nine,1000.0,B,1387380600,"[combinatorics, greedy]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Dima,1500.0,C,1387380600,"[dfs and similar, dp, graphs, implementation]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Sequence ,2000.0,D,1387380600,"[binary search, data structures, dp, trees]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Babies,2500.0,E,1387380600,"[binary search, data structures, dsu, geometry, implementation]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Counting Kangaroos is Fun,500.0,A,1386943200,"[binary search, greedy, sortings, two pointers]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Counting Rectangles is Fun,1000.0,B,1386943200,"[brute force, divide and conquer, dp]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Watching Fireworks is Fun,1500.0,C,1386943200,"[data structures, dp, math]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Choosing Subtree is Fun,2000.0,D,1386943200,"[binary search, data structures, dfs and similar, trees, two pointers]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Drawing Circles is Fun,2500.0,E,1386943200,"[combinatorics, geometry]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Collecting Beats is Fun,500.0,A,1386943200,[implementation],PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Making Sequences is Fun,1000.0,B,1386943200,"[binary search, implementation, math]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Counting Kangaroos is Fun,1500.0,C,1386943200,"[greedy, sortings, two pointers]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Counting Rectangles is Fun,2000.0,D,1386943200,[],PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Watching Fireworks is Fun,2500.0,E,1386943200,[dp],PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,K-Periodic Array,500.0,A,1386493200,"[implementation, math]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Fox Dividing Cheese,1000.0,B,1386493200,"[math, number theory]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Hamburgers,1500.0,C,1386493200,"[binary search, brute force]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Vessels,2000.0,D,1386493200,"[data structures, dsu, implementation, trees]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Subway Innovation,2500.0,E,1386493200,"[math, two pointers]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,"Rook, Bishop and King",500.0,A,1386399600,[math],PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Berland Bingo,500.0,B,1386399600,[implementation],PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Mittens,1500.0,C,1386399600,"[constructive algorithms, greedy, sortings]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Broken Monitor,3000.0,D,1386399600,"[brute force, constructive algorithms, implementation]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Summer Reading,3000.0,E,1386399600,"[dp, greedy]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Plates,500.0,A,1385739000,[implementation],PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Contest,1000.0,B,1385739000,"[constructive algorithms, implementation, math]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Elections,1500.0,C,1385739000,"[dfs and similar, graphs, trees]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Fools,2000.0,D,1385739000,"[dfs and similar, dp, shortest paths]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Queries,2500.0,E,1385739000,"[binary search, data structures]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Algorithm ,500.0,A,1385479800,"[data structures, implementation]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja ans Anagrams,1000.0,B,1385479800,"[binary search, data structures]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and the Arrangement of Numbers,1500.0,C,1385479800,"[graphs, greedy, sortings]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Sets,2000.0,D,1385479800,"[bitmasks, dfs and similar]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Intervals,2000.0,E,1385479800,"[combinatorics, dp]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Coat Rack,500.0,A,1385479800,[implementation],PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Suffixes,1000.0,B,1385479800,"[data structures, dp]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Algorithm ,1500.0,C,1385479800,"[brute force, implementation]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja ans Anagrams,2000.0,D,1385479800,"[data structures, two pointers]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and the Arrangement of Numbers,2500.0,E,1385479800,"[combinatorics, graphs, implementation]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Guards,500.0,A,1385307000,[implementation],PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and To-do List,1000.0,B,1385307000,"[brute force, implementation]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Salad,1500.0,C,1385307000,[dp],PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Trap Graph,2000.0,D,1385307000,"[binary search, data structures, dfs and similar, dsu, shortest paths, two pointers]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Magic Guitar,2500.0,E,1385307000,"[brute force, implementation, math]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Matrix,500.0,A,1384875000,"[combinatorics, data structures, implementation]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Free Market,1000.0,B,1384875000,"[dp, greedy]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Beautiful Set,1500.0,C,1384875000,"[brute force, number theory]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Ghd,2000.0,D,1384875000,"[brute force, math, probabilities]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Empty Rectangles,2500.0,E,1384875000,"[divide and conquer, two pointers]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Good Number,500.0,A,1384875000,[implementation],PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,The Fibonacci Segment,1000.0,B,1384875000,[implementation],PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Matrix,1500.0,C,1384875000,"[brute force, combinatorics, math, matrices]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Free Market,2000.0,D,1384875000,"[dp, greedy]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Beautiful Set,2500.0,E,1384875000,"[brute force, number theory]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Two Semiknights Meet,1000.0,A,1384443000,"[greedy, math]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Petya and Staircases,500.0,B,1384443000,"[implementation, sortings]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Insertion Sort,2500.0,C,1384443000,"[data structures, dp, implementation, math]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Fools and Foolproof Roads,3000.0,D,1384443000,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Petya and Pipes,3000.0,E,1384443000,"[flows, graphs, shortest paths]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Soroban,500.0,A,1384156800,[implementation],PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Fence,1000.0,B,1384156800,"[brute force, dp]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Fixing Typos,1500.0,C,1384156800,"[greedy, implementation]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Renting Bikes,2000.0,D,1384156800,"[binary search, greedy]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Two Circles,2500.0,E,1384156800,"[brute force, data structures, implementation]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Array Recovery,500.0,A,1384102800,"[greedy, implementation]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Array,1000.0,B,1384102800,"[binary search, dp]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Strings,1500.0,C,1384102800,"[combinatorics, dp]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Sets,1500.0,D,1384102800,[number theory],PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Game,2000.0,E,1384102800,"[graphs, greedy, shortest paths]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Table,500.0,A,1384102800,"[constructive algorithms, implementation]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Permutation,1000.0,B,1384102800,"[constructive algorithms, math, number theory]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Array Recovery,1500.0,C,1384102800,"[brute force, constructive algorithms, greedy]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Array,2000.0,D,1384102800,"[binary search, dp]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Strings,2500.0,E,1384102800,[],PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Table,500.0,A,1383379200,"[greedy, implementation]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Permutation,1000.0,B,1383379200,"[constructive algorithms, dp, math]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Prime Number,1500.0,C,1383379200,[math],PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Pair of Numbers,2500.0,D,1383379200,"[binary search, brute force, data structures, math, two pointers]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Neatness,2500.0,E,1383379200,[dfs and similar],PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Continuous Line,500.0,A,1382715000,"[brute force, implementation]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Text Messages,1000.0,B,1382715000,"[brute force, strings]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Containers,1500.0,C,1382715000,"[constructive algorithms, greedy, implementation]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Hares,2000.0,D,1382715000,"[dp, greedy]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Kicks,3000.0,E,1382715000,"[brute force, dsu, graphs, implementation]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Knight Tournament,500.0,A,1381838400,"[data structures, dsu]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Xenia and Hamming,1000.0,B,1381838400,"[implementation, math]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Compartments,1500.0,C,1381838400,"[combinatorics, constructive algorithms, greedy, implementation]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Bags and Coins,2000.0,D,1381838400,"[bitmasks, constructive algorithms, dp, greedy]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Xenia and String Problem,2500.0,E,1381838400,"[dp, hashing, implementation, string suffix structures, strings]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Group of Students,500.0,A,1381838400,"[brute force, greedy, implementation]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Flag Day,1000.0,B,1381838400,"[constructive algorithms, implementation]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Knight Tournament,1500.0,C,1381838400,[data structures],PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Xenia and Hamming,2000.0,D,1381838400,[number theory],PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Compartments,2500.0,E,1381838400,[],PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Vasya and Robot,500.0,A,1381678200,"[brute force, greedy, math]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Game with Strings,1000.0,B,1381678200,"[bitmasks, dp, games]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Vasya and Beautiful Arrays,1500.0,C,1381678200,"[brute force, dp, number theory]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Transferring Pyramid,2000.0,D,1381678200,[dp],PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Lucky Number Representation,2500.0,E,1381678200,"[constructive algorithms, dfs and similar, dp]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Digital Root,500.0,A,1381678200,"[constructive algorithms, implementation]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Public Transport,1000.0,B,1381678200,"[greedy, implementation]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Robot,1500.0,C,1381678200,"[brute force, dp]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Game with Strings,2000.0,D,1381678200,[],PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Beautiful Arrays,2500.0,E,1381678200,"[binary search, brute force, data structures]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Domino,500.0,A,1381419000,"[implementation, math]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Two Heaps,1500.0,B,1381419000,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Find Maximum,1000.0,C,1381419000,"[implementation, math, number theory]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Queue,2500.0,D,1381419000,[constructive algorithms],PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Antichain,3000.0,E,1381419000,"[dp, graph matchings, greedy]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Rounding,1000.0,A,1380900600,"[dp, greedy, implementation, math]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Furik,1000.0,B,1380900600,"[combinatorics, dp, probabilities]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Brackets,1500.0,C,1380900600,"[dp, matrices]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Removing Periods,2000.0,D,1380900600,[data structures],PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Permutation,2000.0,E,1380900600,[greedy],PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Digits,500.0,A,1380900600,"[brute force, implementation, math]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Periods,1000.0,B,1380900600,"[implementation, sortings]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Rounding,1500.0,C,1380900600,"[dp, greedy, implementation]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Furik,2000.0,D,1380900600,[math],PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Brackets,2500.0,E,1380900600,[],PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,TL,500.0,A,1380641400,"[brute force, greedy, implementation]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Resort,1000.0,B,1380641400,[graphs],PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Bombs,1000.0,C,1380641400,"[greedy, implementation, sortings]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Looking for Owls,3000.0,D,1380641400,"[binary search, geometry, hashing, sortings]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Wrong Floyd,3000.0,E,1380641400,"[brute force, constructive algorithms, dfs and similar, graphs]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Mafia,500.0,A,1380295800,"[binary search, math, sortings]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Apple Tree,1000.0,B,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Subset Sums,1500.0,C,1380295800,"[brute force, data structures]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Turtles,2000.0,D,1380295800,"[dp, matrices]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Pilgrims,2500.0,E,1380295800,"[dfs and similar, dp, trees]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Cinema Line,500.0,A,1380295800,"[greedy, implementation]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Color the Fence,1000.0,B,1380295800,"[data structures, dp, greedy]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Mafia,1500.0,C,1380295800,[implementation],PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Apple Tree,2000.0,D,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Subset Sums,2500.0,E,1380295800,[],PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Alice and Bob,500.0,A,1379691000,"[games, math, number theory]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Lucky Common Subsequence,1000.0,B,1379691000,"[dp, strings]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Number Transformation II,1500.0,C,1379691000,"[greedy, math]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Robot Control,2000.0,D,1379691000,[shortest paths],PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Doodle Jump,2500.0,E,1379691000,[math],PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Difference Row,500.0,A,1379691000,"[implementation, sortings]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Fixed Points,1000.0,B,1379691000,"[implementation, math]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Alice and Bob,1500.0,C,1379691000,"[games, math, number theory]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Lucky Common Subsequence,2000.0,D,1379691000,"[dp, strings]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Number Transformation II,2500.0,E,1379691000,"[dp, greedy, number theory]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Rational Resistance,500.0,A,1379172600,"[math, number theory]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Alternating Current,1000.0,B,1379172600,"[data structures, greedy, implementation]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Read Time,1500.0,C,1379172600,"[binary search, greedy, two pointers]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Water Tree,2000.0,D,1379172600,"[data structures, dfs and similar, trees]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Pumping Stations,2500.0,E,1379172600,"[brute force, dfs and similar, divide and conquer, flows, greedy]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Magnets,500.0,A,1379172600,[implementation],PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Simple Molecules,1000.0,B,1379172600,"[brute force, math]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Rational Resistance,1500.0,C,1379172600,[math],PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Alternating Current,2000.0,D,1379172600,"[data structures, greedy, implementation]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Read Time,2500.0,E,1379172600,"[binary search, two pointers]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Expecting Trouble,,A,1379086800,"[*special, probabilities]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Triskaidekaphobia,,B,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Counting Fridays,,C,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Chain Letter,,D,1379086800,"[*special, dfs and similar, graphs]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Black Cat Rush,,E,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Superstitions Inspection,,F,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Suffix Subgroup,,G,1379086800,"[*special, strings]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Divisors,500.0,A,1378540800,"[greedy, implementation]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Spies,1000.0,B,1378540800,"[brute force, greedy, implementation]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Cupboard and Balloons,1500.0,C,1378540800,[geometry],PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Dominoes,2000.0,D,1378540800,"[bitmasks, dfs and similar, dp]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Tree,2500.0,E,1378540800,"[data structures, divide and conquer, trees]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,The Wall,500.0,A,1377876600,[math],PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Maximal Area Quadrilateral,3000.0,B,1377876600,"[brute force, geometry]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Tourist Problem,2000.0,C,1377876600,"[combinatorics, implementation, math]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Bubble Sort Graph,2000.0,D,1377876600,"[binary search, data structures, dp]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Iahub and Permutations,3000.0,E,1377876600,"[combinatorics, math]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Tourist Problem,500.0,A,1377876600,[math],PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Bubble Sort Graph,500.0,B,1377876600,"[binary search, data structures, dp]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Iahub and Permutations,1000.0,C,1377876600,"[combinatorics, dp, math]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Iahub and Xors,2500.0,D,1377876600,[data structures],PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Candies Game,3000.0,E,1377876600,"[constructive algorithms, greedy]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Helpful Maths,500.0,A,1377531000,"[greedy, implementation, sortings, strings]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Ringroad,1000.0,B,1377531000,[implementation],PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Weights,1500.0,C,1377531000,"[constructive algorithms, dfs and similar, dp, greedy]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Bit Operations,2000.0,D,1377531000,"[data structures, trees]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Three Swaps,3000.0,E,1377531000,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Puzzles,500.0,A,1376668800,"[dp, graph matchings, greedy]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Routine Problem,1000.0,B,1376668800,"[greedy, math, number theory]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Quiz,1500.0,C,1376668800,"[binary search, greedy, math, matrices, number theory]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Book of Evil,2000.0,D,1376668800,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Divisor Tree,2500.0,E,1376668800,"[brute force, number theory, trees]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Quiz,500.0,A,1376668800,"[greedy, math, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Book of Evil,1000.0,B,1376668800,"[dfs and similar, dp, trees]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Divisor Tree,1500.0,C,1376668800,"[brute force, dp, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,GCD Table,2000.0,D,1376668800,"[chinese remainder theorem, math, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Optimize!,2500.0,E,1376668800,[data structures],PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Triangle,500.0,A,1376062200,"[implementation, math]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Fly,1000.0,B,1376062200,[math],PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Sequence,1500.0,C,1376062200,"[brute force, greedy, implementation, number theory]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Beautiful Strings,2000.0,D,1376062200,"[combinatorics, math]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Painting Square,2500.0,E,1376062200,"[bitmasks, combinatorics, dp, implementation]",PROGRAMMING +326,MemSQL start[c]up Round 2,12,Banana,500.0,A,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Palindrome,1000.0,B,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,More Reclamation,1000.0,C,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Rectangles and Square,2000.0,D,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Counting Skyscrapers,2500.0,E,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,"Buy One, Get One Free",3000.0,F,1375549200,[],PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Banana,500.0,A,1375549200,"[binary search, constructive algorithms, greedy]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Palindrome,1000.0,B,1375549200,"[constructive algorithms, dp]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,More Reclamation,1000.0,C,1375549200,[games],PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Rectangles and Square,2000.0,D,1375549200,"[brute force, dp]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Counting Skyscrapers,2500.0,E,1375549200,"[dp, math, probabilities]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,"Buy One, Get One Free",3000.0,F,1375549200,"[dp, greedy]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Secrets,500.0,A,1374913800,[greedy],PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Chips,1000.0,B,1374913800,[greedy],PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Lucky Tickets,1500.0,C,1374913800,"[brute force, constructive algorithms]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Characteristics of Rectangles,2000.0,D,1374913800,"[binary search, bitmasks, brute force, implementation, sortings]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Summer Earnings,2500.0,E,1374913800,"[binary search, bitmasks, brute force, geometry, sortings]",PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Candy Bags,500.0,A,1374913800,[implementation],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Eight Point Sets,1000.0,B,1374913800,[sortings],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Secrets,1500.0,C,1374913800,[math],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Chips,2000.0,D,1374913800,"[greedy, implementation, two pointers]",PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Lucky Tickets,2500.0,E,1374913800,[],PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Down the Hatch!,500.0,A,1374679800,[implementation],PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Maximum Absurdity,1000.0,B,1374679800,"[data structures, dp, implementation]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Students' Revenge,3000.0,C,1374679800,"[data structures, greedy, sortings]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Theft of Blueprints,3000.0,D,1374679800,"[graphs, math]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Binary Key,3000.0,E,1374679800,"[dp, greedy, implementation]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Purification,500.0,A,1374327000,"[constructive algorithms, greedy]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Biridian Forest,1000.0,B,1374327000,"[dfs and similar, shortest paths]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Graph Reconstruction,1500.0,C,1374327000,[constructive algorithms],PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,The Evil Temple and the Moving Rocks,1500.0,D,1374327000,[constructive algorithms],PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Evil,2500.0,E,1374327000,[math],PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Cakeminator,500.0,A,1374327000,"[brute force, implementation]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Road Construction,1000.0,B,1374327000,"[constructive algorithms, graphs]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Purification,1500.0,C,1374327000,[matrices],PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Biridian Forest,2000.0,D,1374327000,"[dfs and similar, implementation, shortest paths]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Graph Reconstruction,2500.0,E,1374327000,[],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,30.0,A1,1374075000,"[brute force, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,70.0,A2,1374075000,"[data structures, sortings]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,30.0,B1,1374075000,[implementation],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,70.0,B2,1374075000,[data structures],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C1,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C2,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,60.0,C3,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D1,1374075000,"[dfs and similar, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D2,1374075000,[graphs],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,40.0,D3,1374075000,"[data structures, implementation, trees]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E1,1374075000,"[constructive algorithms, graphs, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E2,1374075000,"[constructive algorithms, dp]",PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,30.0,A1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,70.0,A2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,30.0,B1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,70.0,B2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,60.0,C3,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,40.0,D3,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E2,1374043200,[],PROGRAMMING +325,MemSQL start[c]up Round 1,12,Square and Rectangles,500.0,A,1373734800,[implementation],PROGRAMMING +325,MemSQL start[c]up Round 1,12,Stadium and Games,1000.0,B,1373734800,"[binary search, math]",PROGRAMMING +325,MemSQL start[c]up Round 1,12,Monsters and Diamonds,2000.0,C,1373734800,"[dfs and similar, shortest paths]",PROGRAMMING +325,MemSQL start[c]up Round 1,12,Reclamation,2000.0,D,1373734800,[dsu],PROGRAMMING +325,MemSQL start[c]up Round 1,12,The Red Button,2500.0,E,1373734800,"[combinatorics, dfs and similar, dsu, greedy]",PROGRAMMING +328,Testing Round #8,12,IQ Test,500.0,A,1373662800,[implementation],PROGRAMMING +328,Testing Round #8,12,Sheldon and Ice Pieces,500.0,B,1373662800,[greedy],PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Flipping Game,500.0,A,1372941000,"[brute force, dp, implementation]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Hungry Sequence,500.0,B,1372941000,[math],PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Magic Five,1500.0,C,1372941000,"[combinatorics, math]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Block Tower,2000.0,D,1372941000,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Axis Walking,3000.0,E,1372941000,"[bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Robot,500.0,A,1372433400,"[binary search, implementation, math]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Duel,1000.0,B,1372433400,"[dp, flows, greedy]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel the Commander,1500.0,C,1372433400,"[constructive algorithms, dfs and similar, divide and conquer, greedy, trees]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Flipboard,2000.0,D,1372433400,"[dp, greedy, math]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Gondolas,2500.0,E,1372433400,"[data structures, divide and conquer, dp]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Dancing,500.0,A,1372433400,[greedy],PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Flowers,1000.0,B,1372433400,"[combinatorics, math]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Robot,1500.0,C,1372433400,"[implementation, math, number theory]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Duel,2000.0,D,1372433400,"[dp, flows, greedy, two pointers]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel the Commander,2500.0,E,1372433400,[divide and conquer],PROGRAMMING +323,Testing Round #7,12,Black-and-White Cube,500.0,A,1372363200,"[combinatorics, constructive algorithms]",PROGRAMMING +323,Testing Round #7,12,Tournament-graph,1000.0,B,1372363200,[constructive algorithms],PROGRAMMING +323,Testing Round #7,12,Two permutations,1500.0,C,1372363200,[data structures],PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Malek Dance Club,500.0,A,1371992400,"[combinatorics, math]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Psychos in a Line,1000.0,B,1371992400,"[data structures, implementation]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Kalila and Dimna in the Logging Industry,1500.0,C,1371992400,"[dp, geometry]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Have You Ever Heard About the Word?,2500.0,D,1371992400,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Ping-Pong,2500.0,E,1371992400,[data structures],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Magic Numbers,500.0,A,1371992400,"[brute force, greedy]",PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Ping-Pong (Easy Version),1000.0,B,1371992400,"[dfs and similar, graphs]",PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Malek Dance Club,1500.0,C,1371992400,[math],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Psychos in a Line,2000.0,D,1371992400,[data structures],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Kalila and Dimna in the Logging Industry,2500.0,E,1371992400,[dp],PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Perfect Pair,500.0,A,1371223800,[brute force],PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Ants,1000.0,B,1371223800,"[brute force, implementation]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Balance,2500.0,C,1371223800,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Game with Powers,1500.0,D,1371223800,"[dp, games]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Princess and Her Shadow,3000.0,E,1371223800,"[constructive algorithms, shortest paths]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Even Odds,500.0,A,1371223800,[math],PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Strings of Power,500.0,B,1371223800,"[implementation, strings, two pointers]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Perfect Pair,1000.0,C,1371223800,"[greedy, math]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Ants,2500.0,D,1371223800,[dfs and similar],PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Balance,3000.0,E,1371223800,"[constructive algorithms, dfs and similar]",PROGRAMMING +316,ABBYY Cup 3.0,12,Special Task,30.0,A1,1371042000,[greedy],PROGRAMMING +316,ABBYY Cup 3.0,12,Special Task,70.0,A2,1371042000,[math],PROGRAMMING +316,ABBYY Cup 3.0,12,EKG,30.0,B1,1371042000,"[brute force, dfs and similar]",PROGRAMMING +316,ABBYY Cup 3.0,12,EKG,70.0,B2,1371042000,"[dfs and similar, dp]",PROGRAMMING +316,ABBYY Cup 3.0,12,Tidying Up,30.0,C1,1371042000,[flows],PROGRAMMING +316,ABBYY Cup 3.0,12,Tidying Up,70.0,C2,1371042000,"[flows, graph matchings]",PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,30.0,D1,1371042000,"[brute force, dp]",PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,40.0,D2,1371042000,[dp],PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,30.0,D3,1371042000,"[dp, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,30.0,E1,1371042000,"[brute force, data structures]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,40.0,E2,1371042000,"[data structures, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,30.0,E3,1371042000,"[data structures, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F1,1371042000,"[dfs and similar, implementation]",PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,40.0,F2,1371042000,[],PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F3,1371042000,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,30.0,G1,1371042000,"[hashing, strings]",PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,40.0,G2,1371042000,[string suffix structures],PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,30.0,G3,1371042000,[string suffix structures],PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Contest,500.0,A,1370619000,[implementation],PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Periods,1000.0,B,1370619000,"[binary search, dfs and similar, strings]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Subsequences,1500.0,C,1370619000,"[data structures, dp]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Straight Lines,2000.0,D,1370619000,"[binary search, data structures, geometry, sortings, two pointers]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Squares,2500.0,E,1370619000,[dp],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Bottles,500.0,A,1370619000,[brute force],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Array,1000.0,B,1370619000,[implementation],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Contest,1500.0,C,1370619000,"[dp, greedy, implementation]",PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Periods,2000.0,D,1370619000,"[dfs and similar, strings]",PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Subsequences,2500.0,E,1370619000,"[combinatorics, data structures]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Bank Account,500.0,A,1369927800,"[implementation, number theory]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Queries,1000.0,B,1369927800,"[dp, implementation]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Matrix,1500.0,C,1369927800,"[constructive algorithms, greedy, implementation, sortings]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Roads,2500.0,D,1369927800,[dp],PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Two Numbers,2500.0,E,1369927800,"[constructive algorithms, data structures, dsu, greedy]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,The Closest Pair,500.0,A,1369582200,"[constructive algorithms, implementation]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Cats Transport,1000.0,B,1369582200,"[data structures, dp]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Fetch the Treasure,1500.0,C,1369582200,"[brute force, data structures, shortest paths]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Interval Cubing,2000.0,D,1369582200,"[data structures, math]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Biologist,2500.0,E,1369582200,[flows],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Whose sentence is it?,500.0,A,1369582200,[implementation],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Archer,1000.0,B,1369582200,"[math, probabilities]",PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,The Closest Pair,1500.0,C,1369582200,[constructive algorithms],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Cats Transport,2000.0,D,1369582200,[],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Fetch the Treasure,2500.0,E,1369582200,[],PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Strange Addition,500.0,A,1368968400,"[brute force, constructive algorithms]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Continued Fractions,1000.0,B,1368968400,"[brute force, math]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Ivan and Powers of Two,1500.0,C,1368968400,[],PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Olya and Graph,2000.0,D,1368968400,"[combinatorics, math]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Playing with String,2500.0,E,1368968400,[games],PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Morning run,500.0,A,1368803400,"[binary search, math, two pointers]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Context Advertising,500.0,B,1368803400,[two pointers],PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Memory for Arrays,1000.0,C,1368803400,"[binary search, bitmasks, greedy]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Tennis Rackets,2000.0,D,1368803400,"[brute force, geometry]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Sheep,2500.0,E,1368803400,"[binary search, greedy]",PROGRAMMING +308,Croc Champ 2013 - Finals,12,Morning run,500.0,A,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Context Advertising,500.0,B,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Memory for Arrays,1000.0,C,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Tennis Rackets,2000.0,D,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Sheep,2500.0,E,1368784800,[],PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Lucky Permutation Triple,500.0,A,1368363600,"[constructive algorithms, implementation, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Rectangle Puzzle II,500.0,B,1368363600,"[implementation, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Minimum Modular,2000.0,C,1368363600,"[brute force, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Rotatable Number,2500.0,D,1368363600,"[math, number theory]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Random Ranking,3000.0,E,1368363600,[dp],PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Pythagorean Theorem II,500.0,A,1368363600,"[brute force, math]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Calendar,1000.0,B,1368363600,"[brute force, implementation]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Lucky Permutation Triple,1000.0,C,1368363600,[constructive algorithms],PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Rectangle Puzzle II,2000.0,D,1368363600,"[math, ternary search]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Minimum Modular,3000.0,E,1368363600,[math],PROGRAMMING +306,Testing Round #6,12,Candies,500.0,A,1368302400,[implementation],PROGRAMMING +306,Testing Round #6,12,Optimizer,1000.0,B,1368302400,"[data structures, greedy, sortings]",PROGRAMMING +306,Testing Round #6,12,"White, Black and White Again",1500.0,C,1368302400,"[combinatorics, number theory]",PROGRAMMING +306,Testing Round #6,12,Polygon,2000.0,D,1368302400,"[constructive algorithms, geometry]",PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Sequence,500.0,A,1367769900,[constructive algorithms],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Time,1000.0,B,1367769900,"[binary search, graphs, shortest paths]",PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Algorithm,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Divisors,2000.0,D,1367769900,[data structures],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Arrangements,2500.0,E,1367769900,[dp],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Eugeny and Array,500.0,A,1367769900,[implementation],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Eugeny and Play List,1000.0,B,1367769900,"[binary search, implementation, two pointers]",PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Sequence,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Time,2000.0,D,1367769900,"[binary search, dfs and similar, dp, shortest paths]",PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Algorithm,2500.0,E,1367769900,[],PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Array,500.0,A,1366903800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Coach,1000.0,B,1366903800,"[brute force, dfs and similar]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Beautiful Numbers,2000.0,C,1366903800,"[brute force, combinatorics]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Painting Square,3000.0,D,1366903800,"[dp, fft]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Empire Strikes Back,3000.0,E,1366903800,"[binary search, math]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Weird Game,500.0,A,1366644900,"[games, greedy]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Distinct Paths,1500.0,B,1366644900,"[brute force, combinatorics]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Cube Problem,1500.0,C,1366644900,"[brute force, math, number theory]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Ksusha and Square,2000.0,D,1366644900,"[geometry, math, probabilities, two pointers]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Close Vertices,2500.0,E,1366644900,"[data structures, divide and conquer, trees]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha and Array,500.0,A,1366644600,"[brute force, number theory, sortings]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha the Squirrel,1000.0,B,1366644600,"[brute force, implementation]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Weird Game,1500.0,C,1366644600,"[games, greedy]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Distinct Paths,2500.0,D,1366644600,[],PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Cube Problem,2500.0,E,1366644600,[],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Parity Game,500.0,A,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Fish Weight,500.0,B,1366385400,"[constructive algorithms, greedy]",PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Splitting the Uniqueness,2000.0,C,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Color the Carpet,2500.0,D,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Mystic Carvings,3000.0,E,1366385400,[data structures],PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Snow Footprints,500.0,A,1366385400,"[greedy, implementation]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Sail,500.0,B,1366385400,"[brute force, greedy, implementation]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Parity Game,1500.0,C,1366385400,"[combinatorics, constructive algorithms, math, number theory]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Fish Weight,1500.0,D,1366385400,"[greedy, math, sortings]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Splitting the Uniqueness,3000.0,E,1366385400,"[constructive algorithms, sortings]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,SMSC,1000.0,A,1366040100,[implementation],PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Network Topology,1000.0,B,1366040100,"[graphs, implementation]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Beautiful IP Addresses,1500.0,C,1366040100,[brute force],PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Connected Components,2000.0,D,1366040100,"[data structures, dfs and similar, dp, dsu]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Copying Data,2500.0,E,1366040100,[data structures],PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Spyke Talks,500.0,A,1365796800,"[implementation, sortings]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Command Line Arguments,1000.0,B,1365796800,"[implementation, strings]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Network Mask,1500.0,C,1365796800,"[brute force, implementation]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Parallel Programming,2000.0,D,1365796800,[greedy],PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Tree-String Problem,2500.0,E,1365796800,"[dfs and similar, hashing, strings]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Array,500.0,A,1365694200,"[data structures, implementation]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Graph,1000.0,B,1365694200,"[dp, graphs, shortest paths]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Friends,1500.0,C,1365694200,"[combinatorics, dp, graphs, shortest paths]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Caves,2000.0,D,1365694200,"[combinatorics, dp]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Yaroslav and Points,2500.0,E,1365694200,[data structures],PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Yaroslav and Permutations,500.0,A,1365694200,"[greedy, math]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Yaroslav and Two Strings,1500.0,B,1365694200,"[combinatorics, dp]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Array,1500.0,C,1365694200,"[data structures, dp, implementation]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Graph,2000.0,D,1365694200,"[dp, graphs]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Friends,2500.0,E,1365694200,"[combinatorics, dfs and similar, dp]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Oskols,500.0,A,1365348600,"[implementation, math]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Bookshelf,1000.0,B,1365348600,"[dp, greedy]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Lights,1500.0,C,1365348600,"[combinatorics, number theory]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Painter Robot,2000.0,D,1365348600,"[brute force, implementation, number theory]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass the Great,2500.0,E,1365348600,"[dp, trees]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Strings,500.0,A,1364916600,[greedy],PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Houses ,1000.0,B,1364916600,[combinatorics],PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and XOR operation,1500.0,C,1364916600,"[implementation, math]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Trees ,2000.0,D,1364916600,"[combinatorics, dfs and similar, trees]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Lucky Numbers,2500.0,E,1364916600,"[dp, implementation, math]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Segments ,500.0,A,1364916600,"[brute force, implementation]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Matrix,1000.0,B,1364916600,"[brute force, dp, implementation, sortings, ternary search]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Strings,1500.0,C,1364916600,"[constructive algorithms, implementation]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Houses ,2000.0,D,1364916600,"[brute force, combinatorics, dfs and similar, math]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and XOR operation,2500.0,E,1364916600,"[data structures, greedy, implementation, math]",PROGRAMMING +290,April Fools Day Contest 2013,12,Mysterious strings,,A,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,QR code,,B,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,WTF?,,C,1364830200,"[*special, graph matchings, implementation, trees]",PROGRAMMING +290,April Fools Day Contest 2013,12,Orange,,D,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,HQ,,E,1364830200,"[*special, constructive algorithms]",PROGRAMMING +290,April Fools Day Contest 2013,12,Greedy Petya,,F,1364830200,"[*special, dfs and similar, graphs, greedy]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Lucky Permutation,500.0,A,1364025600,"[constructive algorithms, math]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Shifting,1500.0,B,1364025600,[implementation],PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Main Sequence,1500.0,C,1364025600,"[greedy, implementation]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Tourists,2000.0,D,1364025600,"[data structures, sortings]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Ladies' Shop,2500.0,E,1364025600,"[constructive algorithms, fft, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,IQ Test,500.0,A,1364025600,"[brute force, implementation]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Pipeline,1500.0,B,1364025600,"[binary search, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Lucky Permutation,1500.0,C,1364025600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Shifting,2500.0,D,1364025600,[],PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Main Sequence,2500.0,E,1364025600,"[data structures, greedy]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Slightly Decreasing Permutations,500.0,A,1363879800,"[greedy, implementation]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Find Marble,1000.0,B,1363879800,[implementation],PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Building Permutation,1500.0,C,1363879800,"[greedy, implementation, sortings]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Permutation Sum,2000.0,D,1363879800,"[bitmasks, combinatorics, dp, implementation, meet-in-the-middle]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Positions in Permutations,2500.0,E,1363879800,"[combinatorics, dp, math]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cows and Sequence,1000.0,A,1363534200,"[constructive algorithms, implementation]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cow Program,1000.0,B,1363534200,"[dfs and similar, dp, graphs]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Coin Troubles,1500.0,C,1363534200,[dp],PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cows and Cool Sequences,2000.0,D,1363534200,"[dp, math, number theory]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cow Tennis Tournament,2500.0,E,1363534200,"[combinatorics, data structures, math]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Primitive Roots,500.0,A,1363534200,"[implementation, math, number theory]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Poker Game,1000.0,B,1363534200,"[brute force, implementation]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Sequence,2000.0,C,1363534200,"[constructive algorithms, data structures, dp]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cow Program,2000.0,D,1363534200,"[dfs and similar, dp]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Coin Troubles,2500.0,E,1363534200,"[dfs and similar, dp]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Bit++,500.0,A,1363188600,[implementation],PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Painting Eggs,1000.0,B,1363188600,"[greedy, math]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,XOR and OR,1500.0,C,1363188600,"[constructive algorithms, implementation, math]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Yet Another Number Game,2000.0,D,1363188600,"[dp, games]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Sausage Maximization,2500.0,E,1363188600,"[bitmasks, data structures, trees]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Rectangle Puzzle,500.0,A,1362929400,[geometry],PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Maximum Xor Secondary,1000.0,B,1362929400,"[data structures, implementation, two pointers]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Game on Tree,1500.0,C,1362929400,"[implementation, math, probabilities, trees]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,k-Maximum Subsequence Sum,2000.0,D,1362929400,"[data structures, flows]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Sequence Transformation,2500.0,E,1362929400,"[data structures, dp, implementation, math]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Word Capitalization,500.0,A,1362929400,[strings],PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Nearest Fraction,1000.0,B,1362929400,"[brute force, implementation, two pointers]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Rectangle Puzzle,1500.0,C,1362929400,"[geometry, implementation]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Maximum Xor Secondary,2000.0,D,1362929400,[two pointers],PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Game on Tree,2500.0,E,1362929400,[math],PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Point on Spiral,500.0,A,1362411000,"[brute force, geometry, implementation]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Books,1000.0,B,1362411000,"[binary search, brute force, implementation, two pointers]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Ladder,1500.0,C,1362411000,"[dp, implementation, two pointers]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,The Minimum Number of Variables,2000.0,D,1362411000,"[bitmasks, dp]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Beautiful Decomposition,2000.0,E,1362411000,"[games, greedy]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Learning Languages,500.0,A,1362065400,"[dfs and similar, dsu]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Set of Points,1500.0,B,1362065400,"[constructive algorithms, geometry]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Game,2000.0,C,1362065400,"[games, implementation]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Google Code Jam,3000.0,D,1362065400,"[dp, probabilities]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Binary Tree on Plane,2000.0,E,1362065400,[flows],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Circle Line,500.0,A,1362065400,[implementation],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,New Problem,1000.0,B,1362065400,"[brute force, strings]",PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Learning Languages,1000.0,C,1362065400,[dsu],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Set of Points,3000.0,D,1362065400,"[constructive algorithms, geometry]",PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Game,3000.0,E,1362065400,[games],PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Lunch Rush,500.0,A,1361719800,[implementation],PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Game,1000.0,B,1361719800,"[games, greedy]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum Sum,1500.0,C,1361719800,"[data structures, implementation, sortings]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum XOR,2000.0,D,1361719800,"[bitmasks, dp, greedy, implementation, math]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Problem on Trees,2500.0,E,1361719800,"[data structures, trees]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,k-Multiple Free Set,500.0,A,1361374200,"[binary search, greedy, sortings]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Zero Tree,1000.0,B,1361374200,"[dfs and similar, dp, greedy, trees]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,The Last Hole!,1500.0,C,1361374200,"[brute force, geometry]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Lovely Matrix,2000.0,D,1361374200,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Mirror Room,2000.0,E,1361374200,"[data structures, implementation]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Lights Out,500.0,A,1361374200,[implementation],PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Convex Shape,1000.0,B,1361374200,"[constructive algorithms, implementation]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,k-Multiple Free Set,1500.0,C,1361374200,"[binary search, greedy, sortings]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Zero Tree,2000.0,D,1361374200,"[dfs and similar, dp, trees]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,The Last Hole!,2500.0,E,1361374200,[],PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Friends,500.0,A,1360769400,"[implementation, math]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Sequence,1000.0,B,1360769400,"[implementation, math]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Staircase,1500.0,C,1360769400,"[data structures, implementation]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Two Sequences,2000.0,D,1360769400,"[combinatorics, math, sortings]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Horses,2500.0,E,1360769400,"[combinatorics, constructive algorithms, graphs]",PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Staircase,500.0,A,1360769400,[],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Two Sequences,1000.0,B,1360769400,[combinatorics],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Horses,1500.0,C,1360769400,"[graphs, greedy]",PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Figure,2000.0,D,1360769400,[dp],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Game,2500.0,E,1360769400,"[dp, games]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Beautiful Year,500.0,A,1360596600,[brute force],PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Prime Matrix,1000.0,B,1360596600,"[binary search, brute force, math, number theory]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Secret,1500.0,C,1360596600,"[constructive algorithms, implementation]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Good Substrings,2000.0,D,1360596600,"[data structures, strings]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Three Horses,3000.0,E,1360596600,"[constructive algorithms, math, number theory]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Magical Boxes,500.0,A,1359732600,"[greedy, math]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Greenhouse Effect,1000.0,B,1359732600,[dp],PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Flawed Flow,1500.0,C,1359732600,"[constructive algorithms, flows, graphs]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Maximum Waterfall,2000.0,D,1359732600,"[data structures, dp]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,String Theory,2500.0,E,1359732600,[],PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Fancy Fence,500.0,A,1359732600,"[geometry, implementation, math]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Multithreading,1500.0,B,1359732600,"[data structures, greedy, implementation]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Magical Boxes,1500.0,C,1359732600,"[binary search, greedy, implementation, math, sortings]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Greenhouse Effect,2000.0,D,1359732600,[dp],PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Flawed Flow,2500.0,E,1359732600,"[dfs and similar, sortings]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Games,500.0,A,1359387000,[brute force],PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Buttons,1000.0,B,1359387000,"[implementation, math]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Beautiful Sets of Points,1500.0,C,1359387000,"[constructive algorithms, implementation]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Wall Bars,2500.0,D,1359387000,[dp],PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Playlist,2500.0,E,1359387000,"[math, probabilities, sortings]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Stones on the Table,500.0,A,1358868600,[implementation],PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Queue at the School,500.0,B,1358868600,"[constructive algorithms, graph matchings, implementation, shortest paths]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Below the Diagonal,2500.0,C,1358868600,"[constructive algorithms, greedy, math]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,BerDonalds,3000.0,D,1358868600,"[graphs, math, shortest paths]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,More Queries to Array...,3000.0,E,1358868600,"[data structures, math]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Escape from Stones,500.0,A,1358686800,"[constructive algorithms, data structures, implementation, two pointers]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Good Sequences,1000.0,B,1358686800,"[dp, number theory]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Choosing Balls,1500.0,C,1358686800,[dp],PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Colorful Stones,2000.0,D,1358686800,"[dp, two pointers]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Roadside Trees,2500.0,E,1358686800,"[data structures, dp]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Colorful Stones (Simplified Edition),500.0,A,1358686800,[implementation],PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Roadside Trees (Simplified Edition),1000.0,B,1358686800,"[greedy, implementation]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Escape from Stones,1500.0,C,1358686800,"[greedy, implementation]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Good Sequences,2000.0,D,1358686800,"[dp, number theory]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Choosing Balls,2500.0,E,1358686800,"[schedules, sortings]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Beautiful Matrix,500.0,A,1358350200,[implementation],PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Squares,500.0,B,1358350200,"[greedy, implementation, sortings]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Circle of Numbers,2500.0,C,1358350200,"[dfs and similar, implementation]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Cycle in Graph,2000.0,D,1358350200,"[dfs and similar, graphs]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Rhombus,3000.0,E,1358350200,"[brute force, data structures, dp]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Discounts,500.0,A,1358091000,"[greedy, sortings]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Restaurant,1000.0,B,1358091000,"[dp, math, probabilities]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Matrix,1500.0,C,1358091000,"[constructive algorithms, dp, math]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Increasing Subsequence,2000.0,D,1358091000,[dp],PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Calculator,2500.0,E,1358091000,"[brute force, dp, two pointers]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Roma and Lucky Numbers,500.0,A,1358091000,[implementation],PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Roma and Changing Signs,1000.0,B,1358091000,[greedy],PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Discounts,1500.0,C,1358091000,"[greedy, sortings]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Restaurant,2000.0,D,1358091000,"[combinatorics, dp]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Matrix,2500.0,E,1358091000,[dp],PROGRAMMING +267,Codeforces Testing Round #5,12,Subtractions,500.0,A,1358002800,"[math, number theory]",PROGRAMMING +267,Codeforces Testing Round #5,12,Dominoes,1000.0,B,1358002800,"[dfs and similar, graphs]",PROGRAMMING +267,Codeforces Testing Round #5,12,Berland Traffic,1500.0,C,1358002800,"[math, matrices]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Sockets,500.0,A,1357659000,"[greedy, implementation, sortings]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Playing Cubes,500.0,B,1357659000,"[games, greedy, implementation]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,View Angle,1500.0,C,1357659000,"[brute force, geometry, math]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Sum,2000.0,D,1357659000,"[greedy, math]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Greedy Elevator,3000.0,E,1357659000,"[data structures, implementation]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Adding Digits,500.0,A,1356622500,"[implementation, math]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Ancient Prophesy,1000.0,B,1356622500,"[brute force, implementation, strings]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Balls and Boxes,1500.0,C,1356622500,"[greedy, implementation]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Black and White Tree,2000.0,D,1356622500,"[constructive algorithms, dsu, graphs, greedy, trees]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Dividing Kingdom,2500.0,E,1356622500,"[binary search, brute force, data structures]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Bits,500.0,A,1356190200,"[greedy, math]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Elections,1000.0,B,1356190200,"[brute force, combinatorics, dp]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and LCM,1500.0,C,1356190200,"[binary search, combinatorics, dp, math]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Broken Sorting,2000.0,D,1356190200,"[dp, math, probabilities]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Tree,2500.0,E,1356190200,"[data structures, dfs and similar, trees]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Chess,500.0,A,1356190200,"[brute force, strings]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Magic Square,1000.0,B,1356190200,"[brute force, implementation]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Bits,1500.0,C,1356190200,"[greedy, strings]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Elections,2000.0,D,1356190200,"[brute force, combinatorics, dp, math]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and LCM,2500.0,E,1356190200,"[binary search, combinatorics, math]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Almost Arithmetical Progression,500.0,A,1355671800,"[binary search, dp, two pointers]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Mr. Bender and Square,1000.0,B,1355671800,"[binary search, brute force, math]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Furlo and Rublo and Game,1500.0,C,1355671800,[games],PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Liars and Serge,2000.0,D,1355671800,[dp],PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Lucky Arrays,2500.0,E,1355671800,[data structures],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Greg's Workout,500.0,A,1355671800,[implementation],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Code Parsing,1000.0,B,1355671800,[implementation],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Almost Arithmetical Progression,1500.0,C,1355671800,"[brute force, dp]",PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Mr. Bender and Square,2000.0,D,1355671800,"[binary search, implementation, math]",PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Furlo and Rublo and Game,2500.0,E,1355671800,"[games, implementation, math]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Cards with Numbers,500.0,A,1355047200,"[constructive algorithms, sortings]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Jury Size,1000.0,B,1355047200,"[brute force, implementation]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Anagram,1500.0,C,1355047200,[greedy],PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Rats,2000.0,D,1355047200,"[brute force, dfs and similar, implementation]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Dormitory,2500.0,E,1355047200,"[dp, implementation]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Boys and Girls,500.0,A,1354960800,[greedy],PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Physics Practical,1000.0,B,1354960800,"[binary search, dp, two pointers]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Text Editor,1500.0,C,1354960800,"[data structures, dfs and similar, greedy, shortest paths]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Table with Letters - 2,2000.0,D,1354960800,"[brute force, two pointers]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Printer,2500.0,E,1354960800,"[binary search, data structures, implementation, sortings]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Points on Line,500.0,A,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Playing with Permutations,1000.0,B,1354807800,"[implementation, math]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Number Transformation,1500.0,C,1354807800,"[dp, greedy, number theory]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Two Sets,2000.0,D,1354807800,"[bitmasks, math]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Tree and Table,2500.0,E,1354807800,"[dfs and similar, dp, implementation, trees]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Little Xor,500.0,A,1354807800,"[brute force, implementation]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Unsorting Array,1000.0,B,1354807800,"[brute force, sortings]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Points on Line,1500.0,C,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Playing with Permutations,2000.0,D,1354807800,"[brute force, combinatorics, implementation]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Number Transformation,2500.0,E,1354807800,"[dp, number theory]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Paper Work,500.0,A,1353938400,[greedy],PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Restoring IPv6,1000.0,B,1353938400,"[implementation, strings]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Movie Critics,1500.0,C,1353938400,[greedy],PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Building Bridge,1500.0,D,1353938400,"[geometry, ternary search, two pointers]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Mad Joe,2000.0,E,1353938400,[brute force],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Paper Work,500.0,A,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Restoring IPv6,1000.0,B,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Movie Critics,1500.0,C,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Building Bridge,1500.0,D,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Mad Joe,2000.0,E,1353927300,[],PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Cupboards,500.0,A,1353857400,[implementation],PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Chilly Willy,1000.0,B,1353857400,"[math, number theory]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Robo-Footballer,2000.0,C,1353857400,"[binary search, geometry]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Sweets for Everyone!,2000.0,D,1353857400,"[binary search, greedy, implementation]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Piglet's Birthday,2500.0,E,1353857400,"[dp, probabilities]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Robo-Footballer,1000.0,A,1353857400,[geometry],PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Sweets for Everyone!,1000.0,B,1353857400,"[binary search, greedy]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Piglet's Birthday,1500.0,C,1353857400,"[dp, probabilities]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Donkey and Stars,1500.0,D,1353857400,"[data structures, dp, math, sortings]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Endless Matrix,2500.0,E,1353857400,[math],PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Buggy Sorting,500.0,A,1353511800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Increase and Decrease,1000.0,B,1353511800,"[greedy, math]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Beauty Pageant,1500.0,C,1353511800,"[brute force, constructive algorithms, greedy]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Colorful Graph,2000.0,D,1353511800,"[brute force, dfs and similar, graphs]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Blood Cousins Return,2500.0,E,1353511800,"[binary search, data structures, dfs and similar, dp, sortings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,System Administrator,,A,1353339000,[implementation],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Internet Address,,B,1353339000,"[implementation, strings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Game with Coins,,C,1353339000,[greedy],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Restoring Table,,D,1353339000,"[constructive algorithms, greedy]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Mishap in Club,,E,1353339000,[implementation],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Log Stream Analysis,,F,1353339000,"[binary search, brute force, implementation, strings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Suggested Friends,,G,1353339000,"[brute force, graphs]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Queries for Number of Palindromes,,H,1353339000,"[dp, hashing, strings]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,The Brand New Function,500.0,A,1353079800,[bitmasks],PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Hydra,1000.0,B,1353079800,"[graphs, sortings]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Colorado Potato Beetle,1500.0,C,1353079800,"[dfs and similar, implementation]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Cubes,2000.0,D,1353079800,"[data structures, dp, geometry, two pointers]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Matrix,2500.0,E,1353079800,[data structures],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Dividing Orange,500.0,A,1353079800,[implementation],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Undoubtedly Lucky Numbers,1000.0,B,1353079800,"[bitmasks, brute force, dfs and similar]",PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,The Brand New Function,1500.0,C,1353079800,"[bitmasks, divide and conquer, math]",PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Hydra,2000.0,D,1353079800,[],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Colorado Potato Beetle,2500.0,E,1353079800,[],PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Heads or Tails,500.0,A,1352647800,"[brute force, implementation]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Big Segment,1000.0,B,1352647800,"[implementation, sortings]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,King's Path,1500.0,C,1352647800,"[dfs and similar, hashing, shortest paths]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Dispute,2000.0,D,1352647800,"[dfs and similar, greedy]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,XOR on Segment,2500.0,E,1352647800,"[bitmasks, data structures]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Not Wool Sequences,500.0,A,1352044800,"[constructive algorithms, math]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Boring Partition,1000.0,B,1352044800,[constructive algorithms],PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,World Eater Brothers,1500.0,C,1352044800,"[dfs and similar, dp, greedy, trees]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Tape Programming,2000.0,D,1352044800,"[data structures, implementation]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Meeting Her,2500.0,E,1352044800,"[dp, graphs, shortest paths]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Two Bags of Potatoes,500.0,A,1352044800,"[greedy, implementation, math]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Easy Tape Programming,1000.0,B,1352044800,"[brute force, implementation]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Not Wool Sequences,1500.0,C,1352044800,"[combinatorics, constructive algorithms, math]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Boring Partition,2000.0,D,1352044800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,World Eater Brothers,2500.0,E,1352044800,[],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Old Peykan,,A,1351783800,[greedy],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Friends,,B,1351783800,"[binary search, bitmasks, data structures, math]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Mirror Box,,C,1351783800,"[geometry, implementation]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Numbers,,D,1351783800,[],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Flights,,E,1351783800,"[graphs, shortest paths]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Race,,F,1351783800,"[brute force, implementation]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Challenging Balloons,,G,1351783800,[constructive algorithms],PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Free Cash,500.0,A,1351179000,[implementation],PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Young Table,1000.0,B,1351179000,"[implementation, sortings]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Primes on Interval,1500.0,C,1351179000,"[binary search, number theory, two pointers]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,T-decomposition,2000.0,D,1351179000,"[dfs and similar, graphs, greedy]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Build String,2500.0,E,1351179000,"[flows, graphs]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,LCM Challenge,500.0,A,1350803400,[number theory],PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Let's Play Osu!,1000.0,B,1350803400,"[dp, math, probabilities]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Cyclical Quest,1500.0,C,1350803400,"[string suffix structures, strings]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Graph Game,2000.0,D,1350803400,[graphs],PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Number Challenge,2500.0,E,1350803400,"[combinatorics, dp, implementation, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Boy or Girl,500.0,A,1350803400,[implementation],PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Easy Number Challenge,1000.0,B,1350803400,"[implementation, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,LCM Challenge,1500.0,C,1350803400,"[greedy, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Let's Play Osu!,2000.0,D,1350803400,"[dp, probabilities]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Cyclical Quest,2500.0,E,1350803400,[],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Lefthanders and Righthanders ,,A,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Reading,,B,1350370800,[sortings],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Weather,,C,1350370800,"[dp, implementation]",PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Cinema,,D,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Champions' League,,E,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Fence,,F,1350370800,[dp],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Practice,,G,1350370800,"[constructive algorithms, divide and conquer, implementation]",PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Merging Two Decks,,H,1350370800,"[constructive algorithms, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Cinema,,A,1350370800,[implementation],PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Fence,,B,1350370800,[dp],PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Practice,,C,1350370800,"[constructive algorithms, implementation]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Merging Two Decks,,D,1350370800,"[constructive algorithms, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Road Repairs,,E,1350370800,"[dfs and similar, graphs, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,TorCoder,,F,1350370800,[data structures],PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Cycles,500.0,A,1349969400,"[binary search, constructive algorithms, graphs, greedy]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Table,1000.0,B,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Doe Graphs,1500.0,C,1349969400,"[constructive algorithms, divide and conquer, dp, graphs, shortest paths]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Fence,2000.0,D,1349969400,"[binary search, data structures, string suffix structures]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Quick Tortoise,2500.0,E,1349969400,"[bitmasks, divide and conquer, dp]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Perfect Permutation,500.0,A,1349969400,"[implementation, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Non-square Equation,1000.0,B,1349969400,"[binary search, brute force, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Cycles,1500.0,C,1349969400,"[combinatorics, graphs, matrices]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Table,2000.0,D,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Doe Graphs,2500.0,E,1349969400,[],PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Team,500.0,A,1349623800,"[brute force, greedy]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,"Magic, Wizardry and Wonders",1000.0,B,1349623800,"[constructive algorithms, greedy]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,To Add or Not to Add,1500.0,C,1349623800,"[binary search, sortings, two pointers]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Magic Box,2000.0,D,1349623800,"[brute force, geometry]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Cactus,2500.0,E,1349623800,"[data structures, dfs and similar, dp, graphs, trees]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Shifts,500.0,A,1349105400,"[brute force, two pointers]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Planets,500.0,B,1349105400,"[binary search, data structures, shortest paths]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Triangles,1000.0,C,1349105400,"[combinatorics, graphs, math]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Towers,1000.0,D,1349105400,"[dp, greedy, two pointers]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Gifts,3000.0,E,1349105400,"[combinatorics, dp, probabilities]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Dragons,500.0,A,1349105400,"[greedy, sortings]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,T-primes,500.0,B,1349105400,"[implementation, math, number theory]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Shifts,1500.0,C,1349105400,"[binary search, data structures, dp, implementation]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Planets,2500.0,D,1349105400,"[binary search, graphs, shortest paths]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Triangles,3000.0,E,1349105400,"[combinatorics, graphs, math]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Is your horseshoe on the other hoof?,500.0,A,1348759800,[implementation],PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Two Tables,1000.0,B,1348759800,"[brute force, implementation]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Fractal Detector,1500.0,C,1348759800,"[dp, hashing]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Zigzag,2000.0,D,1348759800,[data structures],PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,The Road to Berland is Paved With Good Intentions,2500.0,E,1348759800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Flying Saucer Segments,500.0,A,1348500600,[math],PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Naughty Stone Piles,1000.0,B,1348500600,[greedy],PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Anniversary,1500.0,C,1348500600,"[data structures, implementation, math, matrices, number theory]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,The table,2000.0,D,1348500600,"[constructive algorithms, greedy]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Noble Knight's Path,2500.0,E,1348500600,"[data structures, trees]",PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Where do I Turn?,500.0,A,1348500600,[geometry],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Effective Approach,1000.0,B,1348500600,[implementation],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Flying Saucer Segments,1500.0,C,1348500600,[math],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Naughty Stone Piles,2000.0,D,1348500600,"[math, sortings]",PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Anniversary,2500.0,E,1348500600,"[matrices, number theory]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Dice Tower,500.0,A,1348069500,"[constructive algorithms, greedy]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Well-known Numbers,1000.0,B,1348069500,"[binary search, greedy, number theory]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Barcode,1500.0,C,1348069500,"[dp, matrices]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Snake,3000.0,D,1348069500,"[bitmasks, dfs and similar, graphs, implementation]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Unsolvable,3000.0,E,1348069500,"[math, number theory]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Bracket Sequence,500.0,A,1347809400,"[data structures, expression parsing, implementation]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Two Strings,1000.0,B,1347809400,"[data structures, dp, strings]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Partial Sums,1500.0,C,1347809400,"[combinatorics, math]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Spider,2000.0,D,1347809400,"[geometry, graphs]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Planar Graph,2500.0,E,1347809400,"[flows, geometry, graphs]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Parallelepiped,500.0,A,1347809400,"[brute force, math]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Array,1000.0,B,1347809400,"[bitmasks, implementation, two pointers]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Bracket Sequence,1500.0,C,1347809400,[data structures],PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Two Strings,2000.0,D,1347809400,"[data structures, strings]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Partial Sums,2500.0,E,1347809400,"[combinatorics, math]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Shooshuns and Sequence ,500.0,A,1347291900,"[brute force, implementation]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Cosmic Tables,1000.0,B,1347291900,[implementation],PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Reducing Fractions,1500.0,C,1347291900,"[implementation, number theory, sortings]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Olympiad,2000.0,D,1347291900,"[binary search, greedy, sortings, two pointers]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Decoding Genome,2500.0,E,1347291900,[matrices],PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Problem,500.0,A,1346427000,"[implementation, sortings]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Array,1000.0,B,1346427000,"[constructive algorithms, data structures]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Shifts,1500.0,C,1346427000,[data structures],PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Triangle,2000.0,D,1346427000,"[chinese remainder theorem, geometry, math]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Inversions,2500.0,E,1346427000,"[data structures, two pointers]",PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Function,500.0,A,1346427000,"[implementation, math]",PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Numbers,1000.0,B,1346427000,[implementation],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Problem,1500.0,C,1346427000,[sortings],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Array,2000.0,D,1346427000,[data structures],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Shifts,2500.0,E,1346427000,[],PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,k-String,500.0,A,1346081400,"[implementation, strings]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Special Offer! Super Price 999 Bourles!,1000.0,B,1346081400,[implementation],PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Color Stripe,1500.0,C,1346081400,"[brute force, dp, greedy]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Choosing Capital for Treeland,2000.0,D,1346081400,"[dfs and similar, dp, trees]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Parking Lot,3000.0,E,1346081400,[data structures],PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Ice Skating,500.0,A,1345273500,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Blackboard Fibonacci,1000.0,B,1345273500,"[brute force, math]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Formurosa,2500.0,C,1345273500,"[divide and conquer, dp, expression parsing]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Bitonix' Patrol,3000.0,D,1345273500,"[bitmasks, brute force, combinatorics, dfs and similar, math]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Alien DNA,3000.0,E,1345273500,"[data structures, dsu, trees]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Mountain Scenery,500.0,A,1345273500,"[brute force, constructive algorithms, implementation]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Airport,500.0,B,1345273500,[implementation],PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Ice Skating,1000.0,C,1345273500,"[dfs and similar, dsu, graphs]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Blackboard Fibonacci,3000.0,D,1345273500,[implementation],PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Formurosa,3000.0,E,1345273500,[],PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Tiling with Hexagons,500.0,A,1344958200,"[implementation, math]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Forming Teams,1500.0,B,1344958200,"[dfs and similar, implementation]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Hiring Staff,2000.0,C,1344958200,[greedy],PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Spider's Web,2000.0,D,1344958200,"[binary search, sortings, two pointers]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Martian Luck,3000.0,E,1344958200,"[math, number theory]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Bicycle Chain,500.0,A,1344267000,"[brute force, implementation]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Olympic Medal,500.0,B,1344267000,"[greedy, math]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Crosses,3000.0,C,1344267000,"[brute force, implementation]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Hot Days,2000.0,D,1344267000,[greedy],PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Periodical Numbers,3000.0,E,1344267000,"[combinatorics, dp, number theory]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Game,1000.0,A,1343662200,"[dfs and similar, greedy]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Numbers,1000.0,B,1343662200,"[combinatorics, dp]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Relay Race,1500.0,C,1343662200,[dp],PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Stars,2000.0,D,1343662200,"[constructive algorithms, geometry]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Two Permutations,2500.0,E,1343662200,"[data structures, hashing, strings]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,System of Equations,500.0,A,1343662200,[brute force],PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Hometask,1000.0,B,1343662200,"[brute force, constructive algorithms, greedy, math]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Game,2000.0,C,1343662200,"[brute force, greedy]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Numbers,2000.0,D,1343662200,"[combinatorics, dp, math]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Relay Race,2500.0,E,1343662200,[dp],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Dubstep,500.0,A,1343057400,[strings],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Solitaire,2000.0,B,1343057400,"[dfs and similar, dp]",PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Police Station,2500.0,C,1343057400,"[dp, graphs, shortest paths]",PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,"Prizes, Prizes, more Prizes",500.0,D,1343057400,[implementation],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Blood Cousins,3000.0,E,1343057400,"[binary search, data structures, dfs and similar, trees]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Privatization,3000.0,A,1342450800,"[flows, graphs]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Polycarpus is Looking for Good Substrings,2000.0,B,1342450800,"[bitmasks, hashing, implementation]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Cowboys,1500.0,C,1342450800,"[dp, math]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Cutting a Fence,2500.0,D,1342450800,"[binary search, data structures, dsu]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,IT Restaurants,500.0,E,1342450800,"[dfs and similar, dp, trees]",PROGRAMMING +211,VK Cup 2012 Finals,12,Privatization,3000.0,A,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Polycarpus is Looking for Good Substrings,1000.0,B,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Cowboys,500.0,C,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Cutting a Fence,1000.0,D,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,IT Restaurants,500.0,E,1342335600,[],PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Multicolored Marbles,500.0,A,1342252500,"[dp, math]",PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Pixels,500.0,B,1342252500,"[constructive algorithms, math]",PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Trails and Glades,1000.0,C,1342252500,"[constructive algorithms, dsu, graphs, greedy]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Interval,500.0,A,1342020600,"[binary search, combinatorics, dp]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Cards,500.0,B,1342020600,"[binary search, data structures]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Furik and Rubik,1500.0,C,1342020600,"[math, probabilities]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Retro Strings,2000.0,D,1342020600,[dp],PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Strings,2500.0,E,1342020600,"[data structures, implementation, string suffix structures, two pointers]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Rozdil,500.0,A,1342020600,"[brute force, implementation]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Sorting,1000.0,B,1342020600,"[brute force, greedy]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Interval,1500.0,C,1342020600,"[binary search, brute force, combinatorics, dp, math]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Cards,1500.0,D,1342020600,"[binary search, brute force, sortings]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Furik and Rubik,2500.0,E,1342020600,"[brute force, combinatorics, probabilities]",PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,20.0,A1,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,30.0,A2,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,50.0,A3,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,20.0,B1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,30.0,B2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,50.0,B3,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,20.0,C1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,30.0,C2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,50.0,C3,1341730800,[data structures],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D10,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D3,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D4,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D5,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D6,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D7,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D8,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D9,1341730800,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,20.0,A1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,30.0,A2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,50.0,A3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,20.0,B1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,30.0,B2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,50.0,B3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,20.0,C1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,30.0,C2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,50.0,C3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D10,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D4,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D5,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D6,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D7,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D8,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D9,1341576900,[],PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Two Problems,500.0,A,1341329400,"[brute force, implementation]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Game on Paper,1000.0,B,1341329400,"[brute force, implementation]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Photographer,1500.0,C,1341329400,"[greedy, sortings]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Hit Ball,2000.0,D,1341329400,"[geometry, implementation, math]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Transportation,2500.0,E,1341329400,"[greedy, sortings, two pointers]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Clear Symmetry,1000.0,A,1340983800,"[constructive algorithms, dp, math]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Guess That Car!,1000.0,B,1340983800,"[math, ternary search]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Fragile Bridges,1500.0,C,1340983800,[dp],PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Brand New Problem,2000.0,D,1340983800,"[bitmasks, brute force, dp]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Thoroughly Bureaucratic Organization,2500.0,E,1340983800,"[binary search, combinatorics]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,LLPS,500.0,A,1340983800,"[binary search, bitmasks, brute force, greedy, implementation, strings]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Brand New Easy Problem,1000.0,B,1340983800,[brute force],PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Clear Symmetry,2000.0,C,1340983800,"[binary search, math]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Guess That Car!,2000.0,D,1340983800,"[dp, math]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Fragile Bridges,2500.0,E,1340983800,"[data structures, dp]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Cinema,3000.0,A,1340551800,"[brute force, data structures]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Drinks,500.0,B,1340551800,"[implementation, math]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Football Championship,2000.0,C,1340551800,"[brute force, implementation]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Programming Language,1500.0,D,1340551800,"[binary search, brute force, expression parsing, implementation]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Tractor College,3000.0,E,1340551800,"[implementation, math, number theory, ternary search]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,About Bacteria,500.0,A,1340379000,"[implementation, math]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Jumping on Walls,1000.0,B,1340379000,[shortest paths],PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Delivering Carcinogen,1500.0,C,1340379000,"[binary search, geometry]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Cube Snake,2000.0,D,1340379000,[constructive algorithms],PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Gripping Story,2500.0,E,1340379000,"[binary search, data structures, sortings]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Hexadecimal's theorem,500.0,A,1340379000,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Special Olympics,1000.0,B,1340379000,[geometry],PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,About Bacteria,1500.0,C,1340379000,[math],PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Jumping on Walls,2000.0,D,1340379000,"[dfs and similar, shortest paths]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Delivering Carcinogen,2500.0,E,1340379000,"[binary search, geometry]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Lexicographically Maximum Subsequence,500.0,A,1339506000,[greedy],PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Infinite Maze,1000.0,B,1339506000,[dfs and similar],PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Paint Tree,1500.0,C,1339506000,"[divide and conquer, geometry, sortings, trees]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,The Next Good String,3000.0,D,1339506000,"[data structures, greedy, hashing, strings]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Opening Portals,2500.0,E,1339506000,"[dsu, graphs, shortest paths]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Plate Game,1000.0,A,1339506000,"[constructive algorithms, games, math]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Limit,500.0,B,1339506000,[math],PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Lexicographically Maximum Subsequence,500.0,C,1339506000,"[greedy, implementation, sortings]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Infinite Maze,3000.0,D,1339506000,[hashing],PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Paint Tree,3000.0,E,1339506000,"[constructive algorithms, dfs and similar, geometry]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Let's Watch Football,500.0,A,1339342200,"[binary search, brute force, math]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,After Training,1000.0,B,1339342200,"[data structures, implementation, math]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Try and Catch,1500.0,C,1339342200,"[expression parsing, implementation]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Analyzing Polyline,2000.0,D,1339342200,"[math, sortings]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Building Forest,2500.0,E,1339342200,"[data structures, dsu]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Cutting Figure,500.0,A,1338737400,"[2-sat, chinese remainder theorem, trees]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Xor,1000.0,B,1338737400,[brute force],PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Hamming Distance,2000.0,C,1338737400,"[constructive algorithms, greedy, math, matrices]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Two Segments,2000.0,D,1338737400,[data structures],PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Fibonacci Number,2500.0,E,1338737400,"[brute force, math, matrices]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Exams,500.0,A,1338737400,"[implementation, math]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Square,1000.0,B,1338737400,[math],PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Cutting Figure,1500.0,C,1338737400,"[dfs and similar, graphs, implementation, matrices, strings]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Xor,2000.0,D,1338737400,[],PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Hamming Distance,3000.0,E,1338737400,[math],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Dynasty Puzzles,500.0,A,1338132600,[dp],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Demonstration,1000.0,B,1338132600,[greedy],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Fools and Roads,1500.0,C,1338132600,"[data structures, dfs and similar, trees]",PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Metro Scheme,2000.0,D,1338132600,"[graphs, greedy]",PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Thwarting Demonstrations,2500.0,E,1338132600,"[binary search, data structures, trees]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Funky Numbers,500.0,A,1338132600,"[binary search, brute force, implementation]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Walking in the Rain,1000.0,B,1338132600,"[brute force, implementation]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Dynasty Puzzles,1500.0,C,1338132600,[dp],PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Demonstration,2000.0,D,1338132600,"[brute force, constructive algorithms]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Fools and Roads,2500.0,E,1338132600,"[data structures, trees]",PROGRAMMING +188,Surprise Language Round #6,12,Hexagonal Numbers,,A,1337959800,[*special],PROGRAMMING +188,Surprise Language Round #6,12,A + Reverse B,,B,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,LCM,,C,1337959800,"[*special, implementation, math]",PROGRAMMING +188,Surprise Language Round #6,12,Asterisks,,D,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,HQ9+,,E,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Binary Notation,,F,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Array Sorting,,G,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Stack,,H,1337959800,"[*special, expression parsing, implementation]",PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Vasya and the Bus,500.0,A,1337182200,"[greedy, math]",PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Surrounded,1000.0,B,1337182200,[geometry],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,STL,1500.0,C,1337182200,[dfs and similar],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Non-Secret Cypher,2000.0,D,1337182200,[two pointers],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Counter Attack,2500.0,E,1337182200,"[data structures, dsu, graphs, hashing, sortings]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Permutations,500.0,A,1336663800,[greedy],PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,AlgoRace,1000.0,B,1336663800,"[dp, shortest paths]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Weak Memory,1500.0,C,1336663800,"[dfs and similar, dsu]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,BRT Contract ,2000.0,D,1336663800,[data structures],PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Heaven Tour,2500.0,E,1336663800,"[data structures, greedy]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Cut Ribbon,500.0,A,1336663800,"[brute force, dp]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Counting Rhombi,1000.0,B,1336663800,"[brute force, math]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Permutations,1500.0,C,1336663800,"[greedy, implementation]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,AlgoRace,2000.0,D,1336663800,"[dp, shortest paths]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Weak Memory,2500.0,E,1336663800,"[binary search, shortest paths]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Plant,500.0,A,1336145400,[math],PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Mushroom Scientists,1000.0,B,1336145400,"[math, ternary search]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Clever Fat Rat,1500.0,C,1336145400,[dp],PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Visit of the Great,2000.0,D,1336145400,"[math, number theory]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Soap Time! - 2,2500.0,E,1336145400,"[binary search, data structures]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Comparing Strings,500.0,A,1336145400,"[implementation, strings]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Growing Mushrooms,1000.0,B,1336145400,"[greedy, sortings]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Plant,1500.0,C,1336145400,"[dp, math, matrices, number theory]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Mushroom Scientists,2000.0,D,1336145400,"[math, number theory, probabilities]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Clever Fat Rat,2500.0,E,1336145400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,20.0,A1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,30.0,A2,1335614400,[greedy],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,50.0,A3,1335614400,[greedy],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,20.0,B1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,30.0,B2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,50.0,B3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,20.0,C1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,30.0,C2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,50.0,C3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,20.0,D1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,30.0,D2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,50.0,D3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,20.0,E1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,30.0,E2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,50.0,E3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,20.0,F1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,30.0,F2,1335614400,"[dp, sortings, strings]",PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,50.0,F3,1335614400,[],PROGRAMMING +183,Croc Champ 2012 - Final,12,Headquarters,500.0,A,1335532800,"[constructive algorithms, math]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Zoo,1000.0,B,1335532800,"[brute force, geometry]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Cyclic Coloring,1500.0,C,1335532800,[dfs and similar],PROGRAMMING +183,Croc Champ 2012 - Final,12,T-shirt,2000.0,D,1335532800,"[dp, greedy, probabilities]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Candy Shop,2500.0,E,1335532800,[greedy],PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Battlefield,3000.0,A,1335280200,"[geometry, graphs, implementation, shortest paths]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Vasya's Calendar,500.0,B,1335280200,[implementation],PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Optimal Sum,3000.0,C,1335280200,"[data structures, greedy]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Common Divisors,1000.0,D,1335280200,"[brute force, hashing, implementation, math, strings]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Wooden Fence,1500.0,E,1335280200,[dp],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Defragmentation,,A,1335078000,[implementation],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Divisibility Rules,,B,1335078000,"[math, number theory]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Letter,,C,1335078000,[dp],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Name,,D,1335078000,"[greedy, strings]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Cubes,,E,1335078000,"[binary search, dp, two pointers]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Mathematical Analysis Rocks!,,F,1335078000,"[constructive algorithms, implementation, math]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,30.0,A1,1335016800,[implementation],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,70.0,A2,1335016800,[implementation],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,30.0,B1,1335016800,[number theory],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,70.0,B2,1335016800,[number theory],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Party,30.0,C1,1335016800,"[dfs and similar, dsu, graphs]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Party,70.0,C2,1335016800,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,30.0,D1,1335016800,[brute force],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,70.0,D2,1335016800,[data structures],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Space Voyage,30.0,E1,1335016800,[binary search],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Space Voyage,70.0,E2,1335016800,[binary search],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Script Generation,30.0,F1,1335016800,[],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Script Generation,70.0,F2,1335016800,[],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,30.0,G1,1335016800,[strings],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,70.0,G2,1335016800,"[matrices, strings]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Trading Business,500.0,A,1334934300,"[greedy, sortings]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Word Cut,1000.0,B,1334934300,[dp],PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Playing with Superglue,1500.0,C,1334934300,"[combinatorics, constructive algorithms]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Hyper String,2000.0,D,1334934300,[dp],PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Archaeology,2500.0,E,1334934300,"[data structures, dfs and similar, trees]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Series of Crimes,500.0,A,1334934300,"[brute force, geometry, implementation]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Number of Triplets,1000.0,B,1334934300,"[binary search, brute force]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Trading Business,1500.0,C,1334934300,"[games, graph matchings, greedy]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Word Cut,2000.0,D,1334934300,[dp],PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Playing with Superglue,2500.0,E,1334934300,[games],PROGRAMMING +175,Codeforces Round #115,12,Robot Bicorn Attack,500.0,A,1334390400,"[brute force, implementation]",PROGRAMMING +175,Codeforces Round #115,12,Plane of Tanks: Pro,500.0,B,1334390400,[implementation],PROGRAMMING +175,Codeforces Round #115,12,Geometry Horse,1000.0,C,1334390400,"[greedy, implementation, sortings]",PROGRAMMING +175,Codeforces Round #115,12,Plane of Tanks: Duel,2500.0,D,1334390400,"[brute force, dp, math, probabilities]",PROGRAMMING +175,Codeforces Round #115,12,Power Defence,3000.0,E,1334390400,"[brute force, dp, geometry, greedy]",PROGRAMMING +175,Codeforces Round #115,12,Gnomes of Might and Magic,3000.0,F,1334390400,"[data structures, graphs, implementation, shortest paths]",PROGRAMMING +164,VK Cup 2012 Round 3,12,"Variable, or There and Back Again",500.0,A,1333897500,"[dfs and similar, graphs]",PROGRAMMING +164,VK Cup 2012 Round 3,12,Ancient Berland Hieroglyphs,1000.0,B,1333897500,[two pointers],PROGRAMMING +164,VK Cup 2012 Round 3,12,Machine Programming,1500.0,C,1333897500,[flows],PROGRAMMING +164,VK Cup 2012 Round 3,12,Minimum Diameter,2500.0,D,1333897500,"[binary search, brute force]",PROGRAMMING +164,VK Cup 2012 Round 3,12,Polycarpus and Tasks,2500.0,E,1333897500,[],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Problem About Equation,500.0,A,1333897500,[math],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,File List,1000.0,B,1333897500,"[dp, greedy, implementation]",PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Range Increments,1500.0,C,1333897500,"[data structures, greedy]",PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,"Variable, or There and Back Again",2500.0,D,1333897500,[graphs],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Ancient Berland Hieroglyphs,3000.0,E,1333897500,[],PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Rock-Paper-Scissors,500.0,A,1333724400,"[implementation, math]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Chamber of Secrets,1000.0,B,1333724400,"[dfs and similar, shortest paths]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Spiral Maximum,1500.0,C,1333724400,"[brute force, dp]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Deputies,2000.0,D,1333724400,"[constructive algorithms, graphs, greedy, implementation]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Camping Groups,2500.0,E,1333724400,"[data structures, sortings]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Phone Code,1000.0,A,1333440000,"[brute force, implementation]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Pseudorandom Sequence Period,1000.0,B,1333440000,"[implementation, number theory]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Bus,1500.0,C,1333440000,"[implementation, sortings]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Calendar Reform,1500.0,D,1333440000,[number theory],PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,BHTML+BCSS,2000.0,E,1333440000,"[dfs and similar, expression parsing]",PROGRAMMING +171,April Fools Day Contest,12,Mysterious numbers - 1,,A,1333292400,"[*special, constructive algorithms]",PROGRAMMING +171,April Fools Day Contest,12,Star,,B,1333292400,"[*special, combinatorics]",PROGRAMMING +171,April Fools Day Contest,12,A Piece of Cake,,C,1333292400,"[*special, implementation]",PROGRAMMING +171,April Fools Day Contest,12,Broken checker,,D,1333292400,"[*special, brute force]",PROGRAMMING +171,April Fools Day Contest,12,MYSTERIOUS LANGUAGE,,E,1333292400,[*special],PROGRAMMING +171,April Fools Day Contest,12,ucyhf,,F,1333292400,"[*special, brute force, implementation, number theory]",PROGRAMMING +171,April Fools Day Contest,12,Mysterious numbers - 2,,G,1333292400,[*special],PROGRAMMING +171,April Fools Day Contest,12,A polyline,,H,1333292400,"[*special, implementation]",PROGRAMMING +170,VK Cup 2012 Wild-card Round 2,12,Placing Rectangles,,A,1332954000,[*special],PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Trolleybuses,500.0,A,1332860400,[implementation],PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Huge Prize,1000.0,B,1332860400,"[dp, probabilities]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Numbers,1500.0,C,1332860400,"[games, math]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Roads,2000.0,D,1332860400,"[data structures, divide and conquer, graph matchings]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Bets,2500.0,E,1332860400,"[math, matrices]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Demonstration,500.0,A,1332860400,"[implementation, math]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Minimal Spell,1000.0,B,1332860400,"[implementation, strings]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Trolleybuses,1500.0,C,1332860400,"[implementation, math]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Huge Prize,2000.0,D,1332860400,"[dp, probabilities]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Numbers,2500.0,E,1332860400,[],PROGRAMMING +163,VK Cup 2012 Round 2,12,Substring and Subsequence,1000.0,A,1332687900,[dp],PROGRAMMING +163,VK Cup 2012 Round 2,12,Lemmings,1000.0,B,1332687900,[binary search],PROGRAMMING +163,VK Cup 2012 Round 2,12,Conveyor,1500.0,C,1332687900,[sortings],PROGRAMMING +163,VK Cup 2012 Round 2,12,Large Refrigerator,2000.0,D,1332687900,[brute force],PROGRAMMING +163,VK Cup 2012 Round 2,12,e-Government,2500.0,E,1332687900,"[data structures, dfs and similar, dp, strings, trees]",PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Chores,500.0,A,1332687900,[sortings],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Replacing Digits,1000.0,B,1332687900,[greedy],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Substring and Subsequence,1500.0,C,1332687900,[dp],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Lemmings,2000.0,D,1332687900,[],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Conveyor,2500.0,E,1332687900,[],PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Rank List,500.0,A,1332516600,"[binary search, implementation, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Polygons,3000.0,B,1332516600,"[geometry, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Median,1000.0,C,1332516600,"[greedy, math, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Shoe Store,3000.0,D,1332516600,"[dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Tetrahedron,1000.0,E,1332516600,"[dp, math, matrices]",PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Pentagonal numbers,,A,1332083400,"[*special, implementation]",PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Binary notation,,B,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Prime factorization,,C,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Remove digits,,D,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,HQ9+,,E,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Factorial zeros,,F,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Non-decimal sum,,G,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Alternating case,,H,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Truncatable primes,,I,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Brackets,,J,1332083400,[*special],PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Supercentral Point,500.0,A,1331911800,[implementation],PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Burning Midnight Oil,1000.0,B,1331911800,"[binary search, implementation]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Another Problem on Strings,1500.0,C,1331911800,"[binary search, brute force, dp, math, strings, two pointers]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Beard Graph,2000.0,D,1331911800,"[data structures, dsu, trees]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Compatible Numbers,2500.0,E,1331911800,"[bitmasks, brute force, dfs and similar, dp]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Dress'em in Vests!,1000.0,A,1331478300,"[binary search, brute force, greedy, two pointers]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Discounts,1000.0,B,1331478300,"[constructive algorithms, greedy, sortings]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Abracadabra,2000.0,C,1331478300,[divide and conquer],PROGRAMMING +161,VK Cup 2012 Round 1,12,Distance in Tree,2000.0,D,1331478300,"[dfs and similar, dp, trees]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Polycarpus the Safecracker,2500.0,E,1331478300,"[brute force, dp]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Friends or Not,500.0,A,1331280000,"[*special, greedy, implementation]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Matchmaker,1000.0,B,1331280000,"[greedy, sortings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,String Manipulation 1.0,1500.0,C,1331280000,"[binary search, brute force, data structures, strings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Palindrome pairs,2000.0,D,1331280000,"[*special, brute force, dp, strings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Zebra Tower,2500.0,E,1331280000,"[data structures, greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Twins,500.0,A,1331046000,"[greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Unlucky Ticket,1000.0,B,1331046000,"[greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Find Pair,1500.0,C,1331046000,"[implementation, math, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Edges in MST,2000.0,D,1331046000,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Buses and People,2500.0,E,1331046000,"[binary search, data structures, sortings]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Next Round,500.0,A,1330804800,[implementation],PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Taxi,1000.0,B,1330804800,"[greedy, implementation]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Cd and pwd commands,1000.0,C,1330804800,"[data structures, implementation]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Ice Sculptures,1500.0,D,1330804800,"[brute force, number theory]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Phone Talks,2000.0,E,1330804800,"[dp, sortings]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Message,500.0,A,1330536600,[brute force],PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Suspects,1000.0,B,1330536600,"[constructive algorithms, data structures, implementation]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Cipher,1500.0,C,1330536600,"[combinatorics, dp]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Clues,2500.0,D,1330536600,"[combinatorics, graphs]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Mrs. Hudson's Pancakes,2500.0,E,1330536600,"[brute force, dp]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Game Outcome,500.0,A,1330536600,[brute force],PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Trace,1000.0,B,1330536600,"[geometry, sortings]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Message,1500.0,C,1330536600,"[brute force, dp, strings]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Suspects,2000.0,D,1330536600,[implementation],PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Cipher,2500.0,E,1330536600,"[dp, math]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Hometask,500.0,A,1330095600,[greedy],PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Colliders,1000.0,B,1330095600,"[math, number theory]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Double Profiles,1500.0,C,1330095600,"[graphs, hashing, sortings]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Flatland Fencing,2000.0,D,1330095600,"[games, math]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Martian Colony,2500.0,E,1330095600,[geometry],PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,I_love_\%username\%,500.0,A,1330095600,[brute force],PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Combination,1000.0,B,1330095600,"[greedy, sortings]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Hometask,1500.0,C,1330095600,"[dp, greedy]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Colliders,2000.0,D,1330095600,"[math, number theory]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Double Profiles,2500.0,E,1330095600,"[hashing, sortings]",PROGRAMMING +153,Surprise Language Round #5,12,A + B,,A,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Binary notation,,B,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Caesar Cipher,,C,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Date Change,,D,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Euclidean Distance,,E,1329922800,[*special],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Marks,500.0,A,1329750000,[implementation],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Steps,1000.0,B,1329750000,"[binary search, implementation]",PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Pocket Book,1500.0,C,1329750000,[combinatorics],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Frames,2500.0,D,1329750000,[brute force],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Garden,2500.0,E,1329750000,"[bitmasks, dp, graphs, trees]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Win or Freeze,500.0,A,1329490800,"[games, number theory]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Quantity of Strings,500.0,B,1329490800,"[combinatorics, dfs and similar, math]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Smart Cheater,1000.0,C,1329490800,"[data structures, math, probabilities]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Mission Impassable,1500.0,D,1329490800,[dp],PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Freezing with Style,3000.0,E,1329490800,"[binary search, data structures, divide and conquer, trees]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Soft Drinking,500.0,A,1329490800,"[implementation, math]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Phone Numbers,1000.0,B,1329490800,"[implementation, strings]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Win or Freeze,1500.0,C,1329490800,"[games, greedy, number theory]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Quantity of Strings,1500.0,D,1329490800,"[combinatorics, dsu]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Smart Cheater,3000.0,E,1329490800,[],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Business trip,500.0,A,1328886000,"[greedy, implementation, sortings]",PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Martian Clock,1000.0,B,1328886000,[implementation],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Division into Teams,1500.0,C,1328886000,"[greedy, math, sortings]",PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Coloring Brackets,2500.0,D,1328886000,[dp],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Martian Strings,2500.0,E,1328886000,"[string suffix structures, strings]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Insomnia cure,1000.0,A,1328198400,"[constructive algorithms, implementation, math]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Escape,1000.0,B,1328198400,"[implementation, math]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Terse princess,1000.0,C,1328198400,"[constructive algorithms, greedy]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Bag of mice,1000.0,D,1328198400,"[dp, games, math, probabilities]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Porcelain,1000.0,E,1328198400,[dp],PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Conversion,500.0,A,1327215600,"[greedy, implementation]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Number 2,1000.0,B,1327215600,[constructive algorithms],PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Subsequence,1500.0,C,1327215600,"[combinatorics, dp, math]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Pair,2500.0,D,1327215600,"[combinatorics, data structures, implementation]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Queries,2500.0,E,1327215600,[data structures],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Ticket,500.0,A,1327215600,[implementation],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Mask,1000.0,B,1327215600,"[brute force, implementation]",PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Conversion,1500.0,C,1327215600,[greedy],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Number 2,2000.0,D,1327215600,"[brute force, constructive algorithms, implementation]",PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Subsequence,2500.0,E,1327215600,"[combinatorics, dp]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Arrival of the General,500.0,A,1326899100,[implementation],PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Meeting,1000.0,B,1326899100,[implementation],PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Anagram Search,1500.0,C,1326899100,"[implementation, strings]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Missile Silos,2000.0,D,1326899100,"[data structures, dfs and similar, graphs, shortest paths]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Competition,2500.0,E,1326899100,"[data structures, greedy]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Farmer,500.0,A,1326380700,"[brute force, math]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help General,1000.0,B,1326380700,"[constructive algorithms, greedy, implementation]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Caretaker,1500.0,C,1326380700,"[brute force, dp]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Shrek and Donkey 2,2000.0,D,1326380700,[games],PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Greg the Dwarf 2,2500.0,E,1326380700,[geometry],PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Vasilisa the Wise 2,500.0,A,1326380700,"[brute force, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Kingdom of Far Far Away 2,1000.0,B,1326380700,"[implementation, strings]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Farmer,1500.0,C,1326380700,"[implementation, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help General,2000.0,D,1326380700,"[graph matchings, greedy, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Caretaker,2500.0,E,1326380700,[],PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Amusing Joke,500.0,A,1326034800,"[implementation, sortings, strings]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Hopscotch,1000.0,B,1326034800,"[geometry, math]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Queue,2000.0,C,1326034800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Take-off Ramps,2000.0,D,1326034800,"[graphs, shortest paths]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Clearing Up,2500.0,E,1326034800,"[constructive algorithms, dp, dsu, graphs]",PROGRAMMING +140,Codeforces Round #100,12,New Year Table,500.0,A,1325689200,"[geometry, math]",PROGRAMMING +140,Codeforces Round #100,12,New Year Cards,1000.0,B,1325689200,"[brute force, greedy, implementation]",PROGRAMMING +140,Codeforces Round #100,12,New Year Snowmen,1500.0,C,1325689200,"[binary search, data structures, greedy]",PROGRAMMING +140,Codeforces Round #100,12,New Year Contest,2000.0,D,1325689200,"[greedy, sortings]",PROGRAMMING +140,Codeforces Round #100,12,New Year Garland,2500.0,E,1325689200,"[combinatorics, dp]",PROGRAMMING +140,Codeforces Round #100,12,New Year Snowflake,3000.0,F,1325689200,"[geometry, sortings]",PROGRAMMING +147,Codeforces Testing Round #4,12,Punctuation,500.0,A,1325602800,"[implementation, strings]",PROGRAMMING +147,Codeforces Testing Round #4,12,Smile House,1000.0,B,1325602800,"[binary search, graphs, matrices]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Literature Lesson,500.0,A,1324728000,[implementation],PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Digits Permutations,1000.0,B,1324728000,[greedy],PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Mushroom Gnomes - 2,2000.0,C,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,World of Darkraft,2000.0,D,1324728000,"[dp, games]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Hellish Constraints,2500.0,E,1324728000,"[brute force, dp, two pointers]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Petr and Book,500.0,A,1324728000,[implementation],PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Wallpaper,1000.0,B,1324728000,"[implementation, math]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Literature Lesson,1500.0,C,1324728000,"[implementation, strings]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Digits Permutations,2000.0,D,1324728000,[implementation],PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Mushroom Gnomes - 2,3000.0,E,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Postcards and photos,500.0,A,1324015200,[implementation],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Permutation,1000.0,B,1324015200,[greedy],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,History,1500.0,C,1324015200,[sortings],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Palindromes,2000.0,D,1324015200,[dp],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Last Chance,2500.0,E,1324015200,"[data structures, implementation]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Replacement,500.0,A,1323443100,"[implementation, sortings]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Rectangle and Square,1000.0,B,1323443100,"[brute force, geometry, math]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Zero-One,1500.0,C,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Cycle,2000.0,D,1323443100,"[brute force, dfs and similar, implementation]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Weak Subsequence,2500.0,E,1323443100,[combinatorics],PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Presents,500.0,A,1323443100,[implementation],PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Ternary Logic,1000.0,B,1323443100,"[implementation, math]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Replacement,1500.0,C,1323443100,"[implementation, sortings]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Rectangle and Square,2000.0,D,1323443100,"[geometry, implementation]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Zero-One,2500.0,E,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Turing Tape,500.0,A,1322924400,[implementation],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Piet,1500.0,B,1322924400,[implementation],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Logo Turtle,1500.0,C,1322924400,[dp],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Constants in the language of Shakespeare,2000.0,D,1322924400,"[constructive algorithms, dp, greedy]",PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Bits of merry old England,2500.0,E,1322924400,[flows],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,HQ9+,500.0,A,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Unary,1000.0,B,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Turing Tape,1500.0,C,1322924400,"[implementation, math]",PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Piet,2500.0,D,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Logo Turtle,2500.0,E,1322924400,"[dp, implementation]",PROGRAMMING +134,Codeforces Testing Round #3,12,Average Numbers,500.0,A,1322838000,"[brute force, implementation]",PROGRAMMING +134,Codeforces Testing Round #3,12,Pairs of Numbers,1000.0,B,1322838000,"[brute force, dfs and similar, math, number theory]",PROGRAMMING +134,Codeforces Testing Round #3,12,Swaps,1500.0,C,1322838000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,cAPS lOCK,500.0,A,1322233200,"[implementation, strings]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Opposites Attract,1000.0,B,1322233200,"[implementation, math]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,The World is a Theatre,1500.0,C,1322233200,"[combinatorics, math]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Subway,2000.0,D,1322233200,"[dfs and similar, graphs]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Yet Another Task with Queens,2500.0,E,1322233200,[sortings],PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Present to Mom,2500.0,F,1322233200,"[binary search, two pointers]",PROGRAMMING +130,Unknown Language Round #4,12,Hexagonal numbers,,A,1321801200,"[*special, implementation]",PROGRAMMING +130,Unknown Language Round #4,12,Gnikool Ssalg,,B,1321801200,"[*special, implementation, strings]",PROGRAMMING +130,Unknown Language Round #4,12,Decimal sum,,C,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Exponentiation,,D,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Tribonacci numbers,,E,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Prime factorization,,F,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,CAPS LOCK ON,,G,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Balanced brackets,,H,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Array sorting,,I,1321801200,"[*special, sortings]",PROGRAMMING +130,Unknown Language Round #4,12,Date calculation,,J,1321801200,[*special],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Statues,1000.0,A,1321337400,[dfs and similar],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,String,1500.0,B,1321337400,"[brute force, constructive algorithms, hashing, string suffix structures, strings]",PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Games with Rectangle,1500.0,C,1321337400,"[combinatorics, dp]",PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Numbers,2000.0,D,1321337400,[constructive algorithms],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Birthday,2500.0,E,1321337400,"[geometry, math]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Cookies,500.0,A,1321337400,[implementation],PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Students and Shoelaces,1000.0,B,1321337400,"[brute force, dfs and similar, graphs]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Statues,2000.0,C,1321337400,"[dfs and similar, graphs, implementation]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,String,2500.0,D,1321337400,"[implementation, string suffix structures, strings]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Games with Rectangle,2500.0,E,1321337400,"[combinatorics, dp]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Hot Bath,500.0,A,1320858000,"[binary search, brute force, math]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Password,1000.0,B,1320858000,"[binary search, dp, hashing, string suffix structures, strings]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,E-reader Display,1500.0,C,1320858000,"[constructive algorithms, greedy]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Fibonacci Sums,2000.0,D,1320858000,"[dp, math]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Pills,2500.0,E,1320858000,"[brute force, flows]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Wasted Time,500.0,A,1320858000,[geometry],PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Canvas Frames,1000.0,B,1320858000,[implementation],PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Hot Bath,1500.0,C,1320858000,"[binary search, math]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Password,2000.0,D,1320858000,"[hashing, strings]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,E-reader Display,2500.0,E,1320858000,[implementation],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Prime Permutation,1000.0,A,1320333000,"[implementation, number theory, strings]",PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Squares,1000.0,B,1320333000,[math],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Brackets,1500.0,C,1320333000,"[combinatorics, dp, greedy]",PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,String,2000.0,D,1320333000,[string suffix structures],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Maze,2500.0,E,1320333000,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,The number of positions,500.0,A,1320333000,[math],PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Permutations,1000.0,B,1320333000,"[brute force, combinatorics, implementation]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Prime Permutation,2000.0,C,1320333000,"[constructive algorithms, dfs and similar, dsu, greedy, number theory, sortings, strings]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Squares,2000.0,D,1320333000,"[brute force, constructive algorithms, number theory]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Brackets,2500.0,E,1320333000,[],PROGRAMMING +125,Codeforces Testing Round #2,12,Measuring Lengths in Baden,1000.0,A,1319893200,[math],PROGRAMMING +125,Codeforces Testing Round #2,12,Simple XML,1500.0,B,1319893200,[implementation],PROGRAMMING +125,Codeforces Testing Round #2,12,Hobbits' Party,2000.0,C,1319893200,"[constructive algorithms, greedy]",PROGRAMMING +125,Codeforces Testing Round #2,12,Two progressions,3000.0,D,1319893200,"[constructive algorithms, greedy]",PROGRAMMING +125,Codeforces Testing Round #2,12,MST Company,5000.0,E,1319893200,"[binary search, graphs]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Sum,500.0,A,1319727600,[implementation],PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Transformation,1000.0,B,1319727600,[strings],PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Permutation,1500.0,C,1319727600,"[brute force, combinatorics, number theory]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Segments,2000.0,D,1319727600,"[binary search, implementation, two pointers]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Array,2500.0,E,1319727600,[data structures],PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Division,500.0,A,1319727600,"[brute force, number theory]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Substring,1000.0,B,1319727600,"[brute force, implementation]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Sum,1500.0,C,1319727600,"[brute force, math]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Transformation,2000.0,D,1319727600,[brute force],PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Permutation,2500.0,E,1319727600,[],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Elevator,,A,1318919400,"[brute force, implementation, math]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Quiz League,,B,1318919400,[implementation],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Winnie-the-Pooh and honey,,C,1318919400,"[implementation, math]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Three Sons,,D,1318919400,[brute force],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Put Knight!,,E,1318919400,[games],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Spiders,,F,1318919400,"[dp, greedy, trees]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Boom,,G,1318919400,[implementation],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Brevity is Soul of Wit,,H,1318919400,[graph matchings],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Luck is in Numbers,,I,1318919400,[greedy],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Minimum Sum,,J,1318919400,"[divide and conquer, geometry, sortings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Epic Game,500.0,A,1318604400,[implementation],PROGRAMMING +119,Codeforces Beta Round #90,12,Before Exam,1000.0,B,1318604400,"[constructive algorithms, implementation, sortings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Education Reform,1500.0,C,1318604400,[dp],PROGRAMMING +119,Codeforces Beta Round #90,12,String Transformation,2000.0,D,1318604400,"[hashing, strings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Alternative Reality,2500.0,E,1318604400,[geometry],PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,String Task,500.0,A,1317999600,"[implementation, strings]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Present from Lena,1000.0,B,1317999600,"[constructive algorithms, implementation]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Fancy Number,1500.0,C,1317999600,"[brute force, greedy, sortings, strings]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Caesar's Legions,2000.0,D,1317999600,[dp],PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Bertown roads,2500.0,E,1317999600,"[dfs and similar, graphs]",PROGRAMMING +117,Codeforces Beta Round #88,12,Elevator,500.0,A,1316790000,"[implementation, math]",PROGRAMMING +117,Codeforces Beta Round #88,12,Very Interesting Game,1000.0,B,1316790000,"[brute force, number theory]",PROGRAMMING +117,Codeforces Beta Round #88,12,Cycle,1500.0,C,1316790000,"[dfs and similar, graphs]",PROGRAMMING +117,Codeforces Beta Round #88,12,Not Quick Transformation,2000.0,D,1316790000,"[divide and conquer, math]",PROGRAMMING +117,Codeforces Beta Round #88,12,Tree or not Tree,2500.0,E,1316790000,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Party,500.0,A,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Lawnmower,1000.0,B,1316098800,"[greedy, sortings]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Plumber,1500.0,C,1316098800,[math],PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Unambiguous Arithmetic Expression,2000.0,D,1316098800,"[dp, expression parsing]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Linear Kingdom Races,2500.0,E,1316098800,"[data structures, dp]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Tram,500.0,A,1316098800,[implementation],PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Little Pigs and Wolves,1000.0,B,1316098800,"[greedy, implementation]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Party,1500.0,C,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Lawnmower,2000.0,D,1316098800,"[dp, greedy]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Plumber,2500.0,E,1316098800,[],PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Grammar Lessons,500.0,A,1315494000,"[implementation, strings]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Petr#,1000.0,B,1315494000,"[brute force, data structures, hashing, strings]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Double Happiness,1500.0,C,1315494000,"[brute force, number theory]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Museum,2000.0,D,1315494000,"[matrices, probabilities]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Sleeping,2500.0,E,1315494000,"[combinatorics, implementation, math]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Cifera,500.0,A,1315494000,[math],PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,PFAST Inc.,1000.0,B,1315494000,"[bitmasks, brute force]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Grammar Lessons,1500.0,C,1315494000,[implementation],PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Petr#,2000.0,D,1315494000,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Double Happiness,2500.0,E,1315494000,[number theory],PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Inequiations,500.0,A,1315051200,[greedy],PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Divisors,1000.0,B,1315051200,"[binary search, data structures, number theory]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Spiders,1500.0,C,1315051200,"[bitmasks, dp, dsu]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Coloring,2000.0,D,1315051200,"[combinatorics, dp]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Rectangle,2500.0,E,1315051200,[],PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Strings,500.0,A,1315051200,"[implementation, strings]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Square,1000.0,B,1315051200,"[implementation, math]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Inequiations,1500.0,C,1315051200,"[greedy, math]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Divisors,2000.0,D,1315051200,"[implementation, number theory]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Spiders,2500.0,E,1315051200,"[bitmasks, dp]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sum of Digits,500.0,A,1314633600,"[brute force, implementation]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Probability,1000.0,B,1314633600,"[brute force, probabilities]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Tree,1500.0,C,1314633600,"[dp, dsu, trees]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sorting,2000.0,D,1314633600,"[constructive algorithms, sortings]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Interval,2500.0,E,1314633600,"[brute force, math]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Nearly Lucky Number,500.0,A,1314633600,[implementation],PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky String,1000.0,B,1314633600,"[constructive algorithms, strings]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Sum of Digits,1500.0,C,1314633600,"[implementation, math]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Probability,2000.0,D,1314633600,"[brute force, combinatorics, dfs and similar, probabilities]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Tree,2500.0,E,1314633600,"[combinatorics, dfs and similar, trees]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Dorm Water Supply,500.0,A,1314111600,"[dfs and similar, graphs]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Basketball Team,1000.0,B,1314111600,"[combinatorics, dp, probabilities]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Arrangement,1500.0,C,1314111600,"[bitmasks, dp]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Crime Management,2000.0,D,1314111600,"[dp, matrices]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Darts,2500.0,E,1314111600,"[geometry, probabilities]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Palindromic Times,500.0,A,1314111600,"[implementation, strings]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Datatypes,1000.0,B,1314111600,"[math, sortings]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Dorm Water Supply,1500.0,C,1314111600,"[dfs and similar, implementation]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Basketball Team,2000.0,D,1314111600,"[combinatorics, math, probabilities]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Arrangement,2500.0,E,1314111600,[],PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Card Game,500.0,A,1313766000,[implementation],PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Choosing Laptop,1000.0,B,1313766000,"[brute force, implementation]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Buns,1500.0,C,1313766000,"[chinese remainder theorem, geometry]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Treasure Island,2000.0,D,1313766000,"[brute force, implementation]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Space Rescuers,2500.0,E,1313766000,"[geometry, ternary search]",PROGRAMMING +105,Codeforces Beta Round #81,12,Transmigration,500.0,A,1313247600,[implementation],PROGRAMMING +105,Codeforces Beta Round #81,12,Dark Assembly,1000.0,B,1313247600,"[brute force, probabilities]",PROGRAMMING +105,Codeforces Beta Round #81,12,Item World,1500.0,C,1313247600,"[brute force, implementation, sortings]",PROGRAMMING +105,Codeforces Beta Round #81,12,Entertaining Geodetics,2000.0,D,1313247600,"[brute force, dsu, implementation]",PROGRAMMING +105,Codeforces Beta Round #81,12,Lift and Throw,2500.0,E,1313247600,[brute force],PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Testing Pants for Sadness,500.0,A,1312714800,"[greedy, implementation, math]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Cthulhu,1000.0,B,1312714800,"[dfs and similar, dsu, graphs]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Russian Roulette,1500.0,C,1312714800,"[constructive algorithms, greedy]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Time to Raid Cowavans,2000.0,D,1312714800,"[brute force, data structures, sortings]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Buying Sets,2500.0,E,1312714800,"[flows, graph matchings]",PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Blackjack,500.0,A,1312714800,[implementation],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Testing Pants for Sadness,1000.0,B,1312714800,[math],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Cthulhu,1500.0,C,1312714800,"[dsu, trees]",PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Russian Roulette,2000.0,D,1312714800,[math],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Time to Raid Cowavans,2500.0,E,1312714800,[],PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Homework,500.0,A,1312390800,[greedy],PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Buses,1000.0,B,1312390800,"[binary search, data structures, dp]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Vectors,1500.0,C,1312390800,"[implementation, math]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Castle,2000.0,D,1312390800,"[dp, greedy, probabilities, sortings, trees]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Candies and Stones,2500.0,E,1312390800,"[divide and conquer, dp]",PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Clothes,500.0,A,1312390800,[brute force],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Sum of Digits,1000.0,B,1312390800,[implementation],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Homework,1500.0,C,1312390800,[greedy],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Buses,2000.0,D,1312390800,"[binary search, data structures, dp]",PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Vectors,2500.0,E,1312390800,[],PROGRAMMING +100,Unknown Language Round #3,12,Carpeting the Room,,A,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Friendly Numbers,,B,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,A+B,,C,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,World of Mouth,,D,1312005600,"[*special, strings]",PROGRAMMING +100,Unknown Language Round #3,12,Lamps in a Line,,E,1312005600,"[*special, math]",PROGRAMMING +100,Unknown Language Round #3,12,Polynom,,F,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Name the album,,G,1312005600,"[*special, data structures, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Battleship,,H,1312005600,"[*special, dfs and similar, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Rotation,,I,1312005600,"[*special, geometry, math]",PROGRAMMING +100,Unknown Language Round #3,12,Interval Coloring,,J,1312005600,"[*special, greedy, math]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Victoria the Wise,500.0,A,1311346800,"[brute force, implementation]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help King,1000.0,B,1311346800,"[implementation, probabilities, trees]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Greg the Dwarf,1500.0,C,1311346800,"[geometry, ternary search]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Monks,2000.0,D,1311346800,[constructive algorithms],PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Shrek and Donkey,2500.0,E,1311346800,"[dp, games, math, probabilities]",PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Far Away Kingdom,500.0,A,1311346800,[strings],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Chef Gerasim,1000.0,B,1311346800,"[implementation, sortings]",PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Victoria the Wise,1500.0,C,1311346800,[brute force],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help King,2000.0,D,1311346800,[],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Greg the Dwarf,2500.0,E,1311346800,"[binary search, geometry, ternary search]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Domino,500.0,A,1310731200,"[brute force, implementation]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Superset,1500.0,B,1310731200,"[constructive algorithms, divide and conquer]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Winning Strategy,2000.0,C,1310731200,"[binary search, graphs, math, shortest paths]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Robot in Basement,2000.0,D,1310731200,"[bitmasks, brute force, implementation]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Leaders,2500.0,E,1310731200,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Hockey,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Numbers,1000.0,B,1310137200,"[dp, greedy]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Volleyball,1500.0,C,1310137200,[shortest paths],PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Horse Races,2000.0,D,1310137200,"[dp, math]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Country,2500.0,E,1310137200,"[dp, dsu, graphs]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Football,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Lucky Numbers (easy),1000.0,B,1310137200,"[binary search, bitmasks, brute force]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Hockey,1500.0,C,1310137200,"[implementation, strings]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Volleyball,2000.0,D,1310137200,"[graphs, shortest paths]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Horse Races,2500.0,E,1310137200,[],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Frames,500.0,A,1309446000,[implementation],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,End of Exams,1000.0,B,1309446000,[greedy],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Azembler,1500.0,C,1309446000,"[brute force, implementation]",PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Flags,2000.0,D,1309446000,"[dp, math, matrices]",PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Lostborn,2500.0,E,1309446000,"[dp, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Restoring Password,500.0,A,1309446000,"[implementation, strings]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Friends,1000.0,B,1309446000,"[implementation, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Frames,1500.0,C,1309446000,[math],PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,End of Exams,2000.0,D,1309446000,"[greedy, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Azembler,2500.0,E,1309446000,[brute force],PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Newspaper Headline,500.0,A,1308582000,"[greedy, strings]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Queue,1000.0,B,1308582000,"[binary search, data structures]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Ski Base,1500.0,C,1308582000,"[combinatorics, dsu, graphs]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Grocer's Problem,2500.0,D,1308582000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Igloo Skyscraper,2500.0,E,1308582000,"[data structures, geometry]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Chips,500.0,A,1308582000,"[implementation, math]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Binary Number,1000.0,B,1308582000,[greedy],PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Newspaper Headline,1500.0,C,1308582000,"[binary search, data structures, dp, greedy]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Queue,2000.0,D,1308582000,"[binary search, data structures, dp]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Ski Base,2500.0,E,1308582000,"[data structures, dsu, graphs]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Robbery,500.0,A,1308236400,[greedy],PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Widget Library,1000.0,B,1308236400,"[dp, expression parsing, graphs, implementation]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Chip Play,1000.0,C,1308236400,"[brute force, data structures, implementation]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Space mines,1500.0,D,1308236400,[geometry],PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Fire and Ice,2500.0,E,1308236400,[greedy],PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Cableway,500.0,A,1308236400,"[greedy, math]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,African Crossword,1000.0,B,1308236400,"[implementation, strings]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Robbery,1500.0,C,1308236400,"[greedy, math]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Widget Library,2000.0,D,1308236400,[],PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Chip Play,2000.0,E,1308236400,[],PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Trains,500.0,A,1307458800,[math],PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Vasya and Types,1000.0,B,1307458800,"[implementation, strings]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Interesting Game,1500.0,C,1307458800,"[dp, games]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Beautiful Road,2000.0,D,1307458800,"[dfs and similar, dp, dsu, implementation, sortings, trees]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Mogohu-Rea Idol,2500.0,E,1307458800,[geometry],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Chord,500.0,A,1307458800,"[brute force, implementation]",PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Keyboard,1000.0,B,1307458800,[implementation],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Trains,1500.0,C,1307458800,[number theory],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Vasya and Types,2000.0,D,1307458800,[implementation],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Interesting Game,2500.0,E,1307458800,[],PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Reflection,500.0,A,1306077000,[math],PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Tetris revisited,1000.0,B,1306077000,"[constructive algorithms, graph matchings, greedy, math]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Genetic engineering,2000.0,C,1306077000,"[dp, string suffix structures, trees]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Powerful array,2500.0,D,1306077000,"[data structures, implementation, math, two pointers]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Long sequence,2500.0,E,1306077000,"[brute force, math, matrices]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Domino,500.0,A,1305903600,"[constructive algorithms, implementation]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Embassy Queue,1000.0,B,1305903600,[data structures],PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Petya and Tree,1500.0,C,1305903600,"[binary search, dfs and similar, probabilities, sortings, trees]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Sum of Medians,2000.0,D,1305903600,"[binary search, brute force, data structures, implementation]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Guard Towers,2500.0,E,1305903600,"[binary search, dsu, geometry, graphs, sortings]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Magical Array,500.0,A,1305299400,[math],PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Doctor,1000.0,B,1305299400,"[binary search, math, sortings]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Track,1500.0,C,1305299400,"[graphs, greedy, shortest paths]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Numbers,2000.0,D,1305299400,"[dp, math, number theory]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Two Subsequences,2500.0,E,1305299400,"[bitmasks, dp]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Toy Army,500.0,A,1305299400,"[math, number theory]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Magical Array,1000.0,B,1305299400,"[combinatorics, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Biathlon,1500.0,C,1305299400,"[binary search, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Doctor,2000.0,D,1305299400,"[binary search, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Track,2500.0,E,1305299400,"[brute force, shortest paths]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Double Cola,500.0,A,1304694000,"[implementation, math]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Sets,1000.0,B,1304694000,"[constructive algorithms, hashing, implementation]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,General Mobilization,1500.0,C,1304694000,"[data structures, dfs and similar, sortings]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Two out of Three,2000.0,D,1304694000,[dp],PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Corridor,2500.0,E,1304694000,[geometry],PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Plug-in,500.0,A,1304485200,[implementation],PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Sequence Formatting,1000.0,B,1304485200,"[implementation, strings]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Average Score,1500.0,C,1304485200,"[math, sortings]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Polycarp's Picture Gallery,2000.0,D,1304485200,"[constructive algorithms, greedy]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Pairs,2500.0,E,1304485200,"[dfs and similar, dp, dsu, graphs, implementation, trees]",PROGRAMMING +79,Codeforces Beta Round #71,12,Bus Game,500.0,A,1304175600,[greedy],PROGRAMMING +79,Codeforces Beta Round #71,12,Colorful Field,1000.0,B,1304175600,"[implementation, sortings]",PROGRAMMING +79,Codeforces Beta Round #71,12,Beaver,1500.0,C,1304175600,"[data structures, dp, greedy, hashing, strings, two pointers]",PROGRAMMING +79,Codeforces Beta Round #71,12,Password,2000.0,D,1304175600,"[bitmasks, dp, shortest paths]",PROGRAMMING +79,Codeforces Beta Round #71,12,Security System,2500.0,E,1304175600,[math],PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Haiku,500.0,A,1303916400,"[implementation, strings]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Easter Eggs,1000.0,B,1303916400,"[constructive algorithms, implementation]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Beaver Game,1500.0,C,1303916400,"[dp, games, number theory]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Archer's Shot,2000.0,D,1303916400,"[binary search, geometry, math, two pointers]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Evacuation,2500.0,E,1303916400,"[flows, graphs, shortest paths]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Heroes,500.0,A,1303226100,"[brute force, implementation]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Falling Anvils,1000.0,B,1303226100,"[math, probabilities]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Beavermuncher-0xFF,1500.0,C,1303226100,"[dfs and similar, dp, dsu, greedy, trees]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Domino Carpet,2000.0,D,1303226100,"[dp, implementation]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Martian Food,2000.0,E,1303226100,[geometry],PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Panoramix's Prediction,500.0,A,1303226100,[brute force],PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Depression,1000.0,B,1303226100,"[geometry, math]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Heroes,1500.0,C,1303226100,"[brute force, implementation]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Falling Anvils,2000.0,D,1303226100,"[geometry, probabilities]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Beavermuncher-0xFF,2500.0,E,1303226100,[],PROGRAMMING +74,Codeforces Beta Round #68,12,Room Leader,500.0,A,1302879600,[implementation],PROGRAMMING +74,Codeforces Beta Round #68,12,Train,1000.0,B,1302879600,"[dp, games, greedy]",PROGRAMMING +74,Codeforces Beta Round #68,12,Chessboard Billiard,1500.0,C,1302879600,"[dfs and similar, dsu, graphs, number theory]",PROGRAMMING +74,Codeforces Beta Round #68,12,Hanger,2000.0,D,1302879600,[data structures],PROGRAMMING +74,Codeforces Beta Round #68,12,Shift It!,2500.0,E,1302879600,[constructive algorithms],PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Life Without Zeros,500.0,A,1302706800,[implementation],PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Facetook Priority Wall,1000.0,B,1302706800,"[expression parsing, implementation, strings]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Modified GCD,1500.0,C,1302706800,"[binary search, number theory]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Big Maximum Sum,2000.0,D,1302706800,"[data structures, dp, greedy, implementation, math, trees]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Ship's Shortest Path,2500.0,E,1302706800,"[geometry, shortest paths]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Gift,,A,1302609600,"[dsu, graphs, sortings, trees]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Mice,,B,1302609600,"[greedy, two pointers]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Mutation,,C,1302609600,"[bitmasks, dp, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Plus and xor,,D,1302609600,"[dp, greedy, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Points,,E,1302609600,"[implementation, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Tourist,,F,1302609600,"[binary search, data structures, dp]",PROGRAMMING +73,Codeforces Beta Round #66,12,The Elder Trolls IV: Oblivon,500.0,A,1302422400,"[greedy, math]",PROGRAMMING +73,Codeforces Beta Round #66,12,Need For Brake,1000.0,B,1302422400,"[binary search, greedy, sortings]",PROGRAMMING +73,Codeforces Beta Round #66,12,LionAge II,1000.0,C,1302422400,[dp],PROGRAMMING +73,Codeforces Beta Round #66,12,FreeDiv,1500.0,D,1302422400,"[dfs and similar, graphs, greedy]",PROGRAMMING +73,Codeforces Beta Round #66,12,Morrowindows,1500.0,E,1302422400,"[math, number theory]",PROGRAMMING +73,Codeforces Beta Round #66,12,Plane of Tanks,2000.0,F,1302422400,"[brute force, geometry]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Way Too Long Words,500.0,A,1301410800,[strings],PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Progress Bar,1000.0,B,1301410800,"[implementation, math]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Round Table Knights,1500.0,C,1301410800,"[dp, math, number theory]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Solitaire,2000.0,D,1301410800,"[brute force, implementation]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Nuclear Fusion,2500.0,E,1301410800,"[bitmasks, dp]",PROGRAMMING +70,Codeforces Beta Round #64,12,Cookies,500.0,A,1301155200,[math],PROGRAMMING +70,Codeforces Beta Round #64,12,Text Messaging,1000.0,B,1301155200,"[expression parsing, greedy, strings]",PROGRAMMING +70,Codeforces Beta Round #64,12,Lucky Tickets,1500.0,C,1301155200,"[binary search, data structures, sortings, two pointers]",PROGRAMMING +70,Codeforces Beta Round #64,12,Professor's task,2000.0,D,1301155200,"[data structures, geometry]",PROGRAMMING +70,Codeforces Beta Round #64,12,Information Reform,2500.0,E,1301155200,"[dp, implementation, trees]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Young Physicist,500.0,A,1300809600,"[implementation, math]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Bets,1000.0,B,1300809600,"[greedy, implementation]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Game,1500.0,C,1300809600,[implementation],PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Dot,2000.0,D,1300809600,"[dp, games]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Subsegments,2500.0,E,1300809600,"[data structures, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,"Goshtasp, Vishtasp and Eidi",,A,1300637400,"[*special, greedy, math]",PROGRAMMING +72,Unknown Language Round #2,12,INI-file,,B,1300637400,"[*special, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,Extraordinarily Nice Numbers,,C,1300637400,"[*special, math]",PROGRAMMING +72,Unknown Language Round #2,12,Perse-script,,D,1300637400,"[*special, expression parsing]",PROGRAMMING +72,Unknown Language Round #2,12,Ali goes shopping,,E,1300637400,"[*special, brute force, strings]",PROGRAMMING +72,Unknown Language Round #2,12,Oil,,F,1300637400,"[*special, greedy, math]",PROGRAMMING +72,Unknown Language Round #2,12,Fibonacci army,,G,1300637400,"[*special, dp]",PROGRAMMING +72,Unknown Language Round #2,12,Reverse It!,,H,1300637400,"[*special, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,Goofy Numbers,,I,1300637400,"[*special, implementation]",PROGRAMMING +68,Codeforces Beta Round #62,12,Irrational problem,500.0,A,1300464000,"[implementation, number theory]",PROGRAMMING +68,Codeforces Beta Round #62,12,Energy exchange,1000.0,B,1300464000,[binary search],PROGRAMMING +68,Codeforces Beta Round #62,12,Synchrophasotron,1500.0,C,1300464000,[brute force],PROGRAMMING +68,Codeforces Beta Round #62,12,Half-decay tree,2000.0,D,1300464000,"[data structures, divide and conquer, dp, probabilities]",PROGRAMMING +68,Codeforces Beta Round #62,12,Contact,2500.0,E,1300464000,[geometry],PROGRAMMING +67,Manthan 2011,12,Partial Teacher,500.0,A,1300033800,"[dp, graphs, greedy, implementation]",PROGRAMMING +67,Manthan 2011,12,Restoration of the Permutation,1000.0,B,1300033800,[greedy],PROGRAMMING +67,Manthan 2011,12,Sequence of Balls,1500.0,C,1300033800,[dp],PROGRAMMING +67,Manthan 2011,12,Optical Experiment,2000.0,D,1300033800,"[binary search, data structures, dp]",PROGRAMMING +67,Manthan 2011,12,Save the City!,2500.0,E,1300033800,[geometry],PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Java,500.0,A,1299513600,"[implementation, strings]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Countryside,1000.0,B,1299513600,"[brute force, implementation]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and File System,1500.0,C,1299513600,"[data structures, implementation]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and His Friends,2000.0,D,1299513600,"[constructive algorithms, math, number theory]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Post,2500.0,E,1299513600,"[data structures, dp]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and Three Spells,500.0,A,1299340800,"[implementation, math]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the History of Magic,1000.0,B,1299340800,"[brute force, greedy, implementation]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the Golden Snitch,1500.0,C,1299340800,"[binary search, geometry]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the Sorting Hat,2000.0,D,1299340800,"[brute force, dfs and similar, hashing]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and Moving Staircases,2500.0,E,1299340800,"[dfs and similar, implementation]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Sinking Ship,500.0,A,1298908800,"[implementation, sortings, strings]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Settlers' Training,1000.0,B,1298908800,[implementation],PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Bulls and Cows,1500.0,C,1298908800,"[brute force, implementation]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Dividing Island,2000.0,D,1298908800,[constructive algorithms],PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Sweets Game,2500.0,E,1298908800,"[bitmasks, dfs and similar, dp, games, implementation]",PROGRAMMING +62,Codeforces Beta Round #58,12,A Student's Dream,500.0,A,1298649600,"[greedy, math]",PROGRAMMING +62,Codeforces Beta Round #58,12,Tyndex.Brome,1000.0,B,1298649600,"[binary search, implementation]",PROGRAMMING +62,Codeforces Beta Round #58,12,Inquisition,1500.0,C,1298649600,"[geometry, implementation, sortings]",PROGRAMMING +62,Codeforces Beta Round #58,12,Wormhouse,2000.0,D,1298649600,"[dfs and similar, graphs]",PROGRAMMING +62,Codeforces Beta Round #58,12,World Evil,2500.0,E,1298649600,"[dp, flows]",PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Ultra-Fast Mathematician,500.0,A,1298390400,[implementation],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Hard Work,1000.0,B,1298390400,[strings],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Capture Valerian,1500.0,C,1298390400,[math],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Eternal Victory,2000.0,D,1298390400,"[dfs and similar, graphs, greedy, shortest paths, trees]",PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Enemy is weak,2500.0,E,1298390400,"[data structures, trees]",PROGRAMMING +64,Unknown Language Round #1,12,Factorial,,A,1298304000,"[*special, implementation]",PROGRAMMING +64,Unknown Language Round #1,12,Expression,,B,1298304000,"[*special, expression parsing]",PROGRAMMING +64,Unknown Language Round #1,12,Table,,C,1298304000,"[*special, greedy, implementation, math]",PROGRAMMING +64,Unknown Language Round #1,12,Presents,,D,1298304000,"[*special, greedy]",PROGRAMMING +64,Unknown Language Round #1,12,Prime Segment,,E,1298304000,"[*special, brute force]",PROGRAMMING +64,Unknown Language Round #1,12,Domain,,F,1298304000,"[*special, expression parsing]",PROGRAMMING +64,Unknown Language Round #1,12,Path Canonization,,G,1298304000,[*special],PROGRAMMING +64,Unknown Language Round #1,12,Table Bowling,,H,1298304000,"[*special, sortings]",PROGRAMMING +64,Unknown Language Round #1,12,Sort the Table,,I,1298304000,"[*special, sortings]",PROGRAMMING +60,Codeforces Beta Round #56,12,Where Are My Flakes?,500.0,A,1298131200,"[implementation, two pointers]",PROGRAMMING +60,Codeforces Beta Round #56,12,Serial Time!,1000.0,B,1298131200,"[dfs and similar, dsu]",PROGRAMMING +60,Codeforces Beta Round #56,12,Mushroom Strife,1500.0,C,1298131200,"[brute force, dfs and similar]",PROGRAMMING +60,Codeforces Beta Round #56,12,Savior,2000.0,D,1298131200,"[brute force, dsu, math]",PROGRAMMING +60,Codeforces Beta Round #56,12,Mushroom Gnomes,2500.0,E,1298131200,"[math, matrices]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Word,500.0,A,1297440000,"[implementation, strings]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Fortune Telling,1000.0,B,1297440000,"[implementation, number theory]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Title,1500.0,C,1297440000,[expression parsing],PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Team Arrangement,2000.0,D,1297440000,"[constructive algorithms, greedy, implementation]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Shortest Path,2500.0,E,1297440000,"[graphs, shortest paths]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Chat room,500.0,A,1296489600,"[greedy, strings]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Coins,1000.0,B,1296489600,[greedy],PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Trees,1500.0,C,1296489600,[brute force],PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Calendar,2000.0,D,1296489600,"[greedy, strings]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Expression,2500.0,E,1296489600,[dp],PROGRAMMING +57,Codeforces Beta Round #53,12,Square Earth?,500.0,A,1295971200,"[dfs and similar, greedy, implementation]",PROGRAMMING +57,Codeforces Beta Round #53,12,Martian Architecture,1000.0,B,1295971200,[implementation],PROGRAMMING +57,Codeforces Beta Round #53,12,Array,1500.0,C,1295971200,"[combinatorics, math]",PROGRAMMING +57,Codeforces Beta Round #53,12,Journey,2000.0,D,1295971200,"[dp, math]",PROGRAMMING +57,Codeforces Beta Round #53,12,Chess,2500.0,E,1295971200,"[math, shortest paths]",PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Bar,500.0,A,1295626200,[implementation],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Spoilt Permutation,1000.0,B,1295626200,[implementation],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Corporation Mail,1500.0,C,1295626200,"[data structures, expression parsing, implementation]",PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Changing a String,2000.0,D,1295626200,[dp],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Domino Principle,2500.0,E,1295626200,"[binary search, data structures, sortings]",PROGRAMMING +55,Codeforces Beta Round #51,12,Flea travel,500.0,A,1294992000,"[implementation, math]",PROGRAMMING +55,Codeforces Beta Round #51,12,Smallest number,1000.0,B,1294992000,[brute force],PROGRAMMING +55,Codeforces Beta Round #51,12,Pie or die,1500.0,C,1294992000,[games],PROGRAMMING +55,Codeforces Beta Round #51,12,Beautiful numbers,2000.0,D,1294992000,"[dp, number theory]",PROGRAMMING +55,Codeforces Beta Round #51,12,Very simple problem,2500.0,E,1294992000,"[geometry, two pointers]",PROGRAMMING +54,Codeforces Beta Round #50,12,Presents,500.0,A,1294733700,[implementation],PROGRAMMING +54,Codeforces Beta Round #50,12,Cutting Jigsaw Puzzle,1000.0,B,1294733700,"[hashing, implementation]",PROGRAMMING +54,Codeforces Beta Round #50,12,First Digit Law,1500.0,C,1294733700,"[dp, math, probabilities]",PROGRAMMING +54,Codeforces Beta Round #50,12,Writing a Song,2000.0,D,1294733700,"[brute force, dp]",PROGRAMMING +54,Codeforces Beta Round #50,12,Vacuum Сleaner,2500.0,E,1294733700,[geometry],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Autocomplete,500.0,A,1294329600,[implementation],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Blog Photo,1000.0,B,1294329600,"[binary search, implementation]",PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Little Frog,1500.0,C,1294329600,[constructive algorithms],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Physical Education,2000.0,D,1294329600,[sortings],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Dead Ends,2500.0,E,1294329600,"[bitmasks, dp]",PROGRAMMING +52,Codeforces Testing Round #1,12,123-sequence,500.0,A,1294160400,[implementation],PROGRAMMING +52,Codeforces Testing Round #1,12,Right Triangles,1000.0,B,1294160400,[combinatorics],PROGRAMMING +52,Codeforces Testing Round #1,12,Circular RMQ,1500.0,C,1294160400,[data structures],PROGRAMMING +51,Codeforces Beta Round #48,12,Cheaterius's Problem,500.0,A,1293552000,[implementation],PROGRAMMING +51,Codeforces Beta Round #48,12,bHTML Tables Analisys,1000.0,B,1293552000,[expression parsing],PROGRAMMING +51,Codeforces Beta Round #48,12,Three Base Stations,1500.0,C,1293552000,"[binary search, greedy]",PROGRAMMING +51,Codeforces Beta Round #48,12,Geometrical problem,2000.0,D,1293552000,[implementation],PROGRAMMING +51,Codeforces Beta Round #48,12,Pentagon,2500.0,E,1293552000,"[combinatorics, graphs, matrices]",PROGRAMMING +51,Codeforces Beta Round #48,12,Caterpillar,3000.0,F,1293552000,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +50,Codeforces Beta Round #47,12,Domino piling,500.0,A,1292862000,"[greedy, math]",PROGRAMMING +50,Codeforces Beta Round #47,12,Choosing Symbol Pairs,1000.0,B,1292862000,[strings],PROGRAMMING +50,Codeforces Beta Round #47,12,Happy Farm 5,1500.0,C,1292862000,[geometry],PROGRAMMING +50,Codeforces Beta Round #47,12,Bombing,2000.0,D,1292862000,"[binary search, dp, probabilities]",PROGRAMMING +50,Codeforces Beta Round #47,12,Square Equation Roots,2500.0,E,1292862000,[math],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Sleuth,500.0,A,1292601600,[implementation],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Sum,1000.0,B,1292601600,[math],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Disposition,1500.0,C,1292601600,"[constructive algorithms, math]",PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Game,2000.0,D,1292601600,"[brute force, dp, implementation]",PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Common ancestor,2500.0,E,1292601600,[dp],PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Rock-paper-scissors,,A,1292140800,"[implementation, schedules]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Land Lot,,B,1292140800,"[brute force, implementation]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,The Race,,C,1292140800,[math],PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Permutations,,D,1292140800,[greedy],PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Ivan the Fool VS Gorynych the Dragon,,E,1292140800,"[dp, games, graphs]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Snow sellers,,F,1292140800,"[greedy, sortings]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Galaxy Union,,G,1292140800,"[dp, trees, two pointers]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Black and White,,H,1292140800,[constructive algorithms],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Triangular numbers,500.0,A,1291737600,"[brute force, math]",PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Coins,1000.0,B,1291737600,[implementation],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Crossword,1500.0,C,1291737600,[implementation],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Safe,2000.0,D,1291737600,[brute force],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Cannon,2500.0,E,1291737600,"[data structures, geometry, sortings]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Ball Game,,A,1291536000,"[brute force, implementation]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,T-shirts from Sponsor,,B,1291536000,[implementation],PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hamsters and Tigers,,C,1291536000,[two pointers],PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Parking Lot,,D,1291536000,"[data structures, implementation]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Comb,,E,1291536000,"[data structures, dp]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hercule Poirot Problem,,F,1291536000,"[dsu, graphs]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Emperor's Problem,,G,1291536000,[geometry],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Football,500.0,A,1291046400,[strings],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Letter,1000.0,B,1291046400,"[implementation, strings]",PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Lucky Tickets,1500.0,C,1291046400,[greedy],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Journey,2000.0,D,1291046400,"[brute force, constructive algorithms, implementation]",PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Race,2500.0,E,1291046400,"[brute force, implementation, two pointers]",PROGRAMMING +42,Codeforces Beta Round #41,12,Guilty --- to the kitchen!,500.0,A,1290096000,"[greedy, implementation]",PROGRAMMING +42,Codeforces Beta Round #41,12,Game of chess unfinished,1000.0,B,1290096000,[implementation],PROGRAMMING +42,Codeforces Beta Round #41,12,Safe cracking,1500.0,C,1290096000,"[brute force, constructive algorithms]",PROGRAMMING +42,Codeforces Beta Round #41,12,Strange town,2000.0,D,1290096000,"[constructive algorithms, math]",PROGRAMMING +42,Codeforces Beta Round #41,12,Baldman and the military,2500.0,E,1290096000,"[dfs and similar, graphs]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Codecraft III,,A,1289646000,[implementation],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,School,,B,1289646000,"[dp, dsu]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Dancing Lessons,,C,1289646000,[data structures],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Event Dates,,D,1289646000,"[greedy, meet-in-the-middle, sortings]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Director,,E,1289646000,"[constructive algorithms, greedy]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Goats and Wolves,,F,1289646000,[greedy],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Prime Problem,,G,1289646000,[number theory],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Road Problem,,H,1289646000,[graphs],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,TCMCF+++,,I,1289646000,[greedy],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Planting Trees,,J,1289646000,[constructive algorithms],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Translation,500.0,A,1289232000,"[implementation, strings]",PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Martian Dollar,1000.0,B,1289232000,[brute force],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Email address,1500.0,C,1289232000,"[expression parsing, implementation]",PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Pawn,2000.0,D,1289232000,[dp],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,3-cycles,2500.0,E,1289232000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Indian Summer,,A,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Cola,,B,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Holidays,,C,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Hyperdrive,,D,1289041200,[math],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Anfisa the Monkey,,E,1289041200,[dp],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,BerPaint,,F,1289041200,"[geometry, graphs]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Shooting Gallery,,G,1289041200,"[data structures, implementation]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Phone Number,,H,1289041200,[dp],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Toys,,I,1289041200,"[brute force, combinatorics]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Triminoes,,J,1289041200,"[constructive algorithms, greedy]",PROGRAMMING +40,Codeforces Beta Round #39,12,Find Color,500.0,A,1288972800,"[constructive algorithms, implementation, math]",PROGRAMMING +40,Codeforces Beta Round #39,12,Repaintings,1000.0,B,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Berland Square,1500.0,C,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Interesting Sequence,2000.0,D,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Number Table,2500.0,E,1288972800,[combinatorics],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Army,,A,1288440000,[implementation],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Chess,,B,1288440000,"[brute force, implementation, math]",PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Blinds,,C,1288440000,[brute force],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Vasya the Architect,,D,1288440000,[implementation],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Let's Go Rolling!,,E,1288440000,"[dp, sortings]",PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Smart Boy,,F,1288440000,"[dp, games, strings]",PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Queue,,G,1288440000,[data structures],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,The Great Marathon,,H,1288440000,[dp],PROGRAMMING +37,Codeforces Beta Round #37,12,Towers,500.0,A,1288018800,[sortings],PROGRAMMING +37,Codeforces Beta Round #37,12,Computer Game,1000.0,B,1288018800,"[greedy, implementation]",PROGRAMMING +37,Codeforces Beta Round #37,12,Old Berland Language,1500.0,C,1288018800,"[data structures, greedy, trees]",PROGRAMMING +37,Codeforces Beta Round #37,12,Lesson Timetable,2000.0,D,1288018800,"[combinatorics, dp, math]",PROGRAMMING +37,Codeforces Beta Round #37,12,Trial for Chief,2500.0,E,1288018800,"[graphs, greedy, shortest paths]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,C*++ Calculations,,A,1287904200,"[expression parsing, greedy]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Company Income Growth,,B,1287904200,[greedy],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Moon Craters,,C,1287904200,"[dp, sortings]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Cubical Planet,,D,1287904200,[math],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,What Has Dirichlet Got to Do with That?,,E,1287904200,"[dp, games]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Pacifist frogs,,F,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Inverse Function,,G,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Multiplication Table,,H,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Tram,,I,1287904200,[],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Spelling Check,,J,1287904200,"[hashing, implementation, strings]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Testing,,K,1287904200,[],PROGRAMMING +36,Codeforces Beta Round #36,12,Extra-terrestrial Intelligence,500.0,A,1287482400,[implementation],PROGRAMMING +36,Codeforces Beta Round #36,12,Fractal,1000.0,B,1287482400,[implementation],PROGRAMMING +36,Codeforces Beta Round #36,12,Bowls,1500.0,C,1287482400,"[geometry, implementation]",PROGRAMMING +36,Codeforces Beta Round #36,12,New Game with a Chess Piece,2000.0,D,1287482400,[games],PROGRAMMING +36,Codeforces Beta Round #36,12,Two Paths,2500.0,E,1287482400,"[constructive algorithms, dsu, graphs, implementation]",PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Shell Game,500.0,A,1287471600,[implementation],PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Warehouse,1000.0,B,1287471600,[implementation],PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Fire Again,1500.0,C,1287471600,"[brute force, dfs and similar, shortest paths]",PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Animals,2000.0,D,1287471600,"[dp, greedy]",PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Parade,2500.0,E,1287471600,"[data structures, sortings]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Reconnaissance 2,500.0,A,1286802000,[implementation],PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Sale,1000.0,B,1286802000,"[greedy, sortings]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Page Numbers,1500.0,C,1286802000,"[expression parsing, implementation, sortings, strings]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Road Map,2000.0,D,1286802000,"[dfs and similar, graphs]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Collisions,2500.0,E,1286802000,"[brute force, implementation, math]",PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,What is for dinner?,500.0,A,1286463600,"[greedy, implementation]",PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,String Problem,1000.0,B,1286463600,[shortest paths],PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,Wonderful Randomized Sum,1500.0,C,1286463600,[greedy],PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,Knights,2000.0,D,1286463600,"[geometry, graphs, shortest paths, sortings]",PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,Helper,2500.0,E,1286463600,[],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Reconnaissance,500.0,A,1286002800,[brute force],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Borze,1000.0,B,1286002800,"[expression parsing, implementation]",PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Flea,1500.0,C,1286002800,[math],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Constellation,2000.0,D,1286002800,[implementation],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Hide-and-Seek,2500.0,E,1286002800,"[geometry, implementation]",PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Worms Evolution,500.0,A,1285599600,[implementation],PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Sysadmin Bob,1000.0,B,1285599600,[strings],PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Schedule,1500.0,C,1285599600,[implementation],PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Chocolate,2000.0,D,1285599600,"[dfs and similar, implementation]",PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,TV Game,2500.0,E,1285599600,[dp],PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Accounting,500.0,A,1285340400,"[brute force, math]",PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Codeforces World Finals,1000.0,B,1285340400,[implementation],PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Shooting Gallery,1500.0,C,1285340400,"[dp, probabilities]",PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,King's Problem?,2000.0,D,1285340400,"[geometry, greedy]",PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Tricky and Clever Password,2500.0,E,1285340400,"[binary search, constructive algorithms, data structures, greedy, hashing, strings]",PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Spit Problem,500.0,A,1284994800,[brute force],PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Traffic Lights,1000.0,B,1284994800,[implementation],PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Mail Stamps,1500.0,C,1284994800,"[data structures, dfs and similar, graphs, implementation]",PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Ant on the Tree,2000.0,D,1284994800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Quarrel,2500.0,E,1284994800,"[graphs, shortest paths]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,Bender Problem,500.0,A,1284735600,[implementation],PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,pSort,1000.0,B,1284735600,"[dfs and similar, dsu, graphs]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,Bath Queue,1500.0,C,1284735600,"[combinatorics, dp, probabilities]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,"Don't fear, DravDe is kind",2000.0,D,1284735600,"[binary search, data structures, dp, hashing]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,DravDe saves the world,2500.0,E,1284735600,"[geometry, math]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Next Test,500.0,A,1284130800,"[implementation, sortings]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Tournament,1000.0,B,1284130800,"[bitmasks, brute force, dfs and similar, greedy]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Unordered Subsequence,1500.0,C,1284130800,"[constructive algorithms, greedy]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Ring Road 2,2000.0,D,1284130800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Number With The Given Amount Of Divisors,2500.0,E,1284130800,"[brute force, dp, number theory]",PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Almost Prime,500.0,A,1281970800,[number theory],PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Regular Bracket Sequence,1000.0,B,1281970800,[greedy],PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Parquet,1500.0,C,1281970800,"[combinatorics, constructive algorithms]",PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Tickets,2000.0,D,1281970800,"[combinatorics, probabilities]",PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Multithreading,2500.0,E,1281970800,[constructive algorithms],PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,IQ test,,A,1280761200,[brute force],PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Phone numbers,,B,1280761200,[implementation],PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads in Berland,,C,1280761200,"[graphs, shortest paths]",PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads not only in Berland,,D,1280761200,"[dsu, graphs, trees]",PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Test,,E,1280761200,"[hashing, strings]",PROGRAMMING +24,Codeforces Beta Round #24,12,Ring road,,A,1280149200,[graphs],PROGRAMMING +24,Codeforces Beta Round #24,12,F1 Champions,,B,1280149200,[implementation],PROGRAMMING +24,Codeforces Beta Round #24,12,Sequence of points,,C,1280149200,"[geometry, implementation, math]",PROGRAMMING +24,Codeforces Beta Round #24,12,Broken robot,,D,1280149200,"[dp, probabilities]",PROGRAMMING +24,Codeforces Beta Round #24,12,Berland collider,,E,1280149200,[binary search],PROGRAMMING +23,Codeforces Beta Round #23,12,You're Given a String...,,A,1278687600,"[brute force, greedy]",PROGRAMMING +23,Codeforces Beta Round #23,12,Party,,B,1278687600,"[constructive algorithms, graphs, math]",PROGRAMMING +23,Codeforces Beta Round #23,12,Oranges and Apples,,C,1278687600,"[constructive algorithms, sortings]",PROGRAMMING +23,Codeforces Beta Round #23,12,Tetragon,,D,1278687600,"[geometry, math]",PROGRAMMING +23,Codeforces Beta Round #23,12,Tree,,E,1278687600,[dp],PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Second Order Statistics,,A,1277823600,[brute force],PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Bargaining Table,,B,1277823600,"[brute force, dp]",PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,System Administrator,,C,1277823600,[graphs],PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Segments,,D,1277823600,"[greedy, sortings]",PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Scheme,,E,1277823600,"[dfs and similar, graphs, trees]",PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Jabber ID,500.0,A,1277730300,[implementation],PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Intersection,1000.0,B,1277730300,"[implementation, math]",PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Stripe 2,1500.0,C,1277730300,"[binary search, dp, sortings]",PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Traveling Graph,2000.0,D,1277730300,"[bitmasks, graph matchings, graphs]",PROGRAMMING +19,Codeforces Beta Round #19,12,World Football Cup,,A,1277391600,[implementation],PROGRAMMING +19,Codeforces Beta Round #19,12,Checkout Assistant,,B,1277391600,[dp],PROGRAMMING +19,Codeforces Beta Round #19,12,Deletion of Repeats,,C,1277391600,"[greedy, hashing, string suffix structures]",PROGRAMMING +19,Codeforces Beta Round #19,12,Points,,D,1277391600,[data structures],PROGRAMMING +19,Codeforces Beta Round #19,12,Fairy,,E,1277391600,"[dfs and similar, divide and conquer, dsu]",PROGRAMMING +20,Codeforces Alpha Round #20 (Codeforces format),12,BerOS file system,500.0,A,1276875000,[implementation],PROGRAMMING +20,Codeforces Alpha Round #20 (Codeforces format),12,Equation,1000.0,B,1276875000,[math],PROGRAMMING +20,Codeforces Alpha Round #20 (Codeforces format),12,Dijkstra?,1500.0,C,1276875000,"[graphs, shortest paths]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Triangle,,A,1276700400,"[brute force, geometry]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Platforms,,B,1276700400,"[brute force, math]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Stripe,,C,1276700400,"[data structures, implementation]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Seller Bob,,D,1276700400,"[brute force, dp, greedy]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Flag 2,,E,1276700400,[dp],PROGRAMMING +17,Codeforces Beta Round #17,12,Noldbach problem,,A,1276182000,"[brute force, math, number theory]",PROGRAMMING +17,Codeforces Beta Round #17,12,Hierarchy,,B,1276182000,"[dfs and similar, dsu, greedy, shortest paths]",PROGRAMMING +17,Codeforces Beta Round #17,12,Balance,,C,1276182000,[dp],PROGRAMMING +17,Codeforces Beta Round #17,12,Notepad,,D,1276182000,[number theory],PROGRAMMING +17,Codeforces Beta Round #17,12,Palisection,,E,1276182000,[strings],PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Flag,,A,1275570000,[implementation],PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Burglar and Matches,,B,1275570000,"[greedy, implementation, sortings]",PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Monitor,,C,1275570000,"[binary search, number theory]",PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Logging,,D,1275570000,"[implementation, strings]",PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Fish,,E,1275570000,"[bitmasks, dp, probabilities]",PROGRAMMING +15,Codeforces Beta Round #15,12,Cottage Village,,A,1275145200,"[implementation, sortings]",PROGRAMMING +15,Codeforces Beta Round #15,12,Laser,,B,1275145200,[math],PROGRAMMING +15,Codeforces Beta Round #15,12,Industrial Nim,,C,1275145200,[games],PROGRAMMING +15,Codeforces Beta Round #15,12,Map,,D,1275145200,"[data structures, implementation, sortings]",PROGRAMMING +15,Codeforces Beta Round #15,12,Triangles,,E,1275145200,"[combinatorics, dp]",PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Letter,,A,1274283000,[implementation],PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Young Photographer,,B,1274283000,[implementation],PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Four Segments,,C,1274283000,"[brute force, constructive algorithms, geometry, implementation, math]",PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Two Paths,,D,1274283000,"[dfs and similar, dp, graphs, shortest paths, trees, two pointers]",PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Camels,,E,1274283000,[dp],PROGRAMMING +13,Codeforces Beta Round #13,12,Numbers,,A,1273154400,"[implementation, math]",PROGRAMMING +13,Codeforces Beta Round #13,12,Letter A,,B,1273154400,"[geometry, implementation]",PROGRAMMING +13,Codeforces Beta Round #13,12,Sequence,,C,1273154400,"[dp, sortings]",PROGRAMMING +13,Codeforces Beta Round #13,12,Triangles,,D,1273154400,"[dp, geometry]",PROGRAMMING +13,Codeforces Beta Round #13,12,Holes,,E,1273154400,"[data structures, dsu]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Super Agent,,A,1272538800,[implementation],PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Correct Solution?,,B,1272538800,"[implementation, sortings]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Fruits,,C,1272538800,"[implementation, sortings]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Ball,,D,1272538800,"[data structures, sortings]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Start of the session,,E,1272538800,[constructive algorithms],PROGRAMMING +11,Codeforces Beta Round #11,12,Increasing Sequence,,A,1272294000,"[constructive algorithms, implementation, math]",PROGRAMMING +11,Codeforces Beta Round #11,12,Jumping Jack,,B,1272294000,[math],PROGRAMMING +11,Codeforces Beta Round #11,12,How Many Squares?,,C,1272294000,[implementation],PROGRAMMING +11,Codeforces Beta Round #11,12,A Simple Task,,D,1272294000,"[bitmasks, dp, graphs]",PROGRAMMING +11,Codeforces Beta Round #11,12,"Forward, march!",,E,1272294000,"[binary search, dp, greedy]",PROGRAMMING +10,Codeforces Beta Round #10,12,Power Consumption Calculation,,A,1271346300,[implementation],PROGRAMMING +10,Codeforces Beta Round #10,12,Cinema Cashier,,B,1271346300,"[dp, implementation]",PROGRAMMING +10,Codeforces Beta Round #10,12,Digital Root,,C,1271346300,[number theory],PROGRAMMING +10,Codeforces Beta Round #10,12,LCIS,,D,1271346300,[dp],PROGRAMMING +10,Codeforces Beta Round #10,12,Greedy Change,,E,1271346300,[constructive algorithms],PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Die Roll,,A,1270983600,"[math, probabilities]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Running Student,,B,1270983600,"[brute force, geometry, implementation]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Hexadecimal's Numbers,,C,1270983600,"[brute force, implementation, math]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,How many trees?,,D,1270983600,"[combinatorics, divide and conquer, dp]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Interestring graph and Apples,,E,1270983600,"[dfs and similar, dsu, graphs]",PROGRAMMING +8,Codeforces Beta Round #8,12,Train and Peter,,A,1270741500,[strings],PROGRAMMING +8,Codeforces Beta Round #8,12,Obsession with Robots,,B,1270741500,"[constructive algorithms, graphs, implementation]",PROGRAMMING +8,Codeforces Beta Round #8,12,Looking for Order,,C,1270741500,"[bitmasks, dp]",PROGRAMMING +8,Codeforces Beta Round #8,12,Two Friends,,D,1270741500,"[binary search, geometry]",PROGRAMMING +8,Codeforces Beta Round #8,12,Beads,,E,1270741500,"[dp, graphs]",PROGRAMMING +7,Codeforces Beta Round #7,12,Kalevitch and Chess,,A,1270136700,"[brute force, constructive algorithms]",PROGRAMMING +7,Codeforces Beta Round #7,12,Memory Manager,,B,1270136700,[implementation],PROGRAMMING +7,Codeforces Beta Round #7,12,Line,,C,1270136700,"[math, number theory]",PROGRAMMING +7,Codeforces Beta Round #7,12,Palindrome Degree,,D,1270136700,"[hashing, strings]",PROGRAMMING +7,Codeforces Beta Round #7,12,Defining Macros,,E,1270136700,"[dp, expression parsing, implementation]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,Triangle,,A,1269673200,"[brute force, geometry]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,President's Office,,B,1269673200,[implementation],PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,"Alice, Bob and Chocolate",,C,1269673200,"[greedy, two pointers]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,Lizards and Basements 2,,D,1269673200,"[brute force, dp]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,Exposition,,E,1269673200,"[binary search, data structures, dsu, trees, two pointers]",PROGRAMMING +5,Codeforces Beta Round #5,12,Chat Servers Outgoing Traffic,,A,1269100800,[implementation],PROGRAMMING +5,Codeforces Beta Round #5,12,Center Alignment,,B,1269100800,"[implementation, strings]",PROGRAMMING +5,Codeforces Beta Round #5,12,Longest Regular Bracket Sequence,,C,1269100800,"[constructive algorithms, data structures, dp, greedy, sortings, strings]",PROGRAMMING +5,Codeforces Beta Round #5,12,Follow Traffic Rules,,D,1269100800,"[implementation, math]",PROGRAMMING +5,Codeforces Beta Round #5,12,Bindian Signalizing,,E,1269100800,[data structures],PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Watermelon,,A,1268395200,"[brute force, math]",PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Before an Exam,,B,1268395200,"[constructive algorithms, greedy]",PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Registration System,,C,1268395200,"[data structures, hashing, implementation]",PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Mysterious Present,,D,1268395200,"[dp, sortings]",PROGRAMMING +3,Codeforces Beta Round #3,12,Shortest path of the king,,A,1267963200,"[greedy, shortest paths]",PROGRAMMING +3,Codeforces Beta Round #3,12,Lorry,,B,1267963200,"[greedy, sortings]",PROGRAMMING +3,Codeforces Beta Round #3,12,Tic-tac-toe,,C,1267963200,"[brute force, games, implementation]",PROGRAMMING +3,Codeforces Beta Round #3,12,Least Cost Bracket Sequence,,D,1267963200,[greedy],PROGRAMMING +2,Codeforces Beta Round #2,12,Winner,,A,1267117200,"[hashing, implementation]",PROGRAMMING +2,Codeforces Beta Round #2,12,The least round way,,B,1267117200,"[dp, math]",PROGRAMMING +2,Codeforces Beta Round #2,12,Commentator problem,,C,1267117200,[geometry],PROGRAMMING +1,Codeforces Beta Round #1,12,Theatre Square,,A,1266580800,[math],PROGRAMMING +1,Codeforces Beta Round #1,12,Spreadsheet,,B,1266580800,"[implementation, math]",PROGRAMMING +1,Codeforces Beta Round #1,12,Ancient Berland Circus,,C,1266580800,"[geometry, math]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Links and Pearls,500.0,A,1525791900,"[implementation, math]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Marlin,1000.0,B,1525791900,[constructive algorithms],PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Posterized,1500.0,C,1525791900,[greedy],PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Perfect Groups,2000.0,D,1525791900,"[dp, math, number theory]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,The Number Games,2500.0,E,1525791900,"[data structures, greedy, trees]",PROGRAMMING +980,Codeforces Round #480 (Div. 2),2,Cactus to Tree,3000.0,F,1525791900,"[dp, graphs, trees]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Wrong Subtraction,,A,1525615500,[implementation],PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Two-gram,,B,1525615500,"[implementation, strings]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Less or Equal,,C,1525615500,[sortings],PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,"Divide by three, multiply by two",,D,1525615500,"[dfs and similar, math, sortings]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Cyclic Components,,E,1525615500,"[dfs and similar, dsu, graphs]",PROGRAMMING +977,Codeforces Round #479 (Div. 3),12,Consecutive Subsequence,,F,1525615500,[dp],PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Aramic script,500.0,A,1525183500,"[implementation, strings]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Mancala,1000.0,B,1525183500,"[brute force, implementation]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Valhalla Siege,1500.0,C,1525183500,[binary search],PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Ghosts,2000.0,D,1525183500,"[geometry, math]",PROGRAMMING +975,Codeforces Round #478 (Div. 2),2,Hag's Khashba,2500.0,E,1525183500,[geometry],PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimum Binary Number,,A,1525099200,[implementation],PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Lara Croft and the New Game,,B,1525099200,"[implementation, math]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Nested Segments,,C,1525099200,"[greedy, implementation, sortings]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Degree Set,,D,1525099200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Well played!,,E,1525099200,"[greedy, sortings]",PROGRAMMING +976,Educational Codeforces Round 43 (Rated for Div. 2),2,Minimal k-covering,,F,1525099200,[flows],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Stairs and Elevators,500.0,A,1525007700,[binary search],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Resource Distribution,1000.0,B,1525007700,"[binary search, implementation, sortings]",PROGRAMMING +925,VK Cup 2018 - Round 3,12,Big Secret,1500.0,C,1525007700,[],PROGRAMMING +925,VK Cup 2018 - Round 3,12,Aztec Catacombs,2000.0,D,1525007700,[constructive algorithms],PROGRAMMING +925,VK Cup 2018 - Round 3,12,May Holidays,2750.0,E,1525007700,"[data structures, trees]",PROGRAMMING +925,VK Cup 2018 - Round 3,12,Parametric Circulation,3250.0,F,1525007700,[],PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Stairs and Elevators,500.0,A,1525007700,"[binary search, data structures, greedy]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Resource Distribution,1000.0,B,1525007700,"[binary search, data structures, greedy, two pointers]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Big Secret,1500.0,C,1525007700,"[constructive algorithms, data structures, greedy]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Aztec Catacombs,2000.0,D,1525007700,"[constructive algorithms, graphs]",PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,May Holidays,2750.0,E,1525007700,[],PROGRAMMING +966,"Codeforces Round #477 (rated, Div. 1, based on VK Cup 2018 Round 3)",1,Parametric Circulation,3250.0,F,1525007700,[flows],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Mind the Gap,500.0,A,1525007700,[implementation],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Watering System,1000.0,B,1525007700,[sortings],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Stairs and Elevators,1500.0,C,1525007700,[binary search],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Resource Distribution,2000.0,D,1525007700,"[binary search, sortings]",PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Big Secret,2750.0,E,1525007700,[],PROGRAMMING +967,"Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3)",2,Aztec Catacombs,3250.0,F,1525007700,[],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Paper Airplanes,500.0,A,1524677700,[math],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Battleship,1000.0,B,1524677700,[implementation],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Greedy Arkady,1500.0,C,1524677700,[math],PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Single-use Stones,2000.0,D,1524677700,"[binary search, flows, greedy, two pointers]",PROGRAMMING +965,"Codeforces Round #476 (Div. 2) [Thanks, Telegram!]",2,Short Code,2500.0,E,1524677700,"[data structures, dp, greedy, strings, trees]",PROGRAMMING +927,VK Cup 2018 - Wild-card Round 2,12,BuberPool Taxi Optimization,,A,1524152100,[],PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Alternating Sum,500.0,A,1523973900,"[math, number theory]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Destruction of a Tree,1000.0,B,1523973900,"[constructive algorithms, dfs and similar, dp, greedy, trees]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Cutting Rectangle,1500.0,C,1523973900,"[brute force, math, number theory]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Frequency of String,2000.0,D,1523973900,"[hashing, string suffix structures, strings]",PROGRAMMING +963,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1),1,Circles of Waiting,2500.0,E,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Splits,500.0,A,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Messages,1000.0,B,1523973900,[math],PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Alternating Sum,1500.0,C,1523973900,"[math, matrices, number theory]",PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Destruction of a Tree,2000.0,D,1523973900,"[dfs and similar, dp, trees]",PROGRAMMING +964,Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 2),2,Cutting Rectangle,2500.0,E,1523973900,[math],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (easy),,A1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (medium),,A2,1523689500,"[hashing, strings]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Death Stars (hard),,A3,1523689500,[],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (easy),,B1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Maximum Control (medium),,B2,1523689500,"[data structures, greedy, trees]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (easy),,C1,1523689500,[brute force],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (medium),,C2,1523689500,[dp],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Encryption (hard),,C3,1523689500,"[data structures, dp]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (easy),,D1,1523689500,"[expression parsing, math]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Hyperspace Jump (hard),,D2,1523689500,[],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (easy),,E1,1523689500,"[brute force, geometry, greedy, math]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (medium),,E2,1523689500,"[binary search, dp, greedy, sortings]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Guard Duty (hard),,E3,1523689500,[geometry],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (easy),,F1,1523689500,[implementation],PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (medium),,F2,1523689500,"[binary search, two pointers]",PROGRAMMING +958,"Helvetic Coding Contest 2018 online mirror (teams allowed, unrated)",12,Lightsabers (hard),,F3,1523689500,[fft],PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Equator,,A,1523370900,[implementation],PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Students in Railway Carriage,,B,1523370900,"[constructive algorithms, greedy, implementation]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Make a Square,,C,1523370900,"[brute force, implementation, math]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Merge Equals,,D,1523370900,"[data structures, implementation]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,"Byteland, Berland and Disputed Cities",,E,1523370900,"[constructive algorithms, greedy]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Simple Cycles Edges,,F,1523370900,"[dfs and similar, graphs, trees]",PROGRAMMING +962,Educational Codeforces Round 42 (Rated for Div. 2),2,Visible Black Areas,,G,1523370900,"[data structures, dsu, geometry, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Check the string,500.0,A,1523117100,[implementation],PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Minimize the error,1000.0,B,1523117100,"[data structures, greedy, sortings]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Subsequence Counting,1500.0,C,1523117100,"[bitmasks, constructive algorithms, greedy, implementation]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Full Binary Tree Queries,2000.0,D,1523117100,"[brute force, implementation, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Alternating Tree,2250.0,E,1523117100,"[combinatorics, dfs and similar, divide and conquer, dp, probabilities, trees]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Pathwalks,2500.0,F,1523117100,"[data structures, dp, graphs]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Bandit Blues,3000.0,G,1523117100,"[combinatorics, dp, fft, math]",PROGRAMMING +960,"Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)",12,Santa's Gift,3500.0,H,1523117100,"[data structures, trees]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tetris,,A,1522850700,[implementation],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Lecture Sleep,,B,1522850700,"[data structures, dp, implementation, two pointers]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Chessboard,,C,1522850700,"[bitmasks, brute force, implementation]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Pair Of Lines,,D,1522850700,[geometry],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Tufurama,,E,1522850700,[data structures],PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,k-substrings,,F,1522850700,"[binary search, hashing, string suffix structures]",PROGRAMMING +961,Educational Codeforces Round 41 (Rated for Div. 2),2,Partitions,,G,1522850700,"[combinatorics, math, number theory]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the even-odd game,500.0,A,1522771500,"[games, math]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the message,1000.0,B,1522771500,"[dsu, implementation]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the wrong algorithm,1250.0,C,1522771500,"[constructive algorithms, trees]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and another array construction task,1750.0,D,1522771500,"[constructive algorithms, greedy, number theory]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and the xor-MST,2000.0,E,1522771500,"[bitmasks, dp, graphs, implementation, math]",PROGRAMMING +959,Codeforces Round #473 (Div. 2),2,Mahmoud and Ehab and yet another xor task,2500.0,F,1522771500,"[bitmasks, dp, math, matrices]",PROGRAMMING +952,April Fools Contest 2018,12,Quirky Quantifiers,,A,1522596900,[math],PROGRAMMING +952,April Fools Contest 2018,12,A Map of the Cat,,B,1522596900,[brute force],PROGRAMMING +952,April Fools Contest 2018,12,Ravioli Sort,,C,1522596900,[implementation],PROGRAMMING +952,April Fools Contest 2018,12,I'm Feeling Lucky!,,D,1522596900,[probabilities],PROGRAMMING +952,April Fools Contest 2018,12,Cheese Board,,E,1522596900,[],PROGRAMMING +952,April Fools Contest 2018,12,2 + 2 != 4,,F,1522596900,[],PROGRAMMING +952,April Fools Contest 2018,12,Puzzling Language,,G,1522596900,[constructive algorithms],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING +924,VK Cup 2018 - Round 2,12,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy]",PROGRAMMING +924,VK Cup 2018 - Round 2,12,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Wardrobe,2250.0,E,1521905700,[],PROGRAMMING +924,VK Cup 2018 - Round 2,12,Minimal Subset Difference,3000.0,F,1521905700,[],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Mystical Mosaic,500.0,A,1521905700,[implementation],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Three-level Laser,1000.0,B,1521905700,"[binary search, greedy, two pointers]",PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Riverside Curio,1250.0,C,1521905700,"[data structures, greedy, implementation]",PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Contact ATC,2000.0,D,1521905700,[],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Wardrobe,2250.0,E,1521905700,[dp],PROGRAMMING +956,"Codeforces Round #472 (rated, Div. 1, based on VK Cup 2018 Round 2)",1,Minimal Subset Difference,3000.0,F,1521905700,"[bitmasks, dp]",PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Tritonic Iridescence,500.0,A,1521905700,[implementation],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Mystical Mosaic,1000.0,B,1521905700,[brute force],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Three-level Laser,1500.0,C,1521905700,"[binary search, math]",PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Riverside Curio,1750.0,D,1521905700,[greedy],PROGRAMMING +957,"Codeforces Round #472 (rated, Div. 2, based on VK Cup 2018 Round 2)",2,Contact ATC,2500.0,E,1521905700,[],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Feed the cat,500.0,A,1521822900,"[greedy, math]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Not simply beatiful strings,1000.0,B,1521822900,[implementation],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Sad powers,1500.0,C,1521822900,"[binary search, math, number theory]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Scissors,2000.0,D,1521822900,"[brute force, strings]",PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Icicles,2500.0,E,1521822900,[],PROGRAMMING +955,Codeforces Round #471 (Div. 2),2,Heaps,3000.0,F,1521822900,"[dp, trees]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Diagonal Walking,,A,1521698700,[implementation],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,String Typing,,B,1521698700,[strings],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Matrix Walk,,C,1521698700,[implementation],PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Fight Against Traffic,,D,1521698700,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Water Taps,,E,1521698700,"[binary search, greedy, sortings]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Runner's Problem,,F,1521698700,"[dp, matrices, sortings]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Castle Defense,,G,1521698700,"[binary search, two pointers]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Path Counting,,H,1521698700,"[combinatorics, dp]",PROGRAMMING +954,Educational Codeforces Round 40 (Rated for Div. 2),2,Yet Another String Matching Problem,,I,1521698700,[fft],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,2-3-numbers,,A,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Add Points,,B,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Choose Place,,D,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Mobile Communications,,F,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Large Bouquets,,G,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,A Vital Problem,,I,1521300900,[],PROGRAMMING +926,VK Cup 2018 - Wild-card Round 1,12,Segments,,J,1521300900,[data structures],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,2-3-numbers,,A,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Add Points,,B,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Is This a Zebra?,,C,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Choose Place,,D,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Merge Equal Elements,,E,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Mobile Communications,,F,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Large Bouquets,,G,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Endless Roses Most Beautiful,,H,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,A Vital Problem,,I,1521300900,[],PROGRAMMING +953,VK Cup 2018 - Wild-card Round 1 (unofficial unrated mirror),12,Segments,,J,1521300900,[],PROGRAMMING +923,VK Cup 2018 - Round 1,12,Primal Sport,500.0,A,1520696100,"[math, number theory]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Producing Snow,1000.0,B,1520696100,"[binary search, data structures]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Perfect Security,1500.0,C,1520696100,"[data structures, greedy]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation, strings]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING +923,VK Cup 2018 - Round 1,12,Public Service,3000.0,F,1520696100,[],PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Primal Sport,500.0,A,1520696100,"[brute force, math, number theory]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Producing Snow,1000.0,B,1520696100,"[binary search, data structures, implementation]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perfect Security,1500.0,C,1520696100,"[data structures, strings]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Picking Strings,1750.0,D,1520696100,"[constructive algorithms, implementation]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Perpetual Subtraction,2250.0,E,1520696100,"[fft, math, matrices]",PROGRAMMING +947,"Codeforces Round #470 (rated, Div. 1, based on VK Cup 2018 Round 1)",1,Public Service,3000.0,F,1520696100,[],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Protect Sheep,500.0,A,1520696100,[brute force],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Primal Sport,1000.0,B,1520696100,"[brute force, math, number theory]",PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Producing Snow,1500.0,C,1520696100,"[binary search, data structures]",PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Perfect Security,2000.0,D,1520696100,[data structures],PROGRAMMING +948,"Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1)",2,Picking Strings,2250.0,E,1520696100,"[constructive algorithms, implementation]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Zebras,500.0,A,1520583000,[greedy],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,A Leapfrog in the Array,1000.0,B,1520583000,[math],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Data Center Maintenance,1250.0,C,1520583000,"[dfs and similar, graphs]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Curfew,1750.0,D,1520583000,"[binary search, brute force]",PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Binary Cards,2250.0,E,1520583000,[brute force],PROGRAMMING +949,Codeforces Round #469 (Div. 1),1,Astronomy,2500.0,F,1520583000,"[geometry, probabilities]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,"Left-handers, Right-handers and Ambidexters",500.0,A,1520583000,[implementation],PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Intercepted Message,1000.0,B,1520583000,[greedy],PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Zebras,1500.0,C,1520583000,"[constructive algorithms, greedy]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,A Leapfrog in the Array,2000.0,D,1520583000,"[constructive algorithms, math]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Data Center Maintenance,2250.0,E,1520583000,"[2-sat, graphs]",PROGRAMMING +950,Codeforces Round #469 (Div. 2),2,Curfew,2750.0,F,1520583000,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Partition,,A,1520348700,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Weird Subtraction Process,,B,1520348700,[number theory],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,String Transformation,,C,1520348700,[greedy],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Timetable,,D,1520348700,[dp],PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Largest Beautiful Number,,E,1520348700,"[greedy, implementation]",PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Fibonacci String Subsequences,,F,1520348700,"[combinatorics, dp, matrices]",PROGRAMMING +946,Educational Codeforces Round 39 (Rated for Div. 2),2,Almost Increasing Array,,G,1520348700,"[data structures, dp]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Peculiar apple-tree,500.0,A,1520177700,[dfs and similar],PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with String,1000.0,B,1520177700,"[implementation, probabilities, strings]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Teodor is not a liar!,1500.0,C,1520177700,"[data structures, dp]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Game with Tokens,2000.0,D,1520177700,"[data structures, games, implementation]",PROGRAMMING +930,"Codeforces Round #468 (Div. 1, based on Technocup 2018 Final Round)",1,Coins Exhibition,2500.0,E,1520177700,"[data structures, dp]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Friends Meeting,500.0,A,1520177700,"[brute force, implementation, math]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,World Cup,1000.0,B,1520177700,[implementation],PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Laboratory Work,1750.0,C,1520177700,"[implementation, math]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Peculiar apple-tree,1750.0,D,1520177700,[dfs and similar],PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Game with String,2500.0,E,1520177700,"[implementation, math, probabilities]",PROGRAMMING +931,"Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)",2,Teodor is not a liar!,3000.0,F,1520177700,"[data structures, dp]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,World Cup,500.0,A,1520152800,[implementation],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Laboratory Work,1250.0,B,1520152800,[],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Peculiar apple-tree,1250.0,C,1520152800,[dfs and similar],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with String,2000.0,D,1520152800,[],PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Teodor is not a liar!,2500.0,E,1520152800,"[binary search, data structures, dp]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Game with Tokens,3000.0,F,1520152800,"[data structures, games]",PROGRAMMING +944,Технокубок 2018 - Финал (только для онсайт-финалистов),12,Coins Exhibition,3500.0,G,1520152800,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Прокат велосипедов,500.0,A,1520004900,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Места в самолёте,1000.0,B,1520004900,[],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Красивая команда,1750.0,C,1520004900,[combinatorics],PROGRAMMING +929,VK Cup 2018 - Квалификация 2,12,Пограничные врата,2500.0,D,1520004900,[],PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Save Energy!,500.0,A,1519574700,"[binary search, implementation, math]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Sleepy Game,1000.0,B,1519574700,"[dfs and similar, dp, graphs]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Lock Puzzle,1500.0,C,1519574700,"[constructive algorithms, implementation]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,World of Tank,2000.0,D,1519574700,"[dp, greedy]",PROGRAMMING +936,Codeforces Round #467 (Div. 1),1,Iqea,2500.0,E,1519574700,"[data structures, dfs and similar, divide and conquer, dsu, shortest paths, trees]",PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Olympiad,500.0,A,1519574700,[implementation],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Vile Grasshoppers,1000.0,B,1519574700,[math],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Save Energy!,1500.0,C,1519574700,[math],PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Sleepy Game,2000.0,D,1519574700,"[dfs and similar, graphs]",PROGRAMMING +937,Codeforces Round #467 (Div. 2),2,Lock Puzzle,2500.0,E,1519574700,[constructive algorithms],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Login Verification,500.0,A,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Chat,1250.0,B,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Dependency management,2000.0,C,1519486500,[],PROGRAMMING +928,VK Cup 2018 - Квалификация 1,12,Autocompletion,2250.0,D,1519486500,[],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Points on the line,500.0,A,1519464900,[brute force],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Our Tanya is Crying Out Loud,1250.0,B,1519464900,[greedy],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Phone Numbers,1250.0,C,1519464900,[constructive algorithms],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Alena And The Heater,1500.0,D,1519464900,[implementation],PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Cashback,2000.0,E,1519464900,"[data structures, dp, greedy, math]",PROGRAMMING +940,Codeforces Round #466 (Div. 2),2,Machine Learning,2750.0,F,1519464900,"[brute force, data structures]",PROGRAMMING 935,Codeforces Round #465 (Div. 2),2,Fafa and his Company,500.0,A,1519058100,[brute force],PROGRAMMING 935,Codeforces Round #465 (Div. 2),2,Fafa and the Gates,750.0,B,1519058100,[implementation],PROGRAMMING 935,Codeforces Round #465 (Div. 2),2,Fifa and Fafa,1250.0,C,1519058100,[geometry],PROGRAMMING 935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Alphabet,1750.0,D,1519058100,"[math, probabilities]",PROGRAMMING 935,Codeforces Round #465 (Div. 2),2,Fafa and Ancient Mathematics,2250.0,E,1519058100,"[dp, trees]",PROGRAMMING 935,Codeforces Round #465 (Div. 2),2,Fafa and Array,2750.0,F,1519058100,[data structures],PROGRAMMING -939,Codeforces Round #464 (Div. 2),2,Love Triangle,500.0,A,1518861900,"[brute force, implementation]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Love Triangle,500.0,A,1518861900,[],PROGRAMMING 939,Codeforces Round #464 (Div. 2),2,Hamster Farm,1000.0,B,1518861900,[implementation],PROGRAMMING 939,Codeforces Round #464 (Div. 2),2,Convenient For Everybody,1500.0,C,1518861900,"[binary search, two pointers]",PROGRAMMING -939,Codeforces Round #464 (Div. 2),2,Love Rescue,2000.0,D,1518861900,"[dfs and similar, dsu]",PROGRAMMING +939,Codeforces Round #464 (Div. 2),2,Love Rescue,2000.0,D,1518861900,"[dsu, greedy]",PROGRAMMING 939,Codeforces Round #464 (Div. 2),2,Maximize!,2500.0,E,1518861900,"[binary search, greedy, ternary search, two pointers]",PROGRAMMING 939,Codeforces Round #464 (Div. 2),2,Cutlet,2750.0,F,1518861900,"[data structures, dp]",PROGRAMMING 938,Educational Codeforces Round 38 (Rated for Div. 2),2,Word Correction,,A,1518793500,[implementation],PROGRAMMING -938,Educational Codeforces Round 38 (Rated for Div. 2),2,Run For Your Prize,,B,1518793500,[brute force],PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Run For Your Prize,,B,1518793500,"[brute force, greedy]",PROGRAMMING 938,Educational Codeforces Round 38 (Rated for Div. 2),2,Constructing Tests,,C,1518793500,"[binary search, brute force]",PROGRAMMING 938,Educational Codeforces Round 38 (Rated for Div. 2),2,Buy a Ticket,,D,1518793500,"[data structures, graphs, shortest paths]",PROGRAMMING 938,Educational Codeforces Round 38 (Rated for Div. 2),2,Max History,,E,1518793500,"[combinatorics, math]",PROGRAMMING 938,Educational Codeforces Round 38 (Rated for Div. 2),2,Erasing Substrings,,F,1518793500,"[bitmasks, dp, greedy]",PROGRAMMING -938,Educational Codeforces Round 38 (Rated for Div. 2),2,Shortest Path Queries,,G,1518793500,"[bitmasks, data structures, graphs]",PROGRAMMING +938,Educational Codeforces Round 38 (Rated for Div. 2),2,Shortest Path Queries,,G,1518793500,"[bitmasks, data structures, dsu, graphs]",PROGRAMMING 932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindromic Supersequence,500.0,A,1518705300,[constructive algorithms],PROGRAMMING 932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Recursive Queries,1000.0,B,1518705300,"[data structures, dfs and similar]",PROGRAMMING 932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Permutation Cycle,1500.0,C,1518705300,"[brute force, constructive algorithms]",PROGRAMMING 932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Tree,2000.0,D,1518705300,"[binary search, dp, trees]",PROGRAMMING 932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Team Work,2500.0,E,1518705300,"[combinatorics, dp]",PROGRAMMING 932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Escape Through Leaf,2500.0,F,1518705300,"[data structures, dp, geometry]",PROGRAMMING -932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindrome Partition,3000.0,G,1518705300,"[dp, strings]",PROGRAMMING -933,Codeforces Round #462 (Div. 1),1,A Twisty Movement,500.0,A,1518609900,"[data structures, dp]",PROGRAMMING +932,"ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)",12,Palindrome Partition,3000.0,G,1518705300,"[dp, string suffix structures, strings]",PROGRAMMING +933,Codeforces Round #462 (Div. 1),1,A Twisty Movement,500.0,A,1518609900,[dp],PROGRAMMING 933,Codeforces Round #462 (Div. 1),1,A Determined Cleanup,750.0,B,1518609900,[math],PROGRAMMING 933,Codeforces Round #462 (Div. 1),1,A Colourful Prospect,1500.0,C,1518609900,[geometry],PROGRAMMING 933,Codeforces Round #462 (Div. 1),1,A Creative Cutout,2250.0,D,1518609900,"[brute force, combinatorics, math]",PROGRAMMING 933,Codeforces Round #462 (Div. 1),1,A Preponderant Reunion,2500.0,E,1518609900,"[constructive algorithms, dp]",PROGRAMMING -934,Codeforces Round #462 (Div. 2),2,A Compatible Pair,500.0,A,1518609900,[brute force],PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Compatible Pair,500.0,A,1518609900,"[brute force, games]",PROGRAMMING 934,Codeforces Round #462 (Div. 2),2,A Prosperous Lot,1000.0,B,1518609900,[implementation],PROGRAMMING -934,Codeforces Round #462 (Div. 2),2,A Twisty Movement,1500.0,C,1518609900,"[brute force, dp]",PROGRAMMING +934,Codeforces Round #462 (Div. 2),2,A Twisty Movement,1500.0,C,1518609900,"[brute force, dp, implementation]",PROGRAMMING 934,Codeforces Round #462 (Div. 2),2,A Determined Cleanup,2000.0,D,1518609900,[math],PROGRAMMING 934,Codeforces Round #462 (Div. 2),2,A Colourful Prospect,2500.0,E,1518609900,[],PROGRAMMING 922,Codeforces Round #461 (Div. 2),2,Cloning Toys,500.0,A,1518023700,[implementation],PROGRAMMING @@ -3476,7 +15725,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 919,Codeforces Round #460 (Div. 2),2,Seat Arrangements,1000.0,C,1517403900,[implementation],PROGRAMMING 919,Codeforces Round #460 (Div. 2),2,Substring,1500.0,D,1517403900,"[dfs and similar, dp, graphs]",PROGRAMMING 919,Codeforces Round #460 (Div. 2),2,Congruence Equation,2000.0,E,1517403900,"[chinese remainder theorem, math, number theory]",PROGRAMMING -919,Codeforces Round #460 (Div. 2),2,A Game With Numbers,2500.0,F,1517403900,"[games, graphs]",PROGRAMMING +919,Codeforces Round #460 (Div. 2),2,A Game With Numbers,2500.0,F,1517403900,"[games, graphs, shortest paths]",PROGRAMMING 917,Codeforces Round #459 (Div. 1),1,The Monster,500.0,A,1517236500,[greedy],PROGRAMMING 917,Codeforces Round #459 (Div. 1),1,MADMAX,750.0,B,1517236500,"[dp, games, graphs]",PROGRAMMING 917,Codeforces Round #459 (Div. 1),1,Pollywog,1500.0,C,1517236500,[dp],PROGRAMMING @@ -3507,7 +15756,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 915,Educational Codeforces Round 36 (Rated for Div. 2),2,Physical Education Lessons,,E,1515848700,"[data structures, implementation, sortings]",PROGRAMMING 915,Educational Codeforces Round 36 (Rated for Div. 2),2,Imbalance Value of a Tree,,F,1515848700,"[data structures, dsu, graphs, trees]",PROGRAMMING 915,Educational Codeforces Round 36 (Rated for Div. 2),2,Coprime Arrays,,G,1515848700,"[math, number theory]",PROGRAMMING -913,Hello 2018,12,Modular Exponentiation,500.0,A,1515422700,[implementation],PROGRAMMING +913,Hello 2018,12,Modular Exponentiation,500.0,A,1515422700,"[implementation, math]",PROGRAMMING 913,Hello 2018,12,Christmas Spruce,750.0,B,1515422700,"[implementation, trees]",PROGRAMMING 913,Hello 2018,12,Party Lemonade,1000.0,C,1515422700,"[bitmasks, dp, greedy]",PROGRAMMING 913,Hello 2018,12,Too Easy Problems,1250.0,D,1515422700,"[binary search, brute force, data structures, greedy, sortings]",PROGRAMMING @@ -3533,7 +15782,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 911,Educational Codeforces Round 35 (Rated for Div. 2),2,Three Garlands,,C,1514469900,"[brute force, constructive algorithms]",PROGRAMMING 911,Educational Codeforces Round 35 (Rated for Div. 2),2,Inversion Counting,,D,1514469900,"[brute force, math]",PROGRAMMING 911,Educational Codeforces Round 35 (Rated for Div. 2),2,Stack Sorting,,E,1514469900,"[data structures, implementation]",PROGRAMMING -911,Educational Codeforces Round 35 (Rated for Div. 2),2,Tree Destruction,,F,1514469900,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +911,Educational Codeforces Round 35 (Rated for Div. 2),2,Tree Destruction,,F,1514469900,"[constructive algorithms, dfs and similar, graphs, greedy, trees]",PROGRAMMING 911,Educational Codeforces Round 35 (Rated for Div. 2),2,Mass Change Queries,,G,1514469900,[data structures],PROGRAMMING 909,Codeforces Round #455 (Div. 2),2,Generate Login,500.0,A,1514392500,"[brute force, greedy, sortings]",PROGRAMMING 909,Codeforces Round #455 (Div. 2),2,Segments,1000.0,B,1514392500,"[constructive algorithms, math]",PROGRAMMING @@ -3578,7 +15827,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 899,Codeforces Round #452 (Div. 2),2,Segments Removal,2250.0,E,1513492500,"[data structures, dsu, flows, two pointers]",PROGRAMMING 899,Codeforces Round #452 (Div. 2),2,Letters Removing,2500.0,F,1513492500,[data structures],PROGRAMMING 898,Codeforces Round #451 (Div. 2),2,Rounding,500.0,A,1513424100,[implementation],PROGRAMMING -898,Codeforces Round #451 (Div. 2),2,Proper Nutrition,750.0,B,1513424100,"[brute force, number theory]",PROGRAMMING +898,Codeforces Round #451 (Div. 2),2,Proper Nutrition,750.0,B,1513424100,"[brute force, implementation, number theory]",PROGRAMMING 898,Codeforces Round #451 (Div. 2),2,Phone Numbers,1500.0,C,1513424100,"[implementation, strings]",PROGRAMMING 898,Codeforces Round #451 (Div. 2),2,Alarm Clock,1750.0,D,1513424100,[greedy],PROGRAMMING 898,Codeforces Round #451 (Div. 2),2,Squares and not squares,2000.0,E,1513424100,[greedy],PROGRAMMING @@ -3622,14 +15871,14 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 894,Codeforces Round #447 (Div. 2),2,Ralph And His Tour in Binary Country,2000.0,D,1511099700,"[data structures, trees]",PROGRAMMING 894,Codeforces Round #447 (Div. 2),2,Ralph and Mushrooms,2500.0,E,1511099700,"[dp, graphs]",PROGRAMMING 891,Codeforces Round #446 (Div. 1),1,Pride,500.0,A,1510929300,"[brute force, dp, greedy, math, number theory]",PROGRAMMING -891,Codeforces Round #446 (Div. 1),1,Gluttony,1000.0,B,1510929300,[constructive algorithms],PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Gluttony,1000.0,B,1510929300,"[constructive algorithms, greedy]",PROGRAMMING 891,Codeforces Round #446 (Div. 1),1,Envy,1500.0,C,1510929300,"[data structures, dsu, graphs]",PROGRAMMING 891,Codeforces Round #446 (Div. 1),1,Sloth,2000.0,D,1510929300,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING -891,Codeforces Round #446 (Div. 1),1,Lust,2500.0,E,1510929300,"[combinatorics, math]",PROGRAMMING +891,Codeforces Round #446 (Div. 1),1,Lust,2500.0,E,1510929300,"[combinatorics, math, matrices]",PROGRAMMING 892,Codeforces Round #446 (Div. 2),2,Greed,500.0,A,1510929300,[implementation],PROGRAMMING 892,Codeforces Round #446 (Div. 2),2,Wrath,1000.0,B,1510929300,"[implementation, two pointers]",PROGRAMMING 892,Codeforces Round #446 (Div. 2),2,Pride,1500.0,C,1510929300,[greedy],PROGRAMMING -892,Codeforces Round #446 (Div. 2),2,Gluttony,2000.0,D,1510929300,[constructive algorithms],PROGRAMMING +892,Codeforces Round #446 (Div. 2),2,Gluttony,2000.0,D,1510929300,"[constructive algorithms, greedy]",PROGRAMMING 892,Codeforces Round #446 (Div. 2),2,Envy,2500.0,E,1510929300,[],PROGRAMMING 886,Технокубок 2018 - Отборочный Раунд 3,12,ACM ICPC,500.0,A,1510502700,[brute force],PROGRAMMING 886,Технокубок 2018 - Отборочный Раунд 3,12,Vlad and Cafes,1000.0,B,1510502700,[],PROGRAMMING @@ -3660,13 +15909,13 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 887,Codeforces Round #444 (Div. 2),2,Solution for Cube,1500.0,C,1509725100,"[brute force, implementation]",PROGRAMMING 887,Codeforces Round #444 (Div. 2),2,Ratings and Reality Shows,2000.0,D,1509725100,"[data structures, two pointers]",PROGRAMMING 887,Codeforces Round #444 (Div. 2),2,Little Brother,2500.0,E,1509725100,"[binary search, geometry]",PROGRAMMING -887,Codeforces Round #444 (Div. 2),2,Row of Models,3000.0,F,1509725100,[],PROGRAMMING +887,Codeforces Round #444 (Div. 2),2,Row of Models,3000.0,F,1509725100,"[greedy, sortings]",PROGRAMMING 884,Educational Codeforces Round 31,12,Book Reading,,A,1509113100,[implementation],PROGRAMMING 884,Educational Codeforces Round 31,12,Japanese Crosswords Strike Back,,B,1509113100,[implementation],PROGRAMMING -884,Educational Codeforces Round 31,12,Bertown Subway,,C,1509113100,"[dfs and similar, greedy]",PROGRAMMING +884,Educational Codeforces Round 31,12,Bertown Subway,,C,1509113100,"[dfs and similar, greedy, math]",PROGRAMMING 884,Educational Codeforces Round 31,12,Boxes And Balls,,D,1509113100,"[data structures, greedy]",PROGRAMMING 884,Educational Codeforces Round 31,12,Binary Matrix,,E,1509113100,[dsu],PROGRAMMING -884,Educational Codeforces Round 31,12,Anti-Palindromize,,F,1509113100,[flows],PROGRAMMING +884,Educational Codeforces Round 31,12,Anti-Palindromize,,F,1509113100,"[flows, graphs, greedy]",PROGRAMMING 878,Codeforces Round #443 (Div. 1),1,Short Program,500.0,A,1509029100,"[bitmasks, constructive algorithms]",PROGRAMMING 878,Codeforces Round #443 (Div. 1),1,Teams Formation,1250.0,B,1509029100,[implementation],PROGRAMMING 878,Codeforces Round #443 (Div. 1),1,Tournament,1250.0,C,1509029100,"[data structures, graphs]",PROGRAMMING @@ -3691,7 +15940,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lost in Transliteration,,F,1508573100,[implementation],PROGRAMMING 883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Orientation of Edges,,G,1508573100,[graphs],PROGRAMMING 883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Palindromic Cut,,H,1508573100,"[brute force, implementation]",PROGRAMMING -883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Photo Processing,,I,1508573100,[binary search],PROGRAMMING +883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Photo Processing,,I,1508573100,"[binary search, dp]",PROGRAMMING 883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Renovation,,J,1508573100,"[greedy, sortings]",PROGRAMMING 883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Road Widening,,K,1508573100,[implementation],PROGRAMMING 883,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Berland.Taxi,,L,1508573100,[data structures],PROGRAMMING @@ -3708,15 +15957,15 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,Sorting the Coins,2000.0,D,1508151900,"[dsu, sortings, trees, two pointers]",PROGRAMMING 876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,National Property,2500.0,E,1508151900,"[2-sat, dfs and similar, graphs]",PROGRAMMING 876,"Codeforces Round #441 (Div. 2, by Moscow Team Olympiad)",2,High Cry,2750.0,F,1508151900,[data structures],PROGRAMMING -870,Technocup 2018 - Elimination Round 2,12,Search for Pretty Integers,500.0,A,1508054700,[brute force],PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,Search for Pretty Integers,500.0,A,1508054700,"[brute force, implementation]",PROGRAMMING 870,Technocup 2018 - Elimination Round 2,12,Maximum of Maximums of Minimums,1000.0,B,1508054700,[greedy],PROGRAMMING 870,Technocup 2018 - Elimination Round 2,12,Maximum splitting,1500.0,C,1508054700,"[dp, greedy, number theory]",PROGRAMMING 870,Technocup 2018 - Elimination Round 2,12,Something with XOR Queries,2250.0,D,1508054700,"[brute force, probabilities]",PROGRAMMING -870,Technocup 2018 - Elimination Round 2,12,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,"[dfs and similar, dsu, trees]",PROGRAMMING +870,Technocup 2018 - Elimination Round 2,12,"Points, Lines and Ready-made Titles",2500.0,E,1508054700,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING 870,Technocup 2018 - Elimination Round 2,12,Paths,3250.0,F,1508054700,"[data structures, number theory]",PROGRAMMING 871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Maximum splitting,500.0,A,1508054700,"[dp, greedy, math, number theory]",PROGRAMMING 871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Something with XOR Queries,1250.0,B,1508054700,"[brute force, implementation]",PROGRAMMING -871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,"Points, Lines and Ready-made Titles",1500.0,C,1508054700,[dfs and similar],PROGRAMMING +871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,"Points, Lines and Ready-made Titles",1500.0,C,1508054700,"[dfs and similar, graphs]",PROGRAMMING 871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Paths,2250.0,D,1508054700,"[number theory, sortings]",PROGRAMMING 871,"Codeforces Round #440 (Div. 1, based on Technocup 2018 Elimination Round 2)",1,Restore the Tree,2250.0,E,1508054700,"[graphs, greedy, trees]",PROGRAMMING 872,"Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)",2,Search for Pretty Integers,500.0,A,1508054700,[implementation],PROGRAMMING @@ -3727,7 +15976,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 873,Educational Codeforces Round 30,12,Chores,,A,1507817100,[implementation],PROGRAMMING 873,Educational Codeforces Round 30,12,Balanced Substring,,B,1507817100,"[dp, implementation]",PROGRAMMING 873,Educational Codeforces Round 30,12,Strange Game On Matrix,,C,1507817100,"[greedy, two pointers]",PROGRAMMING -873,Educational Codeforces Round 30,12,Merge Sort,,D,1507817100,[divide and conquer],PROGRAMMING +873,Educational Codeforces Round 30,12,Merge Sort,,D,1507817100,"[constructive algorithms, divide and conquer]",PROGRAMMING 873,Educational Codeforces Round 30,12,Awards For Contestants,,E,1507817100,"[brute force, data structures, dp]",PROGRAMMING 873,Educational Codeforces Round 30,12,Forbidden Indices,,F,1507817100,"[dsu, string suffix structures, strings]",PROGRAMMING 869,Codeforces Round #439 (Div. 2),2,The Artful Expedient,500.0,A,1507296900,"[brute force, implementation]",PROGRAMMING @@ -3803,7 +16052,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 847,"2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Weather Tomorrow,,M,1505739900,[implementation],PROGRAMMING 858,Технокубок 2018 - Отборочный Раунд 1,12,k-rounding,750.0,A,1505653500,"[brute force, number theory]",PROGRAMMING 858,Технокубок 2018 - Отборочный Раунд 1,12,Which floor?,750.0,B,1505653500,[brute force],PROGRAMMING -858,Технокубок 2018 - Отборочный Раунд 1,12,Did you mean...,1500.0,C,1505653500,"[dp, greedy]",PROGRAMMING +858,Технокубок 2018 - Отборочный Раунд 1,12,Did you mean...,1500.0,C,1505653500,"[dp, greedy, implementation]",PROGRAMMING 858,Технокубок 2018 - Отборочный Раунд 1,12,Polycarp's phone book,2000.0,D,1505653500,"[data structures, sortings]",PROGRAMMING 858,Технокубок 2018 - Отборочный Раунд 1,12,Tests Renumeration,2500.0,E,1505653500,[implementation],PROGRAMMING 858,Технокубок 2018 - Отборочный Раунд 1,12,Wizard's Tour,3000.0,F,1505653500,"[constructive algorithms, dfs and similar]",PROGRAMMING @@ -3847,7 +16096,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 846,Educational Codeforces Round 28,12,Monitor,,D,1504623900,"[binary search, data structures]",PROGRAMMING 846,Educational Codeforces Round 28,12,Chemistry in Berland,,E,1504623900,"[dfs and similar, greedy, trees]",PROGRAMMING 846,Educational Codeforces Round 28,12,Random Query,,F,1504623900,"[math, two pointers]",PROGRAMMING -850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Five Dimensional Points,500.0,A,1504535700,"[brute force, math]",PROGRAMMING +850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Five Dimensional Points,500.0,A,1504535700,"[brute force, geometry, math]",PROGRAMMING 850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a list of numbers,1000.0,B,1504535700,[number theory],PROGRAMMING 850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Arpa and a game with Mojtaba,1250.0,C,1504535700,"[bitmasks, dp, games]",PROGRAMMING 850,"Codeforces Round #432 (Div. 1, based on IndiaHacks Final Round 2017)",1,Tournament Construction,1750.0,D,1504535700,"[dp, graphs, greedy, math]",PROGRAMMING @@ -3954,7 +16203,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 825,Educational Codeforces Round 25,12,Suitable Replacement,,D,1500217500,"[greedy, implementation]",PROGRAMMING 825,Educational Codeforces Round 25,12,Minimal Labels,,E,1500217500,"[data structures, graphs, greedy]",PROGRAMMING 825,Educational Codeforces Round 25,12,String Compression,,F,1500217500,"[dp, hashing, string suffix structures, strings]",PROGRAMMING -825,Educational Codeforces Round 25,12,Tree Queries,,G,1500217500,"[dfs and similar, trees]",PROGRAMMING +825,Educational Codeforces Round 25,12,Tree Queries,,G,1500217500,"[dfs and similar, graphs, trees]",PROGRAMMING 830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Office Keys,500.0,A,1499958300,"[binary search, brute force, dp, greedy, sortings]",PROGRAMMING 830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Cards Sorting,1000.0,B,1499958300,"[data structures, implementation, sortings]",PROGRAMMING 830,"Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals)",1,Bamboo Partition,1500.0,C,1499958300,"[brute force, math, number theory, sortings, two pointers]",PROGRAMMING @@ -3986,7 +16235,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 823,VK Cup 2017 - Finals,12,Perpetual Motion Machine,2750.0,F,1499587500,[],PROGRAMMING 823,VK Cup 2017 - Finals,12,Dirty Arkady's Kitchen,3500.0,G,1499587500,[],PROGRAMMING 822,Codeforces Round #422 (Div. 2),2,I'm bored with life,500.0,A,1499011500,"[implementation, math, number theory]",PROGRAMMING -822,Codeforces Round #422 (Div. 2),2,Crossword solving,750.0,B,1499011500,"[brute force, implementation]",PROGRAMMING +822,Codeforces Round #422 (Div. 2),2,Crossword solving,750.0,B,1499011500,"[brute force, implementation, strings]",PROGRAMMING 822,Codeforces Round #422 (Div. 2),2,"Hacker, pack your bags!",1250.0,C,1499011500,"[binary search, greedy, sortings]",PROGRAMMING 822,Codeforces Round #422 (Div. 2),2,My pretty girl Noora,1750.0,D,1499011500,"[brute force, dp, greedy, math, number theory]",PROGRAMMING 822,Codeforces Round #422 (Div. 2),2,Liar,2250.0,E,1499011500,"[binary search, dp, hashing, string suffix structures]",PROGRAMMING @@ -4031,7 +16280,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 817,Educational Codeforces Round 23,12,MEX Queries,,F,1497539100,"[binary search, data structures, trees]",PROGRAMMING 814,Codeforces Round #418 (Div. 2),2,An abandoned sentiment from past,500.0,A,1496837700,"[implementation, sortings]",PROGRAMMING 814,Codeforces Round #418 (Div. 2),2,An express train to reveries,1000.0,B,1496837700,[constructive algorithms],PROGRAMMING -814,Codeforces Round #418 (Div. 2),2,An impassioned circulation of affection,1750.0,C,1496837700,"[brute force, dp, two pointers]",PROGRAMMING +814,Codeforces Round #418 (Div. 2),2,An impassioned circulation of affection,1750.0,C,1496837700,"[brute force, dp, strings, two pointers]",PROGRAMMING 814,Codeforces Round #418 (Div. 2),2,An overnight dance in discotheque,1750.0,D,1496837700,"[dfs and similar, dp, geometry, greedy, trees]",PROGRAMMING 814,Codeforces Round #418 (Div. 2),2,An unavoidable detour for home,2500.0,E,1496837700,"[combinatorics, dp]",PROGRAMMING 813,Educational Codeforces Round 22,12,The Contest,,A,1496675100,[implementation],PROGRAMMING @@ -4096,6 +16345,12 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Aquarium decoration,2500.0,E,1494516900,"[data structures, greedy, two pointers]",PROGRAMMING 799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Beautiful fountains rows,3250.0,F,1494516900,[data structures],PROGRAMMING 799,"Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2)",12,Cut the pie,3500.0,G,1494516900,"[binary search, data structures, geometry]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Prairie Partition,1750.0,C,1494171900,"[binary search, constructive algorithms, greedy, math]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Perishable Roads,2500.0,D,1494171900,"[dp, graphs, shortest paths]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Blog Post Rating,2750.0,E,1494171900,"[data structures, sortings]",PROGRAMMING +773,VK Cup 2017 - Round 3,12,Test Data Generation,3500.0,F,1494171900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING 806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Success Rate,500.0,A,1494171900,"[binary search, math]",PROGRAMMING 806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Dynamic Problem Scoring,1000.0,B,1494171900,"[brute force, greedy]",PROGRAMMING 806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Prairie Partition,1750.0,C,1494171900,"[binary search, greedy]",PROGRAMMING @@ -4103,7 +16358,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Blog Post Rating,2750.0,E,1494171900,[data structures],PROGRAMMING 806,"Codeforces Round #412 (rated, Div. 1, based on VK Cup 2017 Round 3)",1,Test Data Generation,3500.0,F,1494171900,[],PROGRAMMING 807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Is it rated?,500.0,A,1494171900,"[implementation, sortings]",PROGRAMMING -807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,T-Shirt Hunt,1000.0,B,1494171900,[brute force],PROGRAMMING +807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,T-Shirt Hunt,1000.0,B,1494171900,"[brute force, implementation]",PROGRAMMING 807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Success Rate,1500.0,C,1494171900,"[binary search, math]",PROGRAMMING 807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Dynamic Problem Scoring,2000.0,D,1494171900,"[brute force, greedy]",PROGRAMMING 807,"Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3)",2,Prairie Partition,2750.0,E,1494171900,"[binary search, greedy]",PROGRAMMING @@ -4127,6 +16382,7 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 803,Educational Codeforces Round 20,12,Roma and Poker,,E,1493391900,[dp],PROGRAMMING 803,Educational Codeforces Round 20,12,Coprime Subsequences,,F,1493391900,"[bitmasks, combinatorics, number theory]",PROGRAMMING 803,Educational Codeforces Round 20,12,Periodic RMQ Problem,,G,1493391900,[data structures],PROGRAMMING +775,VK Cup 2017 - Wild Card Round 2,12,University Schedule,,A,1493220900,[*special],PROGRAMMING 793,Tinkoff Challenge - Elimination Round,12,Oleg and shares,500.0,A,1492965900,"[implementation, math]",PROGRAMMING 793,Tinkoff Challenge - Elimination Round,12,Igor and his way to work,1000.0,B,1492965900,"[dfs and similar, shortest paths]",PROGRAMMING 793,Tinkoff Challenge - Elimination Round,12,Mice problem,1500.0,C,1492965900,"[geometry, implementation, sortings]",PROGRAMMING @@ -4135,10 +16391,15 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 793,Tinkoff Challenge - Elimination Round,12,Julia the snail,3000.0,F,1492965900,"[data structures, divide and conquer]",PROGRAMMING 793,Tinkoff Challenge - Elimination Round,12,Oleg and chess,3500.0,G,1492965900,"[flows, graph matchings]",PROGRAMMING 798,Codeforces Round #410 (Div. 2),2,Mike and palindrome,500.0,A,1492785300,"[brute force, constructive algorithms, strings]",PROGRAMMING -798,Codeforces Round #410 (Div. 2),2,Mike and strings,1000.0,B,1492785300,"[brute force, strings]",PROGRAMMING +798,Codeforces Round #410 (Div. 2),2,Mike and strings,1000.0,B,1492785300,"[brute force, dp, strings]",PROGRAMMING 798,Codeforces Round #410 (Div. 2),2,Mike and gcd problem,1500.0,C,1492785300,"[dp, greedy, number theory]",PROGRAMMING 798,Codeforces Round #410 (Div. 2),2,Mike and distribution,2000.0,D,1492785300,"[constructive algorithms, sortings]",PROGRAMMING 798,Codeforces Round #410 (Div. 2),2,Mike and code of a permutation,2500.0,E,1492785300,"[constructive algorithms, data structures, graphs, sortings]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Voltage Keepsake,500.0,A,1492356900,"[binary search, math]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING +772,VK Cup 2017 - Round 2,12,Vulnerable Kerbals,1750.0,C,1492356900,"[dp, graphs, number theory]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Varying Kibibits,2250.0,D,1492356900,"[bitmasks, dp]",PROGRAMMING +772,VK Cup 2017 - Round 2,12,Verifying Kingdom,2250.0,E,1492356900,"[binary search, trees]",PROGRAMMING 800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Voltage Keepsake,500.0,A,1492356900,"[binary search, greedy]",PROGRAMMING 800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Volatile Kite,1000.0,B,1492356900,[geometry],PROGRAMMING 800,"Codeforces Round #409 (rated, Div. 1, based on VK Cup 2017 Round 2)",1,Vulnerable Kerbals,1750.0,C,1492356900,[number theory],PROGRAMMING @@ -4161,6 +16422,18 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 796,Codeforces Round #408 (Div. 2),2,Police Stations,1500.0,D,1491842100,"[constructive algorithms, shortest paths, trees]",PROGRAMMING 796,Codeforces Round #408 (Div. 2),2,Exam Cheating,2000.0,E,1491842100,"[binary search, dp]",PROGRAMMING 796,Codeforces Round #408 (Div. 2),2,Sequence Recovery,2500.0,F,1491842100,"[bitmasks, data structures, greedy]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Amusement Park,,A,1491406500,"[*special, ternary search]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Significant Cups,,B,1491406500,"[*special, binary search, data structures, two pointers]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Lie or Truth,,D,1491406500,"[*special, constructive algorithms, sortings]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Big Number and Remainder,,E,1491406500,"[*special, math, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Pens And Days Of Week,,F,1491406500,"[*special, binary search, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Perfectionist Arkadiy,,G,1491406500,"[*special, number theory]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Repairing Of String,,H,1491406500,"[*special, constructive algorithms]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Composing Of String,,I,1491406500,"[*special, dp]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING +774,VK Cup 2017 - Wild Card Round 1,12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING 795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Amusement Park,,A,1491406500,"[*special, brute force, ternary search]",PROGRAMMING 795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Significant Cups,,B,1491406500,"[*special, binary search, sortings, two pointers]",PROGRAMMING 795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Maximum Number,,C,1491406500,"[*special, constructive algorithms, greedy]",PROGRAMMING @@ -4173,9 +16446,4116 @@ contestID,contestName,division,name,points,problemID,startTimeSeconds,tags,type 795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan's Series,,J,1491406500,"[*special, dp]",PROGRAMMING 795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Stepan and Vowels,,K,1491406500,"[*special, implementation, strings]",PROGRAMMING 795,VK Cup 2017 - Wild Card Round 1 (Unofficial Public Mirror),12,Bars,,L,1491406500,"[*special, binary search]",PROGRAMMING -A,Points on the line,500.0,[brute force],PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 -B,Our Tanya is Crying Out Loud,1250.0,[greedy],PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 -C,Phone Numbers,1250.0,[constructive algorithms],PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 -D,Alena And The Heater,1500.0,[implementation],PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 -E,Cashback,2000.0,"[data structures, dp, greedy]",PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 -F,Machine Learning,2750.0,"[brute force, data structures]",PROGRAMMING,940,Codeforces Round #466 (Div. 2),1519464900,2 +784,April Fools Contest 2017,12,Numbers Joke,,A,1490972400,[*special],PROGRAMMING +784,April Fools Contest 2017,12,Kids' Riddle,,B,1490972400,[*special],PROGRAMMING +784,April Fools Contest 2017,12,INTERCALC,,C,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Touchy-Feely Palindromes,,D,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Twisted Circuit,,E,1490972400,"[*special, brute force, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,Crunching Numbers Just for You,,F,1490972400,"[*special, implementation]",PROGRAMMING +784,April Fools Contest 2017,12,BF Calculator,,G,1490972400,[*special],PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Functions again,500.0,A,1490803500,"[dp, two pointers]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Weird journey,1250.0,B,1490803500,"[combinatorics, dfs and similar, dsu, graphs]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,The Great Mixing,1500.0,C,1490803500,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,Finding lines,2000.0,D,1490803500,"[constructive algorithms, divide and conquer]",PROGRAMMING +788,Codeforces Round #407 (Div. 1),1,New task,2250.0,E,1490803500,[data structures],PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Anastasia and pebbles,500.0,A,1490803500,"[implementation, math]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Masha and geometric depression,1000.0,B,1490803500,"[brute force, implementation, math]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Functions again,1500.0,C,1490803500,"[data structures, dp]",PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,Weird journey,2250.0,D,1490803500,[graphs],PROGRAMMING +789,Codeforces Round #407 (Div. 2),2,The Great Mixing,2500.0,E,1490803500,"[brute force, dfs and similar, dp, graph matchings, math]",PROGRAMMING +792,Educational Codeforces Round 18,12,New Bus Route,,A,1490625300,"[implementation, sortings]",PROGRAMMING +792,Educational Codeforces Round 18,12,Counting-out Rhyme,,B,1490625300,[implementation],PROGRAMMING +792,Educational Codeforces Round 18,12,Divide by Three,,C,1490625300,"[dp, greedy, math, number theory]",PROGRAMMING +792,Educational Codeforces Round 18,12,Paths in a Complete Binary Tree,,D,1490625300,"[bitmasks, trees]",PROGRAMMING +792,Educational Codeforces Round 18,12,Colored Balls,,E,1490625300,"[greedy, math]",PROGRAMMING +792,Educational Codeforces Round 18,12,Mages and Monsters,,F,1490625300,"[data structures, geometry]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Berzerk,750.0,A,1490281500,"[dfs and similar, dp, games]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Legacy,1000.0,B,1490281500,"[data structures, graphs, shortest paths]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Till I Collapse,1500.0,C,1490281500,"[data structures, divide and conquer]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,Rap God,2000.0,D,1490281500,"[data structures, dfs and similar, hashing, strings, trees]",PROGRAMMING +786,Codeforces Round #406 (Div. 1),1,ALT,2500.0,E,1490281500,"[data structures, flows, graphs, trees]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,The Monster,500.0,A,1490281500,"[brute force, math]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Not Afraid,1000.0,B,1490281500,"[greedy, implementation]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Berzerk,1750.0,C,1490281500,"[dp, games]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Legacy,2000.0,D,1490281500,"[data structures, shortest paths]",PROGRAMMING +787,Codeforces Round #406 (Div. 2),2,Till I Collapse,2500.0,E,1490281500,"[data structures, trees]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Friendship Condition,250.0,A,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Different Names,500.0,B,1489851300,"[constructive algorithms, greedy]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Tree Jumps,1000.0,C,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Company,1500.0,D,1489851300,[dp],PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Rectangle Strips,2250.0,E,1489851300,"[dp, greedy]",PROGRAMMING +771,VK Cup 2017 - Round 1,12,Bear and Isomorphic Points,2500.0,F,1489851300,"[geometry, two pointers]",PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Different Names,500.0,A,1489851300,"[constructive algorithms, greedy]",PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Tree Jumps,1000.0,B,1489851300,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Company,1500.0,C,1489851300,[dp],PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Rectangle Strips,2250.0,D,1489851300,[dp],PROGRAMMING +790,"Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1)",1,Bear and Isomorphic Points,2500.0,E,1489851300,[],PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Big Brother,500.0,A,1489851300,[implementation],PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Friendship Condition,1000.0,B,1489851300,"[dfs and similar, dsu, graphs]",PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Different Names,1500.0,C,1489851300,"[constructive algorithms, greedy]",PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Tree Jumps,2000.0,D,1489851300,"[dfs and similar, dp, trees]",PROGRAMMING +791,"Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1)",2,Bear and Company,2500.0,E,1489851300,[],PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Polyhedrons,500.0,A,1489590300,[implementation],PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Classes,1000.0,B,1489590300,"[greedy, sortings]",PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Fairy Tale,1500.0,C,1489590300,"[binary search, math]",PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and School - 2,2250.0,D,1489590300,"[combinatorics, math, number theory]",PROGRAMMING +785,Codeforces Round #404 (Div. 2),2,Anton and Permutation,2500.0,E,1489590300,"[brute force, data structures]",PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,New Password,500.0,A,1489233600,[implementation],PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,Maximize Sum of Digits,1000.0,B,1489233600,[implementation],PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,Online Courses In BSU,1500.0,C,1489233600,"[dfs and similar, graphs]",PROGRAMMING +770,VK Cup 2017 - Qualification 2,12,Draw Brackets!,1500.0,D,1489233600,[implementation],PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Colored Balloons,500.0,A,1488719100,"[brute force, constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Innokenty and a Football League,1000.0,B,1488719100,"[2-sat, brute force, graph matchings, greedy, implementation]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Underground Lab,1250.0,C,1488719100,"[brute force, constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Axel and Marston in Bitland,1750.0,D,1488719100,"[bitmasks, brute force, dp, matrices]",PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Andryusha and Nervous Barriers,2250.0,E,1488719100,[data structures],PROGRAMMING +781,"Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)",1,Intranet of Buses,2750.0,F,1488719100,"[binary search, geometry, two pointers]",PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Socks,500.0,A,1488719100,[implementation],PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,The Meeting Place Cannot Be Changed,1000.0,B,1488719100,"[binary search, ternary search]",PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Andryusha and Colored Balloons,1250.0,C,1488719100,[dfs and similar],PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Innokenty and a Football League,1500.0,D,1488719100,[greedy],PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Underground Lab,1750.0,E,1488719100,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING +782,"Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals)",2,Axel and Marston in Bitland,2500.0,F,1488719100,[matrices],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Socks,500.0,A,1488705300,[implementation],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,The Meeting Place Cannot Be Changed,1000.0,B,1488705300,[binary search],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Colored Balloons,1250.0,C,1488705300,[dfs and similar],PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Innokenty and a Football League,1500.0,D,1488705300,"[2-sat, graphs, greedy, implementation]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Underground Lab,1750.0,E,1488705300,"[dfs and similar, graphs]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Axel and Marston in Bitland,2500.0,F,1488705300,"[bitmasks, graphs, matrices]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Andryusha and Nervous Barriers,3000.0,G,1488705300,"[data structures, dp]",PROGRAMMING +780,Технокубок 2017 - Финал (только для онсайт-финалистов),12,Intranet of Buses,3500.0,H,1488705300,"[binary search, geometry, implementation, two pointers]",PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,Year of University Entrance,500.0,A,1488628800,[sortings],PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,News About Credit,1000.0,B,1488628800,"[greedy, two pointers]",PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,Cycle In Maze,1500.0,C,1488628800,"[dfs and similar, greedy, shortest paths]",PROGRAMMING +769,VK Cup 2017 - Qualification 1,12,k-Interesting Pairs Of Integers,2000.0,D,1488628800,"[bitmasks, brute force]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,String Game,500.0,A,1488096300,"[binary search, greedy, strings]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Bitwise Formula,1000.0,B,1488096300,"[bitmasks, brute force, dfs and similar, expression parsing, implementation]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Peterson Polyglot,1500.0,C,1488096300,"[brute force, dfs and similar, dsu, hashing, trees]",PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Parquet Re-laying,2250.0,D,1488096300,[constructive algorithms],PROGRAMMING +778,Codeforces Round #402 (Div. 1),1,Selling Numbers,2250.0,E,1488096300,"[dp, sortings]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Pupils Redistribution,500.0,A,1488096300,"[constructive algorithms, math]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Weird Rounding,1000.0,B,1488096300,"[brute force, greedy]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Dishonest Sellers,1000.0,C,1488096300,"[greedy, sortings]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,String Game,1500.0,D,1488096300,"[binary search, strings]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Bitwise Formula,2000.0,E,1488096300,"[data structures, expression parsing, greedy]",PROGRAMMING +779,Codeforces Round #402 (Div. 2),2,Peterson Polyglot,2500.0,F,1488096300,[],PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Shell Game,500.0,A,1487930700,"[constructive algorithms, implementation]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Game of Credit Cards,1000.0,B,1487930700,"[data structures, dp, greedy, sortings]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Alyona and Spreadsheet,1500.0,C,1487930700,"[binary search, dp, implementation, two pointers]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Cloud of Hashtags,2000.0,D,1487930700,"[binary search, greedy, implementation, strings]",PROGRAMMING +777,Codeforces Round #401 (Div. 2),2,Hanoi Factory,2500.0,E,1487930700,"[brute force, data structures, dp, greedy, sortings]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,A Serial Killer,500.0,A,1487861100,[implementation],PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and his girlfriend,1000.0,B,1487861100,[number theory],PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Molly's Chemicals,1500.0,C,1487861100,"[binary search, data structures, math]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Door Problem,2000.0,D,1487861100,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,The Holmes Children,2250.0,E,1487861100,"[math, number theory]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock's bet to Moriarty,3000.0,F,1487861100,"[constructive algorithms, geometry, graphs, trees]",PROGRAMMING +776,"ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)",12,Sherlock and the Encrypted Data,3250.0,G,1487861100,"[bitmasks, combinatorics, dp]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Oath of the Night's Watch,500.0,A,1487606700,"[constructive algorithms, sortings]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Code For 1,1000.0,B,1487606700,"[constructive algorithms, dfs and similar, divide and conquer]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon Snow and his Favourite Number,1250.0,C,1487606700,"[brute force, dp, implementation, sortings]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Jon and Orbs,1750.0,D,1487606700,"[dp, math, probabilities]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Game of Stones,2000.0,E,1487606700,"[dp, games]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,Barrels and boxes,2250.0,F,1487606700,"[brute force, combinatorics, number theory, probabilities]",PROGRAMMING +768,"Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)",12,The Winds of Winter,2750.0,G,1487606700,[data structures],PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Snacktower,500.0,A,1487408700,"[data structures, implementation]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,The Queue,1250.0,B,1487408700,"[brute force, greedy]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Garland,1500.0,C,1487408700,"[dfs and similar, graphs, greedy, trees]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Cartons of milk,2000.0,D,1487408700,"[binary search, data structures, greedy, sortings, two pointers]",PROGRAMMING +767,Codeforces Round #398 (Div. 2),2,Change-free,2500.0,E,1487408700,[greedy],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Neverending competitions,500.0,A,1487059500,[implementation],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Code obfuscation,1000.0,B,1487059500,"[implementation, strings]",PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Table Tennis Game 2,1250.0,C,1487059500,[math],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Artsem and Saunders,2000.0,D,1487059500,"[constructive algorithms, dsu, math]",PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Tree Folding,2500.0,E,1487059500,"[dfs and similar, dp, implementation, trees]",PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,Souvenirs,3250.0,F,1487059500,[data structures],PROGRAMMING +765,Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined),12,"Math, math everywhere",3500.0,G,1487059500,[],PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and Longest Uncommon Subsequence,500.0,A,1486487100,"[constructive algorithms, strings]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Triangle,1000.0,B,1486487100,"[constructive algorithms, geometry, greedy, sortings]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Message,1500.0,C,1486487100,"[brute force, dp, strings]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a Dictionary,2000.0,D,1486487100,"[data structures, dfs and similar, dsu, graphs]",PROGRAMMING +766,Codeforces Round #396 (Div. 2),2,Mahmoud and a xor trip,2500.0,E,1486487100,"[bitmasks, constructive algorithms, data structures, dfs and similar, dp, trees]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and a tree,500.0,A,1486042500,"[dfs and similar, dp, dsu, trees]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and rectangles,750.0,B,1486042500,[constructive algorithms],PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and remoduling,1500.0,C,1486042500,"[brute force, number theory]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and a flat tree,2000.0,D,1486042500,"[data structures, hashing, trees]",PROGRAMMING +763,Codeforces Round #395 (Div. 1),1,Timofey and our friends animals,2500.0,E,1486042500,[dsu],PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Taymyr is calling you,500.0,A,1486042500,"[brute force, implementation, math]",PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and cubes,1000.0,B,1486042500,"[constructive algorithms, implementation]",PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and a tree,1500.0,C,1486042500,[dfs and similar],PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and rectangles,1750.0,D,1486042500,[],PROGRAMMING +764,Codeforces Round #395 (Div. 2),2,Timofey and remoduling,2500.0,E,1486042500,[],PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Stairs,500.0,A,1485873300,"[brute force, constructive algorithms, math]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and friends,1000.0,B,1485873300,"[brute force, implementation, math]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Password,1500.0,C,1485873300,"[brute force, dp, implementation]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Very Difficult Problem,2000.0,D,1485873300,"[binary search, brute force, constructive algorithms, greedy, sortings]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Puzzle,2500.0,E,1485873300,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +761,Codeforces Round #394 (Div. 2),2,Dasha and Photos,3000.0,F,1485873300,"[brute force, data structures]",PROGRAMMING +762,Educational Codeforces Round 17,12,k-th divisor,,A,1485354900,"[math, number theory]",PROGRAMMING +762,Educational Codeforces Round 17,12,USB vs. PS/2,,B,1485354900,"[greedy, sortings, two pointers]",PROGRAMMING +762,Educational Codeforces Round 17,12,Two strings,,C,1485354900,"[binary search, hashing, two pointers]",PROGRAMMING +762,Educational Codeforces Round 17,12,Maximum path,,D,1485354900,"[dp, implementation]",PROGRAMMING +762,Educational Codeforces Round 17,12,Radio stations,,E,1485354900,"[binary search, data structures]",PROGRAMMING +762,Educational Codeforces Round 17,12,Tree nesting,,F,1485354900,"[combinatorics, graphs, trees]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Pavel and barbecue,500.0,A,1485108900,[dfs and similar],PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Travel Card,1000.0,B,1485108900,"[binary search, dp]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Nikita and stack,1500.0,C,1485108900,[data structures],PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Bacterial Melee,2000.0,D,1485108900,"[brute force, combinatorics, dp, string suffix structures]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Byteland coins,2500.0,E,1485108900,"[combinatorics, dp, math]",PROGRAMMING +756,8VC Venture Cup 2017 - Final Round,12,Long number,3000.0,F,1485108900,"[expression parsing, math, number theory]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Pavel and barbecue,500.0,A,1485108900,"[dfs and similar, dsu]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Travel Card,1000.0,B,1485108900,"[binary search, dp, greedy, two pointers]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Nikita and stack,1500.0,C,1485108900,"[binary search, data structures]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Bacterial Melee,2000.0,D,1485108900,[dp],PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Byteland coins,2500.0,E,1485108900,"[dp, math]",PROGRAMMING +759,Codeforces Round #393 (Div. 1) (8VC Venture Cup 2017 - Final Round Div. 1 Edition),1,Long number,3000.0,F,1485108900,[],PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Petr and a calendar,500.0,A,1485108900,"[implementation, math]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Frodo and pillows,1000.0,B,1485108900,"[binary search, greedy]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Pavel and barbecue,1500.0,C,1485108900,"[dfs and similar, graphs]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Travel Card,2000.0,D,1485108900,"[binary search, dp, two pointers]",PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Nikita and stack,2500.0,E,1485108900,[],PROGRAMMING +760,Codeforces Round #393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition),2,Bacterial Melee,3000.0,F,1485108900,[],PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Holiday Of Equality,500.0,A,1484838300,"[implementation, math]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Blown Garland,1000.0,B,1484838300,[implementation],PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Unfair Poll,1500.0,C,1484838300,"[binary search, implementation, math]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Ability To Convert,1750.0,D,1484838300,"[dp, greedy, strings]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Broken Tree,2500.0,E,1484838300,"[dfs and similar, greedy, trees]",PROGRAMMING +758,Codeforces Round #392 (Div. 2),2,Geometrical Progression,3000.0,F,1484838300,"[brute force, math, number theory]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Hypothesis,500.0,A,1484499900,"[brute force, graphs, math]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Game,1000.0,B,1484499900,"[binary search, data structures, games, greedy, sortings]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Forest,1500.0,C,1484499900,"[dfs and similar, dsu, graphs]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Polygon,2250.0,D,1484499900,[data structures],PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and White-Red graph,2500.0,E,1484499900,"[constructive algorithms, graphs, shortest paths]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Gifts,2750.0,F,1484499900,"[bitmasks, dp, greedy]",PROGRAMMING +755,8VC Venture Cup 2017 - Elimination Round,12,PolandBall and Many Other Balls,3500.0,G,1484499900,"[combinatorics, divide and conquer, dp, fft, math, number theory]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Gotta Catch Em' All!,500.0,A,1484235300,[implementation],PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash's Big Day,1000.0,B,1484235300,"[greedy, math, number theory]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity is Coming!,1500.0,C,1484235300,"[data structures, hashing, sortings, strings]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Felicity's Big Secret Revealed,2000.0,D,1484235300,"[bitmasks, dp]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Bash Plays with Functions,2500.0,E,1484235300,"[brute force, combinatorics, dp, number theory]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Team Rocket Rises Again,2750.0,F,1484235300,"[data structures, graphs, shortest paths]",PROGRAMMING +757,"Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)",12,Can Bash Save the Day?,3500.0,G,1484235300,"[data structures, divide and conquer, graphs, trees]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Lesha and array splitting,500.0,A,1483713300,"[constructive algorithms, greedy]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Ilya and tic-tac-toe game,1000.0,B,1483713300,"[brute force, implementation]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Vladik and chat,1500.0,C,1483713300,"[brute force, constructive algorithms, dp, implementation, strings]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Fedor and coupons,2000.0,D,1483713300,"[binary search, data structures, greedy, sortings]",PROGRAMMING +754,Codeforces Round #390 (Div. 2),2,Dasha and cyclic table,2500.0,E,1483713300,"[bitmasks, brute force, fft]",PROGRAMMING +750,Good Bye 2016,12,New Year and Hurry,500.0,A,1483107300,"[binary search, brute force, implementation, math]",PROGRAMMING +750,Good Bye 2016,12,New Year and North Pole,750.0,B,1483107300,[implementation],PROGRAMMING +750,Good Bye 2016,12,New Year and Rating,1000.0,C,1483107300,"[binary search, greedy, math]",PROGRAMMING +750,Good Bye 2016,12,New Year and Fireworks,1500.0,D,1483107300,"[brute force, data structures, dfs and similar, dp, implementation]",PROGRAMMING +750,Good Bye 2016,12,New Year and Old Subsequence,2250.0,E,1483107300,"[data structures, divide and conquer, dp]",PROGRAMMING +750,Good Bye 2016,12,New Year and Finding Roots,3000.0,F,1483107300,"[constructive algorithms, implementation, trees]",PROGRAMMING +750,Good Bye 2016,12,New Year and Binary Tree Paths,3250.0,G,1483107300,"[bitmasks, brute force, combinatorics, dp]",PROGRAMMING +750,Good Bye 2016,12,New Year and Snowy Grid,3500.0,H,1483107300,"[dfs and similar, dsu, graphs]",PROGRAMMING +753,Testing Round #13,12,Santa Claus and Candies,500.0,A,1483002300,"[dp, greedy, math]",PROGRAMMING +753,Testing Round #13,12,Interactive Bulls and Cows (Easy),1000.0,B,1483002300,"[brute force, constructive algorithms, implementation]",PROGRAMMING +753,Testing Round #13,12,Interactive Bulls and Cows (Hard),1500.0,C,1483002300,"[brute force, constructive algorithms]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Place in a Class,500.0,A,1482656700,"[implementation, math]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Keyboard Check,1000.0,B,1482656700,"[implementation, strings]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Robot,1500.0,C,1482656700,"[constructive algorithms, math]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and a Palindrome,2000.0,D,1482656700,"[constructive algorithms, data structures, greedy]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Claus and Tangerines,2500.0,E,1482656700,"[binary search, greedy, two pointers]",PROGRAMMING +748,Technocup 2017 - Elimination Round 3,12,Santa Clauses and a Soccer Championship,2500.0,F,1482656700,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Place in a Class,500.0,A,1482656700,"[constructive algorithms, math]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Keyboard Check,1000.0,B,1482656700,"[greedy, implementation, strings]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Robot,1500.0,C,1482656700,"[greedy, shortest paths]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and a Palindrome,2000.0,D,1482656700,"[data structures, greedy, hashing, strings]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Claus and Tangerines,2500.0,E,1482656700,"[binary search, dp, two pointers]",PROGRAMMING +752,"Codeforces Round #389 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 3)",2,Santa Clauses and a Soccer Championship,2500.0,F,1482656700,[trees],PROGRAMMING +751,Технокубок 2017 - Ознакомительный Раунд 3,12,Оценки Васи,500.0,A,1482395400,[],PROGRAMMING +751,Технокубок 2017 - Ознакомительный Раунд 3,12,Путь Поликарпа,1000.0,B,1482395400,[],PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Bachgold Problem,500.0,A,1482165300,"[greedy, implementation, math, number theory]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Parallelogram is Back,1000.0,B,1482165300,"[brute force, constructive algorithms, geometry]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Voting,1500.0,C,1482165300,"[greedy, implementation, two pointers]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Leaving Auction,2000.0,D,1482165300,"[binary search, data structures]",PROGRAMMING +749,Codeforces Round #388 (Div. 2),2,Inversions After Shuffle,2500.0,E,1482165300,"[data structures, probabilities]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Display Size,500.0,A,1482113100,"[brute force, math]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Mammoth's Genome Decoding,1000.0,B,1482113100,"[implementation, strings]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Servers,1500.0,C,1482113100,[implementation],PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Winter Is Coming,2000.0,D,1482113100,"[greedy, sortings]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Comments,2000.0,E,1482113100,"[dfs and similar, expression parsing]",PROGRAMMING +747,Codeforces Round #387 (Div. 2),2,Igor and Interesting Numbers,2500.0,F,1482113100,"[brute force, combinatorics, dp]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Compote,500.0,A,1482057300,[math],PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Decoding,1000.0,B,1482057300,"[implementation, strings]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Tram,1500.0,C,1482057300,"[constructive algorithms, implementation, math]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Green and Black Tea,2000.0,D,1482057300,"[constructive algorithms, greedy]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Numbers Exchange,2500.0,E,1482057300,"[greedy, implementation]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,Music in Car,3000.0,F,1482057300,"[data structures, greedy, two pointers]",PROGRAMMING +746,Codeforces Round #386 (Div. 2),2,New Roads,3000.0,G,1482057300,"[constructive algorithms, trees]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Builds A Nation,500.0,A,1481992500,"[dfs and similar, graphs]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow's Game,1250.0,B,1481992500,"[bitmasks, divide and conquer]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Buys a Deck of Cards,1750.0,C,1481992500,"[bitmasks, brute force, dp]",PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Draws a Circle,2250.0,D,1481992500,[geometry],PROGRAMMING +744,Codeforces Round #385 (Div. 1),1,Hongcow Masters the Cyclic Shift,2500.0,E,1481992500,[strings],PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Learns the Cyclic Shift,500.0,A,1481992500,"[implementation, strings]",PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Solves A Puzzle,1000.0,B,1481992500,[implementation],PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Builds A Nation,1500.0,C,1481992500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow's Game,2250.0,D,1481992500,[bitmasks],PROGRAMMING +745,Codeforces Round #385 (Div. 2),2,Hongcow Buys a Deck of Cards,2750.0,E,1481992500,[],PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Vladik and flights,500.0,A,1481726100,"[constructive algorithms, greedy, implementation]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Chloe and the sequence ,1000.0,B,1481726100,"[binary search, bitmasks, constructive algorithms, implementation]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Vladik and fractions,1250.0,C,1481726100,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Chloe and pleasant prizes,2000.0,D,1481726100,"[dfs and similar, dp, trees]",PROGRAMMING +743,Codeforces Round #384 (Div. 2),2,Vladik and cards,2500.0,E,1481726100,"[binary search, bitmasks, brute force, dp]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa's loud Owf and Mehrdad's evil plan,500.0,A,1481034900,"[dfs and similar, math]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa's weak amphitheater and Mehrdad's valuable Hoses,1000.0,B,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa’s overnight party and Mehrdad’s silent entering,1250.0,C,1481034900,"[constructive algorithms, dfs and similar]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths,2000.0,D,1481034900,"[data structures, trees]",PROGRAMMING +741,Codeforces Round #383 (Div. 1),1,Arpa’s abnormal DNA and Mehrdad’s deep interest,2500.0,E,1481034900,"[data structures, string suffix structures]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa’s hard exam and Mehrdad’s naive cheat,500.0,A,1481034900,"[implementation, math, number theory]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa’s obvious problem and Mehrdad’s terrible solution,1000.0,B,1481034900,"[math, number theory]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa's loud Owf and Mehrdad's evil plan,1500.0,C,1481034900,"[dfs and similar, math]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa's weak amphitheater and Mehrdad's valuable Hoses,2000.0,D,1481034900,"[dfs and similar, dp, dsu]",PROGRAMMING +742,Codeforces Round #383 (Div. 2),2,Arpa’s overnight party and Mehrdad’s silent entering,2250.0,E,1481034900,[],PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Ostap and Grasshopper,500.0,A,1480264500,"[implementation, strings]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Urbanization,1000.0,B,1480264500,"[greedy, sortings]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Tennis Championship,1750.0,C,1480264500,"[greedy, math]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Taxes,1750.0,D,1480264500,"[math, number theory]",PROGRAMMING +735,Codeforces Round #382 (Div. 2),2,Ostap and Tree,2500.0,E,1480264500,"[dp, trees]",PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Tennis Championship,750.0,A,1480264500,"[dfs and similar, dp, math]",PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Taxes,750.0,B,1480264500,"[math, number theory]",PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Ostap and Tree,1500.0,C,1480264500,[dp],PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Permutations,2000.0,D,1480264500,[matrices],PROGRAMMING +736,Codeforces Round #382 (Div. 1),1,Chess Championship,2500.0,E,1480264500,"[constructive algorithms, flows, greedy]",PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Alyona and mex,500.0,A,1479918900,"[constructive algorithms, greedy]",PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Alyona and a tree,1000.0,B,1479918900,"[binary search, data structures, dfs and similar, graphs, trees]",PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Alyona and towers,1500.0,C,1479918900,[data structures],PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Recover a functional graph,2000.0,D,1479918900,[graph matchings],PROGRAMMING +739,Codeforces Round #381 (Div. 1),1,Gosha is hunting,2500.0,E,1479918900,"[brute force, dp, flows, sortings]",PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and copybooks,500.0,A,1479918900,"[brute force, implementation]",PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and flowers,1000.0,B,1479918900,[constructive algorithms],PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and mex,1500.0,C,1479918900,[constructive algorithms],PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and a tree,2000.0,D,1479918900,"[binary search, data structures, dfs and similar, graph matchings, graphs]",PROGRAMMING +740,Codeforces Round #381 (Div. 2),2,Alyona and towers,2500.0,E,1479918900,[],PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Interview with Oleg,500.0,A,1479632700,"[implementation, strings]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Spotlights,1000.0,B,1479632700,"[dp, implementation]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Road to Cinema,1750.0,C,1479632700,"[binary search, greedy, sortings]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Sea Battle,1750.0,D,1479632700,"[constructive algorithms, greedy]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Subordinates,2000.0,E,1479632700,"[constructive algorithms, data structures, greedy, sortings]",PROGRAMMING +729,Technocup 2017 - Elimination Round 2,12,Financiers Game,2500.0,F,1479632700,[dp],PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Road to Cinema,750.0,A,1479632700,[binary search],PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Sea Battle,750.0,B,1479632700,"[greedy, implementation]",PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Subordinates,1000.0,C,1479632700,[greedy],PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Financiers Game,1500.0,D,1479632700,"[dp, games]",PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Tanya is 5!,2000.0,E,1479632700,"[graph matchings, graphs, greedy, schedules]",PROGRAMMING +737,"Codeforces Round #380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2)",1,Dirty plates,2500.0,F,1479632700,"[constructive algorithms, math]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Interview with Oleg,500.0,A,1479632700,"[implementation, strings]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Spotlights,1000.0,B,1479632700,"[brute force, dp, implementation]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Road to Cinema,1750.0,C,1479632700,[binary search],PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Sea Battle,1750.0,D,1479632700,"[binary search, constructive algorithms, greedy]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Subordinates,2000.0,E,1479632700,"[constructive algorithms, greedy]",PROGRAMMING +738,"Codeforces Round #380 (Div. 2, Rated, Based on Technocup 2017 - Elimination Round 2)",2,Financiers Game,2500.0,F,1479632700,"[dp, games]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Danik,500.0,A,1479227700,"[implementation, strings]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Digits,750.0,B,1479227700,"[implementation, math]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Making Potions,1250.0,C,1479227700,"[binary search, dp, greedy, two pointers]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Chess,1500.0,D,1479227700,[implementation],PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and Tree,2000.0,E,1479227700,"[dfs and similar, dp, trees]",PROGRAMMING +734,Codeforces Round #379 (Div. 2),2,Anton and School,2750.0,F,1479227700,"[bitmasks, constructive algorithms, implementation, math]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Grasshopper And the String,500.0,A,1477922700,[implementation],PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Parade,1000.0,B,1477922700,[math],PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Epidemic in Monstropolis,2000.0,C,1477922700,"[constructive algorithms, dp, greedy, two pointers]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Kostya the Sculptor,2000.0,D,1477922700,"[data structures, hashing]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Sleep in Class,2750.0,E,1477922700,"[data structures, math, two pointers]",PROGRAMMING +733,Codeforces Round #378 (Div. 2),2,Drivers Dissatisfaction,3000.0,F,1477922700,"[data structures, dsu, graphs, trees]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Toda 2,,A,1477209600,[greedy],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Minimum and Maximum,,B,1477209600,[constructive algorithms],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bulmart,,C,1477209600,"[binary search, dfs and similar]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Running Over The Bridges,,D,1477209600,"[greedy, implementation]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Award Ceremony,,E,1477209600,[greedy],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Ber Patio,,F,1477209600,[],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Car Repair Shop,,G,1477209600,[implementation],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Delete Them,,H,1477209600,[implementation],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Olympiad in Programming and Sports,,I,1477209600,"[dp, flows, greedy]",PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Bottles,,J,1477209600,[dp],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Roads Orientation Problem,,K,1477209600,[],PROGRAMMING +730,"2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Expression Queries,,L,1477209600,[],PROGRAMMING +725,Canada Cup 2016,12,Jumping Ball,500.0,A,1477148700,[implementation],PROGRAMMING +725,Canada Cup 2016,12,Food on the Plane,1000.0,B,1477148700,[math],PROGRAMMING +725,Canada Cup 2016,12,Hidden Word,1500.0,C,1477148700,"[brute force, constructive algorithms, implementation]",PROGRAMMING +725,Canada Cup 2016,12,Contest Balloons,2250.0,D,1477148700,"[data structures, greedy]",PROGRAMMING +725,Canada Cup 2016,12,Too Much Money,2500.0,E,1477148700,[brute force],PROGRAMMING +725,Canada Cup 2016,12,Family Photos,3250.0,F,1477148700,[greedy],PROGRAMMING +725,Canada Cup 2016,12,Messages on a Tree,3500.0,G,1477148700,[],PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Buy a Shovel,500.0,A,1476714900,"[brute force, constructive algorithms, math]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Cormen --- The Best Friend Of a Man,1000.0,B,1476714900,"[dp, greedy]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Sanatorium,1500.0,C,1476714900,"[constructive algorithms, greedy]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Exams,2000.0,D,1476714900,"[binary search, greedy, sortings]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Sockets,2000.0,E,1476714900,"[greedy, sortings]",PROGRAMMING +732,Codeforces Round #377 (Div. 2),2,Tourist Reform,2500.0,F,1476714900,[dfs and similar],PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Night at the Museum,500.0,A,1476611100,"[implementation, strings]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Coupons and Discounts,1000.0,B,1476611100,"[constructive algorithms, greedy]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Socks,1500.0,C,1476611100,"[dsu, graphs, greedy]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,80-th Level Archeology,2000.0,D,1476611100,"[brute force, data structures, greedy, sortings]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Funny Game,2500.0,E,1476611100,"[dp, games]",PROGRAMMING +731,Codeforces Round #376 (Div. 2),2,Video Cards,3000.0,F,1476611100,"[brute force, data structures, implementation, number theory]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Transformation: from A to B,1000.0,A,1476522300,"[brute force, dfs and similar]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Bill Total Value,1000.0,B,1476522300,"[expression parsing, implementation]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Guess the Array,1500.0,C,1476522300,"[constructive algorithms, math]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,T-shirts Distribution,1500.0,D,1476522300,"[constructive algorithms, flows, greedy]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Games on a CD,2500.0,E,1476522300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +727,"Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2)",2,Polycarp's problems,3000.0,F,1476522300,"[binary search, dp, greedy]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Checking the Calendar,500.0,A,1475928900,[implementation],PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Batch Sort,1000.0,B,1475928900,"[brute force, greedy, implementation]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Ray Tracing,1500.0,C,1475928900,"[greedy, hashing, implementation, math, number theory]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Dense Subsequence,1500.0,D,1475928900,"[data structures, greedy]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Goods transportation,2500.0,E,1475928900,"[dp, flows]",PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Uniformly Branched Trees,2500.0,F,1475928900,[combinatorics],PROGRAMMING +724,"Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)",12,Xor-matic Number of the Graph,2500.0,G,1475928900,"[bitmasks, graphs, math, trees]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,The New Year: Meeting Friends,500.0,A,1475494500,[sortings],PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,Text Document Analysis,1000.0,B,1475494500,"[expression parsing, implementation]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,Polycarp at the Radio,1500.0,C,1475494500,[greedy],PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,Lakes in Berland,2000.0,D,1475494500,"[dfs and similar, dsu, greedy]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,One-Way Reform,2500.0,E,1475494500,"[constructive algorithms, dfs and similar, flows, graphs, greedy]",PROGRAMMING +723,Codeforces Round #375 (Div. 2),2,st-Spanning Tree,3000.0,F,1475494500,"[dsu, graphs, greedy, implementation]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Broken Clock,500.0,A,1475330700,"[brute force, implementation]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Verse Pattern,500.0,B,1475330700,"[implementation, strings]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Destroying Array,1000.0,C,1475330700,"[data structures, dsu]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Generating Sets,1500.0,D,1475330700,"[binary search, data structures, dfs and similar, greedy]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Research Rover,2000.0,E,1475330700,"[combinatorics, dp]",PROGRAMMING +722,"Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined)",12,Cyclic Cipher,2500.0,F,1475330700,"[chinese remainder theorem, implementation, number theory, two pointers]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,One-dimensional Japanese Crossword,500.0,A,1475244300,[implementation],PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Passwords,1000.0,B,1475244300,"[sortings, strings]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Journey,1500.0,C,1475244300,"[dp, graphs]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Maxim and Array,2000.0,D,1475244300,"[constructive algorithms, data structures, greedy]",PROGRAMMING +721,Codeforces Round #374 (Div. 2),2,Road to Home,2750.0,E,1475244300,"[binary search, dp]",PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Efim and Strange Grade,500.0,A,1474635900,[implementation],PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Sasha and Array,1250.0,C,1474635900,"[data structures, math, matrices]",PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Andrew and Chemistry,2000.0,D,1474635900,"[hashing, trees]",PROGRAMMING +718,Codeforces Round #373 (Div. 1),1,Matvey's Birthday,2500.0,E,1474635900,[graphs],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Vitya in the Countryside,500.0,A,1474635900,[implementation],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Anatoly and Cockroaches,1000.0,B,1474635900,[greedy],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Efim and Strange Grade,1500.0,C,1474635900,[implementation],PROGRAMMING +719,Codeforces Round #373 (Div. 2),2,Sasha and Array,2250.0,E,1474635900,"[data structures, math, matrices]",PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Closing ceremony,,A,1474196700,[greedy],PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cactusophobia,,B,1474196700,"[dfs and similar, flows]",PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Homework,,C,1474196700,[],PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Slalom,,D,1474196700,"[data structures, dp]",PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Cipher,,E,1474196700,[],PROGRAMMING +720,"Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended]",1,Array Covering,,F,1474196700,[],PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Plus and Square Root,500.0,A,1474119900,"[constructive algorithms, math]",PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Complete The Graph,1000.0,B,1474119900,"[binary search, constructive algorithms, graphs, shortest paths]",PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Digit Tree,1500.0,C,1474119900,"[divide and conquer, dsu]",PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Create a Maze,2500.0,D,1474119900,[constructive algorithms],PROGRAMMING +715,Codeforces Round #372 (Div. 1),1,Complete the Permutations,2750.0,E,1474119900,[],PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Crazy Computer,500.0,A,1474119900,[implementation],PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Complete the Word,1000.0,B,1474119900,[two pointers],PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Plus and Square Root,1500.0,C,1474119900,"[constructive algorithms, math, number theory]",PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Complete The Graph,2000.0,D,1474119900,"[graphs, shortest paths]",PROGRAMMING +716,Codeforces Round #372 (Div. 2),2,Digit Tree,2500.0,E,1474119900,[divide and conquer],PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Sonya and Queries,500.0,A,1473784500,[data structures],PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Searching Rectangles,1000.0,B,1473784500,"[binary search, constructive algorithms]",PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Sonya and Problem Wihtout a Legend,2000.0,C,1473784500,"[dp, sortings]",PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Animals and Puzzle,2000.0,D,1473784500,"[binary search, data structures]",PROGRAMMING +713,Codeforces Round #371 (Div. 1),1,Sonya Partymaker,2000.0,E,1473784500,[],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Meeting of Old Friends,500.0,A,1473784500,[math],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Filya and Homework,1000.0,B,1473784500,[implementation],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Sonya and Queries,1000.0,C,1473784500,[data structures],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Searching Rectangles,2000.0,D,1473784500,[binary search],PROGRAMMING +714,Codeforces Round #371 (Div. 2),2,Sonya and Problem Wihtout a Legend,3000.0,E,1473784500,"[dp, flows, sortings]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Festival Organization,,A,1473584400,"[math, number theory]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,R3D3’s Summer Adventure,,B,1473584400,[greedy],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Potions Homework,,C,1473584400,"[implementation, sortings]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Dexterina’s Lab,,D,1473584400,"[games, matrices, probabilities]",PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,"Paint it really, really dark gray",,E,1473584400,[dfs and similar],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Heroes of Making Magic III,,F,1473584400,[data structures],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Underfail,,G,1473584400,[flows],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Pokermon League challenge,,H,1473584400,[probabilities],PROGRAMMING +717,Bubble Cup 9 - Finals [Online Mirror],12,Cowboy Beblop at his computer,,I,1473584400,[],PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Crow,500.0,A,1473525900,[implementation],PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Trident,1000.0,B,1473525900,[implementation],PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and De-Evolution,1500.0,C,1473525900,"[greedy, math]",PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Scores,2250.0,D,1473525900,"[combinatorics, dp]",PROGRAMMING +712,Codeforces Round #370 (Div. 2),2,Memory and Casinos,2500.0,E,1473525900,"[data structures, math, probabilities]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Bus to Udayland,500.0,A,1472472300,"[brute force, implementation]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Chris and Magic Square,1000.0,B,1472472300,[constructive algorithms],PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Coloring Trees,1500.0,C,1472472300,[dp],PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,Directed Roads,2000.0,D,1472472300,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING +711,Codeforces Round #369 (Div. 2),2,ZS and The Birthday Paradox,2500.0,E,1472472300,"[math, number theory, probabilities]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Letters Cyclic Shift,500.0,A,1472056500,"[constructive algorithms, implementation]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Recover the String,1000.0,B,1472056500,"[constructive algorithms, implementation, math]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Centroids,1500.0,C,1472056500,"[data structures, dfs and similar, dp, greedy, trees]",PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Incorrect Flow,2000.0,D,1472056500,[flows],PROGRAMMING +708,AIM Tech Round 3 (Div. 1),1,Student's Camp,2500.0,E,1472056500,"[dp, math]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Juicer,500.0,A,1472056500,[implementation],PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Checkpoints,1000.0,B,1472056500,"[implementation, sortings]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Letters Cyclic Shift,1500.0,C,1472056500,[greedy],PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Recover the String,2000.0,D,1472056500,"[greedy, math]",PROGRAMMING +709,AIM Tech Round 3 (Div. 2),2,Centroids,2500.0,E,1472056500,"[dp, trees]",PROGRAMMING +710,Educational Codeforces Round 16,12,King Moves,,A,1471875000,[implementation],PROGRAMMING +710,Educational Codeforces Round 16,12,Optimal Point on a Line,,B,1471875000,"[brute force, sortings]",PROGRAMMING +710,Educational Codeforces Round 16,12,Magic Odd Square,,C,1471875000,[constructive algorithms],PROGRAMMING +710,Educational Codeforces Round 16,12,Two Arithmetic Progressions,,D,1471875000,[math],PROGRAMMING +710,Educational Codeforces Round 16,12,Generate a String,,E,1471875000,"[dfs and similar, dp]",PROGRAMMING +710,Educational Codeforces Round 16,12,String Set Queries,,F,1471875000,"[brute force, data structures, hashing, string suffix structures, strings]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Brain's Photos,500.0,A,1471698300,[implementation],PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Bakery,1000.0,B,1471698300,[graphs],PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Pythagorean Triples,1500.0,C,1471698300,"[math, number theory]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Persistent Bookcase ,2000.0,D,1471698300,"[data structures, dfs and similar, implementation]",PROGRAMMING +707,Codeforces Round #368 (Div. 2),2,Garlands,2500.0,E,1471698300,[data structures],PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Beru-taxi,500.0,A,1470933300,"[brute force, geometry, implementation]",PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Interesting drink,1000.0,B,1470933300,"[binary search, implementation]",PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Hard problem,1500.0,C,1470933300,[dp],PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Vasiliy's Multiset,2000.0,D,1470933300,"[binary search, data structures, trees]",PROGRAMMING +706,Codeforces Round #367 (Div. 2),2,Working routine,2500.0,E,1470933300,"[data structures, implementation]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Thor,500.0,A,1470578700,"[brute force, data structures, implementation]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Ant Man,1250.0,B,1470578700,"[dp, graphs, greedy]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Black Widow,1250.0,C,1470578700,"[dp, implementation]",PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Captain America,2000.0,D,1470578700,[flows],PROGRAMMING +704,Codeforces Round #366 (Div. 1),1,Iron Man,2500.0,E,1470578700,"[geometry, trees]",PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Hulk,500.0,A,1470578700,[implementation],PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Spider Man,1000.0,B,1470578700,[games],PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Thor,1500.0,C,1470578700,"[data structures, implementation]",PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Ant Man,2250.0,D,1470578700,"[dp, graphs]",PROGRAMMING +705,Codeforces Round #366 (Div. 2),2,Black Widow,2250.0,E,1470578700,[],PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and Game,500.0,A,1470323700,[implementation],PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and trip,1000.0,B,1470323700,"[implementation, math]",PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Chris and Road,1750.0,C,1470323700,"[geometry, implementation]",PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and Interesting sum,2000.0,D,1470323700,[data structures],PROGRAMMING +703,Codeforces Round #365 (Div. 2),2,Mishka and Divisors,2250.0,E,1470323700,"[dp, number theory]",PROGRAMMING +702,Educational Codeforces Round 15,12,Maximum Increase,,A,1469804400,"[dp, greedy, implementation]",PROGRAMMING +702,Educational Codeforces Round 15,12,Powers of Two,,B,1469804400,"[brute force, data structures, implementation, math]",PROGRAMMING +702,Educational Codeforces Round 15,12,Cellular Network,,C,1469804400,"[binary search, two pointers]",PROGRAMMING +702,Educational Codeforces Round 15,12,Road to Post Office,,D,1469804400,[math],PROGRAMMING +702,Educational Codeforces Round 15,12,Analysis of Pathes in Functional Graph,,E,1469804400,"[data structures, graphs]",PROGRAMMING +702,Educational Codeforces Round 15,12,T-Shirts,,F,1469804400,[data structures],PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,As Fast As Possible,500.0,A,1469205300,"[binary search, math]",PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Connecting Universities,1000.0,B,1469205300,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Break Up,1500.0,C,1469205300,[dfs and similar],PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Huffman Coding on Segment,2250.0,D,1469205300,"[data structures, greedy]",PROGRAMMING +700,Codeforces Round #364 (Div. 1),1,Cool Slogans,3000.0,E,1469205300,"[string suffix structures, strings]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Cards,500.0,A,1469205300,"[greedy, implementation]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Cells Not Under Attack,750.0,B,1469205300,[math],PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,They Are Everywhere,1000.0,C,1469205300,"[binary search, two pointers]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,As Fast As Possible,1500.0,D,1469205300,"[binary search, math]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Connecting Universities,2000.0,E,1469205300,"[dfs and similar, graphs]",PROGRAMMING +701,Codeforces Round #364 (Div. 2),2,Break Up,2500.0,F,1469205300,[graphs],PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Vacations,500.0,A,1468933500,[dp],PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Fix a Tree,1000.0,B,1468933500,"[constructive algorithms, dfs and similar, dsu, trees]",PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,LRU,1500.0,C,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Limak and Shooting Points,2000.0,D,1468933500,"[brute force, geometry]",PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Cron,2500.0,E,1468933500,[],PROGRAMMING +698,Codeforces Round #363 (Div. 1),1,Coprime Permutation,3000.0,F,1468933500,"[combinatorics, number theory]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Launch of Collider,500.0,A,1468933500,[implementation],PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,One Bomb,1000.0,B,1468933500,[implementation],PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Vacations,1500.0,C,1468933500,"[brute force, dp]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Fix a Tree,2000.0,D,1468933500,"[constructive algorithms, dfs and similar, dsu]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,LRU,2500.0,E,1468933500,"[bitmasks, dp, probabilities]",PROGRAMMING +699,Codeforces Round #363 (Div. 2),2,Limak and Shooting Points,3000.0,F,1468933500,[],PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,Lorenzo Von Matterhorn,500.0,A,1468514100,"[data structures, implementation, trees]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,Puzzles,1000.0,B,1468514100,"[dfs and similar, math, probabilities, trees]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,PLEASE,1500.0,C,1468514100,"[combinatorics, dp, implementation, math, matrices]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,Legen...,2000.0,D,1468514100,"[data structures, dp, matrices, strings]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,...Wait for it...,2500.0,E,1468514100,"[data structures, dsu, trees]",PROGRAMMING +696,Codeforces Round #362 (Div. 1),1,...Dary!,3000.0,F,1468514100,"[binary search, geometry, two pointers]",PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Pineapple Incident,500.0,A,1468514100,[math],PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Barnicle,1000.0,B,1468514100,[implementation],PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Lorenzo Von Matterhorn,1500.0,C,1468514100,"[data structures, implementation, trees]",PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Puzzles,2000.0,D,1468514100,[],PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,PLEASE,2500.0,E,1468514100,"[math, number theory]",PROGRAMMING +697,Codeforces Round #362 (Div. 2),2,Legen...,3000.0,F,1468514100,[],PROGRAMMING +691,Educational Codeforces Round 14,12,Fashion in Berland,,A,1468425600,[implementation],PROGRAMMING +691,Educational Codeforces Round 14,12,s-palindrome,,B,1468425600,[implementation],PROGRAMMING +691,Educational Codeforces Round 14,12,Exponential notation,,C,1468425600,[implementation],PROGRAMMING +691,Educational Codeforces Round 14,12,Swaps in Permutation,,D,1468425600,"[dfs and similar, dsu]",PROGRAMMING +691,Educational Codeforces Round 14,12,Xor-sequences,,E,1468425600,[matrices],PROGRAMMING +691,Educational Codeforces Round 14,12,Couple Cover,,F,1468425600,"[brute force, dp, number theory]",PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (easy),,A1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (medium),,A2,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Collective Mindsets (hard),,A3,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (easy),,B1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (medium),,B2,1468137600,[geometry],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Recover Polygon (hard),,B3,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (easy),,C1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (medium),,C2,1468137600,"[dfs and similar, graphs, trees]",PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Brain Network (hard),,C3,1468137600,[trees],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (easy),,D1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (medium),,D2,1468137600,[combinatorics],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,The Wall (hard),,D3,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (I),,E1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Photographs (II),,E2,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (easy),,F1,1468137600,[],PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (medium),,F2,1468137600,"[constructive algorithms, hashing, trees]",PROGRAMMING +690,"Helvetic Coding Contest 2016 online mirror (teams, unrated)",12,Tree of Life (hard),,F3,1468137600,[trees],PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Cellphone,500.0,A,1467822900,"[brute force, constructive algorithms, implementation]",PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Shortcuts,1000.0,B,1467822900,[dfs and similar],PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Chocolate Thieves,1500.0,C,1467822900,"[binary search, math]",PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Friends and Subsequences,2000.0,D,1467822900,"[binary search, data structures]",PROGRAMMING +689,Codeforces Round #361 (Div. 2),2,Mike and Geometry Problem,2500.0,E,1467822900,"[combinatorics, data structures, implementation]",PROGRAMMING +695,VK Cup 2016 - Finals,12,LRU,1250.0,A,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Break Up,1250.0,B,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Limak and Shooting Points,1250.0,C,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Cron,1750.0,D,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Huffman Coding on Segment,2500.0,E,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Coprime Permutation,2500.0,F,1467534000,[],PROGRAMMING +695,VK Cup 2016 - Finals,12,Cool Slogans,3000.0,G,1467534000,[],PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,NP-Hard Problem,500.0,A,1467219900,"[dfs and similar, graphs]",PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,Remainders Game,1000.0,B,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,The Values You Can Make,1500.0,C,1467219900,[dp],PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,Dividing Kingdom II,2000.0,D,1467219900,"[brute force, data structures, dsu, sortings]",PROGRAMMING +687,Codeforces Round #360 (Div. 1),1,TOF,2500.0,E,1467219900,[],PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,Opponents,500.0,A,1467219900,[implementation],PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,Lovely Palindromes,1000.0,B,1467219900,"[constructive algorithms, math]",PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,NP-Hard Problem,1500.0,C,1467219900,"[dfs and similar, graphs]",PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,Remainders Game,2000.0,D,1467219900,"[chinese remainder theorem, math, number theory]",PROGRAMMING +688,Codeforces Round #360 (Div. 2),2,The Values You Can Make,2500.0,E,1467219900,[dp],PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Robbers' watch,500.0,A,1466699700,"[brute force, dp, math]",PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Kay and Snowflake,1250.0,B,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Optimal Point,1250.0,C,1466699700,"[binary search, math]",PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Kay and Eternity,2000.0,D,1466699700,[brute force],PROGRAMMING +685,Codeforces Round #359 (Div. 1),1,Travelling Through the Snow Queen's Kingdom,2500.0,E,1466699700,"[brute force, graphs]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Free Ice Cream,500.0,A,1466699700,"[constructive algorithms, implementation]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Little Robber Girl's Zoo,1000.0,B,1466699700,"[constructive algorithms, implementation, sortings]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Robbers' watch,1500.0,C,1466699700,"[brute force, math]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Kay and Snowflake,2250.0,D,1466699700,"[data structures, dfs and similar, trees]",PROGRAMMING +686,Codeforces Round #359 (Div. 2),2,Optimal Point,2250.0,E,1466699700,[],PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Numbers,500.0,A,1466181300,"[constructive algorithms, number theory]",PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Mex,1000.0,B,1466181300,[sortings],PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and the Tree,1500.0,C,1466181300,"[dfs and similar, dp, trees]",PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Strings,2000.0,D,1466181300,"[dp, strings]",PROGRAMMING +682,Codeforces Round #358 (Div. 2),2,Alyona and Triangles,3000.0,E,1466181300,"[geometry, two pointers]",PROGRAMMING +683,Surprise Language Round #8,12,The Check of the Point,,A,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,The Teacher of Physical Education,,B,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Symmetric Difference,,C,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Chocolate Bar,,D,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Hammer throwing,,E,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Reformat the String,,F,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,The Fraction,,G,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Exchange of Books,,H,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,Loader,,I,1466092800,[*special],PROGRAMMING +683,Surprise Language Round #8,12,The Hero with Bombs,,J,1466092800,[*special],PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,A Good Contest,500.0,A,1465922100,[implementation],PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Economy Game,1000.0,B,1465922100,[brute force],PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Heap Operations,1500.0,C,1465922100,"[data structures, greedy]",PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Gifts by the List,2000.0,D,1465922100,"[dfs and similar, trees]",PROGRAMMING +681,Codeforces Round #357 (Div. 2),2,Runaway to a Shadow,2500.0,E,1465922100,[geometry],PROGRAMMING +678,Educational Codeforces Round 13,12,Johny Likes Numbers,,A,1465834200,[implementation],PROGRAMMING +678,Educational Codeforces Round 13,12,The Same Calendar,,B,1465834200,[implementation],PROGRAMMING +678,Educational Codeforces Round 13,12,Joty and Chocolate,,C,1465834200,"[implementation, math, number theory]",PROGRAMMING +678,Educational Codeforces Round 13,12,Iterated Linear Function,,D,1465834200,"[math, number theory]",PROGRAMMING +678,Educational Codeforces Round 13,12,Another Sith Tournament,,E,1465834200,"[bitmasks, dp]",PROGRAMMING +678,Educational Codeforces Round 13,12,Lena and Queries,,F,1465834200,"[data structures, divide and conquer, geometry]",PROGRAMMING +684,Codeforces Marathon Round 1,12,Online Exam,,A2,1465722000,[*special],PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Prime 100,750.0,A,1465403700,[constructive algorithms],PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Tower of Cubes,1250.0,B,1465403700,"[dp, greedy]",PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Square Grid,1500.0,C,1465403700,"[dfs and similar, dsu, implementation]",PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Chase,2000.0,D,1465403700,"[brute force, dfs and similar, implementation]",PROGRAMMING +679,Codeforces Round #356 (Div. 1),1,Bear and Bad Powers of 42,2500.0,E,1465403700,[data structures],PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Five Cards,500.0,A,1465403700,"[constructive algorithms, implementation]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Finding Criminals,1000.0,B,1465403700,"[constructive algorithms, implementation]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Prime 100,1750.0,C,1465403700,"[constructive algorithms, number theory]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Tower of Cubes,2250.0,D,1465403700,"[brute force, constructive algorithms, greedy]",PROGRAMMING +680,Codeforces Round #356 (Div. 2),2,Bear and Square Grid,2750.0,E,1465403700,[],PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Fence,500.0,A,1464798900,[implementation],PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Food Processor,1000.0,B,1464798900,"[implementation, math]",PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Label,1500.0,C,1464798900,[implementation],PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Treasure,2250.0,D,1464798900,"[data structures, graphs]",PROGRAMMING +677,Codeforces Round #355 (Div. 2),2,Vanya and Balloons,2250.0,E,1464798900,"[binary search, brute force, dp, implementation]",PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Nicholas and Permutation,500.0,A,1464188700,[implementation],PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Pyramid of Glasses,1000.0,B,1464188700,[implementation],PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Vasya and String,1500.0,C,1464188700,"[binary search, dp, two pointers]",PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,Theseus and labyrinth,2250.0,D,1464188700,"[implementation, shortest paths]",PROGRAMMING +676,Codeforces Round #354 (Div. 2),2,The Last Fight Between Human and AI,2250.0,E,1464188700,[math],PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Infinite Sequence,500.0,A,1463416500,[math],PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Restoring Painting,1000.0,B,1463416500,"[brute force, constructive algorithms, math]",PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Money Transfers,1500.0,C,1463416500,"[data structures, greedy, sortings]",PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Tree Construction,2000.0,D,1463416500,"[data structures, trees]",PROGRAMMING +675,Codeforces Round #353 (Div. 2),2,Trains and Statistic,2500.0,E,1463416500,"[data structures, dp, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Recycling Bottles,500.0,A,1462984500,"[dp, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Robin Hood,1000.0,B,1462984500,"[binary search, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Ultimate Weirdness of an Array,1500.0,C,1462984500,"[data structures, number theory]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Roads in Yusland,2000.0,D,1462984500,"[data structures, dp, greedy]",PROGRAMMING +671,Codeforces Round #352 (Div. 1),1,Organizing a Race,3000.0,E,1462984500,"[data structures, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Summer Camp,500.0,A,1462984500,[implementation],PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Different is Good,1000.0,B,1462984500,"[constructive algorithms, implementation, strings]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Recycling Bottles,1500.0,C,1462984500,"[brute force, geometry, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Robin Hood,2000.0,D,1462984500,"[binary search, greedy]",PROGRAMMING +672,Codeforces Round #352 (Div. 2),2,Ultimate Weirdness of an Array,2500.0,E,1462984500,[],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Colors,500.0,A,1462633500,[implementation],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Two Paths,1000.0,B,1462633500,[constructive algorithms],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Levels and Regions,1750.0,C,1462633500,[dp],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING +643,VK Cup 2016 - Round 3,12,Bears and Juice,3000.0,F,1462633500,[math],PROGRAMMING +643,VK Cup 2016 - Round 3,12,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Game,500.0,A,1462633500,[implementation],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Problems for Round,750.0,B,1462633500,"[greedy, implementation]",PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Colors,1000.0,C,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bear and Two Paths,1500.0,D,1462633500,[],PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Levels and Regions,2250.0,E,1462633500,"[divide and conquer, dp]",PROGRAMMING +673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",2,Bearish Fanpages,3000.0,F,1462633500,[],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Colors,500.0,A,1462633500,"[brute force, data structures, implementation]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Two Paths,1000.0,B,1462633500,"[constructive algorithms, graphs]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Levels and Regions,1750.0,C,1462633500,"[divide and conquer, dp]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bearish Fanpages,2250.0,D,1462633500,[],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bear and Destroying Subtrees,2250.0,E,1462633500,"[dp, math, probabilities, trees]",PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Bears and Juice,3000.0,F,1462633500,[combinatorics],PROGRAMMING +674,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 1 Edition)",1,Choosing Ads,3000.0,G,1462633500,[],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Holidays,500.0,A,1462464300,"[brute force, constructive algorithms]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Game of Robots,750.0,B,1462464300,[implementation],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Cinema,1000.0,C,1462464300,"[implementation, sortings]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Magic Powder - 1,1000.0,D1,1462464300,"[binary search, brute force]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Magic Powder - 2,500.0,D2,1462464300,[binary search],PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Correct Bracket Sequence Editor,2000.0,E,1462464300,"[data structures, dsu]",PROGRAMMING +670,Codeforces Round #350 (Div. 2),2,Restore a Number,2500.0,F,1462464300,"[constructive algorithms, strings]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Reberland Linguistics,500.0,A,1461947700,"[dp, implementation, strings]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,World Tour,1000.0,B,1461947700,"[graphs, shortest paths]",PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Codeword,2000.0,C,1461947700,[combinatorics],PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Chain Reaction,2000.0,D,1461947700,[brute force],PROGRAMMING +666,Codeforces Round #349 (Div. 1),1,Forensic Examination,3000.0,E,1461947700,"[data structures, string suffix structures]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Pouring Rain,500.0,A,1461947700,"[geometry, math]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Coat of Anticubism,1000.0,B,1461947700,"[constructive algorithms, geometry]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Reberland Linguistics,1500.0,C,1461947700,"[dp, strings]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,World Tour,2000.0,D,1461947700,"[brute force, graphs, shortest paths]",PROGRAMMING +667,Codeforces Round #349 (Div. 2),2,Chain Reaction,3000.0,E,1461947700,[],PROGRAMMING +642,VK Cup 2016 - Wild Card Round 2,12,Scheduler for Invokers,,A,1461596400,[*special],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Grasshopper,500.0,A,1461515700,[implementation],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Matrix,750.0,B,1461515700,[implementation],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Dance,1000.0,C,1461515700,"[brute force, constructive algorithms, implementation]",PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Random Variable,1500.0,D,1461515700,"[dp, implementation, math, probabilities]",PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Time Machine,2000.0,E,1461515700,[data structures],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and 2-SAT,3000.0,F,1461515700,[],PROGRAMMING +641,VK Cup 2016 - Round 2,12,Little Artem and Graph,3000.0,G,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Matrix,500.0,A,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Dance,1000.0,B,1461515700,[],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Random Variable,1500.0,C,1461515700,[math],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Time Machine,2000.0,D,1461515700,[data structures],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and 2-SAT,3000.0,E,1461515700,[graphs],PROGRAMMING +668,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 1 Edition)",1,Little Artem and Graph,3000.0,F,1461515700,[dp],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Presents,500.0,A,1461515700,[math],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Grasshopper,1000.0,B,1461515700,[],PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Matrix,1500.0,C,1461515700,"[constructive algorithms, implementation]",PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Dance,2000.0,D,1461515700,"[data structures, implementation, math]",PROGRAMMING +669,"Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition)",2,Little Artem and Time Machine,2500.0,E,1461515700,[data structures],PROGRAMMING +665,Educational Codeforces Round 12,12,Buses Between Cities,,A,1461164400,[implementation],PROGRAMMING +665,Educational Codeforces Round 12,12,Shopping,,B,1461164400,[brute force],PROGRAMMING +665,Educational Codeforces Round 12,12,Simple Strings,,C,1461164400,"[dp, greedy, strings]",PROGRAMMING +665,Educational Codeforces Round 12,12,Simple Subset,,D,1461164400,"[constructive algorithms, greedy]",PROGRAMMING +665,Educational Codeforces Round 12,12,Beautiful Subarrays,,E,1461164400,"[data structures, divide and conquer]",PROGRAMMING +665,Educational Codeforces Round 12,12,Four Divisors,,F,1461164400,"[dp, math, number theory]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Rebus,500.0,A,1460824500,"[constructive algorithms, expression parsing, greedy, math]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,International Olympiad,1000.0,B,1460824500,"[brute force, constructive algorithms, greedy, strings]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Graph Coloring,1500.0,C,1460824500,[dfs and similar],PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,To Hack or not to Hack,2500.0,D,1460824500,"[brute force, dp, greedy]",PROGRAMMING +663,Codeforces Round #347 (Div. 1),1,Binary Table,2500.0,E,1460824500,"[bitmasks, divide and conquer, dp]",PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Complicated GCD,500.0,A,1460824500,[math],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Rebus,1000.0,B,1460824500,[greedy],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,International Olympiad,1500.0,C,1460824500,[greedy],PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,Graph Coloring,2000.0,D,1460824500,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +664,Codeforces Round #347 (Div. 2),2,To Hack or not to Hack,3000.0,E,1460824500,[],PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Gambling Nim,500.0,A,1460729700,"[bitmasks, math, matrices, probabilities]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Graph Coloring,250.0,B,1460729700,[dfs and similar],PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,Binary Table,2250.0,C,1460729700,"[bitmasks, brute force, divide and conquer, dp, fft, math]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,International Olympiad,250.0,D,1460729700,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +662,"CROC 2016 - Final Round [Private, For Onsite Finalists Only]",12,To Hack or not to Hack,2250.0,E,1460729700,"[brute force, dp, greedy]",PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Seasons,,B,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Array Sum,,C,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING +640,VK Cup 2016 - Wild Card Round 1,12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Lazy Caterer Sequence,,A,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Seasons,,B,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Array Sum,,C,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Maximal Difference,,D,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Divisibility Check,,E,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Primes in Interval,,F,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Hungarian Notation,,G,1460306100,[*special],PROGRAMMING +661,VK Cup 2016 - Wild Card Round 1 (Unofficial Open Online Mirror),12,Rotate Matrix,,H,1460306100,[*special],PROGRAMMING +660,Educational Codeforces Round 11,12,Co-prime Array,,A,1460127600,"[greedy, implementation]",PROGRAMMING +660,Educational Codeforces Round 11,12,Seating On Bus,,B,1460127600,[implementation],PROGRAMMING +660,Educational Codeforces Round 11,12,Hard Process,,C,1460127600,"[binary search, dp, two pointers]",PROGRAMMING +660,Educational Codeforces Round 11,12,Number of Parallelograms,,D,1460127600,[geometry],PROGRAMMING +660,Educational Codeforces Round 11,12,Different Subsets For All Tuples,,E,1460127600,[combinatorics],PROGRAMMING +660,Educational Codeforces Round 11,12,Bear and Bowling 4,,F,1460127600,"[binary search, data structures, geometry, ternary search]",PROGRAMMING +656,April Fools Day Contest 2016,12,Da Vinci Powers,,A,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Scrambled,,B,1459526400,"[*special, implementation]",PROGRAMMING +656,April Fools Day Contest 2016,12,Without Text,,C,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Rosetta Problem,,D,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Out of Controls,,E,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,Ace It!,,F,1459526400,[*special],PROGRAMMING +656,April Fools Day Contest 2016,12,You're a Professional,,G,1459526400,[*special],PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Round House,500.0,A,1459353900,"[implementation, math]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Qualifying Contest,1000.0,B,1459353900,[sortings],PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Tanya and Toys,1000.0,C,1459353900,"[greedy, implementation]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Bicycle Race,1250.0,D,1459353900,"[geometry, implementation, math]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,New Reform,1500.0,E,1459353900,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Polycarp and Hay,2000.0,F,1459353900,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING +659,Codeforces Round #346 (Div. 2),2,Fence Divercity,2500.0,G,1459353900,"[combinatorics, dp]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Displayed Friends,500.0,A,1459182900,[implementation],PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Forgotten Tree 3,750.0,B,1459182900,"[constructive algorithms, graphs, trees]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Polynomials,1000.0,C,1459182900,"[hashing, implementation, math]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Contribution,1500.0,D,1459182900,"[data structures, greedy, sortings]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Paradox,2000.0,E,1459182900,"[greedy, math, sortings]",PROGRAMMING +639,VK Cup 2016 - Round 1,12,Bear and Chemistry,3000.0,F,1459182900,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Forgotten Tree 3,500.0,A,1459182900,[graphs],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Polynomials,1000.0,B,1459182900,[math],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Contribution,1500.0,C,1459182900,[sortings],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Paradox,2000.0,D,1459182900,[sortings],PROGRAMMING +657,VK Cup 2016 - Round 1 (Div.1 Edition),1,Bear and Chemistry,3000.0,E,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Reverse Radewoosh,500.0,A,1459182900,[implementation],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Displayed Friends,1000.0,B,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Forgotten Tree 3,1500.0,C,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Polynomials,2000.0,D,1459182900,[],PROGRAMMING +658,VK Cup 2016 - Round 1 (Div. 2 Edition),2,Bear and Contribution,2500.0,E,1459182900,[],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Любимые числа Поликарпа,500.0,A,1458975600,[constructive algorithms],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Этажи,1000.0,B,1458975600,[constructive algorithms],PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Печать условий,1500.0,C,1458975600,"[greedy, sortings]",PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Дефрагментация памяти,2000.0,D,1458975600,"[greedy, implementation]",PROGRAMMING +649,Технокубок 2016 - Отборочный Раунд 2,12,Автобус,2500.0,E,1458975600,"[binary search, data structures, greedy, sortings]",PROGRAMMING +652,Educational Codeforces Round 10,12,Gabriel and Caterpillar,,A,1458910800,[implementation],PROGRAMMING +652,Educational Codeforces Round 10,12,z-sort,,B,1458910800,[sortings],PROGRAMMING +652,Educational Codeforces Round 10,12,Foe Pairs,,C,1458910800,[two pointers],PROGRAMMING +652,Educational Codeforces Round 10,12,Nested Segments,,D,1458910800,"[data structures, sortings]",PROGRAMMING +652,Educational Codeforces Round 10,12,Pursuit For Artifacts,,E,1458910800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +652,Educational Codeforces Round 10,12,Ants on a Circle,,F,1458910800,"[constructive algorithms, math]",PROGRAMMING +647,Технокубок 2016 - Ознакомительный Раунд 2,12,Оценки Васи,500.0,A,1458799200,[],PROGRAMMING +647,Технокубок 2016 - Ознакомительный Раунд 2,12,Звёздное небо,1000.0,B,1458799200,[],PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Наибольший подъем,500.0,A,1458745200,[constructive algorithms],PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собери стол,1000.0,B,1458745200,"[constructive algorithms, sortings]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Путь Робота,1500.0,C,1458745200,"[dfs and similar, graphs]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собачки и миски,2000.0,D,1458745200,"[greedy, sortings]",PROGRAMMING +648,Технокубок 2016 - Отборочный Раунд 1,12,Собери число,2500.0,E,1458745200,[],PROGRAMMING +646,Технокубок 2016 - Ознакомительный Раунд 1,12,Три брата,500.0,A,1458568800,[],PROGRAMMING +646,Технокубок 2016 - Ознакомительный Раунд 1,12,Ошибка передачи сообщения,1000.0,B,1458568800,[strings],PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Home Numbers,500.0,A,1458475200,[constructive algorithms],PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Making Genome in Berland,1000.0,B,1458475200,"[*special, dfs and similar, strings]",PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Road Improvement,1500.0,C,1458475200,"[dfs and similar, greedy, trees]",PROGRAMMING +638,VK Cup 2016 - Qualification Round 2,12,Three-dimensional Turtle Super Computer ,2000.0,D,1458475200,"[brute force, dfs and similar, graphs]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Three Balls,500.0,A,1458376500,"[brute force, implementation, sortings]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Compressing,1000.0,B,1458376500,"[brute force, dfs and similar, dp, strings]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Up-Down,1500.0,C,1458376500,"[brute force, implementation]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Delivery Bears,2000.0,D,1458376500,"[binary search, flows]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Bear and Forgotten Tree 2,2500.0,E,1458376500,"[dfs and similar, dsu, graphs]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Paper task,3500.0,F,1458376500,"[data structures, string suffix structures]",PROGRAMMING +653,IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2),12,Move by Prime,3500.0,G,1458376500,[combinatorics],PROGRAMMING +645,CROC 2016 - Elimination Round,12,Amity Assessment,500.0,A,1458318900,"[brute force, constructive algorithms, implementation]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Mischievous Mess Makers,1000.0,B,1458318900,"[greedy, math]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, dp, graphs]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, math, number theory]",PROGRAMMING +645,CROC 2016 - Elimination Round,12,Armistice Area Apportionment,3500.0,G,1458318900,"[binary search, geometry]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Amity Assessment,500.0,A,1458318900,[],PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Mischievous Mess Makers,1000.0,B,1458318900,[],PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Enduring Exodus,1500.0,C,1458318900,"[binary search, two pointers]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Robot Rapping Results Report,2000.0,D,1458318900,"[binary search, graphs]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Intellectual Inquiry,2500.0,E,1458318900,"[dp, greedy, strings]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Cowslip Collections,3000.0,F,1458318900,"[combinatorics, number theory]",PROGRAMMING +655,CROC 2016 - Elimination Round (Rated Unofficial Edition),12,Armistice Area Apportionment,3500.0,G,1458318900,[geometry],PROGRAMMING +644,CROC 2016 - Qualification,12,Parliament of Berland,500.0,A,1458118800,[constructive algorithms],PROGRAMMING +644,CROC 2016 - Qualification,12,Processing Queries,1000.0,B,1458118800,"[data structures, two pointers]",PROGRAMMING +644,CROC 2016 - Qualification,12,Hostname Aliases,1500.0,C,1458118800,"[binary search, data structures, sortings, strings]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Voting for Photos,500.0,A,1457870400,[implementation],PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Chat Order,1000.0,B,1457870400,"[binary search, data structures, sortings]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Promocodes with Mistakes,1500.0,C,1457870400,"[brute force, constructive algorithms, implementation]",PROGRAMMING +637,VK Cup 2016 - Qualification Round 1,12,Running with Obstacles,2000.0,D,1457870400,"[data structures, dp, greedy]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Watchmen,500.0,A,1457342700,"[data structures, math]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Image Preview,1000.0,B,1457342700,"[binary search, dp, two pointers]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Table Compression,1500.0,C,1457342700,"[dfs and similar, dp, dsu, graphs, greedy]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Zip-line,2000.0,D,1457342700,"[binary search, data structures, dp]",PROGRAMMING +650,Codeforces Round #345 (Div. 1),1,Clockwork Bomb,2500.0,E,1457342700,"[data structures, dfs and similar, dsu, trees]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Joysticks,500.0,A,1457342700,"[dp, greedy]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Beautiful Paintings,1000.0,B,1457342700,"[greedy, sortings]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Watchmen,1500.0,C,1457342700,"[data structures, geometry, implementation, sortings]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Image Preview,2000.0,D,1457342700,"[binary search, dp, two pointers]",PROGRAMMING +651,Codeforces Round #345 (Div. 2),2,Table Compression,2500.0,E,1457342700,"[dsu, graphs, greedy]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Interview,500.0,A,1457022900,"[brute force, implementation]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Print Check,1000.0,B,1457022900,"[constructive algorithms, implementation]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Report,1500.0,C,1457022900,"[data structures, sortings]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Messenger,2000.0,D,1457022900,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +631,Codeforces Round #344 (Div. 2),2,Product Sum,2500.0,E,1457022900,"[data structures, dp, geometry]",PROGRAMMING +632,Educational Codeforces Round 9,12,Grandma Laura and Apples,,A,1456844400,[],PROGRAMMING +632,Educational Codeforces Round 9,12,"Alice, Bob, Two Teams",,B,1456844400,"[brute force, constructive algorithms]",PROGRAMMING +632,Educational Codeforces Round 9,12,The Smallest String Concatenation,,C,1456844400,"[sortings, strings]",PROGRAMMING +632,Educational Codeforces Round 9,12,Longest Subsequence,,D,1456844400,"[brute force, math, number theory]",PROGRAMMING +632,Educational Codeforces Round 9,12,Thief in a Shop,,E,1456844400,"[divide and conquer, dp, fft]",PROGRAMMING +632,Educational Codeforces Round 9,12,Magic Matrix,,F,1456844400,"[brute force, divide and conquer, graphs, trees]",PROGRAMMING +636,VeeRoute Marathon,12,Transfer,,A,1456765200,[*special],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,XOR Equation,500.0,A,1456683000,"[dp, math]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Factory Repairs,1000.0,B,1456683000,[data structures],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Package Delivery,1500.0,C,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Preorder Test,2000.0,D,1456683000,"[binary search, dp, trees]",PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Orchestra,2500.0,E,1456683000,[two pointers],PROGRAMMING +627,8VC Venture Cup 2016 - Final Round,12,Island Puzzle,3000.0,F,1456683000,"[dfs and similar, graphs, trees]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Island Puzzle,500.0,A,1456683000,"[constructive algorithms, implementation]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,XOR Equation,1000.0,B,1456683000,"[constructive algorithms, dp, implementation]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Factory Repairs,1500.0,C,1456683000,[data structures],PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Package Delivery,2000.0,D,1456683000,"[data structures, divide and conquer, greedy]",PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Preorder Test,2500.0,E,1456683000,[],PROGRAMMING +634,8VC Venture Cup 2016 - Final Round (Div. 1 Edition),1,Orchestra,3000.0,F,1456683000,[two pointers],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Orchestra,500.0,A,1456683000,"[brute force, implementation]",PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Island Puzzle,1000.0,B,1456683000,[],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,XOR Equation,1500.0,C,1456683000,[dp],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Factory Repairs,2000.0,D,1456683000,[],PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Package Delivery,2500.0,E,1456683000,"[data structures, greedy]",PROGRAMMING +635,8VC Venture Cup 2016 - Final Round (Div. 2 Edition),2,Preorder Test,3000.0,F,1456683000,[],PROGRAMMING +633,"Manthan, Codefest 16",12,Ebony and Ivory,250.0,A,1456506900,"[brute force, math, number theory]",PROGRAMMING +633,"Manthan, Codefest 16",12,A Trivial Problem,500.0,B,1456506900,"[brute force, constructive algorithms, math, number theory]",PROGRAMMING +633,"Manthan, Codefest 16",12,Spy Syndrome 2,1500.0,C,1456506900,"[data structures, dp, hashing, implementation, sortings, string suffix structures, strings]",PROGRAMMING +633,"Manthan, Codefest 16",12,Fibonacci-ish,1750.0,D,1456506900,"[brute force, hashing, implementation, math]",PROGRAMMING +633,"Manthan, Codefest 16",12,Startup Funding,2500.0,E,1456506900,"[binary search, data structures, probabilities, two pointers]",PROGRAMMING +633,"Manthan, Codefest 16",12,The Chocolate Spree,2750.0,F,1456506900,"[dfs and similar, dp, trees]",PROGRAMMING +633,"Manthan, Codefest 16",12,Yash And Trees,3000.0,G,1456506900,"[bitmasks, data structures, dfs and similar]",PROGRAMMING +633,"Manthan, Codefest 16",12,Fibonacci-ish II,3000.0,H,1456506900,"[data structures, implementation]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Far Relative’s Birthday Cake,500.0,A,1455986100,"[brute force, constructive algorithms, implementation]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Far Relative’s Problem,1000.0,B,1455986100,[brute force],PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Famil Door and Brackets,1750.0,C,1455986100,"[dp, strings]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Babaei and Birthday Cake,2000.0,D,1455986100,"[data structures, dp]",PROGRAMMING +629,Codeforces Round #343 (Div. 2),2,Famil Door and Roads,2500.0,E,1455986100,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +628,Educational Codeforces Round 8,12,Tennis Tournament,,A,1455894000,[implementation],PROGRAMMING +628,Educational Codeforces Round 8,12,New Skateboard,,B,1455894000,[dp],PROGRAMMING +628,Educational Codeforces Round 8,12,Bear and String Distance,,C,1455894000,[greedy],PROGRAMMING +628,Educational Codeforces Round 8,12,Magic Numbers,,D,1455894000,[dp],PROGRAMMING +628,Educational Codeforces Round 8,12,Zbazi in Zeydabad,,E,1455894000,"[data structures, implementation]",PROGRAMMING +628,Educational Codeforces Round 8,12,Bear and Fair Set,,F,1455894000,[flows],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Again Twenty Five!,,A,1455807600,[number theory],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Moore's Law,,B,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Lucky Numbers,,C,1455807600,"[combinatorics, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Hexagons!,,D,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,A rectangle,,E,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Selection of Personnel,,F,1455807600,"[combinatorics, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Challenge Pennants,,G,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Benches,,H,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Parking Lot,,I,1455807600,[combinatorics],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Divisibility,,J,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Indivisibility,,K,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Cracking the Code,,L,1455807600,[implementation],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Turn,,M,1455807600,"[geometry, math]",PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Forecast,,N,1455807600,[math],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Arrow,,O,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Area of a Star,,P,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Pyramids,,Q,1455807600,[geometry],PROGRAMMING +630,Experimental Educational Round: VolBIT Formulas Blitz,12,Game,,R,1455807600,[games],PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Robot Sequence,500.0,A,1455384900,"[brute force, implementation]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Cards,750.0,B,1455384900,"[constructive algorithms, dp]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Block Towers,1000.0,C,1455384900,"[brute force, greedy]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Jerry's Protest,1500.0,D,1455384900,"[brute force, combinatorics, probabilities]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Simple Skewness,2000.0,E,1455384900,"[binary search, math, ternary search]",PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Group Projects,2500.0,F,1455384900,[dp],PROGRAMMING +626,8VC Venture Cup 2016 - Elimination Round,12,Raffles,3000.0,G,1455384900,"[data structures, greedy]",PROGRAMMING +622,Educational Codeforces Round 7,12,Infinite Sequence,,A,1455116400,"[implementation, math]",PROGRAMMING +622,Educational Codeforces Round 7,12,The Time,,B,1455116400,[implementation],PROGRAMMING +622,Educational Codeforces Round 7,12,Not Equal on a Segment,,C,1455116400,"[data structures, implementation]",PROGRAMMING +622,Educational Codeforces Round 7,12,Optimal Number Permutation,,D,1455116400,[constructive algorithms],PROGRAMMING +622,Educational Codeforces Round 7,12,Ants in Leaves,,E,1455116400,"[dfs and similar, greedy, trees]",PROGRAMMING +622,Educational Codeforces Round 7,12,The Sum of the k-th Powers,,F,1455116400,[math],PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Guest From the Past,750.0,A,1454835900,"[implementation, math]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,War of the Corporations,750.0,B,1454835900,"[constructive algorithms, strings]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,K-special Tables,1000.0,C,1454835900,"[constructive algorithms, implementation]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Finals in arithmetic,2000.0,D,1454835900,"[constructive algorithms, implementation]",PROGRAMMING +625,Codeforces Round #342 (Div. 2),2,Frog Fights,3000.0,E,1454835900,"[data structures, greedy]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Graph and String,500.0,A,1454605500,"[constructive algorithms, graphs]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Array GCD,1000.0,B,1454605500,"[dp, greedy, number theory]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Electric Charges,1750.0,C,1454605500,[binary search],PROGRAMMING +623,AIM Tech Round (Div. 1),1,Birthday,2000.0,D,1454605500,"[greedy, probabilities]",PROGRAMMING +623,AIM Tech Round (Div. 1),1,Transforming Sequence,2250.0,E,1454605500,"[combinatorics, dp, fft]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Save Luke,500.0,A,1454605500,[math],PROGRAMMING +624,AIM Tech Round (Div. 2),2,Making a String,1000.0,B,1454605500,"[greedy, sortings]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Graph and String,1500.0,C,1454605500,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Array GCD,2000.0,D,1454605500,"[dp, greedy, number theory]",PROGRAMMING +624,AIM Tech Round (Div. 2),2,Electric Charges,3000.0,E,1454605500,[],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Odd and Even,500.0,A,1454249100,[implementation],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Bishops,1000.0,B,1454249100,[combinatorics],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Flowers,1500.0,C,1454249100,[probabilities],PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Rat Kwesh and Cheese,2000.0,D,1454249100,"[brute force, math]",PROGRAMMING +621,Codeforces Round #341 (Div. 2),2,Wet Shark and Blocks,2500.0,E,1454249100,"[dp, matrices]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Slime Combining,500.0,A,1454087400,[implementation],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Guess the Permutation,1000.0,B,1454087400,[constructive algorithms],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Constellation,1500.0,C,1454087400,"[geometry, implementation]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Hamiltonian Spanning Tree,1750.0,D,1454087400,"[dfs and similar, dp, graph matchings, trees]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Robot Arm,2500.0,E,1454087400,[data structures],PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Double Knapsack,2750.0,F,1454087400,"[constructive algorithms, two pointers]",PROGRAMMING +618,Wunder Fund Round 2016 (Div. 1 + Div. 2 combined),12,Combining Slimes,3500.0,G,1454087400,"[dp, matrices, probabilities]",PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Elephant,500.0,A,1453563300,[math],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Chocolate,1000.0,B,1453563300,[combinatorics],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Watering Flowers,1250.0,C,1453563300,[implementation],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,Polyline,1750.0,D,1453563300,[constructive algorithms],PROGRAMMING +617,Codeforces Round #340 (Div. 2),2,XOR and Favorite Number,2750.0,E,1453563300,[data structures],PROGRAMMING +620,Educational Codeforces Round 6,12,Professor GukiZ's Robot,,A,1453388400,"[implementation, math]",PROGRAMMING +620,Educational Codeforces Round 6,12,Grandfather Dovlet’s calculator,,B,1453388400,[implementation],PROGRAMMING +620,Educational Codeforces Round 6,12,Pearls in a Row,,C,1453388400,[greedy],PROGRAMMING +620,Educational Codeforces Round 6,12,Professor GukiZ and Two Arrays,,D,1453388400,"[binary search, two pointers]",PROGRAMMING +620,Educational Codeforces Round 6,12,New Year Tree,,E,1453388400,"[bitmasks, data structures]",PROGRAMMING +620,Educational Codeforces Round 6,12,Xors on Segments,,F,1453388400,[data structures],PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Peter and Snow Blower,750.0,A,1452789300,"[binary search, geometry, ternary search]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Skills,1250.0,B,1452789300,"[binary search, brute force, two pointers]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Necklace,1250.0,C,1452789300,[constructive algorithms],PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Kingdom and its Cities,2000.0,D,1452789300,"[dfs and similar, divide and conquer, graphs, sortings, trees]",PROGRAMMING +613,Codeforces Round #339 (Div. 1),1,Puzzle Lover,2500.0,E,1452789300,"[dp, hashing, strings]",PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Link/Cut Tree,500.0,A,1452789300,[brute force],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Gena's Code,1000.0,B,1452789300,[implementation],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Peter and Snow Blower,1750.0,C,1452789300,[],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Skills,2250.0,D,1452789300,[],PROGRAMMING +614,Codeforces Round #339 (Div. 2),2,Necklace,2250.0,E,1452789300,[],PROGRAMMING +616,Educational Codeforces Round 5,12,Comparing Two Long Integers,,A,1452524400,"[implementation, strings]",PROGRAMMING +616,Educational Codeforces Round 5,12,Dinner with Emma,,B,1452524400,"[games, greedy]",PROGRAMMING +616,Educational Codeforces Round 5,12,The Labyrinth,,C,1452524400,[dfs and similar],PROGRAMMING +616,Educational Codeforces Round 5,12,Longest k-Good Segment,,D,1452524400,"[binary search, data structures, two pointers]",PROGRAMMING +616,Educational Codeforces Round 5,12,Sum of Remainders,,E,1452524400,"[implementation, math, number theory]",PROGRAMMING +616,Educational Codeforces Round 5,12,Expensive Strings,,F,1452524400,"[string suffix structures, strings]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Bulbs,500.0,A,1452261900,[implementation],PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Longtail Hedgehog,1250.0,B,1452261900,"[dp, graphs]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Running Track,1750.0,C,1452261900,"[dp, greedy, strings, trees]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Multipliers,2000.0,D,1452261900,"[math, number theory]",PROGRAMMING +615,Codeforces Round #338 (Div. 2),2,Hexagons,2500.0,E,1452261900,"[binary search, implementation, math]",PROGRAMMING +611,Good Bye 2015,12,New Year and Days,500.0,A,1451487900,[implementation],PROGRAMMING +611,Good Bye 2015,12,New Year and Old Property,750.0,B,1451487900,"[brute force, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Domino,1250.0,C,1451487900,"[dp, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Ancient Prophecy,1750.0,D,1451487900,"[hashing, strings]",PROGRAMMING +611,Good Bye 2015,12,New Year and Three Musketeers,2500.0,E,1451487900,"[data structures, greedy]",PROGRAMMING +611,Good Bye 2015,12,New Year and Cleaning,2500.0,F,1451487900,"[binary search, implementation]",PROGRAMMING +611,Good Bye 2015,12,New Year and Cake,3000.0,G,1451487900,"[geometry, two pointers]",PROGRAMMING +611,Good Bye 2015,12,New Year and Forgotten Tree,3500.0,H,1451487900,"[constructive algorithms, flows]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Pasha and Stick,500.0,A,1451215200,"[combinatorics, math]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Vika and Squares,1000.0,B,1451215200,[implementation],PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Harmony Analysis,1500.0,C,1451215200,[constructive algorithms],PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Vika and Segments,2500.0,D,1451215200,"[data structures, geometry, two pointers]",PROGRAMMING +610,Codeforces Round #337 (Div. 2),2,Alphabet Permutations,2500.0,E,1451215200,"[data structures, strings]",PROGRAMMING +612,Educational Codeforces Round 4,12,The Text Splitting,,A,1451055600,"[brute force, implementation, strings]",PROGRAMMING +612,Educational Codeforces Round 4,12,HDD is Outdated Technology,,B,1451055600,[implementation],PROGRAMMING +612,Educational Codeforces Round 4,12,Replace To Make Regular Bracket Sequence,,C,1451055600,"[data structures, expression parsing, math]",PROGRAMMING +612,Educational Codeforces Round 4,12,The Union of k-Segments,,D,1451055600,[sortings],PROGRAMMING +612,Educational Codeforces Round 4,12,Square Root of Permutation,,E,1451055600,"[combinatorics, constructive algorithms, dfs and similar, graphs]",PROGRAMMING +612,Educational Codeforces Round 4,12,Simba on the Circle,,F,1451055600,[dp],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Chain Reaction,500.0,A,1450888500,"[binary search, dp]",PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Zuma,1250.0,B,1450888500,[dp],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Marbles,1500.0,C,1450888500,"[hashing, strings]",PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Power Tree,2000.0,D,1450888500,[data structures],PROGRAMMING +607,Codeforces Round #336 (Div. 1),1,Cross Sum,3000.0,E,1450888500,"[binary search, geometry]",PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Saitama Destroys Hotel,500.0,A,1450888500,"[implementation, math]",PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Hamming Distance Sum,1000.0,B,1450888500,[combinatorics],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Chain Reaction,1500.0,C,1450888500,[dp],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Zuma,2250.0,D,1450888500,[],PROGRAMMING +608,Codeforces Round #336 (Div. 2),2,Marbles,2500.0,E,1450888500,[],PROGRAMMING +609,Educational Codeforces Round 3,12,USB Flash Drives,,A,1450537200,"[greedy, implementation, sortings]",PROGRAMMING +609,Educational Codeforces Round 3,12,The Best Gift,,B,1450537200,[implementation],PROGRAMMING +609,Educational Codeforces Round 3,12,Load Balancing,,C,1450537200,[implementation],PROGRAMMING +609,Educational Codeforces Round 3,12,Gadgets for dollars and pounds,,D,1450537200,"[binary search, two pointers]",PROGRAMMING +609,Educational Codeforces Round 3,12,Minimum spanning tree for each edge,,E,1450537200,"[data structures, dfs and similar, dsu, graphs, trees]",PROGRAMMING +609,Educational Codeforces Round 3,12,Frogs and mosquitoes,,F,1450537200,[data structures],PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Sorting Railway Cars,500.0,A,1449677100,"[constructive algorithms, greedy]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Lazy Student,1000.0,B,1449677100,"[constructive algorithms, data structures, graphs]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Freelancer's Dreams,1500.0,C,1449677100,[geometry],PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Board Game,2000.0,D,1449677100,"[data structures, dfs and similar]",PROGRAMMING +605,Codeforces Round #335 (Div. 1),1,Intergalaxy Trips,2500.0,E,1449677100,"[probabilities, shortest paths]",PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Magic Spheres,500.0,A,1449677100,[implementation],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Testing Robots,1000.0,B,1449677100,[implementation],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Sorting Railway Cars,1500.0,C,1449677100,[],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Lazy Student,2000.0,D,1449677100,[graphs],PROGRAMMING +606,Codeforces Round #335 (Div. 2),2,Freelancer's Dreams,2500.0,E,1449677100,[],PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Alternative Thinking,500.0,A,1448984100,"[dp, greedy]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Moodular Arithmetic,1000.0,B,1448984100,"[dfs and similar, dsu, math, number theory]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Lieges of Legendre,1500.0,C,1448984100,[games],PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Ruminations on Ruminants,2000.0,D,1448984100,"[geometry, math]",PROGRAMMING +603,Codeforces Round #334 (Div. 1),1,Pastoral Oddities,3000.0,E,1448984100,"[data structures, divide and conquer, dsu, trees]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Uncowed Forces,500.0,A,1448984100,[implementation],PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,More Cowbell,1000.0,B,1448984100,"[binary search, greedy]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Alternative Thinking,1500.0,C,1448984100,"[constructive algorithms, dp, math]",PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Moodular Arithmetic,2000.0,D,1448984100,[dsu],PROGRAMMING +604,Codeforces Round #334 (Div. 2),2,Lieges of Legendre,2500.0,E,1448984100,[],PROGRAMMING +600,Educational Codeforces Round 2,12,Extract Numbers,,A,1448636400,[implementation],PROGRAMMING +600,Educational Codeforces Round 2,12,Queries about less or equal elements,,B,1448636400,"[binary search, sortings, two pointers]",PROGRAMMING +600,Educational Codeforces Round 2,12,Make Palindrome,,C,1448636400,[greedy],PROGRAMMING +600,Educational Codeforces Round 2,12,Area of Two Circles' Intersection,,D,1448636400,[geometry],PROGRAMMING +600,Educational Codeforces Round 2,12,Lomsat gelral,,E,1448636400,"[dfs and similar, dsu, trees]",PROGRAMMING +600,Educational Codeforces Round 2,12,Edge coloring of bipartite graph,,F,1448636400,[graphs],PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,The Two Routes,500.0,A,1448382900,"[graphs, shortest paths]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Lipshitz Sequence,1250.0,B,1448382900,[data structures],PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Kleofáš and the n-thlon,1250.0,C,1448382900,"[dp, probabilities]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,Acyclic Organic Compounds,2000.0,D,1448382900,"[data structures, dfs and similar, dsu, hashing, trees]",PROGRAMMING +601,Codeforces Round #333 (Div. 1),1,A Museum Robbery,2500.0,E,1448382900,"[data structures, dp]",PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Two Bases,500.0,A,1448382900,[implementation],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Approximating a Constant Range,1000.0,B,1448382900,"[dp, two pointers]",PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,The Two Routes,1500.0,C,1448382900,[],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Lipshitz Sequence,2250.0,D,1448382900,[],PROGRAMMING +602,Codeforces Round #333 (Div. 2),2,Kleofáš and the n-thlon,2250.0,E,1448382900,[probabilities],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Patrick and Shopping,500.0,A,1448037300,[implementation],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Spongebob and Joke,1000.0,B,1448037300,[implementation],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Day at the Beach,1500.0,C,1448037300,[sortings],PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Spongebob and Squares,2000.0,D,1448037300,"[brute force, math]",PROGRAMMING +599,Codeforces Round #332 (Div. 2),2,Sandy and Nuts,3000.0,E,1448037300,"[bitmasks, dp]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Swimming Pool,500.0,A,1447605300,[implementation],PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Array,1000.0,B,1447605300,[greedy],PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Points,1500.0,C,1447605300,"[greedy, sortings]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Trees,2250.0,D,1447605300,"[dp, probabilities, sortings]",PROGRAMMING +596,Codeforces Round #331 (Div. 2),2,Wilbur and Strings,2500.0,E,1447605300,"[dfs and similar, dp, graphs]",PROGRAMMING +598,Educational Codeforces Round 1,12,Tricky Sum,,A,1447426800,[math],PROGRAMMING +598,Educational Codeforces Round 1,12,Queries on a String,,B,1447426800,"[implementation, strings]",PROGRAMMING +598,Educational Codeforces Round 1,12,Nearest vectors,,C,1447426800,"[geometry, sortings]",PROGRAMMING +598,Educational Codeforces Round 1,12,Igor In the Museum,,D,1447426800,[dfs and similar],PROGRAMMING +598,Educational Codeforces Round 1,12,Chocolate Bar,,E,1447426800,"[brute force, dp]",PROGRAMMING +598,Educational Codeforces Round 1,12,Cut Length,,F,1447426800,[geometry],PROGRAMMING +597,Testing Round #12,12,Divisibility,500.0,A,1447264800,[math],PROGRAMMING +597,Testing Round #12,12,Restaurant,1000.0,B,1447264800,"[dp, greedy, sortings]",PROGRAMMING +597,Testing Round #12,12,Subsequences,1500.0,C,1447264800,"[data structures, dp]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Warrior and Archer,500.0,A,1447000200,[games],PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Max and Bike,1000.0,B,1447000200,"[binary search, geometry]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Edo and Magnets,1500.0,C,1447000200,"[brute force, two pointers]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,REQ,2000.0,D,1447000200,"[data structures, number theory]",PROGRAMMING +594,Codeforces Round #330 (Div. 1),1,Cutting the Line,3000.0,E,1447000200,"[string suffix structures, strings]",PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Vitaly and Night,500.0,A,1447000200,[implementation],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Pasha and Phone,1000.0,B,1447000200,"[binary search, math]",PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Warrior and Archer,1500.0,C,1447000200,[games],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Max and Bike,2000.0,D,1447000200,[],PROGRAMMING +595,Codeforces Round #330 (Div. 2),2,Edo and Magnets,2500.0,E,1447000200,[],PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,2Char,250.0,A,1446655500,[brute force],PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Anton and Lines,1000.0,B,1446655500,"[geometry, sortings]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Beautiful Function,3000.0,C,1446655500,"[constructive algorithms, math]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Happy Tree Party,3000.0,D,1446655500,"[data structures, trees]",PROGRAMMING +593,Codeforces Round #329 (Div. 2),2,Strange Calculation and Cats,3000.0,E,1446655500,"[dp, matrices]",PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,PawnChess,500.0,A,1446309000,[implementation],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,The Monster and the Squirrel,1000.0,B,1446309000,[math],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,The Big Race,1500.0,C,1446309000,[math],PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,Super M,2000.0,D,1446309000,"[dfs and similar, dp, trees]",PROGRAMMING +592,Codeforces Round #328 (Div. 2),2,BCPC,3000.0,E,1446309000,"[binary search, geometry, two pointers]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Median Smoothing,750.0,A,1445763600,[],PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Chip 'n Dale Rescue Rangers,1000.0,B,1445763600,"[binary search, geometry, math]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Three States,1250.0,C,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Top Secret Task,1750.0,D,1445763600,[dp],PROGRAMMING +590,Codeforces Round #327 (Div. 1),1,Birthday,2500.0,E,1445763600,"[graph matchings, strings]",PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Wizards' Duel,500.0,A,1445763600,[math],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Rebranding,1000.0,B,1445763600,[implementation],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Median Smoothing,1750.0,C,1445763600,[constructive algorithms],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Chip 'n Dale Rescue Rangers,2000.0,D,1445763600,[],PROGRAMMING +591,Codeforces Round #327 (Div. 2),2,Three States,2250.0,E,1445763600,"[dfs and similar, graphs, shortest paths]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Email Aliases,,A,1445068800,[implementation],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Layer Cake,,B,1445068800,[sortings],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Polycarp's Masterpiece,,C,1445068800,"[data structures, divide and conquer, dp]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Boulevard,,D,1445068800,"[brute force, implementation]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Training with Doors,,E,1445068800,[],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Gourmet and Banquet,,F,1445068800,"[binary search, flows, greedy]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Hiring,,G,1445068800,"[binary search, data structures]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Tourist Guide,,H,1445068800,[dfs and similar],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Lottery,,I,1445068800,[implementation],PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Cleaner Robot,,J,1445068800,"[dfs and similar, implementation]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Task processing,,K,1445068800,"[brute force, math]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Agricultural Archaeology,,L,1445068800,"[greedy, math]",PROGRAMMING +589,"2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)",12,Taxi in Berland,,M,1445068800,[shortest paths],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff and Weight Lifting,500.0,A,1444926600,[greedy],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in Beach,1000.0,B,1444926600,[dp],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in the Army,1500.0,C,1444926600,"[data structures, trees]",PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff in Mafia,2000.0,D,1444926600,"[2-sat, binary search]",PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff as a Queen,2750.0,E,1444926600,[data structures],PROGRAMMING +587,Codeforces Round #326 (Div. 1),1,Duff is Mad,2750.0,F,1444926600,"[data structures, strings]",PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff and Meat,750.0,A,1444926600,[greedy],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Love,1000.0,B,1444926600,[math],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff and Weight Lifting,1500.0,C,1444926600,[],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Beach,2000.0,D,1444926600,[],PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in the Army,2500.0,E,1444926600,"[data structures, dfs and similar, trees]",PROGRAMMING +588,Codeforces Round #326 (Div. 2),2,Duff in Mafia,3000.0,F,1444926600,[],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Gennady the Dentist,500.0,A,1444641000,"[brute force, implementation]",PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Phillip and Trains,750.0,B,1444641000,[dfs and similar],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,"Alice, Bob, Oranges and Apples",1250.0,C,1444641000,[number theory],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Lizard Era: Beginning,1750.0,D,1444641000,[meet-in-the-middle],PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Present for Vitalik the Philatelist ,2250.0,E,1444641000,"[combinatorics, math, number theory]",PROGRAMMING +585,Codeforces Round #325 (Div. 1),1,Digits of Number Pi,3000.0,F,1444641000,"[dp, implementation, strings]",PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Alena's Schedule,500.0,A,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Laurenty and Shop,1000.0,B,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Gennady the Dentist,1500.0,C,1444641000,[implementation],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Phillip and Trains,1750.0,D,1444641000,[dp],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,"Alice, Bob, Oranges and Apples",2250.0,E,1444641000,[number theory],PROGRAMMING +586,Codeforces Round #325 (Div. 2),2,Lizard Era: Beginning,2750.0,F,1444641000,[meet-in-the-middle],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Olesya and Rodion,500.0,A,1444149000,[math],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Kolya and Tanya ,1000.0,B,1444149000,[combinatorics],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Marina and Vasya,1500.0,C,1444149000,"[constructive algorithms, greedy]",PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Dima and Lisa,2000.0,D,1444149000,[number theory],PROGRAMMING +584,Codeforces Round #324 (Div. 2),2,Anton and Ira,2500.0,E,1444149000,"[constructive algorithms, greedy]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,GCD Table,750.0,A,1443890700,"[constructive algorithms, greedy]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Once Again...,1250.0,B,1443890700,"[dp, matrices]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Superior Periodic Subarrays,1500.0,C,1443890700,[number theory],PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Number of Binominal Coefficients,2250.0,D,1443890700,"[dp, number theory]",PROGRAMMING +582,Codeforces Round #323 (Div. 1),1,Boolean Function,2500.0,E,1443890700,"[bitmasks, dp, expression parsing]",PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Asphalting Roads,500.0,A,1443890700,[implementation],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Robot's Task,1000.0,B,1443890700,[implementation],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,GCD Table,1750.0,C,1443890700,[],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Once Again...,2250.0,D,1443890700,[],PROGRAMMING +583,Codeforces Round #323 (Div. 2),2,Superior Periodic Subarrays,2500.0,E,1443890700,[number theory],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Vasya the Hipster,500.0,A,1443430800,[implementation],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Luxurious Houses,1000.0,B,1443430800,[implementation],PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Developing Skills,1500.0,C,1443430800,"[implementation, sortings]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Three Logos,2000.0,D,1443430800,"[bitmasks, brute force, constructive algorithms, implementation, math]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Kojiro and Furrari,3000.0,E,1443430800,"[dp, greedy]",PROGRAMMING +581,Codeforces Round #322 (Div. 2),2,Zublicanes and Mumocrates,3000.0,F,1443430800,"[dp, trees, two pointers]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and First Steps,750.0,A,1442939400,"[brute force, dp, implementation]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Company,1250.0,B,1442939400,"[binary search, sortings, two pointers]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Park,1500.0,C,1442939400,"[dfs and similar, trees]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Dishes,2000.0,D,1442939400,"[bitmasks, dp]",PROGRAMMING +580,Codeforces Round #321 (Div. 2),2,Kefa and Watch,2500.0,E,1442939400,"[data structures, hashing, strings]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,A Problem about Polyline,250.0,A,1442416500,"[geometry, math]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,"""Or"" Game",500.0,B,1442416500,"[brute force, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Weakness and Poorness,750.0,C,1442416500,[ternary search],PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,LCS Again,2500.0,D,1442416500,"[dp, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Walking!,2750.0,E,1442416500,"[constructive algorithms, greedy]",PROGRAMMING +578,Codeforces Round #320 (Div. 1) [Bayan Thanks-Round],1,Mirror Box,3000.0,F,1442416500,"[matrices, trees]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Raising Bacteria,250.0,A,1442416500,[bitmasks],PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Finding Team Member,500.0,B,1442416500,"[brute force, implementation, sortings]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,A Problem about Polyline,1250.0,C,1442416500,"[binary search, math]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,"""Or"" Game",2000.0,D,1442416500,"[brute force, greedy, math]",PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,Weakness and Poorness,3000.0,E,1442416500,[ternary search],PROGRAMMING +579,Codeforces Round #320 (Div. 2) [Bayan Thanks-Round],2,LCS Again,3000.0,F,1442416500,[],PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Vasya and Petya's Game,500.0,A,1441902600,"[math, number theory]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Invariance of Tree,1250.0,B,1441902600,"[constructive algorithms, dfs and similar, greedy, trees]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Points on Plane,1250.0,C,1441902600,"[constructive algorithms, divide and conquer, geometry, greedy, sortings]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Flights for Regular Customers,2000.0,D,1441902600,"[dp, matrices]",PROGRAMMING +576,Codeforces Round #319 (Div. 1),1,Painting Edges,2750.0,E,1441902600,"[binary search, data structures]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Multiplication Table,500.0,A,1441902600,"[implementation, number theory]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Modulo Sum,1250.0,B,1441902600,"[combinatorics, data structures, dp, two pointers]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Vasya and Petya's Game,1500.0,C,1441902600,"[implementation, number theory]",PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Invariance of Tree,2250.0,D,1441902600,[],PROGRAMMING +577,Codeforces Round #319 (Div. 2),2,Points on Plane,2250.0,E,1441902600,[constructive algorithms],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Fibonotci,,A,1441526400,"[math, matrices]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bribes,,B,1441526400,"[dfs and similar, trees]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Party,,C,1441526400,"[bitmasks, brute force, graph matchings]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Tablecity,,D,1441526400,[constructive algorithms],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Spectator Riots,,E,1441526400,[geometry],PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bulbo,,F,1441526400,"[dp, greedy]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Run for beer,,G,1441526400,"[dfs and similar, shortest paths]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Bots,,H,1441526400,"[combinatorics, number theory]",PROGRAMMING +575,Bubble Cup 8 - Finals [Online Mirror],12,Robots protection,,I,1441526400,[data structures],PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Poker,500.0,A,1440865800,"[implementation, number theory]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Blocks,1000.0,B,1440865800,"[binary search, data structures, dp]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Drawing,1750.0,C,1440865800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Cavalry,2000.0,D,1440865800,"[data structures, divide and conquer, dp]",PROGRAMMING +573,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1),1,Bear and Bowling,2500.0,E,1440865800,[greedy],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Elections,500.0,A,1440865800,[implementation],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Three Musketeers,1000.0,B,1440865800,"[brute force, dfs and similar, graphs, hashing]",PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Poker,1500.0,C,1440865800,[number theory],PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Blocks,2000.0,D,1440865800,"[data structures, dp, shortest paths]",PROGRAMMING +574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),2,Bear and Drawing,2750.0,E,1440865800,[],PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Lengthening Sticks,750.0,A,1440261000,"[combinatorics, implementation, math]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Minimization,1250.0,B,1440261000,"[dp, greedy, sortings]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,CNF 2,1500.0,C,1440261000,"[constructive algorithms, dfs and similar, graphs, greedy]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Campus,2000.0,D,1440261000,"[binary search, data structures, dsu, trees]",PROGRAMMING +571,Codeforces Round #317 [AimFund Thanks-Round] (Div. 1),1,Geometric Progressions,2750.0,E,1440261000,[math],PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Arrays,500.0,A,1440261000,[sortings],PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Order Book,1000.0,B,1440261000,"[data structures, greedy, implementation, sortings]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Lengthening Sticks,1750.0,C,1440261000,"[brute force, combinatorics, dp, math]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,Minimization,2250.0,D,1440261000,"[dp, sortings]",PROGRAMMING +572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),2,CNF 2,2500.0,E,1440261000,[],PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Elections,500.0,A,1439483400,[implementation],PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Simple Game,1000.0,B,1439483400,"[constructive algorithms, games, greedy, implementation, math]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Replacement,1500.0,C,1439483400,"[constructive algorithms, data structures, implementation]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Tree Requests,2000.0,D,1439483400,"[binary search, constructive algorithms, dfs and similar, trees]",PROGRAMMING +570,Codeforces Round #316 (Div. 2),2,Pig and Palindromes,2500.0,E,1439483400,"[combinatorics, dp]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Primes or Palindromes?,500.0,A,1439224200,"[brute force, implementation, math, number theory]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Symmetric and Transitive,1000.0,B,1439224200,"[combinatorics, dp, math]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,New Language,1500.0,C,1439224200,"[2-sat, greedy]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Sign Posts,2250.0,D,1439224200,"[brute force, math]",PROGRAMMING +568,Codeforces Round #315 (Div. 1),1,Longest Increasing Subsequence,2500.0,E,1439224200,"[data structures, dp]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Music,500.0,A,1439224200,"[implementation, math]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Inventory,1000.0,B,1439224200,[greedy],PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Primes or Palindromes?,1500.0,C,1439224200,"[binary search, brute force, number theory]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,Symmetric and Transitive,2250.0,D,1439224200,"[brute force, dp, math]",PROGRAMMING +569,Codeforces Round #315 (Div. 2),2,New Language,2750.0,E,1439224200,[],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Lineland Mail,500.0,A,1438790400,[implementation],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Berland National Library,1000.0,B,1438790400,[implementation],PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Geometric Progression,1500.0,C,1438790400,"[binary search, data structures, dp]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,One-Dimensional Battle Ships,2000.0,D,1438790400,"[binary search, data structures, sortings]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,President and Roads,2500.0,E,1438790400,"[dfs and similar, graphs, hashing, shortest paths]",PROGRAMMING +567,Codeforces Round #Pi (Div. 2),2,Mausoleum,2500.0,F,1438790400,[dp],PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Matching Names,1750.0,A,1438273200,"[dfs and similar, strings, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Replicating Processes,2500.0,B,1438273200,"[constructive algorithms, greedy]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Logistical Questions,3000.0,C,1438273200,"[dfs and similar, divide and conquer, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Restructuring Company,1000.0,D,1438273200,"[data structures, dsu]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Restoring Map,3000.0,E,1438273200,"[bitmasks, constructive algorithms, trees]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Clique in the Divisibility Graph,500.0,F,1438273200,"[dp, math, number theory]",PROGRAMMING +566,"VK Cup 2015 - Finals, online mirror",12,Max and Min,2500.0,G,1438273200,[geometry],PROGRAMMING +562,VK Cup 2015 - Finals,12,Logistical Questions,1500.0,A,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Clique in the Divisibility Graph,250.0,B,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Restoring Map,2250.0,C,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Restructuring Company,250.0,D,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Max and Min,500.0,E,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Matching Names,250.0,F,1437898500,[],PROGRAMMING +562,VK Cup 2015 - Finals,12,Replicating Processes,500.0,G,1437898500,[],PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald's Hexagon,500.0,A,1437573600,"[brute force, geometry, math]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Equivalent Strings,1000.0,B,1437573600,"[divide and conquer, hashing, sortings, strings]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald and Giant Chess,1500.0,C,1437573600,"[combinatorics, dp, math, number theory]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Randomizer,2250.0,D,1437573600,"[combinatorics, geometry, probabilities]",PROGRAMMING +559,Codeforces Round #313 (Div. 1),1,Gerald and Path,2250.0,E,1437573600,"[dp, sortings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Currency System in Geraldion,500.0,A,1437573600,"[geometry, implementation, sortings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald is into Art,1000.0,B,1437573600,"[constructive algorithms, implementation]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald's Hexagon,1500.0,C,1437573600,[geometry],PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Equivalent Strings,2000.0,D,1437573600,"[hashing, implementation, strings]",PROGRAMMING +560,Codeforces Round #313 (Div. 2),2,Gerald and Giant Chess,2500.0,E,1437573600,"[combinatorics, dp]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Lala Land and Apple Trees,500.0,A,1436886600,"[brute force, implementation, sortings]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Amr and The Large Array,1000.0,B,1436886600,[implementation],PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Amr and Chemistry,1500.0,C,1436886600,"[brute force, greedy]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,Guess Your Way Out! II,2250.0,D,1436886600,"[data structures, implementation, sortings]",PROGRAMMING +558,Codeforces Round #312 (Div. 2),2,A Simple Task,2500.0,E,1436886600,"[data structures, sortings, strings]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Ilya and Diplomas,500.0,A,1435676400,"[greedy, implementation]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Pasha and Tea,1000.0,B,1435676400,"[implementation, sortings]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Arthur and Table,1500.0,C,1435676400,"[brute force, data structures, dp, greedy]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Vitaly and Cycle,2000.0,D,1435676400,"[combinatorics, dfs and similar, graphs, math]",PROGRAMMING +557,Codeforces Round #311 (Div. 2),2,Ann and Half-Palindrome,2500.0,E,1435676400,"[data structures, dp, string suffix structures, strings, trees]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Matryoshkas,250.0,A,1435414200,[implementation],PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Fugitive,750.0,B,1435414200,"[data structures, greedy, sortings]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Chocolate,1250.0,C,1435414200,[data structures],PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of a Top Secret,2000.0,D,1435414200,"[binary search, implementation, math]",PROGRAMMING +555,Codeforces Round #310 (Div. 1),1,Case of Computer Network,3000.0,E,1435414200,"[dfs and similar, graphs, trees]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of the Zeros and Ones,250.0,A,1435414200,[greedy],PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Fake Numbers,250.0,B,1435414200,"[brute force, implementation]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Matryoshkas,1000.0,C,1435414200,[implementation],PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Fugitive,3000.0,D,1435414200,"[binary search, data structures, greedy]",PROGRAMMING +556,Codeforces Round #310 (Div. 2),2,Case of Chocolate,3000.0,E,1435414200,"[binary search, data structures]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Colored Balls,250.0,A,1435163400,"[combinatorics, dp, math]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Permutation,500.0,B,1435163400,"[binary search, combinatorics, constructive algorithms, implementation, math]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Love Triangles,1000.0,C,1435163400,"[dfs and similar, dsu, graphs]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Nudist Beach,1500.0,D,1435163400,"[binary search, graphs, greedy]",PROGRAMMING +553,Codeforces Round #309 (Div. 1),1,Kyoya and Train,3000.0,E,1435163400,"[dp, fft, probabilities]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Photobooks,250.0,A,1435163400,"[brute force, math]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Ohana Cleans Up,500.0,B,1435163400,"[brute force, strings]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Colored Balls,1500.0,C,1435163400,"[combinatorics, dp, math]",PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Kyoya and Permutation,3000.0,D,1435163400,[math],PROGRAMMING +554,Codeforces Round #309 (Div. 2),2,Love Triangles,3000.0,E,1435163400,"[dfs and similar, dsu]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Table,500.0,A,1434645000,"[implementation, math]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Books,1000.0,B,1434645000,"[implementation, math]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Scales,1500.0,C,1434645000,"[brute force, dp, greedy, math, meet-in-the-middle]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Triangles,2000.0,D,1434645000,"[brute force, combinatorics, data structures, geometry, math, sortings]",PROGRAMMING +552,Codeforces Round #308 (Div. 2),2,Vanya and Brackets,2500.0,E,1434645000,"[brute force, dp, expression parsing, greedy, implementation]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and Contest,500.0,A,1434127500,"[implementation, sortings]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,ZgukistringZ,1250.0,B,1434127500,"[brute force, constructive algorithms, implementation, strings]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ hates Boxes,1750.0,C,1434127500,"[binary search, greedy]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and Binary Operations,2000.0,D,1434127500,"[combinatorics, math, matrices, number theory]",PROGRAMMING +551,Codeforces Round #307 (Div. 2),2,GukiZ and GukiZiana,2500.0,E,1434127500,"[binary search, data structures]",PROGRAMMING +549,Looksery Cup 2015,12,Face Detection,250.0,A,1433595600,[implementation],PROGRAMMING +549,Looksery Cup 2015,12,Looksery Party,1750.0,B,1433595600,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING +549,Looksery Cup 2015,12,The Game Of Parity,2000.0,C,1433595600,[games],PROGRAMMING +549,Looksery Cup 2015,12,Haar Features,1000.0,D,1433595600,"[greedy, implementation]",PROGRAMMING +549,Looksery Cup 2015,12,Sasha Circle,3000.0,E,1433595600,[math],PROGRAMMING +549,Looksery Cup 2015,12,Yura and Developers,3000.0,F,1433595600,"[data structures, divide and conquer]",PROGRAMMING +549,Looksery Cup 2015,12,Happy Line,1500.0,G,1433595600,"[greedy, sortings]",PROGRAMMING +549,Looksery Cup 2015,12,Degenerate Matrix,1500.0,H,1433595600,"[binary search, math]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Two Substrings,1000.0,A,1433435400,"[brute force, dp, implementation, strings]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Preparing Olympiad,750.0,B,1433435400,"[bitmasks, brute force]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Divisibility by Eight,1000.0,C,1433435400,"[brute force, dp, math]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Regular Bridge,2000.0,D,1433435400,"[constructive algorithms, graphs, implementation]",PROGRAMMING +550,Codeforces Round #306 (Div. 2),2,Brackets in Implications,3000.0,E,1433435400,"[constructive algorithms, greedy, implementation]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Frog,750.0,A,1432658100,"[brute force, implementation, math]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Feet,1000.0,B,1432658100,"[binary search, data structures, dp, dsu]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Foam,1750.0,C,1432658100,"[bitmasks, number theory]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Fish,1750.0,D,1432658100,"[dfs and similar, graphs]",PROGRAMMING +547,Codeforces Round #305 (Div. 1),1,Mike and Friends,2500.0,E,1432658100,"[data structures, string suffix structures, strings]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Fax,500.0,A,1432658100,"[brute force, implementation]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Fun,1000.0,B,1432658100,"[brute force, greedy, implementation]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Frog,1750.0,C,1432658100,[number theory],PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Feet,2000.0,D,1432658100,"[binary search, data structures]",PROGRAMMING +548,Codeforces Round #305 (Div. 2),2,Mike and Foam,2750.0,E,1432658100,[number theory],PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Bananas,500.0,A,1432312200,"[implementation, math]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Badges,1000.0,B,1432312200,"[brute force, greedy, implementation, sortings]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Cards,1250.0,C,1432312200,"[brute force, dfs and similar]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Number Game,1500.0,D,1432312200,"[constructive algorithms, dp, math, number theory]",PROGRAMMING +546,Codeforces Round #304 (Div. 2),2,Soldier and Traveling,2250.0,E,1432312200,"[flows, math]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Toy Cars,500.0,A,1432053000,[implementation],PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Equidistant String,1000.0,B,1432053000,[greedy],PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Woodcutters,1750.0,C,1432053000,"[dp, greedy]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Queue,1750.0,D,1432053000,"[greedy, implementation, sortings]",PROGRAMMING +545,Codeforces Round #303 (Div. 2),2,Paths and Trees,2500.0,E,1432053000,"[graphs, greedy, shortest paths]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Writing Code,500.0,A,1431016200,[dp],PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Destroying Roads,1000.0,B,1431016200,"[graphs, shortest paths]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Remembering Strings,1750.0,C,1431016200,"[bitmasks, dp]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Road Improvement,1750.0,D,1431016200,"[dp, trees]",PROGRAMMING +543,Codeforces Round #302 (Div. 1),1,Listening to Music,2500.0,E,1431016200,"[constructive algorithms, data structures]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Set of Strings,500.0,A,1431016200,[implementation],PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Sea and Islands,1000.0,B,1431016200,"[constructive algorithms, implementation]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Writing Code,1500.0,C,1431016200,[dp],PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Destroying Roads,2000.0,D,1431016200,"[brute force, graphs, shortest paths]",PROGRAMMING +544,Codeforces Round #302 (Div. 2),2,Remembering Strings,2750.0,E,1431016200,"[bitmasks, dp]",PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Place Your Ad Here,750.0,A,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Duck Hunt,3000.0,B,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Idempotent functions,250.0,C,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Superhero's Job,1250.0,D,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Playing on Graph,750.0,E,1430668800,[],PROGRAMMING +541,VK Cup 2015 - Раунд 3,12,Quest,500.0,F,1430668800,[],PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Place Your Ad Here,2000.0,A,1430668800,"[data structures, sortings]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Duck Hunt,3000.0,B,1430668800,[data structures],PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Idempotent functions,750.0,C,1430668800,"[constructive algorithms, graphs, math]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Superhero's Job,2250.0,D,1430668800,"[dfs and similar, dp, hashing, math, number theory]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Playing on Graph,2250.0,E,1430668800,"[graphs, shortest paths]",PROGRAMMING +542,"VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only)",1,Quest,1000.0,F,1430668800,"[dp, greedy]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Combination Lock,500.0,A,1430411400,[implementation],PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,School Marks,1000.0,B,1430411400,"[greedy, implementation]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Ice Cave,1500.0,C,1430411400,[dfs and similar],PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Bad Luck Island,2000.0,D,1430411400,"[dp, probabilities]",PROGRAMMING +540,Codeforces Round #301 (Div. 2),2,Infinite Inversions,2500.0,E,1430411400,"[binary search, data structures, implementation, sortings, trees]",PROGRAMMING +538,Codeforces Round #300,12,Cutting Banner,500.0,A,1430064000,"[brute force, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Quasi Binary,1000.0,B,1430064000,"[constructive algorithms, dp, greedy, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Tourist's Notes,1500.0,C,1430064000,"[binary search, brute force, greedy, implementation, math]",PROGRAMMING +538,Codeforces Round #300,12,Weird Chess,1500.0,D,1430064000,"[brute force, constructive algorithms, implementation]",PROGRAMMING +538,Codeforces Round #300,12,Demiurges Play Again,2000.0,E,1430064000,"[dfs and similar, dp, math, trees]",PROGRAMMING +538,Codeforces Round #300,12,A Heap of Heaps,2500.0,F,1430064000,"[brute force, data structures, math, sortings]",PROGRAMMING +538,Codeforces Round #300,12,Berserk Robot ,3000.0,G,1430064000,"[constructive algorithms, math, sortings]",PROGRAMMING +538,Codeforces Round #300,12,Summer Dichotomy,3000.0,H,1430064000,"[2-sat, data structures, dfs and similar, greedy]",PROGRAMMING +537,VK Cup 2015 - Wild Card Round 2,12,Antiplagiarism,,A,1429381800,[*special],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Berland Miners,3000.0,A,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Work Group,500.0,B,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Board Game,250.0,C,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Landmarks,3000.0,D,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Correcting Mistakes,500.0,E,1429286400,[],PROGRAMMING +532,VK Cup 2015 - Round 2,12,Encoding,1250.0,F,1429286400,[],PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Berland Miners,3000.0,A,1429286400,"[binary search, data structures, dfs and similar, greedy, trees]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Work Group,750.0,B,1429286400,"[dfs and similar, dp, graphs, strings, trees]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Board Game,250.0,C,1429286400,"[games, greedy, implementation, math]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Landmarks,3000.0,D,1429286400,[data structures],PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Correcting Mistakes,500.0,E,1429286400,"[constructive algorithms, dp, greedy, hashing, strings, two pointers]",PROGRAMMING +533,"VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only)",1,Encoding,1500.0,F,1429286400,"[hashing, string suffix structures, strings]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Nafas,500.0,A,1429029300,[implementation],PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and SaDDas,1000.0,B,1429029300,"[bitmasks, brute force, implementation]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Karafs,1500.0,C,1429029300,"[binary search, math]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Malekas,2000.0,D,1429029300,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING +535,Codeforces Round #299 (Div. 2),2,Tavas and Pashmaks,2500.0,E,1429029300,[geometry],PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Karafs,500.0,A,1429029300,"[binary search, math]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Malekas,1000.0,B,1429029300,"[hashing, string suffix structures, strings]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas and Pashmaks,1500.0,C,1429029300,[geometry],PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas in Kansas,2000.0,D,1429029300,"[dp, games]",PROGRAMMING +536,Codeforces Round #299 (Div. 1),1,Tavas on the Path,2500.0,E,1429029300,"[data structures, divide and conquer, trees]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Exam,500.0,A,1428854400,"[constructive algorithms, implementation]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Covered Path,1000.0,B,1428854400,"[dp, greedy, math]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Polycarpus' Dice,1500.0,C,1428854400,[math],PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Handshakes,2000.0,D,1428854400,"[binary search, constructive algorithms, data structures, greedy]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Berland Local Positioning System,2500.0,E,1428854400,"[constructive algorithms, greedy, hashing, implementation]",PROGRAMMING +534,Codeforces Round #298 (Div. 2),2,Simplified Nonogram,3000.0,F,1428854400,"[bitmasks, dp, hashing, meet-in-the-middle]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,King of Thieves,500.0,A,1428165300,"[brute force, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Dark Park,500.0,B,1428165300,"[dfs and similar, greedy, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Candies,1250.0,C,1428165300,"[brute force, greedy, math]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Om Nom and Necklace,1750.0,D,1428165300,"[hashing, string suffix structures, strings]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Transmitting Levels,2250.0,E,1428165300,"[dp, implementation]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Pudding Monsters,3000.0,F,1428165300,"[data structures, divide and conquer]",PROGRAMMING +526,ZeptoLab Code Rush 2015,12,Spiders Evil Plan,3000.0,G,1428165300,"[greedy, trees]",PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,String inside out,,B,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Set subtraction,,D,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Sum and product,,E,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Points in triangle,,H,1427562000,"[*special, geometry]",PROGRAMMING +530,VK Cup 2015 - Wild Card Round 1,12,Different variables,,I,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Quadratic equation,,A,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,String inside out,,B,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Diophantine equation,,C,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Set subtraction,,D,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Sum and product,,E,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Jumping frogs,,F,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Levenshtein distance,,G,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Points in triangle,,H,1427562000,[*special],PROGRAMMING +531,VK Cup 2015 - Wild Card Round 1 (Online Mirror),12,Different variables,,I,1427562000,[*special],PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Vitaliy and Pie,250.0,A,1427387400,"[greedy, hashing]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Pasha and String,750.0,B,1427387400,[greedy],PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Ilya and Sticks,1000.0,C,1427387400,"[greedy, sortings]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Arthur and Walls,3000.0,D,1427387400,"[data structures, greedy]",PROGRAMMING +525,Codeforces Round #297 (Div. 2),2,Anya and Cubes,3000.0,E,1427387400,"[binary search, bitmasks, brute force, dp, meet-in-the-middle]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,And Yet Another Bracket Sequence,2500.0,A,1426956300,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Group Photo 2 (online mirror version),500.0,B,1426956300,"[brute force, greedy, sortings]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Rooks and Rectangles,1500.0,C,1426956300,[data structures],PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,Social Network,1250.0,D,1426956300,"[data structures, greedy]",PROGRAMMING +529,"VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)",1,The Art of Dealing with ATM,500.0,E,1426956300,[brute force],PROGRAMMING +524,VK Cup 2015 - Round 1,12,"Возможно, вы знаете этих людей?",500.0,A,1426946400,[implementation],PROGRAMMING +524,VK Cup 2015 - Round 1,12,Фото на память - 2 (round version),500.0,B,1426946400,"[dp, greedy]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,The Art of Dealing with ATM,1000.0,C,1426946400,"[binary search, sortings]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,Social Network,1250.0,D,1426946400,"[greedy, two pointers]",PROGRAMMING +524,VK Cup 2015 - Round 1,12,Rooks and Rectangles,1750.0,E,1426946400,[data structures],PROGRAMMING +524,VK Cup 2015 - Round 1,12,And Yet Another Bracket Sequence,3000.0,F,1426946400,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Playing with Paper,500.0,A,1426610700,"[implementation, math]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Error Correct System,1000.0,B,1426610700,[greedy],PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Glass Carving,1500.0,C,1426610700,"[binary search, data structures, implementation]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Clique Problem,2000.0,D,1426610700,"[data structures, dp, greedy, implementation, sortings]",PROGRAMMING +527,Codeforces Round #296 (Div. 2),2,Data Center Drama,2500.0,E,1426610700,"[dfs and similar, graphs]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Glass Carving,500.0,A,1426610700,"[data structures, implementation]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Clique Problem,1000.0,B,1426610700,"[dp, greedy]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Data Center Drama,1500.0,C,1426610700,"[constructive algorithms, graphs]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Fuzzy Search,2000.0,D,1426610700,"[bitmasks, brute force, fft]",PROGRAMMING +528,Codeforces Round #296 (Div. 1),1,Triangles 3000,2500.0,E,1426610700,"[geometry, sortings]",PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,"Rotate, Flip and Zoom",500.0,A,1426345200,[implementation],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Mean Requests,1000.0,B,1426345200,[implementation],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Name Quest,1500.0,C,1426345200,[greedy],PROGRAMMING +523,VK Cup 2015 - Qualification Round 2,12,Statistics of Recompressing Videos,2000.0,D,1426345200,"[data structures, implementation]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Reposts,500.0,A,1425740400,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Photo to Remember,1000.0,B,1425740400,"[data structures, dp, implementation]",PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Chicken or Fish?,1500.0,C,1425740400,[greedy],PROGRAMMING +522,VK Cup 2015 - Qualification Round 1,12,Closest Equals,2000.0,D,1425740400,[data structures],PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Pangram,500.0,A,1425279600,"[implementation, strings]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Two Buttons,1000.0,B,1425279600,"[dfs and similar, graphs, greedy, implementation, math, shortest paths]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,DNA Alignment,1500.0,C,1425279600,"[math, strings]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Cubes,2000.0,D,1425279600,"[games, greedy, implementation]",PROGRAMMING +520,Codeforces Round #295 (Div. 2),2,Pluses everywhere,2500.0,E,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,DNA Alignment,500.0,A,1425279600,"[greedy, math]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Cubes,1000.0,B,1425279600,"[data structures, greedy, implementation]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Pluses everywhere,1500.0,C,1425279600,"[combinatorics, dp, math, number theory]",PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Shop,2000.0,D,1425279600,[greedy],PROGRAMMING +521,Codeforces Round #295 (Div. 1),1,Cycling City,2500.0,E,1425279600,"[dfs and similar, graphs]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Chess,500.0,A,1425128400,[implementation],PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Compilation Errors,1000.0,B,1425128400,"[data structures, implementation]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Team Training,1500.0,C,1425128400,"[greedy, implementation, math, number theory]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Interesting Substrings,2000.0,D,1425128400,"[data structures, dp, two pointers]",PROGRAMMING +519,Codeforces Round #294 (Div. 2),2,A and B and Lecture Rooms,2500.0,E,1425128400,"[binary search, data structures, dfs and similar, dp, trees]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Vitaly and Strings,500.0,A,1424795400,[strings],PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Tanya and Postcard,1000.0,B,1424795400,"[implementation, strings]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Anya and Smartphone,1500.0,C,1424795400,"[data structures, implementation]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Ilya and Escalator,2000.0,D,1424795400,"[combinatorics, dp, probabilities]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Arthur and Questions,2500.0,E,1424795400,"[greedy, implementation, ternary search]",PROGRAMMING +518,Codeforces Round #293 (Div. 2),2,Pasha and Pipe,2500.0,F,1424795400,"[binary search, brute force, combinatorics, dp, implementation]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Date,500.0,A,1424190900,[math],PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and His Happy Friends,1000.0,B,1424190900,"[brute force, dsu, meet-in-the-middle, number theory]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Factorial,1000.0,C,1424190900,"[greedy, math, sortings]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Tiles,3000.0,D,1424190900,"[constructive algorithms, greedy]",PROGRAMMING +515,Codeforces Round #292 (Div. 2),2,Drazil and Park,3000.0,E,1424190900,[data structures],PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Factorial,500.0,A,1424190900,"[dp, greedy, implementation, math]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Tiles,1000.0,B,1424190900,"[data structures, graph matchings, greedy, implementation]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Park,1500.0,C,1424190900,[data structures],PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and Morning Exercise,3000.0,D,1424190900,"[dfs and similar, dp, dsu, trees, two pointers]",PROGRAMMING +516,Codeforces Round #292 (Div. 1),1,Drazil and His Happy Friends,3000.0,E,1424190900,"[math, number theory]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Chewbaсca and Number,500.0,A,1423931400,"[greedy, implementation]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Han Solo and Lazer Gun,1000.0,B,1423931400,"[brute force, data structures, geometry, math]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Watto and Mechanism,2000.0,C,1423931400,"[binary search, hashing, string suffix structures, strings]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,R2D2 and Droid Army,2000.0,D,1423931400,"[binary search, data structures, two pointers]",PROGRAMMING +514,Codeforces Round #291 (Div. 2),2,Darth Vader and Tree,2500.0,E,1423931400,"[dp, matrices]",PROGRAMMING +513,Rockethon 2015,12,Game,3.0,A,1423328400,"[constructive algorithms, math]",PROGRAMMING +513,Rockethon 2015,12,Permutations,3.0,B1,1423328400,[brute force],PROGRAMMING +513,Rockethon 2015,12,Permutations,4.0,B2,1423328400,"[bitmasks, divide and conquer, math]",PROGRAMMING +513,Rockethon 2015,12,Second price auction,8.0,C,1423328400,"[bitmasks, probabilities]",PROGRAMMING +513,Rockethon 2015,12,Constrained Tree,9.0,D1,1423328400,[dfs and similar],PROGRAMMING +513,Rockethon 2015,12,Constrained Tree,8.0,D2,1423328400,"[constructive algorithms, data structures]",PROGRAMMING +513,Rockethon 2015,12,Subarray Cuts,9.0,E1,1423328400,[dp],PROGRAMMING +513,Rockethon 2015,12,Subarray Cuts,12.0,E2,1423328400,[dp],PROGRAMMING +513,Rockethon 2015,12,Scaygerboss,14.0,F1,1423328400,[flows],PROGRAMMING +513,Rockethon 2015,12,Scaygerboss,6.0,F2,1423328400,[flows],PROGRAMMING +513,Rockethon 2015,12,Inversions problem,3.0,G1,1423328400,"[brute force, dfs and similar, dp, meet-in-the-middle]",PROGRAMMING +513,Rockethon 2015,12,Inversions problem,5.0,G2,1423328400,"[dp, probabilities]",PROGRAMMING +513,Rockethon 2015,12,Inversions problem,16.0,G3,1423328400,[dp],PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Names,500.0,A,1422894600,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Jumping,1000.0,B,1422894600,"[data structures, dp, math, number theory, shortest paths]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Dinner,1500.0,C,1422894600,"[flows, graph matchings]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Travelling,2250.0,D,1422894600,"[dp, trees]",PROGRAMMING +512,Codeforces Round #290 (Div. 1),1,Fox And Polygon,2250.0,E,1422894600,"[constructive algorithms, divide and conquer]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Snake,500.0,A,1422894600,[implementation],PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Two Dots,1000.0,B,1422894600,[dfs and similar],PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Names,1500.0,C,1422894600,"[dfs and similar, graphs, sortings]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Jumping,2000.0,D,1422894600,"[bitmasks, brute force, dp, math]",PROGRAMMING +510,Codeforces Round #290 (Div. 2),2,Fox And Dinner,2500.0,E,1422894600,[flows],PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Maximum in Table,,A,1422705600,"[brute force, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Painting Pebbles,,B,1422705600,"[constructive algorithms, greedy, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Sums of Digits,,C,1422705600,"[dp, greedy, implementation]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Restoring Numbers,,D,1422705600,"[constructive algorithms, math]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Pretty Song,,E,1422705600,"[math, strings]",PROGRAMMING +509,"Codeforces Round #289 (Div. 2, ACM ICPC Rules)",2,Progress Monitoring,,F,1422705600,[dp],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Pasha and Pixels,500.0,A,1422376200,[brute force],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Anton and currency you all know,1000.0,B,1422376200,[greedy],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Anya and Ghosts,1500.0,C,1422376200,[greedy],PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Tanya and Password,2000.0,D,1422376200,"[dfs and similar, graphs]",PROGRAMMING +508,Codeforces Round #288 (Div. 2),2,Arthur and Brackets,2500.0,E,1422376200,"[dp, greedy]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Amr and Music,500.0,A,1422028800,"[greedy, implementation, sortings]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Amr and Pins,1000.0,B,1422028800,"[geometry, math]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Guess Your Way Out!,1500.0,C,1422028800,"[implementation, math]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,The Maths Lecture,2000.0,D,1422028800,"[dp, implementation]",PROGRAMMING +507,Codeforces Round #287 (Div. 2),2,Breaking Good,2500.0,E,1422028800,"[dfs and similar, dp, graphs, shortest paths]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Gift,500.0,A,1421586000,"[brute force, implementation, strings]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Colorful Graph,1000.0,B,1421586000,"[dfs and similar, dp, dsu, graphs]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,"Mr. Kitayuta, the Treasure Hunter",1500.0,C,1421586000,"[dfs and similar, dp, two pointers]",PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta's Technology,2000.0,D,1421586000,[dfs and similar],PROGRAMMING +505,Codeforces Round #286 (Div. 2),2,Mr. Kitayuta vs. Bamboos,2750.0,E,1421586000,"[binary search, greedy]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,"Mr. Kitayuta, the Treasure Hunter",500.0,A,1421586000,[dp],PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Technology,1000.0,B,1421586000,"[dfs and similar, graphs]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta vs. Bamboos,1750.0,C,1421586000,[binary search],PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Colorful Graph,1750.0,D,1421586000,"[brute force, dfs and similar, dsu]",PROGRAMMING +506,Codeforces Round #286 (Div. 1),1,Mr. Kitayuta's Gift,2500.0,E,1421586000,"[combinatorics, dp, matrices, strings]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Contest,500.0,A,1421053200,[implementation],PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Changing Handles,500.0,B,1421053200,"[data structures, dsu, strings]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Forest,1500.0,C,1421053200,"[constructive algorithms, data structures, greedy, sortings, trees]",PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Permutations Summation,3000.0,D,1421053200,[data structures],PROGRAMMING +501,Codeforces Round #285 (Div. 2),2,Misha and Palindrome Degree,3000.0,E,1421053200,"[binary search, combinatorics, implementation]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Forest,500.0,A,1421053200,"[constructive algorithms, data structures, graphs, greedy]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Permutations Summation,500.0,B,1421053200,"[binary search, data structures, math]",PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and Palindrome Degree,2500.0,C,1421053200,[math],PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and XOR,2500.0,D,1421053200,[bitmasks],PROGRAMMING +504,Codeforces Round #285 (Div. 1),1,Misha and LCP on Tree,3000.0,E,1421053200,"[binary search, dfs and similar, hashing, string suffix structures, trees]",PROGRAMMING +500,Good Bye 2014,12,New Year Transportation,500.0,A,1419951600,"[dfs and similar, graphs, implementation]",PROGRAMMING +500,Good Bye 2014,12,New Year Permutation,1000.0,B,1419951600,"[dfs and similar, dsu, graphs, greedy, math, sortings]",PROGRAMMING +500,Good Bye 2014,12,New Year Book Reading,1000.0,C,1419951600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +500,Good Bye 2014,12,New Year Santa Network,1500.0,D,1419951600,"[combinatorics, dfs and similar, graphs, trees]",PROGRAMMING +500,Good Bye 2014,12,New Year Domino,2750.0,E,1419951600,"[data structures, dp, dsu]",PROGRAMMING +500,Good Bye 2014,12,New Year Shopping,2750.0,F,1419951600,"[divide and conquer, dp]",PROGRAMMING +500,Good Bye 2014,12,New Year Running,3500.0,G,1419951600,"[number theory, trees]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Crazy Town,500.0,A,1419438600,[geometry],PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Name That Tune,2000.0,B,1419438600,"[dp, probabilities, two pointers]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Array and Operations,1000.0,C,1419438600,"[flows, graph matchings, number theory]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Traffic Jams in the Land,2000.0,D,1419438600,"[data structures, dp, number theory]",PROGRAMMING +498,Codeforces Round #284 (Div. 1),1,Stairs and Lines,2500.0,E,1419438600,"[dp, matrices]",PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Watching a movie,500.0,A,1419438600,[implementation],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Lecture,500.0,B,1419438600,[strings],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Crazy Town,1500.0,C,1419438600,[math],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Name That Tune,3000.0,D,1419438600,[],PROGRAMMING +499,Codeforces Round #284 (Div. 2),2,Array and Operations,3000.0,E,1419438600,[],PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Minimum Difficulty,500.0,A,1418833800,"[brute force, implementation, math]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Secret Combination,1000.0,B,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Removing Columns,1750.0,C,1418833800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Tennis Game,2250.0,D,1418833800,[binary search],PROGRAMMING +496,Codeforces Round #283 (Div. 2),2,Distributing Parts ,2250.0,E,1418833800,"[greedy, sortings]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Removing Columns,750.0,A,1418833800,[greedy],PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Tennis Game,1250.0,B,1418833800,"[binary search, brute force, implementation]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Distributing Parts ,1250.0,C,1418833800,"[data structures, greedy, implementation, sortings, two pointers]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Gears,2000.0,D,1418833800,"[brute force, geometry, math]",PROGRAMMING +497,Codeforces Round #283 (Div. 1),1,Subsequences Return,2500.0,E,1418833800,"[dp, matrices]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Treasure,500.0,A,1418488200,[greedy],PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Obsessive String,1000.0,B,1418488200,"[dp, strings]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Helping People,1750.0,C,1418488200,"[dp, probabilities]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Birthday,1750.0,D,1418488200,"[data structures, dfs and similar, dp, trees]",PROGRAMMING +494,Codeforces Round #282 (Div. 1),1,Sharti,2500.0,E,1418488200,[games],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Digital Counter,500.0,A,1418488200,[implementation],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Modular Equations,1000.0,B,1418488200,[math],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Treasure,1500.0,C,1418488200,[implementation],PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Obsessive String,2000.0,D,1418488200,"[binary search, dp, strings]",PROGRAMMING +495,Codeforces Round #282 (Div. 2),2,Helping People,2750.0,E,1418488200,[],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Football,500.0,A,1417618800,[implementation],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Wrestling,1000.0,B,1417618800,[implementation],PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Basketball,2000.0,C,1417618800,"[binary search, brute force, data structures, implementation, sortings, two pointers]",PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Chess,1500.0,D,1417618800,"[constructive algorithms, games]",PROGRAMMING +493,Codeforces Round #281 (Div. 2),2,Vasya and Polynomial,3000.0,E,1417618800,[math],PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Cubes,500.0,A,1417451400,[implementation],PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Lanterns,1000.0,B,1417451400,"[binary search, math, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Exams,1500.0,C,1417451400,"[greedy, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Computer Game,2000.0,D,1417451400,"[binary search, implementation, math, sortings]",PROGRAMMING +492,Codeforces Round #280 (Div. 2),2,Vanya and Field,2500.0,E,1417451400,[math],PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Team Olympiad,500.0,A,1416733800,"[greedy, implementation, sortings]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Queue,1000.0,B,1416733800,"[dsu, implementation]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Hacking Cypher,1500.0,C,1416733800,"[brute force, math, strings]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Chocolate,2000.0,D,1416733800,"[brute force, dfs and similar, math, meet-in-the-middle, number theory]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Restoring Increasing Sequence,2000.0,E,1416733800,"[binary search, brute force, greedy, implementation]",PROGRAMMING +490,Codeforces Round #279 (Div. 2),2,Treeland Tour,2500.0,F,1416733800,"[data structures, dfs and similar, dp, trees]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Fight the Monster,500.0,A,1416590400,"[binary search, brute force]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Strip,1500.0,B,1416590400,"[binary search, data structures, dp, two pointers]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Prefix Product Sequence,1500.0,C,1416590400,"[constructive algorithms, number theory]",PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Conveyor Belts,2000.0,D,1416590400,[data structures],PROGRAMMING +487,Codeforces Round #278 (Div. 1),1,Tourists,2500.0,E,1416590400,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Giga Tower,500.0,A,1416590400,[brute force],PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Candy Boxes,1500.0,B,1416590400,"[brute force, constructive algorithms]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Fight the Monster,1500.0,C,1416590400,[brute force],PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Strip,2500.0,D,1416590400,"[data structures, dp, two pointers]",PROGRAMMING +488,Codeforces Round #278 (Div. 2),2,Prefix Product Sequence,2500.0,E,1416590400,"[constructive algorithms, math]",PROGRAMMING +491,Testing Round #11,12,Up the hill,500.0,A,1416519000,[implementation],PROGRAMMING +491,Testing Round #11,12,New York Hotel,1000.0,B,1416519000,"[greedy, math]",PROGRAMMING +491,Testing Round #11,12,Deciphering,1500.0,C,1416519000,"[flows, graph matchings]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,SwapSort,500.0,A,1416238500,"[implementation, sortings]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,BerSU Ball,1000.0,B,1416238500,"[dfs and similar, dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Given Length and Sum of Digits...,1500.0,C,1416238500,"[dp, greedy, implementation]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Unbearable Controversy of Being,2000.0,D,1416238500,"[brute force, combinatorics, dfs and similar, graphs]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Hiking,2500.0,E,1416238500,"[binary search, dp]",PROGRAMMING +489,Codeforces Round #277.5 (Div. 2),2,Special Matrices,2500.0,F,1416238500,"[combinatorics, dp]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Calculating Function,500.0,A,1415718000,"[implementation, math]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,OR in Matrix,1000.0,B,1415718000,"[greedy, hashing, implementation]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Palindrome Transformation,1500.0,C,1415718000,"[greedy, implementation]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,Valid Sets,2000.0,D,1415718000,"[dfs and similar, dp, math, trees]",PROGRAMMING +486,Codeforces Round #277 (Div. 2),2,LIS of Sequence,2500.0,E,1415718000,"[data structures, dp, greedy, hashing, math]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Bits,500.0,A,1415205000,"[bitmasks, constructive algorithms]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Maximum Value,1000.0,B,1415205000,"[binary search, math, sortings, two pointers]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Strange Sorting,3000.0,C,1415205000,"[implementation, math]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Kindergarten,2000.0,D,1415205000,"[data structures, dp, greedy]",PROGRAMMING +484,Codeforces Round #276 (Div. 1),1,Sign on Fence,3000.0,E,1415205000,"[binary search, constructive algorithms, data structures]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Factory,1000.0,A,1415205000,"[implementation, math, matrices]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Valuable Resources,500.0,B,1415205000,"[brute force, greedy]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Bits,1500.0,C,1415205000,"[implementation, math]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Maximum Value,3000.0,D,1415205000,"[binary search, sortings]",PROGRAMMING +485,Codeforces Round #276 (Div. 2),2,Strange Sorting,3000.0,E,1415205000,[],PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Diverse Permutation,500.0,A,1414170000,"[constructive algorithms, greedy]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Interesting Array,1500.0,B,1414170000,"[constructive algorithms, data structures, trees]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Game with Strings,1500.0,C,1414170000,"[bitmasks, dp, probabilities]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,Random Function and Tree,2000.0,D,1414170000,"[combinatorics, dp, trees]",PROGRAMMING +482,Codeforces Round #275 (Div. 1),1,ELCA,2500.0,E,1414170000,"[data structures, trees]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Counterexample ,500.0,A,1414170000,"[brute force, implementation]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Friends and Presents,1000.0,B,1414170000,"[binary search, math]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Diverse Permutation,1500.0,C,1414170000,"[constructive algorithms, implementation]",PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Interesting Array,2500.0,D,1414170000,[data structures],PROGRAMMING +483,Codeforces Round #275 (Div. 2),2,Game with Strings,2500.0,E,1414170000,[],PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Expression,500.0,A,1413709200,"[brute force, math]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Towers,1000.0,B,1413709200,"[brute force, greedy, implementation, sortings]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Exams,1500.0,C,1413709200,"[greedy, sortings]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Long Jumps,2000.0,D,1413709200,"[binary search, greedy, implementation]",PROGRAMMING +479,Codeforces Round #274 (Div. 2),2,Riding in a Lift,2500.0,E,1413709200,[dp],PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Exams,500.0,A,1413709200,"[greedy, sortings]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Long Jumps,1000.0,B,1413709200,"[binary search, greedy, hashing, implementation, sortings]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Riding in a Lift,1500.0,C,1413709200,"[dp, implementation]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Parcels,2000.0,D,1413709200,"[dp, graphs]",PROGRAMMING +480,Codeforces Round #274 (Div. 1),1,Parking Lot,2500.0,E,1413709200,"[data structures, divide and conquer]",PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Initial Bet,500.0,A,1413474000,[implementation],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Random Teams,1000.0,B,1413474000,"[combinatorics, constructive algorithms, greedy, math]",PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Table Decorations,1500.0,C,1413474000,[greedy],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Red-Green Towers,2000.0,D,1413474000,[dp],PROGRAMMING +478,Codeforces Round #273 (Div. 2),2,Wavy numbers,2500.0,E,1413474000,"[brute force, dfs and similar, meet-in-the-middle, sortings]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Stairs,500.0,A,1413122400,"[implementation, math]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and WiFi,1500.0,B,1413122400,"[bitmasks, brute force, combinatorics, dp, math, probabilities]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sums,1500.0,C,1413122400,[math],PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Sets,2000.0,D,1413122400,"[constructive algorithms, greedy, math]",PROGRAMMING +476,Codeforces Round #272 (Div. 2),2,Dreamoon and Strings,2500.0,E,1413122400,"[dp, strings]",PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sums,500.0,A,1413122400,[math],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Sets,1000.0,B,1413122400,[math],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Strings,1500.0,C,1413122400,[dp],PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Binary,2000.0,D,1413122400,"[dp, strings]",PROGRAMMING +477,Codeforces Round #272 (Div. 1),1,Dreamoon and Notepad,3000.0,E,1413122400,[data structures],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Keyboard,500.0,A,1412609400,[implementation],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Worms,1000.0,B,1412609400,"[binary search, implementation]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Captain Marmot,1500.0,C,1412609400,"[brute force, geometry]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Flowers,2000.0,D,1412609400,[dp],PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Pillars,3000.0,E,1412609400,"[binary search, data structures, dp, sortings, trees]",PROGRAMMING +474,Codeforces Round #271 (Div. 2),2,Ant colony,3000.0,F,1412609400,"[data structures, number theory]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Bayan Bus,500.0,A,1412514000,[implementation],PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Strongly Connected City,1000.0,B,1412514000,"[brute force, dfs and similar, graphs, implementation]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Kamal-ol-molk's Painting,1500.0,C,1412514000,"[brute force, constructive algorithms, greedy]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,CGCDSSQ,2000.0,D,1412514000,"[brute force, data structures, math]",PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Strongly Connected City 2,2500.0,E,1412514000,[dfs and similar],PROGRAMMING +475,Bayan 2015 Contest Warm Up,12,Meta-universe,2500.0,F,1412514000,[data structures],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from Math,500.0,A,1411918500,"[math, number theory]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from Life,1000.0,B,1411918500,[],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Make It Nondeterministic,1500.0,C,1411918500,[greedy],PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Inverse the Problem,2000.0,D,1411918500,"[dfs and similar, dsu, shortest paths, trees]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Learn from a Game,3000.0,E,1411918500,"[constructive algorithms, implementation]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Change the Goal,3000.0,F,1411918500,"[constructive algorithms, math, matrices]",PROGRAMMING +472,Codeforces Round #270,12,Design Tutorial: Increase the Constraints,3500.0,G,1411918500,"[bitmasks, data structures, fft]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Sticks,500.0,A,1411745400,[implementation],PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Important Things,1000.0,B,1411745400,[sortings],PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and House of Cards,2000.0,C,1411745400,"[binary search, brute force, greedy, math]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Cube Walls,2000.0,D,1411745400,"[string suffix structures, strings]",PROGRAMMING +471,Codeforces Round #269 (Div. 2),2,MUH and Lots and Lots of Segments,2500.0,E,1411745400,"[data structures, dsu]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,24 Game,500.0,A,1411218000,"[constructive algorithms, greedy, math]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Two Sets,1000.0,B,1411218000,"[2-sat, dfs and similar, dsu, graph matchings, greedy]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Hack it!,1500.0,C,1411218000,"[binary search, constructive algorithms, math]",PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Tree,2000.0,D,1411218000,[graph matchings],PROGRAMMING +468,Codeforces Round #268 (Div. 1),1,Permanent,2500.0,E,1411218000,"[dp, graph matchings, math, meet-in-the-middle]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,I Wanna Be the Guy,500.0,A,1411218000,"[greedy, implementation]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Chat Online,1000.0,B,1411218000,[implementation],PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,24 Game,1500.0,C,1411218000,"[constructive algorithms, implementation]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Two Sets,2000.0,D,1411218000,"[2-sat, data structures, graph matchings, greedy]",PROGRAMMING +469,Codeforces Round #268 (Div. 2),2,Hack it!,2500.0,E,1411218000,[constructive algorithms],PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,George and Accommodation,500.0,A,1411054200,[implementation],PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Fedor and New Game,1000.0,B,1411054200,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,George and Job,1500.0,C,1411054200,"[dp, implementation]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Fedor and Essay,2000.0,D,1411054200,"[dfs and similar, dp, graphs, hashing, strings]",PROGRAMMING +467,Codeforces Round #267 (Div. 2),2,Alex and Complicated Task,2500.0,E,1411054200,"[data structures, dp, greedy]",PROGRAMMING +470,Surprise Language Round #7,12,Crystal Ball Sequence,,A,1410622200,"[*special, implementation]",PROGRAMMING +470,Surprise Language Round #7,12,Hexakosioihexekontahexaphobia,,B,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Eval,,C,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Caesar Cipher,,D,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Chessboard,,E,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Pairwise Sums,,F,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Hamming Distance,,G,1410622200,[*special],PROGRAMMING +470,Surprise Language Round #7,12,Array Sorting,,H,1410622200,[*special],PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Cheap Travel,500.0,A,1410535800,[implementation],PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Wonder Room,1000.0,B,1410535800,"[brute force, math]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Number of Ways,1500.0,C,1410535800,"[binary search, brute force, data structures, dp, two pointers]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Increase Sequence,2000.0,D,1410535800,"[combinatorics, dp]",PROGRAMMING +466,Codeforces Round #266 (Div. 2),2,Information Graph,2500.0,E,1410535800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,No to Palindromes!,500.0,A,1410103800,"[greedy, strings]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,Restore Cube ,1500.0,B,1410103800,"[brute force, geometry]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,Substitutes in Number,1500.0,C,1410103800,[dp],PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,World of Darkraft - 2,2000.0,D,1410103800,"[dp, probabilities]",PROGRAMMING +464,Codeforces Round #265 (Div. 1),1,The Classic Problem,2500.0,E,1410103800,"[data structures, graphs, shortest paths]",PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,inc ARG,500.0,A,1410103800,[implementation],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Inbox (100500),1000.0,B,1410103800,[implementation],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,No to Palindromes!,1500.0,C,1410103800,[brute force],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Restore Cube ,2500.0,D,1410103800,[brute force],PROGRAMMING +465,Codeforces Round #265 (Div. 2),2,Substitutes in Number,2500.0,E,1410103800,"[constructive algorithms, dp]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Sugar,500.0,A,1409383800,[implementation],PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Pylons,1000.0,B,1409383800,[math],PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Gargari and Bishops,1500.0,C,1409383800,"[greedy, hashing, implementation]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Gargari and Permutations,2000.0,D,1409383800,"[dfs and similar, dp, graphs]",PROGRAMMING +463,Codeforces Round #264 (Div. 2),2,Caisa and Tree,2500.0,E,1409383800,"[brute force, dfs and similar, trees]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Toastman,500.0,A,1409061600,"[greedy, sortings]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Tree,1000.0,B,1409061600,"[dfs and similar, dp, trees]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and a Sheet of Paper,1500.0,C,1409061600,"[data structures, implementation]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and Complicated Task,2000.0,D,1409061600,"[dsu, math]",PROGRAMMING +461,Codeforces Round #263 (Div. 1),1,Appleman and a Game,2500.0,E,1409061600,[shortest paths],PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Easy Task,500.0,A,1409061600,"[brute force, implementation]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Card Game,1000.0,B,1409061600,[greedy],PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Toastman,1500.0,C,1409061600,"[implementation, sortings]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and Tree,2000.0,D,1409061600,"[dp, graphs]",PROGRAMMING +462,Codeforces Round #263 (Div. 2),2,Appleman and a Sheet of Paper,2500.0,E,1409061600,[],PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Vasya and Socks,500.0,A,1408548600,"[brute force, implementation, math]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Little Dima and Equation,1000.0,B,1408548600,"[brute force, implementation, math]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Present,1500.0,C,1408548600,"[binary search, data structures, greedy]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Little Victor and Set,2000.0,D,1408548600,"[brute force, constructive algorithms]",PROGRAMMING +460,Codeforces Round #262 (Div. 2),2,Roland and Rose,2500.0,E,1408548600,"[brute force, geometry, math, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Garden,500.0,A,1408116600,[implementation],PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Flowers,500.0,B,1408116600,"[combinatorics, implementation, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Buses,2000.0,C,1408116600,"[combinatorics, constructive algorithms, math]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Parmida's problem,2000.0,D,1408116600,"[data structures, divide and conquer, sortings]",PROGRAMMING +459,Codeforces Round #261 (Div. 2),2,Pashmak and Graph,3000.0,E,1408116600,"[dp, sortings]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Golden System,1000.0,A,1407690000,"[math, meet-in-the-middle]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Elections,1500.0,C,1407690000,[brute force],PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Bingo!,2000.0,D,1407690000,"[combinatorics, math, probabilities]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,Flow Optimality,2500.0,E,1407690000,"[constructive algorithms, flows, math]",PROGRAMMING +457,MemSQL Start[c]UP 2.0 - Round 2,12,An easy problem about trees,3000.0,F,1407690000,"[dp, games, greedy, trees]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Golden System,1000.0,A,1407690000,[math],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Distributed Join,1000.0,B,1407690000,[greedy],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Elections,1500.0,C,1407690000,"[data structures, ternary search]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Bingo!,2000.0,D,1407690000,"[combinatorics, probabilities]",PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,Flow Optimality,2500.0,E,1407690000,[],PROGRAMMING +458,MemSQL Start[c]UP 2.0 - Round 2 - Online Round,12,An easy problem about trees,3000.0,F,1407690000,[],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Boredom,500.0,A,1407511800,[dp],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,A Lot of Games,1000.0,B,1407511800,"[dfs and similar, dp, games, implementation, strings, trees]",PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Civilization,1500.0,C,1407511800,"[dfs and similar, dp, dsu, ternary search, trees]",PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Serega and Fun,2000.0,D,1407511800,[data structures],PROGRAMMING +455,Codeforces Round #260 (Div. 1),1,Function,2500.0,E,1407511800,[data structures],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Laptops,500.0,A,1407511800,[sortings],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Fedya and Maths,1000.0,B,1407511800,"[math, number theory]",PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Boredom,1500.0,C,1407511800,[dp],PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,A Lot of Games,2000.0,D,1407511800,"[dp, games, strings]",PROGRAMMING +456,Codeforces Round #260 (Div. 2),2,Civilization,2500.0,E,1407511800,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Expected Maximum,500.0,A,1406907000,[probabilities],PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Harmony Chest,1000.0,B,1406907000,"[bitmasks, brute force, dp]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Summer Sun Celebration,1500.0,C,1406907000,"[constructive algorithms, dfs and similar]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Elements of Harmony,2500.0,D,1406907000,"[dp, matrices]",PROGRAMMING +453,Codeforces Round #259 (Div. 1),1,Little Pony and Lord Tirek,2500.0,E,1406907000,[data structures],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Crystal Mine,500.0,A,1406907000,[implementation],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Sort by Shift,1000.0,B,1406907000,[implementation],PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Expected Maximum,1500.0,C,1406907000,"[combinatorics, math, probabilities]",PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Harmony Chest,2000.0,D,1406907000,"[bitmasks, dp]",PROGRAMMING +454,Codeforces Round #259 (Div. 2),2,Little Pony and Summer Sun Celebration,2500.0,E,1406907000,[dfs and similar],PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Eevee,500.0,A,1406480400,"[brute force, implementation, strings]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,4-point polyline,1000.0,B,1406480400,"[brute force, constructive algorithms, geometry, trees]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Magic Trick,1000.0,C,1406480400,"[combinatorics, math, probabilities]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,"Washer, Dryer, Folder",1500.0,D,1406480400,"[greedy, implementation]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Three strings,2500.0,E,1406480400,"[data structures, dsu, string suffix structures, strings]",PROGRAMMING +452,MemSQL Start[c]UP 2.0 - Round 1,12,Permutation,2500.0,F,1406480400,"[data structures, divide and conquer, hashing]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Game With Sticks,500.0,A,1406215800,[implementation],PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Sort the Array,1000.0,B,1406215800,"[implementation, sortings]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Predict Outcome of the Game,1500.0,C,1406215800,"[brute force, implementation, math]",PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Count Good Substrings,2500.0,D,1406215800,[math],PROGRAMMING +451,Codeforces Round #258 (Div. 2),2,Devu and Flowers,3000.0,E,1406215800,"[bitmasks, combinatorics, number theory]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Chocolate,500.0,A,1405774800,[math],PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Cities,1000.0,B,1405774800,"[graphs, shortest paths]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Apples,1500.0,C,1405774800,"[constructive algorithms, number theory]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Numbers,2000.0,D,1405774800,"[bitmasks, combinatorics, dp]",PROGRAMMING +449,Codeforces Round #257 (Div. 1),1,Jzzhu and Squares,2500.0,E,1405774800,"[dp, math, number theory]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Children,500.0,A,1405774800,[implementation],PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Sequences,1000.0,B,1405774800,"[implementation, math]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Chocolate,1500.0,C,1405774800,"[greedy, implementation]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Cities,2000.0,D,1405774800,"[graphs, shortest paths]",PROGRAMMING +450,Codeforces Round #257 (Div. 2),2,Jzzhu and Apples,2500.0,E,1405774800,"[constructive algorithms, number theory]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Rewards,500.0,A,1405605600,[implementation],PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Suffix Structures,1000.0,B,1405605600,"[implementation, strings]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Painting Fence,2500.0,C,1405605600,"[divide and conquer, dp, greedy]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Multiplication Table,2000.0,D,1405605600,"[binary search, brute force]",PROGRAMMING +448,Codeforces Round #256 (Div. 2),2,Divisors,3000.0,E,1405605600,"[brute force, dfs and similar, implementation, number theory]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Sequences,500.0,A,1405256400,"[dp, implementation, two pointers]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Modification,1500.0,B,1405256400,"[brute force, greedy]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Fibonacci Numbers,1500.0,C,1405256400,"[data structures, number theory]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Games,2000.0,D,1405256400,"[math, matrices, probabilities]",PROGRAMMING +446,Codeforces Round #FF (Div. 1),1,DZY Loves Bridges,2500.0,E,1405256400,"[math, matrices]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Hash,500.0,A,1405256400,[implementation],PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Strings,1000.0,B,1405256400,"[greedy, implementation]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Sequences,1500.0,C,1405256400,[dp],PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Modification,2500.0,D,1405256400,"[data structures, greedy]",PROGRAMMING +447,Codeforces Round #FF (Div. 2),2,DZY Loves Fibonacci Numbers,2500.0,E,1405256400,[data structures],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Physics,500.0,A,1404651900,"[greedy, math]",PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves FFT,1000.0,B,1404651900,[probabilities],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Colors,2000.0,C,1404651900,[data structures],PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Strings,2000.0,D,1404651900,"[binary search, hashing, strings, two pointers]",PROGRAMMING +444,Codeforces Round #254 (Div. 1),1,DZY Loves Planting,2500.0,E,1404651900,"[binary search, dsu, trees]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Chessboard,500.0,A,1404651900,"[dfs and similar, implementation]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Chemistry,1000.0,B,1404651900,"[dfs and similar, dsu, greedy]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Physics,1500.0,C,1404651900,"[graphs, greedy]",PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves FFT,2000.0,D,1404651900,[probabilities],PROGRAMMING +445,Codeforces Round #254 (Div. 2),2,DZY Loves Colors,3000.0,E,1404651900,[data structures],PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Borya and Hanabi,500.0,A,1403191800,"[bitmasks, brute force, implementation]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Andrey and Problem,1500.0,B,1403191800,"[greedy, math, probabilities]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Artem and Array ,1500.0,C,1403191800,"[data structures, greedy]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Adam and Tree,2000.0,D,1403191800,"[data structures, trees]",PROGRAMMING +442,Codeforces Round #253 (Div. 1),1,Gena and Second Distance,2500.0,E,1403191800,[geometry],PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Anton and Letters,500.0,A,1403191800,"[constructive algorithms, implementation]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Kolya and Tandem Repeat,1000.0,B,1403191800,"[brute force, implementation, strings]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Borya and Hanabi,1500.0,C,1403191800,"[bitmasks, brute force, constructive algorithms, implementation]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Andrey and Problem,2500.0,D,1403191800,"[dp, greedy, math, probabilities, sortings]",PROGRAMMING +443,Codeforces Round #253 (Div. 2),2,Artem and Array ,2500.0,E,1403191800,[],PROGRAMMING +436,Zepto Code Rush 2014,12,Feed with Candy,1000.0,A,1402673400,[greedy],PROGRAMMING +436,Zepto Code Rush 2014,12,Om Nom and Spiders,1000.0,B,1402673400,"[implementation, math]",PROGRAMMING +436,Zepto Code Rush 2014,12,Dungeons and Candies,1500.0,C,1402673400,"[dsu, graphs, greedy, trees]",PROGRAMMING +436,Zepto Code Rush 2014,12,Pudding Monsters,2500.0,D,1402673400,[dp],PROGRAMMING +436,Zepto Code Rush 2014,12,Cardboard Box,2500.0,E,1402673400,"[data structures, greedy]",PROGRAMMING +436,Zepto Code Rush 2014,12,Banners,3000.0,F,1402673400,"[brute force, data structures, dp]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Antique Items,500.0,A,1402241400,[implementation],PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Fruits,1000.0,B,1402241400,"[greedy, implementation]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Tubes ,1500.0,C,1402241400,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Swaps,2000.0,D,1402241400,"[constructive algorithms, dsu, graphs, implementation, string suffix structures]",PROGRAMMING +441,Codeforces Round #252 (Div. 2),2,Valera and Number,2500.0,E,1402241400,"[bitmasks, dp]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,"Devu, the Singer and Churu, the Joker",500.0,A,1401895800,"[greedy, implementation]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,"Devu, the Dumb Guy",1000.0,B,1401895800,"[implementation, sortings]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and Partitioning of the Array,1500.0,C,1401895800,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and his Brother,2000.0,D,1401895800,"[binary search, sortings, ternary search, two pointers]",PROGRAMMING +439,Codeforces Round #251 (Div. 2),2,Devu and Birthday Celebration,2500.0,E,1401895800,"[combinatorics, dp, math]",PROGRAMMING +440,Testing Round #10,12,Forgotten Episode,500.0,A,1401809400,[implementation],PROGRAMMING +440,Testing Round #10,12,Balancer,1000.0,B,1401809400,[implementation],PROGRAMMING +440,Testing Round #10,12,One-Based Arithmetic,1500.0,C,1401809400,"[dfs and similar, divide and conquer]",PROGRAMMING +440,Testing Round #10,12,Berland Federalization,2000.0,D,1401809400,"[dp, trees]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Homework,500.0,A,1401627600,[implementation],PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Set,1500.0,B,1401627600,"[bitmasks, greedy, implementation, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Toy,1500.0,C,1401627600,"[graphs, greedy, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Zoo,2000.0,D,1401627600,"[dsu, sortings]",PROGRAMMING +437,Codeforces Round #250 (Div. 2),2,The Child and Polygon,2500.0,E,1401627600,[],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Toy,500.0,A,1401627600,[greedy],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Zoo,1000.0,B,1401627600,"[dp, dsu, sortings]",PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Polygon,1500.0,C,1401627600,"[dp, geometry]",PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Sequence,2000.0,D,1401627600,[data structures],PROGRAMMING +438,Codeforces Round #250 (Div. 1),1,The Child and Binary Tree,3000.0,E,1401627600,"[combinatorics, divide and conquer, fft, number theory]",PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Queue on Bus Stop,500.0,A,1401463800,[implementation],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Pasha Maximizes,1000.0,B,1401463800,[greedy],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Cardiogram,1500.0,C,1401463800,[implementation],PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Special Grid,2000.0,D,1401463800,"[brute force, dp, greedy]",PROGRAMMING +435,Codeforces Round #249 (Div. 2),2,Special Graph,2500.0,E,1401463800,[],PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Kitahara Haruki's Gift,500.0,A,1400914800,"[brute force, implementation]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Kuriyama Mirai's Stones,1500.0,B,1400914800,"[dp, implementation, sortings]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Ryouko's Memory Note,1500.0,C,1400914800,"[implementation, math, sortings]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Nanami's Digital Board,2000.0,D,1400914800,"[dsu, implementation]",PROGRAMMING +433,Codeforces Round #248 (Div. 2),2,Tachibana Kanade's Tofu,2500.0,E,1400914800,[dp],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Ryouko's Memory Note,500.0,A,1400914800,"[math, sortings]",PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Nanami's Digital Board,1000.0,B,1400914800,"[divide and conquer, dp, dsu, implementation, two pointers]",PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Tachibana Kanade's Tofu,1500.0,C,1400914800,[dp],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Nanami's Power Plant,2000.0,D,1400914800,[flows],PROGRAMMING +434,Codeforces Round #248 (Div. 1),1,Furukawa Nagisa's Tree,3000.0,E,1400914800,"[binary search, divide and conquer, sortings, trees]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Black Square,500.0,A,1400686200,[implementation],PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Shower Line,1500.0,B,1400686200,"[brute force, implementation]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,k-Tree,1500.0,C,1400686200,"[dp, implementation, trees]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Random Task,2000.0,D,1400686200,"[binary search, bitmasks, combinatorics, dp, math]",PROGRAMMING +431,Codeforces Round #247 (Div. 2),2,Chemistry Experiment,2500.0,E,1400686200,"[binary search, data structures, ternary search]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Choosing Teams,500.0,A,1400167800,"[greedy, implementation, sortings]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Football Kit,1000.0,B,1400167800,"[brute force, greedy, implementation]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Prime Swaps,1500.0,C,1400167800,"[greedy, sortings]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Prefixes and Suffixes,2000.0,D,1400167800,"[dp, string suffix structures, strings, two pointers]",PROGRAMMING +432,Codeforces Round #246 (Div. 2),2,Square Tiling,2500.0,E,1400167800,"[constructive algorithms, greedy]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Xor-tree,500.0,A,1399822800,"[dfs and similar, trees]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Working out,1000.0,B,1399822800,[dp],PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Guess the Tree,1500.0,C,1399822800,"[bitmasks, constructive algorithms, dp, greedy, trees]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Tricky Function,2000.0,D,1399822800,"[data structures, divide and conquer, geometry]",PROGRAMMING +429,Codeforces Round #245 (Div. 1),1,Points and Segments,2000.0,E,1399822800,[graphs],PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Points and Segments (easy),500.0,A,1399822800,"[constructive algorithms, sortings]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Balls Game,1000.0,B,1399822800,"[brute force, two pointers]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Xor-tree,1500.0,C,1399822800,"[brute force, data structures, dfs and similar, trees]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Working out,2000.0,D,1399822800,"[brute force, dp]",PROGRAMMING +430,Codeforces Round #245 (Div. 2),2,Guess the Tree,2500.0,E,1399822800,"[constructive algorithms, data structures, dfs and similar]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Police Recruits,500.0,A,1399044600,[implementation],PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Prison Transfer,1000.0,B,1399044600,"[data structures, implementation]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Checkposts,1500.0,C,1399044600,"[dfs and similar, graphs, two pointers]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Match & Catch,2000.0,D,1399044600,"[dp, string suffix structures, strings]",PROGRAMMING +427,Codeforces Round #244 (Div. 2),2,Police Patrol,2500.0,E,1399044600,"[greedy, implementation, math, ternary search]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Swaps,500.0,A,1398612600,"[brute force, sortings]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Table ,1000.0,B,1398612600,"[bitmasks, greedy]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Two Sequences,1500.0,C,1398612600,"[data structures, dp]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Squares,2000.0,D,1398612600,"[binary search, data structures, hashing]",PROGRAMMING +425,Codeforces Round #243 (Div. 1),1,Sereja and Sets,2000.0,E,1398612600,[dp],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Mugs,500.0,A,1398612600,[implementation],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Mirroring,1000.0,B,1398612600,[implementation],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Swaps,1500.0,C,1398612600,"[brute force, sortings, two pointers]",PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Table ,2000.0,D,1398612600,[],PROGRAMMING +426,Codeforces Round #243 (Div. 2),2,Sereja and Two Sequences,2500.0,E,1398612600,[],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Squats,500.0,A,1398409200,[implementation],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Megacity,1000.0,B,1398409200,"[binary search, greedy, implementation, sortings]",PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Magic Formulas,1500.0,C,1398409200,[math],PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Biathlon Track,2500.0,D,1398409200,"[binary search, brute force, constructive algorithms, data structures, dp]",PROGRAMMING +424,Codeforces Round #242 (Div. 2),2,Colored Jenga,3000.0,E,1398409200,"[dfs and similar, dp, probabilities]",PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Start Up,500.0,A,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Online Meeting,1500.0,B,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Bug in Code,1500.0,C,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Cup Trick,1500.0,D,1398169200,[],PROGRAMMING +419,Coder-Strike 2014 - Finals,12,Playing the ball,2000.0,E,1398169200,[],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Start Up,500.0,A,1398169140,[implementation],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Online Meeting,1500.0,B,1398169140,[implementation],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Bug in Code,1500.0,C,1398169140,"[data structures, graphs, implementation, two pointers]",PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Cup Trick,1500.0,D,1398169140,[data structures],PROGRAMMING +420,"Coder-Strike 2014 - Finals (online edition, Div. 1)",1,Playing the ball,2000.0,E,1398169140,[geometry],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Pasha and Hamsters,500.0,A,1398168900,"[constructive algorithms, implementation]",PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Start Up,1000.0,B,1398168900,[implementation],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Online Meeting,2000.0,C,1398168900,[implementation],PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Bug in Code,2000.0,D,1398168900,"[binary search, data structures, sortings]",PROGRAMMING +421,"Coder-Strike 2014 - Finals (online edition, Div. 2)",2,Cup Trick,2000.0,E,1398168900,[data structures],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Data Recovery,500.0,A,1397977200,[implementation],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Spyke Chatting,1000.0,B,1397977200,[implementation],PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Jeopardy!,1500.0,C,1397977200,"[greedy, math]",PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,2048,2000.0,D,1397977200,"[bitmasks, dp]",PROGRAMMING +413,Coder-Strike 2014 - Round 2,12,Maze 2D,2500.0,E,1397977200,"[data structures, divide and conquer]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Poster,500.0,A,1397837400,"[greedy, implementation]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Network Configuration,1000.0,B,1397837400,"[greedy, sortings]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Pattern,1500.0,C,1397837400,"[implementation, strings]",PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,Giving Awards,2000.0,D,1397837400,[dfs and similar],PROGRAMMING +412,Coder-Strike 2014 - Round 1,12,E-mail Addresses,2500.0,E,1397837400,[implementation],PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Elimination,500.0,A,1397749200,"[dp, implementation, math]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Crash,1000.0,B,1397749200,[implementation],PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Football,1500.0,C,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Cunning Gena,2000.0,D,1397749200,"[bitmasks, dp, greedy, sortings]",PROGRAMMING +417,RCC 2014 Warmup (Div. 2),2,Square Table,2500.0,E,1397749200,"[constructive algorithms, math, probabilities]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Football,500.0,A,1397749200,"[constructive algorithms, graphs, implementation]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Cunning Gena,1000.0,B,1397749200,"[bitmasks, dp, sortings]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Square Table,1500.0,C,1397749200,"[constructive algorithms, dp, math]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Big Problems for Organizers,2500.0,D,1397749200,"[data structures, graphs, trees]",PROGRAMMING +418,RCC 2014 Warmup (Div. 1),1,Tricky Password,2500.0,E,1397749200,[data structures],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Password Check,,A,1397505600,[implementation],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Multi-core Processor,,B,1397505600,[implementation],PROGRAMMING +411,Coder-Strike 2014 - Qualification Round,12,Kicker,,C,1397505600,[implementation],PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Guess a number!,500.0,A,1397376000,"[greedy, implementation, two pointers]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Art Union,1000.0,B,1397376000,"[brute force, dp, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Booking System,1500.0,C,1397376000,"[binary search, dp, greedy, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,Population Size,2000.0,D,1397376000,"[greedy, implementation]",PROGRAMMING +416,Codeforces Round #241 (Div. 2),2,President's Path,2500.0,E,1397376000,"[dp, graphs, shortest paths]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Numbers,500.0,A,1396798800,"[constructive algorithms, number theory]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and ACM,1000.0,B,1396798800,"[combinatorics, dp]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Reverse Operation,1500.0,C,1396798800,"[combinatorics, divide and conquer]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh and Water Tanks,1500.0,D,1396798800,"[binary search, data structures, greedy, two pointers]",PROGRAMMING +414,Codeforces Round #240 (Div. 1),1,Mashmokh's Designed Problem,2500.0,E,1396798800,[data structures],PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Lights,500.0,A,1396798800,[implementation],PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Tokens,1000.0,B,1396798800,"[binary search, greedy, math]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Numbers,1500.0,C,1396798800,"[constructive algorithms, greedy, number theory]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and ACM,2000.0,D,1396798800,"[combinatorics, dp, number theory]",PROGRAMMING +415,Codeforces Round #240 (Div. 2),2,Mashmokh and Reverse Operation,2500.0,E,1396798800,"[divide and conquer, sortings]",PROGRAMMING +409,April Fools Day Contest 2014,12,The Great Game,,A,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Mysterious Language,,B,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Magnum Opus,,C,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Big Data,,D,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,Dome,,E,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,000001,,F,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,On a plane,,G,1396366200,[*special],PROGRAMMING +409,April Fools Day Contest 2014,12,A + B Strikes Back,,H,1396366200,"[*special, brute force, constructive algorithms, dsu, implementation]",PROGRAMMING +409,April Fools Day Contest 2014,12,Feed the Golorp,,I,1396366200,[*special],PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Triangle,500.0,A,1396162800,"[brute force, implementation, math]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Long Path,1000.0,B,1396162800,"[dp, implementation]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Curious Array,2000.0,C,1396162800,"[brute force, implementation, math]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,Largest Submatrix 3,2000.0,D,1396162800,"[dp, hashing]",PROGRAMMING +407,Codeforces Round #239 (Div. 1),1,k-d-sequence,2500.0,E,1396162800,[data structures],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Line to Cashier,500.0,A,1396162800,[implementation],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Garland,1000.0,B,1396162800,[implementation],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Triangle,1500.0,C,1396162800,"[geometry, math]",PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Long Path,2000.0,D,1396162800,[dp],PROGRAMMING +408,Codeforces Round #239 (Div. 2),2,Curious Array,3000.0,E,1396162800,[],PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Gravity Flip,500.0,A,1395502200,"[greedy, implementation, sortings]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Domino Effect,1000.0,B,1395502200,[],PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Unusual Product,1500.0,C,1395502200,"[implementation, math]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Toy Sum,2000.0,D,1395502200,"[greedy, implementation, math]",PROGRAMMING +405,Codeforces Round #238 (Div. 2),2,Graph Cutting,3000.0,E,1395502200,[dfs and similar],PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Unusual Product,500.0,A,1395502200,"[implementation, math]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Toy Sum,1000.0,B,1395502200,"[constructive algorithms, greedy]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Graph Cutting,2000.0,C,1395502200,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Hill Climbing,2000.0,D,1395502200,"[dfs and similar, geometry, trees]",PROGRAMMING +406,Codeforces Round #238 (Div. 1),1,Hamming Triples,2500.0,E,1395502200,"[implementation, math]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Valera and X,500.0,A,1395243000,[implementation],PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Marathon,1000.0,B,1395243000,"[implementation, math]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Restore Graph,1500.0,C,1395243000,"[dfs and similar, graphs, sortings]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Minesweeper 1D,2000.0,D,1395243000,"[dp, implementation]",PROGRAMMING +404,Codeforces Round #237 (Div. 2),2,Maze 1D,2500.0,E,1395243000,"[binary search, greedy, implementation]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Nuts,500.0,A,1394983800,"[greedy, math]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Trees in a Row,1000.0,B,1394983800,[brute force],PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Searching for Graph,1500.0,C,1394983800,"[brute force, constructive algorithms]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Upgrading Array,2000.0,D,1394983800,"[dp, greedy, math]",PROGRAMMING +402,Codeforces Round #236 (Div. 2),2,Strictly Positive Matrix,2500.0,E,1394983800,[graphs],PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Searching for Graph,500.0,A,1394983800,"[constructive algorithms, graphs]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Upgrading Array,1000.0,B,1394983800,"[dp, greedy, number theory]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Strictly Positive Matrix,1500.0,C,1394983800,[graphs],PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Beautiful Pairs of Numbers,1500.0,D,1394983800,"[combinatorics, dp]",PROGRAMMING +403,Codeforces Round #236 (Div. 1),1,Two Rooted Trees,2000.0,E,1394983800,"[data structures, implementation]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Vanya and Cards,500.0,A,1394465400,"[implementation, math]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Sereja and Contests,1000.0,B,1394465400,"[greedy, implementation, math]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Team,1500.0,C,1394465400,"[constructive algorithms, greedy, implementation]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Roman and Numbers,2000.0,D,1394465400,"[bitmasks, brute force, combinatorics, dp, number theory]",PROGRAMMING +401,Codeforces Round #235 (Div. 2),2,Olympic Games,2500.0,E,1394465400,[math],PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Choose Options,500.0,A,1394033400,"[dp, implementation]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and New Matrix of Candies,1000.0,B,1394033400,"[brute force, implementation, schedules]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Huge Candy Matrix,1500.0,C,1394033400,"[implementation, math]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Dima and Bacteria,2000.0,D,1394033400,"[dsu, graphs, shortest paths]",PROGRAMMING +400,Codeforces Round #234 (Div. 2),2,Inna and Binary Logic,2500.0,E,1394033400,"[binary search, bitmasks, data structures]",PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Cards,500.0,A,1393687800,[implementation],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Painting The Wall,1000.0,B,1393687800,"[dp, probabilities]",PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Tree and Array,1500.0,C,1393687800,[constructive algorithms],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Instant Messanger,2000.0,D,1393687800,[data structures],PROGRAMMING +398,Codeforces Round #233 (Div. 1),1,Sorting Permutations,2500.0,E,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Pages,500.0,A,1393687800,[implementation],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Red and Blue Balls,1000.0,B,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Cards,1500.0,C,1393687800,[number theory],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Painting The Wall,2000.0,D,1393687800,[],PROGRAMMING +399,Codeforces Round #233 (Div. 2),2,Tree and Array,2500.0,E,1393687800,[],PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Number of Decompositions into Multipliers,500.0,A,1393428600,"[combinatorics, number theory]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Sum of Fractions,1000.0,B,1393428600,"[math, number theory]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Changing Tree,1500.0,C,1393428600,"[data structures, trees]",PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Sum of Number of Inversions in Permutations,2000.0,D,1393428600,[combinatorics],PROGRAMMING +396,Codeforces Round #232 (Div. 1),1,On Iteration of One Well-Known Function,2500.0,E,1393428600,[],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Segment's Own Points,500.0,A,1393428600,[],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Corruption and Numbers,1000.0,B,1393428600,"[implementation, math]",PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Number of Decompositions into Multipliers,1500.0,C,1393428600,"[combinatorics, number theory]",PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Sum of Fractions,2000.0,D,1393428600,[math],PROGRAMMING +397,Codeforces Round #232 (Div. 2),2,On Changing Tree,2500.0,E,1393428600,"[data structures, trees]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Counting Sticks,500.0,A,1392910200,[implementation],PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Very Beautiful Number,1000.0,B,1392910200,[],PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Dominoes,1500.0,C,1392910200,"[constructive algorithms, greedy]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Physical Education and Buns,2000.0,D,1392910200,"[brute force, implementation, math]",PROGRAMMING +394,Codeforces Round #231 (Div. 2),2,Lightbulb for Minister,2500.0,E,1392910200,[geometry],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Blocked Points,500.0,A,1392728400,[math],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Tower of Hanoi,1000.0,B,1392728400,[dp],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Yet Another Number Sequence,1500.0,C,1392728400,"[combinatorics, math, matrices]",PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Three Arrays,2000.0,D,1392728400,[data structures],PROGRAMMING +392,Codeforces Round #230 (Div. 1),1,Deleting Substrings,2500.0,E,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Nineteen,500.0,A,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Three matrices,1000.0,B,1392728400,[],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Blocked Points,1500.0,C,1392728400,[geometry],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Tower of Hanoi,2000.0,D,1392728400,[dp],PROGRAMMING +393,Codeforces Round #230 (Div. 2),2,Yet Another Number Sequence,2500.0,E,1392728400,[],PROGRAMMING +391,Rockethon 2014,12,Genetic Engineering,3.0,A,1392573600,"[implementation, two pointers]",PROGRAMMING +391,Rockethon 2014,12,Word Folding,5.0,B,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,The Tournament,4.0,C1,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,The Tournament,4.0,C2,1392573600,[greedy],PROGRAMMING +391,Rockethon 2014,12,The Tournament,8.0,C3,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Supercollider,3.0,D1,1392573600,[brute force],PROGRAMMING +391,Rockethon 2014,12,Supercollider,16.0,D2,1392573600,[data structures],PROGRAMMING +391,Rockethon 2014,12,Three Trees,11.0,E1,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Three Trees,13.0,E2,1392573600,[],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,8.0,F1,1392573600,[dp],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,15.0,F2,1392573600,[greedy],PROGRAMMING +391,Rockethon 2014,12,Stock Trading,10.0,F3,1392573600,[],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Alarm Clock,500.0,A,1392132600,[implementation],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,"Inna, Dima and Song",1000.0,B,1392132600,[implementation],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Candy Boxes,1500.0,C,1392132600,[data structures],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Sweet Matrix,2000.0,D,1392132600,[constructive algorithms],PROGRAMMING +390,Codeforces Round #229 (Div. 2),2,Inna and Large Sweet Matrix,2500.0,E,1392132600,[],PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Box Accumulation,500.0,A,1391442000,"[greedy, sortings]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Minimal path,1000.0,B,1391442000,"[bitmasks, constructive algorithms, graphs, implementation, math]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Card Game,1500.0,C,1391442000,"[games, greedy, sortings]",PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Perfect Sets,2000.0,D,1391442000,[math],PROGRAMMING +388,Codeforces Round #228 (Div. 1),1,Fox and Meteor Shower,2500.0,E,1391442000,[geometry],PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Number Game,500.0,A,1391442000,"[greedy, math]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Cross,1000.0,B,1391442000,"[greedy, implementation]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Box Accumulation,1500.0,C,1391442000,"[binary search, dp, greedy]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Minimal path,2000.0,D,1391442000,"[constructive algorithms, graphs, implementation, shortest paths]",PROGRAMMING +389,Codeforces Round #228 (Div. 2),2,Fox and Card Game,2500.0,E,1391442000,"[greedy, implementation]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Sleep,500.0,A,1391095800,[implementation],PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Round,1000.0,B,1391095800,"[brute force, greedy, two pointers]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Number,1500.0,C,1391095800,"[greedy, implementation]",PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Interesting Graph,2000.0,D,1391095800,[graph matchings],PROGRAMMING +387,Codeforces Round #227 (Div. 2),2,George and Cards,2500.0,E,1391095800,"[binary search, data structures]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Raspberry,500.0,A,1390577700,"[brute force, greedy, implementation]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Strings,1000.0,B,1390577700,"[brute force, greedy, implementation, math, strings]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Prime Numbers,1500.0,C,1390577700,"[binary search, brute force, data structures, dp, implementation, math, number theory]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear and Floodlight,2000.0,D,1390577700,"[bitmasks, dp, geometry]",PROGRAMMING +385,Codeforces Round #226 (Div. 2),2,Bear in the Field,2500.0,E,1390577700,"[math, matrices]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Milking cows,500.0,A,1390231800,"[data structures, greedy]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Volcanoes,1500.0,B,1390231800,"[binary search, implementation, sortings, two pointers]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Propagating tree,1500.0,C,1390231800,"[data structures, dfs and similar, trees]",PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Antimatter,2000.0,D,1390231800,[dp],PROGRAMMING +383,Codeforces Round #225 (Div. 1),1,Vowels,2500.0,E,1390231800,"[combinatorics, divide and conquer, dp]",PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Coder,500.0,A,1390231800,[implementation],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Multitasking,1000.0,B,1390231800,"[greedy, implementation, sortings, two pointers]",PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Milking cows,1500.0,C,1390231800,[greedy],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Volcanoes,2500.0,D,1390231800,[implementation],PROGRAMMING +384,Codeforces Round #225 (Div. 2),2,Propagating tree,2500.0,E,1390231800,"[data structures, dfs and similar, graphs, trees]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Pan Scales,500.0,A,1389972600,"[greedy, implementation]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Number Busters,2500.0,B,1389972600,"[binary search, math]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Arithmetic Progression,1500.0,C,1389972600,"[implementation, sortings]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Pawns,3000.0,D,1389972600,"[dfs and similar, graphs, implementation, trees]",PROGRAMMING +382,Codeforces Round #224 (Div. 2),2,Ksenia and Combinatorics,3000.0,E,1389972600,"[combinatorics, dp]",PROGRAMMING +386,Testing Round #9,12,Second-Price Auction,500.0,A,1389906900,[implementation],PROGRAMMING +386,Testing Round #9,12,"Fly, freebies, fly!",1000.0,B,1389906900,"[binary search, brute force, implementation]",PROGRAMMING +386,Testing Round #9,12,Diverse Substrings,1500.0,C,1389906900,"[dp, two pointers]",PROGRAMMING +386,Testing Round #9,12,Game with Points,2000.0,D,1389906900,"[dp, graphs, implementation, shortest paths]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Prefixes,500.0,A,1389540600,"[binary search, brute force]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Tree,1000.0,B,1389540600,"[graphs, implementation]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Brackets,1500.0,C,1389540600,"[data structures, schedules]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Cinema,2000.0,D,1389540600,"[combinatorics, math]",PROGRAMMING +380,Codeforces Round #223 (Div. 1),1,Sereja and Dividing,2500.0,E,1389540600,[data structures],PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Dima,500.0,A,1389540600,"[greedy, implementation, two pointers]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Stairs,1000.0,B,1389540600,"[greedy, implementation, sortings]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Prefixes,1500.0,C,1389540600,"[binary search, implementation, two pointers]",PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Tree,2000.0,D,1389540600,[brute force],PROGRAMMING +381,Codeforces Round #223 (Div. 2),2,Sereja and Brackets,2500.0,E,1389540600,[data structures],PROGRAMMING +379,Good Bye 2013,12,New Year Candles,500.0,A,1388417400,[implementation],PROGRAMMING +379,Good Bye 2013,12,New Year Present,1000.0,B,1388417400,"[constructive algorithms, implementation]",PROGRAMMING +379,Good Bye 2013,12,New Year Ratings Change,1500.0,C,1388417400,"[greedy, sortings]",PROGRAMMING +379,Good Bye 2013,12,New Year Letter,2000.0,D,1388417400,"[bitmasks, brute force, dp]",PROGRAMMING +379,Good Bye 2013,12,New Year Tree Decorations,2500.0,E,1388417400,"[geometry, schedules, sortings]",PROGRAMMING +379,Good Bye 2013,12,New Year Tree,3000.0,F,1388417400,"[data structures, divide and conquer, trees]",PROGRAMMING +379,Good Bye 2013,12,New Year Cactus,3500.0,G,1388417400,[dp],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Maze,500.0,A,1388331000,[dfs and similar],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Preparing for the Contest,1000.0,B,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Captains Mode,1000.0,C,1388331000,"[bitmasks, dp, games]",PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Developing Game,2000.0,D,1388331000,[data structures],PROGRAMMING +377,Codeforces Round #222 (Div. 1),1,Cookie Clicker,2500.0,E,1388331000,"[dp, geometry]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Playing with Dice,500.0,A,1388331000,[brute force],PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Semifinals,1000.0,B,1388331000,"[implementation, sortings]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Maze,1500.0,C,1388331000,[dfs and similar],PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Preparing for the Contest,2000.0,D,1388331000,"[binary search, data structures, greedy, sortings]",PROGRAMMING +378,Codeforces Round #222 (Div. 2),2,Captains Mode,2000.0,E,1388331000,"[bitmasks, brute force, dp, greedy]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Divisible by Seven,500.0,A,1387893600,"[math, number theory]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Maximum Submatrix 2,1000.0,B,1387893600,"[data structures, dp, implementation, sortings]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Circling Round Treasures,1500.0,C,1387893600,"[bitmasks, shortest paths]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Tree and Queries,2000.0,D,1387893600,"[data structures, dfs and similar, trees]",PROGRAMMING +375,Codeforces Round #221 (Div. 1),1,Red and Black Tree,2500.0,E,1387893600,"[dp, implementation, math]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Lever,500.0,A,1387893600,"[implementation, math]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,I.O.U.,1000.0,B,1387893600,[implementation],PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Divisible by Seven,1500.0,C,1387893600,"[math, number theory]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Maximum Submatrix 2,2000.0,D,1387893600,"[dp, implementation, sortings]",PROGRAMMING +376,Codeforces Round #221 (Div. 2),2,Circling Round Treasures,2500.0,E,1387893600,"[bitmasks, shortest paths]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Pink Pony,500.0,A,1387380600,"[greedy, implementation]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Nine,1000.0,B,1387380600,"[combinatorics, greedy]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Dima,1500.0,C,1387380600,"[dfs and similar, dp, graphs, implementation]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Sequence ,2000.0,D,1387380600,"[binary search, data structures, dp, trees]",PROGRAMMING +374,Codeforces Round #220 (Div. 2),2,Inna and Babies,2500.0,E,1387380600,"[binary search, data structures, dsu, geometry, implementation]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Counting Kangaroos is Fun,500.0,A,1386943200,"[binary search, greedy, sortings, two pointers]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Counting Rectangles is Fun,1000.0,B,1386943200,"[brute force, divide and conquer, dp]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Watching Fireworks is Fun,1500.0,C,1386943200,"[data structures, dp, math]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Choosing Subtree is Fun,2000.0,D,1386943200,"[binary search, data structures, dfs and similar, trees, two pointers]",PROGRAMMING +372,Codeforces Round #219 (Div. 1),1,Drawing Circles is Fun,2500.0,E,1386943200,"[combinatorics, geometry]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Collecting Beats is Fun,500.0,A,1386943200,[implementation],PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Making Sequences is Fun,1000.0,B,1386943200,"[binary search, implementation, math]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Counting Kangaroos is Fun,1500.0,C,1386943200,"[greedy, sortings, two pointers]",PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Counting Rectangles is Fun,2000.0,D,1386943200,[],PROGRAMMING +373,Codeforces Round #219 (Div. 2),2,Watching Fireworks is Fun,2500.0,E,1386943200,[dp],PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,K-Periodic Array,500.0,A,1386493200,"[implementation, math]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Fox Dividing Cheese,1000.0,B,1386493200,"[math, number theory]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Hamburgers,1500.0,C,1386493200,"[binary search, brute force]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Vessels,2000.0,D,1386493200,"[data structures, dsu, implementation, trees]",PROGRAMMING +371,Codeforces Round #218 (Div. 2),2,Subway Innovation,2500.0,E,1386493200,"[math, two pointers]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,"Rook, Bishop and King",500.0,A,1386399600,[math],PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Berland Bingo,500.0,B,1386399600,[implementation],PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Mittens,1500.0,C,1386399600,"[constructive algorithms, greedy, sortings]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Broken Monitor,3000.0,D,1386399600,"[brute force, constructive algorithms, implementation]",PROGRAMMING +370,Codeforces Round #217 (Div. 2),2,Summer Reading,3000.0,E,1386399600,"[dp, greedy]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Plates,500.0,A,1385739000,[implementation],PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Contest,1000.0,B,1385739000,"[constructive algorithms, implementation, math]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Elections,1500.0,C,1385739000,"[dfs and similar, graphs, trees]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Fools,2000.0,D,1385739000,"[dfs and similar, dp, shortest paths]",PROGRAMMING +369,Codeforces Round #216 (Div. 2),2,Valera and Queries,2500.0,E,1385739000,"[binary search, data structures]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Algorithm ,500.0,A,1385479800,"[data structures, implementation]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja ans Anagrams,1000.0,B,1385479800,"[binary search, data structures]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and the Arrangement of Numbers,1500.0,C,1385479800,"[graphs, greedy, sortings]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Sets,2000.0,D,1385479800,"[bitmasks, dfs and similar]",PROGRAMMING +367,Codeforces Round #215 (Div. 1),1,Sereja and Intervals,2000.0,E,1385479800,"[combinatorics, dp]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Coat Rack,500.0,A,1385479800,[implementation],PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Suffixes,1000.0,B,1385479800,"[data structures, dp]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and Algorithm ,1500.0,C,1385479800,"[brute force, implementation]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja ans Anagrams,2000.0,D,1385479800,"[data structures, two pointers]",PROGRAMMING +368,Codeforces Round #215 (Div. 2),2,Sereja and the Arrangement of Numbers,2500.0,E,1385479800,"[combinatorics, graphs, implementation]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Guards,500.0,A,1385307000,[implementation],PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and To-do List,1000.0,B,1385307000,"[brute force, implementation]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Salad,1500.0,C,1385307000,[dp],PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Trap Graph,2000.0,D,1385307000,"[binary search, data structures, dfs and similar, dsu, shortest paths, two pointers]",PROGRAMMING +366,Codeforces Round #214 (Div. 2),2,Dima and Magic Guitar,2500.0,E,1385307000,"[brute force, implementation, math]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Matrix,500.0,A,1384875000,"[combinatorics, data structures, implementation]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Free Market,1000.0,B,1384875000,"[dp, greedy]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Beautiful Set,1500.0,C,1384875000,"[brute force, number theory]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Ghd,2000.0,D,1384875000,"[brute force, math, probabilities]",PROGRAMMING +364,Codeforces Round #213 (Div. 1),1,Empty Rectangles,2500.0,E,1384875000,"[divide and conquer, two pointers]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Good Number,500.0,A,1384875000,[implementation],PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,The Fibonacci Segment,1000.0,B,1384875000,[implementation],PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Matrix,1500.0,C,1384875000,"[brute force, combinatorics, math, matrices]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Free Market,2000.0,D,1384875000,"[dp, greedy]",PROGRAMMING +365,Codeforces Round #213 (Div. 2),2,Beautiful Set,2500.0,E,1384875000,"[brute force, number theory]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Two Semiknights Meet,1000.0,A,1384443000,"[greedy, math]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Petya and Staircases,500.0,B,1384443000,"[implementation, sortings]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Insertion Sort,2500.0,C,1384443000,"[data structures, dp, implementation, math]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Fools and Foolproof Roads,3000.0,D,1384443000,"[data structures, dfs and similar, dsu, graphs, greedy]",PROGRAMMING +362,Codeforces Round #212 (Div. 2),2,Petya and Pipes,3000.0,E,1384443000,"[flows, graphs, shortest paths]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Soroban,500.0,A,1384156800,[implementation],PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Fence,1000.0,B,1384156800,"[brute force, dp]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Fixing Typos,1500.0,C,1384156800,"[greedy, implementation]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Renting Bikes,2000.0,D,1384156800,"[binary search, greedy]",PROGRAMMING +363,Codeforces Round #211 (Div. 2),2,Two Circles,2500.0,E,1384156800,"[brute force, data structures, implementation]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Array Recovery,500.0,A,1384102800,"[greedy, implementation]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Array,1000.0,B,1384102800,"[binary search, dp]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Strings,1500.0,C,1384102800,"[combinatorics, dp]",PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Sets,1500.0,D,1384102800,[number theory],PROGRAMMING +360,Codeforces Round #210 (Div. 1),1,Levko and Game,2000.0,E,1384102800,"[graphs, greedy, shortest paths]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Table,500.0,A,1384102800,"[constructive algorithms, implementation]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Permutation,1000.0,B,1384102800,"[constructive algorithms, math, number theory]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Array Recovery,1500.0,C,1384102800,"[brute force, constructive algorithms, greedy]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Array,2000.0,D,1384102800,"[binary search, dp]",PROGRAMMING +361,Codeforces Round #210 (Div. 2),2,Levko and Strings,2500.0,E,1384102800,[],PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Table,500.0,A,1383379200,"[greedy, implementation]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Permutation,1000.0,B,1383379200,"[constructive algorithms, dp, math]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Prime Number,1500.0,C,1383379200,[math],PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Pair of Numbers,2500.0,D,1383379200,"[binary search, brute force, data structures, math, two pointers]",PROGRAMMING +359,Codeforces Round #209 (Div. 2),2,Neatness,2500.0,E,1383379200,[dfs and similar],PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Continuous Line,500.0,A,1382715000,"[brute force, implementation]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Text Messages,1000.0,B,1382715000,"[brute force, strings]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Containers,1500.0,C,1382715000,"[constructive algorithms, greedy, implementation]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Hares,2000.0,D,1382715000,"[dp, greedy]",PROGRAMMING +358,Codeforces Round #208 (Div. 2),2,Dima and Kicks,3000.0,E,1382715000,"[brute force, dsu, graphs, implementation]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Knight Tournament,500.0,A,1381838400,"[data structures, dsu]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Xenia and Hamming,1000.0,B,1381838400,"[implementation, math]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Compartments,1500.0,C,1381838400,"[combinatorics, constructive algorithms, greedy, implementation]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Bags and Coins,2000.0,D,1381838400,"[bitmasks, constructive algorithms, dp, greedy]",PROGRAMMING +356,Codeforces Round #207 (Div. 1),1,Xenia and String Problem,2500.0,E,1381838400,"[dp, hashing, implementation, string suffix structures, strings]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Group of Students,500.0,A,1381838400,"[brute force, greedy, implementation]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Flag Day,1000.0,B,1381838400,"[constructive algorithms, implementation]",PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Knight Tournament,1500.0,C,1381838400,[data structures],PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Xenia and Hamming,2000.0,D,1381838400,[number theory],PROGRAMMING +357,Codeforces Round #207 (Div. 2),2,Compartments,2500.0,E,1381838400,[],PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Vasya and Robot,500.0,A,1381678200,"[brute force, greedy, math]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Game with Strings,1000.0,B,1381678200,"[bitmasks, dp, games]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Vasya and Beautiful Arrays,1500.0,C,1381678200,"[brute force, dp, number theory]",PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Transferring Pyramid,2000.0,D,1381678200,[dp],PROGRAMMING +354,Codeforces Round #206 (Div. 1),1,Lucky Number Representation,2500.0,E,1381678200,"[constructive algorithms, dfs and similar, dp]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Digital Root,500.0,A,1381678200,"[constructive algorithms, implementation]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Public Transport,1000.0,B,1381678200,"[greedy, implementation]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Robot,1500.0,C,1381678200,"[brute force, dp]",PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Game with Strings,2000.0,D,1381678200,[],PROGRAMMING +355,Codeforces Round #206 (Div. 2),2,Vasya and Beautiful Arrays,2500.0,E,1381678200,"[binary search, brute force, data structures]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Domino,500.0,A,1381419000,"[implementation, math]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Two Heaps,1500.0,B,1381419000,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Find Maximum,1000.0,C,1381419000,"[implementation, math, number theory]",PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Queue,2500.0,D,1381419000,[constructive algorithms],PROGRAMMING +353,Codeforces Round #205 (Div. 2),2,Antichain,3000.0,E,1381419000,"[dp, graph matchings, greedy]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Rounding,1000.0,A,1380900600,"[dp, greedy, implementation, math]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Furik,1000.0,B,1380900600,"[combinatorics, dp, probabilities]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Brackets,1500.0,C,1380900600,"[dp, matrices]",PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Removing Periods,2000.0,D,1380900600,[data structures],PROGRAMMING +351,Codeforces Round #204 (Div. 1),1,Jeff and Permutation,2000.0,E,1380900600,[greedy],PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Digits,500.0,A,1380900600,"[brute force, implementation, math]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Periods,1000.0,B,1380900600,"[implementation, sortings]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Rounding,1500.0,C,1380900600,"[dp, greedy, implementation]",PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Furik,2000.0,D,1380900600,[math],PROGRAMMING +352,Codeforces Round #204 (Div. 2),2,Jeff and Brackets,2500.0,E,1380900600,[],PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,TL,500.0,A,1380641400,"[brute force, greedy, implementation]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Resort,1000.0,B,1380641400,[graphs],PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Bombs,1000.0,C,1380641400,"[greedy, implementation, sortings]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Looking for Owls,3000.0,D,1380641400,"[binary search, geometry, hashing, sortings]",PROGRAMMING +350,Codeforces Round #203 (Div. 2),2,Wrong Floyd,3000.0,E,1380641400,"[brute force, constructive algorithms, dfs and similar, graphs]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Mafia,500.0,A,1380295800,"[binary search, math, sortings]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Apple Tree,1000.0,B,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Subset Sums,1500.0,C,1380295800,"[brute force, data structures]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Turtles,2000.0,D,1380295800,"[dp, matrices]",PROGRAMMING +348,Codeforces Round #202 (Div. 1),1,Pilgrims,2500.0,E,1380295800,"[dfs and similar, dp, trees]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Cinema Line,500.0,A,1380295800,"[greedy, implementation]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Color the Fence,1000.0,B,1380295800,"[data structures, dp, greedy]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Mafia,1500.0,C,1380295800,[implementation],PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Apple Tree,2000.0,D,1380295800,"[dfs and similar, number theory, trees]",PROGRAMMING +349,Codeforces Round #202 (Div. 2),2,Subset Sums,2500.0,E,1380295800,[],PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Alice and Bob,500.0,A,1379691000,"[games, math, number theory]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Lucky Common Subsequence,1000.0,B,1379691000,"[dp, strings]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Number Transformation II,1500.0,C,1379691000,"[greedy, math]",PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Robot Control,2000.0,D,1379691000,[shortest paths],PROGRAMMING +346,Codeforces Round #201 (Div. 1),1,Doodle Jump,2500.0,E,1379691000,[math],PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Difference Row,500.0,A,1379691000,"[implementation, sortings]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Fixed Points,1000.0,B,1379691000,"[implementation, math]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Alice and Bob,1500.0,C,1379691000,"[games, math, number theory]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Lucky Common Subsequence,2000.0,D,1379691000,"[dp, strings]",PROGRAMMING +347,Codeforces Round #201 (Div. 2),2,Number Transformation II,2500.0,E,1379691000,"[dp, greedy, number theory]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Rational Resistance,500.0,A,1379172600,"[math, number theory]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Alternating Current,1000.0,B,1379172600,"[data structures, greedy, implementation]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Read Time,1500.0,C,1379172600,"[binary search, greedy, two pointers]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Water Tree,2000.0,D,1379172600,"[data structures, dfs and similar, trees]",PROGRAMMING +343,Codeforces Round #200 (Div. 1),1,Pumping Stations,2500.0,E,1379172600,"[brute force, dfs and similar, divide and conquer, flows, greedy]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Magnets,500.0,A,1379172600,[implementation],PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Simple Molecules,1000.0,B,1379172600,"[brute force, math]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Rational Resistance,1500.0,C,1379172600,[math],PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Alternating Current,2000.0,D,1379172600,"[data structures, greedy, implementation]",PROGRAMMING +344,Codeforces Round #200 (Div. 2),2,Read Time,2500.0,E,1379172600,"[binary search, two pointers]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Expecting Trouble,,A,1379086800,"[*special, probabilities]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Triskaidekaphobia,,B,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Counting Fridays,,C,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Chain Letter,,D,1379086800,"[*special, dfs and similar, graphs]",PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Black Cat Rush,,E,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Superstitions Inspection,,F,1379086800,[*special],PROGRAMMING +345,"Friday the 13th, Programmers Day",12,Suffix Subgroup,,G,1379086800,"[*special, strings]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Divisors,500.0,A,1378540800,"[greedy, implementation]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Spies,1000.0,B,1378540800,"[brute force, greedy, implementation]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Cupboard and Balloons,1500.0,C,1378540800,[geometry],PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Dominoes,2000.0,D,1378540800,"[bitmasks, dfs and similar, dp]",PROGRAMMING +342,Codeforces Round #199 (Div. 2),2,Xenia and Tree,2500.0,E,1378540800,"[data structures, divide and conquer, trees]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,The Wall,500.0,A,1377876600,[math],PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Maximal Area Quadrilateral,3000.0,B,1377876600,"[brute force, geometry]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Tourist Problem,2000.0,C,1377876600,"[combinatorics, implementation, math]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Bubble Sort Graph,2000.0,D,1377876600,"[binary search, data structures, dp]",PROGRAMMING +340,Codeforces Round #198 (Div. 2),2,Iahub and Permutations,3000.0,E,1377876600,"[combinatorics, math]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Tourist Problem,500.0,A,1377876600,[math],PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Bubble Sort Graph,500.0,B,1377876600,"[binary search, data structures, dp]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Iahub and Permutations,1000.0,C,1377876600,"[combinatorics, dp, math]",PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Iahub and Xors,2500.0,D,1377876600,[data structures],PROGRAMMING +341,Codeforces Round #198 (Div. 1),1,Candies Game,3000.0,E,1377876600,"[constructive algorithms, greedy]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Helpful Maths,500.0,A,1377531000,"[greedy, implementation, sortings, strings]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Ringroad,1000.0,B,1377531000,[implementation],PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Weights,1500.0,C,1377531000,"[constructive algorithms, dfs and similar, dp, greedy]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Xenia and Bit Operations,2000.0,D,1377531000,"[data structures, trees]",PROGRAMMING +339,Codeforces Round #197 (Div. 2),2,Three Swaps,3000.0,E,1377531000,"[constructive algorithms, dfs and similar, greedy]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Puzzles,500.0,A,1376668800,"[dp, graph matchings, greedy]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Routine Problem,1000.0,B,1376668800,"[greedy, math, number theory]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Quiz,1500.0,C,1376668800,"[binary search, greedy, math, matrices, number theory]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Book of Evil,2000.0,D,1376668800,"[dfs and similar, divide and conquer, dp, trees]",PROGRAMMING +337,Codeforces Round #196 (Div. 2),2,Divisor Tree,2500.0,E,1376668800,"[brute force, number theory, trees]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Quiz,500.0,A,1376668800,"[greedy, math, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Book of Evil,1000.0,B,1376668800,"[dfs and similar, dp, trees]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Divisor Tree,1500.0,C,1376668800,"[brute force, dp, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,GCD Table,2000.0,D,1376668800,"[chinese remainder theorem, math, number theory]",PROGRAMMING +338,Codeforces Round #196 (Div. 1),1,Optimize!,2500.0,E,1376668800,[data structures],PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Triangle,500.0,A,1376062200,"[implementation, math]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Fly,1000.0,B,1376062200,[math],PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Sequence,1500.0,C,1376062200,"[brute force, greedy, implementation, number theory]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Beautiful Strings,2000.0,D,1376062200,"[combinatorics, math]",PROGRAMMING +336,Codeforces Round #195 (Div. 2),2,Vasily the Bear and Painting Square,2500.0,E,1376062200,"[bitmasks, combinatorics, dp, implementation]",PROGRAMMING +326,MemSQL start[c]up Round 2,12,Banana,500.0,A,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Palindrome,1000.0,B,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,More Reclamation,1000.0,C,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Rectangles and Square,2000.0,D,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,Counting Skyscrapers,2500.0,E,1375549200,[],PROGRAMMING +326,MemSQL start[c]up Round 2,12,"Buy One, Get One Free",3000.0,F,1375549200,[],PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Banana,500.0,A,1375549200,"[binary search, constructive algorithms, greedy]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Palindrome,1000.0,B,1375549200,"[constructive algorithms, dp]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,More Reclamation,1000.0,C,1375549200,[games],PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Rectangles and Square,2000.0,D,1375549200,"[brute force, dp]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,Counting Skyscrapers,2500.0,E,1375549200,"[dp, math, probabilities]",PROGRAMMING +335,MemSQL start[c]up Round 2 - online version,12,"Buy One, Get One Free",3000.0,F,1375549200,"[dp, greedy]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Secrets,500.0,A,1374913800,[greedy],PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Chips,1000.0,B,1374913800,[greedy],PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Lucky Tickets,1500.0,C,1374913800,"[brute force, constructive algorithms]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Characteristics of Rectangles,2000.0,D,1374913800,"[binary search, bitmasks, brute force, implementation, sortings]",PROGRAMMING +333,Codeforces Round #194 (Div. 1),1,Summer Earnings,2500.0,E,1374913800,"[binary search, bitmasks, brute force, geometry, sortings]",PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Candy Bags,500.0,A,1374913800,[implementation],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Eight Point Sets,1000.0,B,1374913800,[sortings],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Secrets,1500.0,C,1374913800,[math],PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Chips,2000.0,D,1374913800,"[greedy, implementation, two pointers]",PROGRAMMING +334,Codeforces Round #194 (Div. 2),2,Lucky Tickets,2500.0,E,1374913800,[],PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Down the Hatch!,500.0,A,1374679800,[implementation],PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Maximum Absurdity,1000.0,B,1374679800,"[data structures, dp, implementation]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Students' Revenge,3000.0,C,1374679800,"[data structures, greedy, sortings]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Theft of Blueprints,3000.0,D,1374679800,"[graphs, math]",PROGRAMMING +332,Codeforces Round #193 (Div. 2),2,Binary Key,3000.0,E,1374679800,"[dp, greedy, implementation]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Purification,500.0,A,1374327000,"[constructive algorithms, greedy]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Biridian Forest,1000.0,B,1374327000,"[dfs and similar, shortest paths]",PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Graph Reconstruction,1500.0,C,1374327000,[constructive algorithms],PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,The Evil Temple and the Moving Rocks,1500.0,D,1374327000,[constructive algorithms],PROGRAMMING +329,Codeforces Round #192 (Div. 1),1,Evil,2500.0,E,1374327000,[math],PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Cakeminator,500.0,A,1374327000,"[brute force, implementation]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Road Construction,1000.0,B,1374327000,"[constructive algorithms, graphs]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Purification,1500.0,C,1374327000,[matrices],PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Biridian Forest,2000.0,D,1374327000,"[dfs and similar, implementation, shortest paths]",PROGRAMMING +330,Codeforces Round #192 (Div. 2),2,Graph Reconstruction,2500.0,E,1374327000,[],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,30.0,A1,1374075000,"[brute force, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Oh Sweet Beaverette,70.0,A2,1374075000,"[data structures, sortings]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,30.0,B1,1374075000,[implementation],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Shave Beaver!,70.0,B2,1374075000,[data structures],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C1,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,20.0,C2,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,The Great Julya Calendar,60.0,C3,1374075000,[dp],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D1,1374075000,"[dfs and similar, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,30.0,D2,1374075000,[graphs],PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Escaping on Beaveractor,40.0,D3,1374075000,"[data structures, implementation, trees]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E1,1374075000,"[constructive algorithms, graphs, implementation]",PROGRAMMING +331,ABBYY Cup 3.0 - Finals (online version),12,Deja Vu,50.0,E2,1374075000,"[constructive algorithms, dp]",PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,30.0,A1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Oh Sweet Beaverette,70.0,A2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,30.0,B1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Shave Beaver!,70.0,B2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,20.0,C2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,The Great Julya Calendar,60.0,C3,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,30.0,D2,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Escaping on Beaveractor,40.0,D3,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E1,1374043200,[],PROGRAMMING +324,ABBYY Cup 3.0 - Finals,12,Deja Vu,50.0,E2,1374043200,[],PROGRAMMING +325,MemSQL start[c]up Round 1,12,Square and Rectangles,500.0,A,1373734800,[implementation],PROGRAMMING +325,MemSQL start[c]up Round 1,12,Stadium and Games,1000.0,B,1373734800,"[binary search, math]",PROGRAMMING +325,MemSQL start[c]up Round 1,12,Monsters and Diamonds,2000.0,C,1373734800,"[dfs and similar, shortest paths]",PROGRAMMING +325,MemSQL start[c]up Round 1,12,Reclamation,2000.0,D,1373734800,[dsu],PROGRAMMING +325,MemSQL start[c]up Round 1,12,The Red Button,2500.0,E,1373734800,"[combinatorics, dfs and similar, dsu, greedy]",PROGRAMMING +328,Testing Round #8,12,IQ Test,500.0,A,1373662800,[implementation],PROGRAMMING +328,Testing Round #8,12,Sheldon and Ice Pieces,500.0,B,1373662800,[greedy],PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Flipping Game,500.0,A,1372941000,"[brute force, dp, implementation]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Hungry Sequence,500.0,B,1372941000,[math],PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Magic Five,1500.0,C,1372941000,"[combinatorics, math]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Block Tower,2000.0,D,1372941000,"[constructive algorithms, dfs and similar, graphs]",PROGRAMMING +327,Codeforces Round #191 (Div. 2),2,Axis Walking,3000.0,E,1372941000,"[bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Robot,500.0,A,1372433400,"[binary search, implementation, math]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Duel,1000.0,B,1372433400,"[dp, flows, greedy]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel the Commander,1500.0,C,1372433400,"[constructive algorithms, dfs and similar, divide and conquer, greedy, trees]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Flipboard,2000.0,D,1372433400,"[dp, greedy, math]",PROGRAMMING +321,Codeforces Round #190 (Div. 1),1,Ciel and Gondolas,2500.0,E,1372433400,"[data structures, divide and conquer, dp]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Dancing,500.0,A,1372433400,[greedy],PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Flowers,1000.0,B,1372433400,"[combinatorics, math]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Robot,1500.0,C,1372433400,"[implementation, math, number theory]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel and Duel,2000.0,D,1372433400,"[dp, flows, greedy, two pointers]",PROGRAMMING +322,Codeforces Round #190 (Div. 2),2,Ciel the Commander,2500.0,E,1372433400,[divide and conquer],PROGRAMMING +323,Testing Round #7,12,Black-and-White Cube,500.0,A,1372363200,"[combinatorics, constructive algorithms]",PROGRAMMING +323,Testing Round #7,12,Tournament-graph,1000.0,B,1372363200,[constructive algorithms],PROGRAMMING +323,Testing Round #7,12,Two permutations,1500.0,C,1372363200,[data structures],PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Malek Dance Club,500.0,A,1371992400,"[combinatorics, math]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Psychos in a Line,1000.0,B,1371992400,"[data structures, implementation]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Kalila and Dimna in the Logging Industry,1500.0,C,1371992400,"[dp, geometry]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Have You Ever Heard About the Word?,2500.0,D,1371992400,"[greedy, hashing, string suffix structures, strings]",PROGRAMMING +319,Codeforces Round #189 (Div. 1),1,Ping-Pong,2500.0,E,1371992400,[data structures],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Magic Numbers,500.0,A,1371992400,"[brute force, greedy]",PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Ping-Pong (Easy Version),1000.0,B,1371992400,"[dfs and similar, graphs]",PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Malek Dance Club,1500.0,C,1371992400,[math],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Psychos in a Line,2000.0,D,1371992400,[data structures],PROGRAMMING +320,Codeforces Round #189 (Div. 2),2,Kalila and Dimna in the Logging Industry,2500.0,E,1371992400,[dp],PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Perfect Pair,500.0,A,1371223800,[brute force],PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Ants,1000.0,B,1371223800,"[brute force, implementation]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Balance,2500.0,C,1371223800,"[constructive algorithms, dfs and similar, graphs, trees]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Game with Powers,1500.0,D,1371223800,"[dp, games]",PROGRAMMING +317,Codeforces Round #188 (Div. 1),1,Princess and Her Shadow,3000.0,E,1371223800,"[constructive algorithms, shortest paths]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Even Odds,500.0,A,1371223800,[math],PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Strings of Power,500.0,B,1371223800,"[implementation, strings, two pointers]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Perfect Pair,1000.0,C,1371223800,"[greedy, math]",PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Ants,2500.0,D,1371223800,[dfs and similar],PROGRAMMING +318,Codeforces Round #188 (Div. 2),2,Balance,3000.0,E,1371223800,"[constructive algorithms, dfs and similar]",PROGRAMMING +316,ABBYY Cup 3.0,12,Special Task,30.0,A1,1371042000,[greedy],PROGRAMMING +316,ABBYY Cup 3.0,12,Special Task,70.0,A2,1371042000,[math],PROGRAMMING +316,ABBYY Cup 3.0,12,EKG,30.0,B1,1371042000,"[brute force, dfs and similar]",PROGRAMMING +316,ABBYY Cup 3.0,12,EKG,70.0,B2,1371042000,"[dfs and similar, dp]",PROGRAMMING +316,ABBYY Cup 3.0,12,Tidying Up,30.0,C1,1371042000,[flows],PROGRAMMING +316,ABBYY Cup 3.0,12,Tidying Up,70.0,C2,1371042000,"[flows, graph matchings]",PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,30.0,D1,1371042000,"[brute force, dp]",PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,40.0,D2,1371042000,[dp],PROGRAMMING +316,ABBYY Cup 3.0,12,PE Lesson,30.0,D3,1371042000,"[dp, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,30.0,E1,1371042000,"[brute force, data structures]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,40.0,E2,1371042000,"[data structures, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Summer Homework,30.0,E3,1371042000,"[data structures, math]",PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F1,1371042000,"[dfs and similar, implementation]",PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,40.0,F2,1371042000,[],PROGRAMMING +316,ABBYY Cup 3.0,12,Suns and Rays,30.0,F3,1371042000,"[constructive algorithms, dfs and similar, implementation]",PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,30.0,G1,1371042000,"[hashing, strings]",PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,40.0,G2,1371042000,[string suffix structures],PROGRAMMING +316,ABBYY Cup 3.0,12,Good Substrings,30.0,G3,1371042000,[string suffix structures],PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Contest,500.0,A,1370619000,[implementation],PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Periods,1000.0,B,1370619000,"[binary search, dfs and similar, strings]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Subsequences,1500.0,C,1370619000,"[data structures, dp]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Straight Lines,2000.0,D,1370619000,"[binary search, data structures, geometry, sortings, two pointers]",PROGRAMMING +314,Codeforces Round #187 (Div. 1),1,Sereja and Squares,2500.0,E,1370619000,[dp],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Bottles,500.0,A,1370619000,[brute force],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Array,1000.0,B,1370619000,[implementation],PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Contest,1500.0,C,1370619000,"[dp, greedy, implementation]",PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Periods,2000.0,D,1370619000,"[dfs and similar, strings]",PROGRAMMING +315,Codeforces Round #187 (Div. 2),2,Sereja and Subsequences,2500.0,E,1370619000,"[combinatorics, data structures]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Bank Account,500.0,A,1369927800,"[implementation, number theory]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Queries,1000.0,B,1369927800,"[dp, implementation]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Matrix,1500.0,C,1369927800,"[constructive algorithms, greedy, implementation, sortings]",PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Roads,2500.0,D,1369927800,[dp],PROGRAMMING +313,Codeforces Round #186 (Div. 2),2,Ilya and Two Numbers,2500.0,E,1369927800,"[constructive algorithms, data structures, dsu, greedy]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,The Closest Pair,500.0,A,1369582200,"[constructive algorithms, implementation]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Cats Transport,1000.0,B,1369582200,"[data structures, dp]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Fetch the Treasure,1500.0,C,1369582200,"[brute force, data structures, shortest paths]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Interval Cubing,2000.0,D,1369582200,"[data structures, math]",PROGRAMMING +311,Codeforces Round #185 (Div. 1),1,Biologist,2500.0,E,1369582200,[flows],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Whose sentence is it?,500.0,A,1369582200,[implementation],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Archer,1000.0,B,1369582200,"[math, probabilities]",PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,The Closest Pair,1500.0,C,1369582200,[constructive algorithms],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Cats Transport,2000.0,D,1369582200,[],PROGRAMMING +312,Codeforces Round #185 (Div. 2),2,Fetch the Treasure,2500.0,E,1369582200,[],PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Strange Addition,500.0,A,1368968400,"[brute force, constructive algorithms]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Continued Fractions,1000.0,B,1368968400,"[brute force, math]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Ivan and Powers of Two,1500.0,C,1368968400,[],PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Olya and Graph,2000.0,D,1368968400,"[combinatorics, math]",PROGRAMMING +305,Codeforces Round #184 (Div. 2),2,Playing with String,2500.0,E,1368968400,[games],PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Morning run,500.0,A,1368803400,"[binary search, math, two pointers]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Context Advertising,500.0,B,1368803400,[two pointers],PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Memory for Arrays,1000.0,C,1368803400,"[binary search, bitmasks, greedy]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Tennis Rackets,2000.0,D,1368803400,"[brute force, geometry]",PROGRAMMING +309,"Croc Champ 2013 - Finals (online version, Div. 1)",1,Sheep,2500.0,E,1368803400,"[binary search, greedy]",PROGRAMMING +308,Croc Champ 2013 - Finals,12,Morning run,500.0,A,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Context Advertising,500.0,B,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Memory for Arrays,1000.0,C,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Tennis Rackets,2000.0,D,1368784800,[],PROGRAMMING +308,Croc Champ 2013 - Finals,12,Sheep,2500.0,E,1368784800,[],PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Lucky Permutation Triple,500.0,A,1368363600,"[constructive algorithms, implementation, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Rectangle Puzzle II,500.0,B,1368363600,"[implementation, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Minimum Modular,2000.0,C,1368363600,"[brute force, math]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Rotatable Number,2500.0,D,1368363600,"[math, number theory]",PROGRAMMING +303,Codeforces Round #183 (Div. 1),1,Random Ranking,3000.0,E,1368363600,[dp],PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Pythagorean Theorem II,500.0,A,1368363600,"[brute force, math]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Calendar,1000.0,B,1368363600,"[brute force, implementation]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Lucky Permutation Triple,1000.0,C,1368363600,[constructive algorithms],PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Rectangle Puzzle II,2000.0,D,1368363600,"[math, ternary search]",PROGRAMMING +304,Codeforces Round #183 (Div. 2),2,Minimum Modular,3000.0,E,1368363600,[math],PROGRAMMING +306,Testing Round #6,12,Candies,500.0,A,1368302400,[implementation],PROGRAMMING +306,Testing Round #6,12,Optimizer,1000.0,B,1368302400,"[data structures, greedy, sortings]",PROGRAMMING +306,Testing Round #6,12,"White, Black and White Again",1500.0,C,1368302400,"[combinatorics, number theory]",PROGRAMMING +306,Testing Round #6,12,Polygon,2000.0,D,1368302400,"[constructive algorithms, geometry]",PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Sequence,500.0,A,1367769900,[constructive algorithms],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Time,1000.0,B,1367769900,"[binary search, graphs, shortest paths]",PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Algorithm,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Divisors,2000.0,D,1367769900,[data structures],PROGRAMMING +301,Codeforces Round #182 (Div. 1),1,Yaroslav and Arrangements,2500.0,E,1367769900,[dp],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Eugeny and Array,500.0,A,1367769900,[implementation],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Eugeny and Play List,1000.0,B,1367769900,"[binary search, implementation, two pointers]",PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Sequence,1500.0,C,1367769900,[constructive algorithms],PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Time,2000.0,D,1367769900,"[binary search, dfs and similar, dp, shortest paths]",PROGRAMMING +302,Codeforces Round #182 (Div. 2),2,Yaroslav and Algorithm,2500.0,E,1367769900,[],PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Array,500.0,A,1366903800,"[brute force, constructive algorithms, implementation]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Coach,1000.0,B,1366903800,"[brute force, dfs and similar]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Beautiful Numbers,2000.0,C,1366903800,"[brute force, combinatorics]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Painting Square,3000.0,D,1366903800,"[dp, fft]",PROGRAMMING +300,Codeforces Round #181 (Div. 2),2,Empire Strikes Back,3000.0,E,1366903800,"[binary search, math]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Weird Game,500.0,A,1366644900,"[games, greedy]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Distinct Paths,1500.0,B,1366644900,"[brute force, combinatorics]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Cube Problem,1500.0,C,1366644900,"[brute force, math, number theory]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Ksusha and Square,2000.0,D,1366644900,"[geometry, math, probabilities, two pointers]",PROGRAMMING +293,Croc Champ 2013 - Round 2,12,Close Vertices,2500.0,E,1366644900,"[data structures, divide and conquer, trees]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha and Array,500.0,A,1366644600,"[brute force, number theory, sortings]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Ksusha the Squirrel,1000.0,B,1366644600,"[brute force, implementation]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Weird Game,1500.0,C,1366644600,"[games, greedy]",PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Distinct Paths,2500.0,D,1366644600,[],PROGRAMMING +299,Croc Champ 2013 - Round 2 (Div. 2 Edition),2,Cube Problem,2500.0,E,1366644600,[],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Parity Game,500.0,A,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Fish Weight,500.0,B,1366385400,"[constructive algorithms, greedy]",PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Splitting the Uniqueness,2000.0,C,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Color the Carpet,2500.0,D,1366385400,[constructive algorithms],PROGRAMMING +297,Codeforces Round #180 (Div. 1),1,Mystic Carvings,3000.0,E,1366385400,[data structures],PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Snow Footprints,500.0,A,1366385400,"[greedy, implementation]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Sail,500.0,B,1366385400,"[brute force, greedy, implementation]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Parity Game,1500.0,C,1366385400,"[combinatorics, constructive algorithms, math, number theory]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Fish Weight,1500.0,D,1366385400,"[greedy, math, sortings]",PROGRAMMING +298,Codeforces Round #180 (Div. 2),2,Splitting the Uniqueness,3000.0,E,1366385400,"[constructive algorithms, sortings]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,SMSC,1000.0,A,1366040100,[implementation],PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Network Topology,1000.0,B,1366040100,"[graphs, implementation]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Beautiful IP Addresses,1500.0,C,1366040100,[brute force],PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Connected Components,2000.0,D,1366040100,"[data structures, dfs and similar, dp, dsu]",PROGRAMMING +292,Croc Champ 2013 - Round 1,12,Copying Data,2500.0,E,1366040100,[data structures],PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Spyke Talks,500.0,A,1365796800,"[implementation, sortings]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Command Line Arguments,1000.0,B,1365796800,"[implementation, strings]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Network Mask,1500.0,C,1365796800,"[brute force, implementation]",PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Parallel Programming,2000.0,D,1365796800,[greedy],PROGRAMMING +291,Croc Champ 2013 - Qualification Round,12,Tree-String Problem,2500.0,E,1365796800,"[dfs and similar, hashing, strings]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Array,500.0,A,1365694200,"[data structures, implementation]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Graph,1000.0,B,1365694200,"[dp, graphs, shortest paths]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Friends,1500.0,C,1365694200,"[combinatorics, dp, graphs, shortest paths]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Greg and Caves,2000.0,D,1365694200,"[combinatorics, dp]",PROGRAMMING +295,Codeforces Round #179 (Div. 1),1,Yaroslav and Points,2500.0,E,1365694200,[data structures],PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Yaroslav and Permutations,500.0,A,1365694200,"[greedy, math]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Yaroslav and Two Strings,1500.0,B,1365694200,"[combinatorics, dp]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Array,1500.0,C,1365694200,"[data structures, dp, implementation]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Graph,2000.0,D,1365694200,"[dp, graphs]",PROGRAMMING +296,Codeforces Round #179 (Div. 2),2,Greg and Friends,2500.0,E,1365694200,"[combinatorics, dfs and similar, dp]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Oskols,500.0,A,1365348600,"[implementation, math]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Bookshelf,1000.0,B,1365348600,"[dp, greedy]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Lights,1500.0,C,1365348600,"[combinatorics, number theory]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass and Painter Robot,2000.0,D,1365348600,"[brute force, implementation, number theory]",PROGRAMMING +294,Codeforces Round #178 (Div. 2),2,Shaass the Great,2500.0,E,1365348600,"[dp, trees]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Strings,500.0,A,1364916600,[greedy],PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Houses ,1000.0,B,1364916600,[combinatorics],PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and XOR operation,1500.0,C,1364916600,"[implementation, math]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Trees ,2000.0,D,1364916600,"[combinatorics, dfs and similar, trees]",PROGRAMMING +288,Codeforces Round #177 (Div. 1),1,Polo the Penguin and Lucky Numbers,2500.0,E,1364916600,"[dp, implementation, math]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Segments ,500.0,A,1364916600,"[brute force, implementation]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Matrix,1000.0,B,1364916600,"[brute force, dp, implementation, sortings, ternary search]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Strings,1500.0,C,1364916600,"[constructive algorithms, implementation]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and Houses ,2000.0,D,1364916600,"[brute force, combinatorics, dfs and similar, math]",PROGRAMMING +289,Codeforces Round #177 (Div. 2),2,Polo the Penguin and XOR operation,2500.0,E,1364916600,"[data structures, greedy, implementation, math]",PROGRAMMING +290,April Fools Day Contest 2013,12,Mysterious strings,,A,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,QR code,,B,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,WTF?,,C,1364830200,"[*special, graph matchings, implementation, trees]",PROGRAMMING +290,April Fools Day Contest 2013,12,Orange,,D,1364830200,"[*special, implementation]",PROGRAMMING +290,April Fools Day Contest 2013,12,HQ,,E,1364830200,"[*special, constructive algorithms]",PROGRAMMING +290,April Fools Day Contest 2013,12,Greedy Petya,,F,1364830200,"[*special, dfs and similar, graphs, greedy]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Lucky Permutation,500.0,A,1364025600,"[constructive algorithms, math]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Shifting,1500.0,B,1364025600,[implementation],PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Main Sequence,1500.0,C,1364025600,"[greedy, implementation]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Tourists,2000.0,D,1364025600,"[data structures, sortings]",PROGRAMMING +286,Codeforces Round #176 (Div. 1),1,Ladies' Shop,2500.0,E,1364025600,"[constructive algorithms, fft, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,IQ Test,500.0,A,1364025600,"[brute force, implementation]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Pipeline,1500.0,B,1364025600,"[binary search, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Lucky Permutation,1500.0,C,1364025600,"[constructive algorithms, greedy, implementation, math]",PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Shifting,2500.0,D,1364025600,[],PROGRAMMING +287,Codeforces Round #176 (Div. 2),2,Main Sequence,2500.0,E,1364025600,"[data structures, greedy]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Slightly Decreasing Permutations,500.0,A,1363879800,"[greedy, implementation]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Find Marble,1000.0,B,1363879800,[implementation],PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Building Permutation,1500.0,C,1363879800,"[greedy, implementation, sortings]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Permutation Sum,2000.0,D,1363879800,"[bitmasks, combinatorics, dp, implementation, meet-in-the-middle]",PROGRAMMING +285,Codeforces Round #175 (Div. 2),2,Positions in Permutations,2500.0,E,1363879800,"[combinatorics, dp, math]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cows and Sequence,1000.0,A,1363534200,"[constructive algorithms, implementation]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cow Program,1000.0,B,1363534200,"[dfs and similar, dp, graphs]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Coin Troubles,1500.0,C,1363534200,[dp],PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cows and Cool Sequences,2000.0,D,1363534200,"[dp, math, number theory]",PROGRAMMING +283,Codeforces Round #174 (Div. 1),1,Cow Tennis Tournament,2500.0,E,1363534200,"[combinatorics, data structures, math]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Primitive Roots,500.0,A,1363534200,"[implementation, math, number theory]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Poker Game,1000.0,B,1363534200,"[brute force, implementation]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cows and Sequence,2000.0,C,1363534200,"[constructive algorithms, data structures, dp]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Cow Program,2000.0,D,1363534200,"[dfs and similar, dp]",PROGRAMMING +284,Codeforces Round #174 (Div. 2),2,Coin Troubles,2500.0,E,1363534200,"[dfs and similar, dp]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Bit++,500.0,A,1363188600,[implementation],PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Painting Eggs,1000.0,B,1363188600,"[greedy, math]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,XOR and OR,1500.0,C,1363188600,"[constructive algorithms, implementation, math]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Yet Another Number Game,2000.0,D,1363188600,"[dp, games]",PROGRAMMING +282,Codeforces Round #173 (Div. 2),2,Sausage Maximization,2500.0,E,1363188600,"[bitmasks, data structures, trees]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Rectangle Puzzle,500.0,A,1362929400,[geometry],PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Maximum Xor Secondary,1000.0,B,1362929400,"[data structures, implementation, two pointers]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Game on Tree,1500.0,C,1362929400,"[implementation, math, probabilities, trees]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,k-Maximum Subsequence Sum,2000.0,D,1362929400,"[data structures, flows]",PROGRAMMING +280,Codeforces Round #172 (Div. 1),1,Sequence Transformation,2500.0,E,1362929400,"[data structures, dp, implementation, math]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Word Capitalization,500.0,A,1362929400,[strings],PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Nearest Fraction,1000.0,B,1362929400,"[brute force, implementation, two pointers]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Rectangle Puzzle,1500.0,C,1362929400,"[geometry, implementation]",PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Maximum Xor Secondary,2000.0,D,1362929400,[two pointers],PROGRAMMING +281,Codeforces Round #172 (Div. 2),2,Game on Tree,2500.0,E,1362929400,[math],PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Point on Spiral,500.0,A,1362411000,"[brute force, geometry, implementation]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Books,1000.0,B,1362411000,"[binary search, brute force, implementation, two pointers]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Ladder,1500.0,C,1362411000,"[dp, implementation, two pointers]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,The Minimum Number of Variables,2000.0,D,1362411000,"[bitmasks, dp]",PROGRAMMING +279,Codeforces Round #171 (Div. 2),2,Beautiful Decomposition,2000.0,E,1362411000,"[games, greedy]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Learning Languages,500.0,A,1362065400,"[dfs and similar, dsu]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Set of Points,1500.0,B,1362065400,"[constructive algorithms, geometry]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Game,2000.0,C,1362065400,"[games, implementation]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Google Code Jam,3000.0,D,1362065400,"[dp, probabilities]",PROGRAMMING +277,Codeforces Round #170 (Div. 1),1,Binary Tree on Plane,2000.0,E,1362065400,[flows],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Circle Line,500.0,A,1362065400,[implementation],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,New Problem,1000.0,B,1362065400,"[brute force, strings]",PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Learning Languages,1000.0,C,1362065400,[dsu],PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Set of Points,3000.0,D,1362065400,"[constructive algorithms, geometry]",PROGRAMMING +278,Codeforces Round #170 (Div. 2),2,Game,3000.0,E,1362065400,[games],PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Lunch Rush,500.0,A,1361719800,[implementation],PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Game,1000.0,B,1361719800,"[games, greedy]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum Sum,1500.0,C,1361719800,"[data structures, implementation, sortings]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Maximum XOR,2000.0,D,1361719800,"[bitmasks, dp, greedy, implementation, math]",PROGRAMMING +276,Codeforces Round #169 (Div. 2),2,Little Girl and Problem on Trees,2500.0,E,1361719800,"[data structures, trees]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,k-Multiple Free Set,500.0,A,1361374200,"[binary search, greedy, sortings]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Zero Tree,1000.0,B,1361374200,"[dfs and similar, dp, greedy, trees]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,The Last Hole!,1500.0,C,1361374200,"[brute force, geometry]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Lovely Matrix,2000.0,D,1361374200,"[dfs and similar, graphs, greedy, sortings]",PROGRAMMING +274,Codeforces Round #168 (Div. 1),1,Mirror Room,2000.0,E,1361374200,"[data structures, implementation]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Lights Out,500.0,A,1361374200,[implementation],PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Convex Shape,1000.0,B,1361374200,"[constructive algorithms, implementation]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,k-Multiple Free Set,1500.0,C,1361374200,"[binary search, greedy, sortings]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,Zero Tree,2000.0,D,1361374200,"[dfs and similar, dp, trees]",PROGRAMMING +275,Codeforces Round #168 (Div. 2),2,The Last Hole!,2500.0,E,1361374200,[],PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Friends,500.0,A,1360769400,"[implementation, math]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Sequence,1000.0,B,1360769400,"[implementation, math]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Staircase,1500.0,C,1360769400,"[data structures, implementation]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Two Sequences,2000.0,D,1360769400,"[combinatorics, math, sortings]",PROGRAMMING +272,Codeforces Round #167 (Div. 2),2,Dima and Horses,2500.0,E,1360769400,"[combinatorics, constructive algorithms, graphs]",PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Staircase,500.0,A,1360769400,[],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Two Sequences,1000.0,B,1360769400,[combinatorics],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Horses,1500.0,C,1360769400,"[graphs, greedy]",PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Figure,2000.0,D,1360769400,[dp],PROGRAMMING +273,Codeforces Round #167 (Div. 1),1,Dima and Game,2500.0,E,1360769400,"[dp, games]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Beautiful Year,500.0,A,1360596600,[brute force],PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Prime Matrix,1000.0,B,1360596600,"[binary search, brute force, math, number theory]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Secret,1500.0,C,1360596600,"[constructive algorithms, implementation]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Good Substrings,2000.0,D,1360596600,"[data structures, strings]",PROGRAMMING +271,Codeforces Round #166 (Div. 2),2,Three Horses,3000.0,E,1360596600,"[constructive algorithms, math, number theory]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Magical Boxes,500.0,A,1359732600,"[greedy, math]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Greenhouse Effect,1000.0,B,1359732600,[dp],PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Flawed Flow,1500.0,C,1359732600,"[constructive algorithms, flows, graphs]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,Maximum Waterfall,2000.0,D,1359732600,"[data structures, dp]",PROGRAMMING +269,Codeforces Round #165 (Div. 1),1,String Theory,2500.0,E,1359732600,[],PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Fancy Fence,500.0,A,1359732600,"[geometry, implementation, math]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Multithreading,1500.0,B,1359732600,"[data structures, greedy, implementation]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Magical Boxes,1500.0,C,1359732600,"[binary search, greedy, implementation, math, sortings]",PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Greenhouse Effect,2000.0,D,1359732600,[dp],PROGRAMMING +270,Codeforces Round #165 (Div. 2),2,Flawed Flow,2500.0,E,1359732600,"[dfs and similar, sortings]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Games,500.0,A,1359387000,[brute force],PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Buttons,1000.0,B,1359387000,"[implementation, math]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Beautiful Sets of Points,1500.0,C,1359387000,"[constructive algorithms, implementation]",PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Wall Bars,2500.0,D,1359387000,[dp],PROGRAMMING +268,Codeforces Round #164 (Div. 2),2,Playlist,2500.0,E,1359387000,"[math, probabilities, sortings]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Stones on the Table,500.0,A,1358868600,[implementation],PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Queue at the School,500.0,B,1358868600,"[constructive algorithms, graph matchings, implementation, shortest paths]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,Below the Diagonal,2500.0,C,1358868600,"[constructive algorithms, greedy, math]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,BerDonalds,3000.0,D,1358868600,"[graphs, math, shortest paths]",PROGRAMMING +266,Codeforces Round #163 (Div. 2),2,More Queries to Array...,3000.0,E,1358868600,"[data structures, math]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Escape from Stones,500.0,A,1358686800,"[constructive algorithms, data structures, implementation, two pointers]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Good Sequences,1000.0,B,1358686800,"[dp, number theory]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Choosing Balls,1500.0,C,1358686800,[dp],PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Colorful Stones,2000.0,D,1358686800,"[dp, two pointers]",PROGRAMMING +264,Codeforces Round #162 (Div. 1),1,Roadside Trees,2500.0,E,1358686800,"[data structures, dp]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Colorful Stones (Simplified Edition),500.0,A,1358686800,[implementation],PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Roadside Trees (Simplified Edition),1000.0,B,1358686800,"[greedy, implementation]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Escape from Stones,1500.0,C,1358686800,"[greedy, implementation]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Good Sequences,2000.0,D,1358686800,"[dp, number theory]",PROGRAMMING +265,Codeforces Round #162 (Div. 2),2,Choosing Balls,2500.0,E,1358686800,"[schedules, sortings]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Beautiful Matrix,500.0,A,1358350200,[implementation],PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Squares,500.0,B,1358350200,"[greedy, implementation, sortings]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Circle of Numbers,2500.0,C,1358350200,"[dfs and similar, implementation]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Cycle in Graph,2000.0,D,1358350200,"[dfs and similar, graphs]",PROGRAMMING +263,Codeforces Round #161 (Div. 2),2,Rhombus,3000.0,E,1358350200,"[brute force, data structures, dp]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Discounts,500.0,A,1358091000,"[greedy, sortings]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Restaurant,1000.0,B,1358091000,"[dp, math, probabilities]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Matrix,1500.0,C,1358091000,"[constructive algorithms, dp, math]",PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Increasing Subsequence,2000.0,D,1358091000,[dp],PROGRAMMING +261,Codeforces Round #160 (Div. 1),1,Maxim and Calculator,2500.0,E,1358091000,"[brute force, dp, two pointers]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Roma and Lucky Numbers,500.0,A,1358091000,[implementation],PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Roma and Changing Signs,1000.0,B,1358091000,[greedy],PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Discounts,1500.0,C,1358091000,"[greedy, sortings]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Restaurant,2000.0,D,1358091000,"[combinatorics, dp]",PROGRAMMING +262,Codeforces Round #160 (Div. 2),2,Maxim and Matrix,2500.0,E,1358091000,[dp],PROGRAMMING +267,Codeforces Testing Round #5,12,Subtractions,500.0,A,1358002800,"[math, number theory]",PROGRAMMING +267,Codeforces Testing Round #5,12,Dominoes,1000.0,B,1358002800,"[dfs and similar, graphs]",PROGRAMMING +267,Codeforces Testing Round #5,12,Berland Traffic,1500.0,C,1358002800,"[math, matrices]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Sockets,500.0,A,1357659000,"[greedy, implementation, sortings]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Playing Cubes,500.0,B,1357659000,"[games, greedy, implementation]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,View Angle,1500.0,C,1357659000,"[brute force, geometry, math]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Sum,2000.0,D,1357659000,"[greedy, math]",PROGRAMMING +257,Codeforces Round #159 (Div. 2),2,Greedy Elevator,3000.0,E,1357659000,"[data structures, implementation]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Adding Digits,500.0,A,1356622500,"[implementation, math]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Ancient Prophesy,1000.0,B,1356622500,"[brute force, implementation, strings]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Balls and Boxes,1500.0,C,1356622500,"[greedy, implementation]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Black and White Tree,2000.0,D,1356622500,"[constructive algorithms, dsu, graphs, greedy, trees]",PROGRAMMING +260,Codeforces Round #158 (Div. 2),2,Dividing Kingdom,2500.0,E,1356622500,"[binary search, brute force, data structures]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Bits,500.0,A,1356190200,"[greedy, math]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Elections,1000.0,B,1356190200,"[brute force, combinatorics, dp]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and LCM,1500.0,C,1356190200,"[binary search, combinatorics, dp, math]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Broken Sorting,2000.0,D,1356190200,"[dp, math, probabilities]",PROGRAMMING +258,Codeforces Round #157 (Div. 1),1,Little Elephant and Tree,2500.0,E,1356190200,"[data structures, dfs and similar, trees]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Chess,500.0,A,1356190200,"[brute force, strings]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Magic Square,1000.0,B,1356190200,"[brute force, implementation]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Bits,1500.0,C,1356190200,"[greedy, strings]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and Elections,2000.0,D,1356190200,"[brute force, combinatorics, dp, math]",PROGRAMMING +259,Codeforces Round #157 (Div. 2),2,Little Elephant and LCM,2500.0,E,1356190200,"[binary search, combinatorics, math]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Almost Arithmetical Progression,500.0,A,1355671800,"[binary search, dp, two pointers]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Mr. Bender and Square,1000.0,B,1355671800,"[binary search, brute force, math]",PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Furlo and Rublo and Game,1500.0,C,1355671800,[games],PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Liars and Serge,2000.0,D,1355671800,[dp],PROGRAMMING +256,Codeforces Round #156 (Div. 1),1,Lucky Arrays,2500.0,E,1355671800,[data structures],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Greg's Workout,500.0,A,1355671800,[implementation],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Code Parsing,1000.0,B,1355671800,[implementation],PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Almost Arithmetical Progression,1500.0,C,1355671800,"[brute force, dp]",PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Mr. Bender and Square,2000.0,D,1355671800,"[binary search, implementation, math]",PROGRAMMING +255,Codeforces Round #156 (Div. 2),2,Furlo and Rublo and Game,2500.0,E,1355671800,"[games, implementation, math]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Cards with Numbers,500.0,A,1355047200,"[constructive algorithms, sortings]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Jury Size,1000.0,B,1355047200,"[brute force, implementation]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Anagram,1500.0,C,1355047200,[greedy],PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Rats,2000.0,D,1355047200,"[brute force, dfs and similar, implementation]",PROGRAMMING +254,Codeforces Round #155 (Div. 2),2,Dormitory,2500.0,E,1355047200,"[dp, implementation]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Boys and Girls,500.0,A,1354960800,[greedy],PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Physics Practical,1000.0,B,1354960800,"[binary search, dp, two pointers]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Text Editor,1500.0,C,1354960800,"[data structures, dfs and similar, greedy, shortest paths]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Table with Letters - 2,2000.0,D,1354960800,"[brute force, two pointers]",PROGRAMMING +253,Codeforces Round #154 (Div. 2),2,Printer,2500.0,E,1354960800,"[binary search, data structures, implementation, sortings]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Points on Line,500.0,A,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Playing with Permutations,1000.0,B,1354807800,"[implementation, math]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Number Transformation,1500.0,C,1354807800,"[dp, greedy, number theory]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Two Sets,2000.0,D,1354807800,"[bitmasks, math]",PROGRAMMING +251,Codeforces Round #153 (Div. 1),1,Tree and Table,2500.0,E,1354807800,"[dfs and similar, dp, implementation, trees]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Little Xor,500.0,A,1354807800,"[brute force, implementation]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Unsorting Array,1000.0,B,1354807800,"[brute force, sortings]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Points on Line,1500.0,C,1354807800,"[binary search, combinatorics, two pointers]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Playing with Permutations,2000.0,D,1354807800,"[brute force, combinatorics, implementation]",PROGRAMMING +252,Codeforces Round #153 (Div. 2),2,Number Transformation,2500.0,E,1354807800,"[dp, number theory]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Paper Work,500.0,A,1353938400,[greedy],PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Restoring IPv6,1000.0,B,1353938400,"[implementation, strings]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Movie Critics,1500.0,C,1353938400,[greedy],PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Building Bridge,1500.0,D,1353938400,"[geometry, ternary search, two pointers]",PROGRAMMING +250,"CROC-MBTU 2012, Final Round (Online version, Div. 2)",2,Mad Joe,2000.0,E,1353938400,[brute force],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Paper Work,500.0,A,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Restoring IPv6,1000.0,B,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Movie Critics,1500.0,C,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Building Bridge,1500.0,D,1353927300,[],PROGRAMMING +247,"CROC-MBTU 2012, Final Round",12,Mad Joe,2000.0,E,1353927300,[],PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Cupboards,500.0,A,1353857400,[implementation],PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Chilly Willy,1000.0,B,1353857400,"[math, number theory]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Robo-Footballer,2000.0,C,1353857400,"[binary search, geometry]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Sweets for Everyone!,2000.0,D,1353857400,"[binary search, greedy, implementation]",PROGRAMMING +248,Codeforces Round #152 (Div. 2),2,Piglet's Birthday,2500.0,E,1353857400,"[dp, probabilities]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Robo-Footballer,1000.0,A,1353857400,[geometry],PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Sweets for Everyone!,1000.0,B,1353857400,"[binary search, greedy]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Piglet's Birthday,1500.0,C,1353857400,"[dp, probabilities]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Donkey and Stars,1500.0,D,1353857400,"[data structures, dp, math, sortings]",PROGRAMMING +249,Codeforces Round #152 (Div. 1),1,Endless Matrix,2500.0,E,1353857400,[math],PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Buggy Sorting,500.0,A,1353511800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Increase and Decrease,1000.0,B,1353511800,"[greedy, math]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Beauty Pageant,1500.0,C,1353511800,"[brute force, constructive algorithms, greedy]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Colorful Graph,2000.0,D,1353511800,"[brute force, dfs and similar, graphs]",PROGRAMMING +246,Codeforces Round #151 (Div. 2),2,Blood Cousins Return,2500.0,E,1353511800,"[binary search, data structures, dfs and similar, dp, sortings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,System Administrator,,A,1353339000,[implementation],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Internet Address,,B,1353339000,"[implementation, strings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Game with Coins,,C,1353339000,[greedy],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Restoring Table,,D,1353339000,"[constructive algorithms, greedy]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Mishap in Club,,E,1353339000,[implementation],PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Log Stream Analysis,,F,1353339000,"[binary search, brute force, implementation, strings]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Suggested Friends,,G,1353339000,"[brute force, graphs]",PROGRAMMING +245,"CROC-MBTU 2012, Elimination Round (ACM-ICPC)",12,Queries for Number of Palindromes,,H,1353339000,"[dp, hashing, strings]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,The Brand New Function,500.0,A,1353079800,[bitmasks],PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Hydra,1000.0,B,1353079800,"[graphs, sortings]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Colorado Potato Beetle,1500.0,C,1353079800,"[dfs and similar, implementation]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Cubes,2000.0,D,1353079800,"[data structures, dp, geometry, two pointers]",PROGRAMMING +243,Codeforces Round #150 (Div. 1),1,Matrix,2500.0,E,1353079800,[data structures],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Dividing Orange,500.0,A,1353079800,[implementation],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Undoubtedly Lucky Numbers,1000.0,B,1353079800,"[bitmasks, brute force, dfs and similar]",PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,The Brand New Function,1500.0,C,1353079800,"[bitmasks, divide and conquer, math]",PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Hydra,2000.0,D,1353079800,[],PROGRAMMING +244,Codeforces Round #150 (Div. 2),2,Colorado Potato Beetle,2500.0,E,1353079800,[],PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Heads or Tails,500.0,A,1352647800,"[brute force, implementation]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Big Segment,1000.0,B,1352647800,"[implementation, sortings]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,King's Path,1500.0,C,1352647800,"[dfs and similar, hashing, shortest paths]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,Dispute,2000.0,D,1352647800,"[dfs and similar, greedy]",PROGRAMMING +242,Codeforces Round #149 (Div. 2),2,XOR on Segment,2500.0,E,1352647800,"[bitmasks, data structures]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Not Wool Sequences,500.0,A,1352044800,"[constructive algorithms, math]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Boring Partition,1000.0,B,1352044800,[constructive algorithms],PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,World Eater Brothers,1500.0,C,1352044800,"[dfs and similar, dp, greedy, trees]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Tape Programming,2000.0,D,1352044800,"[data structures, implementation]",PROGRAMMING +238,Codeforces Round #148 (Div. 1),1,Meeting Her,2500.0,E,1352044800,"[dp, graphs, shortest paths]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Two Bags of Potatoes,500.0,A,1352044800,"[greedy, implementation, math]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Easy Tape Programming,1000.0,B,1352044800,"[brute force, implementation]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Not Wool Sequences,1500.0,C,1352044800,"[combinatorics, constructive algorithms, math]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,Boring Partition,2000.0,D,1352044800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +239,Codeforces Round #148 (Div. 2),2,World Eater Brothers,2500.0,E,1352044800,[],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Old Peykan,,A,1351783800,[greedy],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Friends,,B,1351783800,"[binary search, bitmasks, data structures, math]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Mirror Box,,C,1351783800,"[geometry, implementation]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Numbers,,D,1351783800,[],PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Flights,,E,1351783800,"[graphs, shortest paths]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Race,,F,1351783800,"[brute force, implementation]",PROGRAMMING +241,"Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)",12,Challenging Balloons,,G,1351783800,[constructive algorithms],PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Free Cash,500.0,A,1351179000,[implementation],PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Young Table,1000.0,B,1351179000,"[implementation, sortings]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Primes on Interval,1500.0,C,1351179000,"[binary search, number theory, two pointers]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,T-decomposition,2000.0,D,1351179000,"[dfs and similar, graphs, greedy]",PROGRAMMING +237,Codeforces Round #147 (Div. 2),2,Build String,2500.0,E,1351179000,"[flows, graphs]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,LCM Challenge,500.0,A,1350803400,[number theory],PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Let's Play Osu!,1000.0,B,1350803400,"[dp, math, probabilities]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Cyclical Quest,1500.0,C,1350803400,"[string suffix structures, strings]",PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Graph Game,2000.0,D,1350803400,[graphs],PROGRAMMING +235,Codeforces Round #146 (Div. 1),1,Number Challenge,2500.0,E,1350803400,"[combinatorics, dp, implementation, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Boy or Girl,500.0,A,1350803400,[implementation],PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Easy Number Challenge,1000.0,B,1350803400,"[implementation, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,LCM Challenge,1500.0,C,1350803400,"[greedy, number theory]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Let's Play Osu!,2000.0,D,1350803400,"[dp, probabilities]",PROGRAMMING +236,Codeforces Round #146 (Div. 2),2,Cyclical Quest,2500.0,E,1350803400,[],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Lefthanders and Righthanders ,,A,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Reading,,B,1350370800,[sortings],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Weather,,C,1350370800,"[dp, implementation]",PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Cinema,,D,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Champions' League,,E,1350370800,[implementation],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Fence,,F,1350370800,[dp],PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Practice,,G,1350370800,"[constructive algorithms, divide and conquer, implementation]",PROGRAMMING +234,"Codeforces Round #145 (Div. 2, ACM-ICPC Rules)",2,Merging Two Decks,,H,1350370800,"[constructive algorithms, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Cinema,,A,1350370800,[implementation],PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Fence,,B,1350370800,[dp],PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Practice,,C,1350370800,"[constructive algorithms, implementation]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Merging Two Decks,,D,1350370800,"[constructive algorithms, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,Road Repairs,,E,1350370800,"[dfs and similar, graphs, greedy]",PROGRAMMING +240,"Codeforces Round #145 (Div. 1, ACM-ICPC Rules)",1,TorCoder,,F,1350370800,[data structures],PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Cycles,500.0,A,1349969400,"[binary search, constructive algorithms, graphs, greedy]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Table,1000.0,B,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Doe Graphs,1500.0,C,1349969400,"[constructive algorithms, divide and conquer, dp, graphs, shortest paths]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Fence,2000.0,D,1349969400,"[binary search, data structures, string suffix structures]",PROGRAMMING +232,Codeforces Round #144 (Div. 1),1,Quick Tortoise,2500.0,E,1349969400,"[bitmasks, divide and conquer, dp]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Perfect Permutation,500.0,A,1349969400,"[implementation, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Non-square Equation,1000.0,B,1349969400,"[binary search, brute force, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Cycles,1500.0,C,1349969400,"[combinatorics, graphs, matrices]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Table,2000.0,D,1349969400,"[bitmasks, combinatorics, dp, math]",PROGRAMMING +233,Codeforces Round #144 (Div. 2),2,Doe Graphs,2500.0,E,1349969400,[],PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Team,500.0,A,1349623800,"[brute force, greedy]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,"Magic, Wizardry and Wonders",1000.0,B,1349623800,"[constructive algorithms, greedy]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,To Add or Not to Add,1500.0,C,1349623800,"[binary search, sortings, two pointers]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Magic Box,2000.0,D,1349623800,"[brute force, geometry]",PROGRAMMING +231,Codeforces Round #143 (Div. 2),2,Cactus,2500.0,E,1349623800,"[data structures, dfs and similar, dp, graphs, trees]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Shifts,500.0,A,1349105400,"[brute force, two pointers]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Planets,500.0,B,1349105400,"[binary search, data structures, shortest paths]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Triangles,1000.0,C,1349105400,"[combinatorics, graphs, math]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Towers,1000.0,D,1349105400,"[dp, greedy, two pointers]",PROGRAMMING +229,Codeforces Round #142 (Div. 1),1,Gifts,3000.0,E,1349105400,"[combinatorics, dp, probabilities]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Dragons,500.0,A,1349105400,"[greedy, sortings]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,T-primes,500.0,B,1349105400,"[implementation, math, number theory]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Shifts,1500.0,C,1349105400,"[binary search, data structures, dp, implementation]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Planets,2500.0,D,1349105400,"[binary search, graphs, shortest paths]",PROGRAMMING +230,Codeforces Round #142 (Div. 2),2,Triangles,3000.0,E,1349105400,"[combinatorics, graphs, math]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Is your horseshoe on the other hoof?,500.0,A,1348759800,[implementation],PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Two Tables,1000.0,B,1348759800,"[brute force, implementation]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Fractal Detector,1500.0,C,1348759800,"[dp, hashing]",PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,Zigzag,2000.0,D,1348759800,[data structures],PROGRAMMING +228,Codeforces Round #141 (Div. 2),2,The Road to Berland is Paved With Good Intentions,2500.0,E,1348759800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Flying Saucer Segments,500.0,A,1348500600,[math],PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Naughty Stone Piles,1000.0,B,1348500600,[greedy],PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Anniversary,1500.0,C,1348500600,"[data structures, implementation, math, matrices, number theory]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,The table,2000.0,D,1348500600,"[constructive algorithms, greedy]",PROGRAMMING +226,Codeforces Round #140 (Div. 1),1,Noble Knight's Path,2500.0,E,1348500600,"[data structures, trees]",PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Where do I Turn?,500.0,A,1348500600,[geometry],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Effective Approach,1000.0,B,1348500600,[implementation],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Flying Saucer Segments,1500.0,C,1348500600,[math],PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Naughty Stone Piles,2000.0,D,1348500600,"[math, sortings]",PROGRAMMING +227,Codeforces Round #140 (Div. 2),2,Anniversary,2500.0,E,1348500600,"[matrices, number theory]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Dice Tower,500.0,A,1348069500,"[constructive algorithms, greedy]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Well-known Numbers,1000.0,B,1348069500,"[binary search, greedy, number theory]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Barcode,1500.0,C,1348069500,"[dp, matrices]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Snake,3000.0,D,1348069500,"[bitmasks, dfs and similar, graphs, implementation]",PROGRAMMING +225,Codeforces Round #139 (Div. 2),2,Unsolvable,3000.0,E,1348069500,"[math, number theory]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Bracket Sequence,500.0,A,1347809400,"[data structures, expression parsing, implementation]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Two Strings,1000.0,B,1347809400,"[data structures, dp, strings]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Partial Sums,1500.0,C,1347809400,"[combinatorics, math]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Spider,2000.0,D,1347809400,"[geometry, graphs]",PROGRAMMING +223,Codeforces Round #138 (Div. 1),1,Planar Graph,2500.0,E,1347809400,"[flows, geometry, graphs]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Parallelepiped,500.0,A,1347809400,"[brute force, math]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Array,1000.0,B,1347809400,"[bitmasks, implementation, two pointers]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Bracket Sequence,1500.0,C,1347809400,[data structures],PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Two Strings,2000.0,D,1347809400,"[data structures, strings]",PROGRAMMING +224,Codeforces Round #138 (Div. 2),2,Partial Sums,2500.0,E,1347809400,"[combinatorics, math]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Shooshuns and Sequence ,500.0,A,1347291900,"[brute force, implementation]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Cosmic Tables,1000.0,B,1347291900,[implementation],PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Reducing Fractions,1500.0,C,1347291900,"[implementation, number theory, sortings]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Olympiad,2000.0,D,1347291900,"[binary search, greedy, sortings, two pointers]",PROGRAMMING +222,Codeforces Round #137 (Div. 2),2,Decoding Genome,2500.0,E,1347291900,[matrices],PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Problem,500.0,A,1346427000,"[implementation, sortings]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Array,1000.0,B,1346427000,"[constructive algorithms, data structures]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Shifts,1500.0,C,1346427000,[data structures],PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Triangle,2000.0,D,1346427000,"[chinese remainder theorem, geometry, math]",PROGRAMMING +220,Codeforces Round #136 (Div. 1),1,Little Elephant and Inversions,2500.0,E,1346427000,"[data structures, two pointers]",PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Function,500.0,A,1346427000,"[implementation, math]",PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Numbers,1000.0,B,1346427000,[implementation],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Problem,1500.0,C,1346427000,[sortings],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Array,2000.0,D,1346427000,[data structures],PROGRAMMING +221,Codeforces Round #136 (Div. 2),2,Little Elephant and Shifts,2500.0,E,1346427000,[],PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,k-String,500.0,A,1346081400,"[implementation, strings]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Special Offer! Super Price 999 Bourles!,1000.0,B,1346081400,[implementation],PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Color Stripe,1500.0,C,1346081400,"[brute force, dp, greedy]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Choosing Capital for Treeland,2000.0,D,1346081400,"[dfs and similar, dp, trees]",PROGRAMMING +219,Codeforces Round #135 (Div. 2),2,Parking Lot,3000.0,E,1346081400,[data structures],PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Ice Skating,500.0,A,1345273500,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Blackboard Fibonacci,1000.0,B,1345273500,"[brute force, math]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Formurosa,2500.0,C,1345273500,"[divide and conquer, dp, expression parsing]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Bitonix' Patrol,3000.0,D,1345273500,"[bitmasks, brute force, combinatorics, dfs and similar, math]",PROGRAMMING +217,Codeforces Round #134 (Div. 1),1,Alien DNA,3000.0,E,1345273500,"[data structures, dsu, trees]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Mountain Scenery,500.0,A,1345273500,"[brute force, constructive algorithms, implementation]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Airport,500.0,B,1345273500,[implementation],PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Ice Skating,1000.0,C,1345273500,"[dfs and similar, dsu, graphs]",PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Blackboard Fibonacci,3000.0,D,1345273500,[implementation],PROGRAMMING +218,Codeforces Round #134 (Div. 2),2,Formurosa,3000.0,E,1345273500,[],PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Tiling with Hexagons,500.0,A,1344958200,"[implementation, math]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Forming Teams,1500.0,B,1344958200,"[dfs and similar, implementation]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Hiring Staff,2000.0,C,1344958200,[greedy],PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Spider's Web,2000.0,D,1344958200,"[binary search, sortings, two pointers]",PROGRAMMING +216,Codeforces Round #133 (Div. 2),2,Martian Luck,3000.0,E,1344958200,"[math, number theory]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Bicycle Chain,500.0,A,1344267000,"[brute force, implementation]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Olympic Medal,500.0,B,1344267000,"[greedy, math]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Crosses,3000.0,C,1344267000,"[brute force, implementation]",PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Hot Days,2000.0,D,1344267000,[greedy],PROGRAMMING +215,Codeforces Round #132 (Div. 2),2,Periodical Numbers,3000.0,E,1344267000,"[combinatorics, dp, number theory]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Game,1000.0,A,1343662200,"[dfs and similar, greedy]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Numbers,1000.0,B,1343662200,"[combinatorics, dp]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Relay Race,1500.0,C,1343662200,[dp],PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Stars,2000.0,D,1343662200,"[constructive algorithms, geometry]",PROGRAMMING +213,Codeforces Round #131 (Div. 1),1,Two Permutations,2500.0,E,1343662200,"[data structures, hashing, strings]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,System of Equations,500.0,A,1343662200,[brute force],PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Hometask,1000.0,B,1343662200,"[brute force, constructive algorithms, greedy, math]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Game,2000.0,C,1343662200,"[brute force, greedy]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Numbers,2000.0,D,1343662200,"[combinatorics, dp, math]",PROGRAMMING +214,Codeforces Round #131 (Div. 2),2,Relay Race,2500.0,E,1343662200,[dp],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Dubstep,500.0,A,1343057400,[strings],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Solitaire,2000.0,B,1343057400,"[dfs and similar, dp]",PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Police Station,2500.0,C,1343057400,"[dp, graphs, shortest paths]",PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,"Prizes, Prizes, more Prizes",500.0,D,1343057400,[implementation],PROGRAMMING +208,Codeforces Round #130 (Div. 2),2,Blood Cousins,3000.0,E,1343057400,"[binary search, data structures, dfs and similar, trees]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Privatization,3000.0,A,1342450800,"[flows, graphs]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Polycarpus is Looking for Good Substrings,2000.0,B,1342450800,"[bitmasks, hashing, implementation]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Cowboys,1500.0,C,1342450800,"[dp, math]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,Cutting a Fence,2500.0,D,1342450800,"[binary search, data structures, dsu]",PROGRAMMING +212,VK Cup 2012 Finals (unofficial online-version),12,IT Restaurants,500.0,E,1342450800,"[dfs and similar, dp, trees]",PROGRAMMING +211,VK Cup 2012 Finals,12,Privatization,3000.0,A,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Polycarpus is Looking for Good Substrings,1000.0,B,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Cowboys,500.0,C,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,Cutting a Fence,1000.0,D,1342335600,[],PROGRAMMING +211,VK Cup 2012 Finals,12,IT Restaurants,500.0,E,1342335600,[],PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Multicolored Marbles,500.0,A,1342252500,"[dp, math]",PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Pixels,500.0,B,1342252500,"[constructive algorithms, math]",PROGRAMMING +209,"VK Cup 2012 Finals, Practice Session",12,Trails and Glades,1000.0,C,1342252500,"[constructive algorithms, dsu, graphs, greedy]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Interval,500.0,A,1342020600,"[binary search, combinatorics, dp]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Cards,500.0,B,1342020600,"[binary search, data structures]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Furik and Rubik,1500.0,C,1342020600,"[math, probabilities]",PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Retro Strings,2000.0,D,1342020600,[dp],PROGRAMMING +204,Codeforces Round #129 (Div. 1),1,Little Elephant and Strings,2500.0,E,1342020600,"[data structures, implementation, string suffix structures, two pointers]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Rozdil,500.0,A,1342020600,"[brute force, implementation]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Sorting,1000.0,B,1342020600,"[brute force, greedy]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Interval,1500.0,C,1342020600,"[binary search, brute force, combinatorics, dp, math]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Cards,1500.0,D,1342020600,"[binary search, brute force, sortings]",PROGRAMMING +205,Codeforces Round #129 (Div. 2),2,Little Elephant and Furik and Rubik,2500.0,E,1342020600,"[brute force, combinatorics, probabilities]",PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,20.0,A1,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,30.0,A2,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Beaver's Calculator 1.0,50.0,A3,1341730800,[greedy],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,20.0,B1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,30.0,B2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Military Trainings,50.0,B3,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,20.0,C1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,30.0,C2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,Game with Two Trees,50.0,C3,1341730800,[data structures],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D1,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D10,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D2,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D3,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D4,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D5,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D6,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D7,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D8,1341730800,[],PROGRAMMING +207,Abbyy Cup 2.0 - Final (unofficial),12,The Beaver's Problem - 3,10.0,D9,1341730800,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,20.0,A1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,30.0,A2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Beaver's Calculator 1.0,50.0,A3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,20.0,B1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,30.0,B2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Military Trainings,50.0,B3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,20.0,C1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,30.0,C2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,Game with Two Trees,50.0,C3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D1,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D10,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D2,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D3,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D4,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D5,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D6,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D7,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D8,1341576900,[],PROGRAMMING +206,Abbyy Cup 2.0 - Final,12,The Beaver's Problem - 3,10.0,D9,1341576900,[],PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Two Problems,500.0,A,1341329400,"[brute force, implementation]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Game on Paper,1000.0,B,1341329400,"[brute force, implementation]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Photographer,1500.0,C,1341329400,"[greedy, sortings]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Hit Ball,2000.0,D,1341329400,"[geometry, implementation, math]",PROGRAMMING +203,Codeforces Round #128 (Div. 2),2,Transportation,2500.0,E,1341329400,"[greedy, sortings, two pointers]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Clear Symmetry,1000.0,A,1340983800,"[constructive algorithms, dp, math]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Guess That Car!,1000.0,B,1340983800,"[math, ternary search]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Fragile Bridges,1500.0,C,1340983800,[dp],PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Brand New Problem,2000.0,D,1340983800,"[bitmasks, brute force, dp]",PROGRAMMING +201,Codeforces Round #127 (Div. 1),1,Thoroughly Bureaucratic Organization,2500.0,E,1340983800,"[binary search, combinatorics]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,LLPS,500.0,A,1340983800,"[binary search, bitmasks, brute force, greedy, implementation, strings]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Brand New Easy Problem,1000.0,B,1340983800,[brute force],PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Clear Symmetry,2000.0,C,1340983800,"[binary search, math]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Guess That Car!,2000.0,D,1340983800,"[dp, math]",PROGRAMMING +202,Codeforces Round #127 (Div. 2),2,Fragile Bridges,2500.0,E,1340983800,"[data structures, dp]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Cinema,3000.0,A,1340551800,"[brute force, data structures]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Drinks,500.0,B,1340551800,"[implementation, math]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Football Championship,2000.0,C,1340551800,"[brute force, implementation]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Programming Language,1500.0,D,1340551800,"[binary search, brute force, expression parsing, implementation]",PROGRAMMING +200,Codeforces Round #126 (Div. 2),2,Tractor College,3000.0,E,1340551800,"[implementation, math, number theory, ternary search]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,About Bacteria,500.0,A,1340379000,"[implementation, math]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Jumping on Walls,1000.0,B,1340379000,[shortest paths],PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Delivering Carcinogen,1500.0,C,1340379000,"[binary search, geometry]",PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Cube Snake,2000.0,D,1340379000,[constructive algorithms],PROGRAMMING +198,Codeforces Round #125 (Div. 1),1,Gripping Story,2500.0,E,1340379000,"[binary search, data structures, sortings]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Hexadecimal's theorem,500.0,A,1340379000,"[brute force, constructive algorithms, implementation, number theory]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Special Olympics,1000.0,B,1340379000,[geometry],PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,About Bacteria,1500.0,C,1340379000,[math],PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Jumping on Walls,2000.0,D,1340379000,"[dfs and similar, shortest paths]",PROGRAMMING +199,Codeforces Round #125 (Div. 2),2,Delivering Carcinogen,2500.0,E,1340379000,"[binary search, geometry]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Lexicographically Maximum Subsequence,500.0,A,1339506000,[greedy],PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Infinite Maze,1000.0,B,1339506000,[dfs and similar],PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Paint Tree,1500.0,C,1339506000,"[divide and conquer, geometry, sortings, trees]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,The Next Good String,3000.0,D,1339506000,"[data structures, greedy, hashing, strings]",PROGRAMMING +196,Codeforces Round #124 (Div. 1),1,Opening Portals,2500.0,E,1339506000,"[dsu, graphs, shortest paths]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Plate Game,1000.0,A,1339506000,"[constructive algorithms, games, math]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Limit,500.0,B,1339506000,[math],PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Lexicographically Maximum Subsequence,500.0,C,1339506000,"[greedy, implementation, sortings]",PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Infinite Maze,3000.0,D,1339506000,[hashing],PROGRAMMING +197,Codeforces Round #124 (Div. 2),2,Paint Tree,3000.0,E,1339506000,"[constructive algorithms, dfs and similar, geometry]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Let's Watch Football,500.0,A,1339342200,"[binary search, brute force, math]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,After Training,1000.0,B,1339342200,"[data structures, implementation, math]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Try and Catch,1500.0,C,1339342200,"[expression parsing, implementation]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Analyzing Polyline,2000.0,D,1339342200,"[math, sortings]",PROGRAMMING +195,Codeforces Round #123 (Div. 2),2,Building Forest,2500.0,E,1339342200,"[data structures, dsu]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Cutting Figure,500.0,A,1338737400,"[2-sat, chinese remainder theorem, trees]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Xor,1000.0,B,1338737400,[brute force],PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Hamming Distance,2000.0,C,1338737400,"[constructive algorithms, greedy, math, matrices]",PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Two Segments,2000.0,D,1338737400,[data structures],PROGRAMMING +193,Codeforces Round #122 (Div. 1),1,Fibonacci Number,2500.0,E,1338737400,"[brute force, math, matrices]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Exams,500.0,A,1338737400,"[implementation, math]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Square,1000.0,B,1338737400,[math],PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Cutting Figure,1500.0,C,1338737400,"[dfs and similar, graphs, implementation, matrices, strings]",PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Xor,2000.0,D,1338737400,[],PROGRAMMING +194,Codeforces Round #122 (Div. 2),2,Hamming Distance,3000.0,E,1338737400,[math],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Dynasty Puzzles,500.0,A,1338132600,[dp],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Demonstration,1000.0,B,1338132600,[greedy],PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Fools and Roads,1500.0,C,1338132600,"[data structures, dfs and similar, trees]",PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Metro Scheme,2000.0,D,1338132600,"[graphs, greedy]",PROGRAMMING +191,Codeforces Round #121 (Div. 1),1,Thwarting Demonstrations,2500.0,E,1338132600,"[binary search, data structures, trees]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Funky Numbers,500.0,A,1338132600,"[binary search, brute force, implementation]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Walking in the Rain,1000.0,B,1338132600,"[brute force, implementation]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Dynasty Puzzles,1500.0,C,1338132600,[dp],PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Demonstration,2000.0,D,1338132600,"[brute force, constructive algorithms]",PROGRAMMING +192,Codeforces Round #121 (Div. 2),2,Fools and Roads,2500.0,E,1338132600,"[data structures, trees]",PROGRAMMING +188,Surprise Language Round #6,12,Hexagonal Numbers,,A,1337959800,[*special],PROGRAMMING +188,Surprise Language Round #6,12,A + Reverse B,,B,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,LCM,,C,1337959800,"[*special, implementation, math]",PROGRAMMING +188,Surprise Language Round #6,12,Asterisks,,D,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,HQ9+,,E,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Binary Notation,,F,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Array Sorting,,G,1337959800,"[*special, implementation]",PROGRAMMING +188,Surprise Language Round #6,12,Stack,,H,1337959800,"[*special, expression parsing, implementation]",PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Vasya and the Bus,500.0,A,1337182200,"[greedy, math]",PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Surrounded,1000.0,B,1337182200,[geometry],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,STL,1500.0,C,1337182200,[dfs and similar],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Non-Secret Cypher,2000.0,D,1337182200,[two pointers],PROGRAMMING +190,Codeforces Round #120 (Div. 2),2,Counter Attack,2500.0,E,1337182200,"[data structures, dsu, graphs, hashing, sortings]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Permutations,500.0,A,1336663800,[greedy],PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,AlgoRace,1000.0,B,1336663800,"[dp, shortest paths]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Weak Memory,1500.0,C,1336663800,"[dfs and similar, dsu]",PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,BRT Contract ,2000.0,D,1336663800,[data structures],PROGRAMMING +187,Codeforces Round #119 (Div. 1),1,Heaven Tour,2500.0,E,1336663800,"[data structures, greedy]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Cut Ribbon,500.0,A,1336663800,"[brute force, dp]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Counting Rhombi,1000.0,B,1336663800,"[brute force, math]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Permutations,1500.0,C,1336663800,"[greedy, implementation]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,AlgoRace,2000.0,D,1336663800,"[dp, shortest paths]",PROGRAMMING +189,Codeforces Round #119 (Div. 2),2,Weak Memory,2500.0,E,1336663800,"[binary search, shortest paths]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Plant,500.0,A,1336145400,[math],PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Mushroom Scientists,1000.0,B,1336145400,"[math, ternary search]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Clever Fat Rat,1500.0,C,1336145400,[dp],PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Visit of the Great,2000.0,D,1336145400,"[math, number theory]",PROGRAMMING +185,Codeforces Round #118 (Div. 1),1,Soap Time! - 2,2500.0,E,1336145400,"[binary search, data structures]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Comparing Strings,500.0,A,1336145400,"[implementation, strings]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Growing Mushrooms,1000.0,B,1336145400,"[greedy, sortings]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Plant,1500.0,C,1336145400,"[dp, math, matrices, number theory]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Mushroom Scientists,2000.0,D,1336145400,"[math, number theory, probabilities]",PROGRAMMING +186,Codeforces Round #118 (Div. 2),2,Clever Fat Rat,2500.0,E,1336145400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,20.0,A1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,30.0,A2,1335614400,[greedy],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Educational Game,50.0,A3,1335614400,[greedy],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,20.0,B1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,30.0,B2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Greedy Merchants,50.0,B3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,20.0,C1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,30.0,C2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Smart Beaver and Resolving Collisions,50.0,C3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,20.0,D1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,30.0,D2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Magic Squares,50.0,D3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,20.0,E1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,30.0,E2,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,The Beaver's Problem - 2,50.0,E3,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,20.0,F1,1335614400,[],PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,30.0,F2,1335614400,"[dp, sortings, strings]",PROGRAMMING +178,ABBYY Cup 2.0 - Hard,12,Representative Sampling,50.0,F3,1335614400,[],PROGRAMMING +183,Croc Champ 2012 - Final,12,Headquarters,500.0,A,1335532800,"[constructive algorithms, math]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Zoo,1000.0,B,1335532800,"[brute force, geometry]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Cyclic Coloring,1500.0,C,1335532800,[dfs and similar],PROGRAMMING +183,Croc Champ 2012 - Final,12,T-shirt,2000.0,D,1335532800,"[dp, greedy, probabilities]",PROGRAMMING +183,Croc Champ 2012 - Final,12,Candy Shop,2500.0,E,1335532800,[greedy],PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Battlefield,3000.0,A,1335280200,"[geometry, graphs, implementation, shortest paths]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Vasya's Calendar,500.0,B,1335280200,[implementation],PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Optimal Sum,3000.0,C,1335280200,"[data structures, greedy]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Common Divisors,1000.0,D,1335280200,"[brute force, hashing, implementation, math, strings]",PROGRAMMING +182,Codeforces Round #117 (Div. 2),2,Wooden Fence,1500.0,E,1335280200,[dp],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Defragmentation,,A,1335078000,[implementation],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Divisibility Rules,,B,1335078000,"[math, number theory]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Letter,,C,1335078000,[dp],PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Name,,D,1335078000,"[greedy, strings]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Cubes,,E,1335078000,"[binary search, dp, two pointers]",PROGRAMMING +180,"Codeforces Round #116 (Div. 2, ACM-ICPC Rules)",2,Mathematical Analysis Rocks!,,F,1335078000,"[constructive algorithms, implementation, math]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,30.0,A1,1335016800,[implementation],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Good Matrix Elements,70.0,A2,1335016800,[implementation],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,30.0,B1,1335016800,[number theory],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Rectangular Game,70.0,B2,1335016800,[number theory],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Party,30.0,C1,1335016800,"[dfs and similar, dsu, graphs]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Party,70.0,C2,1335016800,"[brute force, dfs and similar, dsu, graphs]",PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,30.0,D1,1335016800,[brute force],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Encrypting Messages,70.0,D2,1335016800,[data structures],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Space Voyage,30.0,E1,1335016800,[binary search],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Space Voyage,70.0,E2,1335016800,[binary search],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Script Generation,30.0,F1,1335016800,[],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Script Generation,70.0,F2,1335016800,[],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,30.0,G1,1335016800,[strings],PROGRAMMING +177,ABBYY Cup 2.0 - Easy,12,Fibonacci Strings,70.0,G2,1335016800,"[matrices, strings]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Trading Business,500.0,A,1334934300,"[greedy, sortings]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Word Cut,1000.0,B,1334934300,[dp],PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Playing with Superglue,1500.0,C,1334934300,"[combinatorics, constructive algorithms]",PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Hyper String,2000.0,D,1334934300,[dp],PROGRAMMING +176,Croc Champ 2012 - Round 2,12,Archaeology,2500.0,E,1334934300,"[data structures, dfs and similar, trees]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Series of Crimes,500.0,A,1334934300,"[brute force, geometry, implementation]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Number of Triplets,1000.0,B,1334934300,"[binary search, brute force]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Trading Business,1500.0,C,1334934300,"[games, graph matchings, greedy]",PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Word Cut,2000.0,D,1334934300,[dp],PROGRAMMING +181,Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition),2,Playing with Superglue,2500.0,E,1334934300,[games],PROGRAMMING +175,Codeforces Round #115,12,Robot Bicorn Attack,500.0,A,1334390400,"[brute force, implementation]",PROGRAMMING +175,Codeforces Round #115,12,Plane of Tanks: Pro,500.0,B,1334390400,[implementation],PROGRAMMING +175,Codeforces Round #115,12,Geometry Horse,1000.0,C,1334390400,"[greedy, implementation, sortings]",PROGRAMMING +175,Codeforces Round #115,12,Plane of Tanks: Duel,2500.0,D,1334390400,"[brute force, dp, math, probabilities]",PROGRAMMING +175,Codeforces Round #115,12,Power Defence,3000.0,E,1334390400,"[brute force, dp, geometry, greedy]",PROGRAMMING +175,Codeforces Round #115,12,Gnomes of Might and Magic,3000.0,F,1334390400,"[data structures, graphs, implementation, shortest paths]",PROGRAMMING +164,VK Cup 2012 Round 3,12,"Variable, or There and Back Again",500.0,A,1333897500,"[dfs and similar, graphs]",PROGRAMMING +164,VK Cup 2012 Round 3,12,Ancient Berland Hieroglyphs,1000.0,B,1333897500,[two pointers],PROGRAMMING +164,VK Cup 2012 Round 3,12,Machine Programming,1500.0,C,1333897500,[flows],PROGRAMMING +164,VK Cup 2012 Round 3,12,Minimum Diameter,2500.0,D,1333897500,"[binary search, brute force]",PROGRAMMING +164,VK Cup 2012 Round 3,12,Polycarpus and Tasks,2500.0,E,1333897500,[],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Problem About Equation,500.0,A,1333897500,[math],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,File List,1000.0,B,1333897500,"[dp, greedy, implementation]",PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Range Increments,1500.0,C,1333897500,"[data structures, greedy]",PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,"Variable, or There and Back Again",2500.0,D,1333897500,[graphs],PROGRAMMING +174,VK Cup 2012 Round 3 (Unofficial Div. 2 Edition),2,Ancient Berland Hieroglyphs,3000.0,E,1333897500,[],PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Rock-Paper-Scissors,500.0,A,1333724400,"[implementation, math]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Chamber of Secrets,1000.0,B,1333724400,"[dfs and similar, shortest paths]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Spiral Maximum,1500.0,C,1333724400,"[brute force, dp]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Deputies,2000.0,D,1333724400,"[constructive algorithms, graphs, greedy, implementation]",PROGRAMMING +173,Croc Champ 2012 - Round 1,12,Camping Groups,2500.0,E,1333724400,"[data structures, sortings]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Phone Code,1000.0,A,1333440000,"[brute force, implementation]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Pseudorandom Sequence Period,1000.0,B,1333440000,"[implementation, number theory]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Bus,1500.0,C,1333440000,"[implementation, sortings]",PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,Calendar Reform,1500.0,D,1333440000,[number theory],PROGRAMMING +172,Croc Champ 2012 - Qualification Round,12,BHTML+BCSS,2000.0,E,1333440000,"[dfs and similar, expression parsing]",PROGRAMMING +171,April Fools Day Contest,12,Mysterious numbers - 1,,A,1333292400,"[*special, constructive algorithms]",PROGRAMMING +171,April Fools Day Contest,12,Star,,B,1333292400,"[*special, combinatorics]",PROGRAMMING +171,April Fools Day Contest,12,A Piece of Cake,,C,1333292400,"[*special, implementation]",PROGRAMMING +171,April Fools Day Contest,12,Broken checker,,D,1333292400,"[*special, brute force]",PROGRAMMING +171,April Fools Day Contest,12,MYSTERIOUS LANGUAGE,,E,1333292400,[*special],PROGRAMMING +171,April Fools Day Contest,12,ucyhf,,F,1333292400,"[*special, brute force, implementation, number theory]",PROGRAMMING +171,April Fools Day Contest,12,Mysterious numbers - 2,,G,1333292400,[*special],PROGRAMMING +171,April Fools Day Contest,12,A polyline,,H,1333292400,"[*special, implementation]",PROGRAMMING +170,VK Cup 2012 Wild-card Round 2,12,Placing Rectangles,,A,1332954000,[*special],PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Trolleybuses,500.0,A,1332860400,[implementation],PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Huge Prize,1000.0,B,1332860400,"[dp, probabilities]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Numbers,1500.0,C,1332860400,"[games, math]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Roads,2000.0,D,1332860400,"[data structures, divide and conquer, graph matchings]",PROGRAMMING +167,Codeforces Round #114 (Div. 1),1,Wizards and Bets,2500.0,E,1332860400,"[math, matrices]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Demonstration,500.0,A,1332860400,"[implementation, math]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Minimal Spell,1000.0,B,1332860400,"[implementation, strings]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Trolleybuses,1500.0,C,1332860400,"[implementation, math]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Huge Prize,2000.0,D,1332860400,"[dp, probabilities]",PROGRAMMING +168,Codeforces Round #114 (Div. 2),2,Wizards and Numbers,2500.0,E,1332860400,[],PROGRAMMING +163,VK Cup 2012 Round 2,12,Substring and Subsequence,1000.0,A,1332687900,[dp],PROGRAMMING +163,VK Cup 2012 Round 2,12,Lemmings,1000.0,B,1332687900,[binary search],PROGRAMMING +163,VK Cup 2012 Round 2,12,Conveyor,1500.0,C,1332687900,[sortings],PROGRAMMING +163,VK Cup 2012 Round 2,12,Large Refrigerator,2000.0,D,1332687900,[brute force],PROGRAMMING +163,VK Cup 2012 Round 2,12,e-Government,2500.0,E,1332687900,"[data structures, dfs and similar, dp, strings, trees]",PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Chores,500.0,A,1332687900,[sortings],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Replacing Digits,1000.0,B,1332687900,[greedy],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Substring and Subsequence,1500.0,C,1332687900,[dp],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Lemmings,2000.0,D,1332687900,[],PROGRAMMING +169,VK Cup 2012 Round 2 (Unofficial Div. 2 Edition),2,Conveyor,2500.0,E,1332687900,[],PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Rank List,500.0,A,1332516600,"[binary search, implementation, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Polygons,3000.0,B,1332516600,"[geometry, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Median,1000.0,C,1332516600,"[greedy, math, sortings]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Shoe Store,3000.0,D,1332516600,"[dp, graph matchings, greedy, sortings, two pointers]",PROGRAMMING +166,Codeforces Round #113 (Div. 2),2,Tetrahedron,1000.0,E,1332516600,"[dp, math, matrices]",PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Pentagonal numbers,,A,1332083400,"[*special, implementation]",PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Binary notation,,B,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Prime factorization,,C,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Remove digits,,D,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,HQ9+,,E,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Factorial zeros,,F,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Non-decimal sum,,G,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Alternating case,,H,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Truncatable primes,,I,1332083400,[*special],PROGRAMMING +162,VK Cup 2012 Wild-card Round 1,12,Brackets,,J,1332083400,[*special],PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Supercentral Point,500.0,A,1331911800,[implementation],PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Burning Midnight Oil,1000.0,B,1331911800,"[binary search, implementation]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Another Problem on Strings,1500.0,C,1331911800,"[binary search, brute force, dp, math, strings, two pointers]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Beard Graph,2000.0,D,1331911800,"[data structures, dsu, trees]",PROGRAMMING +165,Codeforces Round #112 (Div. 2),2,Compatible Numbers,2500.0,E,1331911800,"[bitmasks, brute force, dfs and similar, dp]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Dress'em in Vests!,1000.0,A,1331478300,"[binary search, brute force, greedy, two pointers]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Discounts,1000.0,B,1331478300,"[constructive algorithms, greedy, sortings]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Abracadabra,2000.0,C,1331478300,[divide and conquer],PROGRAMMING +161,VK Cup 2012 Round 1,12,Distance in Tree,2000.0,D,1331478300,"[dfs and similar, dp, trees]",PROGRAMMING +161,VK Cup 2012 Round 1,12,Polycarpus the Safecracker,2500.0,E,1331478300,"[brute force, dp]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Friends or Not,500.0,A,1331280000,"[*special, greedy, implementation]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Matchmaker,1000.0,B,1331280000,"[greedy, sortings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,String Manipulation 1.0,1500.0,C,1331280000,"[binary search, brute force, data structures, strings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Palindrome pairs,2000.0,D,1331280000,"[*special, brute force, dp, strings]",PROGRAMMING +159,VK Cup 2012 Qualification Round 2,12,Zebra Tower,2500.0,E,1331280000,"[data structures, greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Twins,500.0,A,1331046000,"[greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Unlucky Ticket,1000.0,B,1331046000,"[greedy, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Find Pair,1500.0,C,1331046000,"[implementation, math, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Edges in MST,2000.0,D,1331046000,"[dfs and similar, dsu, graphs, sortings]",PROGRAMMING +160,Codeforces Round #111 (Div. 2),2,Buses and People,2500.0,E,1331046000,"[binary search, data structures, sortings]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Next Round,500.0,A,1330804800,[implementation],PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Taxi,1000.0,B,1330804800,"[greedy, implementation]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Cd and pwd commands,1000.0,C,1330804800,"[data structures, implementation]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Ice Sculptures,1500.0,D,1330804800,"[brute force, number theory]",PROGRAMMING +158,VK Cup 2012 Qualification Round 1,12,Phone Talks,2000.0,E,1330804800,"[dp, sortings]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Message,500.0,A,1330536600,[brute force],PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Suspects,1000.0,B,1330536600,"[constructive algorithms, data structures, implementation]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Cipher,1500.0,C,1330536600,"[combinatorics, dp]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Clues,2500.0,D,1330536600,"[combinatorics, graphs]",PROGRAMMING +156,Codeforces Round #110 (Div. 1),1,Mrs. Hudson's Pancakes,2500.0,E,1330536600,"[brute force, dp]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Game Outcome,500.0,A,1330536600,[brute force],PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Trace,1000.0,B,1330536600,"[geometry, sortings]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Message,1500.0,C,1330536600,"[brute force, dp, strings]",PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Suspects,2000.0,D,1330536600,[implementation],PROGRAMMING +157,Codeforces Round #110 (Div. 2),2,Cipher,2500.0,E,1330536600,"[dp, math]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Hometask,500.0,A,1330095600,[greedy],PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Colliders,1000.0,B,1330095600,"[math, number theory]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Double Profiles,1500.0,C,1330095600,"[graphs, hashing, sortings]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Flatland Fencing,2000.0,D,1330095600,"[games, math]",PROGRAMMING +154,Codeforces Round #109 (Div. 1),1,Martian Colony,2500.0,E,1330095600,[geometry],PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,I_love_\%username\%,500.0,A,1330095600,[brute force],PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Combination,1000.0,B,1330095600,"[greedy, sortings]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Hometask,1500.0,C,1330095600,"[dp, greedy]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Colliders,2000.0,D,1330095600,"[math, number theory]",PROGRAMMING +155,Codeforces Round #109 (Div. 2),2,Double Profiles,2500.0,E,1330095600,"[hashing, sortings]",PROGRAMMING +153,Surprise Language Round #5,12,A + B,,A,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Binary notation,,B,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Caesar Cipher,,C,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Date Change,,D,1329922800,[*special],PROGRAMMING +153,Surprise Language Round #5,12,Euclidean Distance,,E,1329922800,[*special],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Marks,500.0,A,1329750000,[implementation],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Steps,1000.0,B,1329750000,"[binary search, implementation]",PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Pocket Book,1500.0,C,1329750000,[combinatorics],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Frames,2500.0,D,1329750000,[brute force],PROGRAMMING +152,Codeforces Round #108 (Div. 2),2,Garden,2500.0,E,1329750000,"[bitmasks, dp, graphs, trees]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Win or Freeze,500.0,A,1329490800,"[games, number theory]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Quantity of Strings,500.0,B,1329490800,"[combinatorics, dfs and similar, math]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Smart Cheater,1000.0,C,1329490800,"[data structures, math, probabilities]",PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Mission Impassable,1500.0,D,1329490800,[dp],PROGRAMMING +150,Codeforces Round #107 (Div. 1),1,Freezing with Style,3000.0,E,1329490800,"[binary search, data structures, divide and conquer, trees]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Soft Drinking,500.0,A,1329490800,"[implementation, math]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Phone Numbers,1000.0,B,1329490800,"[implementation, strings]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Win or Freeze,1500.0,C,1329490800,"[games, greedy, number theory]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Quantity of Strings,1500.0,D,1329490800,"[combinatorics, dsu]",PROGRAMMING +151,Codeforces Round #107 (Div. 2),2,Smart Cheater,3000.0,E,1329490800,[],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Business trip,500.0,A,1328886000,"[greedy, implementation, sortings]",PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Martian Clock,1000.0,B,1328886000,[implementation],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Division into Teams,1500.0,C,1328886000,"[greedy, math, sortings]",PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Coloring Brackets,2500.0,D,1328886000,[dp],PROGRAMMING +149,Codeforces Round #106 (Div. 2),2,Martian Strings,2500.0,E,1328886000,"[string suffix structures, strings]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Insomnia cure,1000.0,A,1328198400,"[constructive algorithms, implementation, math]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Escape,1000.0,B,1328198400,"[implementation, math]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Terse princess,1000.0,C,1328198400,"[constructive algorithms, greedy]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Bag of mice,1000.0,D,1328198400,"[dp, games, math, probabilities]",PROGRAMMING +148,Codeforces Round #105 (Div. 2),2,Porcelain,1000.0,E,1328198400,[dp],PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Conversion,500.0,A,1327215600,"[greedy, implementation]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Number 2,1000.0,B,1327215600,[constructive algorithms],PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Subsequence,1500.0,C,1327215600,"[combinatorics, dp, math]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Pair,2500.0,D,1327215600,"[combinatorics, data structures, implementation]",PROGRAMMING +145,Codeforces Round #104 (Div. 1),1,Lucky Queries,2500.0,E,1327215600,[data structures],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Ticket,500.0,A,1327215600,[implementation],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Mask,1000.0,B,1327215600,"[brute force, implementation]",PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Conversion,1500.0,C,1327215600,[greedy],PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Number 2,2000.0,D,1327215600,"[brute force, constructive algorithms, implementation]",PROGRAMMING +146,Codeforces Round #104 (Div. 2),2,Lucky Subsequence,2500.0,E,1327215600,"[combinatorics, dp]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Arrival of the General,500.0,A,1326899100,[implementation],PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Meeting,1000.0,B,1326899100,[implementation],PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Anagram Search,1500.0,C,1326899100,"[implementation, strings]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Missile Silos,2000.0,D,1326899100,"[data structures, dfs and similar, graphs, shortest paths]",PROGRAMMING +144,Codeforces Round #103 (Div. 2),2,Competition,2500.0,E,1326899100,"[data structures, greedy]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Farmer,500.0,A,1326380700,"[brute force, math]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help General,1000.0,B,1326380700,"[constructive algorithms, greedy, implementation]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Caretaker,1500.0,C,1326380700,"[brute force, dp]",PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Shrek and Donkey 2,2000.0,D,1326380700,[games],PROGRAMMING +142,Codeforces Round #102 (Div. 1),1,Help Greg the Dwarf 2,2500.0,E,1326380700,[geometry],PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Vasilisa the Wise 2,500.0,A,1326380700,"[brute force, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Kingdom of Far Far Away 2,1000.0,B,1326380700,"[implementation, strings]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Farmer,1500.0,C,1326380700,"[implementation, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help General,2000.0,D,1326380700,"[graph matchings, greedy, math]",PROGRAMMING +143,Codeforces Round #102 (Div. 2),2,Help Caretaker,2500.0,E,1326380700,[],PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Amusing Joke,500.0,A,1326034800,"[implementation, sortings, strings]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Hopscotch,1000.0,B,1326034800,"[geometry, math]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Queue,2000.0,C,1326034800,"[constructive algorithms, greedy, sortings]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Take-off Ramps,2000.0,D,1326034800,"[graphs, shortest paths]",PROGRAMMING +141,Codeforces Round #101 (Div. 2),2,Clearing Up,2500.0,E,1326034800,"[constructive algorithms, dp, dsu, graphs]",PROGRAMMING +140,Codeforces Round #100,12,New Year Table,500.0,A,1325689200,"[geometry, math]",PROGRAMMING +140,Codeforces Round #100,12,New Year Cards,1000.0,B,1325689200,"[brute force, greedy, implementation]",PROGRAMMING +140,Codeforces Round #100,12,New Year Snowmen,1500.0,C,1325689200,"[binary search, data structures, greedy]",PROGRAMMING +140,Codeforces Round #100,12,New Year Contest,2000.0,D,1325689200,"[greedy, sortings]",PROGRAMMING +140,Codeforces Round #100,12,New Year Garland,2500.0,E,1325689200,"[combinatorics, dp]",PROGRAMMING +140,Codeforces Round #100,12,New Year Snowflake,3000.0,F,1325689200,"[geometry, sortings]",PROGRAMMING +147,Codeforces Testing Round #4,12,Punctuation,500.0,A,1325602800,"[implementation, strings]",PROGRAMMING +147,Codeforces Testing Round #4,12,Smile House,1000.0,B,1325602800,"[binary search, graphs, matrices]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Literature Lesson,500.0,A,1324728000,[implementation],PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Digits Permutations,1000.0,B,1324728000,[greedy],PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Mushroom Gnomes - 2,2000.0,C,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,World of Darkraft,2000.0,D,1324728000,"[dp, games]",PROGRAMMING +138,Codeforces Beta Round #99 (Div. 1),1,Hellish Constraints,2500.0,E,1324728000,"[brute force, dp, two pointers]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Petr and Book,500.0,A,1324728000,[implementation],PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Wallpaper,1000.0,B,1324728000,"[implementation, math]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Literature Lesson,1500.0,C,1324728000,"[implementation, strings]",PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Digits Permutations,2000.0,D,1324728000,[implementation],PROGRAMMING +139,Codeforces Beta Round #99 (Div. 2),2,Mushroom Gnomes - 2,3000.0,E,1324728000,"[binary search, data structures, probabilities, sortings]",PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Postcards and photos,500.0,A,1324015200,[implementation],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Permutation,1000.0,B,1324015200,[greedy],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,History,1500.0,C,1324015200,[sortings],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Palindromes,2000.0,D,1324015200,[dp],PROGRAMMING +137,Codeforces Beta Round #98 (Div. 2),2,Last Chance,2500.0,E,1324015200,"[data structures, implementation]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Replacement,500.0,A,1323443100,"[implementation, sortings]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Rectangle and Square,1000.0,B,1323443100,"[brute force, geometry, math]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Zero-One,1500.0,C,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Cycle,2000.0,D,1323443100,"[brute force, dfs and similar, implementation]",PROGRAMMING +135,Codeforces Beta Round #97 (Div. 1),1,Weak Subsequence,2500.0,E,1323443100,[combinatorics],PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Presents,500.0,A,1323443100,[implementation],PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Ternary Logic,1000.0,B,1323443100,"[implementation, math]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Replacement,1500.0,C,1323443100,"[implementation, sortings]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Rectangle and Square,2000.0,D,1323443100,"[geometry, implementation]",PROGRAMMING +136,Codeforces Beta Round #97 (Div. 2),2,Zero-One,2500.0,E,1323443100,"[constructive algorithms, games, greedy]",PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Turing Tape,500.0,A,1322924400,[implementation],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Piet,1500.0,B,1322924400,[implementation],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Logo Turtle,1500.0,C,1322924400,[dp],PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Constants in the language of Shakespeare,2000.0,D,1322924400,"[constructive algorithms, dp, greedy]",PROGRAMMING +132,Codeforces Beta Round #96 (Div. 1),1,Bits of merry old England,2500.0,E,1322924400,[flows],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,HQ9+,500.0,A,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Unary,1000.0,B,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Turing Tape,1500.0,C,1322924400,"[implementation, math]",PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Piet,2500.0,D,1322924400,[implementation],PROGRAMMING +133,Codeforces Beta Round #96 (Div. 2),2,Logo Turtle,2500.0,E,1322924400,"[dp, implementation]",PROGRAMMING +134,Codeforces Testing Round #3,12,Average Numbers,500.0,A,1322838000,"[brute force, implementation]",PROGRAMMING +134,Codeforces Testing Round #3,12,Pairs of Numbers,1000.0,B,1322838000,"[brute force, dfs and similar, math, number theory]",PROGRAMMING +134,Codeforces Testing Round #3,12,Swaps,1500.0,C,1322838000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,cAPS lOCK,500.0,A,1322233200,"[implementation, strings]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Opposites Attract,1000.0,B,1322233200,"[implementation, math]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,The World is a Theatre,1500.0,C,1322233200,"[combinatorics, math]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Subway,2000.0,D,1322233200,"[dfs and similar, graphs]",PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Yet Another Task with Queens,2500.0,E,1322233200,[sortings],PROGRAMMING +131,Codeforces Beta Round #95 (Div. 2),2,Present to Mom,2500.0,F,1322233200,"[binary search, two pointers]",PROGRAMMING +130,Unknown Language Round #4,12,Hexagonal numbers,,A,1321801200,"[*special, implementation]",PROGRAMMING +130,Unknown Language Round #4,12,Gnikool Ssalg,,B,1321801200,"[*special, implementation, strings]",PROGRAMMING +130,Unknown Language Round #4,12,Decimal sum,,C,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Exponentiation,,D,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Tribonacci numbers,,E,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Prime factorization,,F,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,CAPS LOCK ON,,G,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Balanced brackets,,H,1321801200,[*special],PROGRAMMING +130,Unknown Language Round #4,12,Array sorting,,I,1321801200,"[*special, sortings]",PROGRAMMING +130,Unknown Language Round #4,12,Date calculation,,J,1321801200,[*special],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Statues,1000.0,A,1321337400,[dfs and similar],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,String,1500.0,B,1321337400,"[brute force, constructive algorithms, hashing, string suffix structures, strings]",PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Games with Rectangle,1500.0,C,1321337400,"[combinatorics, dp]",PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Numbers,2000.0,D,1321337400,[constructive algorithms],PROGRAMMING +128,Codeforces Beta Round #94 (Div. 1 Only),1,Birthday,2500.0,E,1321337400,"[geometry, math]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Cookies,500.0,A,1321337400,[implementation],PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Students and Shoelaces,1000.0,B,1321337400,"[brute force, dfs and similar, graphs]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Statues,2000.0,C,1321337400,"[dfs and similar, graphs, implementation]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,String,2500.0,D,1321337400,"[implementation, string suffix structures, strings]",PROGRAMMING +129,Codeforces Beta Round #94 (Div. 2 Only),2,Games with Rectangle,2500.0,E,1321337400,"[combinatorics, dp]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Hot Bath,500.0,A,1320858000,"[binary search, brute force, math]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Password,1000.0,B,1320858000,"[binary search, dp, hashing, string suffix structures, strings]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,E-reader Display,1500.0,C,1320858000,"[constructive algorithms, greedy]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Fibonacci Sums,2000.0,D,1320858000,"[dp, math]",PROGRAMMING +126,Codeforces Beta Round #93 (Div. 1 Only),1,Pills,2500.0,E,1320858000,"[brute force, flows]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Wasted Time,500.0,A,1320858000,[geometry],PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Canvas Frames,1000.0,B,1320858000,[implementation],PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Hot Bath,1500.0,C,1320858000,"[binary search, math]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,Password,2000.0,D,1320858000,"[hashing, strings]",PROGRAMMING +127,Codeforces Beta Round #93 (Div. 2 Only),2,E-reader Display,2500.0,E,1320858000,[implementation],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Prime Permutation,1000.0,A,1320333000,"[implementation, number theory, strings]",PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Squares,1000.0,B,1320333000,[math],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Brackets,1500.0,C,1320333000,"[combinatorics, dp, greedy]",PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,String,2000.0,D,1320333000,[string suffix structures],PROGRAMMING +123,Codeforces Beta Round #92 (Div. 1 Only),1,Maze,2500.0,E,1320333000,"[dfs and similar, dp, probabilities, trees]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,The number of positions,500.0,A,1320333000,[math],PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Permutations,1000.0,B,1320333000,"[brute force, combinatorics, implementation]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Prime Permutation,2000.0,C,1320333000,"[constructive algorithms, dfs and similar, dsu, greedy, number theory, sortings, strings]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Squares,2000.0,D,1320333000,"[brute force, constructive algorithms, number theory]",PROGRAMMING +124,Codeforces Beta Round #92 (Div. 2 Only),2,Brackets,2500.0,E,1320333000,[],PROGRAMMING +125,Codeforces Testing Round #2,12,Measuring Lengths in Baden,1000.0,A,1319893200,[math],PROGRAMMING +125,Codeforces Testing Round #2,12,Simple XML,1500.0,B,1319893200,[implementation],PROGRAMMING +125,Codeforces Testing Round #2,12,Hobbits' Party,2000.0,C,1319893200,"[constructive algorithms, greedy]",PROGRAMMING +125,Codeforces Testing Round #2,12,Two progressions,3000.0,D,1319893200,"[constructive algorithms, greedy]",PROGRAMMING +125,Codeforces Testing Round #2,12,MST Company,5000.0,E,1319893200,"[binary search, graphs]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Sum,500.0,A,1319727600,[implementation],PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Transformation,1000.0,B,1319727600,[strings],PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Permutation,1500.0,C,1319727600,"[brute force, combinatorics, number theory]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Segments,2000.0,D,1319727600,"[binary search, implementation, two pointers]",PROGRAMMING +121,Codeforces Beta Round #91 (Div. 1 Only),1,Lucky Array,2500.0,E,1319727600,[data structures],PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Division,500.0,A,1319727600,"[brute force, number theory]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Substring,1000.0,B,1319727600,"[brute force, implementation]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Sum,1500.0,C,1319727600,"[brute force, math]",PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Transformation,2000.0,D,1319727600,[brute force],PROGRAMMING +122,Codeforces Beta Round #91 (Div. 2 Only),2,Lucky Permutation,2500.0,E,1319727600,[],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Elevator,,A,1318919400,"[brute force, implementation, math]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Quiz League,,B,1318919400,[implementation],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Winnie-the-Pooh and honey,,C,1318919400,"[implementation, math]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Three Sons,,D,1318919400,[brute force],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Put Knight!,,E,1318919400,[games],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Spiders,,F,1318919400,"[dp, greedy, trees]",PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Boom,,G,1318919400,[implementation],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Brevity is Soul of Wit,,H,1318919400,[graph matchings],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Luck is in Numbers,,I,1318919400,[greedy],PROGRAMMING +120,"School Regional Team Contest, Saratov, 2011",12,Minimum Sum,,J,1318919400,"[divide and conquer, geometry, sortings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Epic Game,500.0,A,1318604400,[implementation],PROGRAMMING +119,Codeforces Beta Round #90,12,Before Exam,1000.0,B,1318604400,"[constructive algorithms, implementation, sortings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Education Reform,1500.0,C,1318604400,[dp],PROGRAMMING +119,Codeforces Beta Round #90,12,String Transformation,2000.0,D,1318604400,"[hashing, strings]",PROGRAMMING +119,Codeforces Beta Round #90,12,Alternative Reality,2500.0,E,1318604400,[geometry],PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,String Task,500.0,A,1317999600,"[implementation, strings]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Present from Lena,1000.0,B,1317999600,"[constructive algorithms, implementation]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Fancy Number,1500.0,C,1317999600,"[brute force, greedy, sortings, strings]",PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Caesar's Legions,2000.0,D,1317999600,[dp],PROGRAMMING +118,Codeforces Beta Round #89 (Div. 2),2,Bertown roads,2500.0,E,1317999600,"[dfs and similar, graphs]",PROGRAMMING +117,Codeforces Beta Round #88,12,Elevator,500.0,A,1316790000,"[implementation, math]",PROGRAMMING +117,Codeforces Beta Round #88,12,Very Interesting Game,1000.0,B,1316790000,"[brute force, number theory]",PROGRAMMING +117,Codeforces Beta Round #88,12,Cycle,1500.0,C,1316790000,"[dfs and similar, graphs]",PROGRAMMING +117,Codeforces Beta Round #88,12,Not Quick Transformation,2000.0,D,1316790000,"[divide and conquer, math]",PROGRAMMING +117,Codeforces Beta Round #88,12,Tree or not Tree,2500.0,E,1316790000,"[data structures, divide and conquer, implementation, trees]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Party,500.0,A,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Lawnmower,1000.0,B,1316098800,"[greedy, sortings]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Plumber,1500.0,C,1316098800,[math],PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Unambiguous Arithmetic Expression,2000.0,D,1316098800,"[dp, expression parsing]",PROGRAMMING +115,Codeforces Beta Round #87 (Div. 1 Only),1,Linear Kingdom Races,2500.0,E,1316098800,"[data structures, dp]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Tram,500.0,A,1316098800,[implementation],PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Little Pigs and Wolves,1000.0,B,1316098800,"[greedy, implementation]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Party,1500.0,C,1316098800,"[dfs and similar, graphs, trees]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Lawnmower,2000.0,D,1316098800,"[dp, greedy]",PROGRAMMING +116,Codeforces Beta Round #87 (Div. 2 Only),2,Plumber,2500.0,E,1316098800,[],PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Grammar Lessons,500.0,A,1315494000,"[implementation, strings]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Petr#,1000.0,B,1315494000,"[brute force, data structures, hashing, strings]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Double Happiness,1500.0,C,1315494000,"[brute force, number theory]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Museum,2000.0,D,1315494000,"[matrices, probabilities]",PROGRAMMING +113,Codeforces Beta Round #86 (Div. 1 Only),1,Sleeping,2500.0,E,1315494000,"[combinatorics, implementation, math]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Cifera,500.0,A,1315494000,[math],PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,PFAST Inc.,1000.0,B,1315494000,"[bitmasks, brute force]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Grammar Lessons,1500.0,C,1315494000,[implementation],PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Petr#,2000.0,D,1315494000,"[data structures, hashing, string suffix structures, strings]",PROGRAMMING +114,Codeforces Beta Round #86 (Div. 2 Only),2,Double Happiness,2500.0,E,1315494000,[number theory],PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Inequiations,500.0,A,1315051200,[greedy],PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Divisors,1000.0,B,1315051200,"[binary search, data structures, number theory]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Spiders,1500.0,C,1315051200,"[bitmasks, dp, dsu]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Coloring,2000.0,D,1315051200,"[combinatorics, dp]",PROGRAMMING +111,Codeforces Beta Round #85 (Div. 1 Only),1,Petya and Rectangle,2500.0,E,1315051200,[],PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Strings,500.0,A,1315051200,"[implementation, strings]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Square,1000.0,B,1315051200,"[implementation, math]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Inequiations,1500.0,C,1315051200,"[greedy, math]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Divisors,2000.0,D,1315051200,"[implementation, number theory]",PROGRAMMING +112,Codeforces Beta Round #85 (Div. 2 Only),2,Petya and Spiders,2500.0,E,1315051200,"[bitmasks, dp]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sum of Digits,500.0,A,1314633600,"[brute force, implementation]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Probability,1000.0,B,1314633600,"[brute force, probabilities]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Tree,1500.0,C,1314633600,"[dp, dsu, trees]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Sorting,2000.0,D,1314633600,"[constructive algorithms, sortings]",PROGRAMMING +109,Codeforces Beta Round #84 (Div. 1 Only),1,Lucky Interval,2500.0,E,1314633600,"[brute force, math]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Nearly Lucky Number,500.0,A,1314633600,[implementation],PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky String,1000.0,B,1314633600,"[constructive algorithms, strings]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Sum of Digits,1500.0,C,1314633600,"[implementation, math]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Probability,2000.0,D,1314633600,"[brute force, combinatorics, dfs and similar, probabilities]",PROGRAMMING +110,Codeforces Beta Round #84 (Div. 2 Only),2,Lucky Tree,2500.0,E,1314633600,"[combinatorics, dfs and similar, trees]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Dorm Water Supply,500.0,A,1314111600,"[dfs and similar, graphs]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Basketball Team,1000.0,B,1314111600,"[combinatorics, dp, probabilities]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Arrangement,1500.0,C,1314111600,"[bitmasks, dp]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Crime Management,2000.0,D,1314111600,"[dp, matrices]",PROGRAMMING +107,Codeforces Beta Round #83 (Div. 1 Only),1,Darts,2500.0,E,1314111600,"[geometry, probabilities]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Palindromic Times,500.0,A,1314111600,"[implementation, strings]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Datatypes,1000.0,B,1314111600,"[math, sortings]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Dorm Water Supply,1500.0,C,1314111600,"[dfs and similar, implementation]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Basketball Team,2000.0,D,1314111600,"[combinatorics, math, probabilities]",PROGRAMMING +108,Codeforces Beta Round #83 (Div. 2 Only),2,Arrangement,2500.0,E,1314111600,[],PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Card Game,500.0,A,1313766000,[implementation],PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Choosing Laptop,1000.0,B,1313766000,"[brute force, implementation]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Buns,1500.0,C,1313766000,"[chinese remainder theorem, geometry]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Treasure Island,2000.0,D,1313766000,"[brute force, implementation]",PROGRAMMING +106,Codeforces Beta Round #82 (Div. 2),2,Space Rescuers,2500.0,E,1313766000,"[geometry, ternary search]",PROGRAMMING +105,Codeforces Beta Round #81,12,Transmigration,500.0,A,1313247600,[implementation],PROGRAMMING +105,Codeforces Beta Round #81,12,Dark Assembly,1000.0,B,1313247600,"[brute force, probabilities]",PROGRAMMING +105,Codeforces Beta Round #81,12,Item World,1500.0,C,1313247600,"[brute force, implementation, sortings]",PROGRAMMING +105,Codeforces Beta Round #81,12,Entertaining Geodetics,2000.0,D,1313247600,"[brute force, dsu, implementation]",PROGRAMMING +105,Codeforces Beta Round #81,12,Lift and Throw,2500.0,E,1313247600,[brute force],PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Testing Pants for Sadness,500.0,A,1312714800,"[greedy, implementation, math]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Cthulhu,1000.0,B,1312714800,"[dfs and similar, dsu, graphs]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Russian Roulette,1500.0,C,1312714800,"[constructive algorithms, greedy]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Time to Raid Cowavans,2000.0,D,1312714800,"[brute force, data structures, sortings]",PROGRAMMING +103,Codeforces Beta Round #80 (Div. 1 Only),1,Buying Sets,2500.0,E,1312714800,"[flows, graph matchings]",PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Blackjack,500.0,A,1312714800,[implementation],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Testing Pants for Sadness,1000.0,B,1312714800,[math],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Cthulhu,1500.0,C,1312714800,"[dsu, trees]",PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Russian Roulette,2000.0,D,1312714800,[math],PROGRAMMING +104,Codeforces Beta Round #80 (Div. 2 Only),2,Time to Raid Cowavans,2500.0,E,1312714800,[],PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Homework,500.0,A,1312390800,[greedy],PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Buses,1000.0,B,1312390800,"[binary search, data structures, dp]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Vectors,1500.0,C,1312390800,"[implementation, math]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Castle,2000.0,D,1312390800,"[dp, greedy, probabilities, sortings, trees]",PROGRAMMING +101,Codeforces Beta Round #79 (Div. 1 Only),1,Candies and Stones,2500.0,E,1312390800,"[divide and conquer, dp]",PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Clothes,500.0,A,1312390800,[brute force],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Sum of Digits,1000.0,B,1312390800,[implementation],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Homework,1500.0,C,1312390800,[greedy],PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Buses,2000.0,D,1312390800,"[binary search, data structures, dp]",PROGRAMMING +102,Codeforces Beta Round #79 (Div. 2 Only),2,Vectors,2500.0,E,1312390800,[],PROGRAMMING +100,Unknown Language Round #3,12,Carpeting the Room,,A,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Friendly Numbers,,B,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,A+B,,C,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,World of Mouth,,D,1312005600,"[*special, strings]",PROGRAMMING +100,Unknown Language Round #3,12,Lamps in a Line,,E,1312005600,"[*special, math]",PROGRAMMING +100,Unknown Language Round #3,12,Polynom,,F,1312005600,"[*special, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Name the album,,G,1312005600,"[*special, data structures, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Battleship,,H,1312005600,"[*special, dfs and similar, implementation]",PROGRAMMING +100,Unknown Language Round #3,12,Rotation,,I,1312005600,"[*special, geometry, math]",PROGRAMMING +100,Unknown Language Round #3,12,Interval Coloring,,J,1312005600,"[*special, greedy, math]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Victoria the Wise,500.0,A,1311346800,"[brute force, implementation]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help King,1000.0,B,1311346800,"[implementation, probabilities, trees]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Greg the Dwarf,1500.0,C,1311346800,"[geometry, ternary search]",PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Monks,2000.0,D,1311346800,[constructive algorithms],PROGRAMMING +98,Codeforces Beta Round #78 (Div. 1 Only),1,Help Shrek and Donkey,2500.0,E,1311346800,"[dp, games, math, probabilities]",PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Far Away Kingdom,500.0,A,1311346800,[strings],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Chef Gerasim,1000.0,B,1311346800,"[implementation, sortings]",PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Victoria the Wise,1500.0,C,1311346800,[brute force],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help King,2000.0,D,1311346800,[],PROGRAMMING +99,Codeforces Beta Round #78 (Div. 2 Only),2,Help Greg the Dwarf,2500.0,E,1311346800,"[binary search, geometry, ternary search]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Domino,500.0,A,1310731200,"[brute force, implementation]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Superset,1500.0,B,1310731200,"[constructive algorithms, divide and conquer]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Winning Strategy,2000.0,C,1310731200,"[binary search, graphs, math, shortest paths]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Robot in Basement,2000.0,D,1310731200,"[bitmasks, brute force, implementation]",PROGRAMMING +97,Yandex.Algorithm 2011
Finals,12,Leaders,2500.0,E,1310731200,"[dfs and similar, dsu, graphs, trees]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Hockey,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Numbers,1000.0,B,1310137200,"[dp, greedy]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Volleyball,1500.0,C,1310137200,[shortest paths],PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Horse Races,2000.0,D,1310137200,"[dp, math]",PROGRAMMING +95,Codeforces Beta Round #77 (Div. 1 Only),1,Lucky Country,2500.0,E,1310137200,"[dp, dsu, graphs]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Football,500.0,A,1310137200,"[implementation, strings]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Lucky Numbers (easy),1000.0,B,1310137200,"[binary search, bitmasks, brute force]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Hockey,1500.0,C,1310137200,"[implementation, strings]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Volleyball,2000.0,D,1310137200,"[graphs, shortest paths]",PROGRAMMING +96,Codeforces Beta Round #77 (Div. 2 Only),2,Horse Races,2500.0,E,1310137200,[],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Frames,500.0,A,1309446000,[implementation],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,End of Exams,1000.0,B,1309446000,[greedy],PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Azembler,1500.0,C,1309446000,"[brute force, implementation]",PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Flags,2000.0,D,1309446000,"[dp, math, matrices]",PROGRAMMING +93,Codeforces Beta Round #76 (Div. 1 Only),1,Lostborn,2500.0,E,1309446000,"[dp, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Restoring Password,500.0,A,1309446000,"[implementation, strings]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Friends,1000.0,B,1309446000,"[implementation, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Frames,1500.0,C,1309446000,[math],PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,End of Exams,2000.0,D,1309446000,"[greedy, math]",PROGRAMMING +94,Codeforces Beta Round #76 (Div. 2 Only),2,Azembler,2500.0,E,1309446000,[brute force],PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Newspaper Headline,500.0,A,1308582000,"[greedy, strings]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Queue,1000.0,B,1308582000,"[binary search, data structures]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Ski Base,1500.0,C,1308582000,"[combinatorics, dsu, graphs]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Grocer's Problem,2500.0,D,1308582000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +91,Codeforces Beta Round #75 (Div. 1 Only),1,Igloo Skyscraper,2500.0,E,1308582000,"[data structures, geometry]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Chips,500.0,A,1308582000,"[implementation, math]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Binary Number,1000.0,B,1308582000,[greedy],PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Newspaper Headline,1500.0,C,1308582000,"[binary search, data structures, dp, greedy]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Queue,2000.0,D,1308582000,"[binary search, data structures, dp]",PROGRAMMING +92,Codeforces Beta Round #75 (Div. 2 Only),2,Ski Base,2500.0,E,1308582000,"[data structures, dsu, graphs]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Robbery,500.0,A,1308236400,[greedy],PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Widget Library,1000.0,B,1308236400,"[dp, expression parsing, graphs, implementation]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Chip Play,1000.0,C,1308236400,"[brute force, data structures, implementation]",PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Space mines,1500.0,D,1308236400,[geometry],PROGRAMMING +89,Codeforces Beta Round #74 (Div. 1 Only),1,Fire and Ice,2500.0,E,1308236400,[greedy],PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Cableway,500.0,A,1308236400,"[greedy, math]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,African Crossword,1000.0,B,1308236400,"[implementation, strings]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Robbery,1500.0,C,1308236400,"[greedy, math]",PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Widget Library,2000.0,D,1308236400,[],PROGRAMMING +90,Codeforces Beta Round #74 (Div. 2 Only),2,Chip Play,2000.0,E,1308236400,[],PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Trains,500.0,A,1307458800,[math],PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Vasya and Types,1000.0,B,1307458800,"[implementation, strings]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Interesting Game,1500.0,C,1307458800,"[dp, games]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Beautiful Road,2000.0,D,1307458800,"[dfs and similar, dp, dsu, implementation, sortings, trees]",PROGRAMMING +87,Codeforces Beta Round #73 (Div. 1 Only),1,Mogohu-Rea Idol,2500.0,E,1307458800,[geometry],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Chord,500.0,A,1307458800,"[brute force, implementation]",PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Keyboard,1000.0,B,1307458800,[implementation],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Trains,1500.0,C,1307458800,[number theory],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Vasya and Types,2000.0,D,1307458800,[implementation],PROGRAMMING +88,Codeforces Beta Round #73 (Div. 2 Only),2,Interesting Game,2500.0,E,1307458800,[],PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Reflection,500.0,A,1306077000,[math],PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Tetris revisited,1000.0,B,1306077000,"[constructive algorithms, graph matchings, greedy, math]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Genetic engineering,2000.0,C,1306077000,"[dp, string suffix structures, trees]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Powerful array,2500.0,D,1306077000,"[data structures, implementation, math, two pointers]",PROGRAMMING +86,Yandex.Algorithm 2011
Round 2,12,Long sequence,2500.0,E,1306077000,"[brute force, math, matrices]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Domino,500.0,A,1305903600,"[constructive algorithms, implementation]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Embassy Queue,1000.0,B,1305903600,[data structures],PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Petya and Tree,1500.0,C,1305903600,"[binary search, dfs and similar, probabilities, sortings, trees]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Sum of Medians,2000.0,D,1305903600,"[binary search, brute force, data structures, implementation]",PROGRAMMING +85,Yandex.Algorithm 2011
Round 1,12,Guard Towers,2500.0,E,1305903600,"[binary search, dsu, geometry, graphs, sortings]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Magical Array,500.0,A,1305299400,[math],PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Doctor,1000.0,B,1305299400,"[binary search, math, sortings]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Track,1500.0,C,1305299400,"[graphs, greedy, shortest paths]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Numbers,2000.0,D,1305299400,"[dp, math, number theory]",PROGRAMMING +83,Codeforces Beta Round #72 (Div. 1 Only),1,Two Subsequences,2500.0,E,1305299400,"[bitmasks, dp]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Toy Army,500.0,A,1305299400,"[math, number theory]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Magical Array,1000.0,B,1305299400,"[combinatorics, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Biathlon,1500.0,C,1305299400,"[binary search, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Doctor,2000.0,D,1305299400,"[binary search, implementation]",PROGRAMMING +84,Codeforces Beta Round #72 (Div. 2 Only),2,Track,2500.0,E,1305299400,"[brute force, shortest paths]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Double Cola,500.0,A,1304694000,"[implementation, math]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Sets,1000.0,B,1304694000,"[constructive algorithms, hashing, implementation]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,General Mobilization,1500.0,C,1304694000,"[data structures, dfs and similar, sortings]",PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Two out of Three,2000.0,D,1304694000,[dp],PROGRAMMING +82,Yandex.Algorithm 2011
Qualification 2,12,Corridor,2500.0,E,1304694000,[geometry],PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Plug-in,500.0,A,1304485200,[implementation],PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Sequence Formatting,1000.0,B,1304485200,"[implementation, strings]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Average Score,1500.0,C,1304485200,"[math, sortings]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Polycarp's Picture Gallery,2000.0,D,1304485200,"[constructive algorithms, greedy]",PROGRAMMING +81,Yandex.Algorithm Open 2011
Qualification 1,12,Pairs,2500.0,E,1304485200,"[dfs and similar, dp, dsu, graphs, implementation, trees]",PROGRAMMING +79,Codeforces Beta Round #71,12,Bus Game,500.0,A,1304175600,[greedy],PROGRAMMING +79,Codeforces Beta Round #71,12,Colorful Field,1000.0,B,1304175600,"[implementation, sortings]",PROGRAMMING +79,Codeforces Beta Round #71,12,Beaver,1500.0,C,1304175600,"[data structures, dp, greedy, hashing, strings, two pointers]",PROGRAMMING +79,Codeforces Beta Round #71,12,Password,2000.0,D,1304175600,"[bitmasks, dp, shortest paths]",PROGRAMMING +79,Codeforces Beta Round #71,12,Security System,2500.0,E,1304175600,[math],PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Haiku,500.0,A,1303916400,"[implementation, strings]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Easter Eggs,1000.0,B,1303916400,"[constructive algorithms, implementation]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Beaver Game,1500.0,C,1303916400,"[dp, games, number theory]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Archer's Shot,2000.0,D,1303916400,"[binary search, geometry, math, two pointers]",PROGRAMMING +78,Codeforces Beta Round #70 (Div. 2),2,Evacuation,2500.0,E,1303916400,"[flows, graphs, shortest paths]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Heroes,500.0,A,1303226100,"[brute force, implementation]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Falling Anvils,1000.0,B,1303226100,"[math, probabilities]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Beavermuncher-0xFF,1500.0,C,1303226100,"[dfs and similar, dp, dsu, greedy, trees]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Domino Carpet,2000.0,D,1303226100,"[dp, implementation]",PROGRAMMING +77,Codeforces Beta Round #69 (Div. 1 Only),1,Martian Food,2000.0,E,1303226100,[geometry],PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Panoramix's Prediction,500.0,A,1303226100,[brute force],PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Depression,1000.0,B,1303226100,"[geometry, math]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Heroes,1500.0,C,1303226100,"[brute force, implementation]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Falling Anvils,2000.0,D,1303226100,"[geometry, probabilities]",PROGRAMMING +80,Codeforces Beta Round #69 (Div. 2 Only),2,Beavermuncher-0xFF,2500.0,E,1303226100,[],PROGRAMMING +74,Codeforces Beta Round #68,12,Room Leader,500.0,A,1302879600,[implementation],PROGRAMMING +74,Codeforces Beta Round #68,12,Train,1000.0,B,1302879600,"[dp, games, greedy]",PROGRAMMING +74,Codeforces Beta Round #68,12,Chessboard Billiard,1500.0,C,1302879600,"[dfs and similar, dsu, graphs, number theory]",PROGRAMMING +74,Codeforces Beta Round #68,12,Hanger,2000.0,D,1302879600,[data structures],PROGRAMMING +74,Codeforces Beta Round #68,12,Shift It!,2500.0,E,1302879600,[constructive algorithms],PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Life Without Zeros,500.0,A,1302706800,[implementation],PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Facetook Priority Wall,1000.0,B,1302706800,"[expression parsing, implementation, strings]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Modified GCD,1500.0,C,1302706800,"[binary search, number theory]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Big Maximum Sum,2000.0,D,1302706800,"[data structures, dp, greedy, implementation, math, trees]",PROGRAMMING +75,Codeforces Beta Round #67 (Div. 2),2,Ship's Shortest Path,2500.0,E,1302706800,"[geometry, shortest paths]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Gift,,A,1302609600,"[dsu, graphs, sortings, trees]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Mice,,B,1302609600,"[greedy, two pointers]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Mutation,,C,1302609600,"[bitmasks, dp, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Plus and xor,,D,1302609600,"[dp, greedy, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Points,,E,1302609600,"[implementation, math]",PROGRAMMING +76,All-Ukrainian School Olympiad in Informatics,12,Tourist,,F,1302609600,"[binary search, data structures, dp]",PROGRAMMING +73,Codeforces Beta Round #66,12,The Elder Trolls IV: Oblivon,500.0,A,1302422400,"[greedy, math]",PROGRAMMING +73,Codeforces Beta Round #66,12,Need For Brake,1000.0,B,1302422400,"[binary search, greedy, sortings]",PROGRAMMING +73,Codeforces Beta Round #66,12,LionAge II,1000.0,C,1302422400,[dp],PROGRAMMING +73,Codeforces Beta Round #66,12,FreeDiv,1500.0,D,1302422400,"[dfs and similar, graphs, greedy]",PROGRAMMING +73,Codeforces Beta Round #66,12,Morrowindows,1500.0,E,1302422400,"[math, number theory]",PROGRAMMING +73,Codeforces Beta Round #66,12,Plane of Tanks,2000.0,F,1302422400,"[brute force, geometry]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Way Too Long Words,500.0,A,1301410800,[strings],PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Progress Bar,1000.0,B,1301410800,"[implementation, math]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Round Table Knights,1500.0,C,1301410800,"[dp, math, number theory]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Solitaire,2000.0,D,1301410800,"[brute force, implementation]",PROGRAMMING +71,Codeforces Beta Round #65 (Div. 2),2,Nuclear Fusion,2500.0,E,1301410800,"[bitmasks, dp]",PROGRAMMING +70,Codeforces Beta Round #64,12,Cookies,500.0,A,1301155200,[math],PROGRAMMING +70,Codeforces Beta Round #64,12,Text Messaging,1000.0,B,1301155200,"[expression parsing, greedy, strings]",PROGRAMMING +70,Codeforces Beta Round #64,12,Lucky Tickets,1500.0,C,1301155200,"[binary search, data structures, sortings, two pointers]",PROGRAMMING +70,Codeforces Beta Round #64,12,Professor's task,2000.0,D,1301155200,"[data structures, geometry]",PROGRAMMING +70,Codeforces Beta Round #64,12,Information Reform,2500.0,E,1301155200,"[dp, implementation, trees]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Young Physicist,500.0,A,1300809600,"[implementation, math]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Bets,1000.0,B,1300809600,"[greedy, implementation]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Game,1500.0,C,1300809600,[implementation],PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Dot,2000.0,D,1300809600,"[dp, games]",PROGRAMMING +69,Codeforces Beta Round #63 (Div. 2),2,Subsegments,2500.0,E,1300809600,"[data structures, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,"Goshtasp, Vishtasp and Eidi",,A,1300637400,"[*special, greedy, math]",PROGRAMMING +72,Unknown Language Round #2,12,INI-file,,B,1300637400,"[*special, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,Extraordinarily Nice Numbers,,C,1300637400,"[*special, math]",PROGRAMMING +72,Unknown Language Round #2,12,Perse-script,,D,1300637400,"[*special, expression parsing]",PROGRAMMING +72,Unknown Language Round #2,12,Ali goes shopping,,E,1300637400,"[*special, brute force, strings]",PROGRAMMING +72,Unknown Language Round #2,12,Oil,,F,1300637400,"[*special, greedy, math]",PROGRAMMING +72,Unknown Language Round #2,12,Fibonacci army,,G,1300637400,"[*special, dp]",PROGRAMMING +72,Unknown Language Round #2,12,Reverse It!,,H,1300637400,"[*special, implementation]",PROGRAMMING +72,Unknown Language Round #2,12,Goofy Numbers,,I,1300637400,"[*special, implementation]",PROGRAMMING +68,Codeforces Beta Round #62,12,Irrational problem,500.0,A,1300464000,"[implementation, number theory]",PROGRAMMING +68,Codeforces Beta Round #62,12,Energy exchange,1000.0,B,1300464000,[binary search],PROGRAMMING +68,Codeforces Beta Round #62,12,Synchrophasotron,1500.0,C,1300464000,[brute force],PROGRAMMING +68,Codeforces Beta Round #62,12,Half-decay tree,2000.0,D,1300464000,"[data structures, divide and conquer, dp, probabilities]",PROGRAMMING +68,Codeforces Beta Round #62,12,Contact,2500.0,E,1300464000,[geometry],PROGRAMMING +67,Manthan 2011,12,Partial Teacher,500.0,A,1300033800,"[dp, graphs, greedy, implementation]",PROGRAMMING +67,Manthan 2011,12,Restoration of the Permutation,1000.0,B,1300033800,[greedy],PROGRAMMING +67,Manthan 2011,12,Sequence of Balls,1500.0,C,1300033800,[dp],PROGRAMMING +67,Manthan 2011,12,Optical Experiment,2000.0,D,1300033800,"[binary search, data structures, dp]",PROGRAMMING +67,Manthan 2011,12,Save the City!,2500.0,E,1300033800,[geometry],PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Java,500.0,A,1299513600,"[implementation, strings]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Countryside,1000.0,B,1299513600,"[brute force, implementation]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and File System,1500.0,C,1299513600,"[data structures, implementation]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and His Friends,2000.0,D,1299513600,"[constructive algorithms, math, number theory]",PROGRAMMING +66,Codeforces Beta Round #61 (Div. 2),2,Petya and Post,2500.0,E,1299513600,"[data structures, dp]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and Three Spells,500.0,A,1299340800,"[implementation, math]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the History of Magic,1000.0,B,1299340800,"[brute force, greedy, implementation]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the Golden Snitch,1500.0,C,1299340800,"[binary search, geometry]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and the Sorting Hat,2000.0,D,1299340800,"[brute force, dfs and similar, hashing]",PROGRAMMING +65,Codeforces Beta Round #60,12,Harry Potter and Moving Staircases,2500.0,E,1299340800,"[dfs and similar, implementation]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Sinking Ship,500.0,A,1298908800,"[implementation, sortings, strings]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Settlers' Training,1000.0,B,1298908800,[implementation],PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Bulls and Cows,1500.0,C,1298908800,"[brute force, implementation]",PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Dividing Island,2000.0,D,1298908800,[constructive algorithms],PROGRAMMING +63,Codeforces Beta Round #59 (Div. 2),2,Sweets Game,2500.0,E,1298908800,"[bitmasks, dfs and similar, dp, games, implementation]",PROGRAMMING +62,Codeforces Beta Round #58,12,A Student's Dream,500.0,A,1298649600,"[greedy, math]",PROGRAMMING +62,Codeforces Beta Round #58,12,Tyndex.Brome,1000.0,B,1298649600,"[binary search, implementation]",PROGRAMMING +62,Codeforces Beta Round #58,12,Inquisition,1500.0,C,1298649600,"[geometry, implementation, sortings]",PROGRAMMING +62,Codeforces Beta Round #58,12,Wormhouse,2000.0,D,1298649600,"[dfs and similar, graphs]",PROGRAMMING +62,Codeforces Beta Round #58,12,World Evil,2500.0,E,1298649600,"[dp, flows]",PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Ultra-Fast Mathematician,500.0,A,1298390400,[implementation],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Hard Work,1000.0,B,1298390400,[strings],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Capture Valerian,1500.0,C,1298390400,[math],PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Eternal Victory,2000.0,D,1298390400,"[dfs and similar, graphs, greedy, shortest paths, trees]",PROGRAMMING +61,Codeforces Beta Round #57 (Div. 2),2,Enemy is weak,2500.0,E,1298390400,"[data structures, trees]",PROGRAMMING +64,Unknown Language Round #1,12,Factorial,,A,1298304000,"[*special, implementation]",PROGRAMMING +64,Unknown Language Round #1,12,Expression,,B,1298304000,"[*special, expression parsing]",PROGRAMMING +64,Unknown Language Round #1,12,Table,,C,1298304000,"[*special, greedy, implementation, math]",PROGRAMMING +64,Unknown Language Round #1,12,Presents,,D,1298304000,"[*special, greedy]",PROGRAMMING +64,Unknown Language Round #1,12,Prime Segment,,E,1298304000,"[*special, brute force]",PROGRAMMING +64,Unknown Language Round #1,12,Domain,,F,1298304000,"[*special, expression parsing]",PROGRAMMING +64,Unknown Language Round #1,12,Path Canonization,,G,1298304000,[*special],PROGRAMMING +64,Unknown Language Round #1,12,Table Bowling,,H,1298304000,"[*special, sortings]",PROGRAMMING +64,Unknown Language Round #1,12,Sort the Table,,I,1298304000,"[*special, sortings]",PROGRAMMING +60,Codeforces Beta Round #56,12,Where Are My Flakes?,500.0,A,1298131200,"[implementation, two pointers]",PROGRAMMING +60,Codeforces Beta Round #56,12,Serial Time!,1000.0,B,1298131200,"[dfs and similar, dsu]",PROGRAMMING +60,Codeforces Beta Round #56,12,Mushroom Strife,1500.0,C,1298131200,"[brute force, dfs and similar]",PROGRAMMING +60,Codeforces Beta Round #56,12,Savior,2000.0,D,1298131200,"[brute force, dsu, math]",PROGRAMMING +60,Codeforces Beta Round #56,12,Mushroom Gnomes,2500.0,E,1298131200,"[math, matrices]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Word,500.0,A,1297440000,"[implementation, strings]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Fortune Telling,1000.0,B,1297440000,"[implementation, number theory]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Title,1500.0,C,1297440000,[expression parsing],PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Team Arrangement,2000.0,D,1297440000,"[constructive algorithms, greedy, implementation]",PROGRAMMING +59,Codeforces Beta Round #55 (Div. 2),2,Shortest Path,2500.0,E,1297440000,"[graphs, shortest paths]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Chat room,500.0,A,1296489600,"[greedy, strings]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Coins,1000.0,B,1296489600,[greedy],PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Trees,1500.0,C,1296489600,[brute force],PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Calendar,2000.0,D,1296489600,"[greedy, strings]",PROGRAMMING +58,Codeforces Beta Round #54 (Div. 2),2,Expression,2500.0,E,1296489600,[dp],PROGRAMMING +57,Codeforces Beta Round #53,12,Square Earth?,500.0,A,1295971200,"[dfs and similar, greedy, implementation]",PROGRAMMING +57,Codeforces Beta Round #53,12,Martian Architecture,1000.0,B,1295971200,[implementation],PROGRAMMING +57,Codeforces Beta Round #53,12,Array,1500.0,C,1295971200,"[combinatorics, math]",PROGRAMMING +57,Codeforces Beta Round #53,12,Journey,2000.0,D,1295971200,"[dp, math]",PROGRAMMING +57,Codeforces Beta Round #53,12,Chess,2500.0,E,1295971200,"[math, shortest paths]",PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Bar,500.0,A,1295626200,[implementation],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Spoilt Permutation,1000.0,B,1295626200,[implementation],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Corporation Mail,1500.0,C,1295626200,"[data structures, expression parsing, implementation]",PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Changing a String,2000.0,D,1295626200,[dp],PROGRAMMING +56,Codeforces Beta Round #52 (Div. 2),2,Domino Principle,2500.0,E,1295626200,"[binary search, data structures, sortings]",PROGRAMMING +55,Codeforces Beta Round #51,12,Flea travel,500.0,A,1294992000,"[implementation, math]",PROGRAMMING +55,Codeforces Beta Round #51,12,Smallest number,1000.0,B,1294992000,[brute force],PROGRAMMING +55,Codeforces Beta Round #51,12,Pie or die,1500.0,C,1294992000,[games],PROGRAMMING +55,Codeforces Beta Round #51,12,Beautiful numbers,2000.0,D,1294992000,"[dp, number theory]",PROGRAMMING +55,Codeforces Beta Round #51,12,Very simple problem,2500.0,E,1294992000,"[geometry, two pointers]",PROGRAMMING +54,Codeforces Beta Round #50,12,Presents,500.0,A,1294733700,[implementation],PROGRAMMING +54,Codeforces Beta Round #50,12,Cutting Jigsaw Puzzle,1000.0,B,1294733700,"[hashing, implementation]",PROGRAMMING +54,Codeforces Beta Round #50,12,First Digit Law,1500.0,C,1294733700,"[dp, math, probabilities]",PROGRAMMING +54,Codeforces Beta Round #50,12,Writing a Song,2000.0,D,1294733700,"[brute force, dp]",PROGRAMMING +54,Codeforces Beta Round #50,12,Vacuum Сleaner,2500.0,E,1294733700,[geometry],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Autocomplete,500.0,A,1294329600,[implementation],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Blog Photo,1000.0,B,1294329600,"[binary search, implementation]",PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Little Frog,1500.0,C,1294329600,[constructive algorithms],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Physical Education,2000.0,D,1294329600,[sortings],PROGRAMMING +53,Codeforces Beta Round #49 (Div. 2),2,Dead Ends,2500.0,E,1294329600,"[bitmasks, dp]",PROGRAMMING +52,Codeforces Testing Round #1,12,123-sequence,500.0,A,1294160400,[implementation],PROGRAMMING +52,Codeforces Testing Round #1,12,Right Triangles,1000.0,B,1294160400,[combinatorics],PROGRAMMING +52,Codeforces Testing Round #1,12,Circular RMQ,1500.0,C,1294160400,[data structures],PROGRAMMING +51,Codeforces Beta Round #48,12,Cheaterius's Problem,500.0,A,1293552000,[implementation],PROGRAMMING +51,Codeforces Beta Round #48,12,bHTML Tables Analisys,1000.0,B,1293552000,[expression parsing],PROGRAMMING +51,Codeforces Beta Round #48,12,Three Base Stations,1500.0,C,1293552000,"[binary search, greedy]",PROGRAMMING +51,Codeforces Beta Round #48,12,Geometrical problem,2000.0,D,1293552000,[implementation],PROGRAMMING +51,Codeforces Beta Round #48,12,Pentagon,2500.0,E,1293552000,"[combinatorics, graphs, matrices]",PROGRAMMING +51,Codeforces Beta Round #48,12,Caterpillar,3000.0,F,1293552000,"[dfs and similar, dp, graphs, trees]",PROGRAMMING +50,Codeforces Beta Round #47,12,Domino piling,500.0,A,1292862000,"[greedy, math]",PROGRAMMING +50,Codeforces Beta Round #47,12,Choosing Symbol Pairs,1000.0,B,1292862000,[strings],PROGRAMMING +50,Codeforces Beta Round #47,12,Happy Farm 5,1500.0,C,1292862000,[geometry],PROGRAMMING +50,Codeforces Beta Round #47,12,Bombing,2000.0,D,1292862000,"[binary search, dp, probabilities]",PROGRAMMING +50,Codeforces Beta Round #47,12,Square Equation Roots,2500.0,E,1292862000,[math],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Sleuth,500.0,A,1292601600,[implementation],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Sum,1000.0,B,1292601600,[math],PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Disposition,1500.0,C,1292601600,"[constructive algorithms, math]",PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Game,2000.0,D,1292601600,"[brute force, dp, implementation]",PROGRAMMING +49,Codeforces Beta Round #46 (Div. 2),2,Common ancestor,2500.0,E,1292601600,[dp],PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Rock-paper-scissors,,A,1292140800,"[implementation, schedules]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Land Lot,,B,1292140800,"[brute force, implementation]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,The Race,,C,1292140800,[math],PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Permutations,,D,1292140800,[greedy],PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Ivan the Fool VS Gorynych the Dragon,,E,1292140800,"[dp, games, graphs]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Snow sellers,,F,1292140800,"[greedy, sortings]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Galaxy Union,,G,1292140800,"[dp, trees, two pointers]",PROGRAMMING +48,School Personal Contest #3 (Winter Computer School 2010/11)
-
Codeforces Beta Round #45 (ACM-ICPC Rules),12,Black and White,,H,1292140800,[constructive algorithms],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Triangular numbers,500.0,A,1291737600,"[brute force, math]",PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Coins,1000.0,B,1291737600,[implementation],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Crossword,1500.0,C,1291737600,[implementation],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Safe,2000.0,D,1291737600,[brute force],PROGRAMMING +47,Codeforces Beta Round #44 (Div. 2),2,Cannon,2500.0,E,1291737600,"[data structures, geometry, sortings]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Ball Game,,A,1291536000,"[brute force, implementation]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,T-shirts from Sponsor,,B,1291536000,[implementation],PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hamsters and Tigers,,C,1291536000,[two pointers],PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Parking Lot,,D,1291536000,"[data structures, implementation]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Comb,,E,1291536000,"[data structures, dp]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Hercule Poirot Problem,,F,1291536000,"[dsu, graphs]",PROGRAMMING +46,School Personal Contest #2 (Winter Computer School 2010/11)
-
Codeforces Beta Round #43 (ACM-ICPC Rules),12,Emperor's Problem,,G,1291536000,[geometry],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Football,500.0,A,1291046400,[strings],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Letter,1000.0,B,1291046400,"[implementation, strings]",PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Lucky Tickets,1500.0,C,1291046400,[greedy],PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Journey,2000.0,D,1291046400,"[brute force, constructive algorithms, implementation]",PROGRAMMING +43,Codeforces Beta Round #42 (Div. 2),2,Race,2500.0,E,1291046400,"[brute force, implementation, two pointers]",PROGRAMMING +42,Codeforces Beta Round #41,12,Guilty --- to the kitchen!,500.0,A,1290096000,"[greedy, implementation]",PROGRAMMING +42,Codeforces Beta Round #41,12,Game of chess unfinished,1000.0,B,1290096000,[implementation],PROGRAMMING +42,Codeforces Beta Round #41,12,Safe cracking,1500.0,C,1290096000,"[brute force, constructive algorithms]",PROGRAMMING +42,Codeforces Beta Round #41,12,Strange town,2000.0,D,1290096000,"[constructive algorithms, math]",PROGRAMMING +42,Codeforces Beta Round #41,12,Baldman and the military,2500.0,E,1290096000,"[dfs and similar, graphs]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Codecraft III,,A,1289646000,[implementation],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,School,,B,1289646000,"[dp, dsu]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Dancing Lessons,,C,1289646000,[data structures],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Event Dates,,D,1289646000,"[greedy, meet-in-the-middle, sortings]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Director,,E,1289646000,"[constructive algorithms, greedy]",PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Goats and Wolves,,F,1289646000,[greedy],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Prime Problem,,G,1289646000,[number theory],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Road Problem,,H,1289646000,[graphs],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,TCMCF+++,,I,1289646000,[greedy],PROGRAMMING +45,School Team Contest #3 (Winter Computer School 2010/11),12,Planting Trees,,J,1289646000,[constructive algorithms],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Translation,500.0,A,1289232000,"[implementation, strings]",PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Martian Dollar,1000.0,B,1289232000,[brute force],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Email address,1500.0,C,1289232000,"[expression parsing, implementation]",PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,Pawn,2000.0,D,1289232000,[dp],PROGRAMMING +41,Codeforces Beta Round #40 (Div. 2),2,3-cycles,2500.0,E,1289232000,"[constructive algorithms, graphs, greedy]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Indian Summer,,A,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Cola,,B,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Holidays,,C,1289041200,[implementation],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Hyperdrive,,D,1289041200,[math],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Anfisa the Monkey,,E,1289041200,[dp],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,BerPaint,,F,1289041200,"[geometry, graphs]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Shooting Gallery,,G,1289041200,"[data structures, implementation]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Phone Number,,H,1289041200,[dp],PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Toys,,I,1289041200,"[brute force, combinatorics]",PROGRAMMING +44,School Team Contest #2 (Winter Computer School 2010/11),12,Triminoes,,J,1289041200,"[constructive algorithms, greedy]",PROGRAMMING +40,Codeforces Beta Round #39,12,Find Color,500.0,A,1288972800,"[constructive algorithms, implementation, math]",PROGRAMMING +40,Codeforces Beta Round #39,12,Repaintings,1000.0,B,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Berland Square,1500.0,C,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Interesting Sequence,2000.0,D,1288972800,[math],PROGRAMMING +40,Codeforces Beta Round #39,12,Number Table,2500.0,E,1288972800,[combinatorics],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Army,,A,1288440000,[implementation],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Chess,,B,1288440000,"[brute force, implementation, math]",PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Blinds,,C,1288440000,[brute force],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Vasya the Architect,,D,1288440000,[implementation],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Let's Go Rolling!,,E,1288440000,"[dp, sortings]",PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Smart Boy,,F,1288440000,"[dp, games, strings]",PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,Queue,,G,1288440000,[data structures],PROGRAMMING +38,School Personal Contest #1 (Winter Computer School 2010/11)
-
Codeforces Beta Round #38 (ACM-ICPC Rules),12,The Great Marathon,,H,1288440000,[dp],PROGRAMMING +37,Codeforces Beta Round #37,12,Towers,500.0,A,1288018800,[sortings],PROGRAMMING +37,Codeforces Beta Round #37,12,Computer Game,1000.0,B,1288018800,"[greedy, implementation]",PROGRAMMING +37,Codeforces Beta Round #37,12,Old Berland Language,1500.0,C,1288018800,"[data structures, greedy, trees]",PROGRAMMING +37,Codeforces Beta Round #37,12,Lesson Timetable,2000.0,D,1288018800,"[combinatorics, dp, math]",PROGRAMMING +37,Codeforces Beta Round #37,12,Trial for Chief,2500.0,E,1288018800,"[graphs, greedy, shortest paths]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,C*++ Calculations,,A,1287904200,"[expression parsing, greedy]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Company Income Growth,,B,1287904200,[greedy],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Moon Craters,,C,1287904200,"[dp, sortings]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Cubical Planet,,D,1287904200,[math],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,What Has Dirichlet Got to Do with That?,,E,1287904200,"[dp, games]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Pacifist frogs,,F,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Inverse Function,,G,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Multiplication Table,,H,1287904200,[implementation],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Tram,,I,1287904200,[],PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Spelling Check,,J,1287904200,"[hashing, implementation, strings]",PROGRAMMING +39,School Team Contest #1 (Winter Computer School 2010/11),12,Testing,,K,1287904200,[],PROGRAMMING +36,Codeforces Beta Round #36,12,Extra-terrestrial Intelligence,500.0,A,1287482400,[implementation],PROGRAMMING +36,Codeforces Beta Round #36,12,Fractal,1000.0,B,1287482400,[implementation],PROGRAMMING +36,Codeforces Beta Round #36,12,Bowls,1500.0,C,1287482400,"[geometry, implementation]",PROGRAMMING +36,Codeforces Beta Round #36,12,New Game with a Chess Piece,2000.0,D,1287482400,[games],PROGRAMMING +36,Codeforces Beta Round #36,12,Two Paths,2500.0,E,1287482400,"[constructive algorithms, dsu, graphs, implementation]",PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Shell Game,500.0,A,1287471600,[implementation],PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Warehouse,1000.0,B,1287471600,[implementation],PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Fire Again,1500.0,C,1287471600,"[brute force, dfs and similar, shortest paths]",PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Animals,2000.0,D,1287471600,"[dp, greedy]",PROGRAMMING +35,Codeforces Beta Round #35 (Div. 2),2,Parade,2500.0,E,1287471600,"[data structures, sortings]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Reconnaissance 2,500.0,A,1286802000,[implementation],PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Sale,1000.0,B,1286802000,"[greedy, sortings]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Page Numbers,1500.0,C,1286802000,"[expression parsing, implementation, sortings, strings]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Road Map,2000.0,D,1286802000,"[dfs and similar, graphs]",PROGRAMMING +34,Codeforces Beta Round #34 (Div. 2),2,Collisions,2500.0,E,1286802000,"[brute force, implementation, math]",PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,What is for dinner?,500.0,A,1286463600,"[greedy, implementation]",PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,String Problem,1000.0,B,1286463600,[shortest paths],PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,Wonderful Randomized Sum,1500.0,C,1286463600,[greedy],PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,Knights,2000.0,D,1286463600,"[geometry, graphs, shortest paths, sortings]",PROGRAMMING +33,Codeforces Beta Round #33 (Codeforces format),12,Helper,2500.0,E,1286463600,[],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Reconnaissance,500.0,A,1286002800,[brute force],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Borze,1000.0,B,1286002800,"[expression parsing, implementation]",PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Flea,1500.0,C,1286002800,[math],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Constellation,2000.0,D,1286002800,[implementation],PROGRAMMING +32,"Codeforces Beta Round #32 (Div. 2, Codeforces format)",2,Hide-and-Seek,2500.0,E,1286002800,"[geometry, implementation]",PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Worms Evolution,500.0,A,1285599600,[implementation],PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Sysadmin Bob,1000.0,B,1285599600,[strings],PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Schedule,1500.0,C,1285599600,[implementation],PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,Chocolate,2000.0,D,1285599600,"[dfs and similar, implementation]",PROGRAMMING +31,"Codeforces Beta Round #31 (Div. 2, Codeforces format)",2,TV Game,2500.0,E,1285599600,[dp],PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Accounting,500.0,A,1285340400,"[brute force, math]",PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Codeforces World Finals,1000.0,B,1285340400,[implementation],PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Shooting Gallery,1500.0,C,1285340400,"[dp, probabilities]",PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,King's Problem?,2000.0,D,1285340400,"[geometry, greedy]",PROGRAMMING +30,Codeforces Beta Round #30 (Codeforces format),12,Tricky and Clever Password,2500.0,E,1285340400,"[binary search, constructive algorithms, data structures, greedy, hashing, strings]",PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Spit Problem,500.0,A,1284994800,[brute force],PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Traffic Lights,1000.0,B,1284994800,[implementation],PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Mail Stamps,1500.0,C,1284994800,"[data structures, dfs and similar, graphs, implementation]",PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Ant on the Tree,2000.0,D,1284994800,"[constructive algorithms, dfs and similar, trees]",PROGRAMMING +29,"Codeforces Beta Round #29 (Div. 2, Codeforces format)",2,Quarrel,2500.0,E,1284994800,"[graphs, shortest paths]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,Bender Problem,500.0,A,1284735600,[implementation],PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,pSort,1000.0,B,1284735600,"[dfs and similar, dsu, graphs]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,Bath Queue,1500.0,C,1284735600,"[combinatorics, dp, probabilities]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,"Don't fear, DravDe is kind",2000.0,D,1284735600,"[binary search, data structures, dp, hashing]",PROGRAMMING +28,Codeforces Beta Round #28 (Codeforces format),12,DravDe saves the world,2500.0,E,1284735600,"[geometry, math]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Next Test,500.0,A,1284130800,"[implementation, sortings]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Tournament,1000.0,B,1284130800,"[bitmasks, brute force, dfs and similar, greedy]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Unordered Subsequence,1500.0,C,1284130800,"[constructive algorithms, greedy]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Ring Road 2,2000.0,D,1284130800,"[2-sat, dfs and similar, dsu, graphs]",PROGRAMMING +27,"Codeforces Beta Round #27 (Codeforces format, Div. 2)",2,Number With The Given Amount Of Divisors,2500.0,E,1284130800,"[brute force, dp, number theory]",PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Almost Prime,500.0,A,1281970800,[number theory],PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Regular Bracket Sequence,1000.0,B,1281970800,[greedy],PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Parquet,1500.0,C,1281970800,"[combinatorics, constructive algorithms]",PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Tickets,2000.0,D,1281970800,"[combinatorics, probabilities]",PROGRAMMING +26,Codeforces Beta Round #26 (Codeforces format),12,Multithreading,2500.0,E,1281970800,[constructive algorithms],PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,IQ test,,A,1280761200,[brute force],PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Phone numbers,,B,1280761200,[implementation],PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads in Berland,,C,1280761200,"[graphs, shortest paths]",PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Roads not only in Berland,,D,1280761200,"[dsu, graphs, trees]",PROGRAMMING +25,Codeforces Beta Round #25 (Div. 2 Only),2,Test,,E,1280761200,"[hashing, strings]",PROGRAMMING +24,Codeforces Beta Round #24,12,Ring road,,A,1280149200,[graphs],PROGRAMMING +24,Codeforces Beta Round #24,12,F1 Champions,,B,1280149200,[implementation],PROGRAMMING +24,Codeforces Beta Round #24,12,Sequence of points,,C,1280149200,"[geometry, implementation, math]",PROGRAMMING +24,Codeforces Beta Round #24,12,Broken robot,,D,1280149200,"[dp, probabilities]",PROGRAMMING +24,Codeforces Beta Round #24,12,Berland collider,,E,1280149200,[binary search],PROGRAMMING +23,Codeforces Beta Round #23,12,You're Given a String...,,A,1278687600,"[brute force, greedy]",PROGRAMMING +23,Codeforces Beta Round #23,12,Party,,B,1278687600,"[constructive algorithms, graphs, math]",PROGRAMMING +23,Codeforces Beta Round #23,12,Oranges and Apples,,C,1278687600,"[constructive algorithms, sortings]",PROGRAMMING +23,Codeforces Beta Round #23,12,Tetragon,,D,1278687600,"[geometry, math]",PROGRAMMING +23,Codeforces Beta Round #23,12,Tree,,E,1278687600,[dp],PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Second Order Statistics,,A,1277823600,[brute force],PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Bargaining Table,,B,1277823600,"[brute force, dp]",PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,System Administrator,,C,1277823600,[graphs],PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Segments,,D,1277823600,"[greedy, sortings]",PROGRAMMING +22,Codeforces Beta Round #22 (Div. 2 Only),2,Scheme,,E,1277823600,"[dfs and similar, graphs, trees]",PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Jabber ID,500.0,A,1277730300,[implementation],PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Intersection,1000.0,B,1277730300,"[implementation, math]",PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Stripe 2,1500.0,C,1277730300,"[binary search, dp, sortings]",PROGRAMMING +21,Codeforces Alpha Round #21 (Codeforces format),12,Traveling Graph,2000.0,D,1277730300,"[bitmasks, graph matchings, graphs]",PROGRAMMING +19,Codeforces Beta Round #19,12,World Football Cup,,A,1277391600,[implementation],PROGRAMMING +19,Codeforces Beta Round #19,12,Checkout Assistant,,B,1277391600,[dp],PROGRAMMING +19,Codeforces Beta Round #19,12,Deletion of Repeats,,C,1277391600,"[greedy, hashing, string suffix structures]",PROGRAMMING +19,Codeforces Beta Round #19,12,Points,,D,1277391600,[data structures],PROGRAMMING +19,Codeforces Beta Round #19,12,Fairy,,E,1277391600,"[dfs and similar, divide and conquer, dsu]",PROGRAMMING +20,Codeforces Alpha Round #20 (Codeforces format),12,BerOS file system,500.0,A,1276875000,[implementation],PROGRAMMING +20,Codeforces Alpha Round #20 (Codeforces format),12,Equation,1000.0,B,1276875000,[math],PROGRAMMING +20,Codeforces Alpha Round #20 (Codeforces format),12,Dijkstra?,1500.0,C,1276875000,"[graphs, shortest paths]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Triangle,,A,1276700400,"[brute force, geometry]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Platforms,,B,1276700400,"[brute force, math]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Stripe,,C,1276700400,"[data structures, implementation]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Seller Bob,,D,1276700400,"[brute force, dp, greedy]",PROGRAMMING +18,Codeforces Beta Round #18 (Div. 2 Only),2,Flag 2,,E,1276700400,[dp],PROGRAMMING +17,Codeforces Beta Round #17,12,Noldbach problem,,A,1276182000,"[brute force, math, number theory]",PROGRAMMING +17,Codeforces Beta Round #17,12,Hierarchy,,B,1276182000,"[dfs and similar, dsu, greedy, shortest paths]",PROGRAMMING +17,Codeforces Beta Round #17,12,Balance,,C,1276182000,[dp],PROGRAMMING +17,Codeforces Beta Round #17,12,Notepad,,D,1276182000,[number theory],PROGRAMMING +17,Codeforces Beta Round #17,12,Palisection,,E,1276182000,[strings],PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Flag,,A,1275570000,[implementation],PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Burglar and Matches,,B,1275570000,"[greedy, implementation, sortings]",PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Monitor,,C,1275570000,"[binary search, number theory]",PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Logging,,D,1275570000,"[implementation, strings]",PROGRAMMING +16,Codeforces Beta Round #16 (Div. 2 Only),2,Fish,,E,1275570000,"[bitmasks, dp, probabilities]",PROGRAMMING +15,Codeforces Beta Round #15,12,Cottage Village,,A,1275145200,"[implementation, sortings]",PROGRAMMING +15,Codeforces Beta Round #15,12,Laser,,B,1275145200,[math],PROGRAMMING +15,Codeforces Beta Round #15,12,Industrial Nim,,C,1275145200,[games],PROGRAMMING +15,Codeforces Beta Round #15,12,Map,,D,1275145200,"[data structures, implementation, sortings]",PROGRAMMING +15,Codeforces Beta Round #15,12,Triangles,,E,1275145200,"[combinatorics, dp]",PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Letter,,A,1274283000,[implementation],PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Young Photographer,,B,1274283000,[implementation],PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Four Segments,,C,1274283000,"[brute force, constructive algorithms, geometry, implementation, math]",PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Two Paths,,D,1274283000,"[dfs and similar, dp, graphs, shortest paths, trees, two pointers]",PROGRAMMING +14,Codeforces Beta Round #14 (Div. 2),2,Camels,,E,1274283000,[dp],PROGRAMMING +13,Codeforces Beta Round #13,12,Numbers,,A,1273154400,"[implementation, math]",PROGRAMMING +13,Codeforces Beta Round #13,12,Letter A,,B,1273154400,"[geometry, implementation]",PROGRAMMING +13,Codeforces Beta Round #13,12,Sequence,,C,1273154400,"[dp, sortings]",PROGRAMMING +13,Codeforces Beta Round #13,12,Triangles,,D,1273154400,"[dp, geometry]",PROGRAMMING +13,Codeforces Beta Round #13,12,Holes,,E,1273154400,"[data structures, dsu]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Super Agent,,A,1272538800,[implementation],PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Correct Solution?,,B,1272538800,"[implementation, sortings]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Fruits,,C,1272538800,"[implementation, sortings]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Ball,,D,1272538800,"[data structures, sortings]",PROGRAMMING +12,Codeforces Beta Round #12 (Div 2 Only),12,Start of the session,,E,1272538800,[constructive algorithms],PROGRAMMING +11,Codeforces Beta Round #11,12,Increasing Sequence,,A,1272294000,"[constructive algorithms, implementation, math]",PROGRAMMING +11,Codeforces Beta Round #11,12,Jumping Jack,,B,1272294000,[math],PROGRAMMING +11,Codeforces Beta Round #11,12,How Many Squares?,,C,1272294000,[implementation],PROGRAMMING +11,Codeforces Beta Round #11,12,A Simple Task,,D,1272294000,"[bitmasks, dp, graphs]",PROGRAMMING +11,Codeforces Beta Round #11,12,"Forward, march!",,E,1272294000,"[binary search, dp, greedy]",PROGRAMMING +10,Codeforces Beta Round #10,12,Power Consumption Calculation,,A,1271346300,[implementation],PROGRAMMING +10,Codeforces Beta Round #10,12,Cinema Cashier,,B,1271346300,"[dp, implementation]",PROGRAMMING +10,Codeforces Beta Round #10,12,Digital Root,,C,1271346300,[number theory],PROGRAMMING +10,Codeforces Beta Round #10,12,LCIS,,D,1271346300,[dp],PROGRAMMING +10,Codeforces Beta Round #10,12,Greedy Change,,E,1271346300,[constructive algorithms],PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Die Roll,,A,1270983600,"[math, probabilities]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Running Student,,B,1270983600,"[brute force, geometry, implementation]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Hexadecimal's Numbers,,C,1270983600,"[brute force, implementation, math]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,How many trees?,,D,1270983600,"[combinatorics, divide and conquer, dp]",PROGRAMMING +9,Codeforces Beta Round #9 (Div. 2 Only),2,Interestring graph and Apples,,E,1270983600,"[dfs and similar, dsu, graphs]",PROGRAMMING +8,Codeforces Beta Round #8,12,Train and Peter,,A,1270741500,[strings],PROGRAMMING +8,Codeforces Beta Round #8,12,Obsession with Robots,,B,1270741500,"[constructive algorithms, graphs, implementation]",PROGRAMMING +8,Codeforces Beta Round #8,12,Looking for Order,,C,1270741500,"[bitmasks, dp]",PROGRAMMING +8,Codeforces Beta Round #8,12,Two Friends,,D,1270741500,"[binary search, geometry]",PROGRAMMING +8,Codeforces Beta Round #8,12,Beads,,E,1270741500,"[dp, graphs]",PROGRAMMING +7,Codeforces Beta Round #7,12,Kalevitch and Chess,,A,1270136700,"[brute force, constructive algorithms]",PROGRAMMING +7,Codeforces Beta Round #7,12,Memory Manager,,B,1270136700,[implementation],PROGRAMMING +7,Codeforces Beta Round #7,12,Line,,C,1270136700,"[math, number theory]",PROGRAMMING +7,Codeforces Beta Round #7,12,Palindrome Degree,,D,1270136700,"[hashing, strings]",PROGRAMMING +7,Codeforces Beta Round #7,12,Defining Macros,,E,1270136700,"[dp, expression parsing, implementation]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,Triangle,,A,1269673200,"[brute force, geometry]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,President's Office,,B,1269673200,[implementation],PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,"Alice, Bob and Chocolate",,C,1269673200,"[greedy, two pointers]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,Lizards and Basements 2,,D,1269673200,"[brute force, dp]",PROGRAMMING +6,Codeforces Beta Round #6 (Div. 2 Only),2,Exposition,,E,1269673200,"[binary search, data structures, dsu, trees, two pointers]",PROGRAMMING +5,Codeforces Beta Round #5,12,Chat Servers Outgoing Traffic,,A,1269100800,[implementation],PROGRAMMING +5,Codeforces Beta Round #5,12,Center Alignment,,B,1269100800,"[implementation, strings]",PROGRAMMING +5,Codeforces Beta Round #5,12,Longest Regular Bracket Sequence,,C,1269100800,"[constructive algorithms, data structures, dp, greedy, sortings, strings]",PROGRAMMING +5,Codeforces Beta Round #5,12,Follow Traffic Rules,,D,1269100800,"[implementation, math]",PROGRAMMING +5,Codeforces Beta Round #5,12,Bindian Signalizing,,E,1269100800,[data structures],PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Watermelon,,A,1268395200,"[brute force, math]",PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Before an Exam,,B,1268395200,"[constructive algorithms, greedy]",PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Registration System,,C,1268395200,"[data structures, hashing, implementation]",PROGRAMMING +4,Codeforces Beta Round #4 (Div. 2 Only),2,Mysterious Present,,D,1268395200,"[dp, sortings]",PROGRAMMING +3,Codeforces Beta Round #3,12,Shortest path of the king,,A,1267963200,"[greedy, shortest paths]",PROGRAMMING +3,Codeforces Beta Round #3,12,Lorry,,B,1267963200,"[greedy, sortings]",PROGRAMMING +3,Codeforces Beta Round #3,12,Tic-tac-toe,,C,1267963200,"[brute force, games, implementation]",PROGRAMMING +3,Codeforces Beta Round #3,12,Least Cost Bracket Sequence,,D,1267963200,[greedy],PROGRAMMING +2,Codeforces Beta Round #2,12,Winner,,A,1267117200,"[hashing, implementation]",PROGRAMMING +2,Codeforces Beta Round #2,12,The least round way,,B,1267117200,"[dp, math]",PROGRAMMING +2,Codeforces Beta Round #2,12,Commentator problem,,C,1267117200,[geometry],PROGRAMMING +1,Codeforces Beta Round #1,12,Theatre Square,,A,1266580800,[math],PROGRAMMING +1,Codeforces Beta Round #1,12,Spreadsheet,,B,1266580800,"[implementation, math]",PROGRAMMING +1,Codeforces Beta Round #1,12,Ancient Berland Circus,,C,1266580800,"[geometry, math]",PROGRAMMING diff --git a/ui/problem_ratings.csv b/ui/problem_ratings.csv index 3024cfc..a75aa97 100644 --- a/ui/problem_ratings.csv +++ b/ui/problem_ratings.csv @@ -3756,3 +3756,258 @@ contestID,problemID,problemRating 796,D,2067 796,E,2781 796,F,5000 +975,A,978 +975,B,1191 +975,C,1394 +975,D,1994 +975,E,2834 +966,A,1715 +966,B,1750 +966,C,2111 +966,D,2619 +966,E,3037 +966,F,5000 +967,A,1350 +967,B,1130 +967,C,1717 +967,D,1877 +967,E,2316 +967,F,2803 +965,A,912 +965,B,1434 +965,C,2065 +965,D,1913 +965,E,2527 +963,A,1815 +963,B,1966 +963,C,2574 +963,D,2510 +963,E,3233 +959,A,573 +959,B,1266 +959,C,1519 +959,D,1964 +959,E,1828 +959,F,2552 +956,A,1412 +956,B,1694 +956,C,1764 +956,D,2419 +956,E,2679 +956,F,5000 +957,A,1384 +957,B,1421 +957,C,1597 +957,D,1864 +957,E,2615 +955,A,1154 +955,B,1423 +955,C,2093 +955,D,2925 +955,E,2925 +955,F,2804 +947,A,1589 +947,B,1471 +947,C,1699 +947,D,2587 +947,E,3474 +947,F,5000 +948,A,1159 +948,B,1750 +948,C,1625 +948,D,1953 +948,E,2709 +949,A,1550 +949,B,1693 +949,C,2002 +949,D,2321 +949,E,2728 +949,F,5000 +930,A,1263 +930,B,1605 +930,C,1899 +930,D,2528 +930,E,2926 +944,A,1306 +944,B,1557 +944,C,1306 +944,D,1684 +944,E,1965 +944,F,2789 +944,G,2789 +960,A,1312 +960,B,1443 +960,C,1725 +960,D,2083 +960,E,2308 +960,F,2033 +960,G,2922 +960,H,3123 +950,A,957 +950,B,1176 +950,C,1634 +950,D,1782 +950,E,2171 +950,F,2488 +980,A,972 +980,B,1567 +980,C,1696 +980,D,2341 +980,E,2361 +980,F,5000 +931,A,695 +931,B,1317 +931,C,1717 +931,D,1555 +931,E,2038 +931,F,2304 +977,A,534 +977,B,1014 +977,C,1279 +977,D,1445 +977,E,1601 +977,F,1793 +964,A,881 +964,B,1350 +964,C,1902 +964,D,2123 +964,E,2690 +976,A,832 +976,B,1349 +976,C,1551 +976,D,2437 +976,E,2067 +976,F,5000 +962,A,1330 +962,B,1352 +962,C,1410 +962,D,1638 +962,E,2125 +962,F,2724 +962,G,5000 +961,A,926 +961,B,1244 +961,C,1419 +961,D,1899 +961,E,1884 +961,F,2840 +961,G,2840 +954,A,820 +954,B,1456 +954,C,1639 +954,D,1584 +954,E,1897 +954,F,2174 +954,G,2004 +954,H,2526 +954,I,2526 +946,A,788 +946,B,1232 +946,C,1357 +946,D,1863 +946,E,2256 +946,F,2670 +946,G,2759 +938,A,878 +938,B,1127 +938,C,1732 +938,D,1960 +938,E,2309 +938,F,2793 +938,G,5000 +920,A,1090 +920,B,1301 +920,C,1453 +920,D,2587 +920,E,2024 +920,F,2026 +920,G,2281 +915,A,941 +915,B,1380 +915,C,1712 +915,D,2220 +915,E,2225 +915,F,2445 +915,G,2512 +911,A,1094 +911,B,1260 +911,C,1442 +911,D,1748 +911,E,1975 +911,F,2485 +911,G,2536 +903,A,1027 +903,B,1309 +903,C,1268 +903,D,2161 +903,E,2244 +903,F,2683 +903,G,5000 +893,A,1015 +893,B,1151 +893,C,1369 +893,D,1888 +893,E,2055 +893,F,2416 +840,A,1371 +840,B,2038 +840,C,2491 +840,D,2554 +840,E,3212 +615,A,656 +615,B,1727 +615,C,1957 +615,D,2028 +615,E,2203 +458,A,1853 +458,B,1963 +458,C,2069 +458,D,2815 +458,E,5000 +458,F,5000 +339,A,863 +339,B,1137 +339,C,1780 +339,D,1665 +339,E,2696 +335,A,1582 +335,B,1957 +335,C,2097 +335,D,2617 +335,E,5000 +335,F,5000 +245,A,1217 +245,B,1500 +245,C,2094 +245,D,1735 +245,E,1719 +245,F,5000 +245,G,5000 +245,H,5000 +241,A,1302 +241,B,2649 +241,C,1938 +241,D,3072 +241,E,2541 +241,F,2292 +241,G,1837 +183,A,1819 +183,B,1866 +183,C,2284 +183,D,2784 +183,E,2784 +108,A,1155 +108,B,1543 +108,C,1601 +108,D,1782 +108,E,2662 +11,A,972 +11,B,1451 +11,C,1840 +11,D,1885 +11,E,2469 +8,A,1267 +8,B,1329 +8,C,1759 +8,D,2342 +8,E,2258 diff --git a/ui/ui_functions.py b/ui/ui_functions.py index 167079b..fce1b43 100644 --- a/ui/ui_functions.py +++ b/ui/ui_functions.py @@ -32,28 +32,48 @@ def updateProblemData(prevFile, newFile, force): df_prev = pd.read_csv(prevFile, index_col=None, engine='c') cur_contests = api.getContestList() -# max_prev_contests = max(df_prev.contestID) tmp_list = dict(df_prev.contestID) - new_contests = [c for c in cur_contests if c not in tmp_list] -# new_contests = [c for c in cur_contests if c > max_prev_contests] + tmp_list = set([tmp_list[key] for key in tmp_list]) + + good = [] + for key in tmp_list: + try: + int(key) + good.append(int(key)) + except: + continue + + tmp_list = set(good) + + bad_contests = {} + with open('bad_contests.txt', 'r') as f: + l = [int(x) for x in f.read().split()] + for x in l: + bad_contests[x] = 1 + + new_contests = [] + for c in cur_contests: + if c not in tmp_list and c not in bad_contests: + new_contests.append(c) dflist = [] cnt = 0 for contestID in new_contests: - print " contest", contestID - try: - contestProblems = api.getProblemDataFromContest(contestID) - contestProblems = contestProblems.rename(index=str, columns={'index': 'problemID'}) - contestProblems = contestProblems.drop('contestId', 1) - dflist.append(contestProblems) - cnt += 1 - except api.ContestNotFound: - sys.stderr.write(str(contestID) + ', api returned contest not found error.') - + print " contest", contestID + try: + contestProblems = api.getProblemDataFromContest(contestID) + contestProblems = contestProblems.rename(index=str, columns={'index': 'problemID'}) + contestProblems = contestProblems.drop('contestId', 1) + dflist.append(contestProblems) + cnt += 1 + except api.ContestNotFound: + sys.stderr.write(str(contestID) + ', api returned contest not found error.') + if not dflist: - print " Problem ratings file up to date." - return + print " Problem ratings file up to date." + return + problemData = pd.concat(dflist) writeFile(problemData, newFile, force) sys.stderr.write("Successfully wrote problem data from " + str(cnt) + " contests.") @@ -67,23 +87,32 @@ def updateProblemRating(prevFile, newFile, force): df_prev = pd.read_csv(prevFile, index_col=None, engine='c') cur_contests = api.getContestList() -# max_prev_contests = max(df_prev.contestID) tmp_list = dict(df_prev.contestID) - new_contests = [c for c in cur_contests if c not in tmp_list] -# new_contests = [c for c in cur_contests if c > max_prev_contests] + tmp_list = set([tmp_list[key] for key in tmp_list]) + + bad_contests = {} + with open('bad_contests.txt', 'r') as f: + l = [int(x) for x in f.read().split()] + for x in l: + bad_contests[x] = 1 + + new_contests = [] + for c in cur_contests: + if c not in tmp_list and c not in bad_contests: + new_contests.append(c) dflist = [] cnt = 0 for contestID in new_contests: - print " contest", contestID - df = elo.get_contest_elo(contestID) - dflist.append(df) - cnt += 1 + print " contest", contestID + df = elo.get_contest_elo(contestID) + dflist.append(df) + cnt += 1 if not dflist: - print " Problem ratings file up to date." - return + print " Problem ratings file up to date." + return try: problemRatings = pd.concat(dflist) writeFile(problemRatings, newFile, force) @@ -95,18 +124,18 @@ def writeFile(data, outFile, force): # note: we can't just return a file handle here, although that would be more efficient. This is because whether we write the header or not is dependent on whether we are appending. # file handling: figure out if user wants to append or not if isfile(outFile): - if force: - sys.stderr.write(outFile + " found, -f flag set, overwriting...\n") - fh = open(outFile, 'w') - data.to_csv(fh, encoding='utf-8', index=None, header=True) - else: - sys.stderr.write(outFile + " found, opening in append mode...\n") - fh = open(outFile, 'a') - data.to_csv(fh, encoding='utf-8', index=None, header=False) + if force: + sys.stderr.write(outFile + " found, -f flag set, overwriting...\n") + fh = open(outFile, 'w') + data.to_csv(fh, encoding='utf-8', index=None, header=True) + else: + sys.stderr.write(outFile + " found, opening in append mode...\n") + fh = open(outFile, 'a') + data.to_csv(fh, encoding='utf-8', index=None, header=False) else: - sys.stderr.write(outFile + " not found, creating new file...\n") - fh = open(outFile, 'w') - data.to_csv(fh, encoding='utf-8', index=None, header=True) + sys.stderr.write(outFile + " not found, creating new file...\n") + fh = open(outFile, 'w') + data.to_csv(fh, encoding='utf-8', index=None, header=True) if __name__ == '__main__': @@ -124,20 +153,20 @@ def writeFile(data, outFile, force): print " Getting all user problem submission information for:", args.handle # always overwrite try: - df_user = api.getUserActivity(args.handle) - df_user.to_csv(args.outputUserActivityFile, header=True, index=None, encoding='utf-8') + df_user = api.getUserActivity(args.handle) + df_user.to_csv(args.outputUserActivityFile, header=True, index=None, encoding='utf-8') except api.UserNotFound: - print " **********************************************" - print " ERROR: FAILED TO UPDATE USER ACTIVITY LIST." - print " User with handle", args.handle, "was not found at codeforces. Please double check to make sure the handle was entered correctly." + print " **********************************************" + print " ERROR: FAILED TO UPDATE USER ACTIVITY LIST." + print " User with handle", args.handle, "was not found at codeforces. Please double check to make sure the handle was entered correctly." print ' ------------------------------------' print " Getting user rating history for:", args.handle # always overwrite try: - df_ratinghistory = api.getUserRatingHistory(args.handle) - df_ratinghistory.to_csv(args.outputUserRatingFile, header=True, index=None, encoding='utf-8') + df_ratinghistory = api.getUserRatingHistory(args.handle) + df_ratinghistory.to_csv(args.outputUserRatingFile, header=True, index=None, encoding='utf-8') except api.UserNotFound: - print " **********************************************" - print " ERROR: FAILED TO UPDATE USER ACTIVITY LIST." - print " User with handle", args.handle, "was not found at codeforces. Please double check to make sure the handle was entered correctly." + print " **********************************************" + print " ERROR: FAILED TO UPDATE USER ACTIVITY LIST." + print " User with handle", args.handle, "was not found at codeforces. Please double check to make sure the handle was entered correctly." diff --git a/ui/user_activity.csv b/ui/user_activity.csv index d07c8ac..8880a96 100644 --- a/ui/user_activity.csv +++ b/ui/user_activity.csv @@ -1,507 +1,498 @@ author,contestID,id,language,memoryBytes,participantType,passedTestCount,points,problem_index,problem_name,problem_tags,relativeTimeSeconds,startTimeSeconds,testset,timeMilliseconds,verdict -yj12,789,25940071,GNU C++11,3686400,PRACTICE,52,1500.0,C,Functions again,"[data structures, dp, greedy]",2147483647,1490846468,TESTS,46,OK -yj12,789,25940064,GNU C++11,0,PRACTICE,0,1500.0,C,Functions again,"[data structures, dp, greedy]",2147483647,1490846445,TESTS,0,COMPILATION_ERROR -yj12,789,25940056,GNU C++11,0,PRACTICE,0,1500.0,C,Functions again,"[data structures, dp, greedy]",2147483647,1490846397,TESTS,0,COMPILATION_ERROR -yj12,789,25930993,GNU C++11,5324800,PRACTICE,32,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",2147483647,1490815402,TESTS,62,WRONG_ANSWER -yj12,789,25930163,GNU C++11,5324800,PRACTICE,42,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",2147483647,1490814643,TESTS,62,WRONG_ANSWER -yj12,789,25926838,GNU C++11,2048000,CONTESTANT,1,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",6765,1490810265,PRETESTS,15,RUNTIME_ERROR -yj12,789,25922867,GNU C++11,3072000,CONTESTANT,0,2250.0,D,Weird journey,[graphs],5694,1490809194,PRETESTS,0,WRONG_ANSWER -yj12,789,25919398,GNU C++11,5324800,CONTESTANT,7,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",4763,1490808263,PRETESTS,46,WRONG_ANSWER -yj12,789,25916463,GNU C++11,2867200,CONTESTANT,12,1500.0,C,Functions again,"[data structures, dp, greedy]",4022,1490807522,TESTS,31,WRONG_ANSWER -yj12,789,25912326,GNU C++11,5324800,CONTESTANT,7,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",3049,1490806549,PRETESTS,77,WRONG_ANSWER -yj12,789,25909470,GNU C++11,5324800,CONTESTANT,7,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",2411,1490805912,PRETESTS,62,WRONG_ANSWER -yj12,789,25907193,GNU C++11,5324800,CONTESTANT,7,1000.0,B,Masha and geometric depression,"[brute force, implementation, math]",1917,1490805417,PRETESTS,62,WRONG_ANSWER -yj12,789,25900212,GNU C++11,2048000,CONTESTANT,31,500.0,A,Anastasia and pebbles,"[greedy, implementation, math]",278,1490803778,TESTS,31,OK -yj12,787,25776930,GNU C++11,2252800,PRACTICE,65,1000.0,B,Not Afraid,"[greedy, implementation]",2147483647,1490368739,TESTS,15,OK -yj12,787,25776575,GNU C++11,2048000,PRACTICE,58,500.0,A,The Monster,"[brute force, math]",2147483647,1490367712,TESTS,15,OK -yj12,787,25776091,GNU C++11,2048000,PRACTICE,34,500.0,A,The Monster,"[brute force, math]",2147483647,1490366457,TESTS,15,WRONG_ANSWER -yj12,787,25754882,GNU C++11,2048000,PRACTICE,2,500.0,A,The Monster,"[brute force, math]",2147483647,1490293039,TESTS,15,WRONG_ANSWER -yj12,337,25680427,GNU C++11,10240000,PRACTICE,25,2000.0,D,Book of Evil,"[dfs and similar, divide and conquer, dp, trees]",2147483647,1490073423,TESTS,156,OK -yj12,337,25680330,GNU C++11,4403200,PRACTICE,4,2000.0,D,Book of Evil,"[dfs and similar, divide and conquer, dp, trees]",2147483647,1490072812,TESTS,30,RUNTIME_ERROR -yj12,337,25674780,GNU C++11,3072000,PRACTICE,2,2000.0,D,Book of Evil,"[dfs and similar, divide and conquer, dp, trees]",2147483647,1490036213,TESTS,30,WRONG_ANSWER -yj12,505,25140854,GNU C++11,62361600,PRACTICE,53,1500.0,C,"Mr. Kitayuta, the Treasure Hunter","[dfs and similar, dp, two pointers]",2147483647,1488434612,TESTS,78,OK -yj12,678,25139901,GNU C++11,39936000,PRACTICE,41,0.0,E,Another Sith Tournament,"[bitmasks, dp]",2147483647,1488429196,TESTS,156,OK -yj12,678,25139882,GNU C++11,39936000,PRACTICE,0,0.0,E,Another Sith Tournament,"[bitmasks, dp]",2147483647,1488429097,TESTS,15,WRONG_ANSWER -yj12,678,25137564,GNU C++11,39936000,PRACTICE,3,0.0,E,Another Sith Tournament,"[bitmasks, dp]",2147483647,1488411006,TESTS,31,WRONG_ANSWER -yj12,453,25135806,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488401197,TESTS,795,OK -yj12,453,25135731,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488400898,TESTS,982,OK -yj12,453,25135713,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488400821,TESTS,2199,OK -yj12,453,25135698,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488400751,TESTS,2230,OK -yj12,453,25135665,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488400625,TESTS,2402,OK -yj12,453,25135583,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488400240,TESTS,2589,OK -yj12,453,25135482,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488399842,TESTS,2293,OK -yj12,453,25135363,GNU C++11,112435200,PRACTICE,27,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488399414,TESTS,3166,OK -yj12,453,25135252,GNU C++11,222720000,PRACTICE,6,1000.0,B,Little Pony and Harmony Chest,"[bitmasks, brute force, dp]",2147483647,1488399049,TESTS,4000,TIME_LIMIT_EXCEEDED -yj12,758,23967347,GNU C++11,2048000,CONTESTANT,9,1500.0,C,Unfair Poll,"[binary search, implementation, math]",7106,1484845406,PRETESTS,15,WRONG_ANSWER -yj12,758,23963712,GNU C++11,2048000,CONTESTANT,4,1500.0,C,Unfair Poll,"[binary search, implementation, math]",5740,1484844040,PRETESTS,15,WRONG_ANSWER -yj12,758,23955903,Python 2,4608000,CONTESTANT,16,1000.0,B,Blown Garland,[implementation],2092,1484840392,TESTS,46,RUNTIME_ERROR -yj12,758,23947741,Python 2,4608000,CONTESTANT,41,500.0,A,Holiday Of Equality,"[implementation, math]",162,1484838462,TESTS,61,OK -yj12,755,23866760,GNU C++11,3276800,PRACTICE,33,1000.0,B,PolandBall and Game,"[binary search, data structures, games, greedy, sortings]",2147483647,1484509692,TESTS,156,OK -yj12,755,23866549,GNU C++11,3276800,PRACTICE,13,1000.0,B,PolandBall and Game,"[binary search, data structures, games, greedy, sortings]",2147483647,1484509524,TESTS,155,WRONG_ANSWER -yj12,755,23860959,GNU C++11,2662400,CONTESTANT,29,1500.0,C,PolandBall and Forest,"[dfs and similar, dsu, graphs]",4616,1484504516,TESTS,78,OK -yj12,755,23854805,GNU C++11,3276800,CONTESTANT,9,1000.0,B,PolandBall and Game,"[binary search, data structures, games, greedy, sortings]",1958,1484501858,TESTS,186,WRONG_ANSWER -yj12,755,23849844,GNU C++11,6144000,CONTESTANT,63,500.0,A,PolandBall and Hypothesis,"[brute force, graphs, math]",729,1484500629,TESTS,31,OK -yj12,733,23846484,GNU C++11,2048000,PRACTICE,4,1000.0,B,Parade,[math],2147483647,1484499479,TESTS,31,WRONG_ANSWER -yj12,686,18785316,GNU C++11,102400,PRACTICE,37,1000.0,B,Little Robber Girl's Zoo,"[constructive algorithms, implementation, sortings]",2147483647,1467213620,TESTS,15,OK -yj12,686,18785282,GNU C++11,0,PRACTICE,34,500.0,A,Free Ice Cream,"[constructive algorithms, implementation]",2147483647,1467213505,TESTS,15,OK -yj12,513,18649066,GNU C++11,0,PRACTICE,32,4.0,B2,Permutations,"[bitmasks, divide and conquer, math]",2147483647,1466610102,TESTS2,15,OK -yj12,513,18648703,GNU C++11,0,PRACTICE,19,4.0,B2,Permutations,"[bitmasks, divide and conquer, math]",2147483647,1466608743,TESTS2,15,WRONG_ANSWER -yj12,513,18648677,GNU C++11,0,PRACTICE,5,4.0,B2,Permutations,"[bitmasks, divide and conquer, math]",2147483647,1466608648,TESTS2,15,WRONG_ANSWER -yj12,513,18648575,GNU C++11,0,PRACTICE,2,4.0,B2,Permutations,"[bitmasks, divide and conquer, math]",2147483647,1466608218,TESTS2,2000,TIME_LIMIT_EXCEEDED -yj12,466,18632065,GNU C++11,3993600,PRACTICE,30,1500.0,C,Number of Ways,"[binary search, brute force, data structures, dp, two pointers]",2147483647,1466520474,TESTS,124,OK -yj12,466,18631988,GNU C++11,3993600,PRACTICE,30,1500.0,C,Number of Ways,"[binary search, brute force, data structures, dp, two pointers]",2147483647,1466520139,TESTS,140,OK -yj12,466,18631970,GNU C++11,3993600,PRACTICE,26,1500.0,C,Number of Ways,"[binary search, brute force, data structures, dp, two pointers]",2147483647,1466520076,TESTS,124,WRONG_ANSWER -yj12,494,18616014,GNU C++11,716800,PRACTICE,56,500.0,A,Treasure,[greedy],2147483647,1466434331,TESTS,31,OK -yj12,494,18615618,GNU C++11,409600,PRACTICE,13,500.0,A,Treasure,[greedy],2147483647,1466433061,TESTS,31,WRONG_ANSWER -yj12,494,18615584,GNU C++11,0,PRACTICE,0,500.0,A,Treasure,[greedy],2147483647,1466432940,TESTS,0,WRONG_ANSWER -yj12,494,18615554,GNU C++11,409600,PRACTICE,13,500.0,A,Treasure,[greedy],2147483647,1466432851,TESTS,31,WRONG_ANSWER -yj12,494,18615529,GNU C++11,0,PRACTICE,0,500.0,A,Treasure,[greedy],2147483647,1466432753,TESTS,0,WRONG_ANSWER -yj12,494,18615423,GNU C++11,716800,PRACTICE,56,500.0,A,Treasure,[greedy],2147483647,1466432384,TESTS,31,OK -yj12,494,18615376,GNU C++11,716800,PRACTICE,43,500.0,A,Treasure,[greedy],2147483647,1466432226,TESTS,31,WRONG_ANSWER -yj12,494,18615367,GNU C++11,0,PRACTICE,0,500.0,A,Treasure,[greedy],2147483647,1466432202,TESTS,15,WRONG_ANSWER -yj12,320,18607872,GNU C++11,0,PRACTICE,29,1500.0,C,Malek Dance Club,[math],2147483647,1466389932,TESTS,30,OK -yj12,464,18578468,GNU C++11,0,PRACTICE,73,500.0,A,No to Palindromes!,"[greedy, strings]",2147483647,1466251056,TESTS,15,OK -yj12,464,18578438,GNU C++11,0,PRACTICE,73,500.0,A,No to Palindromes!,"[greedy, strings]",2147483647,1466250955,TESTS,15,OK -yj12,464,18578403,GNU C++11,0,PRACTICE,1,500.0,A,No to Palindromes!,"[greedy, strings]",2147483647,1466250832,TESTS,0,WRONG_ANSWER -yj12,681,18484423,GNU C++11,26316800,PRACTICE,39,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465950728,TESTS,171,OK -yj12,681,18484360,GNU C++11,2048000,PRACTICE,0,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465950381,TESTS,15,WRONG_ANSWER -yj12,681,18484227,GNU C++11,26316800,PRACTICE,26,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465949601,TESTS,187,WRONG_ANSWER -yj12,681,18480847,GNU C++11,27750400,PRACTICE,10,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465936959,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,681,18479728,GNU C++11,27648000,PRACTICE,10,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465934595,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,681,18479658,GNU C++11,27648000,PRACTICE,10,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465934472,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,681,18479495,GNU C++11,268390400,PRACTICE,0,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465934229,TESTS,249,MEMORY_LIMIT_EXCEEDED -yj12,681,18479415,GNU C++11,26931200,PRACTICE,9,1500.0,C,Heap Operations,"[data structures, greedy]",2147483647,1465934128,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,681,18476871,GNU C++11,5529600,CONTESTANT,5,2000.0,D,Gifts by the List,"[dfs and similar, trees]",7154,1465929254,PRETESTS,234,WRONG_ANSWER -yj12,681,18475005,GNU C++11,5529600,CONTESTANT,5,2000.0,D,Gifts by the List,"[dfs and similar, trees]",6394,1465928494,PRETESTS,1000,TIME_LIMIT_EXCEEDED -yj12,681,18466725,GNU C++11,2252800,CONTESTANT,63,1000.0,B,Economy Game,[brute force],2944,1465925044,TESTS,15,OK -yj12,681,18466674,GNU C++11,2048000,CONTESTANT,0,2000.0,D,Gifts by the List,"[dfs and similar, trees]",2929,1465925029,PRETESTS,15,WRONG_ANSWER -yj12,681,18459506,GNU C++11,2048000,CONTESTANT,7,1000.0,B,Economy Game,[brute force],737,1465922837,CHALLENGES,15,CHALLENGED -yj12,681,18456570,GNU C++11,2252800,CONTESTANT,60,500.0,A,A Good Contest,[implementation],271,1465922371,TESTS,15,OK -yj12,625,18351219,GNU C++11,2252800,PRACTICE,83,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1465527370,TESTS,15,OK -yj12,625,18351194,GNU C++11,2252800,PRACTICE,58,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1465527160,TESTS,15,WRONG_ANSWER -yj12,625,18351189,GNU C++11,0,PRACTICE,0,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1465527142,TESTS,0,COMPILATION_ERROR -yj12,625,18351185,GNU C++11,2252800,PRACTICE,52,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1465527106,TESTS,15,WRONG_ANSWER -yj12,338,18345097,GNU C++11,2252800,PRACTICE,73,500.0,A,Quiz,"[greedy, math, number theory]",2147483647,1465490971,TESTS,30,OK -yj12,338,18345052,GNU C++11,2252800,PRACTICE,43,500.0,A,Quiz,"[greedy, math, number theory]",2147483647,1465490780,TESTS,30,WRONG_ANSWER -yj12,338,18345013,GNU C++11,2252800,PRACTICE,36,500.0,A,Quiz,"[greedy, math, number theory]",2147483647,1465490614,TESTS,30,WRONG_ANSWER -yj12,338,18344255,GNU C++11,2048000,PRACTICE,2,500.0,A,Quiz,"[greedy, math, number theory]",2147483647,1465487120,TESTS,0,WRONG_ANSWER -yj12,680,18331203,GNU C++11,2252800,PRACTICE,59,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",2147483647,1465421212,TESTS,30,OK -yj12,680,18331039,GNU C++11,2252800,PRACTICE,5,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",2147483647,1465420463,TESTS,0,WRONG_ANSWER -yj12,680,18330997,GNU C++11,2048000,PRACTICE,5,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",2147483647,1465420325,TESTS,15,WRONG_ANSWER -yj12,680,18330969,GNU C++11,2048000,PRACTICE,2,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",2147483647,1465420209,TESTS,0,IDLENESS_LIMIT_EXCEEDED -yj12,680,18330718,GNU C++11,2048000,PRACTICE,5,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",2147483647,1465418979,TESTS,0,WRONG_ANSWER -yj12,680,18322297,GNU C++11,2252800,CONTESTANT,59,1750.0,C,Bear and Prime 100,"[constructive algorithms, number theory]",5185,1465408885,TESTS,15,OK -yj12,680,18312889,GNU C++11,2252800,CONTESTANT,24,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",2247,1465405947,TESTS,15,OK -yj12,680,18311642,GNU C++11,2252800,CONTESTANT,6,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",1948,1465405648,PRETESTS,15,WRONG_ANSWER -yj12,680,18310914,GNU C++11,2048000,CONTESTANT,2,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",1773,1465405473,PRETESTS,15,WRONG_ANSWER -yj12,680,18310650,GNU C++11,2048000,CONTESTANT,6,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",1705,1465405405,PRETESTS,15,WRONG_ANSWER -yj12,680,18308998,GNU C++11,2252800,CONTESTANT,6,1000.0,B,Bear and Finding Criminals,"[constructive algorithms, implementation]",1359,1465405059,PRETESTS,15,WRONG_ANSWER -yj12,680,18303129,Python 2,4812800,CONTESTANT,48,500.0,A,Bear and Five Cards,"[constructive algorithms, implementation]",307,1465404007,TESTS,62,OK -yj12,677,18301769,GNU C++11,2252800,PRACTICE,29,500.0,A,Vanya and Fence,[implementation],2147483647,1465402237,TESTS,31,OK -yj12,101021,18300457,GNU C++11,2150400,GYM,38,0.0,A,Guess the Number,[],2147483647,1465399228,TESTS,15,OK -yj12,101021,18300364,GNU C++11,2048000,GYM,1,0.0,A,Guess the Number,[],2147483647,1465398970,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,101021,18300345,GNU C++11,2048000,GYM,0,0.0,A,Guess the Number,[],2147483647,1465398932,TESTS,15,WRONG_ANSWER -yj12,101021,18300319,GNU C++11,2048000,GYM,0,0.0,A,Guess the Number,[],2147483647,1465398761,TESTS,15,WRONG_ANSWER -yj12,101021,18300302,GNU C++11,2048000,GYM,0,0.0,A,Guess the Number,[],2147483647,1465398708,TESTS,0,WRONG_ANSWER -yj12,101021,18300210,GNU C++11,2048000,GYM,0,0.0,A,Guess the Number,[],2147483647,1465398479,TESTS,15,WRONG_ANSWER -yj12,101021,18300120,GNU C++11,2048000,GYM,0,0.0,A,Guess the Number,[],2147483647,1465398241,TESTS,0,WRONG_ANSWER -yj12,426,18133485,GNU C++,2252800,PRACTICE,43,1500.0,C,Sereja and Swaps,"[brute force, sortings, two pointers]",2147483647,1464448597,TESTS,171,OK -yj12,426,18133232,GNU C++,2048000,PRACTICE,2,1500.0,C,Sereja and Swaps,"[brute force, sortings, two pointers]",2147483647,1464447580,TESTS,15,WRONG_ANSWER -yj12,426,18133162,GNU C++,0,PRACTICE,0,1500.0,C,Sereja and Swaps,"[brute force, sortings, two pointers]",2147483647,1464447330,TESTS,0,COMPILATION_ERROR -yj12,426,18107650,GNU C++,2048000,PRACTICE,2,1500.0,C,Sereja and Swaps,"[brute force, sortings, two pointers]",2147483647,1464281841,TESTS,15,WRONG_ANSWER -yj12,676,18107186,Python 2,4710400,PRACTICE,121,1000.0,B,Pyramid of Glasses,[implementation],2147483647,1464279654,TESTS,62,OK -yj12,676,18107164,Python 2,4710400,PRACTICE,3,1000.0,B,Pyramid of Glasses,[implementation],2147483647,1464279530,TESTS,46,RUNTIME_ERROR -yj12,676,18106372,GNU C++,2457600,PRACTICE,117,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464276404,TESTS,31,OK -yj12,676,18105398,GNU C++,3276800,PRACTICE,37,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464271845,TESTS,15,WRONG_ANSWER -yj12,676,18097074,GNU C++,3276800,PRACTICE,117,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464234782,TESTS,31,OK -yj12,676,18097063,GNU C++,3481600,PRACTICE,37,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464234753,TESTS,31,WRONG_ANSWER -yj12,676,18097056,GNU C++,3481600,PRACTICE,90,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464234716,TESTS,31,WRONG_ANSWER -yj12,676,18096970,GNU C++,3276800,PRACTICE,37,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464234302,TESTS,30,WRONG_ANSWER -yj12,676,18096949,GNU C++,3276800,PRACTICE,22,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464234183,TESTS,31,WRONG_ANSWER -yj12,676,18096723,GNU C++,3276800,PRACTICE,16,1500.0,C,Vasya and String,"[binary search, dp, two pointers]",2147483647,1464232891,TESTS,31,WRONG_ANSWER -yj12,669,18008041,GNU C++,2252800,PRACTICE,36,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463762375,TESTS,1029,OK -yj12,669,18007832,GNU C++,2252800,PRACTICE,36,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761461,TESTS,1434,OK -yj12,669,18007815,GNU C++,2048000,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761410,TESTS,1091,WRONG_ANSWER -yj12,669,18007794,GNU C++,2048000,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761320,TESTS,951,WRONG_ANSWER -yj12,669,18007788,GNU C++,2252800,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761283,TESTS,967,WRONG_ANSWER -yj12,669,18007761,GNU C++,2048000,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761161,TESTS,936,WRONG_ANSWER -yj12,669,18007746,GNU C++,2048000,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463761110,TESTS,982,WRONG_ANSWER -yj12,669,18007697,GNU C++,2252800,PRACTICE,10,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463760918,TESTS,935,WRONG_ANSWER -yj12,669,18007208,GNU C++,2252800,PRACTICE,7,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463758865,TESTS,15,WRONG_ANSWER -yj12,669,18007157,GNU C++,2048000,PRACTICE,6,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463758656,TESTS,15,WRONG_ANSWER -yj12,669,18006901,GNU C++,2048000,PRACTICE,3,2000.0,D,Little Artem and Dance,"[data structures, implementation, math]",2147483647,1463757533,TESTS,15,WRONG_ANSWER -yj12,536,17995079,GNU C++,2252800,PRACTICE,58,500.0,A,Tavas and Karafs,"[binary search, math]",2147483647,1463678133,TESTS,139,OK -yj12,536,17994927,GNU C++,2252800,PRACTICE,58,500.0,A,Tavas and Karafs,"[binary search, math]",2147483647,1463677483,TESTS,451,OK -yj12,536,17994919,GNU C++,2048000,PRACTICE,0,500.0,A,Tavas and Karafs,"[binary search, math]",2147483647,1463677458,TESTS,0,WRONG_ANSWER -yj12,536,17994818,GNU C++,2048000,PRACTICE,2,500.0,A,Tavas and Karafs,"[binary search, math]",2147483647,1463677036,TESTS,311,WRONG_ANSWER -yj12,536,17994377,GNU C++,2048000,PRACTICE,0,500.0,A,Tavas and Karafs,"[binary search, math]",2147483647,1463675446,TESTS,0,WRONG_ANSWER -yj12,675,17956864,GNU C++,2252800,PRACTICE,58,1000.0,B,Restoring Painting,"[brute force, constructive algorithms, math]",2147483647,1463431367,TESTS,31,OK -yj12,675,17956857,GNU C++,2252800,PRACTICE,5,1000.0,B,Restoring Painting,"[brute force, constructive algorithms, math]",2147483647,1463431320,TESTS,15,WRONG_ANSWER -yj12,675,17956039,GNU C++,2252800,PRACTICE,178,500.0,A,Infinite Sequence,[math],2147483647,1463427732,TESTS,15,OK -yj12,675,17956023,GNU C++,2048000,PRACTICE,2,500.0,A,Infinite Sequence,[math],2147483647,1463427688,TESTS,15,WRONG_ANSWER -yj12,675,17956019,Python 2,0,PRACTICE,0,500.0,A,Infinite Sequence,[math],2147483647,1463427677,TESTS,0,COMPILATION_ERROR -yj12,675,17955961,Python 2,4710400,PRACTICE,178,500.0,A,Infinite Sequence,[math],2147483647,1463427528,TESTS,77,OK -yj12,675,17955931,Python 2,4710400,PRACTICE,178,500.0,A,Infinite Sequence,[math],2147483647,1463427451,TESTS,62,OK -yj12,675,17955839,Python 2,4710400,PRACTICE,4,500.0,A,Infinite Sequence,[math],2147483647,1463427137,TESTS,62,WRONG_ANSWER -yj12,585,17952986,GNU C++,2252800,PRACTICE,40,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463423000,TESTS,15,OK -yj12,585,17952918,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463422963,TESTS,15,WRONG_ANSWER -yj12,585,17952126,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463422530,TESTS,15,WRONG_ANSWER -yj12,585,17951195,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463422022,TESTS,15,WRONG_ANSWER -yj12,585,17951054,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421952,TESTS,15,WRONG_ANSWER -yj12,585,17950885,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421856,TESTS,31,WRONG_ANSWER -yj12,585,17950700,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421748,TESTS,15,WRONG_ANSWER -yj12,585,17950444,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421617,TESTS,0,WRONG_ANSWER -yj12,585,17950160,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421471,TESTS,0,WRONG_ANSWER -yj12,585,17950038,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421410,TESTS,0,WRONG_ANSWER -yj12,585,17949959,GNU C++,0,PRACTICE,0,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421370,TESTS,0,COMPILATION_ERROR -yj12,585,17949770,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421268,TESTS,15,WRONG_ANSWER -yj12,585,17949697,GNU C++,2048000,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421232,TESTS,15,WRONG_ANSWER -yj12,585,17949490,GNU C++,2252800,PRACTICE,2,750.0,B,Phillip and Trains,[dfs and similar],2147483647,1463421133,TESTS,15,WRONG_ANSWER -yj12,672,17895187,GNU C++,6246400,PRACTICE,60,2000.0,D,Robin Hood,"[binary search, greedy]",2147483647,1463172064,TESTS,187,OK -yj12,672,17895170,GNU C++,6246400,PRACTICE,60,2000.0,D,Robin Hood,"[binary search, greedy]",2147483647,1463171976,TESTS,233,OK -yj12,672,17895161,GNU C++,6246400,PRACTICE,60,2000.0,D,Robin Hood,"[binary search, greedy]",2147483647,1463171921,TESTS,187,OK -yj12,672,17895150,GNU C++,6246400,PRACTICE,60,2000.0,D,Robin Hood,"[binary search, greedy]",2147483647,1463171824,TESTS,265,OK -yj12,672,17895142,GNU C++,6246400,PRACTICE,60,2000.0,D,Robin Hood,"[binary search, greedy]",2147483647,1463171730,TESTS,187,OK -yj12,671,17895083,GNU C++,2048000,PRACTICE,2,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463171288,TESTS,15,WRONG_ANSWER -yj12,671,17895070,GNU C++,2048000,PRACTICE,1,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463171147,TESTS,15,WRONG_ANSWER -yj12,671,17895063,GNU C++,0,PRACTICE,0,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463171103,TESTS,0,COMPILATION_ERROR -yj12,671,17895056,GNU C++,2048000,PRACTICE,1,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463171048,TESTS,0,WRONG_ANSWER -yj12,671,17895040,GNU C++,2252800,PRACTICE,1,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463170978,TESTS,15,WRONG_ANSWER -yj12,671,17895022,GNU C++,2048000,PRACTICE,1,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463170837,TESTS,15,WRONG_ANSWER -yj12,671,17895016,GNU C++,2252800,PRACTICE,1,1000.0,B,Robin Hood,"[binary search, greedy]",2147483647,1463170781,TESTS,0,WRONG_ANSWER -yj12,672,17894751,GNU C++,4608000,PRACTICE,148,1500.0,C,Recycling Bottles,"[brute force, geometry, greedy]",2147483647,1463169315,TESTS,61,OK -yj12,672,17894719,GNU C++,4505600,PRACTICE,7,1500.0,C,Recycling Bottles,"[brute force, geometry, greedy]",2147483647,1463169095,TESTS,46,WRONG_ANSWER -yj12,672,17894707,GNU C++,2150400,PRACTICE,0,1500.0,C,Recycling Bottles,"[brute force, geometry, greedy]",2147483647,1463169054,TESTS,0,WRONG_ANSWER -yj12,672,17858246,Python 2,23961600,CONTESTANT,24,1500.0,C,Recycling Bottles,"[brute force, geometry, greedy]",4815,1462989315,TESTS,1201,WRONG_ANSWER -yj12,672,17848446,Python 2,4812800,CONTESTANT,47,1000.0,B,Different is Good,"[constructive algorithms, implementation, strings]",632,1462985132,TESTS,61,OK -yj12,672,17846315,Python 2,4710400,CONTESTANT,37,500.0,A,Summer Camp,[implementation],176,1462984676,TESTS,46,OK -yj12,670,17800937,GNU C++,12595200,PRACTICE,96,2000.0,E,Correct Bracket Sequence Editor,"[data structures, dsu]",2147483647,1462671526,TESTS,171,OK -yj12,670,17800571,GNU C++,3788800,PRACTICE,150,500.0,D2,Magic Powder - 2,[binary search],2147483647,1462666415,TESTS,78,OK -yj12,670,17800564,GNU C++,3686400,PRACTICE,1,500.0,D2,Magic Powder - 2,[binary search],2147483647,1462666374,TESTS,0,WRONG_ANSWER -yj12,670,17800556,GNU C++,3686400,PRACTICE,4,500.0,D2,Magic Powder - 2,[binary search],2147483647,1462666292,TESTS,15,WRONG_ANSWER -yj12,673,17800431,Python 2,4710400,PRACTICE,48,1500.0,D,Bear and Two Paths,[],2147483647,1462664739,TESTS,77,OK -yj12,673,17800423,Python 2,4608000,PRACTICE,3,1500.0,D,Bear and Two Paths,[],2147483647,1462664670,TESTS,46,WRONG_ANSWER -yj12,673,17799700,GNU C++,2252800,PRACTICE,35,1000.0,C,Bear and Colors,[],2147483647,1462655148,TESTS,62,OK -yj12,673,17799698,Python 2,0,PRACTICE,0,1000.0,C,Bear and Colors,[],2147483647,1462655136,TESTS,0,COMPILATION_ERROR -yj12,673,17799463,Python 2,4812800,PRACTICE,5,1000.0,C,Bear and Colors,[],2147483647,1462653699,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,673,17797201,Python 2,4608000,CONTESTANT,3,1500.0,D,Bear and Two Paths,[],10725,1462644225,PRETESTS,46,WRONG_ANSWER -yj12,673,17796322,Python 2,4608000,CONTESTANT,3,1500.0,D,Bear and Two Paths,[],9864,1462643364,PRETESTS,61,WRONG_ANSWER -yj12,673,17795986,Python 2,4608000,CONTESTANT,3,1500.0,D,Bear and Two Paths,[],9478,1462642978,PRETESTS,46,WRONG_ANSWER -yj12,673,17789276,Python 2,10752000,CONTESTANT,51,750.0,B,Problems for Round,"[greedy, implementation]",3449,1462636949,TESTS,389,OK -yj12,673,17789113,Python 2,4608000,CONTESTANT,3,750.0,B,Problems for Round,"[greedy, implementation]",3359,1462636859,PRETESTS,46,RUNTIME_ERROR -yj12,673,17781098,Python 2,4710400,CONTESTANT,34,500.0,A,Bear and Game,[implementation],387,1462633887,TESTS,46,OK -yj12,670,17779878,GNU C++,3686400,PRACTICE,4,500.0,D2,Magic Powder - 2,[binary search],2147483647,1462632742,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,670,17744527,Python 2,15360000,CONTESTANT,125,500.0,D2,Magic Powder - 2,[binary search],7162,1462471462,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,670,17743599,Python 2,4608000,CONTESTANT,5,500.0,D2,Magic Powder - 2,[binary search],6719,1462471019,PRETESTS,61,WRONG_ANSWER -yj12,670,17740070,Python 2,4812800,CONTESTANT,119,1000.0,D1,Magic Powder - 1,"[binary search, brute force]",5178,1462469478,TESTS,998,OK -yj12,670,17737070,Python 2,79974400,CONTESTANT,138,1000.0,C,Cinema,"[implementation, sortings]",4063,1462468363,TESTS,1574,OK -yj12,670,17735579,Python 2,4710400,CONTESTANT,7,1000.0,C,Cinema,"[implementation, sortings]",3570,1462467870,PRETESTS,61,WRONG_ANSWER -yj12,670,17734017,Python 2,10342400,CONTESTANT,143,750.0,B,Game of Robots,[implementation],3100,1462467400,TESTS,124,OK -yj12,670,17729839,Python 2,4608000,CONTESTANT,7,1000.0,C,Cinema,"[implementation, sortings]",2036,1462466336,PRETESTS,46,WRONG_ANSWER -yj12,670,17729008,GNU C++,2252800,CONTESTANT,198,500.0,A,Holidays,"[brute force, constructive algorithms]",1851,1462466151,TESTS,31,OK -yj12,670,17727442,Python 2,20992000,CONTESTANT,14,500.0,A,Holidays,"[brute force, constructive algorithms]",1524,1462465824,PRETESTS,1000,TIME_LIMIT_EXCEEDED -yj12,670,17725997,Python 2,4812800,CONTESTANT,4,1000.0,C,Cinema,"[implementation, sortings]",1214,1462465514,PRETESTS,62,RUNTIME_ERROR -yj12,420,17720254,Python 2,5222400,PRACTICE,80,500.0,A,Start Up,[implementation],2147483647,1462463220,TESTS,77,OK -yj12,420,17720235,Python 2,4608000,PRACTICE,0,500.0,A,Start Up,[implementation],2147483647,1462463095,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,332,17719988,Python 2,4710400,PRACTICE,41,500.0,A,Down the Hatch!,[implementation],2147483647,1462461404,TESTS,154,OK -yj12,664,17390642,GNU C++,2252800,PRACTICE,31,1000.0,B,Rebus,[greedy],2147483647,1461087811,TESTS,15,OK -yj12,664,17390534,GNU C++,2048000,PRACTICE,1,1000.0,B,Rebus,[greedy],2147483647,1461086832,TESTS,15,WRONG_ANSWER -yj12,664,17389312,GNU C++,2048000,VIRTUAL,5,1000.0,B,Rebus,[greedy],3383,1461080483,TESTS,15,WRONG_ANSWER -yj12,664,17389290,GNU C++,2252800,VIRTUAL,45,1500.0,C,International Olympiad,[greedy],3215,1461080315,TESTS,31,OK -yj12,664,17388840,GNU C++,2252800,VIRTUAL,28,500.0,A,Complicated GCD,[math],768,1461077868,TESTS,15,OK -yj12,652,17198593,GNU C++,40550400,VIRTUAL,52,0.0,D,Nested Segments,"[data structures, sortings]",3617,1460001317,TESTS,639,OK -yj12,652,17198447,GNU C++,16691200,VIRTUAL,24,0.0,C,Foe Pairs,[two pointers],1879,1459999579,TESTS,405,OK -yj12,652,17198424,Python 2,4608000,VIRTUAL,16,0.0,B,z-sort,[sortings],1612,1459999312,TESTS,46,OK -yj12,652,17198393,Python 2,4710400,VIRTUAL,76,0.0,A,Gabriel and Caterpillar,[implementation],1090,1459998790,TESTS,62,OK -yj12,652,17198353,Python 2,4710400,VIRTUAL,15,0.0,A,Gabriel and Caterpillar,[implementation],743,1459998443,TESTS,46,WRONG_ANSWER -yj12,652,17198345,Python 2,4608000,VIRTUAL,9,0.0,A,Gabriel and Caterpillar,[implementation],633,1459998333,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,653,16866068,GNU C++,2252800,VIRTUAL,12,2000.0,D,Delivery Bears,"[binary search, flows]",7069,1458621770,TESTS,15,WRONG_ANSWER -yj12,653,16866012,GNU C++,2252800,VIRTUAL,14,2000.0,D,Delivery Bears,"[binary search, flows]",6599,1458621299,TESTS,30,WRONG_ANSWER -yj12,653,16865926,GNU C++,2150400,VIRTUAL,6,2000.0,D,Delivery Bears,"[binary search, flows]",5578,1458620278,TESTS,15,WRONG_ANSWER -yj12,653,16865836,Python 2,7884800,VIRTUAL,32,1000.0,B,Bear and Compressing,"[brute force, dfs and similar, dp, strings]",4371,1458619071,TESTS,78,OK -yj12,653,16865831,GNU C++,2150400,VIRTUAL,5,2000.0,D,Delivery Bears,"[binary search, flows]",4258,1458618958,TESTS,15,RUNTIME_ERROR -yj12,653,16865777,GNU C++,2048000,VIRTUAL,0,2000.0,D,Delivery Bears,"[binary search, flows]",3169,1458617869,TESTS,0,WRONG_ANSWER -yj12,653,16865745,Python 2,4915200,VIRTUAL,6,1000.0,B,Bear and Compressing,"[brute force, dfs and similar, dp, strings]",2638,1458617338,TESTS,61,WRONG_ANSWER -yj12,653,16865622,Python 2,4710400,VIRTUAL,84,500.0,A,Bear and Three Balls,"[brute force, implementation, sortings]",631,1458615331,TESTS,62,OK -yj12,653,16865611,GNU C++,2048000,VIRTUAL,84,500.0,A,Bear and Three Balls,"[brute force, implementation, sortings]",533,1458615233,TESTS,15,OK -yj12,653,16865607,Python 2,4608000,VIRTUAL,4,500.0,A,Bear and Three Balls,"[brute force, implementation, sortings]",473,1458615173,TESTS,46,WRONG_ANSWER -yj12,653,16865588,GNU C++,2048000,VIRTUAL,4,500.0,A,Bear and Three Balls,"[brute force, implementation, sortings]",202,1458614902,TESTS,15,WRONG_ANSWER -yj12,622,16754202,GNU C++,65331200,PRACTICE,33,0.0,E,Ants in Leaves,"[dfs and similar, greedy, trees]",2147483647,1458161512,TESTS,499,OK -yj12,622,16754184,GNU C++,0,PRACTICE,0,0.0,E,Ants in Leaves,"[dfs and similar, greedy, trees]",2147483647,1458161426,TESTS,0,WRONG_ANSWER -yj12,622,16754126,GNU C++,26931200,PRACTICE,18,0.0,E,Ants in Leaves,"[dfs and similar, greedy, trees]",2147483647,1458161196,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,622,16754119,GNU C++11,0,PRACTICE,0,0.0,E,Ants in Leaves,"[dfs and similar, greedy, trees]",2147483647,1458161184,TESTS,0,COMPILATION_ERROR -yj12,625,16685085,GNU C++11,0,PRACTICE,83,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457845051,TESTS,31,OK -yj12,625,16685060,GNU C++11,0,PRACTICE,55,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457844936,TESTS,15,WRONG_ANSWER -yj12,625,16653186,GNU C++11,0,PRACTICE,11,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457713714,TESTS,15,WRONG_ANSWER -yj12,625,16651380,GNU C++11,0,PRACTICE,34,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457709338,TESTS,15,WRONG_ANSWER -yj12,625,16651207,GNU C++11,0,PRACTICE,47,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457708787,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,625,16651181,GNU C++11,0,PRACTICE,10,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457708699,TESTS,30,WRONG_ANSWER -yj12,625,16641991,GNU C++11,0,PRACTICE,10,750.0,A,Guest From the Past,"[implementation, math]",2147483647,1457663558,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,651,16635702,GNU C++11,33177600,PRACTICE,71,1500.0,C,Watchmen,"[data structures, geometry, implementation, sortings]",2147483647,1457625426,TESTS,763,OK -yj12,651,16635696,GNU C++11,0,PRACTICE,0,2000.0,D,Image Preview,"[binary search, dp, two pointers]",2147483647,1457625400,TESTS,0,WRONG_ANSWER -yj12,651,16635453,GNU C++11,0,PRACTICE,0,2000.0,D,Image Preview,"[binary search, dp, two pointers]",2147483647,1457624544,TESTS,15,WRONG_ANSWER -yj12,651,16635355,GNU C++11,33177600,PRACTICE,71,1500.0,C,Watchmen,"[data structures, geometry, implementation, sortings]",2147483647,1457624190,TESTS,1621,OK -yj12,651,16627368,GNU C++11,0,PRACTICE,2,1500.0,C,Watchmen,"[data structures, geometry, implementation, sortings]",2147483647,1457586368,TESTS,15,WRONG_ANSWER -yj12,651,16627059,GNU C++11,0,PRACTICE,31,1000.0,B,Beautiful Paintings,"[greedy, sortings]",2147483647,1457583672,TESTS,15,OK -yj12,651,16626727,GNU C++11,0,PRACTICE,39,500.0,A,Joysticks,"[dp, greedy]",2147483647,1457580856,TESTS,15,OK -yj12,582,16605697,GNU C++11,102400,PRACTICE,54,750.0,A,GCD Table,"[constructive algorithms, greedy]",2147483647,1457458309,TESTS,639,OK -yj12,635,16595985,GNU C++,3174400,PRACTICE,61,1000.0,B,Island Puzzle,[],2147483647,1457416409,TESTS,93,OK -yj12,635,16595966,GNU C++,3174400,PRACTICE,61,1000.0,B,Island Puzzle,[],2147483647,1457416253,TESTS,748,OK -yj12,635,16595772,GNU C++,0,PRACTICE,71,1500.0,C,XOR Equation,[dp],2147483647,1457414719,TESTS,15,OK -yj12,635,16595733,GNU C++,0,PRACTICE,8,1500.0,C,XOR Equation,[dp],2147483647,1457414386,TESTS,15,WRONG_ANSWER -yj12,635,16595491,GNU C++,0,PRACTICE,4,1500.0,C,XOR Equation,[dp],2147483647,1457412722,TESTS,15,WRONG_ANSWER -yj12,635,16594484,GNU C++,0,PRACTICE,3,1500.0,C,XOR Equation,[dp],2147483647,1457402415,TESTS,15,WRONG_ANSWER -yj12,631,16561510,Python 2,22732800,PRACTICE,27,500.0,A,Interview,"[brute force, implementation]",2147483647,1457336365,TESTS,655,OK -yj12,631,16561483,Python 2,22937600,PRACTICE,17,500.0,A,Interview,"[brute force, implementation]",2147483647,1457336197,TESTS,685,WRONG_ANSWER -yj12,631,16561374,Python 2,204800,PRACTICE,3,500.0,A,Interview,"[brute force, implementation]",2147483647,1457335203,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,629,16561198,GNU C++,204800,PRACTICE,76,1000.0,B,Far Relative’s Problem,[brute force],2147483647,1457333986,TESTS,46,OK -yj12,629,16560977,GNU C++,64819200,PRACTICE,60,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457331884,TESTS,140,OK -yj12,629,16560954,GNU C++,64819200,PRACTICE,50,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457331664,TESTS,124,RUNTIME_ERROR -yj12,629,16560754,Python 2,123494400,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457329840,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,629,16560741,Python 2,0,PRACTICE,0,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457329776,TESTS,30,RUNTIME_ERROR -yj12,629,16560713,Python 2,122675200,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457329525,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,629,16560710,Python 2,120832000,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457329473,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,629,16560663,Python 2,122675200,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457329076,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,629,16560658,Python 2,0,PRACTICE,0,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457328990,TESTS,62,WRONG_ANSWER -yj12,629,16560656,Python 2,0,PRACTICE,0,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457328951,TESTS,46,WRONG_ANSWER -yj12,629,16560615,Python 2,122675200,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457328562,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,629,16560570,Python 2,122675200,PRACTICE,8,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457328228,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,629,16560553,Python 2,4300800,PRACTICE,4,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457327977,TESTS,311,WRONG_ANSWER -yj12,629,16560543,Python 2,4300800,PRACTICE,3,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457327875,TESTS,311,WRONG_ANSWER -yj12,629,16560541,Python 2,0,PRACTICE,0,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457327848,TESTS,31,WRONG_ANSWER -yj12,629,16560528,Python 2,4300800,PRACTICE,3,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457327763,TESTS,327,WRONG_ANSWER -yj12,629,16560290,Python 2,307200,PRACTICE,3,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457325005,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,629,16560277,Python 2,307200,PRACTICE,3,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457324761,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,629,16560264,Python 2,307200,PRACTICE,3,1750.0,C,Famil Door and Brackets,"[dp, strings]",2147483647,1457324543,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,402,16302808,Python 2,0,PRACTICE,21,1500.0,C,Searching for Graph,"[brute force, constructive algorithms]",2147483647,1456287348,TESTS,62,OK -yj12,402,16302789,Python 2,0,PRACTICE,2,1500.0,C,Searching for Graph,"[brute force, constructive algorithms]",2147483647,1456287185,TESTS,46,WRONG_ANSWER -yj12,235,16299484,Python 2,0,PRACTICE,87,500.0,A,LCM Challenge,[number theory],2147483647,1456258752,TESTS,92,OK -yj12,235,16299419,Python 2,0,PRACTICE,31,500.0,A,LCM Challenge,[number theory],2147483647,1456258478,TESTS,122,WRONG_ANSWER -yj12,235,16299383,Python 2,0,PRACTICE,4,500.0,A,LCM Challenge,[number theory],2147483647,1456258347,TESTS,122,WRONG_ANSWER -yj12,235,16299189,Python 2,0,PRACTICE,32,500.0,A,LCM Challenge,[number theory],2147483647,1456257410,TESTS,122,WRONG_ANSWER -yj12,235,16299065,Python 2,0,PRACTICE,31,500.0,A,LCM Challenge,[number theory],2147483647,1456256902,TESTS,122,WRONG_ANSWER -yj12,624,15814070,GNU C++,1024000,PRACTICE,106,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454620324,TESTS,468,OK -yj12,624,15813690,Python 2,3686400,PRACTICE,14,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454619102,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,624,15813612,Python 2,3686400,PRACTICE,13,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454618894,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,624,15813231,Python 2,5632000,PRACTICE,14,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454617806,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,624,15813043,Python 2,0,PRACTICE,2,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454617325,TESTS,46,WRONG_ANSWER -yj12,624,15812672,Python 2,5529600,PRACTICE,25,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454616506,TESTS,389,WRONG_ANSWER -yj12,624,15812412,Python 2,5632000,PRACTICE,13,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454616031,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,624,15812079,Python 2,0,PRACTICE,2,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454615529,TESTS,46,WRONG_ANSWER -yj12,624,15811628,Python 2,5529600,PRACTICE,14,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454614896,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,624,15811557,Python 2,0,PRACTICE,0,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454614846,TESTS,0,COMPILATION_ERROR -yj12,624,15811483,Python 2,0,PRACTICE,57,1000.0,B,Making a String,"[greedy, sortings]",2147483647,1454614800,TESTS,46,OK -yj12,624,15811260,Python 2,0,PRACTICE,0,1500.0,C,Graph and String,"[constructive algorithms, dfs and similar, graphs]",2147483647,1454614601,TESTS,0,COMPILATION_ERROR -yj12,624,15811240,Python 2,0,PRACTICE,50,1000.0,B,Making a String,"[greedy, sortings]",2147483647,1454614558,TESTS,62,WRONG_ANSWER -yj12,624,15811023,Python 2,0,PRACTICE,30,500.0,A,Save Luke,[math],2147483647,1454614310,TESTS,62,OK -yj12,618,15723397,Python 2,0,PRACTICE,23,1000.0,B,Guess the Permutation,[constructive algorithms],2147483647,1454296035,TESTS,46,OK -yj12,618,15723392,Python 2,0,PRACTICE,0,1000.0,B,Guess the Permutation,[constructive algorithms],2147483647,1454295997,TESTS,31,WRONG_ANSWER -yj12,618,15723383,PyPy 2,0,PRACTICE,0,1000.0,B,Guess the Permutation,[constructive algorithms],2147483647,1454295941,TESTS,61,WRONG_ANSWER -yj12,568,12796586,GNU C++,25600000,PRACTICE,27,500.0,A,Primes or Palindromes?,"[brute force, implementation, math, number theory]",2147483647,1441077747,TESTS,218,OK -yj12,568,12796561,GNU C++,25600000,PRACTICE,0,500.0,A,Primes or Palindromes?,"[brute force, implementation, math, number theory]",2147483647,1441077454,TESTS,202,WRONG_ANSWER -yj12,568,12796553,GNU C++,25600000,PRACTICE,0,500.0,A,Primes or Palindromes?,"[brute force, implementation, math, number theory]",2147483647,1441077361,TESTS,187,WRONG_ANSWER -yj12,574,12767079,GNU C++,204800,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440881433,TESTS,46,OK -yj12,574,12766974,Python 2,1126400,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440880888,TESTS,1809,OK -yj12,574,12766949,Python 2,1024000,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440880720,TESTS,1715,OK -yj12,574,12766617,Python 2,1024000,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440878702,TESTS,1715,OK -yj12,574,12766597,Python 2,1024000,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440878648,TESTS,1731,OK -yj12,574,12766590,Python 2,1024000,PRACTICE,39,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440878627,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,574,12766573,Python 2,1024000,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440878574,TESTS,1700,OK -yj12,574,12766565,Python 2,1024000,PRACTICE,39,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440878534,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,574,12766326,Python 2,921600,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440877642,TESTS,1731,OK -yj12,574,12766313,Python 2,716800,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440877609,TESTS,1731,OK -yj12,574,12766288,Python 2,819200,PRACTICE,39,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440877555,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,574,12765918,Python 2,921600,PRACTICE,40,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440876673,TESTS,1731,OK -yj12,574,12765468,Python 2,614400,PRACTICE,4,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440875907,TESTS,61,WRONG_ANSWER -yj12,574,12765387,Python 2,614400,PRACTICE,6,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2147483647,1440875795,TESTS,77,WRONG_ANSWER -yj12,574,12765204,GNU C++,1638400,PRACTICE,70,1500.0,C,Bear and Poker,[number theory],2147483647,1440875582,TESTS,249,OK -yj12,574,12765175,GNU C++,0,PRACTICE,5,1500.0,C,Bear and Poker,[number theory],2147483647,1440875559,TESTS,15,WRONG_ANSWER -yj12,574,12765139,GNU C++,0,PRACTICE,5,1500.0,C,Bear and Poker,[number theory],2147483647,1440875508,TESTS,15,WRONG_ANSWER -yj12,574,12765014,GNU C++,0,PRACTICE,5,1500.0,C,Bear and Poker,[number theory],2147483647,1440875367,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,574,12764976,GNU C++,0,PRACTICE,0,1500.0,C,Bear and Poker,[number theory],2147483647,1440875327,TESTS,0,COMPILATION_ERROR -yj12,574,12764948,GNU C++,0,PRACTICE,5,1500.0,C,Bear and Poker,[number theory],2147483647,1440875288,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,574,12764903,GNU C++,0,PRACTICE,3,1500.0,C,Bear and Poker,[number theory],2147483647,1440875258,TESTS,15,WRONG_ANSWER -yj12,574,12764806,GNU C++,0,PRACTICE,5,1500.0,C,Bear and Poker,[number theory],2147483647,1440875177,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,574,12762933,Python 2,512000,CONTESTANT,14,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",7223,1440873023,TESTS,61,WRONG_ANSWER -yj12,574,12762815,Python 2,614400,CONTESTANT,6,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",7170,1440872970,PRETESTS,61,WRONG_ANSWER -yj12,574,12762749,Python 2,614400,CONTESTANT,6,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",7139,1440872939,PRETESTS,61,WRONG_ANSWER -yj12,574,12752225,Python 2,512000,CONTESTANT,7,1000.0,B,Bear and Three Musketeers,"[brute force, dfs and similar, graphs, hashing]",2278,1440868078,PRETESTS,46,SKIPPED -yj12,574,12748539,Python 2,0,CONTESTANT,35,500.0,A,Bear and Elections,[implementation],969,1440866769,TESTS,62,OK -yj12,302,12745595,GNU C++,2150400,PRACTICE,54,1000.0,B,Eugeny and Play List,"[binary search, implementation, two pointers]",2147483647,1440862822,TESTS,1528,OK -yj12,302,12745594,GNU C,0,PRACTICE,0,1000.0,B,Eugeny and Play List,"[binary search, implementation, two pointers]",2147483647,1440862804,TESTS,0,COMPILATION_ERROR -yj12,572,12651094,Python 2,614400,CONTESTANT,34,1000.0,B,Order Book,"[data structures, greedy, implementation, sortings]",1932,1440262932,TESTS,62,OK -yj12,572,12650199,Python 2,614400,CONTESTANT,8,1000.0,B,Order Book,"[data structures, greedy, implementation, sortings]",1651,1440262651,PRETESTS,62,WRONG_ANSWER -yj12,572,12645654,Python 2,7475200,CONTESTANT,52,500.0,A,Arrays,[sortings],337,1440261337,TESTS,140,OK -yj12,261,12637403,GNU C++,409600,PRACTICE,45,500.0,A,Maxim and Discounts,"[greedy, sortings]",2147483647,1440224017,TESTS,92,OK -yj12,463,12637277,GNU C++,128409600,PRACTICE,23,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440223136,TESTS,1075,OK -yj12,463,12637261,GNU C++,128409600,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440223051,TESTS,0,WRONG_ANSWER -yj12,463,12637181,GNU C++,128409600,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440222460,TESTS,15,WRONG_ANSWER -yj12,463,12637172,GNU C++,128409600,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440222391,TESTS,0,WRONG_ANSWER -yj12,463,12637143,GNU C++,128409600,PRACTICE,7,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440222220,TESTS,686,WRONG_ANSWER -yj12,463,12637094,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440221889,TESTS,670,WRONG_ANSWER -yj12,463,12636997,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440221212,TESTS,670,WRONG_ANSWER -yj12,463,12636917,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440220643,TESTS,655,RUNTIME_ERROR -yj12,463,12636910,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440220572,TESTS,654,RUNTIME_ERROR -yj12,463,12636899,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440220504,TESTS,639,RUNTIME_ERROR -yj12,463,12636801,GNU C++,32153600,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440219840,TESTS,655,RUNTIME_ERROR -yj12,463,12636768,GNU C++,32460800,PRACTICE,6,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440219568,TESTS,654,RUNTIME_ERROR -yj12,463,12611092,GNU C++,32460800,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440039448,TESTS,15,WRONG_ANSWER -yj12,463,12611066,GNU C++,32460800,PRACTICE,0,1500.0,C,Gargari and Bishops,"[greedy, hashing, implementation]",2147483647,1440039256,TESTS,15,WRONG_ANSWER -yj12,493,12580267,GNU C++,0,PRACTICE,26,1500.0,D,Vasya and Chess,"[constructive algorithms, games]",2147483647,1439840937,TESTS,15,OK -yj12,339,12580191,GNU C++,5836800,PRACTICE,55,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439840412,TESTS,310,OK -yj12,339,12580188,GNU C++,5836800,PRACTICE,0,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439840385,TESTS,30,WRONG_ANSWER -yj12,339,12580097,GNU C++,5836800,PRACTICE,6,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439839801,TESTS,218,WRONG_ANSWER -yj12,339,12580090,GNU C++,3686400,PRACTICE,6,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439839761,TESTS,248,WRONG_ANSWER -yj12,339,12580068,GNU C++,3686400,PRACTICE,6,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439839637,TESTS,218,WRONG_ANSWER -yj12,339,12580035,GNU C++,3686400,PRACTICE,6,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439839443,TESTS,218,WRONG_ANSWER -yj12,339,12579743,GNU C++,3686400,PRACTICE,6,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439837880,TESTS,248,WRONG_ANSWER -yj12,339,12579726,Python 2,0,PRACTICE,0,2000.0,D,Xenia and Bit Operations,"[data structures, trees]",2147483647,1439837807,TESTS,0,COMPILATION_ERROR -yj12,570,12516689,Python 2,0,PRACTICE,60,1000.0,B,Simple Game,"[constructive algorithms, greedy, implementation, math]",2147483647,1439492884,TESTS,62,OK -yj12,570,12516631,Python 2,0,PRACTICE,16,1000.0,B,Simple Game,"[constructive algorithms, greedy, implementation, math]",2147483647,1439492815,TESTS,46,WRONG_ANSWER -yj12,570,12516612,Python 2,204800,PRACTICE,62,500.0,A,Elections,[implementation],2147483647,1439492793,TESTS,62,OK -yj12,443,12494414,GNU C++,307200,PRACTICE,34,1000.0,B,Kolya and Tandem Repeat,[brute force],2147483647,1439482041,TESTS,1903,OK -yj12,443,12494384,GNU C++,204800,PRACTICE,9,1000.0,B,Kolya and Tandem Repeat,[brute force],2147483647,1439481933,TESTS,2000,TIME_LIMIT_EXCEEDED -yj12,443,12494091,GNU C++,307200,PRACTICE,11,1000.0,B,Kolya and Tandem Repeat,[brute force],2147483647,1439480266,TESTS,1887,WRONG_ANSWER -yj12,443,12494026,GNU C++,0,PRACTICE,4,1000.0,B,Kolya and Tandem Repeat,[brute force],2147483647,1439479784,TESTS,15,WRONG_ANSWER -yj12,569,12457253,Python 2,0,PRACTICE,33,500.0,A,Music,"[implementation, math]",2147483647,1439235531,TESTS,62,OK -yj12,569,12457245,Python 2,0,PRACTICE,0,500.0,A,Music,"[implementation, math]",2147483647,1439235509,TESTS,30,WRONG_ANSWER -yj12,569,12457219,Python 2,0,PRACTICE,19,500.0,A,Music,"[implementation, math]",2147483647,1439235433,TESTS,61,WRONG_ANSWER -yj12,569,12455689,Python 2,0,PRACTICE,14,500.0,A,Music,"[implementation, math]",2147483647,1439233118,TESTS,46,WRONG_ANSWER -yj12,569,12447371,Python 2,0,CONTESTANT,14,500.0,A,Music,"[implementation, math]",3052,1439227252,TESTS,46,WRONG_ANSWER -yj12,569,12441727,Python 2,10854400,CONTESTANT,29,1000.0,B,Inventory,[greedy],746,1439224946,TESTS,171,OK -yj12,567,12396700,GNU C++,6451200,PRACTICE,51,2000.0,D,One-Dimensional Battle Ships,"[binary search, data structures, sortings]",2147483647,1438921721,TESTS,483,OK -yj12,567,12396054,GNU C++,0,PRACTICE,4,2000.0,D,One-Dimensional Battle Ships,"[binary search, data structures, sortings]",2147483647,1438915371,TESTS,0,WRONG_ANSWER -yj12,567,12395732,GNU C++,0,PRACTICE,3,2000.0,D,One-Dimensional Battle Ships,"[binary search, data structures, sortings]",2147483647,1438911724,TESTS,15,WRONG_ANSWER -yj12,567,12394193,GNU C++,34611200,PRACTICE,81,1500.0,C,Geometric Progression,"[binary search, data structures, dp]",2147483647,1438893676,TESTS,670,OK -yj12,567,12374147,GNU C++,3174400,CONTESTANT,0,1500.0,C,Geometric Progression,"[binary search, data structures, dp]",8738,1438799138,CHALLENGES,46,WRONG_ANSWER -yj12,567,12369372,GNU C++,3174400,CONTESTANT,12,1500.0,C,Geometric Progression,"[binary search, data structures, dp]",5858,1438796258,CHALLENGES,31,CHALLENGED -yj12,567,12359067,Python 2,5734400,CONTESTANT,54,500.0,A,Lineland Mail,[implementation],1558,1438791958,TESTS,280,OK -yj12,567,12358749,GNU C++,0,CONTESTANT,0,500.0,A,Lineland Mail,[implementation],1466,1438791866,PRETESTS,0,COMPILATION_ERROR -yj12,567,12358232,Python 2,0,CONTESTANT,6,500.0,A,Lineland Mail,[implementation],1317,1438791717,PRETESTS,46,WRONG_ANSWER -yj12,567,12356561,Python 2,0,CONTESTANT,34,1000.0,B,Berland National Library,[implementation],915,1438791315,TESTS,61,OK -yj12,361,12353323,Python 2,6656000,PRACTICE,47,1000.0,B,Levko and Permutation,"[constructive algorithms, math, number theory]",2147483647,1438789786,TESTS,62,OK -yj12,361,12353311,Python 2,614400,PRACTICE,7,1000.0,B,Levko and Permutation,"[constructive algorithms, math, number theory]",2147483647,1438789741,TESTS,46,WRONG_ANSWER -yj12,361,12353292,Python 2,512000,PRACTICE,6,1000.0,B,Levko and Permutation,"[constructive algorithms, math, number theory]",2147483647,1438789630,TESTS,46,WRONG_ANSWER -yj12,361,12353274,Python 2,0,PRACTICE,3,1000.0,B,Levko and Permutation,"[constructive algorithms, math, number theory]",2147483647,1438789516,TESTS,46,WRONG_ANSWER -yj12,361,12353132,Python 2,0,PRACTICE,2,1000.0,B,Levko and Permutation,"[constructive algorithms, math, number theory]",2147483647,1438788905,TESTS,46,WRONG_ANSWER -yj12,429,12339869,GNU C++,5324800,PRACTICE,35,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1438699536,TESTS,124,OK -yj12,507,12339798,GNU C++,0,PRACTICE,62,1500.0,C,Guess Your Way Out!,"[implementation, math]",2147483647,1438699240,TESTS,31,OK -yj12,292,12329050,GNU C++,409600,PRACTICE,45,1000.0,B,Network Topology,"[graphs, implementation]",2147483647,1438622352,TESTS,92,OK -yj12,292,12328888,GNU C++,409600,PRACTICE,45,1000.0,B,Network Topology,"[graphs, implementation]",2147483647,1438621173,TESTS,716,OK -yj12,534,12327623,GNU C++,7987200,PRACTICE,99,1500.0,C,Polycarpus' Dice,[math],2147483647,1438615385,TESTS,530,OK -yj12,534,12327553,GNU C++,9625600,PRACTICE,49,1500.0,C,Polycarpus' Dice,[math],2147483647,1438615030,TESTS,483,WRONG_ANSWER -yj12,501,12320550,GNU C++,1740800,PRACTICE,49,1500.0,C,Misha and Forest,"[constructive algorithms, data structures, greedy, sortings, trees]",2147483647,1438573465,TESTS,265,OK -yj12,490,12319937,GNU C++,10649600,PRACTICE,71,1500.0,C,Hacking Cypher,"[brute force, math, strings]",2147483647,1438567951,TESTS,187,OK -yj12,490,12319934,GNU C++,0,PRACTICE,0,1500.0,C,Hacking Cypher,"[brute force, math, strings]",2147483647,1438567902,TESTS,0,WRONG_ANSWER -yj12,479,12297666,GNU C++,3276800,PRACTICE,111,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438391951,TESTS,296,OK -yj12,479,12297608,GNU C++,3276800,PRACTICE,62,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438391478,TESTS,280,WRONG_ANSWER -yj12,479,12296998,GNU C++,3276800,PRACTICE,11,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438383777,TESTS,265,WRONG_ANSWER -yj12,479,12296979,GNU C++,3276800,PRACTICE,10,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438383416,TESTS,280,WRONG_ANSWER -yj12,479,12296964,GNU C++,3174400,PRACTICE,7,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438383189,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,479,12296926,GNU C++,409600,PRACTICE,7,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438382654,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,479,12296917,GNU C++,0,PRACTICE,2,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438382446,TESTS,15,WRONG_ANSWER -yj12,479,12296911,GNU C++,0,PRACTICE,4,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438382339,TESTS,15,WRONG_ANSWER -yj12,479,12296887,GNU C++,0,PRACTICE,3,2000.0,D,Long Jumps,"[binary search, greedy, implementation]",2147483647,1438381843,TESTS,15,WRONG_ANSWER -yj12,106,12294200,GNU C++,0,PRACTICE,55,1000.0,B,Choosing Laptop,"[brute force, implementation]",2147483647,1438360246,TESTS,60,OK -yj12,337,12284453,GNU C++,0,PRACTICE,34,1000.0,B,Routine Problem,"[greedy, math, number theory]",2147483647,1438303647,TESTS,30,OK -yj12,337,12284446,GNU C++,0,PRACTICE,7,1000.0,B,Routine Problem,"[greedy, math, number theory]",2147483647,1438303585,TESTS,30,WRONG_ANSWER -yj12,337,12284438,GNU C++,0,PRACTICE,7,1000.0,B,Routine Problem,"[greedy, math, number theory]",2147483647,1438303511,TESTS,30,WRONG_ANSWER -yj12,337,12284150,GNU C++,0,PRACTICE,7,1000.0,B,Routine Problem,"[greedy, math, number theory]",2147483647,1438298627,TESTS,30,WRONG_ANSWER -yj12,493,12241956,GNU C++,4096000,PRACTICE,35,2000.0,C,Vasya and Basketball,"[binary search, brute force, implementation, sortings, two pointers]",2147483647,1438007960,TESTS,951,OK -yj12,429,12154940,GNU C++,5324800,PRACTICE,35,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1437520962,TESTS,592,OK -yj12,429,11100786,Python 2,25088000,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431623482,TESTS,592,RUNTIME_ERROR -yj12,429,11100774,Python 2,24780800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431623414,TESTS,592,RUNTIME_ERROR -yj12,429,11100757,Python 2,24678400,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431623317,TESTS,592,RUNTIME_ERROR -yj12,429,11100263,Python 2,1126400,PRACTICE,7,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431619528,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,429,11100174,Python 2,0,PRACTICE,1,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431619033,TESTS,46,WRONG_ANSWER -yj12,429,11100078,Python 2,22220800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431618328,TESTS,623,RUNTIME_ERROR -yj12,429,11099960,Python 2,22118400,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431617272,TESTS,608,RUNTIME_ERROR -yj12,429,11099949,Python 2,22118400,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431617160,TESTS,608,RUNTIME_ERROR -yj12,429,11099902,Python 2,23244800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431616718,TESTS,592,WRONG_ANSWER -yj12,429,11099821,Python 2,22220800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431616135,TESTS,639,WRONG_ANSWER -yj12,429,11099812,Python 2,22323200,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431616080,TESTS,607,WRONG_ANSWER -yj12,429,11099778,Python 2,22118400,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431615825,TESTS,638,WRONG_ANSWER -yj12,429,11099663,Python 2,22220800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431614990,TESTS,592,RUNTIME_ERROR -yj12,429,11099658,Python 2,26828800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431614924,TESTS,639,RUNTIME_ERROR -yj12,429,11099616,Python 2,28364800,PRACTICE,12,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431614624,TESTS,639,RUNTIME_ERROR -yj12,429,11099454,Python 2,0,PRACTICE,1,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431613611,TESTS,46,WRONG_ANSWER -yj12,429,11099385,Python 2,0,PRACTICE,1,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431613128,TESTS,31,WRONG_ANSWER -yj12,429,11099058,Python 2,0,PRACTICE,2,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431611046,TESTS,31,WRONG_ANSWER -yj12,429,11095661,Python 2,0,PRACTICE,1,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431586543,TESTS,31,WRONG_ANSWER -yj12,429,11095653,Python 2,0,PRACTICE,0,500.0,A,Xor-tree,"[dfs and similar, trees]",2147483647,1431586508,TESTS,46,WRONG_ANSWER -yj12,343,11058950,Python 2,0,PRACTICE,53,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431222996,TESTS,92,OK -yj12,343,11058898,Python 2,614400,PRACTICE,29,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431222300,TESTS,248,RUNTIME_ERROR -yj12,343,11058874,Python 2,0,PRACTICE,5,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431222021,TESTS,92,WRONG_ANSWER -yj12,343,11058869,Python 2,0,PRACTICE,0,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431221986,TESTS,92,WRONG_ANSWER -yj12,343,11058724,Python 2,614400,PRACTICE,5,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431220296,TESTS,248,RUNTIME_ERROR -yj12,343,11058721,Python 2,614400,PRACTICE,5,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431220223,TESTS,218,RUNTIME_ERROR -yj12,343,11058712,Python 2,0,PRACTICE,3,500.0,A,Rational Resistance,"[math, number theory]",2147483647,1431220105,TESTS,62,WRONG_ANSWER -yj12,389,11058571,Python 2,102400,PRACTICE,42,1000.0,B,Fox and Cross,"[greedy, implementation]",2147483647,1431217325,TESTS,358,OK -yj12,284,11058497,Python 2,307200,PRACTICE,66,1000.0,B,Cows and Poker Game,"[brute force, implementation]",2147483647,1431215596,TESTS,124,OK -yj12,337,10706225,Python 2,0,PRACTICE,18,500.0,A,Puzzles,"[dp, graph matchings, greedy]",2147483647,1429029140,TESTS,124,OK -yj12,337,10706220,Python 2,0,PRACTICE,1,500.0,A,Puzzles,"[dp, graph matchings, greedy]",2147483647,1429029066,TESTS,62,WRONG_ANSWER -yj12,441,9064116,Python 2,102400,PRACTICE,51,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418166968,TESTS,62,OK -yj12,441,9064109,Python 2,102400,PRACTICE,9,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418166806,TESTS,77,WRONG_ANSWER -yj12,441,9064107,Python 2,102400,PRACTICE,4,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418166729,TESTS,46,WRONG_ANSWER -yj12,441,9064094,Python 2,102400,PRACTICE,4,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418166524,TESTS,46,WRONG_ANSWER -yj12,441,9064027,Python 2,512000,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418165539,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,441,9063933,Python 2,512000,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418164166,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,441,9063872,Python 2,512000,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418163484,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,441,9063862,Python 2,512000,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418163380,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,441,9063855,Python 2,512000,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418163321,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,441,9063846,Python 2,819200,PRACTICE,3,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418163199,TESTS,1000,TIME_LIMIT_EXCEEDED -yj12,441,9063818,Python 2,0,PRACTICE,0,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418162955,TESTS,31,WRONG_ANSWER -yj12,441,9062577,Python 2,512000,PRACTICE,4,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418151899,TESTS,62,WRONG_ANSWER -yj12,441,9062550,Python 2,512000,PRACTICE,4,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418151595,TESTS,62,WRONG_ANSWER -yj12,441,9062497,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418151191,TESTS,61,WRONG_ANSWER -yj12,441,9062486,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418151109,TESTS,46,WRONG_ANSWER -yj12,441,9062470,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418150991,TESTS,46,WRONG_ANSWER -yj12,441,9062368,Python 2,512000,PRACTICE,4,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418150150,TESTS,46,WRONG_ANSWER -yj12,441,9062231,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418149213,TESTS,46,WRONG_ANSWER -yj12,441,9062224,Python 2,0,PRACTICE,0,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418149148,TESTS,30,RUNTIME_ERROR -yj12,441,9062162,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418148653,TESTS,31,WRONG_ANSWER -yj12,441,9062140,Python 2,0,PRACTICE,2,1000.0,B,Valera and Fruits,"[greedy, implementation]",2147483647,1418148478,TESTS,31,WRONG_ANSWER -yj12,424,9061023,Python 2,0,PRACTICE,32,500.0,A,Squats,[implementation],2147483647,1418141563,TESTS,77,OK -yj12,486,8664857,Python 2,2662400,PRACTICE,40,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415737263,TESTS,109,OK -yj12,486,8664842,Python 2,0,PRACTICE,3,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415737084,TESTS,31,WRONG_ANSWER -yj12,486,8664840,Python 2,0,PRACTICE,0,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415737043,TESTS,30,WRONG_ANSWER -yj12,486,8664822,Python 2,0,PRACTICE,4,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415736894,TESTS,46,WRONG_ANSWER -yj12,486,8664280,Python 2,2355200,PRACTICE,7,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415733458,TESTS,93,WRONG_ANSWER -yj12,486,8663941,Python 2,2457600,PRACTICE,7,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415731894,TESTS,124,RUNTIME_ERROR -yj12,486,8663905,Python 2,0,PRACTICE,1,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415731743,TESTS,31,RUNTIME_ERROR -yj12,486,8663443,Python 2,0,PRACTICE,2,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415730011,TESTS,46,WRONG_ANSWER -yj12,486,8663273,Python 2,0,PRACTICE,0,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415729502,TESTS,46,WRONG_ANSWER -yj12,486,8661999,Python 2,0,PRACTICE,1,1500.0,C,Palindrome Transformation,"[greedy, implementation]",2147483647,1415727312,TESTS,46,WRONG_ANSWER -yj12,486,8661960,Python 2,0,PRACTICE,0,1000.0,B,OR in Matrix,"[greedy, hashing, implementation]",2147483647,1415727271,TESTS,30,WRONG_ANSWER -yj12,486,8661700,Python 2,0,CONTESTANT,1,1500.0,C,Palindrome Transformation,"[greedy, implementation]",7164,1415725164,PRETESTS,46,WRONG_ANSWER -yj12,486,8660784,Python 2,0,CONTESTANT,1,1500.0,C,Palindrome Transformation,"[greedy, implementation]",6437,1415724437,PRETESTS,46,WRONG_ANSWER -yj12,486,8660715,Python 2,0,CONTESTANT,0,1500.0,C,Palindrome Transformation,"[greedy, implementation]",6375,1415724375,PRETESTS,30,WRONG_ANSWER -yj12,486,8657280,Python 2,204800,CONTESTANT,47,1000.0,B,OR in Matrix,"[greedy, hashing, implementation]",3748,1415721748,TESTS,639,OK -yj12,486,8650467,Python 2,0,CONTESTANT,39,500.0,A,Calculating Function,"[implementation, math]",267,1415718267,TESTS,61,OK -yj12,388,8527022,Python 2,0,PRACTICE,36,500.0,A,Fox and Box Accumulation,"[greedy, sortings]",2147483647,1414954522,TESTS,62,OK -yj12,433,8526743,Python 2,0,PRACTICE,50,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414952968,TESTS,62,OK -yj12,433,8526694,Python 2,0,PRACTICE,0,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414952706,TESTS,30,WRONG_ANSWER -yj12,433,8526676,Python 2,0,PRACTICE,3,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414952585,TESTS,46,WRONG_ANSWER -yj12,433,8526542,Python 2,0,PRACTICE,34,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414951762,TESTS,61,WRONG_ANSWER -yj12,433,8526530,Python 2,0,PRACTICE,0,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414951718,TESTS,31,WRONG_ANSWER -yj12,433,8526499,Python 2,0,PRACTICE,8,500.0,A,Kitahara Haruki's Gift,"[brute force, implementation]",2147483647,1414951603,TESTS,46,WRONG_ANSWER -yj12,427,6588186,Python 2,12390400,VIRTUAL,80,1000.0,B,Prison Transfer,"[data structures, implementation]",984,1399823184,TESTS,218,OK -yj12,427,6588063,Python 2,4710400,VIRTUAL,63,500.0,A,Police Recruits,[implementation],376,1399822577,TESTS,109,OK -yj12,417,6389704,Python 2,36454400,CONTESTANT,48,1500.0,C,Football,"[constructive algorithms, graphs, implementation]",2782,1397751982,TESTS,857,OK -yj12,417,6387325,Python 2,0,CONTESTANT,24,500.0,A,Elimination,"[dp, implementation, math]",1218,1397750418,TESTS,61,WRONG_ANSWER -yj12,417,6387056,Python 2,0,CONTESTANT,0,500.0,A,Elimination,"[dp, implementation, math]",1084,1397750284,PRETESTS,15,WRONG_ANSWER -yj12,417,6386181,Python 2,0,CONTESTANT,0,500.0,A,Elimination,"[dp, implementation, math]",613,1397749813,PRETESTS,15,WRONG_ANSWER -yj12,404,6385550,Python 2,512000,PRACTICE,47,500.0,A,Valera and X,[implementation],2147483647,1397748797,TESTS,46,OK -yj12,415,6288739,Python 2,9420800,PRACTICE,84,1500.0,C,Mashmokh and Numbers,"[constructive algorithms, greedy, number theory]",2147483647,1396811143,TESTS,93,OK -yj12,415,6288710,Python 2,0,PRACTICE,3,1500.0,C,Mashmokh and Numbers,"[constructive algorithms, greedy, number theory]",2147483647,1396811034,TESTS,61,WRONG_ANSWER -yj12,415,6288680,Python 2,0,PRACTICE,1,1500.0,C,Mashmokh and Numbers,"[constructive algorithms, greedy, number theory]",2147483647,1396810916,TESTS,46,WRONG_ANSWER -yj12,415,6284193,Python 2,0,CONTESTANT,3,1500.0,C,Mashmokh and Numbers,"[constructive algorithms, greedy, number theory]",5291,1396804092,PRETESTS,61,RUNTIME_ERROR -yj12,415,6280007,Python 2,8704000,CONTESTANT,47,1000.0,B,Mashmokh and Tokens,"[binary search, greedy, math]",3057,1396801857,TESTS,218,OK -yj12,415,6275397,Python 2,5427200,CONTESTANT,3,1000.0,B,Mashmokh and Tokens,"[binary search, greedy, math]",1285,1396800085,PRETESTS,140,WRONG_ANSWER -yj12,415,6275205,Python 2,0,CONTESTANT,1,1000.0,B,Mashmokh and Tokens,"[binary search, greedy, math]",1229,1396800029,PRETESTS,31,WRONG_ANSWER -yj12,415,6274564,Python 2,5836800,CONTESTANT,3,1000.0,B,Mashmokh and Tokens,"[binary search, greedy, math]",1036,1396799836,PRETESTS,140,WRONG_ANSWER -yj12,415,6272976,Python 2,0,CONTESTANT,31,500.0,A,Mashmokh and Lights,[implementation],624,1396799424,TESTS,77,OK -yj12,408,6271621,Python 2,102400,PRACTICE,20,500.0,A,Line to Cashier,[implementation],2147483647,1396798674,TESTS,62,OK -yj12,408,6271619,Python 2,0,PRACTICE,0,500.0,A,Line to Cashier,[implementation],2147483647,1396798659,TESTS,46,WRONG_ANSWER -yj12,405,6177805,Python 2,204800,PRACTICE,32,500.0,A,Gravity Flip,"[greedy, implementation, sortings]",2147483647,1396159638,TESTS,46,OK -yj12,405,6177800,Python 2,0,PRACTICE,0,500.0,A,Gravity Flip,"[greedy, implementation, sortings]",2147483647,1396159585,TESTS,46,WRONG_ANSWER +Mindjolt,859,38101536,GNU C++14,11366400,PRACTICE,35,750.0,B,Lazy Security Guard,"[brute force, math]",2147483647,1525985966,TESTS,30,OK +Mindjolt,859,38101432,GNU C++14,11366400,PRACTICE,4,750.0,B,Lazy Security Guard,"[brute force, math]",2147483647,1525985559,TESTS,30,WRONG_ANSWER +Mindjolt,579,38101258,GNU C++14,3379200,PRACTICE,36,250.0,A,Raising Bacteria,[bitmasks],2147483647,1525984630,TESTS,31,OK +Mindjolt,46,38101212,GNU C++14,3379200,PRACTICE,30,0.0,B,T-shirts from Sponsor,[implementation],2147483647,1525984406,TESTS,62,OK +Mindjolt,46,38101205,GNU C++14,3379200,PRACTICE,30,0.0,B,T-shirts from Sponsor,[implementation],2147483647,1525984406,TESTS,62,OK +Mindjolt,46,38101178,GNU C++14,3379200,PRACTICE,11,0.0,B,T-shirts from Sponsor,[implementation],2147483647,1525984205,TESTS,30,WRONG_ANSWER +Mindjolt,387,38100934,GNU C++14,3379200,PRACTICE,47,500.0,A,George and Sleep,[implementation],2147483647,1525983085,TESTS,30,OK +Mindjolt,610,38066137,GNU C++14,3379200,PRACTICE,76,500.0,A,Pasha and Stick,"[combinatorics, math]",2147483647,1525856911,TESTS,31,OK +Mindjolt,805,38065728,GNU C++14,3891200,PRACTICE,42,1000.0,B,3-palindrome,[constructive algorithms],2147483647,1525855764,TESTS,31,OK +Mindjolt,805,38065664,GNU C++14,3379200,PRACTICE,2,1000.0,B,3-palindrome,[constructive algorithms],2147483647,1525855592,TESTS,15,WRONG_ANSWER +Mindjolt,805,38065639,GNU C++14,3379200,PRACTICE,2,1000.0,B,3-palindrome,[constructive algorithms],2147483647,1525855538,TESTS,15,WRONG_ANSWER +Mindjolt,519,38064453,GNU C++14,3379200,PRACTICE,65,500.0,A,A and B and Chess,[implementation],2147483647,1525852484,TESTS,31,OK +Mindjolt,23,38062029,GNU C++14,3481600,PRACTICE,45,0.0,A,You're Given a String...,"[brute force, greedy]",2147483647,1525845416,TESTS,30,OK +Mindjolt,23,38061949,GNU C++14,3379200,PRACTICE,4,0.0,A,You're Given a String...,"[brute force, greedy]",2147483647,1525845236,TESTS,30,WRONG_ANSWER +Mindjolt,980,38036485,GNU C++14,3379200,CONTESTANT,88,1000.0,B,Marlin,[constructive algorithms],2854,1525794754,TESTS,31,OK +Mindjolt,980,38028329,GNU C++14,3379200,CONTESTANT,69,500.0,A,Links and Pearls,"[implementation, math]",630,1525792530,TESTS,31,OK +Mindjolt,980,38027462,GNU C++14,3379200,CONTESTANT,4,500.0,A,Links and Pearls,"[implementation, math]",507,1525792407,PRETESTS,15,RUNTIME_ERROR +Mindjolt,460,38022154,GNU C++14,3379200,PRACTICE,26,500.0,A,Vasya and Socks,"[brute force, implementation, math]",2147483647,1525786979,TESTS,31,OK +Mindjolt,460,38022067,GNU C++14,3686400,PRACTICE,6,500.0,A,Vasya and Socks,"[brute force, implementation, math]",2147483647,1525786771,TESTS,15,WRONG_ANSWER +Mindjolt,460,38022007,GNU C++14,3584000,PRACTICE,0,500.0,A,Vasya and Socks,"[brute force, implementation, math]",2147483647,1525786645,TESTS,1000,TIME_LIMIT_EXCEEDED +Mindjolt,952,36884908,PyPy 2,0,PRACTICE,0,0.0,C,Ravioli Sort,[implementation],2147483647,1522689332,TESTS,0,COMPILATION_ERROR +Mindjolt,952,36884870,PyPy 2,22835200,PRACTICE,4,0.0,C,Ravioli Sort,[implementation],2147483647,1522689243,TESTS,77,WRONG_ANSWER +Mindjolt,952,36884750,GNU C++,3481600,PRACTICE,15,0.0,A,Quirky Quantifiers,[math],2147483647,1522688971,TESTS,15,OK +Mindjolt,952,36884740,GNU C++,0,PRACTICE,0,0.0,A,Quirky Quantifiers,[math],2147483647,1522688944,TESTS,0,COMPILATION_ERROR +Mindjolt,518,36437840,GNU C++14,3379200,PRACTICE,3,500.0,A,Vitaly and Strings,[strings],2147483647,1521562932,TESTS,30,WRONG_ANSWER +Mindjolt,518,36437826,PyPy 2,0,PRACTICE,0,500.0,A,Vitaly and Strings,[strings],2147483647,1521562885,TESTS,0,COMPILATION_ERROR +Mindjolt,518,36437814,GNU C++,0,PRACTICE,0,500.0,A,Vitaly and Strings,[strings],2147483647,1521562816,TESTS,0,COMPILATION_ERROR +Mindjolt,208,36437725,PyPy 2,22835200,PRACTICE,71,500.0,A,Dubstep,[strings],2147483647,1521562528,TESTS,280,OK +Mindjolt,208,36437709,GNU C++,0,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1521562490,TESTS,0,COMPILATION_ERROR +Mindjolt,877,36294078,GNU C++,2048000,PRACTICE,2,1000.0,B,Nikita and string,"[brute force, dp]",2147483647,1521104242,TESTS,0,WRONG_ANSWER +Mindjolt,271,36231394,GNU C++,2048000,PRACTICE,4,1500.0,C,Secret,"[constructive algorithms, implementation]",2147483647,1520876378,TESTS,30,WRONG_ANSWER +Mindjolt,271,36231349,GNU C++,2048000,PRACTICE,5,1500.0,C,Secret,"[constructive algorithms, implementation]",2147483647,1520876249,TESTS,996,WRONG_ANSWER +Mindjolt,271,36231276,GNU C++,2048000,PRACTICE,4,1500.0,C,Secret,"[constructive algorithms, implementation]",2147483647,1520876060,TESTS,30,WRONG_ANSWER +Mindjolt,689,36224508,GNU C++,2150400,PRACTICE,94,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520859511,TESTS,15,OK +Mindjolt,689,36224471,GNU C++,2150400,PRACTICE,9,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520859437,TESTS,15,WRONG_ANSWER +Mindjolt,689,36224412,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520859294,TESTS,0,WRONG_ANSWER +Mindjolt,689,35974480,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520274604,TESTS,15,WRONG_ANSWER +Mindjolt,689,35974459,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520274514,TESTS,15,WRONG_ANSWER +Mindjolt,689,35972031,GNU C++,2048000,PRACTICE,24,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520267804,TESTS,15,WRONG_ANSWER +Mindjolt,689,35971993,GNU C++,2150400,PRACTICE,24,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520267713,TESTS,15,WRONG_ANSWER +Mindjolt,689,35971970,GNU C++,2048000,PRACTICE,0,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520267654,TESTS,0,WRONG_ANSWER +Mindjolt,689,35970872,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520264949,TESTS,0,WRONG_ANSWER +Mindjolt,689,35970804,GNU C++,2048000,PRACTICE,8,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520264788,TESTS,15,WRONG_ANSWER +Mindjolt,689,35970717,GNU C++,2048000,PRACTICE,1,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520264556,TESTS,15,WRONG_ANSWER +Mindjolt,689,35969713,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520262236,TESTS,15,WRONG_ANSWER +Mindjolt,689,35968528,GNU C++,2048000,PRACTICE,8,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520259756,TESTS,15,WRONG_ANSWER +Mindjolt,689,35968464,GNU C++,2150400,PRACTICE,8,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520259623,TESTS,15,WRONG_ANSWER +Mindjolt,689,35968230,GNU C++,2048000,PRACTICE,0,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520259073,TESTS,0,WRONG_ANSWER +Mindjolt,689,35968205,GNU C++,2048000,PRACTICE,0,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520259034,TESTS,0,WRONG_ANSWER +Mindjolt,689,35968187,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520259000,TESTS,15,WRONG_ANSWER +Mindjolt,689,35968143,GNU C++,2048000,PRACTICE,2,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520258934,TESTS,0,WRONG_ANSWER +Mindjolt,689,35968134,GNU C++,0,PRACTICE,0,500.0,A,Mike and Cellphone,"[brute force, constructive algorithms, implementation]",2147483647,1520258917,TESTS,0,COMPILATION_ERROR +Mindjolt,467,35808431,GNU C++,2048000,PRACTICE,43,1000.0,B,Fedor and New Game,"[bitmasks, brute force, constructive algorithms, implementation]",2147483647,1519899945,TESTS,15,OK +Mindjolt,467,35806478,GNU C++,2048000,PRACTICE,5,1000.0,B,Fedor and New Game,"[bitmasks, brute force, constructive algorithms, implementation]",2147483647,1519894315,TESTS,15,WRONG_ANSWER +Mindjolt,467,35806454,GNU C++,2048000,PRACTICE,3,1000.0,B,Fedor and New Game,"[bitmasks, brute force, constructive algorithms, implementation]",2147483647,1519894234,TESTS,15,WRONG_ANSWER +Mindjolt,467,35806222,GNU C++,2048000,PRACTICE,5,1000.0,B,Fedor and New Game,"[bitmasks, brute force, constructive algorithms, implementation]",2147483647,1519893568,TESTS,15,WRONG_ANSWER +Mindjolt,257,35780076,GNU C++,2150400,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810543,TESTS,560,WRONG_ANSWER +Mindjolt,257,35780018,GNU C++,2150400,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810394,TESTS,592,WRONG_ANSWER +Mindjolt,257,35780009,GNU C++,2048000,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810368,TESTS,592,WRONG_ANSWER +Mindjolt,257,35779982,GNU C++,2048000,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810298,TESTS,592,WRONG_ANSWER +Mindjolt,257,35779940,GNU C++,2150400,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810212,TESTS,592,WRONG_ANSWER +Mindjolt,257,35779908,GNU C++,2048000,PRACTICE,2,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810146,TESTS,30,WRONG_ANSWER +Mindjolt,257,35779895,GNU C++,0,PRACTICE,0,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810105,TESTS,0,COMPILATION_ERROR +Mindjolt,257,35779889,GNU C++,0,PRACTICE,0,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810092,TESTS,0,COMPILATION_ERROR +Mindjolt,257,35779871,GNU C++,0,PRACTICE,0,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519810055,TESTS,0,COMPILATION_ERROR +Mindjolt,257,35779737,GNU C++,2252800,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519809712,TESTS,592,WRONG_ANSWER +Mindjolt,257,35779651,GNU C++,2252800,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519809504,TESTS,654,WRONG_ANSWER +Mindjolt,257,35779525,GNU C++,2252800,PRACTICE,5,1500.0,C,View Angle,"[brute force, geometry, math]",2147483647,1519809219,TESTS,592,WRONG_ANSWER +Mindjolt,257,35778811,GNU C++,2150400,PRACTICE,0,500.0,A,Sockets,"[greedy, implementation, sortings]",2147483647,1519807374,TESTS,0,WRONG_ANSWER +Mindjolt,257,35778779,GNU C++,2048000,PRACTICE,0,500.0,A,Sockets,"[greedy, implementation, sortings]",2147483647,1519807303,TESTS,30,WRONG_ANSWER +Mindjolt,257,35778772,GNU C++,0,PRACTICE,0,500.0,A,Sockets,"[greedy, implementation, sortings]",2147483647,1519807277,TESTS,0,COMPILATION_ERROR +Mindjolt,116,35763851,GNU C++,2048000,PRACTICE,71,500.0,A,Tram,[implementation],2147483647,1519738510,TESTS,30,OK +Mindjolt,363,35763684,GNU C++,2662400,PRACTICE,51,1000.0,B,Fence,"[brute force, dp]",2147483647,1519738250,TESTS,218,OK +Mindjolt,363,35763643,GNU C++,2048000,PRACTICE,1,1000.0,B,Fence,"[brute force, dp]",2147483647,1519738178,TESTS,0,WRONG_ANSWER +Mindjolt,363,35763595,GNU C++,2048000,PRACTICE,2,1000.0,B,Fence,"[brute force, dp]",2147483647,1519738107,TESTS,0,WRONG_ANSWER +Mindjolt,363,35763569,GNU C++,2048000,PRACTICE,1,1000.0,B,Fence,"[brute force, dp]",2147483647,1519738061,TESTS,15,WRONG_ANSWER +Mindjolt,363,35763553,GNU C++,2048000,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519738025,TESTS,15,WRONG_ANSWER +Mindjolt,363,35763524,GNU C++,2048000,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737976,TESTS,0,WRONG_ANSWER +Mindjolt,363,35763500,GNU C++,2048000,PRACTICE,1,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737928,TESTS,15,WRONG_ANSWER +Mindjolt,363,35763468,GNU C++,2048000,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737858,TESTS,0,WRONG_ANSWER +Mindjolt,363,35763404,GNU C++,2048000,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737730,TESTS,0,WRONG_ANSWER +Mindjolt,363,35763376,GNU C++,2048000,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737687,TESTS,0,WRONG_ANSWER +Mindjolt,363,35763368,GNU C++,0,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1519737666,TESTS,0,COMPILATION_ERROR +Mindjolt,186,35763135,GNU C++,2457600,PRACTICE,53,500.0,A,Comparing Strings,"[implementation, strings]",2147483647,1519737247,TESTS,92,OK +Mindjolt,186,35763118,GNU C++,0,PRACTICE,0,500.0,A,Comparing Strings,"[implementation, strings]",2147483647,1519737224,TESTS,0,COMPILATION_ERROR +Mindjolt,186,35762988,GNU C++,2048000,PRACTICE,4,500.0,A,Comparing Strings,"[implementation, strings]",2147483647,1519737006,TESTS,30,WRONG_ANSWER +Mindjolt,186,35762860,GNU C++,2457600,PRACTICE,31,500.0,A,Comparing Strings,"[implementation, strings]",2147483647,1519736820,TESTS,92,WRONG_ANSWER +Mindjolt,143,35762723,GNU C++,2048000,PRACTICE,52,500.0,A,Help Vasilisa the Wise 2,"[brute force, math]",2147483647,1519736608,TESTS,30,OK +Mindjolt,143,35762681,GNU C++,2048000,PRACTICE,5,500.0,A,Help Vasilisa the Wise 2,"[brute force, math]",2147483647,1519736537,TESTS,30,WRONG_ANSWER +Mindjolt,143,35762628,GNU C++,2048000,PRACTICE,5,500.0,A,Help Vasilisa the Wise 2,"[brute force, math]",2147483647,1519736434,TESTS,30,WRONG_ANSWER +Mindjolt,143,35762529,GNU C++,2048000,PRACTICE,3,500.0,A,Help Vasilisa the Wise 2,"[brute force, math]",2147483647,1519736315,TESTS,30,WRONG_ANSWER +Mindjolt,143,35762462,GNU C++,2048000,PRACTICE,0,500.0,A,Help Vasilisa the Wise 2,"[brute force, math]",2147483647,1519736174,TESTS,0,WRONG_ANSWER +Mindjolt,34,35762060,GNU C++,2048000,PRACTICE,20,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735499,TESTS,30,OK +Mindjolt,34,35762037,GNU C++,2048000,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735457,TESTS,0,WRONG_ANSWER +Mindjolt,34,35762024,GNU C++,0,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735432,TESTS,0,COMPILATION_ERROR +Mindjolt,34,35761999,GNU C++,0,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735389,TESTS,0,COMPILATION_ERROR +Mindjolt,34,35761986,GNU C++,0,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735363,TESTS,0,COMPILATION_ERROR +Mindjolt,34,35761963,GNU C++,0,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735307,TESTS,0,COMPILATION_ERROR +Mindjolt,34,35761946,GNU C++,0,PRACTICE,0,500.0,A,Reconnaissance 2,[implementation],2147483647,1519735272,TESTS,0,COMPILATION_ERROR +Mindjolt,43,35729455,GNU C++,2150400,PRACTICE,34,500.0,A,Football,[strings],2147483647,1519644161,TESTS,30,OK +Mindjolt,43,35729261,GNU C++,0,PRACTICE,0,500.0,A,Football,[strings],2147483647,1519643778,TESTS,0,COMPILATION_ERROR +Mindjolt,43,35729242,GNU C++,2048000,PRACTICE,0,500.0,A,Football,[strings],2147483647,1519643730,TESTS,0,WRONG_ANSWER +Mindjolt,43,35729199,GNU C++,2048000,PRACTICE,0,500.0,A,Football,[strings],2147483647,1519643655,TESTS,0,WRONG_ANSWER +Mindjolt,43,35729184,GNU C++,0,PRACTICE,0,500.0,A,Football,[strings],2147483647,1519643625,TESTS,0,COMPILATION_ERROR +Mindjolt,43,35729164,GNU C++,0,PRACTICE,0,500.0,A,Football,[strings],2147483647,1519643568,TESTS,0,COMPILATION_ERROR +Mindjolt,224,35678415,GNU C++17,1945600,PRACTICE,27,500.0,A,Parallelepiped,"[brute force, math]",2147483647,1519560697,TESTS,30,OK +Mindjolt,224,35678385,GNU C++17,1945600,PRACTICE,13,500.0,A,Parallelepiped,"[brute force, math]",2147483647,1519560645,TESTS,30,WRONG_ANSWER +Mindjolt,224,35678235,GNU C++17,0,PRACTICE,0,500.0,A,Parallelepiped,"[brute force, math]",2147483647,1519560393,TESTS,0,COMPILATION_ERROR +Mindjolt,488,35677924,GNU C++17,1945600,PRACTICE,35,500.0,A,Giga Tower,[brute force],2147483647,1519559866,TESTS,15,OK +Mindjolt,488,35677872,GNU C++17,1843200,PRACTICE,0,500.0,A,Giga Tower,[brute force],2147483647,1519559772,TESTS,0,WRONG_ANSWER +Mindjolt,488,35677829,GNU C++17,1843200,PRACTICE,0,500.0,A,Giga Tower,[brute force],2147483647,1519559698,TESTS,0,WRONG_ANSWER +Mindjolt,488,35677800,GNU C++,0,PRACTICE,0,500.0,A,Giga Tower,[brute force],2147483647,1519559653,TESTS,0,COMPILATION_ERROR +Mindjolt,389,35571129,GNU C++,2048000,PRACTICE,34,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297825,TESTS,15,OK +Mindjolt,389,35571086,GNU C++,2048000,PRACTICE,0,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297718,TESTS,187,WRONG_ANSWER +Mindjolt,389,35571032,GNU C++,2048000,PRACTICE,0,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297579,TESTS,0,WRONG_ANSWER +Mindjolt,389,35570967,GNU C++,2048000,PRACTICE,0,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297406,TESTS,15,WRONG_ANSWER +Mindjolt,389,35570890,GNU C++,0,PRACTICE,0,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297209,TESTS,0,COMPILATION_ERROR +Mindjolt,389,35570862,GNU C++,2048000,PRACTICE,0,500.0,A,Fox and Number Game,"[greedy, math]",2147483647,1519297148,TESTS,0,WRONG_ANSWER +Mindjolt,300,35570341,GNU C++,2048000,PRACTICE,20,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295744,TESTS,30,OK +Mindjolt,300,35570294,GNU C++,2048000,PRACTICE,1,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295639,TESTS,30,WRONG_ANSWER +Mindjolt,300,35570265,GNU C++,2048000,PRACTICE,0,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295550,TESTS,0,WRONG_ANSWER +Mindjolt,300,35570248,GNU C++,0,PRACTICE,0,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295507,TESTS,0,COMPILATION_ERROR +Mindjolt,300,35570193,GNU C++,0,PRACTICE,0,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295379,TESTS,0,COMPILATION_ERROR +Mindjolt,300,35570148,GNU C++,0,PRACTICE,0,500.0,A,Array,"[brute force, constructive algorithms, implementation]",2147483647,1519295232,TESTS,0,COMPILATION_ERROR +Mindjolt,114,35569733,GNU C++,2048000,PRACTICE,64,500.0,A,Cifera,[math],2147483647,1519293823,TESTS,30,OK +Mindjolt,114,35569710,GNU C++,2048000,PRACTICE,0,500.0,A,Cifera,[math],2147483647,1519293772,TESTS,30,WRONG_ANSWER +Mindjolt,114,35569702,GNU C++,0,PRACTICE,0,500.0,A,Cifera,[math],2147483647,1519293751,TESTS,0,COMPILATION_ERROR +Mindjolt,114,35569681,GNU C++,2048000,PRACTICE,0,500.0,A,Cifera,[math],2147483647,1519293666,TESTS,30,WRONG_ANSWER +Mindjolt,114,35569669,GNU C++,0,PRACTICE,0,500.0,A,Cifera,[math],2147483647,1519293640,TESTS,0,COMPILATION_ERROR +Mindjolt,114,35569660,GNU C++,0,PRACTICE,0,500.0,A,Cifera,[math],2147483647,1519293603,TESTS,0,COMPILATION_ERROR +Mindjolt,353,35569529,GNU C++,2048000,PRACTICE,59,500.0,A,Domino,"[implementation, math]",2147483647,1519293201,TESTS,30,OK +Mindjolt,353,35569518,GNU C++,0,PRACTICE,0,500.0,A,Domino,"[implementation, math]",2147483647,1519293175,TESTS,0,COMPILATION_ERROR +Mindjolt,353,35569480,GNU C++,2048000,PRACTICE,1,500.0,A,Domino,"[implementation, math]",2147483647,1519293037,TESTS,30,WRONG_ANSWER +Mindjolt,353,35569467,GNU C++,0,PRACTICE,0,500.0,A,Domino,"[implementation, math]",2147483647,1519293008,TESTS,0,COMPILATION_ERROR +Mindjolt,353,35569459,GNU C++,0,PRACTICE,0,500.0,A,Domino,"[implementation, math]",2147483647,1519292972,TESTS,0,COMPILATION_ERROR +Mindjolt,353,35569409,GNU C++,2048000,PRACTICE,2,500.0,A,Domino,"[implementation, math]",2147483647,1519292735,TESTS,30,WRONG_ANSWER +Mindjolt,353,35569338,GNU C++,2048000,PRACTICE,3,500.0,A,Domino,"[implementation, math]",2147483647,1519292508,TESTS,30,WRONG_ANSWER +Mindjolt,353,35569316,GNU C++,2048000,PRACTICE,2,500.0,A,Domino,"[implementation, math]",2147483647,1519292466,TESTS,30,WRONG_ANSWER +Mindjolt,353,35569303,GNU C++,0,PRACTICE,0,500.0,A,Domino,"[implementation, math]",2147483647,1519292440,TESTS,0,COMPILATION_ERROR +Mindjolt,353,35569284,GNU C++,0,PRACTICE,0,500.0,A,Domino,"[implementation, math]",2147483647,1519292395,TESTS,0,COMPILATION_ERROR +Mindjolt,353,35569233,GNU C++,2048000,PRACTICE,2,500.0,A,Domino,"[implementation, math]",2147483647,1519292245,TESTS,30,WRONG_ANSWER +Mindjolt,353,35569213,GNU C++,2048000,PRACTICE,7,500.0,A,Domino,"[implementation, math]",2147483647,1519292170,TESTS,30,WRONG_ANSWER +Mindjolt,353,35569184,GNU C++,2048000,PRACTICE,7,500.0,A,Domino,"[implementation, math]",2147483647,1519292022,TESTS,30,WRONG_ANSWER +Mindjolt,353,35518962,GNU C++,2048000,PRACTICE,0,1500.0,B,Two Heaps,"[combinatorics, constructive algorithms, greedy, implementation, math, sortings]",2147483647,1519124592,TESTS,0,WRONG_ANSWER +Mindjolt,265,35516579,GNU C++,2048000,PRACTICE,19,500.0,A,Colorful Stones (Simplified Edition),[implementation],2147483647,1519118039,TESTS,30,OK +Mindjolt,152,35516497,GNU C++,2150400,PRACTICE,44,500.0,A,Marks,[implementation],2147483647,1519117780,TESTS,15,OK +Mindjolt,350,35505536,GNU C++,2048000,PRACTICE,45,500.0,A,TL,"[brute force, greedy, implementation]",2147483647,1519073882,TESTS,30,OK +Mindjolt,350,35505519,GNU C++,2048000,PRACTICE,0,500.0,A,TL,"[brute force, greedy, implementation]",2147483647,1519073827,TESTS,0,WRONG_ANSWER +Mindjolt,350,35505474,GNU C++,2048000,PRACTICE,13,500.0,A,TL,"[brute force, greedy, implementation]",2147483647,1519073727,TESTS,30,WRONG_ANSWER +Mindjolt,350,35505437,GNU C++,0,PRACTICE,0,500.0,A,TL,"[brute force, greedy, implementation]",2147483647,1519073638,TESTS,0,COMPILATION_ERROR +Mindjolt,350,35505423,GNU C++,0,PRACTICE,0,500.0,A,TL,"[brute force, greedy, implementation]",2147483647,1519073611,TESTS,0,COMPILATION_ERROR +Mindjolt,189,35503222,GNU C++,2355200,PRACTICE,58,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519069874,TESTS,30,OK +Mindjolt,189,35502324,GNU C++,2355200,PRACTICE,58,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519069029,TESTS,15,OK +Mindjolt,189,35502309,GNU C++,2048000,PRACTICE,0,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519068991,TESTS,0,WRONG_ANSWER +Mindjolt,189,35501998,GNU C++,2355200,PRACTICE,37,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519066885,TESTS,1000,TIME_LIMIT_EXCEEDED +Mindjolt,189,35495071,GNU C++,2355200,PRACTICE,40,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519063043,TESTS,15,WRONG_ANSWER +Mindjolt,189,35494196,GNU C++,2355200,PRACTICE,8,500.0,A,Cut Ribbon,"[brute force, dp]",2147483647,1519062715,TESTS,15,WRONG_ANSWER +Mindjolt,152,35454676,GNU C++14,2048000,PRACTICE,60,1500.0,C,Pocket Book,[combinatorics],2147483647,1518979834,TESTS,60,OK +Mindjolt,152,35454635,GNU C++14,1843200,PRACTICE,0,1500.0,C,Pocket Book,[combinatorics],2147483647,1518979698,TESTS,30,WRONG_ANSWER +Mindjolt,152,35454617,GNU C++14,0,PRACTICE,0,1500.0,C,Pocket Book,[combinatorics],2147483647,1518979667,TESTS,0,COMPILATION_ERROR +Mindjolt,224,35454177,GNU C++14,2662400,PRACTICE,1,1000.0,B,Array,"[bitmasks, implementation, two pointers]",2147483647,1518978401,TESTS,30,WRONG_ANSWER +Mindjolt,224,35453882,GNU C++14,2662400,PRACTICE,3,1000.0,B,Array,"[bitmasks, implementation, two pointers]",2147483647,1518977615,TESTS,30,WRONG_ANSWER +Mindjolt,510,35453051,PyPy 2,31232000,PRACTICE,24,1000.0,B,Fox And Two Dots,[dfs and similar],2147483647,1518975235,TESTS,1232,OK +Mindjolt,510,35453038,PyPy 2,22528000,PRACTICE,0,1000.0,B,Fox And Two Dots,[dfs and similar],2147483647,1518975212,TESTS,77,WRONG_ANSWER +Mindjolt,510,35452870,PyPy 2,26112000,PRACTICE,9,1000.0,B,Fox And Two Dots,[dfs and similar],2147483647,1518974804,TESTS,218,RUNTIME_ERROR +Mindjolt,501,35448102,GNU C++,2048000,PRACTICE,40,500.0,A,Contest,[implementation],2147483647,1518963087,TESTS,15,OK +Mindjolt,501,35448055,GNU C++,2048000,PRACTICE,5,500.0,A,Contest,[implementation],2147483647,1518962992,TESTS,15,WRONG_ANSWER +Mindjolt,501,35447982,GNU C++,2048000,PRACTICE,0,500.0,A,Contest,[implementation],2147483647,1518962829,TESTS,15,WRONG_ANSWER +Mindjolt,262,35447872,GNU C++,2048000,PRACTICE,34,500.0,A,Roma and Lucky Numbers,[implementation],2147483647,1518962624,TESTS,30,OK +Mindjolt,165,35447750,GNU C++,2048000,PRACTICE,26,500.0,A,Supercentral Point,[implementation],2147483647,1518962356,TESTS,30,OK +Mindjolt,404,35441872,GNU C++,2048000,PRACTICE,47,500.0,A,Valera and X,[implementation],2147483647,1518946818,TESTS,46,OK +Mindjolt,404,35441790,GNU C++,2048000,PRACTICE,6,500.0,A,Valera and X,[implementation],2147483647,1518946638,TESTS,15,WRONG_ANSWER +Mindjolt,404,35441782,GNU C++,0,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518946612,TESTS,0,COMPILATION_ERROR +Mindjolt,404,35441765,GNU C++,0,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518946568,TESTS,0,COMPILATION_ERROR +Mindjolt,499,35441545,GNU C++,2048000,PRACTICE,41,500.0,A,Watching a movie,[implementation],2147483647,1518945938,TESTS,15,OK +Mindjolt,499,35441524,GNU C++,2048000,PRACTICE,0,500.0,A,Watching a movie,[implementation],2147483647,1518945889,TESTS,0,WRONG_ANSWER +Mindjolt,499,35441481,GNU C++,2048000,PRACTICE,0,500.0,A,Watching a movie,[implementation],2147483647,1518945774,TESTS,0,WRONG_ANSWER +Mindjolt,499,35441468,GNU C++,0,PRACTICE,0,500.0,A,Watching a movie,[implementation],2147483647,1518945730,TESTS,0,COMPILATION_ERROR +Mindjolt,233,35438169,GNU C++,2048000,PRACTICE,30,500.0,A,Perfect Permutation,"[implementation, math]",2147483647,1518936129,TESTS,30,OK +Mindjolt,404,35438164,GNU C++,2048000,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518936114,TESTS,0,WRONG_ANSWER +Mindjolt,404,35438095,GNU C++,2150400,PRACTICE,47,500.0,A,Valera and X,[implementation],2147483647,1518935879,TESTS,61,OK +Mindjolt,404,35438083,GNU C++,0,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518935857,TESTS,0,COMPILATION_ERROR +Mindjolt,404,35437988,GNU C++,2048000,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518935596,TESTS,0,WRONG_ANSWER +Mindjolt,404,35437981,GNU C++,0,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518935577,TESTS,0,COMPILATION_ERROR +Mindjolt,404,35437928,GNU C++,2048000,PRACTICE,0,500.0,A,Valera and X,[implementation],2147483647,1518935371,TESTS,0,WRONG_ANSWER +Mindjolt,483,35437788,GNU C++,2048000,PRACTICE,42,500.0,A,Counterexample ,"[brute force, implementation]",2147483647,1518934927,TESTS,15,OK +Mindjolt,483,35437719,GNU C++,2048000,PRACTICE,2,500.0,A,Counterexample ,"[brute force, implementation]",2147483647,1518934672,TESTS,15,WRONG_ANSWER +Mindjolt,483,35437692,GNU C++,2048000,PRACTICE,2,500.0,A,Counterexample ,"[brute force, implementation]",2147483647,1518934606,TESTS,15,WRONG_ANSWER +Mindjolt,483,35437665,GNU C++,2048000,PRACTICE,0,500.0,A,Counterexample ,"[brute force, implementation]",2147483647,1518934551,TESTS,0,WRONG_ANSWER +Mindjolt,483,35437651,GNU C++,0,PRACTICE,0,500.0,A,Counterexample ,"[brute force, implementation]",2147483647,1518934513,TESTS,0,COMPILATION_ERROR +Mindjolt,255,35431176,GNU C++,2048000,PRACTICE,61,500.0,A,Greg's Workout,[implementation],2147483647,1518900487,TESTS,30,OK +Mindjolt,255,35431143,GNU C++,2048000,PRACTICE,0,500.0,A,Greg's Workout,[implementation],2147483647,1518900369,TESTS,30,WRONG_ANSWER +Mindjolt,255,35431115,GNU C++,0,PRACTICE,0,500.0,A,Greg's Workout,[implementation],2147483647,1518900276,TESTS,0,COMPILATION_ERROR +Mindjolt,496,35335336,GNU C++,2048000,PRACTICE,19,500.0,A,Minimum Difficulty,"[brute force, implementation, math]",2147483647,1518780868,TESTS,15,OK +Mindjolt,378,35329485,GNU C++,2150400,PRACTICE,38,500.0,A,Playing with Dice,[brute force],2147483647,1518766146,TESTS,15,OK +Mindjolt,456,35329375,GNU C++,3584000,PRACTICE,46,500.0,A,Laptops,[sortings],2147483647,1518765704,TESTS,358,OK +Mindjolt,276,35329224,GNU C++,2150400,PRACTICE,35,500.0,A,Lunch Rush,[implementation],2147483647,1518765092,TESTS,122,OK +Mindjolt,276,35329206,GNU C++,2150400,PRACTICE,30,500.0,A,Lunch Rush,[implementation],2147483647,1518765032,TESTS,92,WRONG_ANSWER +Mindjolt,276,35329186,GNU C++,2150400,PRACTICE,20,500.0,A,Lunch Rush,[implementation],2147483647,1518764984,TESTS,92,WRONG_ANSWER +Mindjolt,276,35329162,GNU C++,2048000,PRACTICE,2,500.0,A,Lunch Rush,[implementation],2147483647,1518764913,TESTS,30,WRONG_ANSWER +Mindjolt,385,35328695,GNU C++,2150400,PRACTICE,32,500.0,A,Bear and Raspberry,"[brute force, greedy, implementation]",2147483647,1518763299,TESTS,15,OK +Mindjolt,151,35266842,GNU C++,2048000,PRACTICE,27,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518622345,TESTS,30,OK +Mindjolt,151,35266809,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518622295,TESTS,0,COMPILATION_ERROR +Mindjolt,151,35266790,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518622270,TESTS,0,COMPILATION_ERROR +Mindjolt,151,35266785,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518622254,TESTS,0,COMPILATION_ERROR +Mindjolt,151,35266716,GNU C++,2048000,PRACTICE,1,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518622186,TESTS,0,WRONG_ANSWER +Mindjolt,151,35266476,GNU C++,2048000,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518621918,TESTS,0,WRONG_ANSWER +Mindjolt,151,35266429,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518621867,TESTS,0,COMPILATION_ERROR +Mindjolt,151,35266384,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518621809,TESTS,0,COMPILATION_ERROR +Mindjolt,151,35264745,GNU C++,0,PRACTICE,0,500.0,A,Soft Drinking,"[implementation, math]",2147483647,1518619161,TESTS,0,COMPILATION_ERROR +Mindjolt,515,35198151,GNU C++17,1843200,PRACTICE,0,1000.0,C,Drazil and Factorial,"[greedy, math, sortings]",2147483647,1518522612,TESTS,0,WRONG_ANSWER +Mindjolt,750,35197619,GNU C++17,1945600,PRACTICE,52,500.0,A,New Year and Hurry,"[binary search, brute force, implementation, math]",2147483647,1518521217,TESTS,31,OK +Mindjolt,750,35197538,GNU C++17,1945600,PRACTICE,7,500.0,A,New Year and Hurry,"[binary search, brute force, implementation, math]",2147483647,1518520983,TESTS,15,WRONG_ANSWER +Mindjolt,462,34982037,GNU C++14,1843200,PRACTICE,32,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517948200,TESTS,15,OK +Mindjolt,462,34982026,GNU C++14,1843200,PRACTICE,1,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517948162,TESTS,0,WRONG_ANSWER +Mindjolt,462,34981989,GNU C++14,1843200,PRACTICE,3,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517948031,TESTS,0,WRONG_ANSWER +Mindjolt,462,34981883,GNU C++,1843200,PRACTICE,7,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517947730,TESTS,15,WRONG_ANSWER +Mindjolt,462,34979892,GNU C++,1843200,PRACTICE,0,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517942153,TESTS,15,WRONG_ANSWER +Mindjolt,462,34979871,GNU C++,1843200,PRACTICE,0,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517942113,TESTS,0,WRONG_ANSWER +Mindjolt,462,34979844,GNU C++,0,PRACTICE,0,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517942037,TESTS,0,COMPILATION_ERROR +Mindjolt,462,34979755,GNU C++,1843200,PRACTICE,0,500.0,A,Appleman and Easy Task,"[brute force, implementation]",2147483647,1517941940,TESTS,0,WRONG_ANSWER +Mindjolt,441,34979412,GNU C11,1843200,PRACTICE,26,500.0,A,Valera and Antique Items,[implementation],2147483647,1517940967,TESTS,15,OK +Mindjolt,441,34979373,GNU C11,1843200,PRACTICE,1,500.0,A,Valera and Antique Items,[implementation],2147483647,1517940878,TESTS,15,WRONG_ANSWER +Mindjolt,441,34979362,GNU C11,1843200,PRACTICE,0,500.0,A,Valera and Antique Items,[implementation],2147483647,1517940850,TESTS,15,WRONG_ANSWER +Mindjolt,441,34979310,GNU C11,1843200,PRACTICE,0,500.0,A,Valera and Antique Items,[implementation],2147483647,1517940724,TESTS,15,WRONG_ANSWER +Mindjolt,441,34979270,GNU C11,1843200,PRACTICE,0,500.0,A,Valera and Antique Items,[implementation],2147483647,1517940605,TESTS,0,WRONG_ANSWER +Mindjolt,296,34720451,PyPy 2,21401600,PRACTICE,37,500.0,A,Yaroslav and Permutations,"[greedy, math]",2147483647,1517343496,TESTS,124,OK +Mindjolt,296,34720424,PyPy 2,21299200,PRACTICE,1,500.0,A,Yaroslav and Permutations,"[greedy, math]",2147483647,1517343374,TESTS,92,WRONG_ANSWER +Mindjolt,296,34720416,PyPy 2,21299200,PRACTICE,1,500.0,A,Yaroslav and Permutations,"[greedy, math]",2147483647,1517343320,TESTS,92,WRONG_ANSWER +Mindjolt,75,34720287,PyPy 2,21299200,PRACTICE,43,500.0,A,Life Without Zeros,[implementation],2147483647,1517342952,TESTS,154,OK +Mindjolt,918,34707433,PyPy 2,124723200,PRACTICE,6,1500.0,C,The Monster,"[data structures, greedy]",2147483647,1517313727,TESTS,1000,TIME_LIMIT_EXCEEDED +Mindjolt,918,34707383,PyPy 2,124723200,PRACTICE,6,1500.0,C,The Monster,"[data structures, greedy]",2147483647,1517313630,TESTS,1000,TIME_LIMIT_EXCEEDED +Mindjolt,918,34707323,PyPy 2,28876800,PRACTICE,3,1500.0,C,The Monster,"[data structures, greedy]",2147483647,1517313486,TESTS,1000,TIME_LIMIT_EXCEEDED +Mindjolt,918,34702561,PyPy 2,22220800,VIRTUAL,28,1000.0,B,Radio Station,[implementation],817,1517300977,TESTS,109,OK +Mindjolt,918,34702399,PyPy 2,21401600,VIRTUAL,18,500.0,A,Eleven,[implementation],332,1517300492,TESTS,62,OK +Mindjolt,75,34667168,PyPy 2,21299200,PRACTICE,0,500.0,A,Life Without Zeros,[implementation],2147483647,1517236998,TESTS,122,RUNTIME_ERROR +Mindjolt,822,34585046,Python 2,4608000,PRACTICE,59,500.0,A,I'm bored with life,"[implementation, math, number theory]",2147483647,1516991422,TESTS,62,OK +Mindjolt,290,34447319,PyPy 2,21299200,PRACTICE,36,0.0,B,QR code,"[*special, implementation]",2147483647,1516625105,TESTS,124,OK +Mindjolt,290,34447186,PyPy 2,21299200,PRACTICE,5,0.0,B,QR code,"[*special, implementation]",2147483647,1516624856,TESTS,124,WRONG_ANSWER +Mindjolt,290,34447172,PyPy 2,21299200,PRACTICE,0,0.0,B,QR code,"[*special, implementation]",2147483647,1516624824,TESTS,122,RUNTIME_ERROR +Mindjolt,290,34446394,PyPy 2,21299200,PRACTICE,40,0.0,A,Mysterious strings,"[*special, implementation]",2147483647,1516623450,TESTS,154,OK +Mindjolt,290,34446175,PyPy 2,21299200,PRACTICE,31,0.0,A,Mysterious strings,"[*special, implementation]",2147483647,1516623081,TESTS,156,WRONG_ANSWER +Mindjolt,290,34446147,PyPy 2,21299200,PRACTICE,7,0.0,A,Mysterious strings,"[*special, implementation]",2147483647,1516623010,TESTS,92,WRONG_ANSWER +Mindjolt,393,34272631,PyPy 2,23756800,PRACTICE,40,1000.0,B,Three matrices,[],2147483647,1516269940,TESTS,499,OK +Mindjolt,393,34272615,PyPy 2,21299200,PRACTICE,0,1000.0,B,Three matrices,[],2147483647,1516269893,TESTS,46,WRONG_ANSWER +Mindjolt,393,34272569,PyPy 2,21299200,PRACTICE,0,1000.0,B,Three matrices,[],2147483647,1516269725,TESTS,46,WRONG_ANSWER +Mindjolt,393,34272485,PyPy 2,21299200,PRACTICE,0,1000.0,B,Three matrices,[],2147483647,1516269388,TESTS,62,RUNTIME_ERROR +Mindjolt,101343,34228713,PyPy 2,21299200,PRACTICE,0,0.0,H,Give Me This Pizza,[data structures],2147483647,1516124202,TESTS,46,WRONG_ANSWER +Mindjolt,101343,34228690,PyPy 2,21299200,PRACTICE,0,0.0,H,Give Me This Pizza,[data structures],2147483647,1516124142,TESTS,46,WRONG_ANSWER +Mindjolt,101343,34228681,PyPy 2,21299200,PRACTICE,0,0.0,H,Give Me This Pizza,[data structures],2147483647,1516124111,TESTS,46,WRONG_ANSWER +Mindjolt,101343,34228656,PyPy 2,21299200,PRACTICE,0,0.0,H,Give Me This Pizza,[data structures],2147483647,1516124063,TESTS,46,WRONG_ANSWER +Mindjolt,339,34173980,PyPy 2,27750400,PRACTICE,29,1000.0,B,Xenia and Ringroad,[implementation],2147483647,1515931314,TESTS,216,OK +Mindjolt,339,34173958,PyPy 2,21299200,PRACTICE,0,1000.0,B,Xenia and Ringroad,[implementation],2147483647,1515931207,TESTS,92,WRONG_ANSWER +Mindjolt,339,34173929,PyPy 2,21299200,PRACTICE,0,1000.0,B,Xenia and Ringroad,[implementation],2147483647,1515931120,TESTS,92,WRONG_ANSWER +Mindjolt,339,34173903,PyPy 2,21299200,PRACTICE,0,1000.0,B,Xenia and Ringroad,[implementation],2147483647,1515931039,TESTS,92,RUNTIME_ERROR +Mindjolt,257,34173772,PyPy 2,21401600,PRACTICE,40,500.0,B,Playing Cubes,"[games, greedy, implementation]",2147483647,1515930629,TESTS,124,OK +Mindjolt,110,34173768,PyPy 2,21299200,PRACTICE,0,500.0,A,Nearly Lucky Number,[implementation],2147483647,1515930615,TESTS,92,RUNTIME_ERROR +Mindjolt,200,34173661,PyPy 2,21401600,PRACTICE,31,500.0,B,Drinks,"[implementation, math]",2147483647,1515930192,TESTS,154,OK +Mindjolt,200,34173649,PyPy 2,21299200,PRACTICE,0,500.0,B,Drinks,"[implementation, math]",2147483647,1515930159,TESTS,92,WRONG_ANSWER +Mindjolt,141,34173604,PyPy 2,21401600,PRACTICE,54,500.0,A,Amusing Joke,"[implementation, sortings, strings]",2147483647,1515930037,TESTS,124,OK +Mindjolt,141,34173571,PyPy 2,21299200,PRACTICE,10,500.0,A,Amusing Joke,"[implementation, sortings, strings]",2147483647,1515929936,TESTS,124,WRONG_ANSWER +Mindjolt,110,34173519,PyPy 2,21401600,PRACTICE,34,500.0,A,Nearly Lucky Number,[implementation],2147483647,1515929766,TESTS,124,OK +Mindjolt,110,34173512,PyPy 2,21299200,PRACTICE,0,500.0,A,Nearly Lucky Number,[implementation],2147483647,1515929744,TESTS,122,RUNTIME_ERROR +Mindjolt,110,34173500,PyPy 2,21299200,PRACTICE,0,500.0,A,Nearly Lucky Number,[implementation],2147483647,1515929717,TESTS,122,RUNTIME_ERROR +Mindjolt,915,34154559,PyPy 2,21401600,PRACTICE,10,0.0,C,Permute Digits,"[dp, greedy]",2147483647,1515858305,TESTS,62,RUNTIME_ERROR +Mindjolt,915,34154523,PyPy 2,21401600,PRACTICE,229,0.0,B,Browser,[implementation],2147483647,1515858254,TESTS,77,OK +Mindjolt,915,34154512,GNU C++11,0,PRACTICE,0,0.0,B,Browser,[implementation],2147483647,1515858238,TESTS,0,COMPILATION_ERROR +Mindjolt,915,34152246,PyPy 2,21401600,CONTESTANT,5,0.0,C,Permute Digits,"[dp, greedy]",7073,1515855773,TESTS,62,WRONG_ANSWER +Mindjolt,915,34150404,PyPy 2,21401600,CONTESTANT,5,0.0,C,Permute Digits,"[dp, greedy]",6499,1515855199,TESTS,61,RUNTIME_ERROR +Mindjolt,915,34146431,PyPy 2,21401600,CONTESTANT,10,0.0,C,Permute Digits,"[dp, greedy]",5075,1515853775,CHALLENGES,62,CHALLENGED +Mindjolt,915,34142003,PyPy 2,21299200,CONTESTANT,5,0.0,C,Permute Digits,"[dp, greedy]",3596,1515852296,TESTS,62,WRONG_ANSWER +Mindjolt,915,34133409,PyPy 2,21401600,CONTESTANT,10,0.0,B,Browser,[implementation],1172,1515849872,CHALLENGES,62,CHALLENGED +Mindjolt,915,34129020,PyPy 2,21401600,CONTESTANT,83,0.0,A,Garden,[implementation],285,1515848985,TESTS,62,OK +Mindjolt,915,34128824,GNU C++,0,CONTESTANT,0,0.0,A,Garden,[implementation],260,1515848960,TESTS,0,COMPILATION_ERROR +Mindjolt,330,34069064,PyPy 2,21401600,PRACTICE,42,500.0,A,Cakeminator,"[brute force, implementation]",2147483647,1515588846,TESTS,216,OK +Mindjolt,913,34028532,PyPy 2,22323200,CONTESTANT,6,3000.0,G,Power Substring,"[math, number theory]",7754,1515430454,PRETESTS,2000,TIME_LIMIT_EXCEEDED +Mindjolt,913,34018630,PyPy 2,21401600,CONTESTANT,13,750.0,B,Christmas Spruce,"[implementation, trees]",2508,1515425208,TESTS,78,WRONG_ANSWER +Mindjolt,913,34011303,PyPy 2,21401600,CONTESTANT,49,500.0,A,Modular Exponentiation,"[implementation, math]",679,1515423379,TESTS,77,OK +Mindjolt,230,33958066,PyPy 2,42700800,PRACTICE,68,500.0,B,T-primes,"[implementation, math, number theory]",2147483647,1515224037,TESTS,1872,OK +Mindjolt,230,33958008,PyPy 2,25292800,PRACTICE,0,500.0,B,T-primes,"[implementation, math, number theory]",2147483647,1515223790,TESTS,184,WRONG_ANSWER +Mindjolt,230,33957949,PyPy 2,34406400,PRACTICE,35,500.0,B,T-primes,"[implementation, math, number theory]",2147483647,1515223553,TESTS,2000,TIME_LIMIT_EXCEEDED +Mindjolt,230,33957941,PyPy 2,0,PRACTICE,0,500.0,B,T-primes,"[implementation, math, number theory]",2147483647,1515223533,TESTS,0,COMPILATION_ERROR +Mindjolt,230,33957911,PyPy 2,21196800,PRACTICE,2,500.0,B,T-primes,"[implementation, math, number theory]",2147483647,1515223430,TESTS,124,WRONG_ANSWER +Mindjolt,912,33948529,PyPy 2,21196800,PRACTICE,58,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515176440,TESTS,62,OK +Mindjolt,912,33948519,PyPy 2,21196800,PRACTICE,0,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515176416,TESTS,46,WRONG_ANSWER +Mindjolt,912,33948513,PyPy 2,21196800,PRACTICE,0,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515176393,TESTS,46,RUNTIME_ERROR +Mindjolt,912,33948452,PyPy 2,21196800,PRACTICE,47,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515176288,TESTS,62,WRONG_ANSWER +Mindjolt,912,33948432,PyPy 2,21196800,PRACTICE,7,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515176258,TESTS,62,WRONG_ANSWER +Mindjolt,912,33945893,PyPy 2,21196800,PRACTICE,47,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",2147483647,1515172426,TESTS,62,WRONG_ANSWER +Mindjolt,912,33945390,PyPy 2,21196800,CONTESTANT,0,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",7176,1515170076,CHALLENGES,62,WRONG_ANSWER +Mindjolt,912,33945140,PyPy 2,21196800,CONTESTANT,0,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",7088,1515169988,CHALLENGES,62,WRONG_ANSWER +Mindjolt,912,33932903,PyPy 2,21196800,CONTESTANT,8,1000.0,B,New Year's Eve,"[bitmasks, constructive algorithms]",1600,1515164500,CHALLENGES,77,CHALLENGED +Mindjolt,912,33926374,PyPy 2,21196800,CONTESTANT,38,500.0,A,Tricky Alchemy,[implementation],479,1515163379,TESTS,77,OK +Mindjolt,451,33838240,PyPy 2,21196800,PRACTICE,0,1000.0,B,Sort the Array,"[implementation, sortings]",2147483647,1514751648,TESTS,62,WRONG_ANSWER +Mindjolt,451,33838230,PyPy 2,21196800,PRACTICE,0,1000.0,B,Sort the Array,"[implementation, sortings]",2147483647,1514751602,TESTS,46,RUNTIME_ERROR +Mindjolt,490,33838163,PyPy 2,23756800,PRACTICE,41,500.0,A,Team Olympiad,"[greedy, implementation, sortings]",2147483647,1514751133,TESTS,171,OK +Mindjolt,451,33838134,PyPy 2,21196800,PRACTICE,28,500.0,A,Game With Sticks,[implementation],2147483647,1514750928,TESTS,62,OK +Mindjolt,337,33838108,PyPy 2,21196800,PRACTICE,18,500.0,A,Puzzles,"[dp, graph matchings, greedy]",2147483647,1514750708,TESTS,124,OK +Mindjolt,337,33838105,PyPy 2,0,PRACTICE,0,500.0,A,Puzzles,"[dp, graph matchings, greedy]",2147483647,1514750678,TESTS,0,COMPILATION_ERROR +Mindjolt,479,33838077,PyPy 2,21196800,PRACTICE,29,500.0,A,Expression,"[brute force, math]",2147483647,1514750451,TESTS,62,OK +Mindjolt,479,33838037,PyPy 2,21196800,PRACTICE,7,500.0,A,Expression,"[brute force, math]",2147483647,1514750248,TESTS,62,WRONG_ANSWER +Mindjolt,479,33838034,PyPy 2,21196800,PRACTICE,5,500.0,A,Expression,"[brute force, math]",2147483647,1514750217,TESTS,61,WRONG_ANSWER +Mindjolt,479,33838026,PyPy 2,0,PRACTICE,0,500.0,A,Expression,"[brute force, math]",2147483647,1514750191,TESTS,0,COMPILATION_ERROR +Mindjolt,443,33833971,PyPy 2,21196800,PRACTICE,0,500.0,A,Anton and Letters,"[constructive algorithms, implementation]",2147483647,1514732590,TESTS,46,WRONG_ANSWER +Mindjolt,443,33833955,PyPy 2,0,PRACTICE,0,500.0,A,Anton and Letters,"[constructive algorithms, implementation]",2147483647,1514732561,TESTS,0,COMPILATION_ERROR +Mindjolt,443,33833810,PyPy 2,21196800,PRACTICE,27,500.0,A,Anton and Letters,"[constructive algorithms, implementation]",2147483647,1514732080,TESTS,62,OK +Mindjolt,443,33833789,PyPy 2,21196800,PRACTICE,0,500.0,A,Anton and Letters,"[constructive algorithms, implementation]",2147483647,1514731978,TESTS,46,RUNTIME_ERROR +Mindjolt,469,33833760,PyPy 2,21196800,PRACTICE,29,500.0,A,I Wanna Be the Guy,"[greedy, implementation]",2147483647,1514731851,TESTS,62,OK +Mindjolt,469,33833752,PyPy 2,21196800,PRACTICE,0,500.0,A,I Wanna Be the Guy,"[greedy, implementation]",2147483647,1514731819,TESTS,61,WRONG_ANSWER +Mindjolt,469,33833719,PyPy 2,21196800,PRACTICE,0,500.0,A,I Wanna Be the Guy,"[greedy, implementation]",2147483647,1514731704,TESTS,46,RUNTIME_ERROR +Mindjolt,476,33831226,PyPy 2,21196800,PRACTICE,35,500.0,A,Dreamoon and Stairs,"[implementation, math]",2147483647,1514722628,TESTS,77,OK +Mindjolt,476,33831217,PyPy 2,21196800,PRACTICE,0,500.0,A,Dreamoon and Stairs,"[implementation, math]",2147483647,1514722602,TESTS,46,WRONG_ANSWER +Mindjolt,230,33830933,PyPy 2,21299200,PRACTICE,54,500.0,A,Dragons,"[greedy, sortings]",2147483647,1514721648,TESTS,186,OK +Mindjolt,230,33830859,PyPy 2,21299200,PRACTICE,9,500.0,A,Dragons,"[greedy, sortings]",2147483647,1514721350,TESTS,218,WRONG_ANSWER +Mindjolt,230,33830828,PyPy 2,21196800,PRACTICE,1,500.0,A,Dragons,"[greedy, sortings]",2147483647,1514721217,TESTS,124,RUNTIME_ERROR +Mindjolt,313,33830819,PyPy 2,21196800,PRACTICE,0,500.0,A,Ilya and Bank Account,"[implementation, number theory]",2147483647,1514721179,TESTS,154,RUNTIME_ERROR +Mindjolt,313,33830814,PyPy 2,21196800,PRACTICE,0,500.0,A,Ilya and Bank Account,"[implementation, number theory]",2147483647,1514721158,TESTS,92,RUNTIME_ERROR +Mindjolt,313,33830705,PyPy 2,21196800,PRACTICE,47,500.0,A,Ilya and Bank Account,"[implementation, number theory]",2147483647,1514720702,TESTS,124,OK +Mindjolt,313,33830670,PyPy 2,21196800,PRACTICE,1,500.0,A,Ilya and Bank Account,"[implementation, number theory]",2147483647,1514720568,TESTS,124,WRONG_ANSWER +Mindjolt,459,33830629,PyPy 2,21196800,PRACTICE,74,500.0,A,Pashmak and Garden,[implementation],2147483647,1514720401,TESTS,62,OK +Mindjolt,459,33830609,PyPy 2,21196800,PRACTICE,8,500.0,A,Pashmak and Garden,[implementation],2147483647,1514720338,TESTS,62,WRONG_ANSWER +Mindjolt,459,33830558,PyPy 2,21196800,PRACTICE,0,500.0,A,Pashmak and Garden,[implementation],2147483647,1514720195,TESTS,46,WRONG_ANSWER +Mindjolt,490,33830553,PyPy 2,21196800,PRACTICE,0,500.0,A,Team Olympiad,"[greedy, implementation, sortings]",2147483647,1514720180,TESTS,62,RUNTIME_ERROR +Mindjolt,490,33830439,PyPy 2,23756800,PRACTICE,41,500.0,A,Team Olympiad,"[greedy, implementation, sortings]",2147483647,1514719754,TESTS,155,OK +Mindjolt,490,33830430,PyPy 2,21196800,PRACTICE,0,500.0,A,Team Olympiad,"[greedy, implementation, sortings]",2147483647,1514719722,TESTS,46,WRONG_ANSWER +Mindjolt,490,33830421,PyPy 2,21196800,PRACTICE,0,500.0,A,Team Olympiad,"[greedy, implementation, sortings]",2147483647,1514719698,TESTS,46,WRONG_ANSWER +Mindjolt,466,33830385,PyPy 2,21196800,PRACTICE,0,500.0,A,Cheap Travel,[implementation],2147483647,1514719543,TESTS,46,RUNTIME_ERROR +Mindjolt,466,33830320,PyPy 2,21196800,PRACTICE,19,500.0,A,Cheap Travel,[implementation],2147483647,1514719305,TESTS,62,OK +Mindjolt,466,33830312,PyPy 2,21196800,PRACTICE,1,500.0,A,Cheap Travel,[implementation],2147483647,1514719262,TESTS,46,WRONG_ANSWER +Mindjolt,466,33830295,PyPy 2,21196800,PRACTICE,2,500.0,A,Cheap Travel,[implementation],2147483647,1514719199,TESTS,77,WRONG_ANSWER +Mindjolt,466,33830264,PyPy 2,21196800,PRACTICE,1,500.0,A,Cheap Travel,[implementation],2147483647,1514719109,TESTS,46,WRONG_ANSWER +Mindjolt,466,33830220,PyPy 2,21196800,PRACTICE,1,500.0,A,Cheap Travel,[implementation],2147483647,1514718939,TESTS,62,WRONG_ANSWER +Mindjolt,466,33830188,PyPy 2,21196800,PRACTICE,1,500.0,A,Cheap Travel,[implementation],2147483647,1514718829,TESTS,46,WRONG_ANSWER +Mindjolt,439,33830098,PyPy 2,21196800,PRACTICE,26,500.0,A,"Devu, the Singer and Churu, the Joker","[greedy, implementation]",2147483647,1514718563,TESTS,62,OK +Mindjolt,439,33830091,PyPy 2,21196800,PRACTICE,0,500.0,A,"Devu, the Singer and Churu, the Joker","[greedy, implementation]",2147483647,1514718545,TESTS,46,RUNTIME_ERROR +Mindjolt,439,33830086,PyPy 2,21196800,PRACTICE,0,500.0,A,"Devu, the Singer and Churu, the Joker","[greedy, implementation]",2147483647,1514718512,TESTS,46,WRONG_ANSWER +Mindjolt,510,33829599,PyPy 2,21196800,PRACTICE,28,500.0,A,Fox And Snake,[implementation],2147483647,1514716732,TESTS,62,OK +Mindjolt,510,33829578,PyPy 2,21196800,PRACTICE,2,500.0,A,Fox And Snake,[implementation],2147483647,1514716656,TESTS,62,RUNTIME_ERROR +Mindjolt,25,33829574,PyPy 2,21196800,PRACTICE,0,0.0,A,IQ test,[brute force],2147483647,1514716641,TESTS,92,RUNTIME_ERROR +Mindjolt,25,33829524,PyPy 2,21196800,PRACTICE,32,0.0,A,IQ test,[brute force],2147483647,1514716433,TESTS,124,OK +Mindjolt,432,33829516,PyPy 2,21196800,PRACTICE,0,500.0,A,Choosing Teams,"[greedy, implementation, sortings]",2147483647,1514716398,TESTS,46,RUNTIME_ERROR +Mindjolt,432,33829492,PyPy 2,21196800,PRACTICE,0,500.0,A,Choosing Teams,"[greedy, implementation, sortings]",2147483647,1514716273,TESTS,46,RUNTIME_ERROR +Mindjolt,432,33829420,PyPy 2,21504000,PRACTICE,35,500.0,A,Choosing Teams,"[greedy, implementation, sortings]",2147483647,1514715977,TESTS,77,OK +Mindjolt,432,33829407,PyPy 2,21196800,PRACTICE,0,500.0,A,Choosing Teams,"[greedy, implementation, sortings]",2147483647,1514715943,TESTS,46,RUNTIME_ERROR +Mindjolt,208,33829336,PyPy 2,21196800,PRACTICE,71,500.0,A,Dubstep,[strings],2147483647,1514715644,TESTS,124,OK +Mindjolt,208,33829258,PyPy 2,21196800,PRACTICE,2,500.0,A,Dubstep,[strings],2147483647,1514715365,TESTS,122,WRONG_ANSWER +Mindjolt,208,33829249,PyPy 2,0,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1514715339,TESTS,0,COMPILATION_ERROR +Mindjolt,208,33829234,PyPy 2,21196800,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1514715290,TESTS,122,WRONG_ANSWER +Mindjolt,208,33829217,PyPy 2,21196800,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1514715225,TESTS,92,WRONG_ANSWER +Mindjolt,208,33829215,PyPy 2,21401600,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1514715202,TESTS,2000,TIME_LIMIT_EXCEEDED +Mindjolt,208,33829187,PyPy 2,21196800,PRACTICE,0,500.0,A,Dubstep,[strings],2147483647,1514715092,TESTS,92,RUNTIME_ERROR +Mindjolt,208,33829151,PyPy 2,21196800,PRACTICE,71,500.0,A,Dubstep,[strings],2147483647,1514714948,TESTS,124,OK +Mindjolt,268,33829106,PyPy 2,21196800,PRACTICE,31,500.0,A,Games,[brute force],2147483647,1514714747,TESTS,124,OK +Mindjolt,908,33793887,PyPy 2,21811200,PRACTICE,46,750.0,B,New Year and Buggy Bot,"[brute force, implementation]",2147483647,1514576613,TESTS,78,OK +Mindjolt,908,33793445,PyPy 2,22118400,PRACTICE,6,1000.0,C,New Year and Curling,"[brute force, geometry, implementation, math]",2147483647,1514575715,TESTS,124,WRONG_ANSWER +Mindjolt,908,33793347,PyPy 2,22118400,PRACTICE,5,1000.0,C,New Year and Curling,"[brute force, geometry, implementation, math]",2147483647,1514575564,TESTS,108,RUNTIME_ERROR +Mindjolt,908,33782480,PyPy 2,22118400,CONTESTANT,5,1000.0,C,New Year and Curling,"[brute force, geometry, implementation, math]",3947,1514565947,TESTS,108,RUNTIME_ERROR +Mindjolt,908,33776719,PyPy 2,21811200,CONTESTANT,22,750.0,B,New Year and Buggy Bot,"[brute force, implementation]",1991,1514563991,TESTS,77,WRONG_ANSWER +Mindjolt,908,33776517,PyPy 2,21196800,CONTESTANT,0,750.0,B,New Year and Buggy Bot,"[brute force, implementation]",1946,1514563946,PRETESTS,62,WRONG_ANSWER +Mindjolt,908,33764061,PyPy 2,21196800,CONTESTANT,38,500.0,A,New Year and Counting Cards,[implementation],187,1514562187,TESTS,62,OK +Mindjolt,911,33760496,PyPy 2,21196800,PRACTICE,67,0.0,C,Three Garlands,"[brute force, constructive algorithms]",2147483647,1514553270,TESTS,77,OK +Mindjolt,451,33756366,PyPy 2,21196800,PRACTICE,5,500.0,A,Game With Sticks,[implementation],2147483647,1514541247,TESTS,46,WRONG_ANSWER +Mindjolt,451,33756356,PyPy 2,21196800,PRACTICE,0,500.0,A,Game With Sticks,[implementation],2147483647,1514541232,TESTS,46,WRONG_ANSWER +Mindjolt,911,33741761,PyPy 2,21913600,PRACTICE,2,0.0,D,Inversion Counting,"[brute force, math]",2147483647,1514481244,TESTS,124,WRONG_ANSWER +Mindjolt,911,33741721,PyPy 2,21196800,PRACTICE,0,0.0,D,Inversion Counting,"[brute force, math]",2147483647,1514481177,TESTS,31,WRONG_ANSWER +Mindjolt,911,33739078,PyPy 2,21196800,CONTESTANT,0,0.0,D,Inversion Counting,"[brute force, math]",7186,1514477086,TESTS,30,WRONG_ANSWER +Mindjolt,911,33738158,PyPy 2,30822400,CONTESTANT,8,0.0,C,Three Garlands,"[brute force, constructive algorithms]",6934,1514476834,CHALLENGES,186,CHALLENGED +Mindjolt,911,33734965,PyPy 2,21196800,CONTESTANT,3,0.0,C,Three Garlands,"[brute force, constructive algorithms]",5592,1514475492,TESTS,62,WRONG_ANSWER +Mindjolt,911,33734798,PyPy 2,21196800,CONTESTANT,1,0.0,C,Three Garlands,"[brute force, constructive algorithms]",5531,1514475431,TESTS,46,RUNTIME_ERROR +Mindjolt,911,33734644,PyPy 2,21196800,CONTESTANT,1,0.0,C,Three Garlands,"[brute force, constructive algorithms]",5466,1514475366,TESTS,61,RUNTIME_ERROR +Mindjolt,911,33730894,PyPy 2,21196800,CONTESTANT,1,0.0,C,Three Garlands,"[brute force, constructive algorithms]",3996,1514473896,TESTS,46,WRONG_ANSWER +Mindjolt,911,33730212,PyPy 2,21811200,CONTESTANT,5,0.0,C,Three Garlands,"[brute force, constructive algorithms]",3740,1514473640,TESTS,61,WRONG_ANSWER +Mindjolt,911,33729283,PyPy 2,21811200,CONTESTANT,4,0.0,C,Three Garlands,"[brute force, constructive algorithms]",3434,1514473334,TESTS,62,RUNTIME_ERROR +Mindjolt,911,33718608,PyPy 2,21196800,CONTESTANT,135,0.0,B,Two Cakes,"[binary search, brute force, implementation]",932,1514470832,TESTS,62,OK +Mindjolt,911,33713985,PyPy 2,29798400,CONTESTANT,140,0.0,A,Nearest Minimums,[implementation],214,1514470114,TESTS,93,OK +Mindjolt,909,33710903,PyPy 2,59596800,PRACTICE,5,1750.0,D,Colorful Points,"[data structures, greedy, implementation]",2147483647,1514465196,TESTS,296,WRONG_ANSWER +Mindjolt,909,33710887,PyPy 2,21196800,PRACTICE,3,1750.0,D,Colorful Points,"[data structures, greedy, implementation]",2147483647,1514465168,TESTS,46,WRONG_ANSWER +Mindjolt,909,33710841,PyPy 2,21196800,PRACTICE,0,1750.0,D,Colorful Points,"[data structures, greedy, implementation]",2147483647,1514465040,TESTS,61,WRONG_ANSWER +Mindjolt,909,33710828,PyPy 2,21196800,PRACTICE,3,1750.0,D,Colorful Points,"[data structures, greedy, implementation]",2147483647,1514464999,TESTS,62,WRONG_ANSWER +Mindjolt,909,33710809,PyPy 2,21196800,PRACTICE,3,1750.0,D,Colorful Points,"[data structures, greedy, implementation]",2147483647,1514464953,TESTS,46,WRONG_ANSWER +Mindjolt,909,33681059,PyPy 2,21196800,CONTESTANT,102,1000.0,B,Segments,"[constructive algorithms, math]",1955,1514394455,TESTS,78,OK +Mindjolt,909,33675608,PyPy 2,21196800,CONTESTANT,64,500.0,A,Generate Login,"[brute force, greedy, sortings]",442,1514392942,TESTS,62,OK +Mindjolt,910,33625891,PyPy 2,21196800,VIRTUAL,63,500.0,A,The Way to Home,"[dfs and similar, dp, greedy]",1115,1514224055,TESTS,62,OK +Mindjolt,902,33435031,PyPy 2,21196800,CONTESTANT,1,2000.0,D,GCD of Polynomials,[math],7015,1513704715,PRETESTS,62,WRONG_ANSWER +Mindjolt,902,33431142,PyPy 2,21196800,CONTESTANT,3,2000.0,D,GCD of Polynomials,[math],5174,1513702884,PRETESTS,46,WRONG_ANSWER +Mindjolt,902,33418815,PyPy 2,21196800,CONTESTANT,55,500.0,A,Visiting a Friend,[implementation],1254,1513698964,TESTS,62,OK +Mindjolt,902,33418057,PyPy 2,0,CONTESTANT,0,500.0,A,Visiting a Friend,[implementation],1115,1513698825,PRETESTS,0,COMPILATION_ERROR +Mindjolt,902,33417125,PyPy 2,21196800,CONTESTANT,3,500.0,A,Visiting a Friend,[implementation],957,1513698668,PRETESTS,61,WRONG_ANSWER +Mindjolt,902,33416656,PyPy 2,21196800,CONTESTANT,3,500.0,A,Visiting a Friend,[implementation],880,1513698591,PRETESTS,62,WRONG_ANSWER +Mindjolt,902,33416277,PyPy 2,21196800,CONTESTANT,1,500.0,A,Visiting a Friend,[implementation],823,1513698533,PRETESTS,46,WRONG_ANSWER +Mindjolt,902,33414649,PyPy 2,21196800,CONTESTANT,2,500.0,A,Visiting a Friend,[implementation],579,1513698290,PRETESTS,62,WRONG_ANSWER +Mindjolt,902,33413232,PyPy 2,21196800,CONTESTANT,2,500.0,A,Visiting a Friend,[implementation],345,1513698056,PRETESTS,77,WRONG_ANSWER +Mindjolt,898,33352745,PyPy 2,21196800,VIRTUAL,2,2500.0,F,Restoring the Expression,"[brute force, hashing, math]",5931,1513512411,TESTS,46,RUNTIME_ERROR +Mindjolt,898,33352717,PyPy 2,21196800,VIRTUAL,0,2500.0,F,Restoring the Expression,"[brute force, hashing, math]",5859,1513512339,TESTS,61,WRONG_ANSWER +Mindjolt,898,33352436,PyPy 2,21401600,VIRTUAL,10,2500.0,F,Restoring the Expression,"[brute force, hashing, math]",5226,1513511706,TESTS,77,WRONG_ANSWER +Mindjolt,898,33350308,PyPy 2,21196800,VIRTUAL,64,500.0,A,Rounding,[implementation],262,1513506742,TESTS,62,OK +Mindjolt,898,33350234,PyPy 2,21196800,VIRTUAL,3,500.0,A,Rounding,[implementation],46,1513506526,TESTS,62,WRONG_ANSWER +Mindjolt,260,33239423,PyPy 2,21504000,PRACTICE,25,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513254714,TESTS,62,OK +Mindjolt,260,33239401,PyPy 2,21504000,PRACTICE,25,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513254655,TESTS,62,OK +Mindjolt,260,33239383,PyPy 2,21196800,PRACTICE,3,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513254617,TESTS,62,WRONG_ANSWER +Mindjolt,260,33237989,PyPy 2,21708800,PRACTICE,6,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513251076,TESTS,171,WRONG_ANSWER +Mindjolt,260,33237916,PyPy 2,21708800,PRACTICE,6,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250939,TESTS,187,WRONG_ANSWER +Mindjolt,260,33237874,PyPy 2,21196800,PRACTICE,0,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250867,TESTS,62,WRONG_ANSWER +Mindjolt,260,33237861,PyPy 2,21196800,PRACTICE,0,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250838,TESTS,46,RUNTIME_ERROR +Mindjolt,260,33237829,PyPy 2,24268800,PRACTICE,6,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250784,TESTS,155,RUNTIME_ERROR +Mindjolt,260,33237800,PyPy 2,24268800,PRACTICE,6,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250737,TESTS,186,RUNTIME_ERROR +Mindjolt,260,33237788,PyPy 2,21196800,PRACTICE,0,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250712,TESTS,61,WRONG_ANSWER +Mindjolt,260,33237538,PyPy 2,26112000,PRACTICE,6,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513250224,TESTS,202,RUNTIME_ERROR +Mindjolt,260,33237378,PyPy 2,26009600,PRACTICE,5,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513249896,TESTS,234,RUNTIME_ERROR +Mindjolt,260,33237337,PyPy 2,26112000,PRACTICE,5,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513249821,TESTS,218,RUNTIME_ERROR +Mindjolt,260,33237318,PyPy 2,21196800,PRACTICE,2,500.0,A,Adding Digits,"[implementation, math]",2147483647,1513249774,TESTS,62,WRONG_ANSWER +Mindjolt,144,33234599,PyPy 2,21196800,PRACTICE,39,500.0,A,Arrival of the General,[implementation],2147483647,1513242376,TESTS,124,OK +Mindjolt,144,33233866,PyPy 2,21196800,PRACTICE,0,500.0,A,Arrival of the General,[implementation],2147483647,1513240265,TESTS,92,WRONG_ANSWER +Mindjolt,136,33233466,PyPy 2,21196800,PRACTICE,101,500.0,A,Presents,[implementation],2147483647,1513239210,TESTS,154,OK +Mindjolt,136,33233446,PyPy 2,0,PRACTICE,0,500.0,A,Presents,[implementation],2147483647,1513239167,TESTS,0,COMPILATION_ERROR +Mindjolt,122,33232554,PyPy 2,21196800,PRACTICE,36,500.0,A,Lucky Division,"[brute force, number theory]",2147483647,1513236162,TESTS,124,OK +Mindjolt,122,33232537,PyPy 2,21196800,PRACTICE,0,500.0,A,Lucky Division,"[brute force, number theory]",2147483647,1513236100,TESTS,92,RUNTIME_ERROR +Mindjolt,266,33232482,PyPy 2,21299200,PRACTICE,44,500.0,B,Queue at the School,"[constructive algorithms, graph matchings, implementation, shortest paths]",2147483647,1513235926,TESTS,124,OK +Mindjolt,266,33232461,PyPy 2,21196800,PRACTICE,5,500.0,B,Queue at the School,"[constructive algorithms, graph matchings, implementation, shortest paths]",2147483647,1513235860,TESTS,92,WRONG_ANSWER +Mindjolt,266,33232443,PyPy 2,0,PRACTICE,0,500.0,B,Queue at the School,"[constructive algorithms, graph matchings, implementation, shortest paths]",2147483647,1513235811,TESTS,0,COMPILATION_ERROR +Mindjolt,266,33232274,PyPy 2,21196800,PRACTICE,5,500.0,B,Queue at the School,"[constructive algorithms, graph matchings, implementation, shortest paths]",2147483647,1513235352,TESTS,122,WRONG_ANSWER +Mindjolt,58,33231921,PyPy 2,21196800,PRACTICE,40,500.0,A,Chat room,"[greedy, strings]",2147483647,1513234304,TESTS,62,OK +Mindjolt,58,33231778,PyPy 2,21196800,PRACTICE,37,500.0,A,Chat room,"[greedy, strings]",2147483647,1513233971,TESTS,62,WRONG_ANSWER +Mindjolt,58,33231048,PyPy 2,21196800,PRACTICE,37,500.0,A,Chat room,"[greedy, strings]",2147483647,1513231702,TESTS,62,WRONG_ANSWER +Mindjolt,58,33231007,PyPy 2,21196800,PRACTICE,37,500.0,A,Chat room,"[greedy, strings]",2147483647,1513231557,TESTS,62,WRONG_ANSWER +Mindjolt,58,33230959,PyPy 2,21196800,PRACTICE,2,500.0,A,Chat room,"[greedy, strings]",2147483647,1513231363,TESTS,61,WRONG_ANSWER +Mindjolt,58,33230913,PyPy 2,21196800,PRACTICE,1,500.0,A,Chat room,"[greedy, strings]",2147483647,1513231240,TESTS,62,RUNTIME_ERROR +Mindjolt,58,33230904,PyPy 2,0,PRACTICE,0,500.0,A,Chat room,"[greedy, strings]",2147483647,1513231203,TESTS,0,COMPILATION_ERROR +Mindjolt,58,33229971,PyPy 2,21196800,PRACTICE,0,500.0,A,Chat room,"[greedy, strings]",2147483647,1513227857,TESTS,61,WRONG_ANSWER +Mindjolt,58,33229960,PyPy 2,21196800,PRACTICE,0,500.0,A,Chat room,"[greedy, strings]",2147483647,1513227806,TESTS,46,RUNTIME_ERROR +Mindjolt,58,33229940,PyPy 2,21196800,PRACTICE,0,500.0,A,Chat room,"[greedy, strings]",2147483647,1513227722,TESTS,46,RUNTIME_ERROR +Mindjolt,160,33229673,PyPy 2,21196800,PRACTICE,29,500.0,A,Twins,"[greedy, sortings]",2147483647,1513226629,TESTS,154,OK +Mindjolt,160,33229648,PyPy 2,0,PRACTICE,0,500.0,A,Twins,"[greedy, sortings]",2147483647,1513226550,TESTS,0,COMPILATION_ERROR +Mindjolt,160,33229603,PyPy 2,21196800,PRACTICE,0,500.0,A,Twins,"[greedy, sortings]",2147483647,1513226294,TESTS,92,WRONG_ANSWER +Mindjolt,339,33223398,PyPy 2,21196800,PRACTICE,21,500.0,A,Helpful Maths,"[greedy, implementation, sortings, strings]",2147483647,1513191511,TESTS,124,OK +Mindjolt,339,33223380,PyPy 2,21196800,PRACTICE,0,500.0,A,Helpful Maths,"[greedy, implementation, sortings, strings]",2147483647,1513191443,TESTS,92,RUNTIME_ERROR +Mindjolt,339,33223353,PyPy 2,21196800,PRACTICE,0,500.0,A,Helpful Maths,"[greedy, implementation, sortings, strings]",2147483647,1513191365,TESTS,92,RUNTIME_ERROR +Mindjolt,112,33222645,PyPy 2,21196800,PRACTICE,53,500.0,A,Petya and Strings,"[implementation, strings]",2147483647,1513189180,TESTS,124,OK +Mindjolt,112,33222497,PyPy 2,21196800,PRACTICE,1,500.0,A,Petya and Strings,"[implementation, strings]",2147483647,1513188733,TESTS,92,WRONG_ANSWER +Mindjolt,112,33222475,PyPy 2,21196800,PRACTICE,0,500.0,A,Petya and Strings,"[implementation, strings]",2147483647,1513188656,TESTS,92,WRONG_ANSWER +Mindjolt,118,33222350,PyPy 2,21196800,PRACTICE,42,500.0,A,String Task,"[implementation, strings]",2147483647,1513188271,TESTS,124,OK +Mindjolt,118,33222313,PyPy 2,21196800,PRACTICE,14,500.0,A,String Task,"[implementation, strings]",2147483647,1513188177,TESTS,124,WRONG_ANSWER +Mindjolt,71,33222210,PyPy 2,21196800,PRACTICE,20,500.0,A,Way Too Long Words,[strings],2147483647,1513187843,TESTS,124,OK +Mindjolt,71,33222180,PyPy 2,21196800,PRACTICE,0,500.0,A,Way Too Long Words,[strings],2147483647,1513187756,TESTS,122,WRONG_ANSWER +Mindjolt,4,33221218,PyPy 2,21196800,PRACTICE,20,0.0,A,Watermelon,"[brute force, math]",2147483647,1513185170,TESTS,156,OK +Mindjolt,4,33221101,PyPy 2,21196800,PRACTICE,1,0.0,A,Watermelon,"[brute force, math]",2147483647,1513184927,TESTS,92,WRONG_ANSWER +Mindjolt,32,32756324,PyPy 2,21196800,PRACTICE,3,1000.0,B,Borze,"[expression parsing, implementation]",2147483647,1511887863,TESTS,216,WRONG_ANSWER +Mindjolt,320,31176707,PyPy 2,0,PRACTICE,47,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507578999,TESTS,124,OK +Mindjolt,320,31176690,PyPy 2,0,PRACTICE,0,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507578946,TESTS,60,WRONG_ANSWER +Mindjolt,320,31176608,PyPy 2,0,PRACTICE,12,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507578629,TESTS,124,WRONG_ANSWER +Mindjolt,318,31176601,Python 2,0,PRACTICE,0,500.0,A,Even Odds,[math],2147483647,1507578602,TESTS,92,RUNTIME_ERROR +Mindjolt,318,31176424,PyPy 2,0,PRACTICE,25,500.0,A,Even Odds,[math],2147483647,1507577976,TESTS,124,OK +Mindjolt,318,31176342,PyPy 2,0,PRACTICE,8,500.0,A,Even Odds,[math],2147483647,1507577715,TESTS,124,WRONG_ANSWER +Mindjolt,318,31176294,PyPy 2,0,PRACTICE,4,500.0,A,Even Odds,[math],2147483647,1507577591,TESTS,122,WRONG_ANSWER +Mindjolt,318,31176274,Python 2,0,PRACTICE,4,500.0,A,Even Odds,[math],2147483647,1507577543,TESTS,92,WRONG_ANSWER +Mindjolt,149,31176087,Python 2,0,PRACTICE,39,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507576864,TESTS,122,OK +Mindjolt,149,31176057,PyPy 2,0,PRACTICE,39,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507576759,TESTS,124,OK +Mindjolt,149,31176037,PyPy 2,0,PRACTICE,1,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507576679,TESTS,124,WRONG_ANSWER +Mindjolt,149,31175933,PyPy 2,0,PRACTICE,3,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507576344,TESTS,124,WRONG_ANSWER +Mindjolt,149,31175820,PyPy 2,0,PRACTICE,3,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507575978,TESTS,156,WRONG_ANSWER +Mindjolt,149,31175684,PyPy 2,0,PRACTICE,3,500.0,A,Business trip,"[greedy, implementation, sortings]",2147483647,1507575573,TESTS,124,WRONG_ANSWER +Mindjolt,320,31171580,Python 2,0,PRACTICE,12,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507563320,TESTS,92,WRONG_ANSWER +Mindjolt,320,31171455,PyPy 2,0,PRACTICE,12,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507563043,TESTS,124,WRONG_ANSWER +Mindjolt,320,31171335,PyPy 2,0,PRACTICE,12,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507562694,TESTS,124,WRONG_ANSWER +Mindjolt,320,31171275,PyPy 2,0,PRACTICE,12,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507562511,TESTS,124,WRONG_ANSWER +Mindjolt,320,31171197,PyPy 2,0,PRACTICE,9,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507562342,TESTS,124,WRONG_ANSWER +Mindjolt,320,31171037,PyPy 2,0,PRACTICE,0,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507561908,TESTS,92,WRONG_ANSWER +Mindjolt,320,31170980,PyPy 2,0,PRACTICE,0,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507561745,TESTS,92,RUNTIME_ERROR +Mindjolt,320,31170903,PyPy 2,0,PRACTICE,10,500.0,A,Magic Numbers,"[brute force, greedy]",2147483647,1507561527,TESTS,186,WRONG_ANSWER +Mindjolt,270,30657110,GNU C,0,PRACTICE,3,500.0,A,Fancy Fence,"[geometry, implementation, math]",2147483647,1506230605,TESTS,30,OK +Mindjolt,363,30231013,Python 2,3276800,PRACTICE,6,1000.0,B,Fence,"[brute force, dp]",2147483647,1504977853,TESTS,1000,TIME_LIMIT_EXCEEDED +Mindjolt,363,30230715,Python 2,4915200,PRACTICE,6,1000.0,B,Fence,"[brute force, dp]",2147483647,1504976809,TESTS,1000,TIME_LIMIT_EXCEEDED +Mindjolt,363,30230643,Python 2,0,PRACTICE,1,1000.0,B,Fence,"[brute force, dp]",2147483647,1504976612,TESTS,46,WRONG_ANSWER +Mindjolt,363,30183493,Python 2,0,PRACTICE,0,1000.0,B,Fence,"[brute force, dp]",2147483647,1504794274,TESTS,30,WRONG_ANSWER +Mindjolt,363,30183141,Python 2,0,PRACTICE,1,1000.0,B,Fence,"[brute force, dp]",2147483647,1504793111,TESTS,31,RUNTIME_ERROR +Mindjolt,61,30175904,Python 2,0,PRACTICE,102,500.0,A,Ultra-Fast Mathematician,[implementation],2147483647,1504772427,TESTS,61,OK +Mindjolt,144,30163239,Python 2,0,PRACTICE,2,500.0,A,Arrival of the General,[implementation],2147483647,1504721361,TESTS,62,WRONG_ANSWER +Mindjolt,144,30163077,Python 2,0,PRACTICE,3,500.0,A,Arrival of the General,[implementation],2147483647,1504721021,TESTS,92,WRONG_ANSWER +Mindjolt,144,30162851,Python 2,0,PRACTICE,0,500.0,A,Arrival of the General,[implementation],2147483647,1504720535,TESTS,92,WRONG_ANSWER +Mindjolt,144,30162734,Python 2,0,PRACTICE,1,500.0,A,Arrival of the General,[implementation],2147483647,1504720260,TESTS,122,WRONG_ANSWER +Mindjolt,282,30158041,Python 2,0,PRACTICE,36,500.0,A,Bit++,[implementation],2147483647,1504712899,TESTS,62,OK +Mindjolt,282,30157725,Python 2,0,PRACTICE,36,500.0,A,Bit++,[implementation],2147483647,1504712625,TESTS,61,OK +Mindjolt,282,30157675,Python 2,0,PRACTICE,0,500.0,A,Bit++,[implementation],2147483647,1504712577,TESTS,46,WRONG_ANSWER +Mindjolt,841,29614476,Python 2,0,PRACTICE,114,500.0,A,Generous Kefa,"[brute force, implementation]",2147483647,1503211638,TESTS,93,OK +Mindjolt,841,29614428,Python 2,0,PRACTICE,1,500.0,A,Generous Kefa,"[brute force, implementation]",2147483647,1503211438,TESTS,46,WRONG_ANSWER +Mindjolt,352,29369156,Python 2,4710400,VIRTUAL,0,1000.0,B,Jeff and Periods,"[implementation, sortings]",3322,1502516122,TESTS,92,WRONG_ANSWER +Mindjolt,352,29369032,Python 2,4608000,VIRTUAL,0,1000.0,B,Jeff and Periods,"[implementation, sortings]",2836,1502515637,TESTS,62,WRONG_ANSWER +Mindjolt,352,29368651,Python 2,4710400,VIRTUAL,42,500.0,A,Jeff and Digits,"[brute force, implementation, math]",1381,1502514181,TESTS,124,OK +Mindjolt,352,29368608,Python 2,4608000,VIRTUAL,0,500.0,A,Jeff and Digits,"[brute force, implementation, math]",1240,1502514040,TESTS,92,WRONG_ANSWER +Mindjolt,352,29368535,Python 2,4608000,VIRTUAL,7,500.0,A,Jeff and Digits,"[brute force, implementation, math]",1031,1502513831,TESTS,124,WRONG_ANSWER +Mindjolt,352,29368462,Python 2,4710400,VIRTUAL,2,500.0,A,Jeff and Digits,"[brute force, implementation, math]",762,1502513562,TESTS,92,WRONG_ANSWER +Mindjolt,352,29368397,Python 2,4608000,VIRTUAL,0,500.0,A,Jeff and Digits,"[brute force, implementation, math]",528,1502513328,TESTS,92,WRONG_ANSWER +Mindjolt,352,29368376,Python 2,4608000,VIRTUAL,0,500.0,A,Jeff and Digits,"[brute force, implementation, math]",464,1502513264,TESTS,92,WRONG_ANSWER +Mindjolt,263,29336276,Python 2,4710400,PRACTICE,25,500.0,A,Beautiful Matrix,[implementation],2147483647,1502389199,TESTS,124,OK +Mindjolt,69,29336065,Python 2,4710400,PRACTICE,81,500.0,A,Young Physicist,"[implementation, math]",2147483647,1502388493,TESTS,124,OK +Mindjolt,69,29336009,Python 2,4710400,PRACTICE,0,500.0,A,Young Physicist,"[implementation, math]",2147483647,1502388314,TESTS,92,WRONG_ANSWER +Mindjolt,69,29335920,Python 2,4608000,PRACTICE,0,500.0,A,Young Physicist,"[implementation, math]",2147483647,1502387993,TESTS,62,WRONG_ANSWER diff --git a/ui/user_rating.csv b/ui/user_rating.csv index 7f27954..5340108 100644 --- a/ui/user_rating.csv +++ b/ui/user_rating.csv @@ -1,16 +1,9 @@ contestId,contestName,handle,newRating,oldRating,rank,ratingUpdateTimeSeconds -415,Codeforces Round #240 (Div. 2),yj12,1482,1500,794,1396806000 -417,RCC 2014 Warmup (Div. 2),yj12,1503,1482,401,1397756400 -486,Codeforces Round #277 (Div. 2),yj12,1463,1503,893,1415725200 -567,Codeforces Round #Pi (Div. 2),yj12,1512,1463,944,1438799400 -569,Codeforces Round #315 (Div. 2),yj12,1481,1512,921,1439231400 -572,Codeforces Round #317 [AimFund Thanks-Round] (Div. 2),yj12,1612,1481,335,1440268200 -574,Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2),yj12,1523,1612,1712,1440873600 -670,Codeforces Round #350 (Div. 2),yj12,1516,1523,1133,1462473300 -673,"Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition)",yj12,1481,1516,1112,1462644300 -672,Codeforces Round #352 (Div. 2),yj12,1536,1481,575,1462991700 -680,Codeforces Round #356 (Div. 2),yj12,1520,1536,1427,1465410900 -681,Codeforces Round #357 (Div. 2),yj12,1496,1520,1484,1465929300 -755,8VC Venture Cup 2017 - Elimination Round,yj12,1461,1496,2185,1484507100 -758,Codeforces Round #392 (Div. 2),yj12,1389,1461,3319,1484845500 -789,Codeforces Round #407 (Div. 2),yj12,1415,1389,1466,1490810700 +902,Codeforces Round #453 (Div. 2),Mindjolt,1421,1500,3161,1513704900 +909,Codeforces Round #455 (Div. 2),Mindjolt,1469,1421,981,1514399700 +911,Educational Codeforces Round 35 (Rated for Div. 2),Mindjolt,1448,1469,1725,1514477100 +908,Good Bye 2017,Mindjolt,1393,1448,4550,1514571000 +912,Codeforces Round #456 (Div. 2),Mindjolt,1368,1393,2425,1515170100 +913,Hello 2018,Mindjolt,1319,1368,4376,1515431700 +915,Educational Codeforces Round 36 (Rated for Div. 2),Mindjolt,1298,1319,2483,1515855900 +980,Codeforces Round #480 (Div. 2),Mindjolt,1383,1298,1262,1525799100 From a4744da6749669624474c70d4f9b86e8808bd66f Mon Sep 17 00:00:00 2001 From: VastoLorde95 Date: Tue, 15 May 2018 03:04:36 +0530 Subject: [PATCH 4/4] Fixed some shitty code --- ui/img_histogram.png | Bin 8873 -> 9944 bytes ui/img_tags.png | Bin 51311 -> 89269 bytes ui/img_userProgress.png | Bin 27230 -> 33936 bytes ui/problem_data.csv | 12 + ui/problem_ratings.csv | 12 + ui/user_activity.csv | 1044 ++++++++++++++++++++------------------- ui/user_rating.csv | 23 +- 7 files changed, 586 insertions(+), 505 deletions(-) diff --git a/ui/img_histogram.png b/ui/img_histogram.png index 0ca4ed1fa9ba3b880280c00ac25bcd559fb9960b..2d47e9cdc1055823398e1eee0b7bd525a6a0dc36 100644 GIT binary patch literal 9944 zcmb7K2{@E%`?m`@CVMJdmKqZYDP@<8C1n{Cq25xqC|hj}GW2daipjX+~YQ{E^ ztl2{-d)Dm#cT``e^PO}4*XO!i&+^XP&vHM{{kwm^d4tcNJIl(<$4o^<#fsF@FrcEM zK~w&B(Lz1JCDt=gWAwbP(HW>oO-)TpOG`&bw` zaBy;Ra&d9-@bK{R^78TV?c29+|Ni|44jka;=NAwV5EK*?5)u*?7Cw0JpooZwsHmuz zn3%Y@_@P6G4j(=Yhr=Z#BoGM1kt0W>q@<2Qe~)^P_BKjOOCLLSOh!gVR#sL{PVV^e zapue!O-;?S zXU}SBX(5qFZEbBG9UWa=T|GU$bLY+7FCfBwRS3kC)ThK7blMn=ZQ#wZlZ#KZ)R zMqj*m(bUw`%*^c4rAy}K<`xzfmX?;6FJHcL$;rvt+1bU##nsi-&CTu3ojdOC?j9Z< zp3vWCl$V#6x3{;CkB_gfub-cvzrX+8yLSTu0`A?rcmMwVz`($upr8j29$+w-;Nakp zkPs{u8yXt=@ZrO-u(0s(@Q8?r$jC?>4i^;__2|)~=;&xX9v>4E6B`>F7Z(>FAD@tr zkeHa5l$4a5oSc%9^7!%NCr_TFrlzK)rKP8*XJlk#W@ct(Wj%fRG&?){*|TRkIXMIZ zAvZTSFE1}YKmYmj=O73c6coI8@#5vnmxYCeMMXu$#l{0 ztE#H1tE+2jYF@p1_4@VeH*ek$i9`~KR9jnHS65eGU*FKs(Ad~WCX?U3ecRO3)ZED2Kx390SzrTNAU|?`?@Z-mi zLqkKu!^0yZBcDEf8XX-S8yg!RAOHOM^OrAQCMG5(Cnu+-rlzN-XJ%$*XJ_Z;=DvRY zIzKbRu- z+41o1?uloPJcR;f44&l^GW)4$lnkf;@W0DMq!Cd;sL()#J2#g4BdZ^Pq;jVPsM!U% z1*v})9)Nm323*g`lG^XwpkqM3c%ZdP;(9yVUh`^OYagG@=CHUl%|3~2`s%1!y~t2G zUz6!%6Bf*9U{~#ag#stk4KnmDlv_|23HC(0b+7n?sHFI4dyNqsSh z-z~>*1V&~dqqGg`W<0`22PI8AoZda%6a^H$w!#iRI3*j7l1zGmI@ZqnQUxK^R{+j= zPGeVNpg$^|p?d$6vcSVh6@_-jw4t?!~O&_%+2B-_|7oS)YnL$bk_ zdDmKrPRC{Bw$EsOdw{xlc=a{w2Ty7r(*qt?X6YF-s1nu)cM6cg^$7nM8)WimP8L8j#Fwaj(`8~2Vw+x-t-qDe}nbOS@R$`IB?DtY; z+wt|jomH_!P=QoTFqVjqBAx7UHv}qta+hg9e}O4dh-_H&>g41qPB}*k#`5iz1wyp& z{Me+$ctUSGPxGmsUMnFS5_FSHHxL0eD)l&6X^_tnnfM}Z#WVAey`zbi19?@SZq(-F zHSCIP3Mq6Jib)F=MK&GMxTk`PA5x`Fl>`*OD)?m@`&`f=`fip=u+QWhPS)SXefTVm z`=HB)v=0!8{+f1|Ba!4eZL{@)t%C={wHsqBjB+DYP8RMoM(=+(Dad^f4PybMF=wcW z01QimAqjHR!?3CdX37&z6$Ar#$RACZ2V7b9Jj6ot5RD>=35$T;yhwYTNMXVX-R{r# z(bol0cScF<!Rt5qyr3d!;lcHHdMuF*l-)SXp%WF4Iwk_1#I?(^@qPSO zV|%y0aw4YaNTNVr;VEGagivR5pb<_46^0{T4`#S4BKP{<9|4nkpB3LZRekkueJNmg z<>*l^{QSrA#5FI!zLT-Ohc7Paw-kB#aF_r3H_6Fqvva5+00@Ii3(~&^i zF{FK%HB8HZohF(RtvVOQs~25B6c5FeTyA;N7aL=+AVM8mKm z+<+{KE+cY3&wFG2{^IfCS1ChM~goOi*DqQXz%x7F29@#}USZOE!N+F-?T@cN+BATC zgJ3{xrUrSTv+!T{;ivN+3w9>K-Q*g>`ONvQr=#hi1wzZ)wR2%e_q9YQo;nvv%p3+| zGsDau&Zotnsa<&!dWPQV7}Bv#BwL!FjkiUyCLf&(uL6?t(0BNb;@MuLq3KO1b{LY- zxtbTAA@JZIM7X{`T8wffXN<{2C*vjrs#I5r2%i`|OK3AXZLIC?_>mDaiYnBV!i>^G z6)u2@8ti+fh7e*1LXRrnImLk>7I2V?(Uqx-I^ek%63=YFr^Pb|UIJX zX6<^32sdibAnV)YwPDAQ9t}3Nv^`$knW`%8CN=(P7R1)#nM#j#>kQ>rIsMd@y9)+t zD=~q&Ug}ia3l@KTckK7#XFQ_1&-e?x{)1sUG&TF6Nc$t;?i6Hk=PvEmg9|IV?q43Q zN#Afxx}bc`WpjR?X!epel285&uCpn}jd7g`Miw{A)M+)A`a~+z#2wegr!(bio5_L$ zC7-8?g-}w^^8*JJ6g2tY6HR?yTp&d2j1vOUl`4qpzUL>Ua0*<>ey#g7chHBAI6)7r zS}i0dq(r`y=%mFOgUN9c$Z~N31&<9;^;3fQKZx@>b@gR`m=nftJOe5f#-s-63 z7%`kG*fDeD>E7?aQn;iNf(lP<+{H*LQk!&V@ z7ntWQ(y@CI+;5Du{taz@*$0_1g{4ofjEy82^6||bJ)mMWsb(k%m;^8Ee~OhM%zI*fL;|s^B48;U64At~;nAY{d0rfq1yhuUwn~IU1pMj% zA@?H@lo)dQlQ}i*eiOY~BVJ(&o+1%Y6cPa;7eo@(5STOUEKrpGt&_mse#7|BfPpIf z6PEntkuiiNV;9n*x9IZS7`>(IJtv{hYW8ybOb)D^8u-F4%+3SFOarmthbs}p>uDk& z64x#{aNy|2SS)(t#WPA^hM@DYQceiv8vn1T8ITQ%6z4 z7f-Gg!|w|Bq4bvJxq5U@4`iwdyue>T%s%1QKcC1vD|?x+#~S`J$5x)p^fE!?7?&+T zPxgoMIZ6ryBOicJXlj=p;uNDPnTg+4_$m5LWA)(*^5Slp^S-8ofXyszu$4HB=+wai zoTLV|Cshc;S1_Z@L_Qb5W1y@Hg^*Hiiy*<3Cxn4~$xdLe)w~G)VwwRs#mB48ScOh5 zo(Y6@;fwno@V1mo^8!)>(OAdb(dtV}x=d z8brY0T}b=mn(PT8$muafYTDDAZnP8tLNFUp5a{kJ$xhe67>Q|44obkgXHGCySCYS0 zA2FM_HxFG`7O>ok+tn2Q?9^PWDf^^IaK>I*u?GlzpX-^SuI++m!-G@v4G!p=*g_N1 zIRq1xV=T#2l^(e3A4`f?@>vs2Nnrw2RNewy->&T^(olo!63*;UDUEf#ne3ND0}{HG zUiyCe_C_knKzVE`7bokWU1hz)>Tc}txGMq6dQ}Dxm9xE5*b__YiOez%LU-Dyh#|Y= zt6lU4vKm_V@g!{)E%wB!pG7s}DA4F7W<6-1a$(wGnei=fxH@j|TPieA1GYnY6%0V< zIO2B*n`w~&PQh&wuo+Y#&|C*+_^Z|;Wo9AcpKg>cTzC1D^?E_yQ$2pJvDT*b$iBjZ z&(J;c6Gk5_ns&@4@s6KfyNR*Vy8?fd{+es@F6qHJe!qs6Fe{09p6s9j3H%ys9-5v& z3{gew3jq|BotF;aWL-xFSpLwq%bfT*DtFTA+?yMh;V+*Y>a2?Vj-*<4XOsN8mCO;- z3DY~|E!RmuC+s3(G*Hvqo$-}4mXy~0!E(AH09_+-9W<@l?=edbx0{Wr@9`8Qol$+( zZ+2cLmZUJG-mI)tH7D760tG?pVM%6#>4AXwSBOreO>@*lHFI>k+C?+A^pZnbgEkXztMzpr%z%ETj@aKu)ZMa^cmJ8%pdSH_eT%Wg6Qdx zU%1V%{)Q7qb_|&0ntacuaC|6)9^4Qs30}Iu;aEAD%*s5T;`{BwpJ7lk$3Txj1;#y% zG1UZ5lNzbZK2a6#rxV!k%4J7C;&=dsFLw4_c=}%3FTiB}T0EMXredk{5XwJ_UTp3| zZ9g&O2a3ZCpXAf=fXk=JtF^S+ZN5-2^A;_^Ed8K-g*4zAh*sirr`-|B3q?d&p5o z3gP%Q!ZQdNqjY9t0<|(IX-HE9F*EANR1QlOHjIjZ%Y=+YKN7zwzvmE&+9XE_YSE=_#PlK%xdu0uutP$WvGooBNX_vC8kKq4? zLe2ntm*6H%*4UwY9+_DiX$nu!7TWuFj>&KIIv^E2N@HwBm>0%Syur!~5{quYN%dm3_Ig z^^xKJVj}oveLl_YrukjUnfz@qnmu4>a|Fi9j1GLw2&fVsSH7hCS#&%{&lh;CWH5Z} ztjvXTGfpYRLQ(!q#w$@&@A0knJn9lxDWX%*CBnf_EjprUv#&n90ylfv(1$%UI9L+O*3T$zv3 zYTt@#apT!Dt{`iID9^btZ3#B&_}URC7)M-41&+ozDo_x05=PF2e;;D?pbID)3Uu2T z2|=0BB0#S?d5~B@poNkw=AV;z3Y@HF6G4?;Yu@?>lZY_r;2>*1YQ&r=7MCURwFB>` znOH%FLiAd4iH%;uEC<>hElY|z?5}n}{L3r6H@^ZyAFq=S!v<>vV$>62- zfQkrb+$o&YruLg_T;)3$EXpp?ug9*l5Q9C;#mz#c{EOm!S7;}tsNCPApxLPg{L%h& z7<#S$6jrBwhGKOra7BHGkhvz!PX&&ZZQThPo>qsXYPM(e`zAC)`}29^Q`&`)U6zr` z3QikW3Y*UrehFe)V#K^I}4@8EISdh*bE+?%+lVD0JGzKAqg=Sp4SH20<-5T z_8y?*0dTxUzSWnty)e65A#(Ym+fH}dWSm89R<6C_(vdiR2}FI$N3(j~UTCf5k+L(% zQbQJ005(gec0Qo&ts4VgLa!Or(IoMU(+`PZX09^F+ z0MpHcIzMu<+@~fwSq%=;JUGCta`K1P`)Azu0)-!5g#iCgB;CM(bE)6^RYt{^RuWyEE9Jf|^YXiT8u-n1^)3RO;rWjomL`_e|qvP9O;)H^m zBGWS=QR^v0yF3NaoFa5{7@y#ubwSjxDxL!v|H&u*PQd*IB48tyYmaa;3?g`NB)deN z7Vv^{qWOm2`%@=v5hoz>$MK!~=`DUIf3jCwNaeH)``;K@GZ+fJx$(O+{LAuhRIPI? zC@3!c&N&}jTs+|Vj)5Marv>8BKe@RSCFzHC6Chd7 z3EBZ%d#D;kH`vQBTl4j92Ti0`hty586SLNiv)sab6oRTP7ObZM%^woHMUb}gvrN1n z*LqpKl1IHqs55MoGhbi63`dNfXUeniA75 z%AZny!RZ=*{p8I4_kt1WV(t)mf5k=K{Xg>8HJHooNsI3?tL{@aRi5G*t{rWKe1Au} zl}eV_O_MBvP~FjcdGys7srA(oAVq@0vmu3YLcQgOD*ChbKRI61O`To-N%?IKJ_ze( z8nL2o#zdp~qg;@r@VB!6FW*8!jHpz?9ZP1jl^`g(J-NBh&-RBX`+84pO7D)I2Sle% z*@RA*ttkEDQKl+pL`93Eo*F}j`2R(y@74Qk!pz1AOb)R7+4e3Kg!nHA`^%3M zzh?WVlla_KiXPgsyA;iV3ws5g{tu$nuirX$%%C%fsRL!j#-uxhSahEFJv6}pxZv2& z0ur-rz{Omz!CCh#9gJ4rYRU48QM+TA$*&+uo(gRIUi=W-a)Qv+xjl+=Z&KfM%-m&jG9jrq zWb1+a?gUC_N4`lpqf&hmKa*(Ianjo8n(ayroBaN#ZfxEW`?y#soiv;L5Q;pN2J!Vh zK3|7*{KN*$Too5gKj)UMd19`b83Jec>Kb<*6|P?k@A=Ea!`XoaZk83_45pR3)0R=@ z?<%-GbMmVAhd*>aLMKY$3)hE9F}5r9!QPG?OKWs&QB)|7_uR3^e=>45w=CJ?$Rf(zN0A8TDuV44V_Uja#S@-mg)L^T zOG~i2qFN$NAq5-%jFj`b3&XGNdNrI^Z(DA(@@(CHvGuSbWH#35y~C2BApV9uDP+E{ z`5n1O-dx@N)4j&!96uV+-X>XQ_}iC;O65Gu$9$1Zd%BsjkHQ?9x>tY0nX{jDX? z%ddV_-t$|o9kl4xiNWnAi)Ll-<*@4YO0mvc&5oW~@s))s*& zT$nEk#yXB~9FlnCr;Z{u`qlP09UJtTPdi)t8F(m#kz3l+T&Ie-oC&QYt4`4<;!~gu z0Loa}Z`E41UQOr`+v*BV(R}9)Y9NvoC0~3J-x!hNpISSYg5KAx;}@C@d-UG>%iKs- z13mIl;GoiwL&oZwOjxy2^!8lUhM8rx`e81tz~EZ-;CgY6qk@!I?IR1Yz`4rx!lrY_ zmZ1>~#!6?w{8dk}Qf<`Wruqq=Y(+u*5mnN}#@Ftw?bC^Q?Sg+1`+t}I|Jpil0~+Lt zY22HUjbs9&;;x9Py&Vf~(?$lx=5BOqND^=PsUTPcQMUx~^e~ANFft8>Yrie{mhBI9 z1cr;*g6KKVkiu;uy7a>_pN`Vv+sDTkWggKFj&uTC0f`Co z1Gk!2^vB$W@W4`F@9}Atcl~aivc0z?z_oJJ9mrl=%hp>-S6;M&prc&MoFfYnL z`wSK7tuws!sP|D7!WYb?I~L!XE?q1N?&*3RH4%6f1vDMmxaa~dOAT*)U{f;WeUQcf ziN()Yx4+Ck+;99Yt9Re*Dt(_Rp|rrRZQxd3=&`*13w#cTQI;h>Z3A=thO4f#9|FyS zJ7R7Q7Raw}Jy<2ux^?f&P=5Nr(Q%;_`apEAq}JxDg!G@s^eva(4b$WcEcz!+kw2N-(qP`n2dhb%ga_7f{G5uk;Ar!#% zW*TaiY?_=F>J2o*7{4uY>^2*DCcheTz1&^`3>jM1E2MVb=VW;vBX@&#Jd&_{$+K5u z+HMHBM8gdn*svK=u^_~4EcdUsi<(Qe=k4C-*HT&$C-vd=s!Q{YmkUePpWgdb9kLV0 z^L=W4S*)456&_V$UJ{Ka-CEDAl)HY(XTYUfvQLcw6#0+`_;mdE1S@MP98#B7V7M*`vtK&dhJyTn5D7GKw1wl8Np?@FufYHo-))cvXuWWe|9WJAg&Vo&a3Af zLasi;#_^$m<%#*6oaxuOM0ilI{B-WuMR?WJp7L8PU`Y4!5ih&_Cu+p29Aj>ZqNMw( zvX5VOP@iF82AztN=bGx4##*^1JUx_H|U$gK%tjpqWqY1i9#DcZ|=} zuyl_7DTmd)IZ}N^*-DgAv0HNj>CU4#_{^mBhwYq}!tAVD34UBb91ffLuWuFH+%o1p zSE9Uj4?VGcb?Ix@V7XP_*y1+2*`1|$(~ofU_4Jm2M5ul5b{+G&JzS=GJMz3vYCc@z$H>UY%*=fL{P_zPE?m5Lk%fhYm6er^jg6h1or8np(xpq6FJI>5 z%>CN3^6 zAt50tDJdl-B`qy2BO@a#D=Q}_CoeCrprD|rsHmi*q^zv0qN1Xzs(S6(H8nLgb#-+O z4Gm3A&Fj~%YiVg|Yir-QapUIAn>so=w{G3KefzequCAV*-km#l^!4?jQ0U#ecL4yn zckiBofq|i+p^=f1v9YmHYin&CJYTFqpZyxrK#=rKP2nm6f%%wT+F9t*xz{ zot?eCy@P{;qobpflasTv^MeNu9zJ~N;^N}!>iX!>BR4m<$B!SoySsaMczAkxdVzma zP;YNFF66882VH%*@Pu_3BktR#tX)c1}*t>({Syb93LkdGq$|+jsBY<>loek;wP& z-{gwv6nwr|$+Pb>B z`uh5hA3ruUG<^E>35`Z$Fqp>1#-^sG&!0bk`SPW?xfzSawzRagwzjslwY9gmcXV`g zc6N4kb$$K%wY$3;hr{*s^nCyRy|=fwudlDazkgt0U~q5{kH-%U4Gj+ukBp3rj*gCv zjs5uXV|;vkVq#))a&l^F>gUg&)6>&4Gc&WZvvYHE^Yily3k!>ji%UyO%gf6vD=Vw3 zt7~g(>+9!fO!vJ%Y$_S2U&h=@r}3w#V{Rb~+{#9SuDEyo0_!s8an zR3nKgu8ZwtazC=cGpl*lBY^1B1tpO#GVT4O0g~Go(cLABAsh z-m9@TQJ~5bRmj+04y?-m?$*50mfv1ez3&XQDtVZCZzq*&(%MkMWV-sXfx1)BN&^#D z?KIt-P@odB3;6;2P&%V_skY@)3bf!LS1KUv@1stq7_GRpAu zSm|5iO>>oC$Uymh81fu{vM?!L?bFgy95n~&Gd~stWwGR|LHcLNqo`s*0UTHEjg+#H zp#pi|<^;U12R^E0DEKZtVR8`oar6@n#Xk?h9k8{x=rya@K&AeAKWu%lBO7=4@f=12 z$ewaHF_s+grbPtGJ%x~bHAV#DxX<*F8syrX2U_W&xOb6^|oU$9WZh9*(iRUp*w;QA&yQ3=e8eg(X68 zbB@mh@arq;E$^L+=&a1R>9{uv8d{im-6r|YGNPNG031G1^ePZawDMsSqe4+>5rgdn zN|lN?6krDDM`(6zFm}W-u#v&S*q{_BQE+~u$y!L_1ooPHmt%`4FO*O`awKuo(>BOu zET?b?rmK=N4+#-LoYFG;^)%R{TM-=Q1lZ`&G)n*E$~Td~phRi@%SMv$jm6D_PFl&fVP?aa+(Y{H)Hs{g$}?!OYh@~XYK`>WZ3(sh zW6+toYvj&1bXoI=U}1|=e@yznn#MC=doP3LTb1)2Njv|Ig5+Far^;Vn=-T+askvk} zO;5_T?YOeQK}4W!zhXb#4j8yM(nhNwA!gu0jmZ6%L+YjjOZpQ0I=33%fELGdL7Si} zi#MAYkDMk=B@(^Rk|?AMLF-;!kwa8fl}ea4PA%8Tv7`G11I)Hv6-Y2H3w6akKd_8z z?(TJY1oOOT%L2hPIx^2eZ`OXA&Jwk5fo&lSqLrzUw1&zD3Wu2vN1>K)3TH=A?I$g)2Q0mOM*us?t_G%|HC)awrMO9@j^TS0LOUP_!R_((lUY!%*IMBGs6MU9fMUi zUtV6n4jOa4pY#fZ#JIoSC)^X&(3GIjNy{r(Xu^%Sp%^a5iEd65>Z`HL^K1HGu{Qtc zTvXpsfnWyA1iAQ-Q+E|jMuEH=ZmBoFMlmD~Ve+>MqKv#kowsV{ z3`6}eRu2Ne^aDSj4|!?wjFhOfj-z1koIudAfq)pbeG3CRPU)!fC__YE3TI0^yR2Il z7!;VY@^rB7?PB*u3cN`i`@`dD+3ByWwQgx~uz2-!R(veDVe1eLQw$$WMKv@qX$9v9 z{>pY*708~X=u-ew1yw=9RH(2n*9jJI1_088WsH0PyO@~eK@P)EX_0`10&L`j&oUcy z_&Al;>rj}!2`hMoH=udOoSgx7BBmgEZL}@d`wk84nfrxo+-3~E;Im?ea3BA{>ju4Y z0go!RrF`N`Q^&KXm`43&uRL%FU(U~Z7-X8#^;sRosDm8kBj#q|VJ9T~#k-~{cQj{O zIk;yOu@%`e7EIq|xsypXQ02h@nCkS95b4$p`kkW83+`0iO@#Fn_ovrowP!@rBoUq4 zP9Q~DfTj|PS9g6FJA-2HUs(PZq+bXS{tImmu?JaH@i=H~px9;unJeEbyoTmmF}#w7 z>)ID<>U9eoYpLjXD2@jfPK#5(^%)diOiG^HyL<`98MQLJ6(wSyu|lGQJl7_pAM zMm4{3y>30Jc~TaIGctwXjCl)s1At3xP*0;ZKrMSf*JHXB~{*wVu26_LV~ z94qUCwDt#@Qm9n_blLIU#P?HuT@3&Y1WOE?x z76|`7s-8NBwoCgsAQG?^dQ?Ioc#Y*djkI3@S|RF2dFSz0xP2asI)ai z>H#bj#gR+{`|=;qh2Jt8ox zW+)(q-$*>8xXeegx`@aqYEbYd)8MdTQlmrYoT+qH6@m=o=s*=MK1FCxQSDGxUeya<2ANDO%JnSkDl2C)1vn>- z8ZzU@AKyGzCeqddvDDbJu(060x`uKqHUul0<}@#^qZ2-U5~bPzUrV6y_hmn{T@dEj zUdS7DXn6!MuXC={$@Qo!^~}T<`+2F6iP@~pcjptiuA1Kg$qU$d$Jn9@qOViG}$+_w{7({!sOn|I<68Ud0-wUE+&{miIsO3wMZP_JawDusIK)w4L8A zqzweg^$LrC;8w4DmBxzO=pZv)LVmSoHmme51X!dv0y;)iR7+~c85Xl$Rnf!5O90fl zBAH~#ez^^CqjGHIt;CUE)=Z@h3o4g8MG5|(wv#~r2?Sb{svx@ngFqL&f&QHfND85u zZxJ$k9(pRn#iiyaLWRyzTP;6P3xpVP8s1dGAe`-%F|o&BD*l0Q#_y zE*yY_98rk>6`{5v8x}QX%BluN#;%&9nY8{+p|z;@jH1R_F%|!T0>FU`#jSx-v;1fwV39frfHx3txr5bpm0#swOKrqapC(=UNHB= zr(XjDIX{tcBUsERVBwr3L3)r#`||)M%j3-<$nx@ku+RYcH1=V><$WGYCL0G5`*hfc zB)wTa0!BmU5*u`HMH#+kLMR^+cIuQmvbWJ<6tFPSuaiKIB7_MP0Kaqw(L0JGCH)J1 z35Q^6Ebze&F1XtLJlO=YQ~E2bIS7T9jua>=#`a*-64RB_8~*F!8`9)>JvTIC`T z7uVA5NCJRN&t=`FN|!;sL<=A3Abaww7BzICmQ0La5fa=Pu=xSSGF7QElWmxEq4h9%Eh+hQJI(a7V5|}LU<#hNX^ffCbh?SkYW)l&Zi%@bl z#HkGPzo_N^Tv7f|7rNIWnqo(iGBcu6F*vbR<6PH+UJ7dneH*|53HeKycPS#TzYYe8 zwEmZP0*mHJq9G&@r=Buctln8%C&>5&?YDNYkUi6pcj5Z7S7DLIPz}H2OJpDXo3GxC zUAbp7V+ai|(pTwFt~>TxBI@w6mJw8Wib2nQfihE;saq{BhXBf}T#h7FO%97u_F->s z$()Y3i2@)s3)4A_h)2Hlj0*X)^nc5h$r0FTP+Y{wR~r z`AT{2vY^*%4D6@xT>(rXV}Csl3r7BzbX|!Tf^kDShJPv7l-vkv7`@E{6yBs{5oZD3 zRYo484yg3zRi^g?euSIMi|h2m)^!MrTRt1tA$k72E*cdC;9@hXP>vGb z%aWhEVgkY-1ca#)0{QzE4A^~CoAyHg1;>3ru)=29MVHjzTIykVoS0= z^WJ%p)A8qHhz1zyNf$G{C2g$R)PcQ^h|u?NoWUwltj17vRF zb4GKnl1{n4M*$dL*2GIb5Kv&Bf_Z|W8+)1q7jTGZ8smPRCoL6yWy$hm!t>r{t6 z04CwE0Qnw^cT<`ufYT&7P_??7MTu@>E{t9tw|+J1dS_OZW;?JS8eqIu-28^f7$R^@ zNHK%g8Um)2%&(wOrNXBCyZHH=xjEoASP~nH&%rtkEJ2aA6$8$|c1F?V4G4m7 zyNFgszGkq$HqiY>9&!2Wn;_E&CvuplA+sJb9ryF0Ue-1cr=4}iPv`?5eB9Ai8#RC~ zs`%2=)aSC1Y{OsirqNP__-Wq|+nhApIyH;0Xg}6!HLZ4J;Y%H6xhToyQ**7uYY^i> znA1{Wr9?eJgAfPf?(R@G=cb^^yFFw6vy2T)r;A#<+u0qqe(l2@*xPzGzMn zfwU~YzAPQ1VmC+WT6kFXN(vZ3IrL!7T;3Q(;7@VLb*xc>AL@&*0)z8qZeBgtb8 z*`YL@oR8lh^BPJp7Qb}jxaelNM<|_we7?u?Xai&MPfWZQyoORyR9KoCXV4a{)mmy^ zFVyZ18=|6y0+nqX{X8ZL2KRlUh>VK@GB+XtxMdh#0t^^VuOTqU5L3RF7-08a{o5N* zsu3(B!TQ}Mc7+_lle`oDx})&xL5N3aGH^694v-g(_I!^%ko=KLH*p`ct8@LrZQG7t z11W)fC428yO8FB$@)IWX%=G8z++Nqn)iX283QGzMSz5COCsu2Bo?qKyVBO{Str}wB zW+QUux()exHS{|dJTTk&tM}n9ih=N0YJ7MexM}yE^_a*cN8OF@qpnjyE5WPdZ1`K--N{~GY?gRqWU3aH1s z=I_;I7wYU}hs#pzWnU)ksYRaj8D+@K^n-n@AO%(QG&^pXuV-j}BEOlbQj|+Kbioo@ zEF?nGcz3Wu_IA}}kxR^DB|W0o+&@tcQJ+LU1=<~i%iVrGt*kb03C$96C3);1c6I@& zA6H2oSyeLFEsVK4FFZtT`qc|w>g>B+2F$-p-OZ8e6m}6PW{ylczo^(ETU!j(oKO=5 zrE-eF>&^O`&owkia4Jajc;cX7Ocf88zwOO#iXkl0%Dl|7owdr)+dk343XSGF*?)si z&&anau8OuRV2x^Ke{vO%^^dMp4W`<}d##Nv6jOMA>w>q&aY@t?b*neM=hRv# zD*TG89#)ComqQzr5A7~mSLV5>@wbM>k9a42b7*M^@GeRW?dJc|0xvJ;tMxGC)AM