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 ... 5 6 7 8 9 10 11 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 11114 | Kavi on Pairing Duty | 2-sat dp | Statement | B | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 1000.0 | Codeforces Round #722 Editorial | |
| 20284 | Parsa's Humongous Tree | brute force dfs and similar dp greedy trees | Statement | A | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 750.0 | Codeforces Round #722 Editorial | |
| 650 | Mashtali and Hagh Trees | combinatorics dp trees | Statement | E | Codeforces Round 722 (Div. 1) {1528} | PROGRAMMING | 2750.0 | Codeforces Round #722 Editorial | |
| 1214 | Bingo | bitmasks dp probabilities | Statement | F | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 2750.0 | Codeforces Round #733 Editorial (all problems) | |
| 210 | Turing's Award | data structures dp | Statement | H | Codeforces Round 733 (Div. 1 + Div. 2, based on VK Cup 2021 - Elimination (Engine)) {1530} | PROGRAMMING | 4750.0 | Codeforces Round #733 Editorial (all problems) | |
| 92 | Submatrices | *special bitmasks data structures dp | Statement | H | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial | ||
| 14083 | Little Alawn's Puzzle | combinatorics dfs and similar dp dsu graphs math | Statement | C | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 1111 | A New Beginning | constructive algorithms dp | Statement | G | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 3250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 2123 | Lost Array | constructive algorithms dp graphs interactive shortest paths | Statement | E | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 2250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 844 | Falling Sand (Hard Version) | dfs and similar dp graphs greedy | Statement | F2 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 1250.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 423 | Lost Nodes | dp graphs interactive sortings trees | Statement | H | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) {1534} | PROGRAMMING | 3500.0 | Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial | |
| 18092 | Unstable String | dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 16493 | Diluc and Kaeya | dp hashing number theory | Statement | C | Codeforces Round 724 (Div. 2) {1536} | PROGRAMMING | 1500.0 | Codeforces Round #724 — Editorial | 1500 |
| 17196 | Erase and Extend (Easy Version) | binary search brute force dp greedy hashing string suffix structures strings | Statement | E1 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1250.0 | Codeforces Round #726 (Div.2) Editorial | |
| 22812 | Interesting Function | binary search dp math | Statement | F | Codeforces Round 725 (Div. 3) {1538} | PROGRAMMING | Codeforces Round #725 (Div. 3) Editorial | ||
| 1119 | Game with Cards | binary search constructive algorithms data structures dp implementation | Statement | E | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 2000.0 | tutorial | 2500 |
| 27044 | Love Song | dp implementation strings | Statement | B | Codeforces Round 727 (Div. 2) {1539} | PROGRAMMING | 750.0 | tutorial | 800 |
| 3111 | Tree Array | brute force combinatorics dp math probabilities trees | Statement | B | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 1250.0 | Tutorial | |
| 816 | Converging Array (Easy Version) | dp math | Statement | C1 | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 1500.0 | Tutorial | |
| 604 | Converging Array (Hard Version) | dp math | Statement | C2 | Codeforces Round 728 (Div. 1) {1540} | PROGRAMMING | 750.0 | Tutorial | |
| 1506 | Abnormal Permutation Pairs (easy version) | combinatorics dp fft math | Statement | E1 | Codeforces Round 729 (Div. 2) {1542} | PROGRAMMING | 2000.0 | ||
| 3055 | Priority Queue | combinatorics dp implementation math | Statement | D | Codeforces Round 729 (Div. 2) {1542} | PROGRAMMING | 2000.0 | ||
| 1105 | Abnormal Permutation Pairs (hard version) | combinatorics dp math | Statement | E2 | Codeforces Round 729 (Div. 2) {1542} | PROGRAMMING | 1000.0 | ||
| 2215 | RPD and Rap Sheet (Hard Version) | constructive algorithms dp interactive math | Statement | D2 | Codeforces Round 730 (Div. 2) {1543} | PROGRAMMING | 1250.0 | Codeforces Round #730 (Div. 2) Editorial | |
| 149 | AquaMoon and Potatoes | brute force data structures dp | Statement | F | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 4000.0 | Codeforces Round #732 Editorial | 3500 |
| 107 | AquaMoon and Time Stop (easy version) | data structures data structures dp dp | Statement | E1 | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 2000.0 | Codeforces Round #732 Editorial | 3500 |
| 107 | AquaMoon and Time Stop (hard version) | data structures dp | Statement | E2 | Codeforces Round 732 (Div. 1) {1545} | PROGRAMMING | 2000.0 | Codeforces Round #732 Editorial | 3500 |
| 3764 | How Many Paths? | dfs and similar dp graphs trees | Statement | G | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 16774 | Air Conditioners | dfs and similar dp implementation shortest paths sortings two pointers | Statement | E | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 24785 | Pair Programming | dp greedy two pointers | Statement | C | Codeforces Round 731 (Div. 3) {1547} | PROGRAMMING | Codeforces Round #731 (Div. 3) Editorial | ||
| 2295 | The Three Little Pigs | combinatorics dp fft math | Statement | C | Codeforces Round 736 (Div. 1) {1548} | PROGRAMMING | 1750.0 | Codeforces Round 736 Editorial | |
| 1974 | Stringforces | binary search bitmasks data structures dp greedy strings two pointers | Statement | E | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 980 | Jumping Around | data structures divide and conquer dp dsu graphs shortest paths trees | Statement | F | Educational Codeforces Round 111 (Rated for Div. 2) {1550} | PROGRAMMING | Educational Codeforces Round 111 Editorial | ||
| 4661 | Fixed Points | brute force dp | Statement | E | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 2259 | Equidistant Vertices | combinatorics dfs and similar dp trees | Statement | F | Codeforces Round 734 (Div. 3) {1551} | PROGRAMMING | Editorial for Codeforces Round #734 (Div.3) | ||
| 3431 | Telepanting | binary search data structures dp sortings | Statement | F | Codeforces Global Round 15 {1552} | PROGRAMMING | 1500.0 | Editorial of Global Round 15 | |
| 8033 | Array Differentiation | bitmasks dp graphs math | Statement | D | Codeforces Global Round 15 {1552} | PROGRAMMING | 1000.0 | Editorial of Global Round 15 | |
| 6345 | Maximize the Intersections | combinatorics constructive algorithms geometry greedy | Statement | C | Codeforces Global Round 15 {1552} | PROGRAMMING | 1000.0 | Editorial of Global Round 15 | |
| 925 | XOR and Distance | bitmasks divide and conquer dp trees | Statement | H | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 3750.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 20151 | Penalty | brute force dp greedy | Statement | C | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 750.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 15636 | Reverse String | brute force dp hashing strings | Statement | B | Harbour.Space Scholarship Contest 2021-2022 (open for everyone, rated, Div. 1 + Div. 2) {1553} | PROGRAMMING | 500.0 | Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) Editorial | |
| 1454 | You | dfs and similar dp math number theory | Statement | E | Codeforces Round 735 (Div. 2) {1554} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #735 (Div. 2) | 2600 |
| 24629 | Coin Rows | brute force constructive algorithms dp implementation | Statement | C | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 1300 | |
| 16278 | Say No to Palindromes | brute force dp strings | Statement | D | Educational Codeforces Round 112 (Rated for Div. 2) {1555} | PROGRAMMING | 93389 | 1600 | |
| 1481 | Sports Betting | bitmasks combinatorics dp graphs math probabilities | Statement | F | Deltix Round, Summer 2021 (open for everyone, rated, Div. 1 + Div. 2) {1556} | PROGRAMMING | 2500.0 | 94384 | 2500 |
| 11092 | Moamen and XOR | bitmasks combinatorics dp math | Statement | C | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 1750.0 | Codeforces Round #737 Editorial | |
| 3174 | Ezzat and Grid | data structures dp graphs greedy | Statement | D | Codeforces Round 737 (Div. 2) {1557} | PROGRAMMING | 2500.0 | Codeforces Round #737 Editorial | |
| 5400 | Up the Strip | brute force dp math number theory | Statement | B | Codeforces Round 740 (Div. 1, based on VK Cup 2021 - Final (Engine)) {1558} | PROGRAMMING | 1250.0 | Codeforces Round #740 Editorial | 1900 |
| 2836 | Mocha and Stars | combinatorics dp fft math number theory | Statement | E | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 3000.0 | Tutorial (en) | 2200 |
| 24513 | Mocha and Red and Blue | dp greedy | Statement | B | Codeforces Round 738 (Div. 2) {1559} | PROGRAMMING | 750.0 | Tutorial (en) | 900 |
| 5138 | Nearest Beautiful Number (hard version) | bitmasks brute force constructive algorithms dfs and similar dp greedy | Statement | F2 | Codeforces Round 739 (Div. 3) {1560} | PROGRAMMING | 94009 | 2100 | |
| 6219 | Up the Strip (simplified version) | brute force data structures dp math number theory | Statement | D1 | Codeforces Round 740 (Div. 2, based on VK Cup 2021 - Final (Engine)) {1561} | PROGRAMMING | 1500.0 | Codeforces Round #740 Editorial | 1700 |
| 2308 | Two Hundred Twenty One (hard version) | binary search constructive algorithms data structures dp math | Statement | D2 | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 6712 | Two Hundred Twenty One (easy version) | constructive algorithms dp math | Statement | D1 | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 1666 | Rescue Niwen! | dp string suffix structures strings | Statement | E | Codeforces Round 741 (Div. 2) {1562} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round 741 (Div. 2) | |
| 21601 | MIN-MEX Cut | bitmasks constructive algorithms dp | Statement | B | Codeforces Global Round 16 {1566} | PROGRAMMING | 750.0 | Codeforces Global Round 16 Editorial | |
| 19286 | MAX-MEX Cut | bitmasks constructive algorithms dp greedy | Statement | C | Codeforces Global Round 16 {1566} | PROGRAMMING | 1000.0 | Codeforces Global Round 16 Editorial | |
| 187 | Xor-quiz | constructive algorithms dp interactive math number theory | Statement | H | Codeforces Global Round 16 {1566} | PROGRAMMING | 3750.0 | Codeforces Global Round 16 Editorial | |
| 1289 | Points Movement | data structures dp | Statement | F | Codeforces Global Round 16 {1566} | PROGRAMMING | 2500.0 | Codeforces Global Round 16 Editorial | |
| 13370 | Carrying Conundrum | bitmasks combinatorics dp | Statement | C | Codeforces Round 742 (Div. 2) {1567} | PROGRAMMING | 1500.0 | Codeforces Round #742 Editorial | |
| 530 | Palindromic Hamiltonian Path | brute force dp graphs | Statement | F | Educational Codeforces Round 113 (Rated for Div. 2) {1569} | PROGRAMMING | 94721 | ||
| 377 | Fix the String | *special bitmasks dp greedy | Statement | E | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 231 | Kotlinforces | *special constructive algorithms dp | Statement | F | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 89 | A Battle Against a Dragon | *special data structures dp | Statement | G | Kotlin Heroes: Episode 8 {1571} | PROGRAMMING | Kotlin Heroes 8 Editorial | ||
| 10787 | Book | binary search data structures dp graphs implementation | Statement | A | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 500.0 | Tutorial | 1800 |
| 1793 | Paint | dp greedy | Statement | C | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 1750.0 | Tutorial | 2700 |
| 389 | Polygon | binary search dp | Statement | E | Codeforces Round 743 (Div. 1) {1572} | PROGRAMMING | 2500.0 | Tutorial | 3000 |
| 799 | Occurrences | combinatorics dp dsu fft graphs | Statement | F | Educational Codeforces Round 114 (Rated for Div. 2) {1574} | PROGRAMMING | 95188 | ||
| 2927 | Divisible by Twenty-Five | brute force dfs and similar dp | Statement | D | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 1786 | Longest Array Deconstruction | data structures divide and conquer dp sortings | Statement | L | COMPFEST 13 - Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1575} | PROGRAMMING | COMPFEST 13 — Editorial | ||
| 2836 | Minimal Coverage | binary search dp greedy | Statement | G | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 11798 | Ticks | brute force dp greedy implementation | Statement | C | Codeforces Round 744 (Div. 3) {1579} | PROGRAMMING | Codeforces Round #744 (Div. 3) Editorial | ||
| 3956 | Portal | brute force dp greedy implementation | Statement | A | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 500.0 | Codeforces Round #745 Editorial | 1700 |
| 1377 | Mathematics Curriculum | combinatorics dp trees | Statement | B | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 2600 |
| 1193 | Subsequence | divide and conquer dp trees | Statement | D | Codeforces Round 745 (Div. 1) {1580} | PROGRAMMING | 2000.0 | Codeforces Round #745 Editorial | 2900 |
| 12704 | Diameter of Graph | constructive algorithms graphs greedy math | Statement | B | Codeforces Round 745 (Div. 2) {1581} | PROGRAMMING | 1000.0 | Codeforces Round #745 Editorial | 1200 |
| 2207 | Korney Korneevich and XOR (hard version) | binary search brute force dp two pointers | Statement | F2 | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 4342 | Pchelyonok and Segments | binary search data structures dp greedy math | Statement | E | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 6770 | Korney Korneevich and XOR (easy version) | bitmasks dp | Statement | F1 | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 2000.0 | Codeforces Round #750 (Div.2) Editorial | |
| 25969 | Grandma Capa Knits a Scarf | data structures greedy strings two pointers | Statement | C | Codeforces Round 750 (Div. 2) {1582} | PROGRAMMING | 1500.0 | Codeforces Round #750 (Div.2) Editorial | |
| 7532 | Omkar and Determination | data structures dp | Statement | C | Technocup 2022 - Elimination Round 1 {1583} | PROGRAMMING | 1500.0 | Editorial for Technocup 2022 — Elimination Round 1 and Codeforces Round #749 (Div. 1+Div. 2) | |
| 1200 | Strange LCS | bitmasks dp graphs greedy strings | Statement | F | Technocup 2022 - Elimination Round 2 {1584} | PROGRAMMING | 2500.0 | Editorial for Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) | 2600 |
| 1776 | Non-equal Neighbours | combinatorics dp math | Statement | F | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 3000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 344 | Poachers | dp games graphs trees | Statement | G | Technocup 2022 - Elimination Round 3 {1585} | PROGRAMMING | 3500.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 336 | Non-equal Neighbours | combinatorics data structures dp math | Statement | F | Codeforces Round 759 (Div. 2, based on Technocup 2022 Elimination Round 3) {1591} | PROGRAMMING | 3000.0 | Codeforces Round #759 (Div. 2, based on Technocup 2022 Elimination Round 3) Editorial | |
| 9461 | Bakry and Partitioning | bitmasks constructive algorithms dfs and similar dp graphs trees | Statement | C | Codeforces Round 746 (Div. 2) {1592} | PROGRAMMING | 1500.0 | 95583 | |
| 44566 | Make it Divisible by 25 | dp greedy math math | Statement | B | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 2746 | Red-Black Number | dp implementation math | Statement | F | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 5646 | Half of Same | dp math number theory | Statement | D2 | Codeforces Round 748 (Div. 3) {1593} | PROGRAMMING | Editorial for Codeforces Round #748 (Div.3) | ||
| 10026 | The Number of Imposters | constructive algorithms dfs and similar dp dsu graphs | Statement | D | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1750.0 | 95525 | 1700 |
| 1698 | Rubik's Cube Coloring (hard version) | brute force dp implementation math trees | Statement | E2 | Codeforces Round 747 (Div. 2) {1594} | PROGRAMMING | 1500.0 | 95525 | 2300 |
| 1696 | RBS | binary search bitmasks data structures dp | Statement | F | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 2587 | Staircases | brute force combinatorics data structures dfs and similar dp | Statement | E | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 26250 | Computer Game | dfs and similar dp implementation | Statement | A | Educational Codeforces Round 115 (Rated for Div. 2) {1598} | PROGRAMMING | 95890 | ||
| 5605 | Frog Traveler | data structures dp graphs shortest paths | Statement | B | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 1250.0 | 95865 | 1900 |
| 2098 | Difficult Mountain | data structures dp greedy sortings | Statement | D | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2700 |
| 654 | Phys Ed Online | data structures dp greedy trees | Statement | E | Codeforces Round 751 (Div. 1) {1601} | PROGRAMMING | 2250.0 | 95865 | 2900 |
| 695 | A Perfect Problem | combinatorics dp | Statement | E | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round #752 | |
| 406 | October 18, 2017 | combinatorics dp implementation math | Statement | F | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 3750.0 | Editorial of Codeforces Round #752 | |
| 2359 | Extreme Extension | dp greedy math number theory | Statement | C | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #752 | 2300 |
| 1001 | Artistic Partition | divide and conquer dp number theory | Statement | D | Codeforces Round 752 (Div. 1) {1603} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #752 | 3000 |
| 439 | PalindORme | combinatorics dp | Statement | F | Codeforces Round 754 (Div. 2) {1605} | PROGRAMMING | 3500.0 | tutorial | 2900 |
| 826 | Tree Queries | binary search data structures dp dsu geometry trees | Statement | F | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 4359 | Arena | combinatorics dp | Statement | E | Educational Codeforces Round 116 (Rated for Div. 2) {1606} | PROGRAMMING | 96454 | ||
| 956 | MEX counting | combinatorics dp | Statement | F | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 7472 | Game Master | data structures dfs and similar dp graphs greedy two pointers | Statement | C | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 10596 | Complex Market Analysis | binary search dp implementation number theory schedules two pointers | Statement | C | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 1500.0 | Deltix Round, Autumn 2021. Editorial | 1400 |
| 2558 | William The Oblivious | data structures divide and conquer dp matrices | Statement | E | Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) {1609} | PROGRAMMING | 2750.0 | Deltix Round, Autumn 2021. Editorial | 2400 |
| 738 | Mashtali: a Space Oddysey | constructive algorithms dfs and similar graphs implementation | Statement | F | Codeforces Global Round 17 {1610} | PROGRAMMING | 2750.0 | Codeforces Global Round 17 Editorial | |
| 488 | Mashtali vs AtCoder | games trees | Statement | I | Codeforces Global Round 17 {1610} | PROGRAMMING | 4000.0 | Codeforces Global Round 17 Editorial | |
| 4460 | Escape The Maze (hard version) | dfs and similar dp greedy shortest paths trees two pointers | Statement | E2 | Codeforces Round 756 (Div. 3) {1611} | PROGRAMMING | Tutorial | 2000 | |
| 760 | Armor and Weapons | brute force dp greedy shortest paths | Statement | F | Educational Codeforces Round 117 (Rated for Div. 2) {1612} | PROGRAMMING | 97164 | ||
| 5428 | MEX Sequences | dp | Statement | D | Educational Codeforces Round 118 (Rated for Div. 2) {1613} | PROGRAMMING | 97467 | ||
| 11511 | Divan and bitwise operations | bitmasks combinatorics constructive algorithms dp math | Statement | C | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 1500 |
| 4608 | Divan and Kostomuksha (easy version) | dp number theory | Statement | D1 | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1500.0 | Tutorial | 2100 |
| 2827 | Divan and Kostomuksha (hard version) | dp number theory | Statement | D2 | Codeforces Round 757 (Div. 2) {1614} | PROGRAMMING | 1000.0 | Tutorial | 2300 |
| 1207 | LEGOndary Grandmaster | combinatorics dp math | Statement | F | Codeforces Global Round 18 {1615} | PROGRAMMING | 3000.0 | Global Round 18 Editorial | |
| 1776 | Purple Crayon | dp games greedy math trees | Statement | E | Codeforces Global Round 18 {1615} | PROGRAMMING | 2750.0 | Global Round 18 Editorial | |
| 5738 | Keep the Average High | dp greedy math | Statement | D | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2000.0 | Good Bye 2021 -- Editorial | 2000 |
| 788 | Tricolor Triangles | graphs math matrices | Statement | F | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 3000.0 | Good Bye 2021 -- Editorial | 2900 |
| 1411 | Keep XOR Low | bitmasks combinatorics divide and conquer dp math | Statement | H | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 4000.0 | Good Bye 2021 -- Editorial | 3000 |
| 474 | Just Add an Edge | dfs and similar dp graphs | Statement | G | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 3500.0 | Good Bye 2021 -- Editorial | 3500 |
| 1082 | Christmas Chocolates | dfs and similar dp games graphs implementation math number theory shortest paths trees | Statement | E | Codeforces Round 761 (Div. 2) {1617} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #761 (Div. 2) | |
| 21208 | Array and Operations | dp greedy math | Statement | D | Codeforces Round 760 (Div. 3) {1618} | PROGRAMMING | Codeforces Round #760 (Div. 3) Editorial | ||
| 10420 | MEX and Increments | constructive algorithms data structures dp greedy math sortings | Statement | E | Codeforces Round 762 (Div. 3) {1619} | PROGRAMMING | Tutorial | ||
| 7369 | BA-String | bitmasks brute force dp greedy implementation math shortest paths | Statement | C | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 1223 | Subsequences Galore | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 829 | Bipartite Array | dp | Statement | F | Educational Codeforces Round 119 (Rated for Div. 2) {1620} | PROGRAMMING | 98061 | ||
| 920 | Weighted Increasing Subsequences | data structures dp | Statement | G | Hello 2022 {1621} | PROGRAMMING | 3000.0 | ||
| 1508 | Robot Cleaner Revisit | dp implementation math probabilities | Statement | D | Codeforces Round 763 (Div. 2) {1623} | PROGRAMMING | 2500.0 | Codeforces Round #763 (Div. 2) Editorial | |
| 4705 | Masha-forgetful | brute force constructive algorithms dp hashing implementation strings | Statement | E | Codeforces Round 764 (Div. 3) {1624} | PROGRAMMING | Codeforces Round #764 (Div. 3) Editorial | ||
| 1206 | Cats on the Upgrade (easy version) | data structures dfs and similar divide and conquer dp graphs trees | Statement | E1 | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 13971 | Road Optimization | data structures dp | Statement | C | Codeforces Round 765 (Div. 2) {1625} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round #765 (Div. 2) | |
| 938 | A Random Code Problem | combinatorics dp math number theory | Statement | F | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 12060 | Monsters And Spells | data structures dp fft greedy implementation two pointers | Statement | C | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 1971 | Black and White Tree | dp greedy trees | Statement | E | Educational Codeforces Round 121 (Rated for Div. 2) {1626} | PROGRAMMING | 99136 | ||
| 2922 | Not Escaping | data structures dp implementation shortest paths sortings two pointers | Statement | E | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 2000.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 9668 | Not Adding | dp math number theory | Statement | D | Codeforces Round 766 (Div. 2) {1627} | PROGRAMMING | 1750.0 | Codeforces Round #766 (Div. 2) Editorial | |
| 3862 | Game on Sum (Easy Version) | combinatorics dp games | Statement | D1 | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 1000.0 | 99276 | |
| 2723 | Game on Sum (Hard Version) | combinatorics dp games | Statement | D2 | Codeforces Round 767 (Div. 1) {1628} | PROGRAMMING | 750.0 | 99276 | |
| 3414 | Paint the Middle | data structures dp greedy sortings | Statement | C | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 1250.0 | Editorial of Codeforces Round #768 | |
| 2118 | Flipping Range | dp greedy number theory | Statement | D | Codeforces Round 768 (Div. 1) {1630} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #768 | |
| 28840 | Fun with Even Subarrays | dp greedy | Statement | B | Codeforces Round 768 (Div. 2) {1631} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round #768 | |
| 5491 | New Year Concert | binary search data structures dp greedy math number theory two pointers | Statement | D | Codeforces Round 769 (Div. 2) {1632} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round #769 | |
| 760 | Perfect Matching | data structures interactive trees | Statement | F | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 20045 | Make Them Equal | dp greedy shortest paths | Statement | D | Educational Codeforces Round 122 (Rated for Div. 2) {1633} | PROGRAMMING | 99539 | ||
| 7178 | Infinite Set | dp math matrices number theory strings | Statement | D | Codeforces Round 772 (Div. 2) {1635} | PROGRAMMING | 2250.0 | Codeforces Round #772 Editorial | |
| 15528 | MEX and Array | brute force dp greedy math | Statement | B | Codeforces Global Round 19 {1637} | PROGRAMMING | 1000.0 | Tutorial | |
| 2209 | Towers | constructive algorithms dfs and similar dp greedy trees | Statement | F | Codeforces Global Round 19 {1637} | PROGRAMMING | 3250.0 | Tutorial | |
| 9171 | Yet Another Minimization Problem | dp math | Statement | D | Codeforces Global Round 19 {1637} | PROGRAMMING | 2000.0 | Tutorial | |
| 15256 | Increase Subarray Sums | dp implementation | Statement | C | Educational Codeforces Round 123 (Rated for Div. 2) {1644} | PROGRAMMING | 100227 | ||
| 4535 | Weight the Tree | constructive algorithms dfs and similar dp implementation trees | Statement | D | Codeforces Round 774 (Div. 2) {1646} | PROGRAMMING | 2000.0 | Codeforces Round #774 (Div. 2) Editorial | 2000 |
| 557 | Madoka and Laziness | dp greedy | Statement | F | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 3000.0 | Codeforces Round #777 Editorial | |
| 5746 | Madoka and the Best School in Russia | dp math number theory | Statement | D | Codeforces Round 777 (Div. 2) {1647} | PROGRAMMING | 2000.0 | Codeforces Round #777 Editorial | |
| 1097 | Serious Business | data structures divide and conquer dp shortest paths | Statement | D | Codeforces Round 775 (Div. 1, based on Moscow Open Olympiad in Informatics) {1648} | PROGRAMMING | 2000.0 | Codeforces Round #775 Editorial | |
| 3144 | Counting Shortcuts | dfs and similar dp graphs shortest paths | Statement | G | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 1770 | Vitaly and Advanced Useless Algorithms | dp greedy | Statement | F | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 18841 | Weight of the System of Nested Segments | greedy hashing implementation sortings | Statement | C | Codeforces Round 776 (Div. 3) {1650} | PROGRAMMING | 100712 | ||
| 679 | Sum of Matchings | dfs and similar greedy implementation math | Statement | E | Educational Codeforces Round 124 (Rated for Div. 2) {1651} | PROGRAMMING | Educational Codeforces Round 124 Editorial | ||
| 874 | Words on Tree | 2-sat implementation trees | Statement | F | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 5397 | For Gamers. By Gamers. | binary search dp math sortings two pointers | Statement | D | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 2595 | Star MST | combinatorics dp math | Statement | E | Educational Codeforces Round 125 (Rated for Div. 2) {1657} | PROGRAMMING | 101161 | ||
| 1262 | Gojou and Matrix Game | data structures dp games math number theory sortings | Statement | E | Codeforces Round 779 (Div. 2) {1658} | PROGRAMMING | 2500.0 | Codeforces Round #779 (Div. 2) Editorial | |
| 16356 | Line Empire | dp greedy implementation math | Statement | C | Codeforces Round 782 (Div. 2) {1659} | PROGRAMMING | 1500.0 | Codeforces Round #782 (Div. 2) Editorial | |
| 22424 | Get an Even String | dp greedy strings | Statement | C | Codeforces Round 780 (Div. 3) {1660} | PROGRAMMING | Codeforces Round #780 (Div. 3) Editorial | ||
| 1372 | Il Derby della Madonnina | data structures dp | Statement | L | SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1662} | PROGRAMMING | 102042 | ||
| 1874 | MinimizOR | binary search bitmasks data structures dp greedy implementation | Statement | E | Codeforces Round 781 (Div. 2) {1665} | PROGRAMMING | 2250.0 | Codeforces Round #781 (Div. 2) Editorial | |
| 3848 | Connect the Points | brute force constructive algorithms geometry | Statement | C | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 1606 | Fancy Stack | combinatorics dp | Statement | F | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 1609 | Job Lookup | constructive algorithms dp | Statement | J | 2021-2022 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1666} | PROGRAMMING | Tutorial (PDF) | ||
| 4492 | Optimal Partition | data structures dp | Statement | B | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 1000.0 | Codeforces Round #783 Editorial | 2100 |
| 886 | Edge Elimination | constructive algorithms dfs and similar dp trees | Statement | D | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2000.0 | Codeforces Round #783 Editorial | 2900 |
| 971 | Centroid Probabilities | combinatorics dp fft math | Statement | E | Codeforces Round 783 (Div. 1) {1667} | PROGRAMMING | 2750.0 | Codeforces Round #783 Editorial | 3000 |
| 2022 | Hemose on the Tree | bitmasks constructive algorithms dfs and similar trees | Statement | E | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 2750.0 | Tutorial | 2200 |
| 1337 | Jee, You See? | bitmasks combinatorics dp | Statement | F | Codeforces Round 788 (Div. 2) {1670} | PROGRAMMING | 3000.0 | Tutorial | 2400 |
| 521 | Permutation Counting | brute force combinatorics dp fft math | Statement | F | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 3400 | Preorder | combinatorics divide and conquer dp dsu hashing trees | Statement | E | Educational Codeforces Round 127 (Rated for Div. 2) {1671} | PROGRAMMING | 102181 | ||
| 19503 | Palindrome Basis | dp math number theory | Statement | C | Codeforces Round 785 (Div. 2) {1673} | PROGRAMMING | 1500.0 | Codeforces Round #785 (Div. 2) Editorial | |
| 3013 | Remove Directed Edges | dfs and similar dp graphs | Statement | G | Codeforces Round 786 (Div. 3) {1674} | PROGRAMMING | 102482 | ||
| 6462 | Vlad and Unfinished Business | dfs and similar dp greedy trees | Statement | F | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 2200 | Sorting Pancakes | dp | Statement | G | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 48036 | Make It Increasing | dp greedy | Statement | B | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 19534 | Detective Task | dp greedy | Statement | C | Codeforces Round 787 (Div. 3) {1675} | PROGRAMMING | 102550 | ||
| 16727 | Maximum Crossings (Easy Version) | brute force | Statement | H1 | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 13656 | Maximum Crossings (Hard Version) | data structures divide and conquer sortings | Statement | H2 | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 26715 | White-Black Balanced Subtrees | dfs and similar dp graphs trees | Statement | G | Codeforces Round 790 (Div. 4) {1676} | PROGRAMMING | Codeforces Round #790 (Div. 4) Editorial | ||
| 9489 | Tokitsukaze and Strange Inequality | data structures dp | Statement | A | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 500.0 | Tutorial | |
| 1520 | Tokitsukaze and Permutations | dp math | Statement | D | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 2000.0 | Tutorial | |
| 180 | Tokitsukaze and Gems | dp math | Statement | F | Codeforces Round 789 (Div. 1) {1677} | PROGRAMMING | 3500.0 | Tutorial | |
| 7423 | Tokitsukaze and Good 01-String (hard version) | dp implementation | Statement | B2 | Codeforces Round 789 (Div. 2) {1678} | PROGRAMMING | 1000.0 | Codeforces Round 789 Chinese Tutorial.pdf | |
| 6130 | Toss a Coin to Your Graph... | binary search dfs and similar dp graphs | Statement | D | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 1750.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 1467 | Typical Party in Dorm | bitmasks brute force combinatorics dp strings two pointers | Statement | E | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 2250.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 827 | Formalism for Formalism | bitmasks dp math | Statement | F | Codeforces Round 791 (Div. 2) {1679} | PROGRAMMING | 3000.0 | Codeforces Round #791 (Div. 2) Editorial | |
| 4461 | Moving Chips | binary search bitmasks dp greedy | Statement | E | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 1014 | Lenient Vertex Cover | data structures dfs and similar divide and conquer dsu graphs | Statement | F | Educational Codeforces Round 128 (Rated for Div. 2) {1680} | PROGRAMMING | 102852 | ||
| 10982 | Required Length | brute force dfs and similar dp hashing shortest paths | Statement | D | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 1700 | |
| 2501 | Unique Occurrences | data structures dfs and similar divide and conquer dp dsu trees | Statement | F | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 2300 | |
| 1017 | Labyrinth Adventures | data structures dp greedy matrices shortest paths | Statement | E | Educational Codeforces Round 129 (Rated for Div. 2) {1681} | PROGRAMMING | 103163 | 2600 | |
| 1247 | Diverse Segments | data structures two pointers | Statement | F | Codeforces Round 792 (Div. 1 + Div. 2) {1684} | PROGRAMMING | 2000.0 | Codeforces Round #792 (Div. 1 + Div. 2) Editorial | 2600 |
| 19513 | Odd Subarrays | dp greedy | Statement | B | Codeforces Round 794 (Div. 2) {1686} | PROGRAMMING | 1000.0 | 103198 | |
| 4839 | Lena and Matrix | brute force data structures dp shortest paths | Statement | D | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1750.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 14145 | Infected Tree | constructive algorithms dfs and similar dp greedy trees | Statement | C | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #798 (Div. 2) | |
| 1205 | K-Set Tree | combinatorics dfs and similar dp math trees | Statement | F | CodeCraft-22 and Codeforces Round 795 (Div. 2) {1691} | PROGRAMMING | 2750.0 | Editorial for CodeCraft-22 and Codeforces Round #795 (Div. 2) | |
| 10167 | Gambling | data structures dp math | Statement | H | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 28601 | 2^Sort | data structures dp sortings two pointers | Statement | G | Codeforces Round 799 (Div. 4) {1692} | PROGRAMMING | Codeforces Round #799 (Div. 4) Editorial | ||
| 9791 | Fake Plastic Trees | dfs and similar dp greedy trees | Statement | B | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 1000.0 | Codeforces Round #800 Editorial | 1700 |
| 1183 | Decinc Dividing | brute force data structures divide and conquer dp greedy | Statement | D | Codeforces Round 800 (Div. 1) {1693} | PROGRAMMING | 2250.0 | Codeforces Round #800 Editorial | 2800 |
| 14803 | Zero Path | brute force data structures dp greedy shortest paths | Statement | C | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 2522 | Tree Queries (Easy Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D1 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1250.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 2355 | Tree Queries (Hard Version) | constructive algorithms dfs and similar dp greedy trees | Statement | D2 | Codeforces Round 801 (Div. 2) and EPIC Institute of Technology Round {1695} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round | |
| 221 | Maximum Product? | brute force combinatorics dp greedy math two pointers | Statement | H | Codeforces Global Round 21 {1696} | PROGRAMMING | 4000.0 | Editorial of Codeforces Global Round 21 | |
| 1504 | Coloring | brute force combinatorics constructive algorithms dfs and similar dp dsu graphs implementation | Statement | E | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 16011 | awoo's Favorite Problem | constructive algorithms data structures dp greedy implementation strings two pointers | Statement | C | Educational Codeforces Round 130 (Rated for Div. 2) {1697} | PROGRAMMING | 103835 | ||
| 3652 | Almost Triple Deletions | data structures dp greedy | Statement | D | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 1750.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 1437 | Three Days Grace | dp math two pointers | Statement | E | Codeforces Round 804 (Div. 2) {1699} | PROGRAMMING | 2500.0 | Codeforces Round #804 (Div. 2) Editorial | |
| 7220 | River Locks | binary search dp greedy math | Statement | D | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 1750.0 | 103978 | 1900 |
| 1119 | Puzzle | dp greedy | Statement | F | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 3000.0 | 103978 | 2600 |
| 23777 | Optimal Path | dp greedy math | Statement | A | Codeforces Round 802 (Div. 2) {1700} | PROGRAMMING | 500.0 | 103978 | 800 |
| 1426 | Text Editor | brute force dp greedy strings two pointers | Statement | E | Educational Codeforces Round 131 (Rated for Div. 2) {1701} | PROGRAMMING | Educational Codeforces Round 131 Editorial | ||
| 6314 | Passable Paths (hard version) | bitmasks data structures dfs and similar dp sortings trees | Statement | G2 | Codeforces Round 805 (Div. 3) {1702} | PROGRAMMING | 104763 | ||
| 32970 | Yet Another Problem About Pairs Satisfying an Inequality | binary search data structures dp greedy sortings | Statement | F | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 13151 | Good Key, Bad Key | bitmasks brute force dp greedy math | Statement | G | Codeforces Round 806 (Div. 4) {1703} | PROGRAMMING | 104786 | ||
| 2760 | Count Seconds | brute force constructive algorithms dp graphs | Statement | E | CodeTON Round 2 (Div. 1 + Div. 2, Rated, Prizes!) {1704} | PROGRAMMING | 2000.0 | CodeTON Round 2 Editorial | |
| 7833 | Chopping Carrots (Easy Version) | binary search brute force constructive algorithms dp greedy number theory | Statement | D1 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 1988 | Chopping Carrots (Hard Version) | constructive algorithms dp number theory two pointers | Statement | D2 | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1250.0 | Codeforces Round #809 Editorial | |
| 16339 | Qpwoeirut And The City | dp greedy implementation | Statement | C | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1250.0 | Codeforces Round #809 Editorial | |
| 17657 | Making Towers | dp greedy math | Statement | B | Codeforces Round 809 (Div. 2) {1706} | PROGRAMMING | 1000.0 | Codeforces Round #809 Editorial | |
| 187 | Bugaboo | bitmasks constructive algorithms dp number theory | Statement | F | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 3250.0 | 104930 | |
| 1038 | Partial Virtual Trees | combinatorics dp math trees | Statement | D | Codeforces Round 808 (Div. 1) {1707} | PROGRAMMING | 1750.0 | 104930 | |
| 733 | Multiset of Strings | dp fft flows graphs greedy math | Statement | F | Educational Codeforces Round 132 (Rated for Div. 2) {1709} | PROGRAMMING | 105164 | ||
| 1691 | XOR Triangle | bitmasks dp | Statement | C | Codeforces Round 810 (Div. 1) {1710} | PROGRAMMING | 1750.0 | Codeforces Round #810 Editorial | |
| 19086 | Build Permutation | constructive algorithms dp math | Statement | C | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 1750.0 | Codeforces Round #812 (Div. 2) Editorial | 1200 |
| 792 | Lost Array | bitmasks combinatorics constructive algorithms dp math | Statement | F | Codeforces Round 812 (Div. 2) {1713} | PROGRAMMING | 3000.0 | Codeforces Round #812 (Div. 2) Editorial | 2900 |
| 10556 | Color with Occurrences | dp greedy strings | Statement | D | Codeforces Round 811 (Div. 3) {1714} | PROGRAMMING | Codeforces Round #811 (Div. 3) Editorial | ||
| 2457 | Long Way Home | data structures divide and conquer dp geometry graphs shortest paths | Statement | E | Codeforces Round 816 (Div. 2) {1715} | PROGRAMMING | 2750.0 | Codeforces Round #816 (Div. 2) editorial | |
| 1395 | Swap and Maximum Block | bitmasks data structures divide and conquer dp | Statement | E | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 6329 | Chip Move | brute force dp math | Statement | D | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 4688 | Robot in a Hallway | data structures dp implementation | Statement | C | Educational Codeforces Round 133 (Rated for Div. 2) {1716} | PROGRAMMING | 105653 | ||
| 6018 | Burenka and Traditions (hard version) | data structures dp greedy math two pointers | Statement | A2 | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 6519 | Burenka and Traditions (easy version) | dp greedy math | Statement | A1 | Codeforces Round 814 (Div. 1) {1718} | PROGRAMMING | 500.0 | Codeforces Round #814 (Div. 1, Div. 2) Editorial | |
| 6831 | Xor-Subsequence (easy version) | bitmasks brute force dp strings trees | Statement | D1 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1500.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 2311 | Xor-Subsequence (hard version) | bitmasks data structures dp strings trees | Statement | D2 | Codeforces Round 815 (Div. 2) {1720} | PROGRAMMING | 1000.0 | Codeforces Round #815 (Div. 2) Editorial | |
| 13925 | Counting Rectangles | brute force data structures dp implementation | Statement | E | Codeforces Round 817 (Div. 4) {1722} | PROGRAMMING | 106478 | 1600 | |
| 645 | Electrical Efficiency | combinatorics data structures dp number theory trees | Statement | E | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 4791 | Moving Both Hands | dp graphs shortest paths | Statement | M | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 511 | Journey | dp trees | Statement | J | COMPFEST 14 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1725} | PROGRAMMING | Tutorial | ||
| 685 | Illumination | combinatorics dp | Statement | G | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 8454 | Letter Picking | constructive algorithms dp games | Statement | D | Educational Codeforces Round 135 (Rated for Div. 2) {1728} | PROGRAMMING | 106805 | ||
| 2619 | Cut Substrings | combinatorics dp hashing strings two pointers | Statement | G | Codeforces Round 820 (Div. 3) {1729} | PROGRAMMING | Codeforces Round #820 (Div. 3) Editorial | ||
| 808 | Almost Sorted | bitmasks data structures dp | Statement | F | Codeforces Round 823 (Div. 2) {1730} | PROGRAMMING | 3000.0 | Codeforces Round #823 — editorial | 2700 |