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 ... 11 12 13 14 15 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 1470 | Student's Camp | dp math | Statement | E | AIM Tech Round 3 (Div. 1) {708} | PROGRAMMING | 3100 | ||
| 38836 | Juicer | implementation | Statement | A | AIM Tech Round 3 (Div. 2) {709} | PROGRAMMING | 1000 | ||
| 5063 | Checkpoints | greedy implementation sortings | Statement | B | AIM Tech Round 3 (Div. 2) {709} | PROGRAMMING | 1500 | ||
| 14952 | King Moves | implementation | Statement | A | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 1000 | |
| 10735 | Optimal Point on a Line | brute force sortings | Statement | B | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 1400 | |
| 5650 | Magic Odd Square | constructive algorithms math | Statement | C | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 1600 | |
| 5949 | Generate a String | dfs and similar dp | Statement | E | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 2100 | |
| 2002 | Two Arithmetic Progressions | math | Statement | D | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 2500 | |
| 2725 | String Set Queries | brute force data structures hashing string suffix structures strings | Statement | F | Educational Codeforces Round 16 {710} | PROGRAMMING | Editorial of Educational Codeforces Round 16 | 2700 | |
| 8685 | Chris and Magic Square | constructive algorithms implementation | Statement | B | Codeforces Round 369 (Div. 2) {711} | PROGRAMMING | 46830 | 1400 | |
| 9709 | Coloring Trees | dp | Statement | C | Codeforces Round 369 (Div. 2) {711} | PROGRAMMING | 46830 | 1700 | |
| 5180 | Directed Roads | combinatorics dfs and similar graphs math | Statement | D | Codeforces Round 369 (Div. 2) {711} | PROGRAMMING | 46830 | 1900 | |
| 1441 | ZS and The Birthday Paradox | math number theory probabilities | Statement | E | Codeforces Round 369 (Div. 2) {711} | PROGRAMMING | 46830 | 2400 | |
| 31151 | Bus to Udayland | brute force implementation | Statement | A | Codeforces Round 369 (Div. 2) {711} | PROGRAMMING | 46830 | 700 | |
| 10410 | Memory and Trident | implementation strings | Statement | B | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | Codeforces Round #370 Editorial | 1200 | |
| 6263 | Memory and De-Evolution | greedy math | Statement | C | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | Codeforces Round #370 Editorial | 1600 | |
| 2050 | Memory and Scores | combinatorics dp math | Statement | D | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | Codeforces Round #370 Editorial | 2100 | |
| 762 | Memory and Casinos | data structures math probabilities | Statement | E | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | Codeforces Round #370 Editorial | 2700 | |
| 12684 | Memory and Crow | implementation math | Statement | A | Codeforces Round 370 (Div. 2) {712} | PROGRAMMING | Codeforces Round #370 Editorial | 900 | |
| 8917 | Sonya and Queries | data structures implementation | Statement | A | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 1500 | |
| 1535 | Searching Rectangles | binary search constructive algorithms interactive | Statement | B | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 2200 | |
| 6867 | Sonya and Problem Wihtout a Legend | dp sortings | Statement | C | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 2400 | |
| 1447 | Animals and Puzzle | binary search data structures | Statement | D | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 2700 | |
| 424 | Sonya Partymaker | binary search dp | Statement | E | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | Codeforces Round #371 Editorial | 3100 | |
| 11209 | Meeting of Old Friends | implementation math | Statement | A | Codeforces Round 371 (Div. 2) {714} | PROGRAMMING | Codeforces Round #371 Editorial | 1100 | |
| 15665 | Filya and Homework | implementation sortings | Statement | B | Codeforces Round 371 (Div. 2) {714} | PROGRAMMING | Codeforces Round #371 Editorial | 1200 | |
| 5896 | Plus and Square Root | constructive algorithms math | Statement | A | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | Codeforces Round #372 Editorial | 1600 | |
| 3901 | Complete The Graph | binary search constructive algorithms graphs shortest paths | Statement | B | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | Codeforces Round #372 Editorial | 2200 | |
| 2812 | Digit Tree | dfs and similar divide and conquer dsu trees | Statement | C | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | Codeforces Round #372 Editorial | 2800 | |
| 488 | Create a Maze | constructive algorithms | Statement | D | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | Codeforces Round #372 Editorial | 3000 | |
| 738 | Complete the Permutations | combinatorics fft graphs math | Statement | E | Codeforces Round 372 (Div. 1) {715} | PROGRAMMING | Codeforces Round #372 Editorial | 3400 | |
| 13267 | Complete the Word | greedy two pointers | Statement | B | Codeforces Round 372 (Div. 2) {716} | PROGRAMMING | Codeforces Round #372 Editorial | 1400 | |
| 24262 | Crazy Computer | implementation | Statement | A | Codeforces Round 372 (Div. 2) {716} | PROGRAMMING | Codeforces Round #372 Editorial | 800 | |
| 4378 | Potions Homework | implementation sortings | Statement | C | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | Tutorial | 1200 | |
| 1593 | Paint it really, really dark gray | dfs and similar | Statement | E | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | Tutorial | 1900 | |
| 1652 | Dexterina’s Lab | games matrices probabilities | Statement | D | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | Tutorial | 1900 | |
| 760 | Underfail | flows | Statement | G | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | Tutorial | 2400 | |
| 498 | Pokermon League challenge | math probabilities | Statement | H | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | Tutorial | 2400 | |
| 420 | Heroes of Making Magic III | data structures | Statement | F | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | Tutorial | 2700 | |
| 507 | Festival Organization | math number theory | Statement | A | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | Tutorial | 3000 | |
| 216 | R3D3’s Summer Adventure | dp greedy | Statement | B | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | Tutorial | 3200 | |
| 225 | Cowboy Beblop at his computer | geometry | Statement | I | Bubble Cup 9 - Finals [Online Mirror] {717} | PROGRAMMING | Tutorial | 3800 | |
| 4643 | Efim and Strange Grade | dp implementation math | Statement | A | Codeforces Round 373 (Div. 1) {718} | PROGRAMMING | Codeforces Round #373 — Editorial | 1700 | |
| 5032 | Sasha and Array | data structures math matrices | Statement | C | Codeforces Round 373 (Div. 1) {718} | PROGRAMMING | Codeforces Round #373 — Editorial | 2300 | |
| 618 | Andrew and Chemistry | dp hashing trees | Statement | D | Codeforces Round 373 (Div. 1) {718} | PROGRAMMING | Codeforces Round #373 — Editorial | 2900 | |
| 519 | Matvey's Birthday | bitmasks graphs | Statement | E | Codeforces Round 373 (Div. 1) {718} | PROGRAMMING | Codeforces Round #373 — Editorial | 3400 | |
| 16513 | Vitya in the Countryside | implementation | Statement | A | Codeforces Round 373 (Div. 2) {719} | PROGRAMMING | Codeforces Round #373 — Editorial | 1100 | |
| 8870 | Anatoly and Cockroaches | greedy | Statement | B | Codeforces Round 373 (Div. 2) {719} | PROGRAMMING | Codeforces Round #373 — Editorial | 1400 | |
| 1013 | Closing ceremony | greedy | Statement | A | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 2000 | |
| 492 | Cactusophobia | dfs and similar flows | Statement | B | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 2300 | |
| 337 | Slalom | data structures dp sortings | Statement | D | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 3100 | |
| 231 | Homework | constructive algorithms | Statement | C | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 3100 | |
| 125 | Cipher | implementation | Statement | E | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 3100 | |
| 217 | Array Covering | data structures | Statement | F | Russian Code Cup 2016 - Finals [Unofficial Mirror, Div. 1 Only Recommended] {720} | PROGRAMMING | Russian Code Cup 2016 — Results and Tutorial | 3100 | |
| 12545 | Passwords | implementation math sortings strings | Statement | B | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | Codeforces Round #374 (Div. 2) Editorial | 1200 | |
| 6778 | Journey | dp graphs | Statement | C | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | Codeforces Round #374 (Div. 2) Editorial | 1800 | |
| 2535 | Maxim and Array | constructive algorithms data structures greedy math | Statement | D | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | Codeforces Round #374 (Div. 2) Editorial | 2000 | |
| 387 | Road to Home | binary search dp | Statement | E | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | Codeforces Round #374 (Div. 2) Editorial | 2800 | |
| 19463 | One-dimensional Japanese Crossword | implementation | Statement | A | Codeforces Round 374 (Div. 2) {721} | PROGRAMMING | Codeforces Round #374 (Div. 2) Editorial | 700 | |
| 6823 | Verse Pattern | implementation strings | Statement | B | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 1200 | |
| 7004 | Broken Clock | brute force implementation | Statement | A | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 1300 | |
| 11942 | Destroying Array | data structures dsu | Statement | C | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 1600 | |
| 3381 | Generating Sets | binary search data structures dfs and similar greedy strings trees | Statement | D | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 1900 | |
| 1177 | Research Rover | combinatorics dp | Statement | E | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 2800 | |
| 668 | Cyclic Cipher | chinese remainder theorem data structures implementation number theory two pointers | Statement | F | Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} | PROGRAMMING | Tutorial | 2800 | |
| 11030 | Text Document Analysis | expression parsing implementation strings | Statement | B | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | Codeforces Round #375 (Div.2) Editorial | 1100 | |
| 5294 | Polycarp at the Radio | greedy | Statement | C | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | Codeforces Round #375 (Div.2) Editorial | 1600 | |
| 7625 | Lakes in Berland | dfs and similar dsu graphs greedy implementation | Statement | D | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | 1600 | ||
| 1798 | st-Spanning Tree | dsu graphs greedy implementation | Statement | F | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | Codeforces Round #375 (Div.2) Editorial | 2200 | |
| 2366 | One-Way Reform | constructive algorithms dfs and similar flows graphs greedy | Statement | E | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | Codeforces Round #375 (Div.2) Editorial | 2300 | |
| 104844 | The New Year: Meeting Friends | implementation math sortings | Statement | A | Codeforces Round 375 (Div. 2) {723} | PROGRAMMING | Codeforces Round #375 (Div.2) Editorial | 800 | |
| 7616 | Checking the Calendar | implementation | Statement | A | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 1000 | |
| 4268 | Batch Sort | brute force greedy implementation math | Statement | B | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 1500 | |
| 2297 | Ray Tracing | greedy hashing implementation math number theory sortings | Statement | C | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 1800 | |
| 2496 | Dense Subsequence | data structures greedy strings | Statement | D | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 1900 | |
| 1613 | Xor-matic Number of the Graph | bitmasks graphs math number theory trees | Statement | G | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 2600 | |
| 568 | Uniformly Branched Trees | combinatorics dp trees | Statement | F | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 2800 | |
| 2064 | Goods transportation | dp flows greedy | Statement | E | Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) {724} | PROGRAMMING | Tutorial | 2900 | |
| 7560 | Jumping Ball | implementation | Statement | A | Canada Cup 2016 {725} | PROGRAMMING | Canada Cup Editorial | 1100 | |
| 5373 | Food on the Plane | implementation math | Statement | B | Canada Cup 2016 {725} | PROGRAMMING | 1200 | ||
| 2956 | Hidden Word | brute force constructive algorithms implementation strings | Statement | C | Canada Cup 2016 {725} | PROGRAMMING | Canada Cup Editorial | 1600 | |
| 3151 | Contest Balloons | data structures greedy | Statement | D | Canada Cup 2016 {725} | PROGRAMMING | 1800 | ||
| 744 | Too Much Money | brute force greedy | Statement | E | Canada Cup 2016 {725} | PROGRAMMING | 2500 | ||
| 803 | Family Photos | games greedy | Statement | F | Canada Cup 2016 {725} | PROGRAMMING | Canada Cup Editorial | 2900 | |
| 289 | Messages on a Tree | Statement | G | Canada Cup 2016 {725} | PROGRAMMING | 3300 | |||
| 18827 | Transformation: from A to B | brute force dfs and similar math | Statement | A | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 1100 | |
| 9307 | Guess the Array | constructive algorithms interactive math | Statement | C | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 1400 | |
| 2286 | Bill Total Value | expression parsing implementation strings | Statement | B | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 1600 | |
| 2108 | T-shirts Distribution | constructive algorithms flows greedy | Statement | D | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 1800 | |
| 1153 | Polycarp's problems | binary search dp greedy | Statement | F | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 2300 | |
| 1664 | Games on a CD | data structures hashing string suffix structures strings | Statement | E | Technocup 2017 - Elimination Round 1 (Unofficially Open for Everyone, Rated for Div. 2) {727} | PROGRAMMING | Tutorial | 2300 | |
| 8188 | Interview with Oleg | implementation strings | Statement | A | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial | 1000 | |
| 8828 | Spotlights | dp implementation | Statement | B | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial | 1300 | |
| 4114 | Sea Battle | constructive algorithms greedy math | Statement | D | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | 1700 | ||
| 4207 | Road to Cinema | binary search greedy sortings | Statement | C | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | 1700 | ||
| 2426 | Subordinates | constructive algorithms data structures graphs greedy sortings | Statement | E | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial | 2000 | |
| 1106 | Financiers Game | dp | Statement | F | Technocup 2017 - Elimination Round 2 {729} | PROGRAMMING | Technocup 2017 — Elimination Round 2 (and Codeforces Round 380) Editorial | 2600 | |
| 3308 | Delete Them | constructive algorithms implementation | Statement | H | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 1400 | |
| 2325 | Car Repair Shop | implementation | Statement | G | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 1700 | |
| 2829 | Minimum and Maximum | constructive algorithms interactive | Statement | B | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 1900 | |
| 1741 | Toda 2 | greedy implementation | Statement | A | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 2000 | |
| 4176 | Bottles | dp | Statement | J | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 2000 | |
| 2932 | Olympiad in Programming and Sports | dp flows greedy | Statement | I | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 2200 | |
| 1414 | Bulmart | binary search dfs and similar | Statement | C | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 2200 | |
| 965 | Running Over The Bridges | greedy implementation math | Statement | D | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 2400 | |
| 926 | Award Ceremony | greedy implementation | Statement | E | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 2400 | |
| 217 | Ber Patio | Statement | F | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 3200 | ||
| 196 | Roads Orientation Problem | Statement | K | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 3300 | ||
| 246 | Expression Queries | Statement | L | 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {730} | PROGRAMMING | Разбор задач (видео, по-русски) | 3300 | ||
| 8383 | Coupons and Discounts | constructive algorithms greedy | Statement | B | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 47840 | 1200 | |
| 8019 | Socks | dfs and similar dsu graphs greedy | Statement | C | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 47840 | 1600 | |
| 3201 | Video Cards | brute force data structures implementation math number theory | Statement | F | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 47840 | 1900 | |
| 1308 | 80-th Level Archeology | brute force data structures greedy sortings | Statement | D | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 47840 | 2200 | |
| 1941 | Funny Game | dp games | Statement | E | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 47840 | 2300 | |
| 54413 | Night at the Museum | implementation strings | Statement | A | Codeforces Round 376 (Div. 2) {731} | PROGRAMMING | 47840 | 800 | |
| 25967 | Cormen --- The Best Friend Of a Man | dp greedy | Statement | B | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | Codeforces Round #377 (Div. 2) Editorial | 1100 | |
| 10246 | Sanatorium | binary search constructive algorithms greedy implementation math | Statement | C | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | Codeforces Round #377 (Div. 2) Editorial | 1300 | |
| 6014 | Exams | binary search greedy sortings | Statement | D | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | Codeforces Round #377 (Div. 2) Editorial | 1700 | |
| 1687 | Sockets | greedy sortings | Statement | E | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | Codeforces Round #377 (Div. 2) Editorial | 2000 | |
| 3716 | Tourist Reform | dfs and similar graphs | Statement | F | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | Codeforces Round #377 (Div. 2) Editorial | 2400 | |
| 92080 | Buy a Shovel | brute force constructive algorithms implementation math | Statement | A | Codeforces Round 377 (Div. 2) {732} | PROGRAMMING | Codeforces Round #377 (Div. 2) Editorial | 800 | |
| 17061 | Grasshopper And the String | implementation | Statement | A | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 1000 | |
| 11000 | Parade | math | Statement | B | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 1100 | |
| 4382 | Kostya the Sculptor | data structures hashing | Statement | D | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 1600 | |
| 3594 | Epidemic in Monstropolis | constructive algorithms dp greedy two pointers | Statement | C | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 1800 | |
| 1132 | Sleep in Class | constructive algorithms data structures math two pointers | Statement | E | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 2500 | |
| 1423 | Drivers Dissatisfaction | data structures dsu graphs trees | Statement | F | Codeforces Round 378 (Div. 2) {733} | PROGRAMMING | Codeforces Round #378 (Div. 2) editorial | 2500 | |
| 5743 | Anton and Making Potions | binary search dp greedy two pointers | Statement | C | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 1600 | |
| 3943 | Anton and Chess | implementation | Statement | D | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 1700 | |
| 5587 | Anton and Tree | dfs and similar dp trees | Statement | E | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 2100 | |
| 1455 | Anton and School | bitmasks constructive algorithms implementation math | Statement | F | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 2600 | |
| 204070 | Anton and Danik | implementation strings | Statement | A | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 700 | |
| 32369 | Anton and Digits | brute force greedy implementation math | Statement | B | Codeforces Round 379 (Div. 2) {734} | PROGRAMMING | Tutorial of Codeforces Round #379 (Div. 2) | 800 | |
| 13241 | Ostap and Grasshopper | implementation strings | Statement | A | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | Codeforces Round #382 Editorial | 1000 | |
| 8816 | Urbanization | greedy number theory sortings | Statement | B | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | Codeforces Round #382 Editorial | 1200 | |
| 16339 | Taxes | math number theory | Statement | D | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | Codeforces Round #382 Editorial | 1600 | |
| 8090 | Tennis Championship | combinatorics constructive algorithms greedy math | Statement | C | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | Codeforces Round #382 Editorial | 1700 | |
| 1067 | Ostap and Tree | dp trees | Statement | E | Codeforces Round 382 (Div. 2) {735} | PROGRAMMING | Codeforces Round #382 Editorial | 2800 | |
| 621 | Permutations | math matrices | Statement | D | Codeforces Round 382 (Div. 1) {736} | PROGRAMMING | 48659 | 2700 | |
| 255 | Chess Championship | constructive algorithms flows greedy math | Statement | E | Codeforces Round 382 (Div. 1) {736} | PROGRAMMING | 48659 | 2800 | |
| 361 | Tanya is 5! | graph matchings graphs greedy schedules | Statement | E | Codeforces Round 380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2) {737} | PROGRAMMING | 3300 | ||
| 85 | Dirty plates | constructive algorithms math | Statement | F | Codeforces Round 380 (Div. 1, Rated, Based on Technocup 2017 - Elimination Round 2) {737} | PROGRAMMING | 3300 | ||
| 8538 | Alyona and mex | constructive algorithms greedy | Statement | A | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 1600 | |
| 5287 | Alyona and a tree | binary search data structures dfs and similar graphs trees | Statement | B | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 2000 | |
| 1801 | Alyona and towers | data structures | Statement | C | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 2500 | |
| 2871 | Gosha is hunting | brute force data structures dp flows math probabilities sortings | Statement | E | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 2900 | |
| 253 | Recover a functional graph | graph matchings | Statement | D | Codeforces Round 381 (Div. 1) {739} | PROGRAMMING | 48582 | 3400 | |
| 8944 | Alyona and flowers | constructive algorithms | Statement | B | Codeforces Round 381 (Div. 2) {740} | PROGRAMMING | Tutorial | 1200 | |
| 9207 | Alyona and copybooks | brute force implementation | Statement | A | Codeforces Round 381 (Div. 2) {740} | PROGRAMMING | Tutorial | 1300 | |
| 5744 | Arpa's loud Owf and Mehrdad's evil plan | dfs and similar math | Statement | A | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | Codeforces Round #383 editorial | 1600 | |
| 6017 | Arpa's weak amphitheater and Mehrdad's valuable Hoses | dfs and similar dp dsu | Statement | B | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | Codeforces Round #383 editorial | 1700 | |
| 3336 | Arpa’s overnight party and Mehrdad’s silent entering | constructive algorithms dfs and similar graphs | Statement | C | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | Codeforces Round #383 editorial | 2600 | |
| 3913 | Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths | data structures dfs and similar trees | Statement | D | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | Codeforces Round #383 editorial | 2700 | |
| 244 | Arpa’s abnormal DNA and Mehrdad’s deep interest | data structures string suffix structures | Statement | E | Codeforces Round 383 (Div. 1) {741} | PROGRAMMING | Codeforces Round #383 editorial | 3300 | |
| 53926 | Arpa’s hard exam and Mehrdad’s naive cheat | implementation math number theory | Statement | A | Codeforces Round 383 (Div. 2) {742} | PROGRAMMING | Test data | 1000 | |
| 10163 | Arpa’s obvious problem and Mehrdad’s terrible solution | brute force math number theory | Statement | B | Codeforces Round 383 (Div. 2) {742} | PROGRAMMING | Test data | 1500 | |
| 11866 | Vladik and flights | constructive algorithms greedy implementation | Statement | A | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 1200 | |
| 16196 | Chloe and the sequence | binary search bitmasks constructive algorithms implementation | Statement | B | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 1200 | |
| 13611 | Vladik and fractions | brute force constructive algorithms math number theory | Statement | C | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 1500 | |
| 4784 | Chloe and pleasant prizes | dfs and similar dp graphs trees | Statement | D | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 1800 | |
| 1666 | Vladik and cards | binary search bitmasks brute force dp | Statement | E | Codeforces Round 384 (Div. 2) {743} | PROGRAMMING | Codeforces Round #384 Editorial | 2300 | |
| 9957 | Hongcow Builds A Nation | dfs and similar graphs | Statement | A | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 1500 | |
| 1972 | Hongcow's Game | bitmasks divide and conquer interactive | Statement | B | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 2000 | |
| 1378 | Hongcow Buys a Deck of Cards | bitmasks brute force dp | Statement | C | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 2500 | |
| 165 | Hongcow Draws a Circle | geometry | Statement | D | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 3000 | |
| 157 | Hongcow Masters the Cyclic Shift | strings two pointers | Statement | E | Codeforces Round 385 (Div. 1) {744} | PROGRAMMING | Codeforces Round #385 Editorial | 3100 | |
| 3902 | Hongcow Solves A Puzzle | implementation | Statement | B | Codeforces Round 385 (Div. 2) {745} | PROGRAMMING | Tutorial | 1400 | |
| 11074 | Hongcow Learns the Cyclic Shift | implementation strings | Statement | A | Codeforces Round 385 (Div. 2) {745} | PROGRAMMING | Tutorial | 900 | |
| 5405 | Green and Black Tea | constructive algorithms greedy math | Statement | D | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | Codeforces Round #386 (Div.2) Editorial | 1500 | |
| 3886 | Tram | constructive algorithms implementation math | Statement | C | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | Codeforces Round #386 (Div.2) Editorial | 1600 | |
| 1913 | Numbers Exchange | greedy implementation math | Statement | E | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | Codeforces Round #386 (Div.2) Editorial | 1800 | |
| 1673 | New Roads | constructive algorithms graphs trees | Statement | G | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | Codeforces Round #386 (Div.2) Editorial | 2100 | |
| 935 | Music in Car | data structures greedy two pointers | Statement | F | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | Codeforces Round #386 (Div.2) Editorial | 2500 | |
| 24143 | Compote | implementation math | Statement | A | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | Codeforces Round #386 (Div.2) Editorial | 800 | |
| 32416 | Decoding | implementation strings | Statement | B | Codeforces Round 386 (Div. 2) {746} | PROGRAMMING | 900 | ||
| 9757 | Mammoth's Genome Decoding | implementation strings | Statement | B | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 1000 | |
| 11334 | Display Size | brute force math | Statement | A | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 1000 | |
| 5084 | Servers | implementation | Statement | C | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 1400 | |
| 2113 | Comments | dfs and similar expression parsing implementation strings | Statement | E | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 1700 | |
| 3605 | Winter Is Coming | dp greedy sortings | Statement | D | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 1800 | |
| 525 | Igor and Interesting Numbers | brute force combinatorics dp math | Statement | F | Codeforces Round 387 (Div. 2) {747} | PROGRAMMING | 49171 | 2600 | |
| 4962 | Santa Claus and Robot | constructive algorithms math | Statement | C | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 1400 | |
| 5666 | Santa Claus and Keyboard Check | implementation strings | Statement | B | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 1500 | |
| 1679 | Santa Claus and Tangerines | binary search data structures greedy two pointers | Statement | E | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 2000 | |
| 2091 | Santa Claus and a Palindrome | constructive algorithms data structures greedy | Statement | D | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 2000 | |
| 747 | Santa Clauses and a Soccer Championship | constructive algorithms dfs and similar graphs trees | Statement | F | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 2500 | |
| 9391 | Santa Claus and a Place in a Class | implementation math | Statement | A | Technocup 2017 - Elimination Round 3 {748} | PROGRAMMING | Codeforces Round 389 (Div.2) Editorial | 900 | |
| 9017 | Parallelogram is Back | brute force constructive algorithms geometry | Statement | B | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | Tutorial | 1300 | |
| 6308 | Voting | greedy implementation two pointers | Statement | C | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | Tutorial | 1600 | |
| 2855 | Leaving Auction | binary search data structures | Statement | D | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | 2000 | ||
| 1302 | Inversions After Shuffle | data structures probabilities | Statement | E | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | Tutorial | 2600 | |
| 58386 | Bachgold Problem | greedy implementation math number theory | Statement | A | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | Tutorial | 700 | |
| 9753 | New Year and North Pole | geometry implementation | Statement | B | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 1300 | |
| 7140 | New Year and Rating | binary search greedy math | Statement | C | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 1600 | |
| 3180 | New Year and Fireworks | brute force data structures dfs and similar dp implementation | Statement | D | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 1900 | |
| 1978 | New Year and Old Subsequence | data structures divide and conquer dp matrices | Statement | E | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 2600 | |
| 657 | New Year and Finding Roots | constructive algorithms implementation interactive trees | Statement | F | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 2700 | |
| 637 | New Year and Binary Tree Paths | bitmasks brute force combinatorics dp | Statement | G | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 3100 | |
| 268 | New Year and Snowy Grid | dfs and similar dsu graphs interactive | Statement | H | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 3400 | |
| 95783 | New Year and Hurry | binary search brute force implementation math | Statement | A | Good Bye 2016 {750} | PROGRAMMING | Good Bye 2016 — hints and codes | 800 | |
| 10166 | Santa Claus and Candies | dp greedy math | Statement | A | Testing Round 13 {753} | PROGRAMMING | 1100 | ||
| 1460 | Interactive Bulls and Cows (Easy) | brute force constructive algorithms implementation | Statement | B | Testing Round 13 {753} | PROGRAMMING | 1600 | ||
| 476 | Interactive Bulls and Cows (Hard) | brute force constructive algorithms interactive | Statement | C | Testing Round 13 {753} | PROGRAMMING | 2400 | ||
| 7628 | Ilya and tic-tac-toe game | brute force implementation | Statement | B | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | Editorial | 1200 | |
| 9526 | Lesha and array splitting | constructive algorithms greedy implementation | Statement | A | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | Editorial | 1300 | |
| 2737 | Fedor and coupons | binary search data structures greedy sortings | Statement | D | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | 2000 | ||
| 1122 | Vladik and chat | brute force constructive algorithms dp implementation strings | Statement | C | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | 2200 | ||
| 623 | Dasha and cyclic table | bitmasks brute force fft strings trees | Statement | E | Codeforces Round 390 (Div. 2) {754} | PROGRAMMING | 2800 | ||
| 13107 | PolandBall and Game | binary search data structures games greedy sortings strings | Statement | B | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 1200 | |
| 15572 | PolandBall and Forest | dfs and similar dsu graphs interactive trees | Statement | C | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 1300 | |
| 2725 | PolandBall and Polygon | data structures | Statement | D | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 2000 | |
| 945 | PolandBall and White-Red graph | constructive algorithms graphs shortest paths | Statement | E | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 2400 | |
| 2032 | PolandBall and Gifts | bitmasks dp greedy | Statement | F | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 2600 | |
| 1154 | PolandBall and Many Other Balls | combinatorics divide and conquer dp fft math number theory | Statement | G | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 3100 | |
| 20259 | PolandBall and Hypothesis | brute force graphs math number theory | Statement | A | 8VC Venture Cup 2017 - Elimination Round {755} | PROGRAMMING | 8VC Venture Cup 2017 — Elimination Round [Editorial] | 900 | |
| 3242 | Pavel and barbecue | constructive algorithms dfs and similar | Statement | A | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 1600 | |
| 4613 | Travel Card | binary search dp | Statement | B | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 1700 | |
| 1519 | Nikita and stack | data structures | Statement | C | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 2300 | |
| 1167 | Bacterial Melee | brute force combinatorics dp string suffix structures | Statement | D | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 2500 | |
| 270 | Long number | expression parsing math number theory | Statement | F | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 3200 | |
| 328 | Byteland coins | combinatorics dp math | Statement | E | 8VC Venture Cup 2017 - Final Round {756} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 3200 | |
| 11926 | Gotta Catch Em' All! | implementation | Statement | A | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 1100 | |
| 11637 | Bash's Big Day | greedy math number theory | Statement | B | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 1400 | |
| 2482 | Felicity is Coming! | data structures hashing sortings strings | Statement | C | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 1900 | |
| 1580 | Felicity's Big Secret Revealed | bitmasks dp | Statement | D | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 2200 | |
| 1645 | Bash Plays with Functions | brute force combinatorics dp number theory | Statement | E | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 2400 | |
| 663 | Can Bash Save the Day? | data structures divide and conquer graphs trees | Statement | G | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 2500 | |
| 1568 | Team Rocket Rises Again | data structures graphs shortest paths | Statement | F | Codecraft-17 and Codeforces Round 391 (Div. 1 + Div. 2, combined) {757} | PROGRAMMING | CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Editorial | 2700 | |
| 10789 | Blown Garland | brute force implementation number theory | Statement | B | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 1200 | |
| 4079 | Unfair Poll | binary search constructive algorithms implementation math | Statement | C | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 1700 | |
| 2967 | Ability To Convert | constructive algorithms dp greedy math strings | Statement | D | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 1900 | |
| 762 | Geometrical Progression | brute force math number theory | Statement | F | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 2500 | |
| 643 | Broken Tree | dfs and similar dp graphs greedy trees | Statement | E | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 2900 | |
| 77511 | Holiday Of Equality | implementation math | Statement | A | Codeforces Round 392 (Div. 2) {758} | PROGRAMMING | Codeforces Round #392 (Div. 2) Editorial | 700 | |
| 7986 | Frodo and pillows | binary search greedy | Statement | B | Codeforces Round 393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition) {760} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 1500 | |
| 8707 | Petr and a calendar | implementation math | Statement | A | Codeforces Round 393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition) {760} | PROGRAMMING | 8VC Venture Cup 2017 — Final Round and Codeforces Round #393 Editorial | 900 | |
| 15250 | Dasha and Stairs | brute force constructive algorithms implementation math | Statement | A | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 1100 | |
| 7086 | Dasha and friends | brute force implementation math | Statement | B | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 1300 | |
| 6059 | Dasha and Password | brute force dp implementation | Statement | C | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 1600 | |
| 4234 | Dasha and Very Difficult Problem | binary search brute force constructive algorithms greedy sortings | Statement | D | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 1700 | |
| 2439 | Dasha and Puzzle | constructive algorithms dfs and similar graphs greedy trees | Statement | E | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 2000 | |
| 754 | Dasha and Photos | brute force data structures dp implementation | Statement | F | Codeforces Round 394 (Div. 2) {761} | PROGRAMMING | Codeforces Round #394 (Div. 2) [Editorial] | 2900 | |
| 11148 | USB vs. PS/2 | greedy implementation sortings two pointers | Statement | B | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 1400 | |
| 27177 | k-th divisor | math number theory | Statement | A | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 1500 | |
| 3082 | Two strings | binary search hashing strings two pointers | Statement | C | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2100 | |
| 1728 | Radio stations | binary search data structures | Statement | E | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2400 | |
| 1888 | Maximum path | dp greedy implementation | Statement | D | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2400 | |
| 532 | Tree nesting | combinatorics graphs trees | Statement | F | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2900 | |
| 12342 | Timofey and a tree | dfs and similar dp dsu graphs implementation trees | Statement | A | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 1600 | |
| 3126 | Timofey and rectangles | constructive algorithms geometry | Statement | B | Codeforces Round 395 (Div. 1) {763} | PROGRAMMING | Codeforces Round #395 [Editorial] | 2200 |