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 5 6 7 8 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 37329 | Lights Out | implementation | Statement | A | Codeforces Round 168 (Div. 2) {275} | PROGRAMMING | Codeforces Round #168 Editorial | 1000 | |
| 3098 | Convex Shape | constructive algorithms implementation | Statement | B | Codeforces Round 168 (Div. 2) {275} | PROGRAMMING | Codeforces Round #168 Editorial | 1600 | |
| 30487 | Lunch Rush | implementation | Statement | A | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 1000 | |
| 32839 | Little Girl and Game | games greedy | Statement | B | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 1400 | |
| 42874 | Little Girl and Maximum Sum | data structures greedy implementation sortings | Statement | C | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 1600 | |
| 16929 | Little Girl and Maximum XOR | bitmasks dp greedy implementation math | Statement | D | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 1800 | |
| 1945 | Little Girl and Problem on Trees | data structures graphs trees | Statement | E | Codeforces Round 169 (Div. 2) {276} | PROGRAMMING | Codeforces Round #169 — Unofficial Editorial | 2300 | |
| 22330 | Learning Languages | dfs and similar dsu | Statement | A | Codeforces Round 170 (Div. 1) {277} | PROGRAMMING | Codeforces Round #170 Tutorial | 1500 | |
| 864 | Set of Points | constructive algorithms geometry | Statement | B | Codeforces Round 170 (Div. 1) {277} | PROGRAMMING | Codeforces Round #170 Tutorial | 2400 | |
| 513 | Game | games implementation | Statement | C | Codeforces Round 170 (Div. 1) {277} | PROGRAMMING | Codeforces Round #170 Tutorial | 2400 | |
| 1531 | Binary Tree on Plane | flows trees | Statement | E | Codeforces Round 170 (Div. 1) {277} | PROGRAMMING | Codeforces Round #170 Tutorial | 2400 | |
| 446 | Google Code Jam | dp probabilities | Statement | D | Codeforces Round 170 (Div. 1) {277} | PROGRAMMING | Codeforces Round #170 Tutorial | 2700 | |
| 3658 | New Problem | brute force strings | Statement | B | Codeforces Round 170 (Div. 2) {278} | PROGRAMMING | Codeforces Round #170 Tutorial | 1500 | |
| 12923 | Circle Line | implementation | Statement | A | Codeforces Round 170 (Div. 2) {278} | PROGRAMMING | Codeforces Round #170 Tutorial | 900 | |
| 5993 | Point on Spiral | brute force geometry implementation | Statement | A | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Codeforces Round #171 (Div. 2) Разбор Задач | 1400 | |
| 78792 | Books | binary search brute force implementation two pointers | Statement | B | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Codeforces Round #171 (Div. 2) Разбор Задач | 1400 | |
| 9081 | Ladder | dp implementation two pointers | Statement | C | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Unofficial editorial for Codeforces Round #171 (Div. 2) | 1700 | |
| 1640 | Beautiful Decomposition | dp games greedy number theory | Statement | E | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Codeforces Round #171 (Div. 2) Разбор Задач | 2100 | |
| 896 | The Minimum Number of Variables | bitmasks dp | Statement | D | Codeforces Round 171 (Div. 2) {279} | PROGRAMMING | Unofficial editorial for Codeforces Round #171 (Div. 2) | 2600 | |
| 1615 | Rectangle Puzzle | geometry | Statement | A | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2000 | |
| 5379 | Maximum Xor Secondary | data structures implementation two pointers | Statement | B | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2000 | |
| 5561 | Game on Tree | implementation math probabilities trees | Statement | C | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2400 | |
| 1781 | k-Maximum Subsequence Sum | data structures flows graphs implementation | Statement | D | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | T | 2800 | |
| 350 | Sequence Transformation | data structures dp implementation math | Statement | E | Codeforces Round 172 (Div. 1) {280} | PROGRAMMING | Codeforces Round #172 Editorial | 3000 | |
| 3460 | Nearest Fraction | brute force implementation two pointers | Statement | B | Codeforces Round 172 (Div. 2) {281} | PROGRAMMING | Codeforces Round #172 Editorial | 1700 | |
| 282018 | Word Capitalization | implementation strings | Statement | A | Codeforces Round 172 (Div. 2) {281} | PROGRAMMING | Codeforces Round #172 Editorial | 800 | |
| 14146 | Painting Eggs | greedy math | Statement | B | Codeforces Round 173 (Div. 2) {282} | PROGRAMMING | Round #173 — Editorial | 1500 | |
| 10395 | XOR and OR | constructive algorithms implementation math | Statement | C | Codeforces Round 173 (Div. 2) {282} | PROGRAMMING | Round #173 — Editorial | 1600 | |
| 1693 | Yet Another Number Game | dp games | Statement | D | Codeforces Round 173 (Div. 2) {282} | PROGRAMMING | Round #173 — Editorial | 2100 | |
| 4745 | Sausage Maximization | bitmasks data structures trees | Statement | E | Codeforces Round 173 (Div. 2) {282} | PROGRAMMING | Round #173 — Editorial | 2100 | |
| 376250 | Bit++ | implementation | Statement | A | Codeforces Round 173 (Div. 2) {282} | PROGRAMMING | Round #173 — Editorial | 900 | |
| 6932 | Cows and Sequence | constructive algorithms data structures implementation | Statement | A | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Editorial for Codeforces #174 | 1600 | |
| 3972 | Cow Program | dfs and similar dp graphs | Statement | B | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Editorial for Codeforces #174 | 1900 | |
| 1614 | Coin Troubles | dp | Statement | C | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Math Problems on Codeforces #174 | 2300 | |
| 718 | Cows and Cool Sequences | dp math number theory | Statement | D | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Editorial for Codeforces #174 | 2400 | |
| 956 | Cow Tennis Tournament | combinatorics data structures math | Statement | E | Codeforces Round 174 (Div. 1) {283} | PROGRAMMING | Math Problems on Codeforces #174 | 2700 | |
| 7435 | Cows and Poker Game | brute force implementation | Statement | B | Codeforces Round 174 (Div. 2) {284} | PROGRAMMING | Editorial for Codeforces #174 | 1100 | |
| 7482 | Cows and Primitive Roots | implementation math number theory | Statement | A | Codeforces Round 174 (Div. 2) {284} | PROGRAMMING | Editorial for Codeforces #174 | 1400 | |
| 14259 | Slightly Decreasing Permutations | greedy implementation | Statement | A | Codeforces Round 175 (Div. 2) {285} | PROGRAMMING | Codeforces Round #175 (Div. 2) Tutorial | 1100 | |
| 15836 | Find Marble | implementation | Statement | B | Codeforces Round 175 (Div. 2) {285} | PROGRAMMING | Codeforces Round #175 (Div. 2) Tutorial | 1300 | |
| 26684 | Building Permutation | greedy implementation sortings | Statement | C | Codeforces Round 175 (Div. 2) {285} | PROGRAMMING | Codeforces Round #175 (Div. 2) Tutorial | 1300 | |
| 1708 | Permutation Sum | bitmasks combinatorics dp implementation meet-in-the-middle | Statement | D | Codeforces Round 175 (Div. 2) {285} | PROGRAMMING | Codeforces Round #175 (Div. 2) Tutorial | 1900 | |
| 1410 | Positions in Permutations | combinatorics dp math | Statement | E | Codeforces Round 175 (Div. 2) {285} | PROGRAMMING | Codeforces Round #175 (Div. 2) Tutorial | 2600 | |
| 3484 | Lucky Permutation | constructive algorithms math | Statement | A | Codeforces Round 176 (Div. 1) {286} | PROGRAMMING | Tutorial | 1600 | |
| 1628 | Main Sequence | greedy implementation | Statement | C | Codeforces Round 176 (Div. 1) {286} | PROGRAMMING | Tutorial | 2200 | |
| 503 | Tourists | data structures sortings | Statement | D | Codeforces Round 176 (Div. 1) {286} | PROGRAMMING | Tutorial | 2500 | |
| 1192 | Shifting | implementation | Statement | B | Codeforces Round 176 (Div. 1) {286} | PROGRAMMING | Tutorial | 2500 | |
| 1089 | Ladies' Shop | constructive algorithms fft math | Statement | E | Codeforces Round 176 (Div. 1) {286} | PROGRAMMING | Tutorial | 2600 | |
| 22325 | IQ Test | brute force implementation | Statement | A | Codeforces Round 176 (Div. 2) {287} | PROGRAMMING | Разбор задач | 1200 | |
| 12001 | Pipeline | binary search math | Statement | B | Codeforces Round 176 (Div. 2) {287} | PROGRAMMING | Разбор задач | 1700 | |
| 6855 | Polo the Penguin and Strings | greedy | Statement | A | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 1300 | |
| 3250 | Polo the Penguin and Houses | combinatorics | Statement | B | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Tutorial | 1700 | |
| 2474 | Polo the Penguin and XOR operation | implementation math | Statement | C | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 1900 | |
| 863 | Polo the Penguin and Trees | combinatorics dfs and similar trees | Statement | D | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 2300 | |
| 413 | Polo the Penguin and Lucky Numbers | dp implementation math | Statement | E | Codeforces Round 177 (Div. 1) {288} | PROGRAMMING | Codeforces Round #177, editorial | 2800 | |
| 10500 | Polo the Penguin and Segments | brute force implementation | Statement | A | Codeforces Round 177 (Div. 2) {289} | PROGRAMMING | Codeforces Round #177, editorial | 1100 | |
| 19241 | Polo the Penguin and Matrix | brute force dp implementation sortings ternary search | Statement | B | Codeforces Round 177 (Div. 2) {289} | PROGRAMMING | Codeforces Round #177, editorial | 1400 | |
| 3261 | Mysterious strings | *special implementation | Statement | A | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 1400 | |
| 2632 | QR code | *special implementation | Statement | B | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 1500 | |
| 1914 | Orange | *special implementation | Statement | D | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 1600 | |
| 1685 | WTF? | *special graph matchings implementation trees | Statement | C | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 1800 | |
| 238 | HQ | *special constructive algorithms | Statement | E | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 2700 | |
| 159 | Greedy Petya | *special dfs and similar graphs greedy | Statement | F | April Fools Day Contest 2013 {290} | PROGRAMMING | April Fools Day Contest 2013: editorial | 2800 | |
| 6553 | Spyke Talks | *special implementation sortings | Statement | A | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 1900 | ||
| 3104 | Command Line Arguments | *special implementation strings | Statement | B | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2000 | ||
| 1898 | Network Mask | *special bitmasks brute force implementation | Statement | C | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2100 | ||
| 1543 | Parallel Programming | *special greedy | Statement | D | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2200 | ||
| 1651 | Tree-String Problem | *special dfs and similar hashing strings | Statement | E | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2400 | ||
| 2905 | SMSC | implementation | Statement | A | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 1100 | |
| 10959 | Network Topology | graphs implementation | Statement | B | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 1200 | |
| 5074 | Copying Data | data structures | Statement | E | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 1900 | |
| 2840 | Connected Components | data structures dfs and similar dp dsu | Statement | D | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 1900 | |
| 1344 | Beautiful IP Addresses | brute force | Statement | C | Croc Champ 2013 - Round 1 {292} | PROGRAMMING | Чемпионат КРОК 2013 — Раунд 1 (Разбор задач) | 2000 | |
| 3236 | Weird Game | games greedy | Statement | A | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 1500 | |
| 700 | Cube Problem | brute force math number theory | Statement | C | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 2300 | |
| 1011 | Distinct Paths | brute force combinatorics | Statement | B | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 2600 | |
| 288 | Ksusha and Square | geometry math probabilities two pointers | Statement | D | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 2700 | |
| 2156 | Close Vertices | data structures divide and conquer trees | Statement | E | Croc Champ 2013 - Round 2 {293} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 2700 | |
| 5111 | Shaass and Bookshelf | dp greedy | Statement | B | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 1700 | |
| 4502 | Shaass and Lights | combinatorics number theory | Statement | C | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 1900 | |
| 1207 | Shaass the Great | dp trees | Statement | E | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 2700 | |
| 419 | Shaass and Painter Robot | brute force implementation number theory | Statement | D | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 2700 | |
| 28948 | Shaass and Oskols | implementation math | Statement | A | Codeforces Round 178 (Div. 2) {294} | PROGRAMMING | Codeforces Round #178 Editorial | 900 | |
| 27867 | Greg and Array | data structures implementation | Statement | A | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 1500 | |
| 18847 | Greg and Graph | dp graphs shortest paths | Statement | B | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 1900 | |
| 765 | Greg and Caves | combinatorics dp | Statement | D | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2400 | |
| 874 | Yaroslav and Points | data structures | Statement | E | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2500 | |
| 1989 | Greg and Friends | combinatorics dp graphs shortest paths | Statement | C | Codeforces Round 179 (Div. 1) {295} | PROGRAMMING | Codeforces Round #179 tutorial | 2500 | |
| 26498 | Yaroslav and Permutations | greedy math | Statement | A | Codeforces Round 179 (Div. 2) {296} | PROGRAMMING | Codeforces Round #179 tutorial | 1100 | |
| 2773 | Yaroslav and Two Strings | combinatorics dp | Statement | B | Codeforces Round 179 (Div. 2) {296} | PROGRAMMING | Codeforces Round #179 tutorial | 2000 | |
| 3886 | Parity Game | constructive algorithms | Statement | A | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | Tutorial for E | 1700 | |
| 3784 | Fish Weight | constructive algorithms greedy | Statement | B | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | Tutorial | 1700 | |
| 657 | Color the Carpet | constructive algorithms | Statement | D | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | Tutorial | 2400 | |
| 1036 | Splitting the Uniqueness | constructive algorithms | Statement | C | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | Tutorial | 2700 | |
| 459 | Mystic Carvings | data structures | Statement | E | Codeforces Round 180 (Div. 1) {297} | PROGRAMMING | Tutorial | 3000 | |
| 11793 | Snow Footprints | greedy implementation | Statement | A | Codeforces Round 180 (Div. 2) {298} | PROGRAMMING | Codeforces Round #180 Editorial | 1300 | |
| 16029 | Sail | brute force greedy implementation | Statement | B | Codeforces Round 180 (Div. 2) {298} | PROGRAMMING | Codeforces Round #180 Editorial | 1300 | |
| 6661 | Ksusha the Squirrel | brute force implementation | Statement | B | Croc Champ 2013 - Round 2 (Div. 2 Edition) {299} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 1000 | |
| 9588 | Ksusha and Array | brute force number theory sortings | Statement | A | Croc Champ 2013 - Round 2 (Div. 2 Edition) {299} | PROGRAMMING | Croc Champ 2013 — Round 2 — Editorial | 1000 | |
| 28172 | Array | brute force constructive algorithms implementation | Statement | A | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 1200 | |
| 7362 | Coach | brute force dfs and similar graphs | Statement | B | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 1500 | |
| 12679 | Beautiful Numbers | brute force combinatorics | Statement | C | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 1800 | |
| 1143 | Empire Strikes Back | binary search math number theory | Statement | E | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 2400 | |
| 879 | Painting Square | dp fft | Statement | D | Codeforces Round 181 (Div. 2) {300} | PROGRAMMING | English Tutorial | 2700 | |
| 3273 | Yaroslav and Sequence | constructive algorithms | Statement | A | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 1800 | |
| 2890 | Yaroslav and Time | binary search graphs shortest paths | Statement | B | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2000 | |
| 3176 | Yaroslav and Divisors | data structures | Statement | D | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2200 | |
| 514 | Yaroslav and Algorithm | constructive algorithms | Statement | C | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2700 | |
| 517 | Yaroslav and Arrangements | dp | Statement | E | Codeforces Round 182 (Div. 1) {301} | PROGRAMMING | Codeforces Round #182 tutorial | 2900 | |
| 9859 | Eugeny and Array | implementation | Statement | A | Codeforces Round 182 (Div. 2) {302} | PROGRAMMING | Codeforces Round #182 tutorial | 1100 | |
| 9557 | Eugeny and Play List | binary search implementation two pointers | Statement | B | Codeforces Round 182 (Div. 2) {302} | PROGRAMMING | Codeforces Round #182 tutorial | 1200 | |
| 8660 | Lucky Permutation Triple | constructive algorithms implementation math | Statement | A | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 1400 | |
| 1439 | Rectangle Puzzle II | implementation math | Statement | B | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 1900 | |
| 441 | Rotatable Number | math number theory | Statement | D | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 2500 | |
| 989 | Minimum Modular | brute force graphs math number theory | Statement | C | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 2700 | |
| 473 | Random Ranking | dp math probabilities | Statement | E | Codeforces Round 183 (Div. 1) {303} | PROGRAMMING | Codeforces Round #183 Editorial | 2800 | |
| 12240 | Pythagorean Theorem II | brute force math | Statement | A | Codeforces Round 183 (Div. 2) {304} | PROGRAMMING | Codeforces Round #183 Editorial | 1300 | |
| 3191 | Calendar | brute force implementation | Statement | B | Codeforces Round 183 (Div. 2) {304} | PROGRAMMING | Codeforces Round #183 Editorial | 1400 | |
| 5268 | Strange Addition | brute force constructive algorithms implementation | Statement | A | Codeforces Round 184 (Div. 2) {305} | PROGRAMMING | 7712 | 1600 | |
| 2684 | Ivan and Powers of Two | greedy implementation | Statement | C | Codeforces Round 184 (Div. 2) {305} | PROGRAMMING | 7712 | 1600 | |
| 2322 | Continued Fractions | brute force implementation math | Statement | B | Codeforces Round 184 (Div. 2) {305} | PROGRAMMING | 7712 | 1600 | |
| 801 | Playing with String | games | Statement | E | Codeforces Round 184 (Div. 2) {305} | PROGRAMMING | 7712 | 2500 | |
| 585 | Olya and Graph | combinatorics math | Statement | D | Codeforces Round 184 (Div. 2) {305} | PROGRAMMING | 7712 | 2600 | |
| 8280 | Candies | implementation | Statement | A | Testing Round 6 {306} | PROGRAMMING | 1000 | ||
| 534 | Optimizer | data structures greedy sortings | Statement | B | Testing Round 6 {306} | PROGRAMMING | 2000 | ||
| 667 | White, Black and White Again | combinatorics number theory | Statement | C | Testing Round 6 {306} | PROGRAMMING | 2200 | ||
| 340 | Polygon | constructive algorithms geometry | Statement | D | Testing Round 6 {306} | PROGRAMMING | 2300 | ||
| 1510 | Memory for Arrays | binary search bitmasks greedy | Statement | C | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 1900 | |
| 561 | Morning run | binary search math two pointers | Statement | A | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 2000 | |
| 967 | Context Advertising | dp two pointers | Statement | B | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 2100 | |
| 204 | Tennis Rackets | brute force geometry | Statement | D | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 2600 | |
| 301 | Sheep | binary search greedy | Statement | E | Croc Champ 2013 - Finals (online version, Div. 1) {309} | PROGRAMMING | Чемпионат КРОК 2013 — Финальный раунд — Разбор | 2900 | |
| 4250 | The Closest Pair | constructive algorithms implementation | Statement | A | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial (Div.2 B&Div.1 E) | 1400 | |
| 4524 | Cats Transport | data structures dp | Statement | B | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial | 2400 | |
| 835 | Interval Cubing | data structures math | Statement | D | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial (Div.2 B&Div.1 E) | 2500 | |
| 604 | Fetch the Treasure | brute force data structures graphs shortest paths | Statement | C | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial | 2600 | |
| 1727 | Biologist | flows | Statement | E | Codeforces Round 185 (Div. 1) {311} | PROGRAMMING | Codeforces Round #185 Editorial | 2900 | |
| 5424 | Whose sentence is it? | implementation strings | Statement | A | Codeforces Round 185 (Div. 2) {312} | PROGRAMMING | Codeforces Round #185 Editorial | 1300 | |
| 13934 | Archer | math probabilities | Statement | B | Codeforces Round 185 (Div. 2) {312} | PROGRAMMING | Codeforces Round #185 Editorial | 1300 | |
| 57306 | Ilya and Queries | dp implementation | Statement | B | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 1200 | |
| 6008 | Ilya and Matrix | constructive algorithms greedy implementation sortings | Statement | C | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 1400 | |
| 1757 | Ilya and Roads | dp | Statement | D | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 2100 | |
| 636 | Ilya and Two Numbers | constructive algorithms data structures dsu greedy | Statement | E | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 2300 | |
| 66711 | Ilya and Bank Account | implementation number theory | Statement | A | Codeforces Round 186 (Div. 2) {313} | PROGRAMMING | Tutorial | 900 | |
| 2195 | Sereja and Contest | implementation | Statement | A | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 1700 | |
| 1655 | Sereja and Periods | binary search dfs and similar strings | Statement | B | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2000 | |
| 2100 | Sereja and Subsequences | data structures dp | Statement | C | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2300 | |
| 621 | Sereja and Straight Lines | binary search data structures geometry sortings two pointers | Statement | D | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2400 | |
| 440 | Sereja and Squares | dp | Statement | E | Codeforces Round 187 (Div. 1) {314} | PROGRAMMING | Codeforces Round #187 tutorial | 2900 | |
| 7809 | Sereja and Array | implementation | Statement | B | Codeforces Round 187 (Div. 2) {315} | PROGRAMMING | Codeforces Round #187 tutorial | 1200 | |
| 12475 | Sereja and Bottles | brute force | Statement | A | Codeforces Round 187 (Div. 2) {315} | PROGRAMMING | Codeforces Round #187 tutorial | 1400 | |
| 2915 | Special Task | greedy | Statement | A1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1100 | |
| 2313 | Special Task | math | Statement | A2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1400 | |
| 1563 | Summer Homework | brute force data structures | Statement | E1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1500 | |
| 1797 | EKG | dfs and similar dp | Statement | B2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1600 | |
| 1509 | EKG | brute force dfs and similar | Statement | B1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 1600 | |
| 1099 | Good Substrings | hashing strings | Statement | G1 | ABBYY Cup 3.0 {316} | PROGRAMMING | 1700 | ||
| 617 | Tidying Up | flows | Statement | C1 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2200 | ||
| 522 | Good Substrings | string suffix structures | Statement | G2 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2200 | ||
| 670 | Tidying Up | flows graph matchings | Statement | C2 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2300 | ||
| 553 | PE Lesson | dp | Statement | D2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2300 | |
| 634 | PE Lesson | brute force dp | Statement | D1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2300 | |
| 439 | Summer Homework | data structures math | Statement | E2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2400 | |
| 749 | PE Lesson | dp math | Statement | D3 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2400 | |
| 178 | Suns and Rays | Statement | F2 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2500 | ||
| 203 | Suns and Rays | dfs and similar implementation | Statement | F1 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2500 | |
| 591 | Summer Homework | data structures math | Statement | E3 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2500 | |
| 198 | Suns and Rays | constructive algorithms dfs and similar implementation | Statement | F3 | ABBYY Cup 3.0 {316} | PROGRAMMING | ABBYY Cup 3.0. Solutions | 2600 | |
| 548 | Good Substrings | string suffix structures | Statement | G3 | ABBYY Cup 3.0 {316} | PROGRAMMING | 2800 | ||
| 4965 | Perfect Pair | brute force | Statement | A | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Codeforces Round #188 (разбор) | 1600 | |
| 1687 | Ants | brute force implementation | Statement | B | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 2000 | |
| 1315 | Game with Powers | dp games | Statement | D | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 2200 | |
| 590 | Balance | constructive algorithms dfs and similar graphs trees | Statement | C | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Analysis | 2700 | |
| 176 | Princess and Her Shadow | constructive algorithms shortest paths | Statement | E | Codeforces Round 188 (Div. 1) {317} | PROGRAMMING | Codeforces Round #188 (разбор) | 3200 | |
| 148133 | Even Odds | math | Statement | A | Codeforces Round 188 (Div. 2) {318} | PROGRAMMING | 7956 | 1000 | |
| 8398 | Strings of Power | implementation strings two pointers | Statement | B | Codeforces Round 188 (Div. 2) {318} | PROGRAMMING | 7956 | 1300 | |
| 3052 | Malek Dance Club | combinatorics math | Statement | A | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 1700 | |
| 4918 | Psychos in a Line | data structures implementation | Statement | B | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 2000 | |
| 6958 | Kalila and Dimna in the Logging Industry | dp geometry | Statement | C | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 2400 | |
| 791 | Have You Ever Heard About the Word? | greedy hashing string suffix structures strings | Statement | D | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 2700 | |
| 819 | Ping-Pong | data structures | Statement | E | Codeforces Round 189 (Div. 1) {319} | PROGRAMMING | Codeforces Round #189 — Editorial | 3000 | |
| 46455 | Magic Numbers | brute force greedy | Statement | A | Codeforces Round 189 (Div. 2) {320} | PROGRAMMING | Codeforces Round #189 — Editorial | 1000 | |
| 7883 | Ping-Pong (Easy Version) | dfs and similar graphs | Statement | B | Codeforces Round 189 (Div. 2) {320} | PROGRAMMING | Codeforces Round #189 — Editorial | 1500 | |
| 3933 | Ciel and Robot | binary search implementation math | Statement | A | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 1700 | |
| 3971 | Ciel and Duel | dp flows greedy | Statement | B | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2000 | |
| 9914 | Ciel the Commander | constructive algorithms dfs and similar divide and conquer greedy trees | Statement | C | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2500 | |
| 6700 | Ciel and Gondolas | data structures divide and conquer dp | Statement | E | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2600 | |
| 661 | Ciel and Flipboard | dp greedy math | Statement | D | Codeforces Round 190 (Div. 1) {321} | PROGRAMMING | Codeforces Round #190 — Editorial | 2900 | |
| 9225 | Ciel and Dancing | greedy | Statement | A | Codeforces Round 190 (Div. 2) {322} | PROGRAMMING | Codeforces Round #190 — Editorial | 1100 | |
| 13372 | Ciel and Flowers | combinatorics math | Statement | B | Codeforces Round 190 (Div. 2) {322} | PROGRAMMING | Codeforces Round #190 — Editorial | 1600 | |
| 979 | Black-and-White Cube | combinatorics constructive algorithms | Statement | A | Testing Round 7 {323} | PROGRAMMING | 1600 | ||
| 498 | Tournament-graph | constructive algorithms graphs | Statement | B | Testing Round 7 {323} | PROGRAMMING | 2000 | ||
| 710 | Two permutations | data structures | Statement | C | Testing Round 7 {323} | PROGRAMMING | 2200 | ||
| 2323 | Square and Rectangles | implementation | Statement | A | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 1500 | |
| 1682 | Stadium and Games | binary search math | Statement | B | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 1800 | |
| 505 | Monsters and Diamonds | dfs and similar graphs shortest paths | Statement | C | MemSQL start[c]up Round 1 {325} | PROGRAMMING | 2500 | ||
| 1030 | The Red Button | combinatorics dfs and similar dsu graphs greedy | Statement | E | MemSQL start[c]up Round 1 {325} | PROGRAMMING | Editorial | 2700 | |
| 602 | Reclamation | dsu | Statement | D | MemSQL start[c]up Round 1 {325} | PROGRAMMING | 2800 | ||
| 51957 | Flipping Game | brute force dp implementation | Statement | A | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | Codeforces Round #191 — Tutorial | 1200 | |
| 21954 | Hungry Sequence | math | Statement | B | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | Codeforces Round #191 — Tutorial | 1300 | |
| 3719 | Magic Five | combinatorics math | Statement | C | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | Codeforces Round #191 — Tutorial | 1700 | |
| 2531 | Block Tower | constructive algorithms dfs and similar graphs | Statement | D | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | Codeforces Round #191 — Tutorial | 2000 | |
| 1644 | Axis Walking | bitmasks combinatorics constructive algorithms dp meet-in-the-middle | Statement | E | Codeforces Round 191 (Div. 2) {327} | PROGRAMMING | Codeforces Round #191 — Tutorial | 2500 | |
| 1604 | Sheldon and Ice Pieces | greedy | Statement | B | Testing Round 8 {328} | PROGRAMMING | 1500 | ||
| 2440 | IQ Test | implementation | Statement | A | Testing Round 8 {328} | PROGRAMMING | 1800 | ||
| 4872 | Purification | constructive algorithms greedy | Statement | A | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | Codeforces Round #192 Editorial | 1500 | |
| 7744 | Biridian Forest | dfs and similar shortest paths | Statement | B | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | Codeforces Round #192 Editorial | 1700 | |
| 443 | The Evil Temple and the Moving Rocks | constructive algorithms | Statement | D | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | Codeforces Round #192 Editorial | 2400 | |
| 1034 | Graph Reconstruction | constructive algorithms | Statement | C | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | Codeforces Round #192 Editorial | 2600 | |
| 202 | Evil | math | Statement | E | Codeforces Round 192 (Div. 1) {329} | PROGRAMMING | Codeforces Round #192 Editorial | 3100 | |
| 19822 | Road Construction | constructive algorithms graphs | Statement | B | Codeforces Round 192 (Div. 2) {330} | PROGRAMMING | Codeforces Round #192 Editorial | 1300 | |
| 32010 | Cakeminator | brute force implementation | Statement | A | Codeforces Round 192 (Div. 2) {330} | PROGRAMMING | Codeforces Round #192 Editorial | 900 | |
| 7207 | The Great Julya Calendar | dp | Statement | C1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1200 | |
| 1537 | Oh Sweet Beaverette | brute force implementation | Statement | A1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1400 | |
| 1564 | Oh Sweet Beaverette | data structures sortings | Statement | A2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1600 | |
| 825 | Shave Beaver! | implementation | Statement | B1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1700 | |
| 841 | Shave Beaver! | data structures | Statement | B2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 1900 | |
| 246 | Escaping on Beaveractor | dfs and similar implementation | Statement | D1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2300 | |
| 449 | The Great Julya Calendar | dp | Statement | C2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2400 | |
| 636 | The Great Julya Calendar | dp | Statement | C3 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2500 | |
| 163 | Escaping on Beaveractor | graphs | Statement | D2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2600 | |
| 208 | Escaping on Beaveractor | data structures implementation trees | Statement | D3 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 2900 | |
| 238 | Deja Vu | constructive algorithms dp | Statement | E2 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 3000 | |
| 219 | Deja Vu | constructive algorithms graphs implementation | Statement | E1 | ABBYY Cup 3.0 - Finals (online version) {331} | PROGRAMMING | ABBYY Cup 3.0 — Finals. Solutions | 3000 | |
| 3745 | Down the Hatch! | implementation | Statement | A | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 1300 | |
| 8851 | Maximum Absurdity | data structures dp implementation | Statement | B | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 1500 | |
| 1062 | Students' Revenge | data structures greedy sortings | Statement | C | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 2200 | |
| 444 | Theft of Blueprints | graphs math | Statement | D | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 2400 | |
| 356 | Binary Key | dp greedy implementation | Statement | E | Codeforces Round 193 (Div. 2) {332} | PROGRAMMING | 8447 | 2600 | |
| 4306 | Secrets | greedy | Statement | A | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 1500 | |
| 2785 | Chips | greedy | Statement | B | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 1800 | |
| 2277 | Characteristics of Rectangles | binary search bitmasks brute force implementation sortings | Statement | D | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 2100 | |
| 1311 | Summer Earnings | binary search bitmasks brute force geometry sortings | Statement | E | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 2400 | |
| 440 | Lucky Tickets | brute force constructive algorithms | Statement | C | Codeforces Round 194 (Div. 1) {333} | PROGRAMMING | Codeforces Round 194 — Editoral | 2800 | |
| 20267 | Candy Bags | implementation | Statement | A | Codeforces Round 194 (Div. 2) {334} | PROGRAMMING | Codeforces Round 194 — Editoral | 1000 | |
| 3908 | Eight Point Sets | sortings | Statement | B | Codeforces Round 194 (Div. 2) {334} | PROGRAMMING | Codeforces Round 194 — Editoral | 1500 | |
| 2893 | Banana | binary search constructive algorithms greedy | Statement | A | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 1500 | |
| 2410 | Palindrome | constructive algorithms dp | Statement | B | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 1900 | |
| 642 | More Reclamation | games | Statement | C | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 2100 | |
| 372 | Rectangles and Square | brute force dp | Statement | D | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 2400 | |
| 265 | Counting Skyscrapers | dp math probabilities | Statement | E | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 2900 | |
| 770 | Buy One, Get One Free | dp greedy | Statement | F | MemSQL start[c]up Round 2 - online version {335} | PROGRAMMING | MemSQL start[c]up Round 2 -- Editorial | 2900 | |
| 10776 | Vasily the Bear and Triangle | implementation math | Statement | A | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 1100 | |
| 2676 | Vasily the Bear and Sequence | brute force greedy implementation number theory | Statement | C | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 1800 | |
| 1377 | Vasily the Bear and Fly | math | Statement | B | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 1900 | |
| 1246 | Vasily the Bear and Beautiful Strings | combinatorics math number theory | Statement | D | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 2400 | |
| 158 | Vasily the Bear and Painting Square | bitmasks combinatorics dp implementation | Statement | E | Codeforces Round 195 (Div. 2) {336} | PROGRAMMING | Tutorial Codeforces Round #195 (Div. 2) | 2600 | |
| 98238 | Puzzles | greedy | Statement | A | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 1000 | |
| 10168 | Routine Problem | greedy math number theory | Statement | B | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 1400 | |
| 5282 | Quiz | binary search greedy math matrices number theory | Statement | C | Codeforces Round 196 (Div. 2) {337} | PROGRAMMING | Codeforces Round #196 — Problems Analysis | 1700 |