Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
< 1 2 3 4 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 734 | Ivan the Fool VS Gorynych the Dragon | dp games graphs | Statement | E | School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) {48} | PROGRAMMING | 2100 | ||
| 196 | Snow sellers | greedy sortings | Statement | F | School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) {48} | PROGRAMMING | 2600 | ||
| 347 | Galaxy Union | dp trees two pointers | Statement | G | School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) {48} | PROGRAMMING | 2600 | ||
| 193 | Black and White | constructive algorithms | Statement | H | School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) {48} | PROGRAMMING | 2600 | ||
| 7390 | Rock-paper-scissors | implementation schedules | Statement | A | School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) {48} | PROGRAMMING | 900 | ||
| 2830 | Sum | math | Statement | B | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 1600 | ||
| 2152 | Game | brute force dp implementation | Statement | D | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 1700 | ||
| 1890 | Disposition | constructive algorithms math | Statement | C | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 1700 | ||
| 818 | Common ancestor | dp | Statement | E | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 2200 | ||
| 15439 | Sleuth | implementation | Statement | A | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 800 | ||
| 6535 | Choosing Symbol Pairs | strings | Statement | B | Codeforces Beta Round 47 {50} | PROGRAMMING | Round# 47 simple tutorial | 1500 | |
| 912 | Happy Farm 5 | geometry | Statement | C | Codeforces Beta Round 47 {50} | PROGRAMMING | Round# 47 simple tutorial | 2000 | |
| 738 | Bombing | binary search dp probabilities | Statement | D | Codeforces Beta Round 47 {50} | PROGRAMMING | Codeforces #47 problem solutions | 2100 | |
| 459 | Square Equation Roots | math | Statement | E | Codeforces Beta Round 47 {50} | PROGRAMMING | Codeforces #47 problem solutions | 2300 | |
| 326641 | Domino piling | greedy math | Statement | A | Codeforces Beta Round 47 {50} | PROGRAMMING | Round# 47 simple tutorial | 800 | |
| 2097 | Cheaterius's Problem | implementation | Statement | A | Codeforces Beta Round 48 {51} | PROGRAMMING | Разбор задачек R#48 | 1300 | |
| 1052 | bHTML Tables Analisys | expression parsing | Statement | B | Codeforces Beta Round 48 {51} | PROGRAMMING | Разбор задачек R#48 | 1700 | |
| 2966 | Three Base Stations | binary search greedy | Statement | C | Codeforces Beta Round 48 {51} | PROGRAMMING | Разбор задачек R#48 | 1800 | |
| 609 | Geometrical problem | implementation | Statement | D | Codeforces Beta Round 48 {51} | PROGRAMMING | Разбор задачек R#48 | 2100 | |
| 475 | Pentagon | combinatorics graphs matrices | Statement | E | Codeforces Beta Round 48 {51} | PROGRAMMING | 2300 | ||
| 840 | Caterpillar | dfs and similar dp graphs trees | Statement | F | Codeforces Beta Round 48 {51} | PROGRAMMING | 2600 | ||
| 10742 | 123-sequence | implementation | Statement | A | Codeforces Testing Round 1 {52} | PROGRAMMING | 1200 | ||
| 2435 | Right Triangles | combinatorics | Statement | B | Codeforces Testing Round 1 {52} | PROGRAMMING | 1600 | ||
| 11661 | Circular RMQ | data structures | Statement | C | Codeforces Testing Round 1 {52} | PROGRAMMING | 2200 | ||
| 7271 | Little Frog | constructive algorithms | Statement | C | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Разбор задач Codeforces Beta Round #49(Div. 2) | 1200 | |
| 5857 | Autocomplete | implementation | Statement | A | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Разбор задач Codeforces Beta Round #49(Div. 2) | 1200 | |
| 2666 | Physical Education | sortings | Statement | D | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Tutorial for problems of Codeforces Beta Round #49 (Div.2). All problems now. | 1500 | |
| 1585 | Blog Photo | binary search implementation | Statement | B | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Разбор задач Codeforces Beta Round #49(Div. 2) | 1900 | |
| 1320 | Dead Ends | bitmasks dp | Statement | E | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Tutorial for problems of Codeforces Beta Round #49 (Div.2). All problems now. | 2500 | |
| 2590 | Presents | implementation | Statement | A | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem C | 1300 | |
| 921 | Cutting Jigsaw Puzzle | hashing implementation | Statement | B | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 1800 | |
| 1704 | First Digit Law | dp math probabilities | Statement | C | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 2000 | |
| 730 | Writing a Song | brute force dp strings | Statement | D | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 2100 | |
| 235 | Vacuum Сleaner | geometry | Statement | E | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 2700 | |
| 3930 | Flea travel | implementation math | Statement | A | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 1300 | |
| 3481 | Smallest number | brute force | Statement | B | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 1600 | |
| 1843 | Pie or die | games | Statement | C | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 1900 | |
| 861 | Very simple problem | geometry two pointers | Statement | E | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 2400 | |
| 4809 | Beautiful numbers | dp number theory | Statement | D | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 2400 | |
| 9738 | Bar | implementation | Statement | A | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 1200 | |
| 4063 | Spoilt Permutation | implementation | Statement | B | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 1400 | |
| 1316 | Corporation Mail | data structures expression parsing implementation | Statement | C | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 1800 | |
| 2891 | Domino Principle | binary search data structures sortings | Statement | E | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 2100 | |
| 2175 | Changing a String | dp | Statement | D | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 2100 | |
| 3294 | Square Earth? | dfs and similar greedy implementation | Statement | A | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 1400 | |
| 1175 | Martian Architecture | implementation | Statement | B | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 1600 | |
| 4219 | Array | combinatorics math | Statement | C | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 1900 | |
| 366 | Journey | dp math | Statement | D | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 2400 | |
| 343 | Chess | math shortest paths | Statement | E | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 2900 | |
| 158945 | Chat room | greedy strings | Statement | A | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 1100 | |
| 13354 | Coins | greedy | Statement | B | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 1300 | |
| 2280 | Trees | brute force | Statement | C | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 1800 | |
| 861 | Calendar | greedy strings | Statement | D | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 2000 | |
| 479 | Expression | dp | Statement | E | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 2400 | |
| 8075 | Fortune Telling | implementation number theory | Statement | B | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | Round 55 (DIV 2) | 1200 | |
| 2478 | Title | expression parsing | Statement | C | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | 1600 | ||
| 5093 | Shortest Path | graphs shortest paths | Statement | E | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | 2100 | ||
| 769 | Team Arrangement | constructive algorithms greedy implementation | Statement | D | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | 2200 | ||
| 234119 | Word | implementation strings | Statement | A | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | Round 55 (DIV 2) | 800 | |
| 4404 | Where Are My Flakes? | implementation two pointers | Statement | A | Codeforces Beta Round 56 {60} | PROGRAMMING | Solutions for Codeforces Beta Round #56 | 1300 | |
| 5355 | Serial Time! | dfs and similar dsu | Statement | B | Codeforces Beta Round 56 {60} | PROGRAMMING | Solutions for Codeforces Beta Round #56 | 1500 | |
| 697 | Mushroom Strife | brute force dfs and similar | Statement | C | Codeforces Beta Round 56 {60} | PROGRAMMING | Solutions for Codeforces Beta Round #56 | 2100 | |
| 574 | Savior | brute force dsu math | Statement | D | Codeforces Beta Round 56 {60} | PROGRAMMING | Solutions for Codeforces Beta Round #56 | 2400 | |
| 492 | Mushroom Gnomes | math matrices | Statement | E | Codeforces Beta Round 56 {60} | PROGRAMMING | Solutions for Codeforces Beta Round #56 | 2500 | |
| 4287 | Hard Work | strings | Statement | B | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 1300 | |
| 7754 | Eternal Victory | dfs and similar graphs greedy shortest paths trees | Statement | D | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 1900 | |
| 923 | Capture Valerian | math | Statement | C | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | 1900 | ||
| 16018 | Enemy is weak | data structures trees | Statement | E | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 2100 | |
| 139036 | Ultra-Fast Mathematician | implementation | Statement | A | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 900 | |
| 3818 | A Student's Dream | greedy math | Statement | A | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 1400 | |
| 1413 | Tyndex.Brome | binary search implementation | Statement | B | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 1700 | |
| 467 | Wormhouse | dfs and similar graphs | Statement | D | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 2300 | |
| 350 | Inquisition | geometry implementation sortings | Statement | C | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 2300 | |
| 303 | World Evil | dp flows | Statement | E | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 2700 | |
| 13583 | Sinking Ship | implementation sortings strings | Statement | A | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Разбор задач Codeforces Round #59 (Div. 2) | 1100 | |
| 5239 | Settlers' Training | implementation | Statement | B | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Solutions Codeforces Round #59 | 1200 | |
| 2015 | Bulls and Cows | brute force implementation | Statement | C | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Solutions Codeforces Round #59 | 1800 | |
| 1456 | Dividing Island | constructive algorithms | Statement | D | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Solutions Codeforces Round #59 | 2000 | |
| 879 | Sweets Game | bitmasks dfs and similar dp games implementation | Statement | E | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Разбор задач Codeforces Round #59 (Div. 2) | 2200 | |
| 4358 | Factorial | *special implementation | Statement | A | Unknown Language Round 1 {64} | PROGRAMMING | 1300 | ||
| 1054 | Expression | *special expression parsing | Statement | B | Unknown Language Round 1 {64} | PROGRAMMING | 1500 | ||
| 358 | Table | *special greedy implementation math | Statement | C | Unknown Language Round 1 {64} | PROGRAMMING | 1700 | ||
| 298 | Presents | *special greedy | Statement | D | Unknown Language Round 1 {64} | PROGRAMMING | 1900 | ||
| 295 | Prime Segment | *special brute force | Statement | E | Unknown Language Round 1 {64} | PROGRAMMING | 2000 | ||
| 193 | Domain | *special expression parsing | Statement | F | Unknown Language Round 1 {64} | PROGRAMMING | 2100 | ||
| 122 | Table Bowling | *special sortings | Statement | H | Unknown Language Round 1 {64} | PROGRAMMING | 2300 | ||
| 129 | Path Canonization | *special | Statement | G | Unknown Language Round 1 {64} | PROGRAMMING | 2300 | ||
| 94 | Sort the Table | *special sortings | Statement | I | Unknown Language Round 1 {64} | PROGRAMMING | 2500 | ||
| 1560 | Harry Potter and the History of Magic | brute force greedy implementation | Statement | B | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 1700 | |
| 2036 | Harry Potter and Three Spells | implementation math | Statement | A | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 1800 | |
| 885 | Harry Potter and the Golden Snitch | binary search geometry | Statement | C | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 2100 | |
| 498 | Harry Potter and the Sorting Hat | brute force dfs and similar hashing | Statement | D | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 2200 | |
| 109 | Harry Potter and Moving Staircases | dfs and similar implementation | Statement | E | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 2900 | |
| 23341 | Petya and Countryside | brute force implementation | Statement | B | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 1200 | |
| 7121 | Petya and Java | implementation strings | Statement | A | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 1400 | |
| 3755 | Petya and His Friends | constructive algorithms math number theory | Statement | D | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 1700 | |
| 1198 | Petya and File System | data structures implementation | Statement | C | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 1800 | |
| 947 | Petya and Post | data structures dp | Statement | E | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 2100 | |
| 955 | Restoration of the Permutation | greedy | Statement | B | Manthan 2011 {67} | PROGRAMMING | 1800 | ||
| 2550 | Partial Teacher | dp graphs greedy implementation | Statement | A | Manthan 2011 {67} | PROGRAMMING | 1800 | ||
| 1787 | Optical Experiment | binary search data structures dp | Statement | D | Manthan 2011 {67} | PROGRAMMING | 1900 | ||
| 365 | Save the City! | geometry | Statement | E | Manthan 2011 {67} | PROGRAMMING | 2400 | ||
| 771 | Sequence of Balls | dp | Statement | C | Manthan 2011 {67} | PROGRAMMING | 2500 | ||
| 5420 | Irrational problem | implementation number theory | Statement | A | Codeforces Beta Round 62 {68} | PROGRAMMING | Разбор задачи D. CF62 | 1100 | |
| 5698 | Energy exchange | binary search | Statement | B | Codeforces Beta Round 62 {68} | PROGRAMMING | Разбор задачи D. CF62 | 1700 | |
| 394 | Synchrophasotron | brute force | Statement | C | Codeforces Beta Round 62 {68} | PROGRAMMING | 2200 | ||
| 537 | Half-decay tree | data structures divide and conquer dp math probabilities | Statement | D | Codeforces Beta Round 62 {68} | PROGRAMMING | 2400 | ||
| 87 | Contact | geometry | Statement | E | Codeforces Beta Round 62 {68} | PROGRAMMING | Разбор задачи D. CF62 | 2900 | |
| 206143 | Young Physicist | implementation math | Statement | A | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 1100 | |
| 3659 | Bets | greedy implementation | Statement | B | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 1300 | |
| 5161 | Subsegments | data structures implementation | Statement | E | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 1800 | |
| 697 | Game | implementation | Statement | C | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 1900 | |
| 1152 | Dot | dp games | Statement | D | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 2100 | |
| 3579 | Cookies | math | Statement | A | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 1400 | |
| 2119 | Text Messaging | expression parsing greedy strings | Statement | B | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 1600 | |
| 651 | Lucky Tickets | binary search data structures sortings two pointers | Statement | C | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2200 | |
| 1141 | Professor's task | data structures geometry | Statement | D | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2700 | |
| 614 | Information Reform | dp implementation trees | Statement | E | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2700 | |
| 5390 | Progress Bar | implementation math | Statement | B | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 1400 | |
| 7395 | Round Table Knights | dp math number theory | Statement | C | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 1600 | |
| 807 | Solitaire | brute force implementation | Statement | D | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 2200 | |
| 978 | Nuclear Fusion | bitmasks dp | Statement | E | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 2200 | |
| 516751 | Way Too Long Words | strings | Statement | A | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 800 | |
| 2941 | Fibonacci army | *special dp | Statement | G | Unknown Language Round 2 {72} | PROGRAMMING | 1200 | ||
| 1061 | Extraordinarily Nice Numbers | *special math | Statement | C | Unknown Language Round 2 {72} | PROGRAMMING | 1300 | ||
| 484 | Goofy Numbers | *special implementation | Statement | I | Unknown Language Round 2 {72} | PROGRAMMING | 1500 | ||
| 285 | Reverse It! | *special implementation | Statement | H | Unknown Language Round 2 {72} | PROGRAMMING | 1600 | ||
| 194 | Goshtasp, Vishtasp and Eidi | *special greedy math | Statement | A | Unknown Language Round 2 {72} | PROGRAMMING | 1900 | ||
| 181 | Ali goes shopping | *special brute force strings | Statement | E | Unknown Language Round 2 {72} | PROGRAMMING | 1900 | ||
| 143 | Oil | *special greedy math | Statement | F | Unknown Language Round 2 {72} | PROGRAMMING | 2100 | ||
| 83 | Perse-script | *special expression parsing | Statement | D | Unknown Language Round 2 {72} | PROGRAMMING | 2400 | ||
| 117 | INI-file | *special implementation | Statement | B | Unknown Language Round 2 {72} | PROGRAMMING | 2500 | ||
| 1656 | The Elder Trolls IV: Oblivon | greedy math | Statement | A | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems A, B, C | 1600 | |
| 2509 | LionAge II | dp | Statement | C | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems D, E, F | 1800 | |
| 568 | Need For Brake | binary search greedy sortings | Statement | B | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems D, E, F | 2000 | |
| 773 | FreeDiv | dfs and similar graphs greedy | Statement | D | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems A, B, C | 2200 | |
| 428 | Morrowindows | math number theory | Statement | E | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems D, E, F | 2300 | |
| 127 | Plane of Tanks | brute force geometry | Statement | F | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems A, B, C | 2700 | |
| 5927 | Room Leader | implementation | Statement | A | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 1100 | |
| 1798 | Train | dp games greedy | Statement | B | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 1600 | |
| 1439 | Chessboard Billiard | dfs and similar dsu graphs number theory | Statement | C | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 2100 | |
| 446 | Hanger | data structures | Statement | D | Codeforces Beta Round 68 {74} | PROGRAMMING | Codeforces Beta Round #68, solutions problem A and problem C | 2300 | |
| 199 | Shift It! | constructive algorithms | Statement | E | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 2700 | |
| 30153 | Life Without Zeros | implementation | Statement | A | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2), my solutions | 1200 | |
| 3645 | Facetook Priority Wall | expression parsing implementation strings | Statement | B | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2) Editorial | 1500 | |
| 16299 | Modified GCD | binary search number theory | Statement | C | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2), my solutions | 1600 | |
| 2110 | Big Maximum Sum | data structures dp greedy implementation math trees | Statement | D | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2) Editorial | 2100 | |
| 318 | Ship's Shortest Path | geometry shortest paths | Statement | E | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2) Editorial | 2500 | |
| 1913 | Points | implementation math | Statement | E | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 1700 | |
| 2455 | Plus and xor | dp greedy math | Statement | D | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 1800 | |
| 821 | Mice | greedy two pointers | Statement | B | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2200 | |
| 2505 | Gift | dsu graphs sortings trees | Statement | A | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2300 | |
| 832 | Tourist | binary search data structures dp | Statement | F | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2400 | |
| 385 | Mutation | bitmasks dp math | Statement | C | All-Ukrainian School Olympiad in Informatics {76} | PROGRAMMING | All-Ukrainian School Olympiad in Informatics: editorial (A,B,C,D,E,F) | 2700 | |
| 1975 | Heroes | brute force implementation | Statement | A | Codeforces Beta Round 69 (Div. 1 Only) {77} | PROGRAMMING | Problem analysis: Codeforces Beta Round #69 Falling Anvils (Div. 1 - Problem B , Div. 2 - Problem D) | 1600 | |
| 2889 | Falling Anvils | math probabilities | Statement | B | Codeforces Beta Round 69 (Div. 1 Only) {77} | PROGRAMMING | Codeforces Beta Round #69 tutorial | 1800 | |
| 378 | Domino Carpet | dp implementation | Statement | D | Codeforces Beta Round 69 (Div. 1 Only) {77} | PROGRAMMING | Problem analysis: Codeforces Beta Round #69 Falling Anvils (Div. 1 - Problem B , Div. 2 - Problem D) | 2300 | |
| 1189 | Beavermuncher-0xFF | dfs and similar dp dsu greedy trees | Statement | C | Codeforces Beta Round 69 (Div. 1 Only) {77} | PROGRAMMING | Codeforces Beta Round #69 tutorial | 2300 | |
| 486 | Martian Food | geometry | Statement | E | Codeforces Beta Round 69 (Div. 1 Only) {77} | PROGRAMMING | Problem analysis: Codeforces Beta Round #69 Falling Anvils (Div. 1 - Problem B , Div. 2 - Problem D) | 2700 | |
| 15571 | Haiku | implementation strings | Statement | A | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 1000 | |
| 15485 | Easter Eggs | constructive algorithms implementation | Statement | B | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 1200 | |
| 2219 | Beaver Game | dp games number theory | Statement | C | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 1900 | |
| 408 | Archer's Shot | binary search geometry math two pointers | Statement | D | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 2400 | |
| 720 | Evacuation | flows graphs shortest paths | Statement | E | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 2500 | |
| 4597 | Bus Game | greedy | Statement | A | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 Editorial | 1300 | |
| 8039 | Colorful Field | implementation sortings | Statement | B | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 - разбор (перевод A-D) | 1500 | |
| 2138 | Beaver | data structures dp greedy hashing strings two pointers | Statement | C | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 Editorial | 1800 | |
| 1429 | Password | bitmasks dp shortest paths | Statement | D | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 - разбор (перевод A-D) | 2700 | |
| 182 | Security System | math | Statement | E | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 - разбор (перевод A-D) | 2800 | |
| 5056 | Depression | geometry math | Statement | B | Codeforces Beta Round 69 (Div. 2 Only) {80} | PROGRAMMING | Problem analysis: Codeforces Beta Round #69 Falling Anvils (Div. 1 - Problem B , Div. 2 - Problem D) | 1200 | |
| 67670 | Panoramix's Prediction | brute force | Statement | A | Codeforces Beta Round 69 (Div. 2 Only) {80} | PROGRAMMING | Codeforces Beta Round #69 tutorial | 900 | |
| 14163 | Plug-in | implementation | Statement | A | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 1500 | ||
| 2160 | Sequence Formatting | implementation strings | Statement | B | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 1700 | ||
| 1860 | Average Score | greedy math sortings | Statement | C | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 1700 | ||
| 824 | Polycarp's Picture Gallery | constructive algorithms greedy | Statement | D | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2000 | ||
| 430 | Pairs | dfs and similar dp dsu graphs implementation trees | Statement | E | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2600 | ||
| 32505 | Double Cola | implementation math | Statement | A | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 1100 | |
| 2343 | Sets | constructive algorithms hashing implementation | Statement | B | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 1700 | |
| 903 | General Mobilization | data structures dfs and similar sortings | Statement | C | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 1900 | |
| 2331 | Two out of Three | dp | Statement | D | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 2000 | |
| 265 | Corridor | geometry | Statement | E | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 2500 | |
| 6949 | Magical Array | math | Statement | A | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | разбор E | 1400 | |
| 1908 | Doctor | binary search math sortings | Statement | B | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | 1900 | ||
| 493 | Track | graphs greedy shortest paths | Statement | C | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | 2400 | ||
| 1080 | Numbers | dp math number theory | Statement | D | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | разбор E | 2400 | |
| 567 | Two Subsequences | bitmasks dp | Statement | E | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | разбор E | 2800 | |
| 16732 | Toy Army | math number theory | Statement | A | Codeforces Beta Round 72 (Div. 2 Only) {84} | PROGRAMMING | 1000 | ||
| 1872 | Biathlon | binary search implementation | Statement | C | Codeforces Beta Round 72 (Div. 2 Only) {84} | PROGRAMMING | 1700 | ||
| 2037 | Domino | constructive algorithms implementation | Statement | A | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 1400 | |
| 1085 | Embassy Queue | data structures greedy | Statement | B | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 1800 | |
| 2513 | Sum of Medians | binary search brute force data structures implementation | Statement | D | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 2200 | |
| 638 | Petya and Tree | binary search dfs and similar probabilities sortings trees | Statement | C | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Yandex.Algorithm 2011 - Round 1. Problem C. Tutorial | 2200 | |
| 1134 | Guard Towers | binary search dsu geometry graphs sortings | Statement | E | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Яндекс.Алгоритм 2011 - Раунд 1 (Разбор задачи Е "Сторожевые башни") | 2600 | |
| 1671 | Reflection | math | Statement | A | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 1800 | |
| 465 | Tetris revisited | constructive algorithms graph matchings greedy math | Statement | B | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2100 | |
| 928 | Genetic engineering | dp string suffix structures trees | Statement | C | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2400 | |
| 224 | Long sequence | brute force math matrices | Statement | E | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2600 | |
| 17520 | Powerful array | data structures implementation math two pointers | Statement | D | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2700 | |
| 5854 | Trains | implementation math | Statement | A | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 1500 | |
| 1271 | Vasya and Types | implementation strings | Statement | B | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 1900 | |
| 1746 | Interesting Game | dp games math | Statement | C | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 2100 | |
| 1086 | Beautiful Road | dfs and similar dp dsu graphs implementation sortings trees | Statement | D | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 2300 | |
| 804 | Mogohu-Rea Idol | geometry | Statement | E | Codeforces Beta Round 73 (Div. 1 Only) {87} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 2600 | |
| 4113 | Chord | brute force implementation | Statement | A | Codeforces Beta Round 73 (Div. 2 Only) {88} | PROGRAMMING | Codeforces Beta Round #73. Tutorial (Div2) | 1200 | |
| 5302 | Keyboard | implementation | Statement | B | Codeforces Beta Round 73 (Div. 2 Only) {88} | PROGRAMMING | CodeForces Beta Round #73 div. 1 analysis (particulary with div. 2) | 1500 | |
| 1622 | Robbery | greedy | Statement | A | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 1800 | |
| 706 | Chip Play | brute force data structures implementation | Statement | C | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 2100 | |
| 615 | Widget Library | dp expression parsing graphs implementation | Statement | B | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 2200 | |
| 314 | Space mines | geometry | Statement | D | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 2400 | |
| 121 | Fire and Ice | greedy | Statement | E | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Codeforces Beta Round #74 - Short editorial except Div. 1 E | 2900 | |
| 5591 | Cableway | greedy math | Statement | A | Codeforces Beta Round 74 (Div. 2 Only) {90} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 1000 | |
| 5759 | African Crossword | implementation strings | Statement | B | Codeforces Beta Round 74 (Div. 2 Only) {90} | PROGRAMMING | Codeforces Beta Round #74 - Short editorial except Div. 1 E | 1100 | |
| 7893 | Queue | binary search data structures | Statement | B | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 1600 | |
| 4010 | Newspaper Headline | greedy strings | Statement | A | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 1600 | |
| 696 | Igloo Skyscraper | data structures geometry | Statement | E | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 2400 | |
| 1026 | Ski Base | combinatorics dsu graphs | Statement | C | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 2500 | |
| 313 | Grocer's Problem | constructive algorithms graphs greedy | Statement | D | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 2500 | |
| 5407 | Binary Number | greedy | Statement | B | Codeforces Beta Round 75 (Div. 2 Only) {92} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 1300 | |
| 21733 | Chips | implementation math | Statement | A | Codeforces Beta Round 75 (Div. 2 Only) {92} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 800 | |
| 2086 | Frames | implementation | Statement | A | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 1700 | |
| 998 | End of Exams | greedy | Statement | B | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 1900 | |
| 470 | Flags | dp math matrices | Statement | D | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 2400 | |
| 468 | Azembler | brute force implementation | Statement | C | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 2400 | |
| 549 | Lostborn | dp math number theory | Statement | E | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 2600 | |
| 12484 | Restoring Password | implementation strings | Statement | A | Codeforces Beta Round 76 (Div. 2 Only) {94} | PROGRAMMING | Analysis Beta Round #76 (Div. 2-A,B,C) | 1000 | |
| 5424 | Friends | graphs implementation math | Statement | B | Codeforces Beta Round 76 (Div. 2 Only) {94} | PROGRAMMING | Analysis Beta Round #76 (Div. 2-A,B,C) | 1400 | |
| 1868 | Hockey | implementation strings | Statement | A | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 1700 | |
| 1412 | Lucky Numbers | dp greedy | Statement | B | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 1800 | |
| 3452 | Volleyball | shortest paths | Statement | C | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 1900 | |
| 2048 | Lucky Country | dp dsu graphs | Statement | E | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 2400 | |
| 550 | Horse Races | dp math | Statement | D | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 2500 | |
| 197625 | Football | implementation strings | Statement | A | Codeforces Beta Round 77 (Div. 2 Only) {96} | PROGRAMMING | Codeforces Beta Round #77 (Div. 2 Only) Question A - D | 1100 | |
| 19575 | Lucky Numbers (easy) | binary search bitmasks brute force | Statement | B | Codeforces Beta Round 77 (Div. 2 Only) {96} | PROGRAMMING | Codeforces Beta Round #77 (Div. 2 Only) Question A - D | 1400 | |
| 366 | Winning Strategy | binary search graphs math shortest paths | Statement | C | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2300 | |
| 1019 | Superset | constructive algorithms divide and conquer | Statement | B | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Yandex.Algorithm final: Problem D tutorial | 2300 | |
| 349 | Domino | brute force implementation | Statement | A | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2400 | |
| 358 | Robot in Basement | bitmasks brute force implementation | Statement | D | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2600 | |
| 448 | Leaders | dfs and similar dsu graphs trees | Statement | E | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2800 | |
| 1360 | Help Victoria the Wise | brute force implementation | Statement | A | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | Editorial | 1700 | |
| 206 | Help Monks | constructive algorithms | Statement | D | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | 2400 | ||
| 371 | Help Greg the Dwarf | geometry ternary search | Statement | C | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | 2400 | ||
| 569 | Help Shrek and Donkey | dp games math probabilities | Statement | E | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | Editorial | 2500 | |
| 161 | Help King | implementation probabilities trees | Statement | B | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | 2600 | ||
| 7874 | Help Far Away Kingdom | strings | Statement | A | Codeforces Beta Round 78 (Div. 2 Only) {99} | PROGRAMMING | Solution for problem B in round 78 | 1000 | |
| 3238 | Help Chef Gerasim | implementation sortings | Statement | B | Codeforces Beta Round 78 (Div. 2 Only) {99} | PROGRAMMING | Codeforces Beta Round #78 Div 2 (ABC solutions) | 1400 | |
| 1045 | Carpeting the Room | *special implementation | Statement | A | Unknown Language Round 3 {100} | PROGRAMMING | 1300 | ||
| 633 | A+B | *special implementation | Statement | C | Unknown Language Round 3 {100} | PROGRAMMING | 1400 | ||
| 366 | World of Mouth | *special strings | Statement | D | Unknown Language Round 3 {100} | PROGRAMMING | 1600 | ||
| 617 | Friendly Numbers | *special implementation | Statement | B | Unknown Language Round 3 {100} | PROGRAMMING | 1600 | ||
| 432 | Rotation | *special geometry math | Statement | I | Unknown Language Round 3 {100} | PROGRAMMING | 1700 |