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 ... 8 9 10 11 12 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6063 | Ilya and Sticks | greedy math sortings | Statement | C | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 1600 | |
| 4164 | Anya and Cubes | binary search bitmasks brute force dp math meet-in-the-middle | Statement | E | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 2200 | |
| 1998 | Arthur and Walls | constructive algorithms data structures graphs greedy shortest paths | Statement | D | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 2300 | |
| 5007 | King of Thieves | brute force implementation | Statement | A | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 1300 | |
| 4696 | Om Nom and Dark Park | dfs and similar greedy implementation | Statement | B | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 1500 | |
| 2648 | Om Nom and Candies | brute force greedy math | Statement | C | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 2000 | |
| 2435 | Om Nom and Necklace | hashing string suffix structures strings | Statement | D | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 2200 | |
| 1180 | Transmitting Levels | dp implementation | Statement | E | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 2400 | |
| 3394 | Pudding Monsters | data structures divide and conquer | Statement | F | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 2900 | |
| 860 | Spiders Evil Plan | greedy trees | Statement | G | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 3300 | |
| 15541 | Playing with Paper | implementation math | Statement | A | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 1100 | |
| 4067 | Error Correct System | greedy | Statement | B | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 1500 | |
| 7531 | Glass Carving | binary search data structures implementation | Statement | C | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 1800 | |
| 5082 | Clique Problem | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 2100 | |
| 2188 | Data Center Drama | dfs and similar graphs | Statement | E | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 2600 | |
| 2855 | Fuzzy Search | bitmasks brute force fft | Statement | D | Codeforces Round 296 (Div. 1) {528} | PROGRAMMING | Codeforces Round #296 Editorial | 2500 | |
| 227 | Triangles 3000 | geometry sortings | Statement | E | Codeforces Round 296 (Div. 1) {528} | PROGRAMMING | Codeforces Round #296 Editorial | 3000 | |
| 997 | Group Photo 2 (online mirror version) | brute force greedy sortings | Statement | B | VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only) {529} | PROGRAMMING | VK Cup Round 1 (+ online mirror) editorial | 1900 | |
| 692 | Quadratic equation | *special | Statement | A | VK Cup 2015 - Wild Card Round 1 {530} | PROGRAMMING | VK Cup 2015 Wild Card Round 1: editorial | 1500 | |
| 555 | String inside out | *special | Statement | B | VK Cup 2015 - Wild Card Round 1 {530} | PROGRAMMING | VK Cup 2015 Wild Card Round 1: editorial | 1600 | |
| 461 | Set subtraction | *special | Statement | D | VK Cup 2015 - Wild Card Round 1 {530} | PROGRAMMING | VK Cup 2015 Wild Card Round 1: editorial | 1700 | |
| 599 | Diophantine equation | *special | Statement | C | VK Cup 2015 - Wild Card Round 1 {530} | PROGRAMMING | VK Cup 2015 Wild Card Round 1: editorial | 1700 | |
| 330 | Sum and product | *special | Statement | E | VK Cup 2015 - Wild Card Round 1 {530} | PROGRAMMING | VK Cup 2015 Wild Card Round 1: editorial | 1900 | |
| 129 | Points in triangle | *special geometry | Statement | H | VK Cup 2015 - Wild Card Round 1 {530} | PROGRAMMING | VK Cup 2015 Wild Card Round 1: editorial | 2200 | |
| 439 | Levenshtein distance | *special | Statement | G | VK Cup 2015 - Wild Card Round 1 {530} | PROGRAMMING | VK Cup 2015 Wild Card Round 1: editorial | 2300 | |
| 112 | Jumping frogs | *special | Statement | F | VK Cup 2015 - Wild Card Round 1 {530} | PROGRAMMING | VK Cup 2015 Wild Card Round 1: editorial | 2300 | |
| 51 | Different variables | *special | Statement | I | VK Cup 2015 - Wild Card Round 1 {530} | PROGRAMMING | VK Cup 2015 Wild Card Round 1: editorial | 2600 | |
| 2436 | Board Game | games greedy implementation math | Statement | C | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | Разбор VK Cup Round 2 | 1700 | |
| 2430 | Correcting Mistakes | constructive algorithms dp greedy hashing strings two pointers | Statement | E | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | Разбор VK Cup Round 2 | 1800 | |
| 2685 | Work Group | dfs and similar dp graphs strings trees | Statement | B | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 2000 | ||
| 954 | Encoding | hashing string suffix structures strings | Statement | F | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | Разбор VK Cup Round 2 | 2400 | |
| 270 | Landmarks | data structures dp | Statement | D | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 3000 | ||
| 485 | Berland Miners | binary search data structures dfs and similar greedy trees | Statement | A | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 3000 | ||
| 12910 | Exam | constructive algorithms implementation math | Statement | A | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 1100 | ||
| 11331 | Covered Path | dp greedy math | Statement | B | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 1400 | ||
| 5272 | Polycarpus' Dice | math | Statement | C | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 1600 | ||
| 2573 | Handshakes | binary search constructive algorithms data structures greedy | Statement | D | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2000 | ||
| 394 | Berland Local Positioning System | constructive algorithms greedy hashing implementation | Statement | E | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2600 | ||
| 532 | Simplified Nonogram | bitmasks dp hashing meet-in-the-middle | Statement | F | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2900 | ||
| 26481 | Tavas and SaDDas | bitmasks brute force combinatorics implementation | Statement | B | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1100 | |
| 12995 | Tavas and Nafas | brute force implementation | Statement | A | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1100 | |
| 3985 | Tavas and Karafs | binary search greedy math | Statement | C | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1900 | |
| 4596 | Tavas and Malekas | greedy hashing string suffix structures strings | Statement | D | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 2100 | |
| 864 | Tavas and Pashmaks | geometry math | Statement | E | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 2900 | |
| 788 | Tavas in Kansas | dp games | Statement | D | Codeforces Round 299 (Div. 1) {536} | PROGRAMMING | Codeforces Round #299 Editorial | 2800 | |
| 451 | Tavas on the Path | data structures divide and conquer trees | Statement | E | Codeforces Round 299 (Div. 1) {536} | PROGRAMMING | Codeforces Round #299 Editorial | 3100 | |
| 19324 | Quasi Binary | constructive algorithms dp greedy implementation | Statement | B | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1400 | |
| 7374 | Cutting Banner | brute force implementation | Statement | A | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1500 | |
| 6132 | Tourist's Notes | binary search brute force greedy implementation math | Statement | C | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1600 | |
| 2520 | Weird Chess | brute force constructive algorithms implementation | Statement | D | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1800 | |
| 1636 | Demiurges Play Again | dfs and similar dp math trees | Statement | E | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 2200 | |
| 1860 | A Heap of Heaps | brute force data structures math sortings | Statement | F | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 2200 | |
| 734 | Summer Dichotomy | 2-sat data structures dfs and similar greedy | Statement | H | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 3100 | |
| 576 | Berserk Robot | constructive algorithms math sortings | Statement | G | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 3100 | |
| 4976 | School Marks | greedy implementation | Statement | B | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 1700 | |
| 8213 | Ice Cave | dfs and similar | Statement | C | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 1800 | |
| 6477 | Bad Luck Island | dp probabilities | Statement | D | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 2100 | |
| 2489 | Infinite Inversions | binary search data structures implementation sortings trees | Statement | E | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 2400 | |
| 35218 | Combination Lock | implementation | Statement | A | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 900 | |
| 1262 | Idempotent functions | constructive algorithms graphs math | Statement | C | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2000 | |
| 996 | Quest | dp greedy | Statement | F | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2100 | |
| 617 | Place Your Ad Here | data structures sortings | Statement | A | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2500 | |
| 538 | Superhero's Job | dfs and similar dp hashing math number theory | Statement | D | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2600 | |
| 973 | Playing on Graph | graphs shortest paths | Statement | E | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2600 | |
| 230 | Duck Hunt | data structures | Statement | B | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 3200 | |
| 8831 | Writing Code | dp | Statement | A | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 1900 | |
| 3241 | Road Improvement | dp trees | Statement | D | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2300 | |
| 4573 | Destroying Roads | constructive algorithms graphs shortest paths | Statement | B | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2300 | |
| 1554 | Remembering Strings | bitmasks dp | Statement | C | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2600 | |
| 336 | Listening to Music | constructive algorithms data structures | Statement | E | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 3200 | |
| 8793 | Set of Strings | implementation strings | Statement | A | Codeforces Round 302 (Div. 2) {544} | PROGRAMMING | Editorial Codeforces Round #302 | 1100 | |
| 8936 | Sea and Islands | constructive algorithms implementation | Statement | B | Codeforces Round 302 (Div. 2) {544} | PROGRAMMING | Editorial Codeforces Round #302 | 1400 | |
| 12146 | Toy Cars | implementation | Statement | A | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1000 | |
| 12230 | Equidistant String | greedy | Statement | B | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1200 | |
| 29416 | Queue | greedy implementation sortings | Statement | D | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1400 | |
| 32768 | Woodcutters | dp greedy | Statement | C | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1500 | |
| 5525 | Paths and Trees | graphs greedy shortest paths | Statement | E | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 2100 | |
| 18596 | Soldier and Badges | brute force greedy implementation sortings | Statement | B | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 1300 | |
| 19417 | Soldier and Cards | brute force dfs and similar games | Statement | C | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 1400 | |
| 13748 | Soldier and Number Game | constructive algorithms dp math number theory | Statement | D | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 1700 | |
| 4279 | Soldier and Traveling | flows graphs math | Statement | E | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 2300 | |
| 234396 | Soldier and Bananas | brute force implementation math | Statement | A | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 800 | |
| 2748 | Mike and Frog | brute force greedy implementation math | Statement | A | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 1900 | |
| 10848 | Mike and Feet | binary search data structures dp dsu | Statement | B | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2100 | |
| 3112 | Mike and Fish | constructive algorithms dfs and similar graphs | Statement | D | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2500 | |
| 3396 | Mike and Foam | bitmasks combinatorics dp math number theory | Statement | C | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2700 | |
| 2591 | Mike and Friends | data structures string suffix structures strings trees | Statement | E | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2800 | |
| 10328 | Mike and Fax | brute force implementation strings | Statement | A | Codeforces Round 305 (Div. 2) {548} | PROGRAMMING | Codeforces Round #305 Editorial | 1200 | |
| 8984 | Mike and Fun | brute force dp greedy implementation | Statement | B | Codeforces Round 305 (Div. 2) {548} | PROGRAMMING | Codeforces Round #305 Editorial | 1400 | |
| 10151 | Face Detection | implementation strings | Statement | A | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 1000 | |
| 2252 | Haar Features | greedy implementation | Statement | D | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 1800 | |
| 2091 | Degenerate Matrix | binary search math | Statement | H | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2100 | |
| 1825 | The Game Of Parity | games | Statement | C | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2200 | |
| 2655 | Happy Line | constructive algorithms greedy sortings | Statement | G | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2200 | |
| 1582 | Looksery Party | constructive algorithms dfs and similar graphs greedy | Statement | B | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2300 | |
| 1034 | Yura and Developers | data structures divide and conquer | Statement | F | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2700 | |
| 175 | Sasha Circle | geometry math | Statement | E | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 3200 | |
| 43559 | Two Substrings | brute force dp greedy implementation strings | Statement | A | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 27243 | Preparing Olympiad | bitmasks brute force | Statement | B | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 32093 | Divisibility by Eight | brute force dp math | Statement | C | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 3780 | Regular Bridge | constructive algorithms graphs implementation | Statement | D | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 2000 | |
| 1499 | Brackets in Implications | constructive algorithms greedy implementation math | Statement | E | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Codeforces Round #306 (Div. 2) Editorial | 2300 | |
| 17842 | GukiZ and Contest | brute force implementation sortings | Statement | A | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 1000 | |
| 4062 | ZgukistringZ | brute force constructive algorithms implementation strings | Statement | B | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 1800 | |
| 3984 | GukiZ hates Boxes | binary search greedy | Statement | C | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2200 | |
| 2100 | GukiZ and Binary Operations | combinatorics implementation math matrices number theory | Statement | D | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2400 | |
| 2140 | GukiZ and GukiZiana | binary search data structures implementation | Statement | E | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2600 | |
| 10143 | Vanya and Table | implementation math | Statement | A | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1100 | |
| 16061 | Vanya and Books | implementation math | Statement | B | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1300 | |
| 5864 | Vanya and Scales | brute force dp greedy math meet-in-the-middle number theory | Statement | C | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1800 | |
| 4846 | Vanya and Triangles | brute force combinatorics data structures geometry math sortings | Statement | D | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1900 | |
| 1734 | Vanya and Brackets | brute force dp expression parsing greedy implementation strings | Statement | E | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 2300 | |
| 9805 | Kyoya and Colored Balls | combinatorics dp math | Statement | A | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 1700 | |
| 2265 | Kyoya and Permutation | binary search combinatorics constructive algorithms greedy implementation math | Statement | B | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2200 | |
| 1082 | Nudist Beach | binary search graphs greedy | Statement | D | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2300 | |
| 1963 | Love Triangles | dfs and similar dsu graphs | Statement | C | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2300 | |
| 621 | Kyoya and Train | dp fft graphs math probabilities | Statement | E | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 3300 | |
| 10829 | Ohana Cleans Up | brute force greedy strings | Statement | B | Codeforces Round 309 (Div. 2) {554} | PROGRAMMING | Codeforces Round #309 Editorial | 1200 | |
| 14477 | Kyoya and Photobooks | brute force math strings | Statement | A | Codeforces Round 309 (Div. 2) {554} | PROGRAMMING | Codeforces Round #309 Editorial | 900 | |
| 6683 | Case of Matryoshkas | implementation | Statement | A | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 1500 | |
| 4080 | Case of Fugitive | data structures greedy sortings | Statement | B | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2100 | |
| 2061 | Case of Chocolate | data structures | Statement | C | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2500 | |
| 931 | Case of a Top Secret | binary search implementation math | Statement | D | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2500 | |
| 2958 | Case of Computer Network | dfs and similar graphs trees | Statement | E | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2800 | |
| 46269 | Case of the Zeros and Ones | greedy | Statement | A | Codeforces Round 310 (Div. 2) {556} | PROGRAMMING | Codeforces Round #310 Editorial | 1100 | |
| 8186 | Case of Fake Numbers | brute force implementation | Statement | B | Codeforces Round 310 (Div. 2) {556} | PROGRAMMING | Codeforces Round #310 Editorial | 1100 | |
| 8506 | Ilya and Diplomas | greedy implementation math | Statement | A | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 1200 | |
| 7485 | Pasha and Tea | constructive algorithms implementation math sortings | Statement | B | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 1500 | |
| 4211 | Arthur and Table | brute force data structures dp greedy math sortings | Statement | C | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 1900 | |
| 2374 | Vitaly and Cycle | combinatorics dfs and similar graphs math | Statement | D | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 2300 | |
| 1212 | Ann and Half-Palindrome | data structures dp graphs string suffix structures strings trees | Statement | E | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 2700 | |
| 10989 | Lala Land and Apple Trees | brute force implementation sortings | Statement | A | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 1200 | |
| 8354 | Amr and The Large Array | implementation | Statement | B | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 1400 | |
| 4203 | Amr and Chemistry | brute force graphs greedy math shortest paths | Statement | C | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 2000 | |
| 1207 | Guess Your Way Out! II | data structures implementation sortings | Statement | D | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 2500 | |
| 7365 | A Simple Task | data structures sortings strings | Statement | E | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 2600 | |
| 10893 | Gerald's Hexagon | brute force geometry math | Statement | A | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1600 | |
| 11654 | Equivalent Strings | divide and conquer hashing sortings strings | Statement | B | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1800 | |
| 8051 | Gerald and Giant Chess | combinatorics dp math number theory | Statement | C | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 2500 | |
| 475 | Randomizer | combinatorics geometry probabilities | Statement | D | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 2800 | |
| 1157 | Gerald and Path | dp sortings | Statement | E | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 2900 | |
| 19835 | Currency System in Geraldion | implementation sortings | Statement | A | Codeforces Round 313 (Div. 2) {560} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1100 | |
| 8241 | Gerald is into Art | constructive algorithms implementation | Statement | B | Codeforces Round 313 (Div. 2) {560} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1300 | |
| 4293 | Clique in the Divisibility Graph | dp math number theory | Statement | F | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 1600 | |
| 3938 | Restructuring Company | data structures dsu | Statement | D | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 1900 | |
| 1061 | Matching Names | dfs and similar strings trees | Statement | A | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 2300 | |
| 385 | Max and Min | geometry | Statement | G | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 2500 | |
| 370 | Replicating Processes | constructive algorithms greedy | Statement | B | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 2600 | |
| 881 | Logistical Questions | dfs and similar divide and conquer trees | Statement | C | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 3000 | |
| 709 | Restoring Map | bitmasks constructive algorithms trees | Statement | E | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 3200 | |
| 35901 | Lineland Mail | greedy implementation | Statement | A | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1000 | |
| 8695 | Berland National Library | implementation | Statement | B | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1300 | |
| 10427 | Geometric Progression | binary search data structures dp | Statement | C | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1700 | |
| 5242 | One-Dimensional Battle Ships | binary search data structures greedy sortings | Statement | D | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1800 | |
| 2230 | President and Roads | dfs and similar graphs hashing shortest paths | Statement | E | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 2600 | |
| 636 | Mausoleum | dp | Statement | F | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 2700 | |
| 5399 | Primes or Palindromes? | brute force implementation math number theory | Statement | A | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 1700 | |
| 2384 | Symmetric and Transitive | combinatorics dp math | Statement | B | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 2100 | |
| 944 | New Language | 2-sat greedy | Statement | C | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 2600 | |
| 319 | Sign Posts | brute force geometry math | Statement | D | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 2800 | |
| 631 | Longest Increasing Subsequence | data structures dp | Statement | E | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 3000 | |
| 7501 | Inventory | greedy math | Statement | B | Codeforces Round 315 (Div. 2) {569} | PROGRAMMING | Codeforces Round #315 Editorial | 1200 | |
| 5060 | Music | implementation math | Statement | A | Codeforces Round 315 (Div. 2) {569} | PROGRAMMING | Codeforces Round #315 Editorial | 1500 | |
| 14327 | Elections | implementation | Statement | A | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 1200 | |
| 16872 | Simple Game | constructive algorithms games greedy implementation math | Statement | B | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 1300 | |
| 9569 | Replacement | constructive algorithms data structures implementation | Statement | C | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 1600 | |
| 8989 | Tree Requests | binary search bitmasks constructive algorithms dfs and similar graphs trees | Statement | D | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 2400 | |
| 2104 | Pig and Palindromes | combinatorics dp | Statement | E | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 2600 | |
| 2823 | Minimization | dp greedy sortings | Statement | B | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 2300 | |
| 2678 | Lengthening Sticks | combinatorics implementation math | Statement | A | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 2300 | |
| 718 | CNF 2 | constructive algorithms dfs and similar graphs greedy | Statement | C | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 2600 | |
| 808 | Campus | binary search data structures dsu trees | Statement | D | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 3000 | |
| 295 | Geometric Progressions | math | Statement | E | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 3200 | |
| 18447 | Arrays | sortings | Statement | A | Codeforces Round 317 [AimFund Thanks-Round] (Div. 2) {572} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 1000 | |
| 8084 | Order Book | data structures greedy implementation sortings | Statement | B | Codeforces Round 317 [AimFund Thanks-Round] (Div. 2) {572} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 1400 | |
| 18183 | Bear and Poker | implementation math number theory | Statement | A | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 1400 | |
| 6328 | Bear and Blocks | binary search data structures dp math | Statement | B | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 1800 | |
| 1039 | Bear and Drawing | constructive algorithms dfs and similar trees | Statement | C | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 2600 | |
| 706 | Bear and Cavalry | data structures divide and conquer dp | Statement | D | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 2900 | |
| 2042 | Bear and Bowling | data structures greedy | Statement | E | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 1) {573} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 3100 | |
| 9518 | Bear and Elections | greedy implementation | Statement | A | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 2) {574} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 1200 | |
| 8323 | Bear and Three Musketeers | brute force dfs and similar graphs hashing | Statement | B | Codeforces Round 318 [RussianCodeCup Thanks-Round] (Div. 2) {574} | PROGRAMMING | Codeforces Round #318 [RussianCodeCup Thanks-Round] Editorial | 1500 | |
| 1982 | Tablecity | constructive algorithms implementation | Statement | D | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 1700 | |
| 1877 | Bots | combinatorics number theory | Statement | H | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 1800 | |
| 1105 | Bulbo | dp greedy | Statement | F | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2200 | |
| 1239 | Bribes | dfs and similar graphs trees | Statement | B | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2300 | |
| 995 | Run for beer | dfs and similar shortest paths | Statement | G | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2400 | |
| 232 | Party | bitmasks brute force graph matchings | Statement | C | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2800 | |
| 863 | Fibonotci | data structures math matrices | Statement | A | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2800 | |
| 546 | Robots protection | data structures | Statement | I | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 3000 | |
| 301 | Spectator Riots | geometry | Statement | E | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 3200 | |
| 15900 | Vasya and Petya's Game | math number theory | Statement | A | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 1500 | |
| 4163 | Points on Plane | constructive algorithms divide and conquer geometry greedy sortings | Statement | C | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 2300 | |
| 1918 | Invariance of Tree | constructive algorithms dfs and similar greedy trees | Statement | B | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 2300 | |
| 1594 | Flights for Regular Customers | dp matrices | Statement | D | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 2600 | |
| 1503 | Painting Edges | binary search data structures | Statement | E | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 3200 | |
| 45222 | Multiplication Table | implementation number theory | Statement | A | Codeforces Round 319 (Div. 2) {577} | PROGRAMMING | Editorial Codeforces Round #319 | 1100 | |
| 14781 | Modulo Sum | combinatorics data structures dp two pointers | Statement | B | Codeforces Round 319 (Div. 2) {577} | PROGRAMMING | Editorial Codeforces Round #319 | 1800 | |
| 4952 | A Problem about Polyline | geometry math | Statement | A | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 1700 | |
| 5494 | "Or" Game | brute force greedy | Statement | B | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 1800 | |
| 5171 | Weakness and Poorness | ternary search | Statement | C | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 2100 | |
| 674 | Walking! | constructive algorithms greedy | Statement | E | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 2500 | |
| 960 | LCS Again | dp greedy | Statement | D | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 2800 | |
| 648 | Mirror Box | matrices trees | Statement | F | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 3400 | |
| 78352 | Raising Bacteria | bitmasks | Statement | A | Codeforces Round 320 (Div. 2) [Bayan Thanks-Round] {579} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 1000 | |
| 5450 | Finding Team Member | brute force implementation sortings | Statement | B | Codeforces Round 320 (Div. 2) [Bayan Thanks-Round] {579} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 1400 | |
| 104336 | Kefa and First Steps | brute force dp implementation | Statement | A | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1000 | |
| 55257 | Kefa and Park | dfs and similar graphs trees | Statement | C | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1500 | |
| 31794 | Kefa and Company | binary search sortings two pointers | Statement | B | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1500 | |
| 11804 | Kefa and Dishes | bitmasks dp | Statement | D | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1900 | |
| 2559 | Kefa and Watch | data structures hashing strings | Statement | E | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 2700 | |
| 13643 | Luxurious Houses | implementation math | Statement | B | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 1200 | |
| 7593 | Developing Skills | implementation math sortings | Statement | C | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 1400 | |
| 4678 | Three Logos | bitmasks brute force constructive algorithms geometry implementation math | Statement | D | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 1700 | |
| 1033 | Zublicanes and Mumocrates | dp trees two pointers | Statement | F | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 2600 | |
| 219 | Kojiro and Furrari | dp greedy | Statement | E | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 2600 | |
| 84745 | Vasya the Hipster | implementation math | Statement | A | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 700 | |
| 8338 | GCD Table | constructive algorithms greedy number theory | Statement | A | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 1700 | |
| 3643 | Once Again... | constructive algorithms dp matrices | Statement | B | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 2000 | |
| 796 | Superior Periodic Subarrays | number theory | Statement | C | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 2900 | |
| 547 | Boolean Function | bitmasks dp expression parsing | Statement | E | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 2900 | |
| 739 | Number of Binominal Coefficients | dp math number theory | Statement | D | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 3100 | |
| 11753 | Asphalting Roads | implementation | Statement | A | Codeforces Round 323 (Div. 2) {583} | PROGRAMMING | Codeforces Round #323 Editorial | 1000 | |
| 8983 | Robot's Task | greedy implementation | Statement | B | Codeforces Round 323 (Div. 2) {583} | PROGRAMMING | Codeforces Round #323 Editorial | 1200 | |
| 52456 | Olesya and Rodion | math | Statement | A | Codeforces Round 324 (Div. 2) {584} | PROGRAMMING | Tutorial | 1100 | |
| 13648 | Kolya and Tanya | combinatorics | Statement | B | Codeforces Round 324 (Div. 2) {584} | PROGRAMMING | Tutorial | 1500 | |
| 6529 | Marina and Vasya | constructive algorithms greedy strings | Statement | C | Codeforces Round 324 (Div. 2) {584} | PROGRAMMING | Tutorial | 1700 | |
| 11092 | Dima and Lisa | brute force math number theory | Statement | D | Codeforces Round 324 (Div. 2) {584} | PROGRAMMING | Tutorial | 1700 | |
| 1491 | Anton and Ira | constructive algorithms greedy math | Statement | E | Codeforces Round 324 (Div. 2) {584} | PROGRAMMING | Tutorial | 2400 | |
| 3809 | Phillip and Trains | dfs and similar graphs shortest paths | Statement | B | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 1800 | |
| 4475 | Gennady the Dentist | brute force implementation | Statement | A | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 1800 | |
| 1065 | Alice, Bob, Oranges and Apples | number theory | Statement | C | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 2400 | |
| 2032 | Lizard Era: Beginning | meet-in-the-middle | Statement | D | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 2500 | |
| 1221 | Present for Vitalik the Philatelist | combinatorics math number theory | Statement | E | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 2800 | |
| 794 | Digits of Number Pi | dp implementation strings | Statement | F | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 3200 | |
| 10587 | Alena's Schedule | implementation | Statement | A | Codeforces Round 325 (Div. 2) {586} | PROGRAMMING | Разбор Codeforces Round #325 | 1100 | |
| 5238 | Laurenty and Shop | implementation | Statement | B | Codeforces Round 325 (Div. 2) {586} | PROGRAMMING | Разбор Codeforces Round #325 | 1300 | |
| 8323 | Duff and Weight Lifting | greedy | Statement | A | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 1500 | |
| 4721 | Duff in the Army | data structures trees | Statement | C | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 2200 | |
| 1495 | Duff in Beach | dp | Statement | B | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 2300 | |
| 845 | Duff as a Queen | data structures | Statement | E | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 2800 | |
| 870 | Duff in Mafia | 2-sat binary search | Statement | D | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 2900 | |
| 1351 | Duff is Mad | data structures strings | Statement | F | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 3000 | |
| 24237 | Duff and Meat | greedy | Statement | A | Codeforces Round 326 (Div. 2) {588} | PROGRAMMING | 1000 | ||
| 14952 | Duff in Love | math | Statement | B | Codeforces Round 326 (Div. 2) {588} | PROGRAMMING | 1400 | ||
| 4281 | Median Smoothing | implementation | Statement | A | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 1700 | |
| 2028 | Chip 'n Dale Rescue Rangers | binary search geometry math | Statement | B | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 2100 | |
| 3514 | Three States | dfs and similar graphs shortest paths | Statement | C | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 2200 | |
| 1332 | Top Secret Task | dp | Statement | D | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 2300 | |
| 882 | Birthday | graph matchings strings | Statement | E | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 3100 |