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 ... 21 22 23 24 25 ... 43 44 45 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6440 | AB-string | binary search combinatorics dp strings | Statement | D | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 1800 | |
| 3455 | Keyboard Purchase | bitmasks dp | Statement | E | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2200 | |
| 2059 | The Maximum Subtree | dfs and similar dp graphs trees | Statement | F | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2300 | |
| 493 | Adilbek and the Watering System | data structures greedy sortings | Statement | G | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 2700 | |
| 27996 | Prime Subtraction | math number theory | Statement | A | Educational Codeforces Round 74 (Rated for Div. 2) {1238} | PROGRAMMING | Educational Codeforces Round 74 Editorial | 900 | |
| 7790 | Ivan the Fool and the Probability Theory | combinatorics dp math | Statement | A | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 1700 | |
| 1810 | Queue in the Train | data structures greedy implementation | Statement | C | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 2300 | |
| 2594 | Catowice City | 2-sat dfs and similar graph matchings graphs | Statement | D | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 2400 | |
| 1117 | The World Is Just a Programming Task (Hard Version) | implementation | Statement | B | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 2500 | |
| 1160 | Turtle | dp implementation | Statement | E | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 3100 | |
| 316 | Swiper, no swiping! | graphs implementation | Statement | F | Codeforces Round 594 (Div. 1) {1239} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 3400 | |
| 327 | Football | graphs | Statement | F | Codeforces Round 591 (Div. 1, based on Technocup 2020 Elimination Round 1) {1240} | PROGRAMMING | Сodeforces Round 591 (Технокубок 2020 — Отборочный раунд 1) Разбор | 3100 | |
| 13262 | Tile Painting | constructive algorithms math number theory | Statement | A | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1500 | |
| 9219 | 0-1 MST | dfs and similar dsu graphs sortings | Statement | B | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 1900 | |
| 1944 | Sum Balance | bitmasks dfs and similar dp graphs | Statement | C | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 2400 | |
| 155 | Planar Perimeter | constructive algorithms graphs | Statement | E | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 3200 | |
| 234 | Number Discovery | math | Statement | D | Codeforces Round 599 (Div. 1) {1242} | PROGRAMMING | Codeforces Round #599 Editorial | 3400 | |
| 15354 | Character Swap (Easy Version) | strings | Statement | B1 | Codeforces Round 599 (Div. 2) {1243} | PROGRAMMING | Codeforces Round #599 Editorial | 1100 | |
| 7305 | Character Swap (Hard Version) | strings | Statement | B2 | Codeforces Round 599 (Div. 2) {1243} | PROGRAMMING | Codeforces Round #599 Editorial | 1600 | |
| 16364 | Maximum Square | implementation | Statement | A | Codeforces Round 599 (Div. 2) {1243} | PROGRAMMING | Codeforces Round #599 Editorial | 800 | |
| 17516 | Rooms and Staircases | brute force implementation | Statement | B | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1000 | |
| 8293 | Paint the Tree | brute force constructive algorithms dp graphs implementation trees | Statement | D | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1700 | |
| 8274 | The Football Season | brute force math number theory | Statement | C | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 1900 | |
| 6390 | Minimizing Difference | binary search constructive algorithms greedy sortings ternary search two pointers | Statement | E | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2000 | |
| 1633 | Chips | constructive algorithms implementation | Statement | F | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2300 | |
| 1520 | Running in Pairs | constructive algorithms greedy math | Statement | G | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 2500 | |
| 20060 | Pens and Pencils | math | Statement | A | Codeforces Round 592 (Div. 2) {1244} | PROGRAMMING | Codeforces Round #592 (Div. 2) Tutorial | 700 | |
| 14881 | Good ol' Numbers Coloring | math number theory | Statement | A | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1000 | |
| 14517 | Restricted RPS | constructive algorithms dp greedy | Statement | B | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1200 | |
| 19843 | Constanze's Machine | dp | Statement | C | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1400 | |
| 9557 | Shichikuji and Power Grid | dsu graphs greedy shortest paths trees | Statement | D | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 1900 | |
| 1364 | Hyakugoku and Ladders | dp probabilities shortest paths | Statement | E | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 2262 | Daniel and Spring Cleaning | bitmasks brute force combinatorics dp | Statement | F | Codeforces Round 597 (Div. 2) {1245} | PROGRAMMING | Codeforces Round #597 (Div. 2) Editorial | 2300 | |
| 205 | Cursor Distance | Statement | F | Codeforces Round 596 (Div. 1, based on Technocup 2020 Elimination Round 2) {1246} | PROGRAMMING | Tutorial | 3400 | ||
| 2521 | The World Is Just a Programming Task (Easy Version) | brute force dp greedy implementation | Statement | D1 | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 1900 | |
| 15046 | Integer Points | geometry math | Statement | A | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 900 | |
| 18001 | Grow The Tree | greedy math sortings | Statement | B | Codeforces Round 594 (Div. 2) {1248} | PROGRAMMING | Editorial of Codeforces Round #594 (on the problems of Moscow Team Olympiad) | 900 | |
| 22264 | Books Exchange (easy version) | dsu math | Statement | B1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1000 | |
| 16542 | Good Numbers (easy version) | brute force greedy implementation | Statement | C1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1300 | |
| 18371 | Books Exchange (hard version) | dfs and similar dsu math | Statement | B2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1300 | |
| 13521 | Good Numbers (hard version) | binary search greedy math meet-in-the-middle | Statement | C2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1500 | |
| 10963 | By Elevator or Stairs? | dp shortest paths | Statement | E | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1700 | |
| 5496 | Too Many Segments (easy version) | greedy | Statement | D1 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 1900 | |
| 5763 | Too Many Segments (hard version) | data structures greedy sortings | Statement | D2 | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 2000 | |
| 2735 | Maximum Weight Subset | dp trees | Statement | F | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 2500 | |
| 23689 | Yet Another Dividing into Teams | math | Statement | A | Codeforces Round 595 (Div. 3) {1249} | PROGRAMMING | Codeforces Round #595 (Div. 3) Editorial | 900 | |
| 8377 | Data Center | brute force implementation | Statement | F | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1000 | ||
| 4411 | Berstagram | implementation | Statement | A | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1400 | ||
| 4290 | Happy Birthday | math | Statement | H | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1500 | ||
| 4684 | Divide The Students | binary search greedy math | Statement | L | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1700 | ||
| 3243 | The Parade | binary search greedy | Statement | J | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1900 | ||
| 2798 | The Feast and the Bus | brute force constructive algorithms greedy math | Statement | B | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 1900 | ||
| 1752 | Wires | dfs and similar graphs greedy | Statement | N | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2200 | ||
| 1444 | Trip to Saint Petersburg | data structures | Statement | C | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2300 | ||
| 774 | Discarding Game | dp greedy two pointers | Statement | G | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2400 | ||
| 906 | The Coronation | graphs implementation | Statement | E | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2500 | ||
| 391 | SmartGarden | constructive algorithms divide and conquer | Statement | M | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 2700 | ||
| 171 | Show Must Go On | binary search brute force greedy shortest paths | Statement | I | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3100 | ||
| 216 | Conference Problem | dp | Statement | D | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3100 | ||
| 318 | Projectors | flows graphs | Statement | K | 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1250} | PROGRAMMING | 3200 | ||
| 21542 | Broken Keyboard | brute force strings two pointers | Statement | A | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1000 | |
| 11613 | Binary Palindromes | greedy strings | Statement | B | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1400 | |
| 14315 | Minimize The Integer | greedy two pointers | Statement | C | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1500 | |
| 6459 | Salary Changing | binary search greedy sortings | Statement | D | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 1800 | |
| 2585 | Voting (Easy Version) | data structures dp greedy | Statement | E1 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2200 | |
| 2948 | Voting (Hard Version) | binary search data structures greedy | Statement | E2 | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2300 | |
| 976 | Red-White Fence | combinatorics fft | Statement | F | Educational Codeforces Round 75 (Rated for Div. 2) {1251} | PROGRAMMING | 70860 | 2600 | |
| 5997 | Copying Homework | Statement | A | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 1000 | ||
| 3981 | Even Path | data structures implementation | Statement | C | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 1600 | |
| 2846 | Twin Buildings | greedy implementation | Statement | H | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 1900 | |
| 2061 | Addition Robot | data structures math matrices | Statement | K | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2200 | |
| 1359 | Songwriter | greedy two pointers | Statement | E | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2300 | |
| 1552 | Performance Review | data structures | Statement | G | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2300 | |
| 1069 | Regular Forestation | hashing trees | Statement | F | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2500 | |
| 783 | Tiling Terrace | brute force dp | Statement | J | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 642 | Road Construction | flows graphs | Statement | L | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 585 | Cleaning Robots | dp trees | Statement | B | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2600 | |
| 410 | Find String in a Grid | data structures dp strings trees | Statement | D | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 2900 | |
| 34 | Mission Possible | Statement | I | 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} | PROGRAMMING | T | 3200 | ||
| 19412 | Single Push | implementation | Statement | A | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1000 | |
| 11703 | Silly Mistake | greedy implementation | Statement | B | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1400 | |
| 15288 | Sweets Eating | dp greedy math sortings | Statement | C | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1500 | |
| 10231 | Harmonious Graph | constructive algorithms dfs and similar dsu graphs greedy sortings | Statement | D | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 1700 | |
| 3060 | Antenna Coverage | data structures dp greedy sortings | Statement | E | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2200 | |
| 2249 | Cheap Robot | binary search dsu graphs shortest paths trees | Statement | F | Codeforces Round 600 (Div. 2) {1253} | PROGRAMMING | Editorial | 2600 | |
| 5513 | Feeding Chicken | constructive algorithms greedy implementation | Statement | A | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 1900 | |
| 5004 | Send Boxes to Alice (Easy Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B1 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2000 | |
| 3416 | Send Boxes to Alice (Hard Version) | constructive algorithms greedy math number theory ternary search two pointers | Statement | B2 | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2100 | |
| 1593 | Point Ordering | constructive algorithms geometry interactive math | Statement | C | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2300 | |
| 1528 | Tree Queries | data structures probabilities trees | Statement | D | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 2600 | |
| 363 | Send Tree to Charlie | combinatorics dfs and similar dsu trees | Statement | E | Codeforces Round 601 (Div. 1) {1254} | PROGRAMMING | Codeforces Round #601 Editorial | 3200 | |
| 12516 | Fridge Lockers | graphs implementation | Statement | B | Codeforces Round 601 (Div. 2) {1255} | PROGRAMMING | Codeforces Round #601 Editorial | 1200 | |
| 7217 | League of Leesins | constructive algorithms implementation | Statement | C | Codeforces Round 601 (Div. 2) {1255} | PROGRAMMING | Codeforces Round #601 Editorial | 1600 | |
| 17981 | Changing Volume | math | Statement | A | Codeforces Round 601 (Div. 2) {1255} | PROGRAMMING | Codeforces Round #601 Editorial | 800 | |
| 32397 | Payment Without Change | math | Statement | A | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1000 | |
| 13676 | Minimize the Permutation | greedy | Statement | B | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1400 | |
| 12744 | Binary String Minimizing | greedy | Statement | D | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1500 | |
| 7316 | Platforms Jumping | greedy | Statement | C | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 1700 | |
| 4595 | Yet Another Division Into Teams | dp greedy sortings | Statement | E | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 2200 | |
| 3621 | Equalizing Two Strings | constructive algorithms sortings strings | Statement | F | Codeforces Round 598 (Div. 3) {1256} | PROGRAMMING | Codeforces Round #598 (Div. 3) Editorial | 2200 | |
| 22507 | Magic Stick | math | Statement | B | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1000 | |
| 17129 | Dominated Subarray | greedy implementation sortings strings two pointers | Statement | C | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1200 | |
| 8150 | Yet Another Monster Killing Problem | binary search data structures dp greedy sortings two pointers | Statement | D | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 1700 | |
| 4527 | The Contest | data structures dp greedy | Statement | E | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2000 | |
| 2308 | Make Them Similar | bitmasks brute force hashing meet-in-the-middle | Statement | F | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2400 | |
| 732 | Divisor Set | divide and conquer fft greedy math number theory | Statement | G | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 2700 | |
| 21658 | Two Rival Students | greedy math | Statement | A | Educational Codeforces Round 76 (Rated for Div. 2) {1257} | PROGRAMMING | Educational Codeforces Round 76 Editorial | 700 | |
| 15808 | Heating | math | Statement | A | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1000 | |
| 16696 | Obtain Two Zeroes | binary search math | Statement | B | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1200 | |
| 8777 | Infinite Fence | greedy math number theory | Statement | C | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1700 | |
| 4182 | A Game with Traps | binary search dp greedy sortings | Statement | D | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 1900 | |
| 1890 | Tournament | brute force dp greedy | Statement | E | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 2400 | |
| 631 | Colored Tree | data structures trees | Statement | F | Educational Codeforces Round 77 (Rated for Div. 2) {1260} | PROGRAMMING | Educational Codeforces Round 77 Editorial | 2700 | |
| 442 | Xor-Set | bitmasks divide and conquer math | Statement | F | Codeforces Round 602 (Div. 1, based on Technocup 2020 Elimination Round 3) {1261} | PROGRAMMING | Tutorial | 3100 | |
| 17217 | Sweet Problem | math | Statement | A | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1200 | |
| 11810 | PIN Codes | greedy implementation | Statement | B | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1400 | |
| 14655 | Everyone is a Winner! | binary search math meet-in-the-middle number theory | Statement | C | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 1400 | |
| 15981 | Secret Passwords | dfs and similar dsu graphs | Statement | D | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Codeforces Round #603 (Div. 2) Editorial | 1500 | |
| 2969 | Editor | data structures implementation | Statement | E | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 2000 | |
| 949 | Economic Difficulties | data structures dfs and similar dp flows graphs trees | Statement | F | Codeforces Round 603 (Div. 2) {1263} | PROGRAMMING | Разбор Codeforces Round #603 (Div. 2) | 2500 | |
| 10438 | Beautiful Regional Contest | greedy implementation | Statement | A | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 1500 | |
| 6045 | Beautiful Sequence | brute force constructive algorithms greedy | Statement | B | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 1900 | |
| 1320 | Beautiful Mirrors with queries | data structures probabilities | Statement | C | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2400 | |
| 1524 | Beautiful Bracket Sequence (easy version) | combinatorics dp probabilities | Statement | D1 | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2600 | |
| 927 | Beautiful League | constructive algorithms flows graph matchings | Statement | E | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 2700 | |
| 1314 | Beautiful Bracket Sequence (hard version) | combinatorics probabilities | Statement | D2 | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 3000 | |
| 1095 | Beautiful Fibonacci Problem | constructive algorithms number theory | Statement | F | Codeforces Round 604 (Div. 1) {1264} | PROGRAMMING | 71995 | 3600 | |
| 15932 | Beautiful String | constructive algorithms greedy | Statement | A | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 1000 | |
| 13518 | Beautiful Numbers | data structures implementation math two pointers | Statement | B | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 1300 | |
| 4500 | Beautiful Mirrors | data structures dp math probabilities | Statement | E | Codeforces Round 604 (Div. 2) {1265} | PROGRAMMING | Codeforces Round #604 Editorial | 2100 | |
| 16563 | Dice Tower | constructive algorithms math | Statement | B | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1000 | |
| 17489 | Competitive Programmer | chinese remainder theorem math | Statement | A | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1000 | |
| 10056 | Diverse Matrix | constructive algorithms greedy math number theory | Statement | C | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 1400 | |
| 3868 | Decreasing Debts | constructive algorithms data structures graphs greedy implementation math two pointers | Statement | D | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2000 | |
| 2348 | Spaceship Solitaire | data structures greedy implementation | Statement | E | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2100 | |
| 377 | Almost Same Distance | dfs and similar graphs | Statement | F | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 2900 | |
| 139 | Permutation Concatenation | string suffix structures | Statement | G | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 3300 | |
| 132 | Red-Blue Graph | dp graphs math matrices meet-in-the-middle | Statement | H | Codeforces Global Round 6 {1266} | PROGRAMMING | Codeforces Global Round 6 Editorial | 3400 | |
| 4537 | Balls of Buma | Statement | B | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1300 | ||
| 3504 | Elections | greedy | Statement | E | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1700 | |
| 3351 | Lexicography | constructive algorithms strings | Statement | L | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1800 | |
| 3056 | Just Arrange the Icons | greedy implementation math | Statement | J | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 1900 | |
| 2142 | Key Storage | combinatorics math | Statement | K | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 2200 | |
| 1061 | Apprentice Learning Trajectory | Statement | A | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | 2500 | |||
| 1068 | Intriguing Selection | brute force constructive algorithms implementation interactive sortings | Statement | I | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 2700 | |
| 720 | Foolprüf Security | graphs | Statement | F | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | 2800 | ||
| 825 | Game Relics | math probabilities | Statement | G | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 3100 | |
| 261 | DevOps Best Practices | constructive algorithms | Statement | D | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 3200 | |
| 391 | Cactus Revenge | constructive algorithms | Statement | C | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | 3400 | ||
| 228 | Help BerLine | constructive algorithms | Statement | H | 2019-2020 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1267} | PROGRAMMING | nerc-2019-tutorial.pdf | 3500 | |
| 9065 | Long Beautiful Integer | constructive algorithms greedy implementation strings | Statement | A | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 1700 | |
| 6424 | Domino for Young | dp greedy math | Statement | B | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 2000 | |
| 1951 | K Integers | binary search data structures | Statement | C | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 2300 | |
| 637 | Invertation in Tournament | brute force divide and conquer graphs math | Statement | D | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 3100 | |
| 295 | Happy Cactus | dp | Statement | E | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 3400 | |
| 9614 | Modulo Equality | brute force sortings | Statement | B | Codeforces Round 609 (Div. 2) {1269} | PROGRAMMING | Codeforces Round #609 — Editorial | 1500 | |
| 23982 | Equation | brute force math | Statement | A | Codeforces Round 609 (Div. 2) {1269} | PROGRAMMING | Codeforces Round #609 — Editorial | 800 | |
| 17349 | Interesting Subarray | constructive algorithms greedy math | Statement | B | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1300 | |
| 15031 | Make Good | bitmasks constructive algorithms math | Statement | C | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1500 | |
| 4867 | Strange Device | constructive algorithms interactive math sortings | Statement | D | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 1900 | |
| 2736 | Divide Points | constructive algorithms geometry math | Statement | E | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 2300 | |
| 1336 | Awesome Substrings | math strings | Statement | F | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 2600 | |
| 2951 | Subset with Zero Sum | constructive algorithms dfs and similar graphs math | Statement | G | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 2700 | |
| 1000 | Number of Components | data structures | Statement | H | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 3200 | |
| 316 | Xor on Figures | constructive algorithms fft math | Statement | I | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 3400 | |
| 17810 | Card Game | games greedy math | Statement | A | Good Bye 2019 {1270} | PROGRAMMING | Разбор Goodbye 2019 | 700 | |
| 11059 | Shawarma Tent | brute force geometry greedy implementation | Statement | C | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 1300 | |
| 12093 | Blocks | greedy math | Statement | B | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 1300 | |
| 3397 | Portals | data structures dp greedy implementation sortings | Statement | D | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 3708 | Common Number | binary search combinatorics dp math | Statement | E | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 2100 | |
| 260 | Divide The Students | brute force | Statement | F | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 3000 | |
| 15666 | Suits | brute force greedy math | Statement | A | Codeforces Round 608 (Div. 2) {1271} | PROGRAMMING | 72247 | 900 | |
| 30689 | Yet Another Broken Keyboard | combinatorics dp implementation | Statement | C | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1100 | |
| 14674 | Snow Walking Robot | constructive algorithms greedy implementation | Statement | B | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1200 | |
| 19247 | Remove One Element | brute force dp | Statement | D | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 1500 | |
| 7879 | Nearest Opposite Parity | dfs and similar graphs shortest paths | Statement | E | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 2000 | |
| 2327 | Two Bracket Sequences | dp strings two pointers | Statement | F | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 2400 | |
| 22058 | Three Friends | brute force greedy math sortings | Statement | A | Codeforces Round 605 (Div. 3) {1272} | PROGRAMMING | Codeforces Round #605 (Div. 3) Editorial | 900 | |
| 92 | Шардирование постов | *special binary search interactive | Statement | F | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 3000.0 | ||
| 891 | Скрытый друг | *special | Statement | A | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 250.0 | ||
| 61 | Контрольная сумма | *special | Statement | E3 | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 1000.0 | ||
| 138 | Контрольная сумма | *special | Statement | E2 | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 1000.0 | ||
| 265 | Контрольная сумма | *special | Statement | E1 | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 1000.0 | ||
| 422 | Storage2 | *special | Statement | D | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 2000.0 | ||
| 698 | #define Задача B ... | *special | Statement | C | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 1000.0 | ||
| 844 | Code Review | *special | Statement | B | VK Cup 2019 - Квалификация (Engine) {1275} | PROGRAMMING | 250.0 | ||
| 12943 | As Simple as One and Two | dp greedy | Statement | A | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1300 | |
| 5653 | Two Fairs | combinatorics dfs and similar dsu graphs | Statement | B | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1900 | |
| 1788 | Beautiful Rectangle | brute force combinatorics constructive algorithms data structures greedy math | Statement | C | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2300 | |
| 671 | Tree Elimination | dp trees | Statement | D | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 2600 | |
| 445 | Asterisk Substrings | string suffix structures | Statement | F | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 3300 | |
| 121 | Four Stones | constructive algorithms | Statement | E | Codeforces Round 606 (Div. 1, based on Technocup 2020 Elimination Round 4) {1276} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 3400 | |
| 14469 | Happy Birthday, Polycarp! | implementation | Statement | A | Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) {1277} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1000 | |
| 16990 | Make Them Odd | greedy number theory | Statement | B | Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) {1277} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1200 | |
| 3275 | Let's Play the Words? | data structures hashing implementation math | Statement | D | Codeforces Round 606 (Div. 2, based on Technocup 2020 Elimination Round 4) {1277} | PROGRAMMING | Technocup 2020 — Elimination Round 4 + Codeforces Round 606: Editorial | 1800 | |
| 18276 | Shuffle Hashing | brute force implementation strings | Statement | A | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1000 | |
| 14162 | A and B | greedy math | Statement | B | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1500 | |
| 8575 | Berry Jam | data structures dp greedy implementation | Statement | C | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 1600 | |
| 4324 | Segment Tree | data structures dsu graphs trees | Statement | D | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2100 | |
| 2041 | Tests for problem D | constructive algorithms dfs and similar divide and conquer trees | Statement | E | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2200 | |
| 2482 | Cards | combinatorics dp math number theory probabilities | Statement | F | Educational Codeforces Round 78 (Rated for Div. 2) {1278} | PROGRAMMING | Educational Codeforces Round 78 Editorial | 2600 | |
| 17775 | New Year Garland | math | Statement | A | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1000 | |
| 14400 | Verse For Santa | binary search brute force implementation | Statement | B | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1300 | |
| 12426 | Stack of Presents | data structures implementation | Statement | C | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1400 | |
| 7259 | Santa's Bot | combinatorics math probabilities | Statement | D | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 1700 | |
| 455 | New Year Permutations | combinatorics dp | Statement | E | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 2700 | |
| 1214 | New Year and Handle Change | binary search dp | Statement | F | Educational Codeforces Round 79 (Rated for Div. 2) {1279} | PROGRAMMING | Educational Codeforces Round 79 Editorial | 2800 | |
| 5835 | Cut and Paste | implementation math | Statement | A | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 1700 | |
| 4203 | Beingawesomeism | implementation math | Statement | B | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 1800 | |
| 3038 | Jeremy Bearimy | dfs and similar graphs greedy trees | Statement | C | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2000 | |
| 1229 | Miss Punyverse | dp greedy trees | Statement | D | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2700 | |
| 229 | Kirchhoff's Current Loss | math | Statement | E | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 2900 | |
| 107 | Intergalactic Sliding Puzzle | combinatorics constructive algorithms math | Statement | F | Codeforces Round 607 (Div. 1) {1280} | PROGRAMMING | Codeforces Round #607 Editorial | 3400 | |
| 8685 | Azamon Web Services | greedy | Statement | B | Codeforces Round 607 (Div. 2) {1281} | PROGRAMMING | Codeforces Round #607 Editorial | 1500 | |
| 18914 | Suffix Three | implementation | Statement | A | Codeforces Round 607 (Div. 2) {1281} | PROGRAMMING | Codeforces Round #607 Editorial | 600 | |
| 12144 | K for the Price of One (Easy Version) | dp greedy sortings | Statement | B1 | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1400 | |
| 11002 | K for the Price of One (Hard Version) | dp greedy sortings | Statement | B2 | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1600 | |
| 4579 | Petya and Exam | greedy sortings two pointers | Statement | C | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 1800 | |
| 2371 | Enchanted Artifact | constructive algorithms interactive strings | Statement | D | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 2300 | |
| 1220 | The Cake Is a Lie | constructive algorithms data structures dfs and similar graphs | Statement | E | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 2400 | |
| 15494 | Temporarily unavailable | implementation math | Statement | A | Codeforces Round 610 (Div. 2) {1282} | PROGRAMMING | 72461 | 900 | |
| 23069 | Candies Division | math | Statement | B | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1000 | |
| 14145 | Friends and Gifts | constructive algorithms data structures math | Statement | C | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1500 | |
| 7297 | New Year Parties | dp greedy | Statement | E | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 | |
| 9426 | Christmas Trees | graphs greedy shortest paths | Statement | D | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 1800 | |
| 2035 | DIY Garland | constructive algorithms greedy trees | Statement | F | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 2400 | |
| 61150 | Minutes Before the New Year | math | Statement | A | Codeforces Round 611 (Div. 3) {1283} | PROGRAMMING | Codeforces Round #611 (Div. 3) Editorial | 800 | |
| 11449 | New Year and Ascent Sequence | binary search combinatorics data structures dp implementation sortings | Statement | B | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 1500 | |
| 8728 | New Year and Permutation | combinatorics math | Statement | C | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 1700 | |
| 3394 | New Year and Conference | binary search data structures hashing sortings | Statement | D | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 2100 | |
| 1377 | New Year and Castle Construction | combinatorics geometry math sortings | Statement | E | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 2500 | |
| 412 | New Year and Social Network | data structures graph matchings graphs math trees | Statement | F | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 3100 | |
| 228 | Seollal | graphs | Statement | G | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 3300 | |
| 18584 | New Year and Naming | implementation strings | Statement | A | Hello 2020 {1284} | PROGRAMMING | Hello 2020 Editorial | 600 | |
| 30714 | Just Eat It! | dp greedy implementation | Statement | B | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1300 | |
| 28056 | Fadi and LCM | brute force math number theory | Statement | C | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1400 | |
| 8594 | Dr. Evil Underscores | bitmasks brute force dfs and similar divide and conquer dp greedy strings trees | Statement | D | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 1800 | |
| 2000 | Delete a Segment | brute force constructive algorithms data structures dp graphs sortings trees two pointers | Statement | E | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2300 | |
| 1341 | Classical? | binary search combinatorics number theory | Statement | F | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 2800 | |
| 29869 | Mezo Playing Zoma | math | Statement | A | Codeforces Round 613 (Div. 2) {1285} | PROGRAMMING | Codeforces Round #613 (Div. 2) Editorial | 700 | |
| 9632 | Garland | dp greedy sortings | Statement | A | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 1700 | |
| 5462 | Numbers on Tree | constructive algorithms data structures dfs and similar graphs greedy trees | Statement | B | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2000 | |
| 1578 | Madhouse (Easy version) | brute force constructive algorithms interactive math | Statement | C1 | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2400 | |
| 745 | Madhouse (Hard version) | brute force constructive algorithms hashing interactive math | Statement | C2 | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2900 | |
| 728 | LCC | data structures math matrices probabilities | Statement | D | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 2900 | |
| 294 | Harry The Potter | brute force constructive algorithms dp fft implementation math | Statement | F | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 3200 | |
| 659 | Fedya the Potter Strikes Back | data structures strings | Statement | E | Codeforces Round 612 (Div. 1) {1286} | PROGRAMMING | Codeforces Round #612 - Editorial | 3200 | |
| 9783 | Hyperset | brute force data structures implementation | Statement | B | Codeforces Round 612 (Div. 2) {1287} | PROGRAMMING | Codeforces Round #612 - Editorial | 1500 | |
| 22004 | Angry Students | greedy implementation | Statement | A | Codeforces Round 612 (Div. 2) {1287} | PROGRAMMING | Codeforces Round #612 - Editorial | 800 | |
| 17771 | Yet Another Meme Problem | math | Statement | B | Educational Codeforces Round 80 (Rated for Div. 2) {1288} | PROGRAMMING | Educational Codeforces Round 80 Editorial | 1100 |