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 ... 7 8 9 10 11 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 977 | Babysitting | 2-sat binary search data structures graphs | Statement | F | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 3500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 1104 | Maximum And Queries (hard version) | bitmasks divide and conquer dp | Statement | D2 | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 2500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 2600 | Geo Game | constructive algorithms dp games greedy interactive math | Statement | E | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 2250.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 14785 | Theofanis' Nightmare | constructive algorithms dp greedy | Statement | C | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 1500.0 | Codeforces Round #912 (Div. 2) Editorial | |
| 30216 | Collecting Game | binary search dp greedy two pointers | Statement | B | Codeforces Round 914 (Div. 2) {1904} | PROGRAMMING | 750.0 | Codeforces Round 914 (Div. 2) Editorial | |
| 1320 | One-X | combinatorics dp math | Statement | E | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 2250.0 | Codeforces Round 915 (Div. 2) Editorial | |
| 1130 | Twin Friends | combinatorics dp | Statement | H | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 1132 | Count BFS Graph | combinatorics dp | Statement | J | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 2551 | Merge Not Sort | constructive algorithms dp | Statement | E | 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) {1906} | PROGRAMMING | problem_analysis.pdf | ||
| 183 | Short Permutation Problem | combinatorics dp fft math | Statement | I | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 6000.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 2308 | Small Permutation Problem (Easy Version) | combinatorics dp math | Statement | F1 | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 1275 | Small Permutation Problem (Hard Version) | combinatorics dp math | Statement | F2 | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 13422 | Heavy Intervals | constructive algorithms data structures dsu greedy math sortings | Statement | C | Pinely Round 3 (Div. 1 + Div. 2) {1909} | PROGRAMMING | 1500.0 | Editorial of Pinely Round 3 (Div. 1 + Div. 2) | |
| 70 | Inverse Problem | *special combinatorics dp | Statement | I | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 248 | Maximum Sum Subarrays | *special dp | Statement | E | Kotlin Heroes: Episode 9 (Unrated, T-Shirts + Prizes!) {1910} | PROGRAMMING | 123261 | ||
| 4455 | Kim's Quest | bitmasks combinatorics dp | Statement | K | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 1800 | |
| 4274 | Array Collapse | data structures divide and conquer dp trees | Statement | D | Educational Codeforces Round 160 (Rated for Div. 2) {1913} | PROGRAMMING | 123493 | ||
| 2470 | Light Bulbs (Easy Version) | brute force combinatorics dfs and similar dp dsu graphs math | Statement | G1 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 40958 | Three Activities | brute force dp implementation sortings | Statement | D | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 1895 | Light Bulbs (Hard Version) | combinatorics data structures dfs and similar dp dsu graphs hashing | Statement | G2 | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
| 10334 | Bicycles | dp graphs greedy implementation shortest paths sortings | Statement | G | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 35668 | Unnatural Language Processing | dp greedy implementation strings | Statement | D | Codeforces Round 918 (Div. 4) {1915} | PROGRAMMING | 123952 | ||
| 751 | Matrix Rank (Easy Version) | brute force combinatorics dp math matrices | Statement | H1 | Good Bye 2023 {1916} | PROGRAMMING | 2750.0 | ||
| 2740 | Happy Life in University | brute force data structures dfs and similar dp implementation trees | Statement | E | Good Bye 2023 {1916} | PROGRAMMING | 2000.0 | ||
| 681 | Matrix Rank (Hard Version) | combinatorics dp math matrices | Statement | H2 | Good Bye 2023 {1916} | PROGRAMMING | 1750.0 | ||
| 239 | Optimizations From Chelsu | divide and conquer dp number theory trees | Statement | G | Good Bye 2023 {1916} | PROGRAMMING | 3750.0 | ||
| 1261 | Construct Tree | bitmasks constructive algorithms dp trees | Statement | F | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 38925 | Erase First or Second Letter | brute force combinatorics dp strings | Statement | B | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 1000.0 | Editorial of Codeforces Round 917 (Div. 2) | |
| 6430 | Blocking Elements | binary search data structures dp greedy implementation two pointers | Statement | D | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 2000.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 17135 | XOR-distance | bitmasks dp greedy implementation math | Statement | C | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 1250.0 | Codeforces Round #922 (Div. 2) Editorial | |
| 30357 | Grouping Increases | data structures dp greedy | Statement | C | Hello 2024 {1919} | PROGRAMMING | 1000.0 | 1400 | |
| 1172 | Counting Prefixes | combinatorics dp math | Statement | E | Hello 2024 {1919} | PROGRAMMING | 2250.0 | 2600 | |
| 6716 | Array Repetition | binary search data structures dp implementation math | Statement | D | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 3507 | Counting Binary Strings | combinatorics dp math strings | Statement | E | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 2250.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 23432 | Summation Game | dp games greedy sortings | Statement | B | Codeforces Round 919 (Div. 2) {1920} | PROGRAMMING | 1000.0 | Editorial for Codeforces Round #919 (Div. 2) | |
| 1559 | Mischievous Shooter | data structures divide and conquer dp implementation | Statement | G | Codeforces Round 920 (Div. 3) {1921} | PROGRAMMING | Editorial for Codeforces Round 920 (Div. 3) | ||
| 1796 | Replace on Segment | dp | Statement | F | Educational Codeforces Round 161 (Rated for Div. 2) {1922} | PROGRAMMING | Educational Codeforces Round 161 Editorial | ||
| 5345 | Count Paths | data structures dfs and similar divide and conquer dp dsu trees | Statement | E | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 20101 | Monsters Attack! | dp greedy implementation | Statement | B | Educational Codeforces Round 162 (Rated for Div. 2) {1923} | PROGRAMMING | Educational Codeforces Round 162 Editorial | ||
| 1537 | Balanced Subsequences | combinatorics dp math | Statement | D | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 1750.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 17037 | Did We Get Everything Covered? | constructive algorithms dp greedy strings | Statement | A | Codeforces Round 921 (Div. 1) {1924} | PROGRAMMING | 500.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 4945 | Good Trip | combinatorics dp math probabilities | Statement | D | Codeforces Round 921 (Div. 2) {1925} | PROGRAMMING | 1750.0 | Codeforces Round 921 (Div. 1, Div. 2) Editorial | |
| 15183 | Vlad and an Odd Ordering | binary search bitmasks data structures dp implementation math number theory | Statement | E | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 2145 | Vlad and Avoiding X | bitmasks brute force constructive algorithms dfs and similar dp implementation | Statement | F | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 4659 | Vlad and Trouble at MIT | dfs and similar dp flows graphs greedy implementation trees | Statement | G | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 33487 | Vlad and a Sum of Sum of Digits | dp implementation | Statement | C | Codeforces Round 928 (Div. 4) {1926} | PROGRAMMING | 126132 | ||
| 35446 | Find the Different Ones! | binary search brute force data structures dp greedy two pointers | Statement | D | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2055 | Paint Charges | data structures dp greedy math | Statement | G | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
| 2257 | Modular Sequence | constructive algorithms dp greedy implementation math number theory | Statement | E | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 2250.0 | Codeforces Round 924 Editorial | |
| 17569 | Sasha and the Casino | binary search brute force dp games greedy math | Statement | C | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 2147 | Sasha and the Happy Tree Cutting | bitmasks brute force dp fft graphs greedy trees | Statement | E | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2500.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 5911 | Sasha and a Walk in the City | combinatorics dfs and similar dp math trees | Statement | D | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 2000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
| 4927 | Sum over all Substrings (Easy Version) | brute force dp greedy strings | Statement | D1 | think-cell Round 1 {1930} | PROGRAMMING | 1250.0 | think-cell Round 1 Editorial | |
| 3129 | Sum over all Substrings (Hard Version) | dp greedy strings | Statement | D2 | think-cell Round 1 {1930} | PROGRAMMING | 1000.0 | think-cell Round 1 Editorial | |
| 5879 | Feed Cats | data structures dp sortings | Statement | F | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 34441 | Thorns and Coins | dp greedy implementation | Statement | A | Codeforces Round 927 (Div. 3) {1932} | PROGRAMMING | 126196 | ||
| 3016 | Turtle Mission: Robot and the Earthquake | dfs and similar dp graphs shortest paths | Statement | F | Codeforces Round 929 (Div. 3) {1933} | PROGRAMMING | Codeforces Round 929 (Div. 3) Editorial | ||
| 22402 | Yet Another Coin Problem | brute force dp greedy math | Statement | B | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1000.0 | Tutorial | |
| 9932 | Messenger in MAC | binary search brute force constructive algorithms data structures dp sortings | Statement | C | Codeforces Round 932 (Div. 2) {1935} | PROGRAMMING | 1500.0 | Codeforces Round #932 (Div. 2) Editorial | |
| 30 | Draw Polygon Lines | *special constructive algorithms dp geometry interactive | Statement | A | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 115 | Big Persimmon | *special dp games | Statement | D | XVIII Open Olympiad in Informatics - Final Stage, Day 1 (Unrated, Online Mirror, IOI rules) {1939} | PROGRAMMING | |||
| 12229 | Rudolf and k Bridges | data structures dp | Statement | E | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 21294 | Rudolf and the Ball Game | dp implementation | Statement | D | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 39854 | Rudolf and the Ugly String | dp strings | Statement | C | Codeforces Round 933 (Div. 3) {1941} | PROGRAMMING | 127018 | ||
| 267 | Farmer John's Favorite Intern | data structures dp flows trees | Statement | H | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 4500.0 | CodeTON Round 8 Editorial | |
| 3402 | Learning to Paint | data structures dp greedy | Statement | D | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 2250.0 | CodeTON Round 8 Editorial | |
| 6972 | Bessie's Birthday Cake (Hard Version) | geometry greedy math | Statement | C2 | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 750.0 | CodeTON Round 8 Editorial | |
| 12566 | Bessie's Birthday Cake (Easy Version) | geometry math | Statement | C1 | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 1250.0 | CodeTON Round 8 Editorial | |
| 2014 | Counting Is Fun (Easy Version) | combinatorics dp | Statement | D1 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 1250.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 1186 | Counting Is Fun (Hard Version) | combinatorics dp | Statement | D2 | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 2000.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 144 | Minimum Hamming Distance | dp | Statement | F | Codeforces Round 934 (Div. 1) {1943} | PROGRAMMING | 4500.0 | Codeforces Round #934 (Div1, Div2) Editorial | |
| 14124 | Tree Cutting | binary search dp greedy implementation trees | Statement | C | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 1500.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 1296 | Nobody is needed | brute force data structures dp math number theory | Statement | F | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 2750.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 3238 | Girl Permutation | combinatorics dp math number theory | Statement | E | Codeforces Round 936 (Div. 2) {1946} | PROGRAMMING | 2250.0 | Codeforces Round #936 (Div. 2) Editorial | |
| 26565 | Array Fix | brute force dp greedy implementation | Statement | B | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 12822 | Tandem Repeats? | brute force dp strings two pointers | Statement | D | Educational Codeforces Round 163 (Rated for Div. 2) {1948} | PROGRAMMING | Educational Codeforces Round 163 Editorial | ||
| 225 | Grove | dp dp dp geometry | Statement | A | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
| 6341 | Shuffling Songs | bitmasks dp graphs implementation strings | Statement | G | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 26774 | Product of Binary Decimals | dp implementation number theory | Statement | D | Codeforces Round 937 (Div. 4) {1950} | PROGRAMMING | Codeforces Round 937 (Div. 4) Editorial | ||
| 119 | Growing Trees | constructive algorithms flows graphs greedy | Statement | I | Codeforces Global Round 25 {1951} | PROGRAMMING | 4000.0 | Codeforces Global Round 25 Editorial | |
| 381 | Thanos Snap | dp games greedy trees | Statement | H | Codeforces Global Round 25 {1951} | PROGRAMMING | 3500.0 | Codeforces Global Round 25 Editorial | |
| 8364 | Colored Balls | combinatorics dp greedy math sortings | Statement | D | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 462 | Unique Strings | combinatorics dp math | Statement | F | Educational Codeforces Round 164 (Rated for Div. 2) {1954} | PROGRAMMING | Educational Codeforces Round 164 Editorial | ||
| 1558 | The Most Reckless Defense | bitmasks brute force constructive algorithms dp flows graph matchings | Statement | H | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 6072 | GCD on a grid | brute force dfs and similar dp math number theory | Statement | G | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 8873 | Unfair Game | dp games greedy math | Statement | F | Codeforces Round 938 (Div. 3) {1955} | PROGRAMMING | 128243 | ||
| 4867 | Nene and the Mex Operator | bitmasks brute force constructive algorithms divide and conquer dp greedy implementation | Statement | D | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1750.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
| 12187 | How Does the Rook Move? | combinatorics dp math | Statement | C | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1500.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1600 |
| 5991 | A BIT of an Inequality | bitmasks brute force dp math | Statement | D | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 1750.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 1900 |
| 1680 | Carousel of Combinations | brute force combinatorics dp math number theory | Statement | E | Codeforces Round 940 (Div. 2) and CodeCraft-23 {1957} | PROGRAMMING | 2250.0 | Codeforces Round #940 and CodeCraft-23 (Div. 2) Editorial | 2400 |
| 2609 | 1-3-5 | *special dp | Statement | A | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 1100 | |
| 97 | Composite Spells | *special dp | Statement | H | Kotlin Heroes: Episode 10 {1958} | PROGRAMMING | 129483 | 2600 | |
| 2307 | Fenwick Tree | bitmasks brute force combinatorics data structures dp math trees | Statement | C | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1250.0 | Tutorial | 2300 |
| 474 | Again Counting Arrays (Easy Version) | combinatorics dp fft math | Statement | E1 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1750.0 | Tutorial | 3100 |
| 236 | Again Counting Arrays (Hard Version) | combinatorics dp math | Statement | E2 | Codeforces Round 942 (Div. 1) {1967} | PROGRAMMING | 1000.0 | Tutorial | 3500 |
| 5438 | Division + LCP (easy version) | binary search data structures dp hashing string suffix structures strings | Statement | G1 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1900 | |
| 2644 | Division + LCP (hard version) | binary search brute force data structures dp hashing math string suffix structures strings | Statement | G2 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 2200 | |
| 11905 | Minimizing the Sum | dp implementation | Statement | C | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 1700 | |
| 1925 | Unique Array | binary search data structures divide and conquer dp greedy | Statement | E | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 2400 | |
| 414 | Card Pairing | dp greedy hashing implementation | Statement | F | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 3000 | |
| 4555 | Game on Tree (Medium) | dfs and similar dp games trees | Statement | C2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1700 | |
| 3542 | Trails (Easy) | dp | Statement | E1 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1800 | |
| 2532 | Game on Tree (Hard) | dfs and similar dp games trees | Statement | C3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 1900 | |
| 2175 | Trails (Medium) | dp matrices | Statement | E2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2000 | |
| 912 | Min-Fund Prison (Medium) | brute force dfs and similar dp graphs trees | Statement | G2 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2200 | |
| 1233 | Trails (Hard) | dp matrices | Statement | E3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2200 | |
| 577 | Min-Fund Prison (Hard) | bitmasks dfs and similar dp graphs trees | Statement | G3 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) {1970} | PROGRAMMING | Helvetic Coding Contest 2024 Editorial | 2400 | |
| 31061 | Binary Cut | dp greedy implementation sortings strings | Statement | D | Codeforces Round 944 (Div. 4) {1971} | PROGRAMMING | Codeforces Round 944 (Div. 4) Editorial | 1100 | |
| 357 | Maximum GCD Sum Queries | bitmasks brute force dp implementation number theory | Statement | F | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 3000.0 | Editorial for Codeforces Round #945 (Div. 2) | 3100 |
| 28974 | Chess For Three | brute force dp implementation math | Statement | A | Codeforces Round 945 (Div. 2) {1973} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #945 (Div. 2) | 900 |
| 11825 | Money Buys Happiness | dp | Statement | E | Codeforces Round 946 (Div. 3) {1974} | PROGRAMMING | Codeforces Round #946 (Div. 3) Editorial | 1800 | |
| 7660 | Paint the Tree | brute force dfs and similar dp greedy shortest paths trees | Statement | D | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 1500.0 | editorial_zh.pdf | 1700 |
| 1083 | Set | bitmasks brute force combinatorics dfs and similar divide and conquer dp math | Statement | F | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 2500.0 | editorial_zh.pdf | 2600 |
| 189 | Mind Bloom | dp | Statement | I | Codeforces Round 947 (Div. 1 + Div. 2) {1975} | PROGRAMMING | 6000.0 | editorial_zh.pdf | 3500 |
| 12664 | Job Interview | binary search dp greedy implementation two pointers | Statement | C | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 932 | Remove Bridges | data structures dfs and similar dp greedy sortings trees | Statement | F | Educational Codeforces Round 166 (Rated for Div. 2) {1976} | PROGRAMMING | Educational Codeforces Round 166 Editorial | ||
| 8185 | Nikita and LCM | brute force data structures dp greedy math number theory sortings | Statement | C | Codeforces Round 948 (Div. 2) {1977} | PROGRAMMING | 1750.0 | 129858 | 1900 |
| 4682 | Computing Machine | data structures dp greedy implementation | Statement | E | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 2000.0 | 130527 | |
| 361 | Turtle and Paths on a Tree | data structures dp trees | Statement | F | Codeforces Round 949 (Div. 2) {1981} | PROGRAMMING | 3500.0 | Simplified Chinese Tutorial | |
| 22298 | Boring Day | binary search data structures dp greedy two pointers | Statement | C | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 1000.0 | 130839 | |
| 1947 | Number of k-good subarrays | bitmasks combinatorics divide and conquer dp math meet-in-the-middle | Statement | E | Codeforces Round 955 (Div. 2, with prizes from NEAR!) {1982} | PROGRAMMING | 2500.0 | 130839 | |
| 14931 | Have Your Cake and Eat It Too | binary search brute force dp greedy implementation | Statement | C | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1250.0 | ||
| 1185 | Reconstruction | brute force dp | Statement | F | Codeforces Global Round 26 {1984} | PROGRAMMING | 3000.0 | Codeforces Global Round 26 Editorial | |
| 8836 | Magnitude (Hard Version) | combinatorics dp greedy | Statement | C2 | Codeforces Global Round 26 {1984} | PROGRAMMING | 1250.0 | Codeforces Global Round 26 Editorial | |
| 1902 | Shuffle | constructive algorithms dp greedy trees | Statement | E | Codeforces Global Round 26 {1984} | PROGRAMMING | 3000.0 | Codeforces Global Round 26 Editorial | |
| 305 | Tower Capturing | dp geometry | Statement | H | Codeforces Global Round 26 {1984} | PROGRAMMING | 5000.0 | Codeforces Global Round 26 Editorial | |
| 20575 | Magnitude (Easy Version) | dp greedy | Statement | C1 | Codeforces Global Round 26 {1984} | PROGRAMMING | 750.0 | Codeforces Global Round 26 Editorial | |
| 18259 | Mathematical Problem | brute force dp two pointers | Statement | D | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 11085 | Beautiful Array | dp math sortings | Statement | E | Codeforces Round 954 (Div. 3) {1986} | PROGRAMMING | 130762 | ||
| 4172 | Wonderful Tree! | brute force dfs and similar dp flows greedy trees | Statement | E | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 1750.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 1412 | Interesting Problem (Easy Version) | dp | Statement | F1 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 1382 | Interesting Problem (Hard Version) | dp | Statement | F2 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 500.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 255 | Spinning Round (Hard Version) | dp | Statement | G2 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 8885 | World is Mine | dp games greedy | Statement | D | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 1500.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 21144 | Basil's Garden | dp greedy | Statement | C | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 1000.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 361 | Spinning Round (Easy Version) | dp trees | Statement | G1 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) {1987} | PROGRAMMING | 3000.0 | EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) Editorial | |
| 27342 | Split the Multiset | brute force dp greedy math | Statement | A | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 6153 | The Omnipotent Monster Killer | brute force dp trees | Statement | D | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 485 | Heartbeat | combinatorics dp fft math | Statement | F | Codeforces Round 958 (Div. 2) {1988} | PROGRAMMING | 3500.0 | Editorial of Codeforces Round 958 (Div. 2) | |
| 23628 | Substring and Subsequence | bitmasks brute force dp graphs greedy hashing strings trees | Statement | B | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 7237 | Smithing Skill | brute force dp greedy math sortings two pointers | Statement | D | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 2600 | Distance to Different | combinatorics dp | Statement | E | Educational Codeforces Round 167 (Rated for Div. 2) {1989} | PROGRAMMING | Educational Codeforces Round 167 Editorial | ||
| 7919 | Grid Puzzle | bitmasks dp greedy | Statement | D | Codeforces Round 960 (Div. 2) {1990} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 24563 | Test of Love | dp greedy implementation | Statement | D | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 7746 | Valuable Cards | dp greedy number theory two pointers | Statement | F | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
| 4545 | Med-imize | binary search data structures dp greedy | Statement | D | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 2000.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 742 | Xor-Grid Problem | bitmasks dp | Statement | E | Codeforces Round 963 (Div. 2) {1993} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round 963 (Div. 2) | |
| 13978 | Hungry Games | binary search data structures dp two pointers | Statement | C | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 1250.0 | Video Tutorial | |
| 1689 | Minecraft | bitmasks brute force dp math | Statement | G | Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2) {1994} | PROGRAMMING | 2750.0 | Video Tutorial | |
| 421 | Let Me Teach You a Lesson (Hard Version) | 2-sat bitmasks data structures dp graphs matrices two pointers | Statement | E2 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 537 | Let Me Teach You a Lesson (Easy Version) | 2-sat data structures dp two pointers | Statement | E1 | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2500.0 | Video Tutorial | |
| 3044 | Cases | bitmasks brute force combinatorics dfs and similar dp graphs greedy strings | Statement | D | Codeforces Round 961 (Div. 2) {1995} | PROGRAMMING | 2250.0 | Video Tutorial | |
| 2363 | Penacony | brute force data structures dp hashing | Statement | G | Codeforces Round 962 (Div. 3) {1996} | PROGRAMMING | Codeforces Round 962 (Div. 3) Editorial | ||
| 16378 | Maximize the Root | binary search dfs and similar dp greedy trees | Statement | D | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 1311 | Chips on a Line | dp math | Statement | F | Educational Codeforces Round 168 (Rated for Div. 2) {1997} | PROGRAMMING | Video Tutorial | ||
| 2316 | Eliminating Balls With Merging (Easy Version) | binary search brute force data structures divide and conquer dp greedy math | Statement | E1 | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1750.0 | Video Tutorial | |
| 4173 | Determine Winning Islands in Race | data structures dp graphs shortest paths | Statement | D | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 1500.0 | Video Tutorial | |
| 24290 | Triple Operations | dp implementation math | Statement | E | Codeforces Round 964 (Div. 4) {1999} | PROGRAMMING | Video Tutorial | ||
| 2362 | Ksyusha and the Loaded Set | binary search data structures dp implementation trees | Statement | H | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 7085 | Color Rows and Columns | dp greedy implementation math | Statement | F | Codeforces Round 966 (Div. 3) {2000} | PROGRAMMING | 132689 | ||
| 1573 | Deterministic Heap (Easy Version) | brute force combinatorics dp | Statement | E1 | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 303 | Deterministic Heap (Hard Version) | combinatorics dp | Statement | E2 | Codeforces Round 967 (Div. 2) {2001} | PROGRAMMING | 2000.0 | Video Tutorial | |
| 1025 | Court Blue (Easy Version) | brute force dfs and similar dp math number theory | Statement | F1 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 2000.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 599 | Court Blue (Hard Version) | brute force dp math number theory | Statement | F2 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 1250.0 | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial | |
| 657 | Turtle and Inversions (Hard Version) | brute force constructive algorithms data structures dp greedy two pointers | Statement | E2 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1000.0 | sol-zh.pdf | |
| 904 | Turtle and Inversions (Easy Version) | brute force data structures dp greedy | Statement | E1 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1750.0 | sol-zh.pdf | |
| 844 | Turtle and Three Sequences | data structures dp graphs greedy meet-in-the-middle probabilities two pointers | Statement | F | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 2500.0 | sol-zh.pdf | |
| 4718 | Turtle and a MEX Problem (Hard Version) | dfs and similar dp graphs greedy implementation | Statement | D2 | Codeforces Round 968 (Div. 2) {2003} | PROGRAMMING | 1250.0 | sol-zh.pdf | |
| 1438 | Make a Palindrome | brute force data structures dp greedy math | Statement | F | Educational Codeforces Round 169 (Rated for Div. 2) {2004} | PROGRAMMING | Educational Codeforces Round 169 Editorial | ||
| 1283 | Alter the GCD | binary search data structures divide and conquer dp number theory | Statement | D | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 2250.0 | Discussion stream (With Hints) | |
| 3377 | Subtangle Game (Easy Version) | dp games greedy implementation | Statement | E1 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 1500.0 | Discussion stream (With Hints) | |
| 1093 | Subtangle Game (Hard Version) | dp games greedy implementation | Statement | E2 | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 2000.0 | Discussion stream (With Hints) | |
| 8836 | Lazy Narek | dp implementation | Statement | C | Codeforces Round 972 (Div. 2) {2005} | PROGRAMMING | 1500.0 | Discussion stream (With Hints) | |
| 13887 | Alternating String | brute force data structures dp greedy strings | Statement | E | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 23903 | Sakurako's Hobby | dp dsu graphs math | Statement | D | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | Codeforces Round 970 (Div. 3) Editorial | ||
| 4389 | Prefix GCD | brute force dp greedy math number theory | Statement | E | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2500.0 | 134298 | |
| 5311 | Sheriff's Defense | dfs and similar dp trees | Statement | F | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | Discussion stream (With Hints) | ||
| 246 | Complex Segments (Easy Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 210 | Complex Segments (Hard Version) | binary search data structures divide and conquer dsu greedy math sortings | Statement | E2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 5328 | Speedbreaker | binary search dp greedy implementation math two pointers | Statement | B | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 344 | Speedbreaker Counting (Easy Version) | combinatorics dp games greedy implementation math | Statement | F1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 2244 | Max Plus Min Plus Size | data structures dp dsu greedy implementation matrices | Statement | D | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 301 | Speedbreaker Counting (Medium Version) | dp greedy math | Statement | F2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 339 | Speedbreaker Counting (Hard Version) | dp greedy math | Statement | F3 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 27586 | Max Plus Size | brute force dp greedy | Statement | A | Codeforces Round 975 (Div. 2) {2019} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 975 (Div. 1, Div. 2) | |
| 4096 | Expected Power | bitmasks brute force dp math number theory probabilities | Statement | E | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 2000.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 7595 | Connect the Dots | brute force dfs and similar dp dsu graphs math trees | Statement | D | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 1500.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 272 | Count Leaves | dp math number theory | Statement | F | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 2750.0 | Tutorial for Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 | |
| 1966 | Digital Village (Easy Version) | brute force data structures dp dsu graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 1255 | Digital Village (Hard Version) | data structures dp dsu graphs math trees | Statement | E2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 727 | Digital Village (Extreme Version) | data structures dp graphs greedy math | Statement | E3 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 977 | Boss, Thirsty | data structures dp greedy math | Statement | D | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 2500.0 | Codeforces Round #977 (Div. 2, based on COMPFEST 16 — Final Round) Editorial | |
| 6772 | Gerrymandering | dp implementation | Statement | C | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1750.0 | Codeforces Round 978 (Div 2) Editorial | |
| 7299 | Skipping | brute force data structures dp graphs greedy shortest paths | Statement | B | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1000.0 | 135341 | |
| 612 | Many Games | brute force dp math | Statement | D | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 2250.0 | 135341 | |
| 194 | Tree of Life | dp greedy trees | Statement | E | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 2750.0 | 135341 | |
| 8066 | Attribute Checks | brute force data structures dp implementation math | Statement | D | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 2400 | Card Game | combinatorics dp fft greedy math | Statement | E | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 1085 | Choose Your Queries | dfs and similar dp graphs greedy trees | Statement | F | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | Educational Codeforces Round 170 Editorial | ||
| 6117 | Sums of Segments | binary search data structures dp implementation math | Statement | D | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 413 | Bermart Ice Cream | data structures dfs and similar divide and conquer dp implementation trees | Statement | F | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | Educational Codeforces Round 171 Editorial | ||
| 1947 | The Endspeaker (Hard Version) | binary search combinatorics data structures dp greedy implementation two pointers | Statement | D2 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 7150 | The Endspeaker (Easy Version) | binary search dp graphs greedy implementation two pointers | Statement | D1 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1250.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 111 | Bit Game (Hard Version) | bitmasks dp math | Statement | E2 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | Codeforces Round #982 (Div. 2) Editorial | |
| 10277 | Alice's Adventures in Cutting Cake | binary search dp greedy two pointers | Statement | C | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1500.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 559 | Alice's Adventures in Addition | bitmasks dp implementation | Statement | F | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2500.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 3834 | Alice's Adventures in Cards | constructive algorithms data structures dfs and similar dp graphs greedy implementation shortest paths | Statement | D | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 1750.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 1990 | Alice's Adventures in the Rabbit Hole | constructive algorithms dfs and similar dp greedy math probabilities trees | Statement | E | Codeforces Round 986 (Div. 2) {2028} | PROGRAMMING | 2000.0 | Codeforces Round 986 (Div. 2) Editorial | |
| 7852 | New Rating | binary search data structures dp greedy | Statement | C | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 1750.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 111 | Message Spread | bitmasks combinatorics dp | Statement | H | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 5000.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 265 | Balanced Problem | data structures dp | Statement | G | Refact.ai Match 1 (Codeforces Round 985) {2029} | PROGRAMMING | 3500.0 | Refact.ai Match 1 (Codeforces Round 985) Editorial | |
| 1217 | Orangutan Approved Subarrays | binary search brute force data structures greedy two pointers | Statement | F | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2500.0 | Codeforces Round 979 Editorial | |
| 2009 | MEXimize the Score | brute force combinatorics data structures dp math | Statement | E | Codeforces Round 979 (Div. 2) {2030} | PROGRAMMING | 2000.0 | Codeforces Round 979 Editorial | |
| 10136 | Penchick and Desert Rabbit | data structures dfs and similar dp dsu greedy two pointers | Statement | D | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2000.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 2764 | Penchick and Chloe's Trees | data structures dfs and similar dp greedy sortings trees | Statement | E | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 2500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 21272 | Penchick and Modern Monument | dp greedy math two pointers | Statement | A | Codeforces Round 987 (Div. 2) {2031} | PROGRAMMING | 500.0 | Codeforces Round 987 (Div. 2) Editorial | |
| 501 | Peanuts | combinatorics dp games math | Statement | F | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 3000.0 | Codeforces Round 983 (Div. 2) Editorial | |
| 18303 | Sakurako's Field Trip | binary search dp greedy | Statement | C | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 2057 | Sakurako and Chefir | data structures dfs and similar dp trees | Statement | G | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 18592 | Kousuke's Assignment | dp dsu greedy math | Statement | D | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING | 135520 | ||
| 911 | Khayyam's Royal Decree (Easy Version) | combinatorics dp math | Statement | F1 | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | Rayan 2024 Selection Round Editorial | |
| 611 | Khayyam's Royal Decree (Hard Version) | combinatorics dp math | Statement | F2 | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 2000.0 | Rayan 2024 Selection Round Editorial | |
| 199 | Rayan vs. Rayaneh | dp number theory | Statement | H | Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) {2034} | PROGRAMMING | 5000.0 | Rayan 2024 Selection Round Editorial | |
| 5922 | Yet Another Real Number Problem | binary search brute force data structures dp greedy implementation math two pointers | Statement | D | Codeforces Global Round 27 {2035} | PROGRAMMING | 1500.0 | Codeforces Global Round 27 Editorial | |
| 1125 | Tree Operations | binary search dfs and similar dp trees | Statement | F | Codeforces Global Round 27 {2035} | PROGRAMMING | 2250.0 | Codeforces Global Round 27 Editorial | |
| 115 | Go Learn! (Hard Version) | divide and conquer dp | Statement | G2 | Codeforces Global Round 27 {2035} | PROGRAMMING | 2000.0 | Codeforces Global Round 27 Editorial | |
| 176 | Go Learn! (Easy Version) | dp trees | Statement | G1 | Codeforces Global Round 27 {2035} | PROGRAMMING | 2250.0 | Codeforces Global Round 27 Editorial | |
| 5502 | XORificator 3000 | bitmasks dp number theory | Statement | F | Codeforces Round 984 (Div. 3) {2036} | PROGRAMMING | Codeforces Round 984 (Div. 3) Editorial | ||
| 3884 | Natlan Exploring | combinatorics dp math number theory | Statement | G | Codeforces Round 988 (Div. 3) {2037} | PROGRAMMING | Video Tutorial | ||
| 8363 | Bridge Renovation | brute force dp greedy math | Statement | L | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 1400 | ||
| 1820 | Grid Walk | dp greedy math number theory | Statement | K | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2100 | ||
| 895 | Divide OR Conquer | bitmasks data structures dp implementation | Statement | D | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2400 | ||
| 340 | Royal Flush | dp implementation | Statement | M | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2038} | PROGRAMMING | 2800 | ||
| 2421 | Shohag Loves Inversions | combinatorics constructive algorithms dp math | Statement | E | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2750.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 528 | Shohag Loves Counting (Easy Version) | combinatorics dp math number theory | Statement | F1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | Editorial of CodeTON Round 9 (Div. 1 + Div. 2) | |
| 2076 | Cube | bitmasks dp | Statement | C | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 1056 | Sheet Music | combinatorics dp | Statement | H | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | Problem Analysis and Hints (PDF) | ||
| 540 | Vertex Pairs | binary search brute force dfs and similar dp greedy trees | Statement | E | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 932 | Two Subarrays | data structures dp implementation matrices | Statement | F | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | 136886 | ||
| 11512 | Sums on Segments | binary search brute force data structures dp greedy math | Statement | C | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 919 | Nim | bitmasks dp games | Statement | F | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | Educational Codeforces Round 173 Editorial | ||
| 2679 | Hard Demon Problem | data structures dp implementation math | Statement | H | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 4013 | Medium Demon Problem (hard version) | dfs and similar dp dsu graphs implementation trees | Statement | G2 | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | Codeforces Round 993 (Div. 4) Editorial | ||
| 816 | Missing Separators | dp sortings string suffix structures strings | Statement | H | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | raRzKDJLPHcUnqTcwvGznwEdKiDWjEkd.pdf | 2200 | |
| 1349 | Kevin and Math Class | brute force data structures divide and conquer dp math trees two pointers | Statement | F | Codeforces Global Round 28 {2048} | PROGRAMMING | 2000.0 | Tutorial | |
| 257 | Kevin and Strange Operation | data structures dp | Statement | H | Codeforces Global Round 28 {2048} | PROGRAMMING | 2750.0 | Tutorial | |
| 6151 | Shift + Esc | dp implementation | Statement | D | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 1750.0 | Codeforces Round #994 (Div. 2) Editorial | |
| 25665 | Uninteresting Number | brute force dp math | Statement | C | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 5557 | Tree Destruction | dfs and similar dp greedy trees | Statement | G | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) | ||
| 15033 | Three Strings | dp implementation strings | Statement | E | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | Разбор Codeforces Round 991 (Div. 3) |