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 |
|---|---|---|---|---|---|---|---|---|---|
| 709 | 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 | ||
| 189 | 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 | ||
| 324 | 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 | ||
| 184 | 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 | ||
| 7314 | 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 | ||
| 2815 | Sum | math | Statement | B | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 1600 | ||
| 2139 | Game | brute force dp implementation | Statement | D | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 1700 | ||
| 1875 | Disposition | constructive algorithms math | Statement | C | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 1700 | ||
| 798 | Common ancestor | dp | Statement | E | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 2200 | ||
| 15325 | Sleuth | implementation | Statement | A | Codeforces Beta Round 46 (Div. 2) {49} | PROGRAMMING | 800 | ||
| 6465 | Choosing Symbol Pairs | strings | Statement | B | Codeforces Beta Round 47 {50} | PROGRAMMING | Round# 47 simple tutorial | 1500 | |
| 886 | Happy Farm 5 | geometry | Statement | C | Codeforces Beta Round 47 {50} | PROGRAMMING | Round# 47 simple tutorial | 2000 | |
| 708 | Bombing | binary search dp probabilities | Statement | D | Codeforces Beta Round 47 {50} | PROGRAMMING | Codeforces #47 problem solutions | 2100 | |
| 435 | Square Equation Roots | math | Statement | E | Codeforces Beta Round 47 {50} | PROGRAMMING | Codeforces #47 problem solutions | 2300 | |
| 321512 | Domino piling | greedy math | Statement | A | Codeforces Beta Round 47 {50} | PROGRAMMING | Round# 47 simple tutorial | 800 | |
| 2089 | Cheaterius's Problem | implementation | Statement | A | Codeforces Beta Round 48 {51} | PROGRAMMING | Разбор задачек R#48 | 1300 | |
| 1047 | bHTML Tables Analisys | expression parsing | Statement | B | Codeforces Beta Round 48 {51} | PROGRAMMING | Разбор задачек R#48 | 1700 | |
| 2940 | Three Base Stations | binary search greedy | Statement | C | Codeforces Beta Round 48 {51} | PROGRAMMING | Разбор задачек R#48 | 1800 | |
| 564 | Geometrical problem | implementation | Statement | D | Codeforces Beta Round 48 {51} | PROGRAMMING | Разбор задачек R#48 | 2100 | |
| 459 | Pentagon | combinatorics graphs matrices | Statement | E | Codeforces Beta Round 48 {51} | PROGRAMMING | 2300 | ||
| 822 | Caterpillar | dfs and similar dp graphs trees | Statement | F | Codeforces Beta Round 48 {51} | PROGRAMMING | 2600 | ||
| 10641 | 123-sequence | implementation | Statement | A | Codeforces Testing Round 1 {52} | PROGRAMMING | 1200 | ||
| 2419 | Right Triangles | combinatorics | Statement | B | Codeforces Testing Round 1 {52} | PROGRAMMING | 1600 | ||
| 11395 | Circular RMQ | data structures | Statement | C | Codeforces Testing Round 1 {52} | PROGRAMMING | 2200 | ||
| 7140 | Little Frog | constructive algorithms | Statement | C | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Разбор задач Codeforces Beta Round #49(Div. 2) | 1200 | |
| 5807 | Autocomplete | implementation | Statement | A | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Разбор задач Codeforces Beta Round #49(Div. 2) | 1200 | |
| 2645 | 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 | |
| 1573 | Blog Photo | binary search implementation | Statement | B | Codeforces Beta Round 49 (Div. 2) {53} | PROGRAMMING | Разбор задач Codeforces Beta Round #49(Div. 2) | 1900 | |
| 1283 | 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 | |
| 2555 | Presents | implementation | Statement | A | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem C | 1300 | |
| 914 | Cutting Jigsaw Puzzle | hashing implementation | Statement | B | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 1800 | |
| 1651 | First Digit Law | dp math probabilities | Statement | C | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 2000 | |
| 711 | Writing a Song | brute force dp strings | Statement | D | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 2100 | |
| 214 | Vacuum Сleaner | geometry | Statement | E | Codeforces Beta Round 50 {54} | PROGRAMMING | Codeforces Beta Round #50: Editorial for problem E | 2700 | |
| 3894 | Flea travel | implementation math | Statement | A | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 1300 | |
| 3463 | Smallest number | brute force | Statement | B | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 1600 | |
| 1833 | Pie or die | games | Statement | C | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 1900 | |
| 825 | Very simple problem | geometry two pointers | Statement | E | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 2400 | |
| 4662 | Beautiful numbers | dp number theory | Statement | D | Codeforces Beta Round 51 {55} | PROGRAMMING | Round 51, A | 2400 | |
| 9673 | Bar | implementation | Statement | A | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 1200 | |
| 4032 | Spoilt Permutation | implementation | Statement | B | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 1400 | |
| 1311 | Corporation Mail | data structures expression parsing implementation | Statement | C | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 1800 | |
| 2848 | Domino Principle | binary search data structures sortings | Statement | E | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 2100 | |
| 2120 | Changing a String | dp | Statement | D | Codeforces Beta Round 52 (Div. 2) {56} | PROGRAMMING | CodeForces Beta Round #52 :: Разбор задач | 2100 | |
| 3268 | Square Earth? | dfs and similar greedy implementation | Statement | A | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 1400 | |
| 1172 | Martian Architecture | implementation | Statement | B | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 1600 | |
| 4092 | Array | combinatorics math | Statement | C | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 1900 | |
| 361 | Journey | dp math | Statement | D | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 2400 | |
| 291 | Chess | math shortest paths | Statement | E | Codeforces Beta Round 53 {57} | PROGRAMMING | Codeforces Beta Round #53 [Analysis] | 2900 | |
| 156977 | Chat room | greedy strings | Statement | A | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 1100 | |
| 13269 | Coins | greedy | Statement | B | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 1300 | |
| 2268 | Trees | brute force | Statement | C | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 1800 | |
| 836 | Calendar | greedy strings | Statement | D | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 2000 | |
| 465 | Expression | dp | Statement | E | Codeforces Beta Round 54 (Div. 2) {58} | PROGRAMMING | Codeforces Beta Round #54 (Div.2) - разбор A-D | 2400 | |
| 7983 | Fortune Telling | implementation number theory | Statement | B | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | Round 55 (DIV 2) | 1200 | |
| 2462 | Title | expression parsing | Statement | C | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | 1600 | ||
| 4901 | Shortest Path | graphs shortest paths | Statement | E | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | 2100 | ||
| 752 | Team Arrangement | constructive algorithms greedy implementation | Statement | D | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | 2200 | ||
| 230022 | Word | implementation strings | Statement | A | Codeforces Beta Round 55 (Div. 2) {59} | PROGRAMMING | Round 55 (DIV 2) | 800 | |
| 4381 | Where Are My Flakes? | implementation two pointers | Statement | A | Codeforces Beta Round 56 {60} | PROGRAMMING | Solutions for Codeforces Beta Round #56 | 1300 | |
| 5336 | Serial Time! | dfs and similar dsu | Statement | B | Codeforces Beta Round 56 {60} | PROGRAMMING | Solutions for Codeforces Beta Round #56 | 1500 | |
| 657 | Mushroom Strife | brute force dfs and similar | Statement | C | Codeforces Beta Round 56 {60} | PROGRAMMING | Solutions for Codeforces Beta Round #56 | 2100 | |
| 548 | Savior | brute force dsu math | Statement | D | Codeforces Beta Round 56 {60} | PROGRAMMING | Solutions for Codeforces Beta Round #56 | 2400 | |
| 417 | Mushroom Gnomes | math matrices | Statement | E | Codeforces Beta Round 56 {60} | PROGRAMMING | Solutions for Codeforces Beta Round #56 | 2500 | |
| 4250 | Hard Work | strings | Statement | B | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 1300 | |
| 7676 | Eternal Victory | dfs and similar graphs greedy shortest paths trees | Statement | D | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 1900 | |
| 852 | Capture Valerian | math | Statement | C | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | 1900 | ||
| 15410 | Enemy is weak | data structures trees | Statement | E | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 2100 | |
| 137222 | Ultra-Fast Mathematician | implementation | Statement | A | Codeforces Beta Round 57 (Div. 2) {61} | PROGRAMMING | Round 57-A | 900 | |
| 3782 | A Student's Dream | greedy math | Statement | A | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 1400 | |
| 1406 | Tyndex.Brome | binary search implementation | Statement | B | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 1700 | |
| 451 | Wormhouse | dfs and similar graphs | Statement | D | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 2300 | |
| 337 | Inquisition | geometry implementation sortings | Statement | C | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 2300 | |
| 283 | World Evil | dp flows | Statement | E | Codeforces Beta Round 58 {62} | PROGRAMMING | Codeforces Beta Round #58 tutorial | 2700 | |
| 13470 | Sinking Ship | implementation sortings strings | Statement | A | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Разбор задач Codeforces Round #59 (Div. 2) | 1100 | |
| 5217 | Settlers' Training | implementation | Statement | B | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Solutions Codeforces Round #59 | 1200 | |
| 2007 | Bulls and Cows | brute force implementation | Statement | C | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Solutions Codeforces Round #59 | 1800 | |
| 1450 | Dividing Island | constructive algorithms | Statement | D | Codeforces Beta Round 59 (Div. 2) {63} | PROGRAMMING | Solutions Codeforces Round #59 | 2000 | |
| 858 | 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 | |
| 4260 | 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 | ||
| 356 | 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 | ||
| 1555 | 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 | |
| 2017 | Harry Potter and Three Spells | implementation math | Statement | A | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 1800 | |
| 869 | Harry Potter and the Golden Snitch | binary search geometry | Statement | C | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 2100 | |
| 481 | 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 | |
| 106 | Harry Potter and Moving Staircases | dfs and similar implementation | Statement | E | Codeforces Beta Round 60 {65} | PROGRAMMING | Codeforces Beta Round #60: tutorial | 2900 | |
| 23197 | Petya and Countryside | brute force implementation | Statement | B | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 1200 | |
| 7095 | Petya and Java | implementation strings | Statement | A | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 1400 | |
| 3737 | 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 | |
| 1195 | 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 | |
| 927 | Petya and Post | data structures dp | Statement | E | Codeforces Beta Round 61 (Div. 2) {66} | PROGRAMMING | Codeforces Beta Round #61 (Div. 2): Editorial | 2100 | |
| 952 | Restoration of the Permutation | greedy | Statement | B | Manthan 2011 {67} | PROGRAMMING | 1800 | ||
| 2495 | Partial Teacher | dp graphs greedy implementation | Statement | A | Manthan 2011 {67} | PROGRAMMING | 1800 | ||
| 1780 | Optical Experiment | binary search data structures dp | Statement | D | Manthan 2011 {67} | PROGRAMMING | 1900 | ||
| 342 | Save the City! | geometry | Statement | E | Manthan 2011 {67} | PROGRAMMING | 2400 | ||
| 746 | Sequence of Balls | dp | Statement | C | Manthan 2011 {67} | PROGRAMMING | 2500 | ||
| 5384 | Irrational problem | implementation number theory | Statement | A | Codeforces Beta Round 62 {68} | PROGRAMMING | Разбор задачи D. CF62 | 1100 | |
| 5619 | Energy exchange | binary search | Statement | B | Codeforces Beta Round 62 {68} | PROGRAMMING | Разбор задачи D. CF62 | 1700 | |
| 353 | Synchrophasotron | brute force | Statement | C | Codeforces Beta Round 62 {68} | PROGRAMMING | 2200 | ||
| 532 | Half-decay tree | data structures divide and conquer dp math probabilities | Statement | D | Codeforces Beta Round 62 {68} | PROGRAMMING | 2400 | ||
| 84 | Contact | geometry | Statement | E | Codeforces Beta Round 62 {68} | PROGRAMMING | Разбор задачи D. CF62 | 2900 | |
| 203786 | Young Physicist | implementation math | Statement | A | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 1100 | |
| 3636 | Bets | greedy implementation | Statement | B | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 1300 | |
| 5111 | Subsegments | data structures implementation | Statement | E | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 1800 | |
| 674 | Game | implementation | Statement | C | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 1900 | |
| 1139 | Dot | dp games | Statement | D | Codeforces Beta Round 63 (Div. 2) {69} | PROGRAMMING | Analysis Codeforces Beta Round #63 (Div. 2) | 2100 | |
| 3567 | Cookies | math | Statement | A | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 1400 | |
| 2108 | Text Messaging | expression parsing greedy strings | Statement | B | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 1600 | |
| 632 | Lucky Tickets | binary search data structures sortings two pointers | Statement | C | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2200 | |
| 1100 | Professor's task | data structures geometry | Statement | D | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2700 | |
| 592 | Information Reform | dp implementation trees | Statement | E | Codeforces Beta Round 64 {70} | PROGRAMMING | Analysis Codeforces Beta Round #64 | 2700 | |
| 5338 | Progress Bar | implementation math | Statement | B | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 1400 | |
| 7364 | Round Table Knights | dp math number theory | Statement | C | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 1600 | |
| 776 | Solitaire | brute force implementation | Statement | D | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 2200 | |
| 949 | Nuclear Fusion | bitmasks dp | Statement | E | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 2200 | |
| 507858 | Way Too Long Words | strings | Statement | A | Codeforces Beta Round 65 (Div. 2) {71} | PROGRAMMING | Разбор задач Codeforces Beta Round #65 (Div. 2) | 800 | |
| 2851 | Fibonacci army | *special dp | Statement | G | Unknown Language Round 2 {72} | PROGRAMMING | 1200 | ||
| 1056 | Extraordinarily Nice Numbers | *special math | Statement | C | Unknown Language Round 2 {72} | PROGRAMMING | 1300 | ||
| 483 | Goofy Numbers | *special implementation | Statement | I | Unknown Language Round 2 {72} | PROGRAMMING | 1500 | ||
| 284 | 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 | ||
| 1644 | 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 | |
| 2494 | LionAge II | dp | Statement | C | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems D, E, F | 1800 | |
| 548 | 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 | |
| 755 | FreeDiv | dfs and similar graphs greedy | Statement | D | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems A, B, C | 2200 | |
| 415 | Morrowindows | math number theory | Statement | E | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems D, E, F | 2300 | |
| 107 | Plane of Tanks | brute force geometry | Statement | F | Codeforces Beta Round 66 {73} | PROGRAMMING | Codeforces Beta Round #66 editorial: Problems A, B, C | 2700 | |
| 5894 | Room Leader | implementation | Statement | A | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 1100 | |
| 1790 | Train | dp games greedy | Statement | B | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 1600 | |
| 1414 | Chessboard Billiard | dfs and similar dsu graphs number theory | Statement | C | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 2100 | |
| 420 | Hanger | data structures | Statement | D | Codeforces Beta Round 68 {74} | PROGRAMMING | Codeforces Beta Round #68, solutions problem A and problem C | 2300 | |
| 186 | Shift It! | constructive algorithms | Statement | E | Codeforces Beta Round 68 {74} | PROGRAMMING | Solutions for Codeforces Beta Round #68 | 2700 | |
| 29849 | Life Without Zeros | implementation | Statement | A | Codeforces Beta Round 67 (Div. 2) {75} | PROGRAMMING | Codeforces Beta Round #67 (Div. 2), my solutions | 1200 | |
| 3626 | 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 | |
| 16100 | 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 | |
| 2079 | 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 | |
| 303 | 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 | |
| 1899 | 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 | |
| 2412 | 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 | |
| 803 | 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 | |
| 2320 | 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 | |
| 778 | 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 | |
| 370 | 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 | |
| 1958 | 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 | |
| 2877 | Falling Anvils | math probabilities | Statement | B | Codeforces Beta Round 69 (Div. 1 Only) {77} | PROGRAMMING | Codeforces Beta Round #69 tutorial | 1800 | |
| 365 | 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 | |
| 1172 | 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 | |
| 422 | 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 | |
| 15487 | Haiku | implementation strings | Statement | A | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 1000 | |
| 15399 | Easter Eggs | constructive algorithms implementation | Statement | B | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 1200 | |
| 2186 | 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 | |
| 396 | 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 | |
| 697 | Evacuation | flows graphs shortest paths | Statement | E | Codeforces Beta Round 70 (Div. 2) {78} | PROGRAMMING | Solutions for Codeforces Beta Round #70 (Div. 2) | 2500 | |
| 4571 | Bus Game | greedy | Statement | A | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 Editorial | 1300 | |
| 8010 | Colorful Field | implementation sortings | Statement | B | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 - разбор (перевод A-D) | 1500 | |
| 2122 | Beaver | data structures dp greedy hashing strings two pointers | Statement | C | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 Editorial | 1800 | |
| 1349 | Password | bitmasks dp shortest paths | Statement | D | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 - разбор (перевод A-D) | 2700 | |
| 160 | Security System | math | Statement | E | Codeforces Beta Round 71 {79} | PROGRAMMING | Codeforces Beta Round #71 - разбор (перевод A-D) | 2800 | |
| 5016 | 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 | |
| 66803 | Panoramix's Prediction | brute force | Statement | A | Codeforces Beta Round 69 (Div. 2 Only) {80} | PROGRAMMING | Codeforces Beta Round #69 tutorial | 900 | |
| 14006 | Plug-in | implementation | Statement | A | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 1500 | ||
| 2142 | Sequence Formatting | implementation strings | Statement | B | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 1700 | ||
| 1855 | Average Score | greedy math sortings | Statement | C | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 1700 | ||
| 809 | Polycarp's Picture Gallery | constructive algorithms greedy | Statement | D | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2000 | ||
| 402 | Pairs | dfs and similar dp dsu graphs implementation trees | Statement | E | Yandex.Algorithm Open 2011: Qualification 1 {81} | PROGRAMMING | 2600 | ||
| 32284 | Double Cola | implementation math | Statement | A | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 1100 | |
| 2339 | Sets | constructive algorithms hashing implementation | Statement | B | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 1700 | |
| 872 | General Mobilization | data structures dfs and similar sortings | Statement | C | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 1900 | |
| 2303 | Two out of Three | dp | Statement | D | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 2000 | |
| 248 | Corridor | geometry | Statement | E | Yandex.Algorithm 2011: Qualification 2 {82} | PROGRAMMING | 1889 | 2500 | |
| 6881 | Magical Array | math | Statement | A | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | разбор E | 1400 | |
| 1897 | Doctor | binary search math sortings | Statement | B | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | 1900 | ||
| 478 | Track | graphs greedy shortest paths | Statement | C | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | 2400 | ||
| 1034 | Numbers | dp math number theory | Statement | D | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | разбор E | 2400 | |
| 544 | Two Subsequences | bitmasks dp | Statement | E | Codeforces Beta Round 72 (Div. 1 Only) {83} | PROGRAMMING | разбор E | 2800 | |
| 16651 | Toy Army | math number theory | Statement | A | Codeforces Beta Round 72 (Div. 2 Only) {84} | PROGRAMMING | 1000 | ||
| 1862 | Biathlon | binary search implementation | Statement | C | Codeforces Beta Round 72 (Div. 2 Only) {84} | PROGRAMMING | 1700 | ||
| 2026 | 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 | |
| 2428 | 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 | |
| 625 | 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 | |
| 1104 | Guard Towers | binary search dsu geometry graphs sortings | Statement | E | Yandex.Algorithm 2011: Round 1 {85} | PROGRAMMING | Яндекс.Алгоритм 2011 - Раунд 1 (Разбор задачи Е "Сторожевые башни") | 2600 | |
| 1663 | Reflection | math | Statement | A | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 1800 | |
| 454 | Tetris revisited | constructive algorithms graph matchings greedy math | Statement | B | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2100 | |
| 873 | Genetic engineering | dp string suffix structures trees | Statement | C | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2400 | |
| 205 | Long sequence | brute force math matrices | Statement | E | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2600 | |
| 17011 | Powerful array | data structures implementation math two pointers | Statement | D | Yandex.Algorithm 2011: Round 2 {86} | PROGRAMMING | Problemset analysis (Yandex, Round 2) | 2700 | |
| 5832 | 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 | |
| 1267 | 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 | |
| 1716 | 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 | |
| 1058 | 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 | |
| 760 | 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 | |
| 4096 | Chord | brute force implementation | Statement | A | Codeforces Beta Round 73 (Div. 2 Only) {88} | PROGRAMMING | Codeforces Beta Round #73. Tutorial (Div2) | 1200 | |
| 5282 | 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 | |
| 1617 | Robbery | greedy | Statement | A | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 1800 | |
| 689 | 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 | |
| 610 | 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 | |
| 268 | Space mines | geometry | Statement | D | Codeforces Beta Round 74 (Div. 1 Only) {89} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 2400 | |
| 118 | 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 | |
| 5517 | Cableway | greedy math | Statement | A | Codeforces Beta Round 74 (Div. 2 Only) {90} | PROGRAMMING | Solutions for Codeforces Beta Round #74 | 1000 | |
| 5731 | 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 | |
| 7799 | Queue | binary search data structures | Statement | B | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 1600 | |
| 3963 | Newspaper Headline | greedy strings | Statement | A | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 1600 | |
| 673 | Igloo Skyscraper | data structures geometry | Statement | E | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 2400 | |
| 1014 | Ski Base | combinatorics dsu graphs | Statement | C | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 2500 | |
| 297 | Grocer's Problem | constructive algorithms graphs greedy | Statement | D | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 2500 | |
| 5375 | Binary Number | greedy | Statement | B | Codeforces Beta Round 75 (Div. 2 Only) {92} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 1300 | |
| 21603 | Chips | implementation math | Statement | A | Codeforces Beta Round 75 (Div. 2 Only) {92} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 800 | |
| 2081 | Frames | implementation | Statement | A | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 1700 | |
| 995 | End of Exams | greedy | Statement | B | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 1900 | |
| 445 | Flags | dp math matrices | Statement | D | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 2400 | |
| 450 | Azembler | brute force implementation | Statement | C | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 2400 | |
| 541 | Lostborn | dp math number theory | Statement | E | Codeforces Beta Round 76 (Div. 1 Only) {93} | PROGRAMMING | Codeforces Beta Round 76 - задача Е div 1 глазами ее автора. | 2600 | |
| 12341 | 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 | |
| 5391 | 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 | |
| 1859 | Hockey | implementation strings | Statement | A | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 1700 | |
| 1402 | Lucky Numbers | dp greedy | Statement | B | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 1800 | |
| 3413 | Volleyball | shortest paths | Statement | C | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 1900 | |
| 1935 | Lucky Country | dp dsu graphs | Statement | E | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 2400 | |
| 506 | Horse Races | dp math | Statement | D | Codeforces Beta Round 77 (Div. 1 Only) {95} | PROGRAMMING | Codeforces Beta Round #77 - Analysis | 2500 | |
| 194999 | 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 | |
| 19326 | 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 | |
| 354 | Winning Strategy | binary search graphs math shortest paths | Statement | C | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2300 | |
| 1003 | Superset | constructive algorithms divide and conquer | Statement | B | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Yandex.Algorithm final: Problem D tutorial | 2300 | |
| 336 | Domino | brute force implementation | Statement | A | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2400 | |
| 290 | Robot in Basement | bitmasks brute force implementation | Statement | D | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2600 | |
| 433 | Leaders | dfs and similar dsu graphs trees | Statement | E | Yandex.Algorithm 2011: Finals {97} | PROGRAMMING | Финал Яндекс.Алгоритм: разбор A-B | 2800 | |
| 1353 | Help Victoria the Wise | brute force implementation | Statement | A | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | Editorial | 1700 | |
| 200 | Help Monks | constructive algorithms | Statement | D | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | 2400 | ||
| 357 | Help Greg the Dwarf | geometry ternary search | Statement | C | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | 2400 | ||
| 558 | Help Shrek and Donkey | dp games math probabilities | Statement | E | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | Editorial | 2500 | |
| 153 | Help King | implementation probabilities trees | Statement | B | Codeforces Beta Round 78 (Div. 1 Only) {98} | PROGRAMMING | 2600 | ||
| 7765 | Help Far Away Kingdom | strings | Statement | A | Codeforces Beta Round 78 (Div. 2 Only) {99} | PROGRAMMING | Solution for problem B in round 78 | 1000 | |
| 3222 | 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 | |
| 1031 | Carpeting the Room | *special implementation | Statement | A | Unknown Language Round 3 {100} | PROGRAMMING | 1300 | ||
| 627 | A+B | *special implementation | Statement | C | Unknown Language Round 3 {100} | PROGRAMMING | 1400 | ||
| 365 | World of Mouth | *special strings | Statement | D | Unknown Language Round 3 {100} | PROGRAMMING | 1600 | ||
| 581 | Friendly Numbers | *special implementation | Statement | B | Unknown Language Round 3 {100} | PROGRAMMING | 1600 | ||
| 430 | Rotation | *special geometry math | Statement | I | Unknown Language Round 3 {100} | PROGRAMMING | 1700 |