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 4 5 6 ... 9 10 11 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 3878 | Packmen | binary search dp | Statement | E | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2000 | ||
| 1662 | Noise Level | dfs and similar | Statement | I | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 2000 | ||
| 505 | Shake It! | combinatorics dp flows graphs | Statement | D | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 2900 | |
| 314 | Days of Floral Colours | combinatorics divide and conquer dp fft math | Statement | E | Codeforces Round 431 (Div. 1) {848} | PROGRAMMING | Codeforces Round #431 Editorial | 3400 | |
| 1997 | Arpa and a game with Mojtaba | bitmasks dp games | Statement | C | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2400 | |
| 525 | Tournament Construction | constructive algorithms dp graphs greedy math | Statement | D | Codeforces Round 432 (Div. 1, based on IndiaHacks Final Round 2017) {850} | PROGRAMMING | Codeforces Round #432 editorial | 2700 | |
| 1796 | Neural Network country | dp matrices | Statement | B | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2000 | |
| 1240 | Casinos and travel | dp | Statement | E | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 2200 | |
| 218 | Bob and stages | dp geometry | Statement | H | Bubble Cup X - Finals [Online Mirror] {852} | PROGRAMMING | Tutorial | 3100 | |
| 729 | Michael and Charging Stations | binary search dp greedy | Statement | D | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) {853} | PROGRAMMING | Codeforces Round #433 Editorial | 2400 | |
| 10034 | Marvolo Gaunt's Ring | brute force data structures dp | Statement | B | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 1500 | |
| 2466 | Helga Hufflepuff's Cup | dp trees | Statement | C | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 2000 | |
| 2265 | Salazar Slytherin's Locket | bitmasks dp | Statement | E | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 2200 | |
| 454 | Harry Vs Voldemort | dfs and similar dp graphs trees | Statement | G | Manthan, Codefest 17 {855} | PROGRAMMING | 54750 | 3000 | |
| 653 | Similar Words | dp strings | Statement | B | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 2300 | |
| 752 | Eleventh Birthday | combinatorics dp math | Statement | C | Russian Code Cup 2017 - Finals [Unofficial Mirror, Div. 1 Only Recommended, Teams Allowed] {856} | PROGRAMMING | Tutorial | 2400 | |
| 5917 | Did you mean... | dp greedy implementation | Statement | C | Технокубок 2018 - Отборочный Раунд 1 {858} | PROGRAMMING | Codeforces Round 434 Div.1+Div.2 (and Technocup 2018 — Elimination Round 1) Editorial | 1500 | |
| 6244 | Pie Rules | dp games | Statement | C | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 1500 | |
| 1154 | Third Month Insanity | dp probabilities trees | Statement | D | MemSQL Start[c]UP 3.0 - Round 1 {859} | PROGRAMMING | Tutorial | 2100 | |
| 4795 | Fire | dp sortings | Statement | E | Codeforces Round 436 (Div. 2) {864} | PROGRAMMING | Codeforces Round #436 (Div.2) Разбор | 2000 | |
| 963 | Gotta Go Fast | binary search dp | Statement | C | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2500 | |
| 163 | Hex Dyslexia | bitmasks brute force dp graphs | Statement | E | MemSQL Start[c]UP 3.0 - Round 2 (onsite finalists) {865} | PROGRAMMING | MemSQL Start[c]UP 3.0 Round 2 Editorial | 2700 | |
| 5063 | Qualification Rounds | bitmasks brute force constructive algorithms dp | Statement | C | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 1500 | |
| 1029 | Huge Strings | bitmasks brute force dp implementation strings | Statement | D | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2100 | |
| 5405 | Yet Another Minimization Problem | divide and conquer dp | Statement | F | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2500 | |
| 569 | Policeman and a Tree | dp graphs trees | Statement | E | Codeforces Round 438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) {868} | PROGRAMMING | 55046 | 2600 | |
| 5296 | The Intriguing Obsession | combinatorics dp math | Statement | C | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 1800 | |
| 372 | The Overdosing Ubiquity | brute force dfs and similar graphs | Statement | D | Codeforces Round 439 (Div. 2) {869} | PROGRAMMING | Tutorial | 2800 | |
| 9836 | Maximum splitting | dp greedy math number theory | Statement | C | Technocup 2018 - Elimination Round 2 {870} | PROGRAMMING | Editorial Codeforces Round 440 Div.1+Div.2 (and Technocup 2018 — Elimination Round 2) | 1300 | |
| 9255 | Balanced Substring | dp implementation | Statement | B | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 1500 | |
| 818 | Awards For Contestants | brute force data structures dp | Statement | E | Educational Codeforces Round 30 {873} | PROGRAMMING | 55171 | 2500 | |
| 1048 | Delivery Club | binary search data structures dp | Statement | E | Codeforces Round 441 (Div. 1, by Moscow Team Olympiad) {875} | PROGRAMMING | Codeforces Round #441. Editorial. | 2600 | |
| 12149 | Nikita and string | brute force dp | Statement | B | Codeforces Round 442 (Div. 2) {877} | PROGRAMMING | 55362 | 1500 | |
| 772 | Numbers on the blackboard | combinatorics dp | Statement | E | Codeforces Round 443 (Div. 1) {878} | PROGRAMMING | Editorial | 3200 | |
| 2416 | Photo Processing | binary search dp | Statement | I | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2000 | ||
| 506 | Packmen Strike Back | binary search dp | Statement | D | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {883} | PROGRAMMING | 2800 | ||
| 1253 | Maximum Element | combinatorics dp math | Statement | E | Технокубок 2018 - Отборочный Раунд 3 {886} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 2500 | |
| 10851 | Almost Identity Permutations | combinatorics dp math | Statement | D | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 1600 | |
| 1181 | Connecting Vertices | dp graphs | Statement | F | Educational Codeforces Round 32 {888} | PROGRAMMING | Educational Codeforces Round 32 - Editorial | 2500 | |
| 813 | Mod Mod Mod | binary search dp math | Statement | E | Codeforces Round 445 (Div. 1, based on Technocup 2018 Elimination Round 3) {889} | PROGRAMMING | Editorial Codeforces Round 445 (and Technocup 2018 — Elimination Round 3) | 3100 | |
| 15026 | Pride | brute force dp greedy math number theory | Statement | A | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 1600 | |
| 3137 | Envy | data structures dsu graphs | Statement | C | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 2500 | |
| 488 | Sloth | dfs and similar dp graph matchings trees | Statement | D | Codeforces Round 446 (Div. 1) {891} | PROGRAMMING | Codeforces Round #446 Editorial | 3000 | |
| 3351 | Credit Card | data structures dp greedy implementation | Statement | D | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 1800 | |
| 4319 | Counting Arrays | combinatorics dp math number theory | Statement | E | Educational Codeforces Round 33 (Rated for Div. 2) {893} | PROGRAMMING | 55989 | 2000 | |
| 3420 | Ralph and Mushrooms | dp graphs | Statement | E | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 2400 | |
| 39944 | QAQ | brute force dp | Statement | A | Codeforces Round 447 (Div. 2) {894} | PROGRAMMING | Codeforces Round #447 (Div.2 Only) Editorial | 800 | |
| 7682 | Square Subsets | bitmasks combinatorics dp math | Statement | C | Codeforces Round 448 (Div. 2) {895} | PROGRAMMING | Codeforces Round #448(Div.2) Editorial | 2000 | |
| 3907 | Unusual Sequences | bitmasks combinatorics dp math number theory | Statement | D | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2100 | |
| 1443 | Maximum Questions | data structures dp strings | Statement | E | Codeforces Round 450 (Div. 2) {900} | PROGRAMMING | Codeforces Round #450(Div. 2). Editorial. | 2300 | |
| 797 | Clear The Matrix | bitmasks dp | Statement | F | Educational Codeforces Round 34 (Rated for Div. 2) {903} | PROGRAMMING | Educational Codeforces Round 34 Editorial | 2400 | |
| 1564 | Party | bitmasks brute force dp graphs | Statement | C | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 2300 | |
| 589 | Reverses | dp string suffix structures strings | Statement | E | Codeforces Round 454 (Div. 1, based on Technocup 2018 Elimination Round 4) {906} | PROGRAMMING | Editorial Codeforces Round 454 (and Technocup 2018 — Elimination Round 4) | 3200 | |
| 2741 | New Year and Arbitrary Arrangement | dp math probabilities | Statement | D | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2200 | |
| 871 | New Year and Entity Enumeration | bitmasks combinatorics dp math | Statement | E | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2400 | |
| 1746 | New Year and Original Order | dp math | Statement | G | Good Bye 2017 {908} | PROGRAMMING | Good Bye 2017 Editorial | 2700 | |
| 6806 | Segments | constructive algorithms math | Statement | B | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 1300 | |
| 5544 | Python Indentation | dp | Statement | C | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 1800 | |
| 2566 | Coprocessor | dfs and similar dp graphs greedy | Statement | E | Codeforces Round 455 (Div. 2) {909} | PROGRAMMING | Codeforces Round #455 (Div. 2) Editorial | 2100 | |
| 14270 | The Way to Home | dfs and similar dp greedy implementation | Statement | A | Testing Round 14 (Unrated) {910} | PROGRAMMING | 1100 | ||
| 8537 | Party Lemonade | bitmasks dp greedy | Statement | C | Hello 2018 {913} | PROGRAMMING | Tutorial | 1600 | |
| 908 | Logical Expression | bitmasks dp shortest paths | Statement | E | Hello 2018 {913} | PROGRAMMING | Tutorial | 2400 | |
| 843 | Strongly Connected Tournament | dp graphs math probabilities | Statement | F | Hello 2018 {913} | PROGRAMMING | Tutorial | 2700 | |
| 4346 | Travelling Salesman and Special Numbers | brute force combinatorics dp | Statement | C | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 1800 | |
| 1270 | Sum the Fibonacci | bitmasks divide and conquer dp fft math | Statement | G | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2500 | |
| 350 | Ember and Storm's Tree Game | combinatorics dp games trees | Statement | H | Codecraft-18 and Codeforces Round 458 (Div. 1 + Div. 2, combined) {914} | PROGRAMMING | Tutorial | 2900 | |
| 7611 | Permute Digits | dp greedy | Statement | C | Educational Codeforces Round 36 (Rated for Div. 2) {915} | PROGRAMMING | 57123 | 1700 | |
| 4047 | MADMAX | dfs and similar dp games graphs | Statement | B | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 1800 | |
| 3687 | The Monster | dp greedy implementation math | Statement | A | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 1900 | |
| 1517 | Stranger Trees | dp math matrices trees | Statement | D | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 2600 | |
| 486 | Pollywog | combinatorics dp matrices | Statement | C | Codeforces Round 459 (Div. 1) {917} | PROGRAMMING | Codeforces Round #459 Editorial | 2800 | |
| 32012 | Perfect Number | binary search brute force dp implementation number theory | Statement | B | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1100 | |
| 12831 | Substring | dfs and similar dp graphs | Statement | D | Codeforces Round 460 (Div. 2) {919} | PROGRAMMING | Codeforces Round #460 (Div. 2) Editorial | 1700 | |
| 835 | Tanks | dp greedy implementation | Statement | D | Educational Codeforces Round 37 (Rated for Div. 2) {920} | PROGRAMMING | 2600 | ||
| 2539 | Birds | dp | Statement | E | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 2300 | |
| 768 | Divisibility | constructive algorithms dp greedy number theory | Statement | F | Codeforces Round 461 (Div. 2) {922} | PROGRAMMING | 57605 | 2500 | |
| 4337 | Riverside Curio | data structures dp greedy | Statement | C | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 1800 | |
| 443 | Minimal Subset Difference | dp | Statement | F | VK Cup 2018 - Round 2 {924} | PROGRAMMING | VK Cup 2018 Round 2 and Codeforces Round #472 Editorial | 3400 | |
| 324 | Parametric Circulation | binary search flows | Statement | F | VK Cup 2018 - Round 3 {925} | PROGRAMMING | Разбор VK 2018 Round 3 + Codeforces Round #477 | 3300 | |
| 2657 | Chat | *special dp | Statement | B | VK Cup 2018 - Квалификация 1 {928} | PROGRAMMING | 1800 | ||
| 2396 | 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 | |
| 565 | 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 | |
| 2069 | Tree | binary search dp trees | Statement | D | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2200 | |
| 3599 | Team Work | combinatorics dp math | Statement | E | ICM Technex 2018 and Codeforces Round 463 (Div. 1 + Div. 2, combined) {932} | PROGRAMMING | 57796 | 2400 | |
| 4328 | 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 | |
| 1229 | 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 | |
| 5458 | A Twisty Movement | dp | Statement | A | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 57763 | 1800 | |
| 328 | A Preponderant Reunion | constructive algorithms dp | Statement | E | Codeforces Round 462 (Div. 1) {933} | PROGRAMMING | 57763 | 3100 | |
| 1006 | Fafa and Ancient Mathematics | dfs and similar dp trees | Statement | E | Codeforces Round 465 (Div. 2) {935} | PROGRAMMING | editorial | 2500 | |
| 3476 | Sleepy Game | dfs and similar dp games graphs | Statement | B | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 2100 | |
| 398 | World of Tank | dp greedy | Statement | D | Codeforces Round 467 (Div. 1) {936} | PROGRAMMING | Codeforces Round #467, Editorial | 3000 | |
| 674 | Erasing Substrings | bitmasks dp greedy | Statement | F | Educational Codeforces Round 38 (Rated for Div. 2) {938} | PROGRAMMING | Educational Codeforces Round 38 — Editorial | 2600 | |
| 1255 | Cutlet | data structures dp | Statement | F | Codeforces Round 464 (Div. 2) {939} | PROGRAMMING | Analysis of Codeforces Round #464 | 2700 | |
| 9582 | Our Tanya is Crying Out Loud | dp greedy | Statement | B | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 1400 | |
| 4517 | Cashback | data structures dp greedy math | Statement | E | Codeforces Round 466 (Div. 2) {940} | PROGRAMMING | [Editorial] Codeforces Round #466 (Div. 2) | 2000 | |
| 4950 | Timetable | dp | Statement | D | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 1800 | |
| 672 | Fibonacci String Subsequences | combinatorics dp matrices | Statement | F | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2500 | |
| 839 | Almost Increasing Array | data structures dp | Statement | G | Educational Codeforces Round 39 (Rated for Div. 2) {946} | PROGRAMMING | 58210 | 2600 | |
| 1438 | Runner's Problem | dp matrices sortings | Statement | F | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2300 | |
| 828 | Path Counting | combinatorics dp | Statement | H | Educational Codeforces Round 40 (Rated for Div. 2) {954} | PROGRAMMING | 58519 | 2500 | |
| 2000 | Heaps | dp trees | Statement | F | Codeforces Round 471 (Div. 2) {955} | PROGRAMMING | Editorial | 2800 | |
| 1420 | Encryption (medium) | dp | Statement | C2 | Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) {958} | PROGRAMMING | helvetic-coding-contest-2018-editorial.pdf | 2100 | |
| 1202 | 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 | |
| 783 | 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 | |
| 3786 | 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 | |
| 2959 | 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 | |
| 3468 | 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 | |
| 2357 | 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 | |
| 1292 | 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 | |
| 27115 | 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 | |
| 3049 | 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 | |
| 2009 | 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 | |
| 26055 | Consecutive Subsequence | dp | Statement | F | Codeforces Round 479 (Div. 3) {977} | PROGRAMMING | Codeforces Round #479 (Div. 3) Editorial | 1700 | |
| 2263 | 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 |
| 948 | Kuro and Topological Parity | dp | Statement | E | Codeforces Round 482 (Div. 2) {979} | PROGRAMMING | Codeforces Round #482 (Div. 2) Editorial | 2800 | |
| 3091 | Perfect Groups | dp math number theory | Statement | D | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2100 | |
| 241 | Cactus to Tree | dp graphs trees | Statement | F | Codeforces Round 480 (Div. 2) {980} | PROGRAMMING | Tutorial | 2900 | |
| 3588 | Bookshelves | bitmasks dp greedy | Statement | D | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 1800 | |
| 2623 | Addition on Segments | bitmasks data structures divide and conquer dp | Statement | E | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2100 | |
| 502 | K Paths | combinatorics data structures dp fft math | Statement | H | Avito Code Challenge 2018 {981} | PROGRAMMING | Avito Code Challenge 2018 — разбор | 2900 | |
| 16703 | Cut 'em all! | dfs and similar dp graphs greedy trees | Statement | C | Codeforces Round 484 (Div. 2) {982} | PROGRAMMING | Editorial | 1500 | |
| 6441 | 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 | |
| 1008 | 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 | |
| 4301 | 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 | |
| 15286 | Three displays | brute force dp implementation | Statement | C | Codeforces Round 485 (Div. 2) {987} | PROGRAMMING | Codeforces Round #485 Editorial | 1400 | |
| 2830 | Rain and Umbrellas | dp | Statement | F | Codeforces Round 486 (Div. 3) {988} | PROGRAMMING | 59810 | 2300 | |
| 625 | 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 | |
| 351 | A Trance of Nightfall | dp geometry matrices probabilities | Statement | E | Codeforces Round 487 (Div. 2) {989} | PROGRAMMING | Codeforces Round #487 (Div. 2) Editorial | 2900 | |
| 2426 | GCD Counting | divide and conquer dp dsu number theory trees | Statement | G | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2400 | |
| 1143 | Flow Control | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 45 (Rated for Div. 2) {990} | PROGRAMMING | Educational Codeforces Round 45 Editorial | 2500 | |
| 7805 | Bishwock | dp greedy | Statement | D | Codeforces Round 491 (Div. 2) {991} | PROGRAMMING | 60181 | 1500 | |
| 866 | Compute Power | binary search dp greedy | Statement | D | Codeforces Round 488 by NEAR (Div. 1) {993} | PROGRAMMING | Codeforces Round #488 editorial | 2400 | |
| 1843 | Cowmpany Cowmpensation | combinatorics dp math trees | Statement | F | Codeforces Round 492 (Div. 1) [Thanks, uDebug!] {995} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 2700 | |
| 122419 | Hit the Lottery | dp greedy | Statement | A | Codeforces Round 492 (Div. 2) [Thanks, uDebug!] {996} | PROGRAMMING | Editorial for Codeforces Round #492 [Thanks u-Debug!] | 600 | |
| 3232 | Roman Digits | brute force combinatorics dp greedy math | Statement | B | Codeforces Round 493 (Div. 1) {997} | PROGRAMMING | 60357 | 2000 | |
| 14548 | Cutting | dp greedy sortings | Statement | B | Codeforces Round 493 (Div. 2) {998} | PROGRAMMING | Codeforces Round #493 — Editorial | 1200 | |
| 3360 | Cards and Joy | dp | Statement | F | Codeforces Round 490 (Div. 3) {999} | PROGRAMMING | 60138 | 2200 | |
| 8751 | Covered Points Count | data structures implementation sortings | Statement | C | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1700 | |
| 5192 | Yet Another Problem On a Subsequence | combinatorics dp | Statement | D | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 1900 | |
| 7008 | We Need More Bosses | dfs and similar graphs trees | Statement | E | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2100 | |
| 793 | Two-Paths | data structures dp trees | Statement | G | Educational Codeforces Round 46 (Rated for Div. 2) {1000} | PROGRAMMING | 60288 | 2800 | |
| 1652 | Abbreviation | dp hashing strings | Statement | F | Codeforces Round 494 (Div. 3) {1003} | PROGRAMMING | 60417 | 2400 | |
| 1302 | Sonya and Ice Cream | binary search data structures dp greedy shortest paths trees | Statement | E | Codeforces Round 495 (Div. 2) {1004} | PROGRAMMING | 60443 | 2400 | |
| 11600 | Polycarp and Div 3 | dp greedy number theory | Statement | D | Codeforces Round 496 (Div. 3) {1005} | PROGRAMMING | Codeforces Round 496 (Div. 3): Problem Tutorials | 1500 | |
| 7247 | Xor-Paths | bitmasks brute force dp meet-in-the-middle | Statement | F | Codeforces Round 498 (Div. 3) {1006} | PROGRAMMING | 60672 | 2400 | |
| 252 | Mini Metro | dp | Statement | E | Codeforces Round 497 (Div. 1) {1007} | PROGRAMMING | Editorial for Codeforces Round #497 by Skyglow | 3500 | |
| 3911 | Hills | dp | Statement | C | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 2000 | |
| 269 | Passports | dp implementation | Statement | F | Codeforces Round 500 (Div. 1) [based on EJOI] {1012} | PROGRAMMING | 60920 | 3200 | |
| 6916 | Stars Drawing (Easy Edition) | brute force dp greedy | Statement | E1 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 1700 | |
| 4071 | Stars Drawing (Hard Edition) | binary search dp greedy | Statement | E2 | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2000 | |
| 1536 | Bracket Substring | dp strings | Statement | F | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 2600 | |
| 22693 | Points in Segments | implementation | Statement | A | Codeforces Round 501 (Div. 3) {1015} | PROGRAMMING | 60949 | 700 | |
| 4011 | Vasya And The Mushrooms | dp implementation | Statement | C | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 1800 | |
| 1326 | Rest In The Shades | binary search geometry | Statement | E | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2400 | |
| 1096 | Road Projects | dfs and similar dp trees | Statement | F | Educational Codeforces Round 48 (Rated for Div. 2) {1016} | PROGRAMMING | Разбор Educational Codeforces Round 48 | 2600 | |
| 4295 | Recovering BST | brute force dp math number theory trees | Statement | D | Codeforces Round 505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final) {1025} | PROGRAMMING | Codeforces Round #505 Editorial | 2000 | |
| 19191 | Palindromic Twist | implementation strings | Statement | A | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 1000 | |
| 2419 | Inverse Coloring | combinatorics dp math | Statement | E | Educational Codeforces Round 49 (Rated for Div. 2) {1027} | PROGRAMMING | Educational Codeforces Round 49 Editorial | 2100 | |
| 726 | Guess the number | dp interactive | Statement | G | AIM Tech Round 5 (rated, Div. 1 + Div. 2) {1028} | PROGRAMMING | 61493 | 2900 | |
| 18698 | Creating the Contest | dp greedy math | Statement | B | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1200 | |
| 8439 | Maximal Intersection | greedy math sortings | Statement | C | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 1600 | |
| 3525 | Tree with Small Distances | dp graphs greedy | Statement | E | Codeforces Round 506 (Div. 3) {1029} | PROGRAMMING | Codeforces Round #506 (Div. 3) Editorial | 2200 | |
| 3397 | Vasya and Good Sequences | bitmasks dp | Statement | E | Technocup 2019 - Elimination Round 1 {1030} | PROGRAMMING | Сodeforces Round 512 (and Technocup — Elimination Round 1) Editorial | 2100 | |
| 4389 | Playing Piano | constructive algorithms dp | Statement | C | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 1800 | |
| 1909 | The Unbearable Lightness of Weights | dp math | Statement | E | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2300 | |
| 1174 | Vasya and Maximum Matching | dp trees | Statement | F | Technocup 2019 - Elimination Round 3 {1032} | PROGRAMMING | Codeforces Round #522 and Technocup 2019 Elimination Round 3 Editorial | 2600 | |
| 6345 | Permutation Game | brute force dp games | Statement | C | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 1600 | |
| 877 | Hidden Bipartite Graph | binary search constructive algorithms dfs and similar graphs interactive | Statement | E | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2700 | |
| 1143 | Region Separation | combinatorics dp number theory trees | Statement | C | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 2900 | |
| 827 | Little C Loves 3 III | bitmasks dp math | Statement | E | Codeforces Round 511 (Div. 1) {1034} | PROGRAMMING | Codeforces Round #511 Editorial | 3200 | |
| 14297 | Classy Numbers | combinatorics dp | Statement | C | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 1800 | |
| 1799 | Covered Points | fft geometry number theory | Statement | E | Educational Codeforces Round 50 (Rated for Div. 2) {1036} | PROGRAMMING | 61727 | 2300 | |
| 20254 | Equalize | dp greedy strings | Statement | C | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1300 | |
| 19979 | Valid BFS? | dfs and similar graphs shortest paths trees | Statement | D | Manthan, Codefest 18 (rated, Div. 1 + Div. 2) {1037} | PROGRAMMING | Tutorial | 1700 | |
| 8955 | Slime | dp greedy implementation | Statement | D | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 1700 | |
| 1154 | Maximum Matching | bitmasks brute force dfs and similar dp graphs | Statement | E | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2400 | |
| 574 | Wrap Around | dp strings | Statement | F | Codeforces Round 508 (Div. 2) {1038} | PROGRAMMING | Tutorial | 2900 | |
| 2479 | You Are Given a Tree | data structures dp trees | Statement | D | Codeforces Round 507 (Div. 1, based on Olympiad of Metropolises) {1039} | PROGRAMMING | 61668 | 2700 | |
| 7998 | Shashlik Cooking | dp greedy math | Statement | B | Codeforces Round 507 (Div. 2, based on Olympiad of Metropolises) {1040} | PROGRAMMING | Codeforces Round #507 (based on Olympiad of Metropolises) — Editorial | 1300 | |
| 6482 | Glider | binary search data structures two pointers | Statement | D | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 1700 | |
| 1665 | Ray in the tube | data structures divide and conquer dp math | Statement | F | Codeforces Round 509 (Div. 2) {1041} | PROGRAMMING | Codeforces Round #509 (Div. 2) Editorial | 2400 | |
| 19607 | Vitamins | bitmasks brute force dp implementation | Statement | B | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 1200 | |
| 2136 | Vasya and Magic Matrix | dp math probabilities | Statement | E | Codeforces Round 510 (Div. 2) {1042} | PROGRAMMING | Tutorial | 2300 | |
| 3171 | Make It One | bitmasks combinatorics dp math number theory shortest paths | Statement | F | Codeforces Round 519 by Botan Investments {1043} | PROGRAMMING | Codeforces Round #519 Editorial | 2500 | |
| 1433 | Optimal Polygon Perimeter | dp geometry | Statement | C | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 2200 | |
| 725 | DFS | data structures | Statement | F | Lyft Level 5 Challenge 2018 - Final Round {1044} | PROGRAMMING | Lyft Level 5 Challenge 2018 — Final Round — Editorial | 2600 | |
| 9989 | Vasya and Multisets | brute force dp greedy implementation math | Statement | C | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 1400 | |
| 8266 | Bicolorings | bitmasks dp | Statement | D | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 1700 | |
| 1315 | Vasya and Big Integers | binary search data structures dp hashing strings | Statement | E | Educational Codeforces Round 51 (Rated for Div. 2) {1051} | PROGRAMMING | Educational Codeforces Round 51 Editorial | 2500 | |
| 958 | Segments on the Line | binary search dp | Statement | E | Mail.Ru Cup 2018 Round 2 {1055} | PROGRAMMING | Mail.Ru Cup 2018 Round 2 — analysis | 2400 | |
| 6830 | Decorate Apple Tree | constructive algorithms dfs and similar dp graphs greedy sortings trees | Statement | D | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 1600 | |
| 742 | Write The Contest | binary search dp math | Statement | F | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 2400 | |
| 313 | Detect Robots | data structures strings | Statement | H | Mail.Ru Cup 2018 Round 3 {1056} | PROGRAMMING | Mail.Ru Cup 2018 Round 3 Editorial | 3100 | |
| 1216 | Tanya and Colored Candies | *special dp | Statement | C | Mail.Ru Cup 2018 - Practice Round {1057} | PROGRAMMING | 2300 | ||
| 1662 | Split the Tree | binary search data structures dp greedy trees | Statement | E | Codeforces Round 514 (Div. 2) {1059} | PROGRAMMING | Codeforces Round #514 (Div. 2) Editorial | 2400 | |
| 3563 | Sergey and Subway | dfs and similar dp trees | Statement | E | Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) {1060} | PROGRAMMING | User editorial for Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) | 2000 | |
| 848 | Shrinking Tree | combinatorics dp | Statement | F | Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) {1060} | PROGRAMMING | User editorial for Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) | 2800 | |
| 11021 | Multiplicity | data structures dp implementation math number theory | Statement | C | Codeforces Round 523 (Div. 2) {1061} | PROGRAMMING | Tutorial (en) | 1700 | |
| 1152 | String Journey | data structures dp string suffix structures | Statement | F | Codeforces Round 516 (Div. 1, by Moscow Team Olympiad) {1063} | PROGRAMMING | Editorial | 3000 | |
| 25546 | Make a triangle! | brute force geometry math | Statement | A | Codeforces Round 516 (Div. 2, by Moscow Team Olympiad) {1064} | PROGRAMMING | Codeforces Round #516 (by Moscow Team Olympiad) — Editorial | 700 | |
| 1466 | Three Pieces | dfs and similar dp shortest paths | Statement | D | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2200 | |
| 1406 | Up and Down the Tree | dfs and similar dp trees | Statement | F | Educational Codeforces Round 52 (Rated for Div. 2) {1065} | PROGRAMMING | Educational Codeforces Round 52 Editorial | 2500 | |
| 2307 | Yet another 2D Walking | dp | Statement | F | Codeforces Round 515 (Div. 3) {1066} | PROGRAMMING | 62419 | 2300 | |
| 3187 | Array Without Local Maximums | dp | Statement | A | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2000 | |
| 630 | Random Forest Rank | dp graph matchings math trees | Statement | E | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 740 | Computer Game | dp greedy math probabilities | Statement | D | Codeforces Round 518 (Div. 1) [Thanks, Mail.Ru!] {1067} | PROGRAMMING | Tutorial | 2800 | |
| 2683 | Find a Number | dp graphs number theory shortest paths | Statement | A | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2200 | |
| 957 | Monsters and Potions | brute force dp greedy implementation | Statement | G | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2500 | |
| 816 | Streets and Avenues in Berhattan | dp | Statement | J | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2600 | |
| 382 | Rain Protection | binary search geometry | Statement | E | Codeforces Round 517 (Div. 1, based on Technocup 2019 Elimination Round 2) {1071} | PROGRAMMING | Разбор задач Отборочного Раунда 2 Технокубка 2019 и Codeforces Round #517 | 3500 | |
| 3793 | Segment Sum | bitmasks combinatorics dp math | Statement | E | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2300 | |
| 668 | Choosing Two Paths | dfs and similar dp greedy trees | Statement | F | Educational Codeforces Round 53 (Rated for Div. 2) {1073} | PROGRAMMING | 62742 | 2800 | |
| 769 | Summer Practice Report | dp greedy | Statement | F | Educational Codeforces Round 54 (Rated for Div. 2) {1076} | PROGRAMMING | E | 2500 | |
| 5528 | Pictures with Kittens (easy version) | dp | Statement | F1 | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 2100 | |
| 4431 | Pictures with Kittens (hard version) | data structures dp | Statement | F2 | Codeforces Round 521 (Div. 3) {1077} | PROGRAMMING | Codeforces Round #521 (Div. 3) Editorial | 2300 | |
| 8769 | Colorful Bricks | combinatorics dp math | Statement | C | Avito Cool Challenge 2018 {1081} | PROGRAMMING | 63888 | 1600 | |
| 6647 | Increasing Frequency | binary search dp greedy | Statement | E | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2000 | |
| 625 | Speed Dial | dp strings trees | Statement | F | Educational Codeforces Round 55 (Rated for Div. 2) {1082} | PROGRAMMING | 63544 | 2900 | |
| 6420 | The Fair Nut and the Best Path | data structures dp trees | Statement | A | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 1800 | |
| 5916 | The Fair Nut and Rectangles | data structures dp geometry | Statement | E | Codeforces Round 526 (Div. 1) {1083} | PROGRAMMING | 63753 | 2400 | |
| 12413 | The Fair Nut and String | combinatorics dp implementation | Statement | C | Codeforces Round 526 (Div. 2) {1084} | PROGRAMMING | 63753 | 1500 | |
| 1065 | Beautiful Matrix | combinatorics data structures dp | Statement | G | Technocup 2019 - Elimination Round 4 {1085} | PROGRAMMING | Technocup 2019 — Elimination Round 4 + Codeforces Round 528: editorial | 2600 | |
| 1648 | Ehab and a component choosing problem | dp greedy math trees | Statement | E | Codeforces Round 525 (Div. 2) {1088} | PROGRAMMING | Codeforces round #525 editorial | 2400 | |
| 1282 | Alice the Fan | dp | Statement | A | 2018-2019 ICPC, NEERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1089} | PROGRAMMING | T | 2300 | |
| 7549 | New Year and the Permutation Concatenation | combinatorics dp math | Statement | D | Good Bye 2018 {1091} | PROGRAMMING | Editorial | 1700 | |
| 11530 | Tree with Maximum Cost | dfs and similar dp trees | Statement | F | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2100 | |
| 5840 | Great Vova Wall (Version 1) | greedy implementation math | Statement | D1 | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2100 | |
| 3435 | Great Vova Wall (Version 2) | data structures implementation | Statement | D2 | Codeforces Round 527 (Div. 3) {1092} | PROGRAMMING | Codeforces Round #527 (Div. 3) Editorial | 2200 | |
| 1440 | Vasya and Array | dp | Statement | F | Educational Codeforces Round 56 (Rated for Div. 2) {1093} | PROGRAMMING | 63877 | 2500 | |
| 9587 | Easy Problem | dp | Statement | D | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 1800 | |
| 2137 | Inversion Expectation | dp math probabilities | Statement | F | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 2300 | |
| 2098 | Lucky Tickets | divide and conquer dp fft | Statement | G | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 2400 | |
| 1360 | The Top Scorer | combinatorics dp math probabilities | Statement | E | Educational Codeforces Round 57 (Rated for Div. 2) {1096} | PROGRAMMING | Разбор Educational Codeforces Round 57 | 2600 | |
| 37176 | Petr and a Combination Lock | bitmasks brute force dp | Statement | B | Hello 2019 {1097} | PROGRAMMING | 64310 | 1200 | |
| 3311 | Makoto and a Blackboard | dp math number theory probabilities | Statement | D | Hello 2019 {1097} | PROGRAMMING | 64310 | 2200 | |
| 1190 | Vladislav and a Great Legend | combinatorics dp trees | Statement | G | Hello 2019 {1097} | PROGRAMMING | 64310 | 2900 | |
| 267 | Mateusz and an Infinite Sequence | bitmasks brute force dp strings | Statement | H | Hello 2019 {1097} | PROGRAMMING | 64310 | 3000 | |
| 1083 | Cookies | binary search data structures dfs and similar dp games trees | Statement | F | Codeforces Round 530 (Div. 2) {1099} | PROGRAMMING | E | 2300 | |
| 5563 | GCD Counting | data structures dfs and similar dp number theory trees | Statement | D | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2000 | |
| 1695 | Trucks and Cities | binary search dp | Statement | F | Educational Codeforces Round 58 (Rated for Div. 2) {1101} | PROGRAMMING | 64483 | 2500 | |
| 2434 | Elongated Matrix | binary search bitmasks brute force dp graphs | Statement | F | Codeforces Round 531 (Div. 3) {1102} | PROGRAMMING | 64439 | 2400 | |
| 562 | Professional layer | bitmasks dp | Statement | D | Codeforces Round 534 (Div. 1) {1103} | PROGRAMMING | Codeforces Round #534 — Editorial | 3000 | |
| 11608 | Ayoub and Lost Array | combinatorics dp math | Statement | C | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 1500 | |
| 2061 | Helping Hiasat | bitmasks brute force dp meet-in-the-middle | Statement | E | Codeforces Round 533 (Div. 2) {1105} | PROGRAMMING | Tutorial | 2200 | |
| 2873 | Lunar New Year and Red Envelopes | data structures dp | Statement | E | Codeforces Round 536 (Div. 2) {1106} | PROGRAMMING | Tutorial | 2100 | |
| 3930 | Compression | dp implementation math number theory | Statement | D | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 1800 | |
| 1295 | Vasya and Maximum Profit | binary search constructive algorithms data structures dp dsu | Statement | G | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2400 | |
| 2894 | Vasya and Binary String | dp | Statement | E | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2400 | |
| 1008 | Vasya and Endless Credits | dp flows graph matchings graphs sortings | Statement | F | Educational Codeforces Round 59 (Rated for Div. 2) {1107} | PROGRAMMING | Educational Codeforces Round 59 Editorial | 2700 | |
| 16600 | Diverse Garland | constructive algorithms dp greedy | Statement | D | Codeforces Round 535 (Div. 3) {1108} | PROGRAMMING | 64751 | 1400 |