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 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6083 | Ilya and Sticks | greedy math sortings | Statement | C | Codeforces Round 297 (Div. 2) {525} | PROGRAMMING | Codeforces Round #297 (Div.2) Editorial | 1600 | |
| 4233 | 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 | |
| 2010 | 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 | |
| 5013 | King of Thieves | brute force implementation | Statement | A | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 1300 | |
| 4724 | Om Nom and Dark Park | dfs and similar greedy implementation | Statement | B | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 1500 | |
| 2655 | Om Nom and Candies | brute force greedy math | Statement | C | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 2000 | |
| 2471 | Om Nom and Necklace | hashing string suffix structures strings | Statement | D | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 2200 | |
| 1188 | Transmitting Levels | dp implementation | Statement | E | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 2400 | |
| 3456 | Pudding Monsters | data structures divide and conquer | Statement | F | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 2900 | |
| 866 | Spiders Evil Plan | greedy trees | Statement | G | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | ZeptoLab Code Rush 2015 — Editorial | 3300 | |
| 15642 | Playing with Paper | implementation math | Statement | A | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 1100 | |
| 4073 | Error Correct System | greedy | Statement | B | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 1500 | |
| 7582 | Glass Carving | binary search data structures implementation | Statement | C | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 1800 | |
| 5092 | Clique Problem | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 2100 | |
| 2197 | Data Center Drama | dfs and similar graphs | Statement | E | Codeforces Round 296 (Div. 2) {527} | PROGRAMMING | Codeforces Round #296 Editorial | 2600 | |
| 2903 | 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 | |
| 1000 | 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 | |
| 694 | 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 | |
| 612 | 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 | |
| 131 | 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 | |
| 555 | 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 | |
| 52 | Different variables | *special | Statement | I | VK Cup 2015 - Wild Card Round 1 {530} | PROGRAMMING | VK Cup 2015 Wild Card Round 1: editorial | 2600 | |
| 2443 | 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 | |
| 2433 | 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 | |
| 2696 | 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 | ||
| 956 | 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 | |
| 273 | Landmarks | data structures dp | Statement | D | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | 3000 | ||
| 488 | 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 | ||
| 12950 | Exam | constructive algorithms implementation math | Statement | A | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 1100 | ||
| 11407 | Covered Path | dp greedy math | Statement | B | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 1400 | ||
| 5294 | Polycarpus' Dice | math | Statement | C | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 1600 | ||
| 2577 | Handshakes | binary search constructive algorithms data structures greedy | Statement | D | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2000 | ||
| 395 | Berland Local Positioning System | constructive algorithms greedy hashing implementation | Statement | E | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2600 | ||
| 536 | Simplified Nonogram | bitmasks dp hashing meet-in-the-middle | Statement | F | Codeforces Round 298 (Div. 2) {534} | PROGRAMMING | 2900 | ||
| 26825 | Tavas and SaDDas | bitmasks brute force combinatorics implementation | Statement | B | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1100 | |
| 13082 | Tavas and Nafas | brute force implementation | Statement | A | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1100 | |
| 3997 | Tavas and Karafs | binary search greedy math | Statement | C | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 1900 | |
| 4791 | Tavas and Malekas | greedy hashing string suffix structures strings | Statement | D | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 2100 | |
| 867 | Tavas and Pashmaks | geometry math | Statement | E | Codeforces Round 299 (Div. 2) {535} | PROGRAMMING | Codeforces Round #299 Editorial | 2900 | |
| 793 | Tavas in Kansas | dp games | Statement | D | Codeforces Round 299 (Div. 1) {536} | PROGRAMMING | Codeforces Round #299 Editorial | 2800 | |
| 452 | Tavas on the Path | data structures divide and conquer trees | Statement | E | Codeforces Round 299 (Div. 1) {536} | PROGRAMMING | Codeforces Round #299 Editorial | 3100 | |
| 19410 | Quasi Binary | constructive algorithms dp greedy implementation | Statement | B | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1400 | |
| 7390 | Cutting Banner | brute force implementation | Statement | A | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1500 | |
| 6148 | Tourist's Notes | binary search brute force greedy implementation math | Statement | C | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1600 | |
| 2525 | Weird Chess | brute force constructive algorithms implementation | Statement | D | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 1800 | |
| 1651 | Demiurges Play Again | dfs and similar dp math trees | Statement | E | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 2200 | |
| 1865 | A Heap of Heaps | brute force data structures math sortings | Statement | F | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 2200 | |
| 735 | Summer Dichotomy | 2-sat data structures dfs and similar greedy | Statement | H | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 3100 | |
| 579 | Berserk Robot | constructive algorithms math sortings | Statement | G | Codeforces Round 300 {538} | PROGRAMMING | Codeforces Round #300 Editorial (+challenges) | 3100 | |
| 4995 | School Marks | greedy implementation | Statement | B | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 1700 | |
| 8303 | Ice Cave | dfs and similar | Statement | C | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 1800 | |
| 6618 | Bad Luck Island | dp probabilities | Statement | D | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 2100 | |
| 2532 | Infinite Inversions | binary search data structures implementation sortings trees | Statement | E | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 2400 | |
| 35389 | Combination Lock | implementation | Statement | A | Codeforces Round 301 (Div. 2) {540} | PROGRAMMING | Tutorial | 900 | |
| 1274 | Idempotent functions | constructive algorithms graphs math | Statement | C | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2000 | |
| 997 | Quest | dp greedy | Statement | F | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2100 | |
| 623 | Place Your Ad Here | data structures sortings | Statement | A | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2500 | |
| 540 | 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 | |
| 978 | Playing on Graph | graphs shortest paths | Statement | E | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 2600 | |
| 232 | Duck Hunt | data structures | Statement | B | VK Cup 2015 - Round 3 (unofficial online mirror, Div. 1 only) {542} | PROGRAMMING | 17697 | 3200 | |
| 8889 | Writing Code | dp | Statement | A | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 1900 | |
| 3291 | Road Improvement | dp trees | Statement | D | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2300 | |
| 4598 | Destroying Roads | constructive algorithms graphs shortest paths | Statement | B | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2300 | |
| 1561 | Remembering Strings | bitmasks dp | Statement | C | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 2600 | |
| 338 | Listening to Music | constructive algorithms data structures | Statement | E | Codeforces Round 302 (Div. 1) {543} | PROGRAMMING | Editorial Codeforces Round #302 | 3200 | |
| 8838 | Set of Strings | implementation strings | Statement | A | Codeforces Round 302 (Div. 2) {544} | PROGRAMMING | Editorial Codeforces Round #302 | 1100 | |
| 8970 | Sea and Islands | constructive algorithms implementation | Statement | B | Codeforces Round 302 (Div. 2) {544} | PROGRAMMING | Editorial Codeforces Round #302 | 1400 | |
| 12180 | Toy Cars | implementation | Statement | A | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1000 | |
| 12262 | Equidistant String | greedy | Statement | B | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1200 | |
| 29793 | Queue | greedy implementation sortings | Statement | D | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1400 | |
| 33481 | Woodcutters | dp greedy | Statement | C | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 1500 | |
| 5641 | Paths and Trees | graphs greedy shortest paths | Statement | E | Codeforces Round 303 (Div. 2) {545} | PROGRAMMING | Codeforces Round #303 (Div.2) editorial | 2100 | |
| 18691 | Soldier and Badges | brute force greedy implementation sortings | Statement | B | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 1300 | |
| 19517 | 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 | |
| 13889 | 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 | |
| 4348 | Soldier and Traveling | flows graphs math | Statement | E | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 2300 | |
| 238452 | Soldier and Bananas | brute force implementation math | Statement | A | Codeforces Round 304 (Div. 2) {546} | PROGRAMMING | Codeforces Round #304 (Div.2) editorial | 800 | |
| 2753 | Mike and Frog | brute force greedy implementation math | Statement | A | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 1900 | |
| 11146 | Mike and Feet | binary search data structures dp dsu | Statement | B | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2100 | |
| 3154 | Mike and Fish | constructive algorithms dfs and similar graphs | Statement | D | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2500 | |
| 3447 | Mike and Foam | bitmasks combinatorics dp math number theory | Statement | C | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2700 | |
| 2631 | Mike and Friends | data structures string suffix structures strings trees | Statement | E | Codeforces Round 305 (Div. 1) {547} | PROGRAMMING | Codeforces Round #305 Editorial | 2800 | |
| 10342 | Mike and Fax | brute force implementation strings | Statement | A | Codeforces Round 305 (Div. 2) {548} | PROGRAMMING | Codeforces Round #305 Editorial | 1200 | |
| 9045 | Mike and Fun | brute force dp greedy implementation | Statement | B | Codeforces Round 305 (Div. 2) {548} | PROGRAMMING | Codeforces Round #305 Editorial | 1400 | |
| 10192 | Face Detection | implementation strings | Statement | A | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 1000 | |
| 2257 | Haar Features | greedy implementation | Statement | D | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 1800 | |
| 2095 | Degenerate Matrix | binary search math | Statement | H | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2100 | |
| 1833 | The Game Of Parity | games | Statement | C | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2200 | |
| 2658 | Happy Line | constructive algorithms greedy sortings | Statement | G | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2200 | |
| 1594 | Looksery Party | constructive algorithms dfs and similar graphs greedy | Statement | B | Looksery Cup 2015 {549} | PROGRAMMING | Looksery Cup 2015 Editorial | 2300 | |
| 1041 | 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 | |
| 44019 | Two Substrings | brute force dp greedy implementation strings | Statement | A | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 27965 | Preparing Olympiad | bitmasks brute force | Statement | B | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 32441 | Divisibility by Eight | brute force dp math | Statement | C | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 1500 | |
| 3787 | Regular Bridge | constructive algorithms graphs implementation | Statement | D | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Разбор задач Codeforces Round #306 (Div. 2) | 2000 | |
| 1502 | Brackets in Implications | constructive algorithms greedy implementation math | Statement | E | Codeforces Round 306 (Div. 2) {550} | PROGRAMMING | Codeforces Round #306 (Div. 2) Editorial | 2300 | |
| 17898 | GukiZ and Contest | brute force implementation sortings | Statement | A | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 1000 | |
| 4066 | ZgukistringZ | brute force constructive algorithms implementation strings | Statement | B | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 1800 | |
| 4001 | GukiZ hates Boxes | binary search greedy | Statement | C | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2200 | |
| 2114 | GukiZ and Binary Operations | combinatorics implementation math matrices number theory | Statement | D | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2400 | |
| 2157 | GukiZ and GukiZiana | binary search data structures implementation | Statement | E | Codeforces Round 307 (Div. 2) {551} | PROGRAMMING | Tutorial | 2600 | |
| 10186 | Vanya and Table | implementation math | Statement | A | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1100 | |
| 16098 | Vanya and Books | implementation math | Statement | B | Codeforces Round 308 (Div. 2) {552} | PROGRAMMING | Codeforces #308 (Div. 2) Editorial | 1300 | |
| 5883 | 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 | |
| 4867 | 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 | |
| 1741 | 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 | |
| 9953 | Kyoya and Colored Balls | combinatorics dp math | Statement | A | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 1700 | |
| 2274 | 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 | |
| 1087 | Nudist Beach | binary search graphs greedy | Statement | D | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2300 | |
| 1968 | Love Triangles | dfs and similar dsu graphs | Statement | C | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 2300 | |
| 625 | Kyoya and Train | dp fft graphs math probabilities | Statement | E | Codeforces Round 309 (Div. 1) {553} | PROGRAMMING | Codeforces Round #309 Editorial | 3300 | |
| 11002 | Ohana Cleans Up | brute force greedy strings | Statement | B | Codeforces Round 309 (Div. 2) {554} | PROGRAMMING | Codeforces Round #309 Editorial | 1200 | |
| 14568 | Kyoya and Photobooks | brute force math strings | Statement | A | Codeforces Round 309 (Div. 2) {554} | PROGRAMMING | Codeforces Round #309 Editorial | 900 | |
| 6692 | Case of Matryoshkas | implementation | Statement | A | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 1500 | |
| 4093 | Case of Fugitive | data structures greedy sortings | Statement | B | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2100 | |
| 2068 | Case of Chocolate | data structures | Statement | C | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2500 | |
| 934 | Case of a Top Secret | binary search implementation math | Statement | D | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2500 | |
| 3002 | Case of Computer Network | dfs and similar graphs trees | Statement | E | Codeforces Round 310 (Div. 1) {555} | PROGRAMMING | Codeforces Round #310 Editorial | 2800 | |
| 46742 | Case of the Zeros and Ones | greedy | Statement | A | Codeforces Round 310 (Div. 2) {556} | PROGRAMMING | Codeforces Round #310 Editorial | 1100 | |
| 8207 | Case of Fake Numbers | brute force implementation | Statement | B | Codeforces Round 310 (Div. 2) {556} | PROGRAMMING | Codeforces Round #310 Editorial | 1100 | |
| 8521 | Ilya and Diplomas | greedy implementation math | Statement | A | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 1200 | |
| 7492 | Pasha and Tea | constructive algorithms implementation math sortings | Statement | B | Codeforces Round 311 (Div. 2) {557} | PROGRAMMING | Codeforces Round #311 (Div.2) Editorial | 1500 | |
| 4228 | 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 | |
| 2394 | 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 | |
| 1222 | 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 | |
| 11027 | 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 | |
| 8377 | Amr and The Large Array | implementation | Statement | B | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 1400 | |
| 4215 | 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 | |
| 1210 | 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 | |
| 7499 | A Simple Task | data structures sortings strings | Statement | E | Codeforces Round 312 (Div. 2) {558} | PROGRAMMING | Codeforces Round #312 (Div. 2) Editorial | 2600 | |
| 10929 | Gerald's Hexagon | brute force geometry math | Statement | A | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1600 | |
| 11728 | Equivalent Strings | divide and conquer hashing sortings strings | Statement | B | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1800 | |
| 8185 | 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 | |
| 1167 | Gerald and Path | dp sortings | Statement | E | Codeforces Round 313 (Div. 1) {559} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 2900 | |
| 19982 | Currency System in Geraldion | implementation sortings | Statement | A | Codeforces Round 313 (Div. 2) {560} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1100 | |
| 8281 | Gerald is into Art | constructive algorithms implementation | Statement | B | Codeforces Round 313 (Div. 2) {560} | PROGRAMMING | Codeforces Round 313 — Extended editoral | 1300 | |
| 4334 | 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 | |
| 3990 | Restructuring Company | data structures dsu | Statement | D | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 1900 | |
| 1067 | Matching Names | dfs and similar strings trees | Statement | A | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 2300 | |
| 386 | Max and Min | geometry | Statement | G | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 2500 | |
| 371 | Replicating Processes | constructive algorithms greedy | Statement | B | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 2600 | |
| 886 | 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 | |
| 710 | Restoring Map | bitmasks constructive algorithms trees | Statement | E | VK Cup 2015 - Finals, online mirror {566} | PROGRAMMING | Editorial for VK Cup 2015 — Finals | 3200 | |
| 36133 | Lineland Mail | greedy implementation | Statement | A | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1000 | |
| 8709 | Berland National Library | implementation | Statement | B | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1300 | |
| 10501 | Geometric Progression | binary search data structures dp | Statement | C | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1700 | |
| 5264 | One-Dimensional Battle Ships | binary search data structures greedy sortings | Statement | D | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 1800 | |
| 2274 | President and Roads | dfs and similar graphs hashing shortest paths | Statement | E | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 2600 | |
| 641 | Mausoleum | dp | Statement | F | Codeforces Round #Pi (Div. 2) {567} | PROGRAMMING | Editorial Codeforces Round #Pi | 2700 | |
| 5414 | Primes or Palindromes? | brute force implementation math number theory | Statement | A | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 1700 | |
| 2388 | Symmetric and Transitive | combinatorics dp math | Statement | B | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 2100 | |
| 948 | 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 | |
| 634 | Longest Increasing Subsequence | data structures dp | Statement | E | Codeforces Round 315 (Div. 1) {568} | PROGRAMMING | Codeforces Round #315 Editorial | 3000 | |
| 7531 | Inventory | greedy math | Statement | B | Codeforces Round 315 (Div. 2) {569} | PROGRAMMING | Codeforces Round #315 Editorial | 1200 | |
| 5070 | Music | implementation math | Statement | A | Codeforces Round 315 (Div. 2) {569} | PROGRAMMING | Codeforces Round #315 Editorial | 1500 | |
| 14346 | Elections | implementation | Statement | A | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 1200 | |
| 16917 | Simple Game | constructive algorithms games greedy implementation math | Statement | B | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 1300 | |
| 9585 | Replacement | constructive algorithms data structures implementation | Statement | C | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 1600 | |
| 9192 | 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 | |
| 2118 | Pig and Palindromes | combinatorics dp | Statement | E | Codeforces Round 316 (Div. 2) {570} | PROGRAMMING | Codeforces Round #316 Editorial | 2600 | |
| 2834 | Minimization | dp greedy sortings | Statement | B | Codeforces Round 317 [AimFund Thanks-Round] (Div. 1) {571} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 2300 | |
| 2707 | 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 | |
| 720 | 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 | |
| 18523 | Arrays | sortings | Statement | A | Codeforces Round 317 [AimFund Thanks-Round] (Div. 2) {572} | PROGRAMMING | Codeforces Round #317 [AimFund Thanks-Round] Editorial | 1000 | |
| 9047 | 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 | |
| 18523 | 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 | |
| 6367 | 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 | |
| 1044 | 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 | |
| 714 | 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 | |
| 2057 | 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 | |
| 9584 | 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 | |
| 8352 | 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 | |
| 1994 | Tablecity | constructive algorithms implementation | Statement | D | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 1700 | |
| 1886 | Bots | combinatorics number theory | Statement | H | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 1800 | |
| 1112 | Bulbo | dp greedy | Statement | F | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2200 | |
| 1258 | Bribes | dfs and similar graphs trees | Statement | B | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2300 | |
| 1000 | 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 | |
| 234 | Party | bitmasks brute force graph matchings | Statement | C | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2800 | |
| 864 | Fibonotci | data structures math matrices | Statement | A | Bubble Cup 8 - Finals [Online Mirror] {575} | PROGRAMMING | Bubble Cup finals 2015 Results and Editorial | 2800 | |
| 548 | 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 | |
| 16023 | Vasya and Petya's Game | math number theory | Statement | A | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 1500 | |
| 4256 | 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 | |
| 1925 | Invariance of Tree | constructive algorithms dfs and similar greedy trees | Statement | B | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 2300 | |
| 1601 | Flights for Regular Customers | dp matrices | Statement | D | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 2600 | |
| 1524 | Painting Edges | binary search data structures | Statement | E | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | Editorial Codeforces Round #319 | 3200 | |
| 45822 | Multiplication Table | implementation number theory | Statement | A | Codeforces Round 319 (Div. 2) {577} | PROGRAMMING | Editorial Codeforces Round #319 | 1100 | |
| 15165 | Modulo Sum | combinatorics data structures dp two pointers | Statement | B | Codeforces Round 319 (Div. 2) {577} | PROGRAMMING | Editorial Codeforces Round #319 | 1800 | |
| 4964 | 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 | |
| 5509 | "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 | |
| 5237 | 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 | |
| 675 | Walking! | constructive algorithms greedy | Statement | E | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 2500 | |
| 973 | LCS Again | dp greedy | Statement | D | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 2800 | |
| 655 | Mirror Box | matrices trees | Statement | F | Codeforces Round 320 (Div. 1) [Bayan Thanks-Round] {578} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 3400 | |
| 80146 | Raising Bacteria | bitmasks | Statement | A | Codeforces Round 320 (Div. 2) [Bayan Thanks-Round] {579} | PROGRAMMING | Codeforces Round #320 [Bayan Thanks-Round] Editorial | 1000 | |
| 5467 | 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 | |
| 106109 | Kefa and First Steps | brute force dp implementation | Statement | A | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1000 | |
| 56493 | Kefa and Park | dfs and similar graphs trees | Statement | C | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1500 | |
| 32377 | Kefa and Company | binary search sortings two pointers | Statement | B | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1500 | |
| 12049 | Kefa and Dishes | bitmasks dp | Statement | D | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 1900 | |
| 2600 | Kefa and Watch | data structures hashing strings | Statement | E | Codeforces Round 321 (Div. 2) {580} | PROGRAMMING | Codeforces Round #321 Editorial | 2700 | |
| 13673 | Luxurious Houses | implementation math | Statement | B | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 1200 | |
| 7607 | Developing Skills | implementation math sortings | Statement | C | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 1400 | |
| 4788 | 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 | |
| 1040 | Zublicanes and Mumocrates | dp trees two pointers | Statement | F | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 2600 | |
| 220 | Kojiro and Furrari | dp greedy | Statement | E | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 2600 | |
| 85726 | Vasya the Hipster | implementation math | Statement | A | Codeforces Round 322 (Div. 2) {581} | PROGRAMMING | Codeforces Round #322 (Div.2) Editorial | 700 | |
| 8370 | GCD Table | constructive algorithms greedy number theory | Statement | A | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 1700 | |
| 3656 | Once Again... | constructive algorithms dp matrices | Statement | B | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 2000 | |
| 797 | Superior Periodic Subarrays | number theory | Statement | C | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 2900 | |
| 550 | Boolean Function | bitmasks dp expression parsing | Statement | E | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 2900 | |
| 741 | Number of Binominal Coefficients | dp math number theory | Statement | D | Codeforces Round 323 (Div. 1) {582} | PROGRAMMING | Codeforces Round #323 Editorial | 3100 | |
| 11775 | Asphalting Roads | implementation | Statement | A | Codeforces Round 323 (Div. 2) {583} | PROGRAMMING | Codeforces Round #323 Editorial | 1000 | |
| 8998 | Robot's Task | greedy implementation | Statement | B | Codeforces Round 323 (Div. 2) {583} | PROGRAMMING | Codeforces Round #323 Editorial | 1200 | |
| 53027 | Olesya and Rodion | math | Statement | A | Codeforces Round 324 (Div. 2) {584} | PROGRAMMING | Tutorial | 1100 | |
| 13763 | Kolya and Tanya | combinatorics | Statement | B | Codeforces Round 324 (Div. 2) {584} | PROGRAMMING | Tutorial | 1500 | |
| 6543 | Marina and Vasya | constructive algorithms greedy strings | Statement | C | Codeforces Round 324 (Div. 2) {584} | PROGRAMMING | Tutorial | 1700 | |
| 11217 | Dima and Lisa | brute force math number theory | Statement | D | Codeforces Round 324 (Div. 2) {584} | PROGRAMMING | Tutorial | 1700 | |
| 1497 | Anton and Ira | constructive algorithms greedy math | Statement | E | Codeforces Round 324 (Div. 2) {584} | PROGRAMMING | Tutorial | 2400 | |
| 3817 | Phillip and Trains | dfs and similar graphs shortest paths | Statement | B | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 1800 | |
| 4478 | Gennady the Dentist | brute force implementation | Statement | A | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 1800 | |
| 1067 | Alice, Bob, Oranges and Apples | number theory | Statement | C | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 2400 | |
| 2065 | Lizard Era: Beginning | meet-in-the-middle | Statement | D | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 2500 | |
| 1234 | Present for Vitalik the Philatelist | combinatorics math number theory | Statement | E | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 2800 | |
| 810 | Digits of Number Pi | dp implementation strings | Statement | F | Codeforces Round 325 (Div. 1) {585} | PROGRAMMING | Разбор Codeforces Round #325 | 3200 | |
| 10617 | Alena's Schedule | implementation | Statement | A | Codeforces Round 325 (Div. 2) {586} | PROGRAMMING | Разбор Codeforces Round #325 | 1100 | |
| 5245 | Laurenty and Shop | implementation | Statement | B | Codeforces Round 325 (Div. 2) {586} | PROGRAMMING | Разбор Codeforces Round #325 | 1300 | |
| 8366 | Duff and Weight Lifting | greedy | Statement | A | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 1500 | |
| 4827 | Duff in the Army | data structures trees | Statement | C | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 2200 | |
| 1497 | Duff in Beach | dp | Statement | B | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 2300 | |
| 859 | Duff as a Queen | data structures | Statement | E | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 2800 | |
| 897 | Duff in Mafia | 2-sat binary search | Statement | D | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 2900 | |
| 1366 | Duff is Mad | data structures strings | Statement | F | Codeforces Round 326 (Div. 1) {587} | PROGRAMMING | Codeforces Round #326 (Editorial) | 3000 | |
| 24542 | Duff and Meat | greedy | Statement | A | Codeforces Round 326 (Div. 2) {588} | PROGRAMMING | 1000 | ||
| 15042 | Duff in Love | math | Statement | B | Codeforces Round 326 (Div. 2) {588} | PROGRAMMING | 1400 | ||
| 4381 | Median Smoothing | implementation | Statement | A | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 1700 | |
| 2041 | Chip 'n Dale Rescue Rangers | binary search geometry math | Statement | B | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 2100 | |
| 3609 | Three States | dfs and similar graphs shortest paths | Statement | C | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 2200 | |
| 1341 | Top Secret Task | dp | Statement | D | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 2300 | |
| 888 | Birthday | graph matchings strings | Statement | E | Codeforces Round 327 (Div. 1) {590} | PROGRAMMING | Codeforces Round #327 problems analysis | 3100 |