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 ... 15 16 17 18 19 ... 44 45 46 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2055 | Add Points | Statement | B | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1800 | ||
| 812 | A Vital Problem | Statement | I | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 1900 | ||
| 1082 | Merge Equal Elements | Statement | E | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 2100 | ||
| 295 | Endless Roses Most Beautiful | Statement | H | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 2300 | ||
| 345 | Mobile Communications | Statement | F | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 2400 | ||
| 697 | Segments | data structures | Statement | J | VK Cup 2018 - Wild-card Round 1 {926} | PROGRAMMING | Разбор VK Cup 2018 — Уайлд-кард Раунд 1 | 2500 | |
| 1 | BuberPool Taxi Optimization | Statement | A | VK Cup 2018 - Wild-card Round 2 {927} | PROGRAMMING | 2800 | |||
| 3633 | Login Verification | *special strings | Statement | A | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 1600 | ||
| 2658 | Chat | *special dp | Statement | B | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 1800 | ||
| 908 | Dependency management | *special graphs implementation | Statement | C | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 2300 | ||
| 834 | Autocompletion | *special strings trees | Statement | D | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 2400 | ||
| 2563 | Прокат велосипедов | *special greedy implementation | Statement | A | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | Разбор VK Cup 2018 — Квалификация 2 | 1600 | |
| 2092 | Места в самолёте | *special implementation | Statement | B | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | Разбор VK Cup 2018 — Квалификация 2 | 1700 | |
| 1205 | Красивая команда | *special combinatorics math | Statement | C | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | Разбор VK Cup 2018 — Квалификация 2 | 2000 | |
| 172 | Пограничные врата | Statement | D | VK Cup 2018 - Квалификация 2 {929} | PROGRAMMING | Разбор VK Cup 2018 — Квалификация 2 | 2600 | ||
| 8647 | Peculiar apple-tree | dfs and similar graphs trees | Statement | A | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 1500 | |
| 3213 | Game with String | implementation probabilities strings | Statement | B | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 1800 | |
| 2403 | Teodor is not a liar! | data structures dp | Statement | C | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 2100 | |
| 466 | Game with Tokens | data structures games implementation | Statement | D | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 2600 | |
| 567 | Coins Exhibition | data structures dp math | Statement | E | Codeforces Round 468 (Div. 1, based on Technocup 2018 Final Round) {930} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 2700 | |
| 7553 | World Cup | constructive algorithms implementation | Statement | B | Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round) {931} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 1200 | |
| 3543 | Laboratory Work | implementation math | Statement | C | Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round) {931} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 1700 | |
| 13184 | Friends Meeting | brute force greedy implementation math | Statement | A | Codeforces Round 468 (Div. 2, based on Technocup 2018 Final Round) {931} | PROGRAMMING | Codeforces Round #468 and Technocup 2018 Final Round Analysis | 800 | |
| 9483 | Recursive Queries | binary search data structures dfs and similar | Statement | B | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 1300 | |
| 4262 | Permutation Cycle | brute force constructive algorithms | Statement | C | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 1600 | |
| 2087 | Tree | binary search dp trees | Statement | D | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2200 | |
| 3646 | Team Work | combinatorics dp math | Statement | E | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2400 | |
| 4395 | Escape Through Leaf | data structures dp geometry | Statement | F | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2700 | |
| 1259 | Palindrome Partition | dp string suffix structures strings | Statement | G | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2900 | |
| 10960 | Palindromic Supersequence | constructive algorithms | Statement | A | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 800 | |
| 5504 | A Twisty Movement | dp | Statement | A | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 57763 | 1800 | |
| 2090 | A Determined Cleanup | math | Statement | B | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 57763 | 2100 | |
| 692 | A Colourful Prospect | geometry graphs | Statement | C | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 57763 | 2400 | |
| 403 | A Creative Cutout | brute force combinatorics math | Statement | D | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 57763 | 2900 | |
| 329 | A Preponderant Reunion | constructive algorithms dp | Statement | E | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 57763 | 3100 | |
| 9267 | A Prosperous Lot | constructive algorithms implementation | Statement | B | Codeforces Round 462 (Div. 2) {934} | PROGRAMMING | 57763 | 1200 | |
| 7671 | A Compatible Pair | brute force games | Statement | A | Codeforces Round 462 (Div. 2) {934} | PROGRAMMING | 57763 | 1400 | |
| 12563 | Fafa and the Gates | implementation | Statement | B | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | 1000 | ||
| 5051 | Fifa and Fafa | geometry | Statement | C | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 1700 | |
| 2884 | Fafa and Ancient Alphabet | math probabilities | Statement | D | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | 1900 | ||
| 1010 | Fafa and Ancient Mathematics | dfs and similar dp trees | Statement | E | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2500 | |
| 515 | Fafa and Array | data structures greedy | Statement | F | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2800 | |
| 48001 | Fafa and his Company | brute force implementation | Statement | A | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 600 | |
| 4692 | Save Energy! | binary search implementation math | Statement | A | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 1700 | |
| 3504 | Sleepy Game | dfs and similar dp games graphs | Statement | B | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 2100 | |
| 1291 | Lock Puzzle | constructive algorithms implementation strings | Statement | C | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 2500 | |
| 404 | World of Tank | dp greedy | Statement | D | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3000 | |
| 262 | Iqea | data structures dfs and similar divide and conquer dsu shortest paths trees | Statement | E | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3300 | |
| 7316 | Vile Grasshoppers | brute force math number theory | Statement | B | Codeforces Round 467 (Div. 2) {937} | PROGRAMMING | Codeforces Round #467, Editorial | 1500 | |
| 16702 | Olympiad | implementation sortings | Statement | A | Codeforces Round 467 (Div. 2) {937} | PROGRAMMING | Codeforces Round #467, Editorial | 800 | |
| 9383 | Run For Your Prize | brute force greedy | Statement | B | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 1100 | |
| 3495 | Constructing Tests | binary search brute force constructive algorithms | Statement | C | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 1700 | |
| 7513 | Buy a Ticket | data structures graphs shortest paths | Statement | D | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2000 | |
| 1612 | Max History | combinatorics math | Statement | E | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2300 | |
| 680 | Erasing Substrings | bitmasks dp greedy | Statement | F | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2600 | |
| 1260 | Shortest Path Queries | bitmasks data structures dsu graphs | Statement | G | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2900 | |
| 12163 | Word Correction | implementation | Statement | A | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 900 | |
| 11386 | Hamster Farm | implementation | Statement | B | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1100 | |
| 8361 | Love Rescue | dfs and similar dsu graphs greedy strings | Statement | D | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1600 | |
| 4968 | Convenient For Everybody | binary search two pointers | Statement | C | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1600 | |
| 3574 | Maximize! | binary search greedy ternary search two pointers | Statement | E | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 1900 | |
| 1278 | Cutlet | data structures dp | Statement | F | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 2700 | |
| 30632 | Love Triangle | graphs | Statement | A | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 800 | |
| 8864 | Points on the line | brute force greedy sortings | Statement | A | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1300 | |
| 9609 | Our Tanya is Crying Out Loud | dp greedy | Statement | B | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1400 | |
| 6795 | Phone Numbers | constructive algorithms implementation strings | Statement | C | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1500 | |
| 3792 | Alena And The Heater | binary search implementation | Statement | D | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1600 | |
| 4548 | Cashback | data structures dp greedy math | Statement | E | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 2000 | |
| 3647 | Machine Learning | brute force data structures | Statement | F | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 2600 | |
| 11553 | Weird Subtraction Process | math number theory | Statement | B | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 1200 | |
| 9513 | String Transformation | greedy strings | Statement | C | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 1300 | |
| 4980 | Timetable | dp | Statement | D | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 1800 | |
| 1268 | Largest Beautiful Number | greedy implementation | Statement | E | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2200 | |
| 677 | Fibonacci String Subsequences | combinatorics dp matrices | Statement | F | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2500 | |
| 841 | Almost Increasing Array | data structures dp | Statement | G | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2600 | |
| 18431 | Partition | greedy | Statement | A | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 800 | |
| 15641 | Protect Sheep | brute force dfs and similar graphs implementation | Statement | A | Codeforces Round 470 (rated, Div. 2, based on VK Cup 2018 Round 1) {948} | PROGRAMMING | VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial | 1000 | |
| 5722 | Zebras | greedy | Statement | A | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 58291 | 1600 | |
| 3848 | A Leapfrog in the Array | constructive algorithms math | Statement | B | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 58291 | 1700 | |
| 2357 | Data Center Maintenance | dfs and similar graphs | Statement | C | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 58291 | 2000 | |
| 922 | Curfew | binary search brute force greedy sortings | Statement | D | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 58291 | 2400 | |
| 798 | Binary Cards | brute force | Statement | E | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 58291 | 2700 | |
| 64 | Astronomy | geometry probabilities | Statement | F | Codeforces Round 469 (Div. 1) {949} | PROGRAMMING | 58291 | 3200 | |
| 8044 | Intercepted Message | greedy implementation | Statement | B | Codeforces Round 469 (Div. 2) {950} | PROGRAMMING | 58291 | 1100 | |
| 16518 | Left-handers, Right-handers and Ambidexters | implementation math | Statement | A | Codeforces Round 469 (Div. 2) {950} | PROGRAMMING | 58291 | 900 | |
| 3080 | Ravioli Sort | implementation | Statement | C | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 1600 | |
| 2135 | A Map of the Cat | brute force | Statement | B | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 1800 | |
| 2590 | I'm Feeling Lucky! | probabilities | Statement | D | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 2000 | |
| 703 | Cheese Board | Statement | E | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 2200 | ||
| 263 | Puzzling Language | constructive algorithms | Statement | G | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 2500 | |
| 437 | 2 + 2 != 4 | Statement | F | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 2700 | ||
| 12096 | Quirky Quantifiers | math | Statement | A | April Fools Contest 2018 {952} | PROGRAMMING | April Fools Day Contest 2018: editorial | 800 | |
| 7894 | String Typing | implementation strings | Statement | B | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 1400 | |
| 8160 | Fight Against Traffic | dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 1600 | |
| 3982 | Matrix Walk | implementation | Statement | C | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 1700 | |
| 2156 | Water Taps | binary search greedy sortings | Statement | E | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2000 | |
| 2458 | Castle Defense | binary search data structures greedy two pointers | Statement | G | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2100 | |
| 1443 | Runner's Problem | dp matrices sortings | Statement | F | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2300 | |
| 836 | Path Counting | combinatorics dp | Statement | H | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2500 | |
| 1433 | Yet Another String Matching Problem | fft math | Statement | I | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2600 | |
| 11150 | Diagonal Walking | implementation | Statement | A | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 900 | |
| 7065 | Feed the cat | greedy math | Statement | A | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 1100 | |
| 5215 | Not simply beatiful strings | implementation | Statement | B | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 1400 | |
| 2948 | Sad powers | binary search math number theory | Statement | C | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2100 | |
| 620 | Scissors | brute force strings | Statement | D | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2700 | |
| 2010 | Heaps | dp trees | Statement | F | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2800 | |
| 174 | Icicles | Statement | E | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | 2900 | |||
| 6039 | Tritonic Iridescence | implementation | Statement | A | Codeforces Round 472 (rated, Div. 2, based on VK Cup 2018 Round 2) {957} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1300 | |
| 3978 | Maximum Control (easy) | implementation | Statement | B1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1100 | |
| 3220 | Encryption (easy) | brute force | Statement | C1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1400 | |
| 2246 | Hyperspace Jump (easy) | expression parsing math | Statement | D1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1500 | |
| 1868 | Death Stars (easy) | implementation | Statement | A1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1600 | |
| 1836 | Lightsabers (easy) | implementation | Statement | F1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1700 | |
| 1795 | Guard Duty (easy) | brute force geometry greedy math | Statement | E1 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1800 | |
| 1460 | Lightsabers (medium) | binary search two pointers | Statement | F2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 1900 | |
| 1422 | Encryption (medium) | dp | Statement | C2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2100 | |
| 1098 | Death Stars (medium) | hashing strings | Statement | A2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2100 | |
| 1220 | Guard Duty (medium) | binary search dp greedy sortings | Statement | E2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2300 | |
| 768 | Maximum Control (medium) | data structures dfs and similar graphs greedy trees | Statement | B2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2400 | |
| 996 | Lightsabers (hard) | fft | Statement | F3 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2600 | |
| 787 | Encryption (hard) | data structures dp | Statement | C3 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2600 | |
| 247 | Guard Duty (hard) | geometry | Statement | E3 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2800 | |
| 142 | Hyperspace Jump (hard) | Statement | D2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 3000 | ||
| 150 | Death Stars (hard) | Statement | A3 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 3100 | ||
| 10714 | Mahmoud and Ehab and the message | dsu greedy implementation | Statement | B | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 1300 | |
| 6343 | Mahmoud and Ehab and the wrong algorithm | constructive algorithms trees | Statement | C | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 1500 | |
| 3841 | Mahmoud and Ehab and the xor-MST | bitmasks dp graphs implementation math | Statement | E | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 1900 | |
| 3320 | Mahmoud and Ehab and another array construction task | constructive algorithms greedy math number theory | Statement | D | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 2000 | |
| 2998 | Mahmoud and Ehab and yet another xor task | bitmasks dp math matrices | Statement | F | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 2600 | |
| 56891 | Mahmoud and Ehab and the even-odd game | games math | Statement | A | Codeforces Round 473 (Div. 2) {959} | PROGRAMMING | Codeforces round #473 editorial | 600 | |
| 8922 | Check the string | implementation | Statement | A | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 1200 | |
| 13405 | Minimize the error | data structures greedy sortings | Statement | B | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 1500 | |
| 4197 | Subsequence Counting | bitmasks constructive algorithms greedy implementation | Statement | C | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 1700 | |
| 3507 | Pathwalks | data structures dp graphs | Statement | F | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2000 | |
| 1980 | Full Binary Tree Queries | brute force implementation trees | Statement | D | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2100 | |
| 2373 | Alternating Tree | combinatorics dfs and similar divide and conquer dp probabilities trees | Statement | E | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2200 | |
| 1296 | Bandit Blues | combinatorics dp fft math | Statement | G | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 2800 | |
| 527 | Santa's Gift | data structures trees | Statement | H | Divide by Zero 2018 and Codeforces Round 474 (Div. 1 + Div. 2, combined) {960} | PROGRAMMING | Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Editorial | 3000 | |
| 27314 | Lecture Sleep | data structures dp implementation two pointers | Statement | B | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1300 | |
| 5664 | Chessboard | bitmasks brute force implementation | Statement | C | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1400 | |
| 4345 | Tufurama | data structures | Statement | E | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1900 | |
| 5076 | Pair Of Lines | geometry | Statement | D | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 1900 | |
| 1829 | Partitions | combinatorics math number theory | Statement | G | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 2700 | |
| 1005 | k-substrings | binary search hashing string suffix structures | Statement | F | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 2700 | |
| 10951 | Tetris | implementation | Statement | A | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 900 | |
| 8196 | Students in Railway Carriage | constructive algorithms greedy implementation | Statement | B | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1300 | |
| 13500 | Equator | implementation | Statement | A | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1300 | |
| 8515 | Make a Square | brute force implementation math | Statement | C | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1400 | |
| 7459 | Merge Equals | data structures implementation | Statement | D | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 1600 | |
| 1170 | Byteland, Berland and Disputed Cities | constructive algorithms greedy | Statement | E | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2200 | |
| 1698 | Simple Cycles Edges | dfs and similar graphs trees | Statement | F | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2400 | |
| 284 | Visible Black Areas | data structures dsu geometry trees | Statement | G | Educational Codeforces Round 42 (Rated for Div. 2) {962} | PROGRAMMING | Educational Codeforces Round 42 Editorial | 2900 | |
| 3674 | Alternating Sum | math number theory | Statement | A | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 1800 | |
| 3062 | Destruction of a Tree | constructive algorithms dfs and similar dp greedy trees | Statement | B | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 2100 | |
| 2962 | Frequency of String | hashing string suffix structures strings | Statement | D | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 2400 | |
| 707 | Cutting Rectangle | brute force math number theory | Statement | C | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 2600 | |
| 874 | Circles of Waiting | math | Statement | E | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 3100 | |
| 4610 | Messages | math | Statement | B | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 2) {964} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 1300 | |
| 10406 | Splits | math | Statement | A | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 2) {964} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 900 | |
| 4804 | Battleship | implementation | Statement | B | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 1300 | |
| 3386 | Single-use Stones | binary search flows greedy two pointers | Statement | D | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 1900 | |
| 2244 | Greedy Arkady | math | Statement | C | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 1900 | |
| 2037 | Short Code | data structures dp greedy strings trees | Statement | E | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 2500 | |
| 10455 | Paper Airplanes | math | Statement | A | Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} | PROGRAMMING | Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] | 900 | |
| 8001 | Watering System | math sortings | Statement | B | Codeforces Round 477 (rated, Div. 2, based on VK Cup 2018 Round 3) {967} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 1000 | |
| 4678 | Mind the Gap | implementation | Statement | A | Codeforces Round 477 (rated, Div. 2, based on VK Cup 2018 Round 3) {967} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 1200 | |
| 10446 | Aramic script | implementation strings | Statement | A | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 1000 | |
| 7232 | Mancala | brute force implementation | Statement | B | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 1200 | |
| 11473 | Valhalla Siege | binary search | Statement | C | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 1400 | |
| 2432 | Ghosts | geometry math | Statement | D | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 2000 | |
| 378 | Hag's Khashba | geometry | Statement | E | Codeforces Round 478 (Div. 2) {975} | PROGRAMMING | Codeforces Round #478 (Div. 2), Editorial | 3000 | |
| 6095 | Lara Croft and the New Game | implementation math | Statement | B | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 1300 | |
| 11551 | Nested Segments | greedy implementation sortings | Statement | C | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 1500 | |
| 2604 | Well played! | greedy sortings | Statement | E | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 2100 | |
| 790 | Degree Set | constructive algorithms graphs implementation | Statement | D | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 2400 | |
| 709 | Minimal k-covering | flows graphs | Statement | F | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 2500 | |
| 11042 | Minimum Binary Number | implementation | Statement | A | Educational Codeforces Round 43 (Rated for Div. 2) {976} | PROGRAMMING | 59195 | 800 | |
| 45450 | Less or Equal | sortings | Statement | C | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1200 | |
| 20998 | Divide by three, multiply by two | dfs and similar math sortings | Statement | D | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1400 | |
| 27085 | Cyclic Components | dfs and similar dsu graphs | Statement | E | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1500 | |
| 26358 | Consecutive Subsequence | dp | Statement | F | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1700 | |
| 227590 | Wrong Subtraction | implementation | Statement | A | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 500 | |
| 51683 | Two-gram | implementation strings | Statement | B | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 900 | |
| 30914 | Letters | binary search implementation two pointers | Statement | C | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1000 | |
| 10744 | Bus Video System | combinatorics math | Statement | E | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1400 | |
| 9382 | Mentors | binary search data structures implementation | Statement | F | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1500 | |
| 10126 | Almost Arithmetic Progression | brute force implementation math | Statement | D | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1500 | |
| 4999 | Petya's Exams | greedy implementation sortings | Statement | G | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 1800 | |
| 41600 | File Name | greedy strings | Statement | B | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 700 | |
| 31672 | Remove Duplicates | implementation | Statement | A | Codeforces Round 481 (Div. 3) {978} | PROGRAMMING | T | 800 | |
| 14799 | Pizza, Pizza, Pizza!!! | math | Statement | A | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 1000 | |
| 7532 | Kuro and Walking Route | dfs and similar trees | Statement | C | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 1600 | |
| 4828 | Treasure Hunt | greedy | Statement | B | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 1800 | |
| 2272 | Kuro and GCD and XOR and SUM | binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees | Statement | D | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | 1750.0 | Codeforces Round #482 (Div. 2) Editorial | 2200 |
| 961 | Kuro and Topological Parity | dp | Statement | E | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 2800 | |
| 4977 | Marlin | constructive algorithms | Statement | B | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 1600 | |
| 3961 | Posterized | games greedy | Statement | C | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 1700 | |
| 3104 | Perfect Groups | dp math number theory | Statement | D | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2100 | |
| 2383 | The Number Games | data structures greedy trees | Statement | E | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2300 | |
| 241 | Cactus to Tree | dp graphs trees | Statement | F | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2900 | |
| 11044 | Links and Pearls | implementation math | Statement | A | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 900 | |
| 8157 | Businessmen Problems | sortings | Statement | B | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 1000 | |
| 10428 | Antipalindrome | brute force implementation strings | Statement | A | Avito Code Challenge 2018 {981} | PROGRAMMING | 59713 | 1000 | |
| 7003 | Useful Decomposition | implementation trees | Statement | C | Avito Code Challenge 2018 {981} | PROGRAMMING | 59713 | 1400 | |
| 3595 | Bookshelves | bitmasks dp greedy | Statement | D | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 1800 | |
| 2671 | Addition on Segments | bitmasks data structures divide and conquer dp | Statement | E | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2100 | |
| 845 | Magic multisets | data structures | Statement | G | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2400 | |
| 972 | Round Marriage | binary search graph matchings greedy | Statement | F | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2500 | |
| 502 | K Paths | combinatorics data structures dp fft math | Statement | H | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2900 | |
| 9864 | Row | brute force constructive algorithms | Statement | A | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1200 | |
| 9067 | Bus of Characters | data structures greedy implementation | Statement | B | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1300 | |
| 16967 | Cut 'em all! | dfs and similar dp graphs greedy trees | Statement | C | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1500 | |
| 2571 | Shark | brute force data structures dsu trees | Statement | D | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1900 | |
| 883 | Billiard | geometry number theory | Statement | E | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 2500 | |
| 230 | The Meeting Place Cannot Be Changed | dfs and similar graphs | Statement | F | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 2800 | |
| 4865 | Finite or not? | implementation math | Statement | A | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 1700 | |
| 6500 | XOR-pyramid | dp | Statement | B | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 1900 | |
| 1014 | Elevator | dp graphs shortest paths | Statement | C | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 2500 | |
| 1268 | NN country | binary search data structures trees | Statement | E | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 2700 | |
| 581 | Arkady and Rectangles | data structures | Statement | D | Codeforces Round 483 (Div. 1) [Thanks, Botan Investments and Victor Shaburov!] {983} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 3300 | |
| 8045 | Minesweeper | implementation | Statement | B | Codeforces Round 483 (Div. 2) [Thanks, Botan Investments and Victor Shaburov!] {984} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 1100 | |
| 20936 | Game | sortings | Statement | A | Codeforces Round 483 (Div. 2) [Thanks, Botan Investments and Victor Shaburov!] {984} | PROGRAMMING | Codeforces Round #483 [Thanks, Botan Investments and Victor Shaburov!] Editoral | 700 | |
| 8011 | Switches and Lamps | implementation | Statement | B | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 1200 | |
| 8469 | Chess Placing | implementation | Statement | A | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 1200 | |
| 6039 | Liebig's Barrels | greedy | Statement | C | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 1500 | |
| 4315 | Pencils and Boxes | binary search data structures dp greedy two pointers | Statement | E | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2000 | |
| 2886 | Sand Fortress | binary search constructive algorithms math | Statement | D | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2100 | |
| 2246 | Isomorphic Strings | hashing strings | Statement | F | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2400 | |
| 849 | Team Players | combinatorics | Statement | G | Educational Codeforces Round 44 (Rated for Div. 2) {985} | PROGRAMMING | Educational Codeforces Round 44 Editorial | 2700 | |
| 8723 | Fair | graphs greedy number theory shortest paths | Statement | A | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 1600 | |
| 5107 | Petr and Permutations | combinatorics math | Statement | B | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 1800 | |
| 2812 | AND Graph | bitmasks dfs and similar dsu graphs | Statement | C | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2300 | |
| 400 | Perfect Encoding | fft math | Statement | D | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2600 | |
| 970 | Prince's Problem | brute force data structures math number theory trees | Statement | E | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 2900 | |
| 895 | Oppa Funcan Style Remastered | graphs math number theory shortest paths | Statement | F | Codeforces Round 485 (Div. 1) {986} | PROGRAMMING | Codeforces Round #485 Editorial | 3200 | |
| 12295 | High School: Become Human | math | Statement | B | Codeforces Round 485 (Div. 2) {987} | PROGRAMMING | Codeforces Round #485 Editorial | 1200 | |
| 15353 | Three displays | brute force dp implementation | Statement | C | Codeforces Round 485 (Div. 2) {987} | PROGRAMMING | Codeforces Round #485 Editorial | 1400 | |
| 17710 | Infinity Gauntlet | implementation | Statement | A | Codeforces Round 485 (Div. 2) {987} | PROGRAMMING | Codeforces Round #485 Editorial | 700 | |
| 20639 | Substrings Sort | sortings strings | Statement | B | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 1100 | |
| 11323 | Equal Sums | implementation sortings | Statement | C | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 1400 | |
| 8149 | Points and Powers of Two | brute force math | Statement | D | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 1800 | |
| 4512 | Divisibility by 25 | brute force greedy | Statement | E | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 2100 | |
| 2853 | Rain and Umbrellas | dp | Statement | F | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 2300 | |
| 29112 | Diverse Team | brute force implementation | Statement | A | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 800 | |
| 11248 | A Blend of Springtime | implementation strings | Statement | A | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 1000 | |
| 7316 | A Tide of Riverscape | constructive algorithms strings | Statement | B | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 1300 | |
| 4106 | A Mist of Florescence | constructive algorithms graphs | Statement | C | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 1800 | |
| 630 | A Shade of Moonlight | binary search geometry math sortings two pointers | Statement | D | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 2500 | |
| 354 | A Trance of Nightfall | dp geometry matrices probabilities | Statement | E | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 2900 | |
| 11326 | Commentary Boxes | implementation math | Statement | A | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 1000 |