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 7 8 9 10 11 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 2058 | AND Segments | bitmasks combinatorics data structures dp two pointers | Statement | F | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2500 | |
| 532 | Letters and Question Marks | bitmasks dp string suffix structures | Statement | G | Educational Codeforces Round 84 (Rated for Div. 2) {1327} | PROGRAMMING | Educational Codeforces Round 84 Editorial | 2900 | |
| 3534 | Make k Equal | dp greedy | Statement | F | Codeforces Round 629 (Div. 3) {1328} | PROGRAMMING | 75246 | 2400 | |
| 7159 | Dreamoon Likes Sequences | bitmasks combinatorics dp math | Statement | B | Codeforces Round 631 (Div. 1) - Thanks, Denis aramis Shitov! {1329} | PROGRAMMING | 750.0 | Codeforces Round #631 Editorial | 1900 |
| 604 | Elementary! | brute force dp strings | Statement | F | April Fools Day Contest 2020 {1331} | PROGRAMMING | April Fools Day Contest 2020: editorial | ||
| 1132 | Independent Set | dfs and similar dp trees | Statement | F | Codeforces Round 630 (Div. 2) {1332} | PROGRAMMING | 2250.0 | Codeforces Round #630 Editorial | 2500 |
| 1523 | Strange Function | data structures dp | Statement | F | Educational Codeforces Round 85 (Rated for Div. 2) {1334} | PROGRAMMING | Educational Codeforces Round 85 Editorial | ||
| 11775 | Three Blocks Palindrome (easy version) | binary search brute force data structures dp two pointers | Statement | E1 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 1700 | |
| 9426 | Three Blocks Palindrome (hard version) | brute force data structures dp two pointers | Statement | E2 | Codeforces Round 634 (Div. 3) {1335} | PROGRAMMING | 75993 | 2000 | |
| 24932 | Linova and Kingdom | dfs and similar dp greedy sortings trees | Statement | A | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 500.0 | Codeforces Round #635 Editorial | 1700 |
| 4110 | Kaavi and Magic Spell | dp strings | Statement | C | Codeforces Round 635 (Div. 1) {1336} | PROGRAMMING | 1500.0 | Codeforces Round #635 Editorial | 2200 |
| 1142 | Nested Rubber Bands | dfs and similar dp trees | Statement | D | Codeforces Round 633 (Div. 1) {1338} | PROGRAMMING | 2000.0 | Editorial | |
| 34300 | Filling Diamonds | brute force dp | Statement | A | Codeforces Round 633 (Div. 2) {1339} | PROGRAMMING | 500.0 | Codeforces Round #633 Editorial | |
| 8321 | Nastya and Scoreboard | bitmasks dp greedy | Statement | B | Codeforces Round 637 (Div. 1) - Thanks, Ivan Belonogov! {1340} | PROGRAMMING | 750.0 | Codeforces Round #637 Editorial | |
| 993 | Make It Ascending | bitmasks brute force dp | Statement | F | Educational Codeforces Round 86 (Rated for Div. 2) {1342} | PROGRAMMING | 76633 | 2900 | |
| 44372 | Alternating Subsequence | dp greedy two pointers | Statement | C | Codeforces Round 636 (Div. 3) {1343} | PROGRAMMING | 76352 | 1100 | |
| 1981 | Quantifier Question | dfs and similar dp graphs math | Statement | C | Codeforces Round 639 (Div. 1) {1344} | PROGRAMMING | 1500.0 | Codeforces Round #639 Editorial | 2600 |
| 28274 | Card Constructions | binary search brute force dp math | Statement | B | Codeforces Round 639 (Div. 2) {1345} | PROGRAMMING | 1000.0 | Codeforces Round #639 Editorial | 1100 |
| 415 | Magic Tricks | *special dp graphs | Statement | E | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 1700 | |
| 61 | Game with Segments | *special data structures games | Statement | H | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2700 | |
| 54 | Pac-Man 2.0 | *special dp | Statement | I | Kotlin Heroes: Episode 4 {1346} | PROGRAMMING | Kotlin Heroes: Episode 4 — Editorial | 2900 | |
| 2487 | Phoenix and Berries | dp greedy | Statement | E | Codeforces Round 638 (Div. 2) {1348} | PROGRAMMING | 2500.0 | Codeforces Round #638 (Div. 2) Editorial | 2400 |
| 520 | Slime and Sequences (Easy Version) | dp fft math | Statement | F1 | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1750.0 | Codeforces Round #641 Editorial | 3100 |
| 120 | Slime and Hats | constructive algorithms dp greedy | Statement | E | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 2500.0 | Codeforces Round #641 Editorial | 3500 |
| 134 | Slime and Sequences (Hard Version) | dp fft math | Statement | F2 | Codeforces Round 641 (Div. 1) {1349} | PROGRAMMING | 1750.0 | Codeforces Round #641 Editorial | 3500 |
| 29828 | Orac and Models | dp math number theory | Statement | B | Codeforces Round 641 (Div. 2) {1350} | PROGRAMMING | 1000.0 | Codeforces Round #641 Editorial | 1400 |
| 7899 | K-periodic Garland | brute force dp greedy | Statement | E | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 1900 | |
| 3618 | Decreasing Heights | brute force dp | Statement | F | Codeforces Round 642 (Div. 3) {1353} | PROGRAMMING | Codeforces Round #642 (Div. 3) Editorial | 2200 | |
| 35444 | Ternary String | binary search dp implementation two pointers | Statement | B | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1200 | |
| 3780 | Graph Coloring | dfs and similar dp graphs | Statement | E | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2100 | |
| 1487 | Summoning Minions | constructive algorithms dp flows graph matchings greedy sortings | Statement | F | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 2500 | |
| 27433 | Young Explorers | dp greedy sortings | Statement | B | Codeforces Round 643 (Div. 2) {1355} | PROGRAMMING | 750.0 | Codeforces Round #643 (Div. 2) Editorial | 1200 |
| 2454 | Are You Fired? | constructive algorithms data structures dp greedy implementation | Statement | E | Codeforces Round 645 (Div. 2) {1358} | PROGRAMMING | 2000.0 | Codeforces Round #645 (Div. 2) Editorial | 2400 |
| 29445 | New Theatre Square | brute force dp greedy implementation two pointers | Statement | B | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 1000 | |
| 10780 | Yet Another Yet Another Task | data structures dp implementation two pointers | Statement | D | Educational Codeforces Round 88 (Rated for Div. 2) {1359} | PROGRAMMING | Educational Codeforces Round 88 Editorial | 2000 | |
| 28104 | Polygon | dp graphs implementation shortest paths | Statement | E | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1300 | |
| 13568 | Spy-string | bitmasks brute force constructive algorithms dp hashing strings | Statement | F | Codeforces Round 644 (Div. 3) {1360} | PROGRAMMING | Codeforces Round #644 (Div. 3) Editorial | 1700 | |
| 7526 | Tree Shuffling | dfs and similar dp dsu greedy trees | Statement | E | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 2250.0 | 78202 | 2000 |
| 1747 | Rotating Substrings | dp strings | Statement | F | Codeforces Round 646 (Div. 2) {1363} | PROGRAMMING | 3000.0 | 78202 | 2600 |
| 4997 | Ehab's Last Corollary | constructive algorithms data structures dfs and similar dp graphs implementation trees | Statement | D | Codeforces Round 649 (Div. 2) {1364} | PROGRAMMING | 2000.0 | Codeforces round #649 editorial | 2100 |
| 4636 | Two Arrays | binary search brute force combinatorics dp greedy implementation two pointers | Statement | E | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 896 | Jog Around The Graph | binary search dp geometry graphs | Statement | F | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 621 | Construct the String | dp strings | Statement | G | Educational Codeforces Round 89 (Rated for Div. 2) {1366} | PROGRAMMING | Educational Codeforces Round 89 Editorial | ||
| 5907 | Necklace Assembly | binary search brute force dp greedy number theory | Statement | E | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 1878 | Flying Sort (Hard Version) | binary search dp greedy two pointers | Statement | F2 | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 3636 | Flying Sort (Easy Version) | dp greedy two pointers | Statement | F1 | Codeforces Round 650 (Div. 3) {1367} | PROGRAMMING | Codeforces Round #650 (Div. 3) Editorial | ||
| 9248 | TediousLee | dp graphs greedy math matrices trees | Statement | D | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 2000.0 | Codeforces Round #652 (Div. 2) Editorial | 1900 |
| 719 | BareLee | dfs and similar dp games | Statement | F | Codeforces Round 652 (Div. 2) {1369} | PROGRAMMING | 3000.0 | Codeforces Round #652 (Div. 2) Editorial | 2700 |
| 5230 | Binary Subsequence Rotation | binary search data structures dp greedy implementation | Statement | E | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2500.0 | Editorial — Codeforces Round #651 | |
| 10988 | Odd-Even Subsequence | binary search dp greedy implementation sortings | Statement | D | Codeforces Round 651 (Div. 2) {1370} | PROGRAMMING | 2000.0 | Editorial — Codeforces Round #651 | |
| 5731 | Omkar and Circle | brute force constructive algorithms dp games greedy | Statement | D | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 2000.0 | Codeforces Round #655 Editorial | 2100 |
| 1435 | Omkar and Last Floor | dp two pointers | Statement | E | Codeforces Round 655 (Div. 2) {1372} | PROGRAMMING | 2500.0 | Codeforces Round #655 Editorial | 2900 |
| 19407 | Pluses and Minuses | binary search dp greedy implementation math | Statement | C | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 53552 | 01 Game | brute force constructive algorithms dp games implementation strings | Statement | B | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 2963 | Sum of Digits | brute force constructive algorithms dp greedy math number theory | Statement | E | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 17868 | Maximum Sum on Even Positions | data structures dp greedy | Statement | D | Educational Codeforces Round 90 (Rated for Div. 2) {1373} | PROGRAMMING | Educational Codeforces Round 90 Editorial | ||
| 474 | Inverse Genealogy | constructive algorithms divide and conquer dp math trees | Statement | E | Codeforces Round 657 (Div. 2) {1379} | PROGRAMMING | 2500.0 | Codeforces Round #657 Editorial | 2400 |
| 894 | Strange Addition | data structures dp matrices | Statement | F | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 22781 | Create The Teams | dp greedy sortings | Statement | C | Educational Codeforces Round 91 (Rated for Div. 2) {1380} | PROGRAMMING | Educational Codeforces Round 91 Editorial | ||
| 9595 | Unmerge | combinatorics dp two pointers | Statement | B | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 1500.0 | Codeforces Round #658 Editorial | 1800 |
| 826 | The Majestic Brown Tree Snake | dfs and similar dp greedy trees two pointers | Statement | D | Codeforces Round 658 (Div. 1) {1381} | PROGRAMMING | 2500.0 | Codeforces Round #658 Editorial | 3000 |
| 5462 | GameGame | bitmasks constructive algorithms dp games greedy math | Statement | B | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1000.0 | Codeforces Round #659 Editorial | |
| 1033 | Strange Operation | data structures dp | Statement | E | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 2000.0 | Codeforces Round #659 Editorial | |
| 667 | String Transformation 2 | dp graphs trees | Statement | C | Codeforces Round 659 (Div. 1) {1383} | PROGRAMMING | 1750.0 | Codeforces Round #659 Editorial | |
| 4087 | Koa and the Beach (Easy Version) | dp greedy | Statement | B1 | Codeforces Round 659 (Div. 2) {1384} | PROGRAMMING | 500.0 | Codeforces Round #659 Editorial | |
| 22102 | a-Good String | bitmasks brute force divide and conquer dp implementation | Statement | D | Codeforces Round 656 (Div. 3) {1385} | PROGRAMMING | Codeforces Round #656 (Div. 3) Editorial | 1500 | |
| 911 | Graph | *special dfs and similar dp math | Statement | A | Baltic Olympiad in Informatics 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1387} | PROGRAMMING | T | ||
| 10425 | Uncle Bogdan and Country Happiness | dfs and similar dp greedy math trees | Statement | C | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 1500.0 | Codeforces Round #660 Editorial | 1800 |
| 6919 | Captain Flint and Treasure | data structures dfs and similar dp graphs greedy implementation trees | Statement | D | Codeforces Round 660 (Div. 2) {1388} | PROGRAMMING | 2000.0 | Codeforces Round #660 Editorial | 2000 |
| 20631 | Good String | brute force dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 1249 | Bicolored Segments | data structures dp graph matchings greedy sortings | Statement | F | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 496 | Directing Edges | dfs and similar dp graphs greedy trees | Statement | G | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 20574 | Array Walk | dp greedy math | Statement | B | Educational Codeforces Round 92 (Rated for Div. 2) {1389} | PROGRAMMING | 80809 | ||
| 5780 | 505 | bitmasks brute force dp implementation | Statement | D | Codeforces Round 663 (Div. 2) {1391} | PROGRAMMING | 2000.0 | Codeforces Round #663 (Div. 2) Editorial | |
| 680 | Omkar and Pies | bitmasks dfs and similar dp math | Statement | G | Codeforces Global Round 10 {1392} | PROGRAMMING | 3000.0 | Codeforces Global Round 10 — Editorial | |
| 9892 | Omkar and Bed Wars | constructive algorithms dp greedy math strings | Statement | D | Codeforces Global Round 10 {1392} | PROGRAMMING | 1500.0 | Codeforces Global Round 10 — Editorial | |
| 4195 | Rarity and New Dress | data structures dp graphs implementation | Statement | D | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1750.0 | Codeforces Round #662 Editorial | |
| 449 | Twilight and Ancient Scroll (easier version) | dp hashing implementation string suffix structures strings | Statement | E1 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 446 | Twilight and Ancient Scroll (harder version) | dp implementation string suffix structures strings | Statement | E2 | Codeforces Round 662 (Div. 2) {1393} | PROGRAMMING | 1500.0 | Codeforces Round #662 Editorial | |
| 7130 | Boboniu Chats with Du | brute force dp greedy sortings two pointers | Statement | A | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 500.0 | Codeforces Round #664 Editorial | 1800 |
| 1240 | Boboniu and Jianghu | dp greedy sortings trees | Statement | D | Codeforces Round 664 (Div. 1) {1394} | PROGRAMMING | 1750.0 | Codeforces Round #664 Editorial | 2800 |
| 15268 | Boboniu and Bit Operations | bitmasks brute force dp | Statement | C | Codeforces Round 664 (Div. 2) {1395} | PROGRAMMING | 1000.0 | Codeforces Round #664 Editorial | 1600 |
| 2792 | Monster Invaders | dp greedy | Statement | C | Codeforces Round 666 (Div. 1) {1396} | PROGRAMMING | 1750.0 | Codeforces Round #666 — Editorial | |
| 1403 | Controversial Rounds | binary search data structures dp dsu two pointers | Statement | F | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 37218 | Good Subarrays | binary search data structures dp math | Statement | C | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 12582 | Colored Rectangles | dp graph matchings greedy sortings | Statement | D | Educational Codeforces Round 93 (Rated for Div. 2) {1398} | PROGRAMMING | Educational Codeforces Round 93 Editorial | ||
| 1879 | Yet Another Segments Subset | dp sortings | Statement | F | Codeforces Round 661 (Div. 3) {1399} | PROGRAMMING | Codeforces Round #661 (Div. 3) Editorial | ||
| 1183 | x-prime Substrings | bitmasks dp greedy number theory string suffix structures strings | Statement | F | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 11428 | Zigzags | brute force data structures dp math two pointers | Statement | D | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 6348 | Clear the Multiset | divide and conquer dp greedy sortings | Statement | E | Educational Codeforces Round 94 (Rated for Div. 2) {1400} | PROGRAMMING | 81942 | ||
| 236 | Star Trek | *special combinatorics dfs and similar dp games graphs matrices trees | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 1358 | Fancy Fence | *special data structures dp dsu math sortings | Statement | A | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 133 | Roads | *special geometry sortings | Statement | B | Central-European Olympiad in Informatics, CEOI 2020, Day 1 (IOI, Unofficial Mirror Contest, Unrated) {1402} | PROGRAMMING | Editorial | ||
| 75 | Chess Rush | *special combinatorics dp implementation math | Statement | C | Central-European Olympiad in Informatics, CEOI 2020, Day 2 (IOI, Unofficial Mirror Contest, Unrated) {1403} | PROGRAMMING | CEOI 2020 Online Mirror — Day 2 Tutorial | ||
| 8229 | Tree Tag | dfs and similar dp games trees | Statement | B | Codeforces Round 668 (Div. 1) {1404} | PROGRAMMING | 1000.0 | Codeforces Round #668 Editorial | |
| 24526 | Maximum Product | brute force dp greedy implementation sortings | Statement | B | Codeforces Round 670 (Div. 2) {1406} | PROGRAMMING | 1000.0 | Codeforces Round #670 (Div. 2) Editorial | |
| 5804 | Discrete Centrifugal Jumps | binary search data structures dp greedy | Statement | D | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2000.0 | Codeforces Round #669 Editorial | |
| 1911 | Egor in the Republic of Dagestan | constructive algorithms dfs and similar dp graphs greedy shortest paths | Statement | E | Codeforces Round 669 (Div. 2) {1407} | PROGRAMMING | 2500.0 | Codeforces Round #669 Editorial | |
| 4690 | Searchlights | binary search brute force data structures dp geometry implementation sortings | Statement | D | Grakn Forces 2020 {1408} | PROGRAMMING | 2000.0 | Grakn Forces -- Editorial | |
| 1342 | Clusterization Counting | combinatorics dp dsu fft graphs | Statement | G | Grakn Forces 2020 {1408} | PROGRAMMING | 3000.0 | Grakn Forces -- Editorial | |
| 201 | Bitwise Magic | dp math | Statement | I | Grakn Forces 2020 {1408} | PROGRAMMING | 3750.0 | Grakn Forces -- Editorial | |
| 8483 | Two Platforms | binary search dp sortings two pointers | Statement | E | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 5185 | Subsequences of Length Two | dp greedy | Statement | F | Codeforces Round 667 (Div. 3) {1409} | PROGRAMMING | Codeforces Round #667 (Div. 3) Editorial | ||
| 6274 | Perform Easily | data structures dp implementation sortings two pointers | Statement | C | Technocup 2021 - Elimination Round 1 {1413} | PROGRAMMING | 1500.0 | Codeforces Round 679 (Div. 1, Div. 2) and Technocup Round 1 editorial | |
| 11748 | Bouncing Ball | brute force dp implementation | Statement | C | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 566 | Cakes for Clones | dp | Statement | F | Technocup 2021 - Elimination Round 2 {1415} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 434 | Split | data structures dp greedy | Statement | E | Codeforces Round 673 (Div. 1) {1416} | PROGRAMMING | 2250.0 | Codeforces Round #673 Editorial | 3200 |
| 28731 | Mortal Kombat Tower | dp greedy | Statement | C | Educational Codeforces Round 95 (Rated for Div. 2) {1418} | PROGRAMMING | Unofficial Editorial for Educational Round 95 (Div. 2) | ||
| 1047 | Battle Lemmings | brute force dp geometry | Statement | E | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 3000.0 | Editorial | |
| 19049 | Pokémon Army (easy version) | constructive algorithms dp greedy | Statement | C1 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1000.0 | Editorial | |
| 5200 | Pokémon Army (hard version) | data structures divide and conquer dp greedy implementation | Statement | C2 | Codeforces Round 672 (Div. 2) {1420} | PROGRAMMING | 1250.0 | ||
| 974 | Swedish Heroes | brute force dp implementation | Statement | E | Codeforces Round 676 (Div. 2) {1421} | PROGRAMMING | 2500.0 | Codeforces Round #676 (Div. 2) Editorial | |
| 856 | Minlexes | dp greedy implementation strings | Statement | E | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 2000.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 8854 | Bargain | dp math probabilities | Statement | C | Codeforces Round 675 (Div. 2) {1422} | PROGRAMMING | 1000.0 | Codeforces Round #675 (Div. 2) Editorial | |
| 893 | Bubble Cup hypothesis | constructive algorithms dp math | Statement | J | Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 1] {1423} | PROGRAMMING | FinalsEditorial2020.pdf | ||
| 902 | Danger of Mad Snakes | combinatorics dp math | Statement | D | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 2300 | |
| 361 | Blue and Red of Our Faculty! | dp | Statement | B | 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1425} | PROGRAMMING | Tutorial | 2600 | |
| 6192 | Number of Subsequences | combinatorics dp strings | Statement | F | Codeforces Round 674 (Div. 3) {1426} | PROGRAMMING | 83120 | 2000 | |
| 6095 | The Hard Work of Paparazzi | brute force dp | Statement | C | Codeforces Global Round 11 {1427} | PROGRAMMING | 1000.0 | Editorial of Global Round 11 | 2000 |
| 2614 | Fruit Sequences | binary search data structures divide and conquer dp | Statement | F | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 1750.0 | Codeforces Raif Round 1 Editorial | |
| 659 | Lucky Numbers (Easy Version) | dp greedy | Statement | G1 | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 2250.0 | Codeforces Raif Round 1 Editorial | |
| 742 | Lucky Numbers (Hard Version) | dp greedy | Statement | G2 | Codeforces Raif Round 1 (Div. 1 + Div. 2) {1428} | PROGRAMMING | 750.0 | Codeforces Raif Round 1 Editorial | |
| 878 | Yet Another DAG Problem | bitmasks dp flows math | Statement | G | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 21854 | Number of Apartments | brute force dp math | Statement | A | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 1044 | Realistic Gameplay | dp greedy | Statement | F | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 51 | Zero-XOR Array | *special dp | Statement | J | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 204 | Number Deletion Game | *special dp games greedy | Statement | G | Kotlin Heroes 5: ICPC Round {1431} | PROGRAMMING | 84563 | ||
| 6781 | Zero Remainder Sum | dp | Statement | F | Codeforces Round 677 (Div. 3) {1433} | PROGRAMMING | Codeforces Round #677 (Div. 3) Editorial | ||
| 1626 | Emotional Fishermen | combinatorics dp math | Statement | F | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 3963 | Make It Increasing | data structures dp implementation | Statement | E | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 12255 | Chef Monocarp | dp flows graph matchings greedy | Statement | C | Educational Codeforces Round 97 (Rated for Div. 2) {1437} | PROGRAMMING | 84149 | ||
| 477 | INOI Final Contests | combinatorics dp | Statement | D | Codeforces Round 684 (Div. 1) {1439} | PROGRAMMING | 2500.0 | Codeforces Round #684[Div1 and Div2] Editorial | |
| 2938 | Sum | data structures divide and conquer dp greedy | Statement | D | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1750.0 | 84298 | |
| 9750 | Extreme Subtraction | dp greedy | Statement | A | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 500.0 | 84298 | |
| 801 | Black, White and Grey Tree | dp trees | Statement | E | Codeforces Round 681 (Div. 1, based on VK Cup 2019-2020 - Final) {1442} | PROGRAMMING | 1750.0 | 84298 | |
| 169 | Finding the Vertex | brute force dfs and similar dp interactive trees | Statement | E | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 3000.0 | Codeforces Round #680 Editorial | |
| 647 | Rectangular Polyline | constructive algorithms dp geometry | Statement | D | Codeforces Round 680 (Div. 1, based on Moscow Team Olympiad) {1444} | PROGRAMMING | 2000.0 | Codeforces Round #680 Editorial | |
| 4101 | Xor Tree | binary search bitmasks data structures divide and conquer dp trees | Statement | C | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1250.0 | E | |
| 9124 | Catching Cheaters | dp strings | Statement | B | Codeforces Round 683 (Div. 1, by Meet IT) {1446} | PROGRAMMING | 1000.0 | E | |
| 351 | Communism | bitmasks dp trees | Statement | G | Codeforces Global Round 12 {1450} | PROGRAMMING | 3750.0 | Codeforces Global Round 12 Editorial | |
| 17326 | String Equality | dp greedy hashing implementation strings | Statement | C | Codeforces Round 685 (Div. 2) {1451} | PROGRAMMING | 1250.0 | Editorial — Codeforces Round #685 | |
| 552 | Game On Tree | Statement | G | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | |||
| 8707 | Radio Towers | combinatorics dp math | Statement | D | Educational Codeforces Round 98 (Rated for Div. 2) {1452} | PROGRAMMING | 84847 | ||
| 2231 | Dog Snacks | binary search dfs and similar dp greedy trees | Statement | E | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 2500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 998 | Even Harder | dp | Statement | F | Codeforces Round 688 (Div. 2) {1453} | PROGRAMMING | 3500.0 | Codeforces Round #688 (Div. 2) Editorial | |
| 520 | String and Operations | dp greedy | Statement | F | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 13232 | Sequence and Swaps | dp greedy sortings | Statement | D | Educational Codeforces Round 99 (Rated for Div. 2) {1455} | PROGRAMMING | 85186 | ||
| 388 | XOR-ranges | dp | Statement | E | Codeforces Round 687 (Div. 1, based on Technocup 2021 Elimination Round 2) {1456} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 687 (Technocup 2021 — Elimitation Round 2) | |
| 451 | Range Diameter Sum | Statement | F | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 3500.0 | Codeforces Round #691 Editorial (finished) | ||
| 4114 | Glass Half Spilled | dp | Statement | B | Codeforces Round 691 (Div. 1) {1458} | PROGRAMMING | 1000.0 | Codeforces Round #691 Editorial (finished) | |
| 21188 | Move and Turn | dp math | Statement | B | Codeforces Round 691 (Div. 2) {1459} | PROGRAMMING | 1000.0 | Codeforces Round #691 Editorial (finished) | |
| 13302 | Find the Spruce | brute force dp | Statement | B | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 1000.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 611 | Mathematical Expression | constructive algorithms dp greedy | Statement | F | Codeforces Round 689 (Div. 2, based on Zed Code Competition) {1461} | PROGRAMMING | 2750.0 | Codeforces Round #689 (Div. 2). Editorial | |
| 36620 | Unique Number | dp greedy math | Statement | C | Codeforces Round 690 (Div. 3) {1462} | PROGRAMMING | Codeforces Round #690 (Div. 3) Editorial | ||
| 742 | Max Correct Set | bitmasks dp | Statement | F | Educational Codeforces Round 100 (Rated for Div. 2) {1463} | PROGRAMMING | Educational Codeforces Round 100 Editorial | ||
| 490 | Finding satisfactory solutions | dp graphs greedy math | Statement | H | Good Bye 2020 {1466} | PROGRAMMING | 3500.0 | Good Bye 2020 Editorial | |
| 18850 | Canine poetry | dp greedy strings | Statement | C | Good Bye 2020 {1466} | PROGRAMMING | 1000.0 | Good Bye 2020 Editorial | |
| 4033 | Sum of Paths | combinatorics dp math | Statement | D | Codeforces Round 695 (Div. 2) {1467} | PROGRAMMING | 1750.0 | Codeforces Round #695 (Div. 2) Editorial | 2200 |
| 1953 | LaIS | data structures dp greedy | Statement | A | 2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules) {1468} | PROGRAMMING | Tutorial (PDF) | ||
| 11711 | Building a Fence | dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 101 (Rated for Div. 2) {1469} | PROGRAMMING | Educational Codeforces Round 101 Editorial | ||
| 375 | Strange Permutation | binary search combinatorics data structures dp two pointers | Statement | E | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 2000.0 | 86464 | |
| 29749 | Strange Birthday Party | dp greedy sortings two pointers | Statement | A | Codeforces Round 694 (Div. 1) {1470} | PROGRAMMING | 500.0 | 86464 | |
| 3299 | New Year's Puzzle | brute force dp graph matchings greedy sortings | Statement | F | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 5691 | Moving to the Capital | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 30722 | Even-Odd Game | dp games greedy sortings | Statement | D | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 35554 | Long Jumps | dp graphs | Statement | C | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 60232 | Fair Division | dp greedy | Statement | B | Codeforces Round 693 (Div. 3) {1472} | PROGRAMMING | Codeforces Round #693 (Div. 3) Editorial | ||
| 455 | Tiles | combinatorics dp fft math | Statement | G | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 11002 | Program | data structures dp implementation | Statement | D | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 4786 | Minimum Path | dp graphs implementation shortest paths | Statement | E | Educational Codeforces Round 102 (Rated for Div. 2) {1473} | PROGRAMMING | Educational Codeforces Round 102 Editorial | ||
| 4323 | Cleaning | data structures dp greedy implementation | Statement | D | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 2000.0 | Codeforces Round #696 Editorial | |
| 324 | 1 2 3 4 ... | dp matrices | Statement | F | Codeforces Round 696 (Div. 2) {1474} | PROGRAMMING | 3000.0 | Codeforces Round #696 Editorial | |
| 11225 | Cleaning the Phone | binary search dp greedy sortings two pointers | Statement | D | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 57596 | New Year's Number | brute force dp math | Statement | B | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 7877 | Strange Beauty | dfs and similar dp math number theory | Statement | G | Codeforces Round 697 (Div. 3) {1475} | PROGRAMMING | Codeforces Round #697 (Div. 3) Editorial | ||
| 12326 | Longest Simple Cycle | constructive algorithms dp graphs greedy | Statement | C | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 1164 | Lanterns | data structures dp | Statement | F | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 9256 | Journey | dfs and similar dp dsu implementation two pointers | Statement | D | Educational Codeforces Round 103 (Rated for Div. 2) {1476} | PROGRAMMING | 87356 | ||
| 19027 | Nezzar and Lucky Number | brute force dp math | Statement | B | Codeforces Round 698 (Div. 2) {1478} | PROGRAMMING | 1000.0 | Tutorial | 1100 |
| 7481 | Painting the Array I | constructive algorithms data structures dp greedy implementation | Statement | B1 | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #700 | |
| 4443 | Painting the Array II | data structures dp greedy implementation | Statement | B2 | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 750.0 | Editorial of Codeforces Round #700 | |
| 266 | School Clubs | dp fft math number theory probabilities | Statement | E | Codeforces Round 700 (Div. 1) {1479} | PROGRAMMING | 4000.0 | Editorial of Codeforces Round #700 | |
| 2424 | Sorting Books | data structures dp greedy | Statement | E | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 2500.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 739 | AB Tree | dp greedy trees | Statement | F | Codeforces Round 699 (Div. 2) {1481} | PROGRAMMING | 3000.0 | Codeforces Round #699 (Div. 2) Editorial | |
| 3783 | Skyline Photo | data structures dp | Statement | E | Технокубок 2021 - Финал {1482} | PROGRAMMING | 2500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 919 | Skyline Photo | data structures dp | Statement | C | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 1500.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 497 | Useful Edges | dp graphs shortest paths | Statement | D | Codeforces Round 709 (Div. 1, based on Technocup 2021 Final Round) {1483} | PROGRAMMING | 1750.0 | Technocup 2021: Final Round and Codeforces Round #709 — tutorial | |
| 17954 | Replace and Keep Sorted | dp implementation math | Statement | B | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #701 (Div. 2) | 1200 |
| 2341 | Copy or Prefix Sum | combinatorics data structures dp sortings | Statement | F | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #701 (Div. 2) | 2400 |
| 1534 | Move and Swap | dp greedy trees | Statement | E | Codeforces Round 701 (Div. 2) {1485} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #701 (Div. 2) | 2500 |
| 3382 | Paired Payment | binary search constructive algorithms dp graphs shortest paths | Statement | E | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 2250.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 9868 | Max Median | binary search data structures dp two pointers | Statement | D | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 1750.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 812 | Pairs of Paths | combinatorics data structures trees | Statement | F | Codeforces Round 703 (Div. 2) {1486} | PROGRAMMING | 3000.0 | Codeforces Round #703 (Div. 2) Editorial | |
| 711 | String Counting | combinatorics dp math | Statement | G | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 5147 | Cheap Dinner | data structures dp implementation sortings two pointers | Statement | E | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 503 | Ones | dp greedy | Statement | F | Educational Codeforces Round 104 (Rated for Div. 2) {1487} | PROGRAMMING | 87873 | ||
| 232 | Palindromic Doubles | *special data structures dp | Statement | E | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 8411 | Pekora and Trampoline | brute force data structures dp graphs greedy implementation | Statement | C | Codeforces Global Round 13 {1491} | PROGRAMMING | 1000.0 | Codeforces Global Round 13 Editorial | |
| 17562 | Maximum width | data structures dp greedy two pointers | Statement | C | Codeforces Round 704 (Div. 2) {1492} | PROGRAMMING | 1500.0 | Codeforces Round #704 Editorial | |
| 497 | Delete The Edges | graphs | Statement | F | Educational Codeforces Round 105 (Rated for Div. 2) {1494} | PROGRAMMING | Educational Codeforces Round 105 Editorial | ||
| 9134 | Square-free division (easy version) | data structures dp greedy math number theory | Statement | E1 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 1700 |
| 1743 | Genius | bitmasks dp graphs | Statement | D | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1750.0 | Codeforces Round #708 Editorial | 2500 |
| 1920 | Square-free division (hard version) | data structures dp greedy hashing math number theory | Statement | E2 | Codeforces Round 708 (Div. 2) {1497} | PROGRAMMING | 1500.0 | Codeforces Round #708 Editorial | 2500 |
| 12255 | Planar Reflections | brute force combinatorics data structures dp | Statement | C | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 1750.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 1062 | Christmas Game | data structures dfs and similar dp games math trees | Statement | F | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 3000.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 2506 | Bananas in a Microwave | dfs and similar dp greedy shortest paths | Statement | D | CodeCraft-21 and Codeforces Round 711 (Div. 2) {1498} | PROGRAMMING | 2500.0 | CodeCraft-21 and Codeforces Round #711 (Div. 2) Editorial | |
| 13462 | Minimum Grid Path | brute force data structures dp greedy | Statement | C | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 22045 | Binary Removals | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 1668 | Chaotic Merge | combinatorics dp | Statement | E | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 1606 | Diameter Cuts | dfs and similar dp trees | Statement | F | Educational Codeforces Round 106 (Rated for Div. 2) {1499} | PROGRAMMING | Educational Codeforces Round 106 Editorial | ||
| 435 | Cupboards Jumps | dp | Statement | F | Codeforces Round 707 (Div. 1, based on Moscow Open Olympiad in Informatics) {1500} | PROGRAMMING | 3000.0 | Codeforces Round #707 Editorial | 3500 |
| 21180 | Napoleon Cake | dp implementation sortings | Statement | B | Codeforces Round 707 (Div. 2, based on Moscow Open Olympiad in Informatics) {1501} | PROGRAMMING | 1000.0 | Codeforces Round #707 Editorial | 900 |
| 3861 | Travelling Salesman Problem | binary search data structures dp greedy shortest paths sortings | Statement | C | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 1250.0 | T | 2200 |
| 892 | 2-Coloring | combinatorics dp math | Statement | E | Codeforces Round 712 (Div. 1) {1503} | PROGRAMMING | 2500.0 | T | 3100 |
| 4843 | Maximize the Remaining String | brute force data structures dp greedy strings two pointers | Statement | G | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 36186 | Double-ended Strings | brute force dp hashing strings | Statement | C | Codeforces Round 710 (Div. 3) {1506} | PROGRAMMING | Editorial | ||
| 4465 | Almost Sorted | binary search bitmasks combinatorics constructive algorithms dp implementation math | Statement | B | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 1000.0 | Codeforces Round #715 Editorial | |
| 733 | Swap Pass | constructive algorithms geometry sortings | Statement | D | Codeforces Round 715 (Div. 1) {1508} | PROGRAMMING | 2250.0 | Codeforces Round #715 Editorial | |
| 15447 | The Sports Festival | dp greedy | Statement | C | Codeforces Round 715 (Div. 2) {1509} | PROGRAMMING | 1500.0 | Codeforces Round #715 Editorial | |
| 2121 | Digits | brute force dp math number theory | Statement | D | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 139 | Hard Optimization | dp | Statement | H | 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1510} | PROGRAMMING | nerc-2020-offline-tutorial.pdf | ||
| 2904 | Colorings and Dominoes | combinatorics dp math | Statement | E | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 546 | Chainword | data structures dp math matrices strings | Statement | F | Educational Codeforces Round 107 (Rated for Div. 2) {1511} | PROGRAMMING | 89634 | ||
| 9556 | Short Task | brute force dp math number theory | Statement | G | Codeforces Round 713 (Div. 3) {1512} | PROGRAMMING | Codeforces Round #713 (Div. 3) Editorial | ||
| 16626 | Add One | dp matrices | Statement | C | Divide by Zero 2021 and Codeforces Round 714 (Div. 2) {1513} | PROGRAMMING | 1500.0 | Divide by Zero 2021 and Codeforces Round #714 (Div. 2) Editorial | |
| 4514 | Phoenix and Computers | combinatorics dp math | Statement | E | Codeforces Global Round 14 {1515} | PROGRAMMING | 2750.0 | Editorial | |
| 5226 | Cut | binary search data structures graphs number theory | Statement | D | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 2000.0 | Codeforces round #717 editorial | |
| 25890 | AGAGA XOOORRR | bitmasks brute force dp greedy | Statement | B | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 1000.0 | Codeforces round #717 editorial | |
| 14212 | Baby Ehab Partitions Again | bitmasks constructive algorithms dp math | Statement | C | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 1500.0 | Codeforces round #717 editorial | |
| 1012 | Baby Ehab Plays with Permutations | combinatorics dp math | Statement | E | Codeforces Round 717 (Div. 2) {1516} | PROGRAMMING | 2750.0 | Codeforces round #717 editorial | |
| 89 | Fly Around the World | dp dp dp dp geometry geometry | Statement | H | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 4000.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 9300 | Explorer Space | dp graphs shortest paths | Statement | D | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 1750.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 605 | Reunion | dp trees | Statement | F | Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) {1517} | PROGRAMMING | 3000.0 | Contest 2050 and Codeforces Round #718 (Div.1 + Div.2) Editorial | |
| 17695 | Maximum Sum of Products | brute force dp implementation math ternary search two pointers | Statement | D | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 683 | Chests and Keys | dp flows | Statement | F | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 33467 | The Cake Is a Lie | dp math | Statement | B | Educational Codeforces Round 108 (Rated for Div. 2) {1519} | PROGRAMMING | Educational Codeforces Round 108 Editorial | ||
| 28986 | Arranging The Sheep | dp greedy math | Statement | E | Codeforces Round 719 (Div. 3) {1520} | PROGRAMMING | Editorial | ||
| 2315 | Nastia Plays with a Tree | constructive algorithms data structures dfs and similar dp flows graphs greedy implementation trees | Statement | D | Codeforces Round 720 (Div. 2) {1521} | PROGRAMMING | 2250.0 | 90477 | |
| 2491 | Love-Hate | bitmasks brute force dp probabilities | Statement | D | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 2250.0 | Deltix Round, Spring 2021. Editorial | 2400 |
| 1946 | Crypto Lights | combinatorics dp probabilities | Statement | E | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 2250.0 | Deltix Round, Spring 2021. Editorial | 2600 |
| 485 | Favorite Game | dp | Statement | F | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 3000.0 | Deltix Round, Spring 2021. Editorial | 3300 |
| 445 | Hopping Around the Array | data structures dp | Statement | H | Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2) {1523} | PROGRAMMING | 3250.0 | Deltix Round, Spring 2021. Editorial | 3500 |
| 402 | Goblins And Gnomes | brute force dp graph matchings | Statement | F | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 10889 | Armchairs | brute force dp greedy | Statement | D | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 2459 | Assimilation IV | combinatorics dp math probabilities | Statement | E | Educational Codeforces Round 109 (Rated for Div. 2) {1525} | PROGRAMMING | 90793 | ||
| 27392 | Potions (Easy Version) | brute force data structures dp greedy | Statement | C1 | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 750.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 37014 | I Hate 1111 | dp math number theory | Statement | B | Codeforces Round 723 (Div. 2) {1526} | PROGRAMMING | 1000.0 | Codeforces Round #723 (Div. 2) Editorial | |
| 34922 | Palindrome Game (easy version) | dp games | Statement | B1 | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 750.0 | Tutorial | 1200 |
| 8742 | Palindrome Game (hard version) | dp games | Statement | B2 | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 1500.0 | Tutorial | 1900 |
| 2936 | Partition Game | binary search data structures divide and conquer dp | Statement | E | Codeforces Round 721 (Div. 2) {1527} | PROGRAMMING | 3000.0 | Tutorial | 2500 |