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 ... 6 7 8 9 10 11 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 8725 | Valiant's New Map | binary search brute force data structures dp two pointers | Statement | D | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 1500.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 932 | Function Sum | brute force combinatorics dp fft math | Statement | F | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 2750.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 3609 | Graph Cost | dp greedy math number theory | Statement | E | Codeforces Round 841 (Div. 2) and Divide by Zero 2022 {1731} | PROGRAMMING | 2000.0 | Codeforces Round #841 (Div. 2) and Divide By Zero 2022 Editorial | |
| 610 | Location | data structures dp | Statement | E | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 3000.0 | 108327 | 2800 |
| 17680 | Ugu | dp greedy | Statement | B | Codeforces Round 830 (Div. 2) {1732} | PROGRAMMING | 750.0 | 108327 | 900 |
| 4867 | Zero-One (Hard Version) | dp greedy | Statement | D2 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 15253 | Zero-One (Easy Version) | dp greedy math | Statement | D1 | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 1500.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 1704 | Conveyor | dp math | Statement | E | Codeforces Round 821 (Div. 2) {1733} | PROGRAMMING | 2750.0 | Codeforces Round #821 (Div. 2) Editorial | |
| 1030 | Zeros and Ones | bitmasks divide and conquer dp math | Statement | F | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 3250.0 | Codeforces Round #822 (Div.2) Editorial | |
| 7203 | Slime Escape | data structures dp greedy two pointers | Statement | D | Codeforces Round 822 (Div. 2) {1734} | PROGRAMMING | 2000.0 | Codeforces Round #822 (Div.2) Editorial | |
| 269 | Pebbles and Beads | data structures dp geometry | Statement | F | Codeforces Round 824 (Div. 2) {1735} | PROGRAMMING | 3000.0 | Codeforces Round #824 — editorial | |
| 918 | Swap and Take | dp greedy | Statement | E | Codeforces Round 825 (Div. 2) {1736} | PROGRAMMING | 2500.0 | Codeforces Round #825 (Div. 2) Editorial | |
| 1147 | Ela Goes Hiking | dp probabilities | Statement | E | Dytechlab Cup 2022 {1737} | PROGRAMMING | 2750.0 | Editorial of Dytechlab Cup 2022 | |
| 1880 | Balance Addicts | combinatorics dp math two pointers | Statement | E | Codeforces Global Round 22 {1738} | PROGRAMMING | 2500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 585 | Anti-Increasing Addicts | constructive algorithms dfs and similar dp greedy | Statement | G | Codeforces Global Round 22 {1738} | PROGRAMMING | 3000.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 13117 | Even Number Addicts | dp games greedy math | Statement | C | Codeforces Global Round 22 {1738} | PROGRAMMING | 1500.0 | Editorial of Codeforces Global Round <strong>22</strong> | |
| 688 | Keyboard Design | bitmasks data structures dp string suffix structures strings | Statement | F | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 1535 | Cleaning Robot | bitmasks dp | Statement | E | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 10288 | Card Game | combinatorics constructive algorithms dp games | Statement | C | Educational Codeforces Round 136 (Rated for Div. 2) {1739} | PROGRAMMING | Educational Codeforces Round 136 Editorial | ||
| 5175 | Hanging Hearts | constructive algorithms data structures dfs and similar dp greedy trees | Statement | E | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2000.0 | Tutorial | 1800 |
| 1176 | Conditional Mix | combinatorics dp math | Statement | F | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 2500.0 | Tutorial | 2600 |
| 322 | Arranging Crystal Balls | data structures divide and conquer divide and conquer dp geometry graphs number theory | Statement | I | Codeforces Round 831 (Div. 1 + Div. 2) {1740} | PROGRAMMING | 3500.0 | Tutorial | 3500 |
| 2001 | Kirill and Company | bitmasks brute force dp graphs shortest paths | Statement | G | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 19152 | Sending a Sequence Over the Network | dp | Statement | E | Codeforces Round 826 (Div. 3) {1741} | PROGRAMMING | 107908 | ||
| 1900 | Intersection and Union | combinatorics data structures dp math matrices | Statement | F | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2300 | |
| 1957 | FTL | binary search dp greedy | Statement | E | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 2400 | |
| 456 | Antifibonacci Cut | bitmasks combinatorics dp math | Statement | G | Educational Codeforces Round 137 (Rated for Div. 2) {1743} | PROGRAMMING | Educational Codeforces Round 137 Editorial | 3000 | |
| 5203 | Paths on the Tree | dfs and similar dp greedy sortings trees | Statement | D | Codeforces Global Round 23 {1746} | PROGRAMMING | 1500.0 | Codeforces Global Round 23 Editorial | |
| 625 | Joking (Hard Version) | dp interactive | Statement | E2 | Codeforces Global Round 23 {1746} | PROGRAMMING | 1750.0 | Codeforces Global Round 23 Editorial | |
| 13400 | Zero-Sum Prefixes | brute force data structures dp greedy implementation | Statement | C | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 1500.0 | Codeforces Round #833 (Div. 2) Editorial | 1600 |
| 2920 | Yet Another Array Counting Problem | data structures divide and conquer dp trees | Statement | E | Codeforces Round 833 (Div. 2) {1748} | PROGRAMMING | 2250.0 | Codeforces Round #833 (Div. 2) Editorial | 2300 |
| 1719 | Bracket Cost | binary search data structures divide and conquer dp greedy strings | Statement | E | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 7757 | Count GCD | bitmasks combinatorics dp math number theory | Statement | D | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 1750.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 465 | Doping | dp dp math math | Statement | G | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 3250.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 1303 | Majority | dp strings | Statement | F | CodeTON Round 3 (Div. 1 + Div. 2, Rated, Prizes!) {1750} | PROGRAMMING | 2500.0 | CodeTON Round 3 (Div. 1 + Div. 2) Editorial | |
| 16656 | Make Nonzero Sum (easy version) | constructive algorithms dp greedy | Statement | A1 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1300 |
| 11821 | Make Nonzero Sum (hard version) | constructive algorithms dp greedy | Statement | A2 | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 500.0 | Tutorial | 1500 |
| 5541 | Wish I Knew How to Sort | dp math probabilities | Statement | C | Codeforces Round 829 (Div. 1) {1753} | PROGRAMMING | 1750.0 | Tutorial | 2000 |
| 12788 | The Humanoid | brute force dp sortings | Statement | E | Codeforces Round 834 (Div. 3) {1759} | PROGRAMMING | 109254 | ||
| 2902 | Carry Bit | bitmasks brute force combinatorics dp math | Statement | D | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 1750.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 121 | Anti-median (Hard Version) | combinatorics dp math | Statement | F2 | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 2000.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 353 | Anti-median (Easy Version) | dp math | Statement | F1 | Pinely Round 1 (Div. 1 + Div. 2) {1761} | PROGRAMMING | 2500.0 | Pinely Round 1 (Div. 1 + Div. 2) Editorial | |
| 930 | Good Pairs | binary search data structures dp | Statement | F | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 2750.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 10275 | Binary Strings are Fun | combinatorics dp | Statement | C | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 1750.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 990 | Tree Sum | combinatorics trees | Statement | E | Codeforces Round 838 (Div. 2) {1762} | PROGRAMMING | 2500.0 | Codeforces Round #838 (Div. 2) Editorial | |
| 2426 | Valid Bitonic Permutations | combinatorics dp implementation math | Statement | D | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 2000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 964 | Edge Queries | data structures dp graphs | Statement | F | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 3000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 2292 | Node Pairs | dp graphs math | Statement | E | Codeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT {1763} | PROGRAMMING | 2000.0 | Codeforces Round #840 (Div. 2) and Enigma 2022 — Cybros LNMIIT Editorial | |
| 1474 | Doremy's Number Line | binary search dp greedy sortings | Statement | E | Codeforces Global Round 24 {1764} | PROGRAMMING | 2250.0 | Codeforces Global Round 24 Editorial | |
| 6933 | Torus Path | dp greedy math | Statement | K | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 1500 | |
| 804 | Chemistry Lab | dp geometry probabilities | Statement | F | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2200 | |
| 705 | Card Guessing | dp probabilities | Statement | C | 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) {1765} | PROGRAMMING | 109642 | 2600 | |
| 1560 | Decomposition | brute force divide and conquer dp matrices | Statement | E | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 11067 | Lucky Chains | brute force dp greedy math number theory | Statement | D | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 15198 | Hamiltonian Wall | dfs and similar dp implementation | Statement | C | Educational Codeforces Round 139 (Rated for Div. 2) {1766} | PROGRAMMING | 110066 | ||
| 1348 | Algebra Flash | bitmasks brute force dp graphs meet-in-the-middle trees | Statement | E | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 11419 | Playoff | combinatorics constructive algorithms dp graphs greedy | Statement | D | Educational Codeforces Round 140 (Rated for Div. 2) {1767} | PROGRAMMING | 110225 | ||
| 1334 | Wonderful Jump | constructive algorithms dp | Statement | F | Codeforces Round 842 (Div. 2) {1768} | PROGRAMMING | 3250.0 | Codeforces Round #842 (Div. 2) Editorial | |
| 1665 | Koxia and Tree | combinatorics dp math probabilities trees | Statement | E | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 2000.0 | Good Bye 2022 -- Editorial | |
| 178 | Koxia, Mahiru and Winter Festival | constructive algorithms | Statement | H | Good Bye 2022: 2023 is NEAR {1770} | PROGRAMMING | 4000.0 | Good Bye 2022 -- Editorial | |
| 23250 | Hossam and Friends | binary search constructive algorithms dp two pointers | Statement | B | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 1000.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 3332 | Hossam and (sub-)palindromic tree | brute force dfs and similar dp trees | Statement | D | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 2250.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 860 | Hossam and a Letter | brute force dp implementation two pointers | Statement | E | Codeforces Round 837 (Div. 2) {1771} | PROGRAMMING | 2750.0 | Codeforces Round #837 (Div. 2) Editorial | |
| 571 | Game of Questions | bitmasks dp math probabilities | Statement | G | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2800 | ||
| 157 | Jumbled Trees | Statement | J | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 2900 | |||
| 132 | Lisa's Sequences | dp | Statement | L | 2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1773} | PROGRAMMING | 3500 | ||
| 13436 | Ice and Fire | constructive algorithms dp greedy | Statement | C | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 1500.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 4052 | Two Chess Pieces | dfs and similar dp greedy trees | Statement | E | Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) {1774} | PROGRAMMING | 2000.0 | Polynomial Round 2022 (Div. 1 + Div. 2) Editorial | |
| 926 | Laboratory on Pluto | brute force combinatorics dp fft greedy math | Statement | F | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 3000.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 3997 | The Human Equation | data structures dp dsu greedy | Statement | E | Codeforces Round 843 (Div. 2) {1775} | PROGRAMMING | 2250.0 | Codeforces Round #843 (Div. 2) Editorial | |
| 12947 | Controllers | binary search math | Statement | L | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 119 | Crossing the Railways | data structures dp | Statement | E | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 1602 | Vittorio Plays with LEGO Bricks | dp | Statement | B | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 222 | Uniform Chemistry | dp math | Statement | K | SWERC 2022-2023 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1776} | PROGRAMMING | |||
| 5017 | Score of a Tree | bitmasks combinatorics dfs and similar dp probabilities trees | Statement | D | Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} | PROGRAMMING | 2000.0 | Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial | |
| 3622 | Flexible String Revisit | combinatorics dp math probabilities | Statement | D | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 1750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 989 | Maximizing Root | dfs and similar dp graphs math trees | Statement | F | Codeforces Round 848 (Div. 2) {1778} | PROGRAMMING | 2750.0 | Codeforces Round #848 (Div. 2) Editorial | |
| 9208 | Boris and His Amazing Haircut | constructive algorithms data structures dp dsu greedy | Statement | D | Hello 2023 {1779} | PROGRAMMING | 1500.0 | ||
| 1480 | Xorcerer's Stones | constructive algorithms dp trees | Statement | F | Hello 2023 {1779} | PROGRAMMING | 2250.0 | ||
| 1396 | Bracket Insertion | brute force combinatorics constructive algorithms dp math trees | Statement | F | VK Cup 2022 - Отборочный раунд (Engine) {1781} | PROGRAMMING | 3250.0 | Tutorial | |
| 5439 | Different Arrays | brute force dp | Statement | D | Educational Codeforces Round 141 (Rated for Div. 2) {1783} | PROGRAMMING | Educational Codeforces Round 141 Editorial | ||
| 1434 | Wooden Spoon | combinatorics dp | Statement | D | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 2000.0 | Codeforces Round #850 Editorial | |
| 515 | Infinite Game | combinatorics dp games probabilities | Statement | E | VK Cup 2022 - Финальный раунд (Engine) {1784} | PROGRAMMING | 3000.0 | Codeforces Round #850 Editorial | |
| 354 | Codeforces Scoreboard | data structures dp ternary search | Statement | H | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 3500.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 8520 | Remove the Bracket | dp greedy math | Statement | C | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) {1787} | PROGRAMMING | 1750.0 | TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 4829 | Moving Dots | binary search brute force combinatorics dp math two pointers | Statement | D | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 2250.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 3540 | Sum Over Zero | data structures dp | Statement | E | Codeforces Round 851 (Div. 2) {1788} | PROGRAMMING | 2500.0 | Codeforces Round #851 (Div. 2) Editorial | |
| 1040 | Serval and Brain Power | brute force dp dp greedy implementation | Statement | F | Codeforces Round 853 (Div. 2) {1789} | PROGRAMMING | 2750.0 | Codeforces Round #853 (Div. 2) Editorial | |
| 1057 | Graph Coloring (easy version) | dp | Statement | F1 | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 1647 | Divisors and Table | dp number theory shortest paths | Statement | E | Educational Codeforces Round 142 (Rated for Div. 2) {1792} | PROGRAMMING | 111835 | ||
| 1682 | Rebrending | brute force data structures dp implementation | Statement | F | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 3250.0 | Codeforces Round #852 Editorial | |
| 1391 | Velepin and Marketing | data structures dp greedy sortings | Statement | E | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 2500.0 | Codeforces Round #852 Editorial | |
| 7279 | Moscow Gorillas | dp greedy implementation two pointers | Statement | D | Codeforces Round 852 (Div. 2) {1793} | PROGRAMMING | 1750.0 | Codeforces Round #852 Editorial | |
| 4714 | Counting Factorizations | combinatorics dp math number theory | Statement | D | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 2000.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 1613 | Labeling the Tree with Distances | data structures dp hashing implementation trees | Statement | E | Codeforces Round 856 (Div. 2) {1794} | PROGRAMMING | 2750.0 | Codeforces Round 856 (Div. 2) Editorial | |
| 2473 | Explosions? | binary search data structures dp math | Statement | E | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 1438 | Blocking Chips | binary search dfs and similar dp greedy | Statement | F | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 24513 | Ideal Point | geometry greedy | Statement | B | Educational Codeforces Round 143 (Rated for Div. 2) {1795} | PROGRAMMING | 112963 | ||
| 12478 | Maximum Set | binary search brute force combinatorics dp math | Statement | C | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 5628 | Maximum Subarray | data structures dp greedy | Statement | D | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 1083 | Colored Subgraphs | data structures dp greedy trees | Statement | E | Educational Codeforces Round 144 (Rated for Div. 2) {1796} | PROGRAMMING | Educational Codeforces Round 144 Editorial | ||
| 4749 | Li Hua and Tree | brute force data structures dfs and similar dp implementation trees | Statement | D | Codeforces Round 864 (Div. 2) {1797} | PROGRAMMING | 1750.0 | Codeforces Round 864 (Div. 2) Editorial | |
| 2139 | Multitest Generator | brute force dp | Statement | E | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 2250.0 | Editorial of Codeforces Round 860 (Div. 2) | 2300 |
| 698 | Gifts from Grandfather Ahmed | dp math number theory | Statement | F | Codeforces Round 860 (Div. 2) {1798} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round 860 (Div. 2) | 2500 |
| 547 | Tree Cutting | bitmasks dfs and similar dp | Statement | H | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 3500.0 | Codeforces Round #854 Editorial | |
| 1139 | Count Voting | combinatorics dp math | Statement | G | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 3000.0 | Codeforces Round #854 Editorial | |
| 1446 | City Union | constructive algorithms dp geometry greedy implementation math | Statement | E | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 2250.0 | Codeforces Round #854 Editorial | |
| 3208 | Hot Start Up (hard version) | data structures dp | Statement | D2 | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 750.0 | Codeforces Round #854 Editorial | |
| 6175 | Hot Start Up (easy version) | dp | Statement | D1 | Codeforces Round 854 by cybercats (Div. 1 + Div. 2) {1799} | PROGRAMMING | 1500.0 | Codeforces Round #854 Editorial | |
| 4220 | Music Festival | binary search data structures dp greedy sortings | Statement | C | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1250.0 | Codeforces Round #857 Editorial | |
| 7818 | Buying gifts | data structures dp greedy sortings | Statement | B | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1000.0 | Codeforces Round #857 Editorial | |
| 3014 | The way home | dp graphs greedy shortest paths sortings | Statement | D | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 1750.0 | Codeforces Round #857 Editorial | |
| 762 | Another n-dimensional chocolate bar | dp number theory | Statement | F | Codeforces Round 857 (Div. 1) {1801} | PROGRAMMING | 3500.0 | Codeforces Round #857 Editorial | |
| 279 | Code Lock | bitmasks dp | Statement | H | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 3500.0 | Nebius Welcome Round Editorial | |
| 1760 | Routing | bitmasks dp graphs | Statement | E | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 2000.0 | Nebius Welcome Round Editorial | |
| 5385 | Accommodation | dp greedy | Statement | D | Nebius Welcome Round (Div. 1 + Div. 2) {1804} | PROGRAMMING | 1500.0 | Nebius Welcome Round Editorial | |
| 9891 | A Wide, Wide Graph | dfs and similar dp dsu greedy trees | Statement | D | Codeforces Round 862 (Div. 2) {1805} | PROGRAMMING | 1750.0 | Editorial of Codeforces Round #862 (Div. 2) | |
| 1300 | DSU Master | combinatorics dp dsu math | Statement | D | Codeforces Round 858 (Div. 2) {1806} | PROGRAMMING | 2000.0 | Codeforces Round #858 (Div. 2) Editorial | |
| 22903 | Subsequence Addition (Easy Version) | brute force dp greedy implementation sortings | Statement | G1 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 30232 | Subsequence Addition (Hard Version) | dp greedy implementation math sortings | Statement | G2 | Codeforces Round 859 (Div. 4) {1807} | PROGRAMMING | 114143 | ||
| 1662 | Minibuses on Venus (easy version) | brute force combinatorics dp | Statement | E1 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1750.0 | Codeforces Round #861 (Div. 2) editorial | 2200 |
| 900 | Minibuses on Venus (medium version) | combinatorics divide and conquer dp matrices | Statement | E2 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 1000.0 | Codeforces Round #861 (Div. 2) editorial | 2500 |
| 666 | Minibuses on Venus (hard version) | brute force combinatorics dp math | Statement | E3 | Codeforces Round 861 (Div. 2) {1808} | PROGRAMMING | 750.0 | Codeforces Round #861 (Div. 2) editorial | 2800 |
| 7480 | Binary String Sorting | binary search dp greedy | Statement | D | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 1139 | Two Tanks | binary search dp implementation math | Statement | E | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 682 | Prediction | combinatorics data structures dp | Statement | G | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
| 1389 | The Maximum Prefix | dp | Statement | G | CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) {1810} | PROGRAMMING | 3000.0 | Editorial of CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) | |
| 2235 | Vlad and the Nice Paths (hard version) | binary search combinatorics data structures dp math two pointers | Statement | G2 | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 14863 | Living Sequence | binary search dp math number theory | Statement | E | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 2634 | Vlad and the Nice Paths (easy version) | combinatorics dp math | Statement | G1 | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
| 1873 | Chain Chips | data structures dp | Statement | E | Educational Codeforces Round 146 (Rated for Div. 2) {1814} | PROGRAMMING | Educational Codeforces Round 146 Editorial | ||
| 1571 | XOR Counting | bitmasks combinatorics dp math | Statement | D | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round #865 | 2600 |
| 492 | Bosco and Particle | dp math number theory strings | Statement | E | Codeforces Round 865 (Div. 1) {1815} | PROGRAMMING | 3000.0 | Editorial of Codeforces Round #865 | 3100 |
| 1793 | The Fox and the Complete Tree Traversal | constructive algorithms dp games implementation math trees | Statement | C | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 1500.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 964 | Misha and Apples | data structures dp | Statement | D | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 2000.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 222 | Willy-nilly, Crack, Into Release! | data structures dp | Statement | F | Codeforces Round 866 (Div. 1) {1819} | PROGRAMMING | 3000.0 | Codeforces Round #866 (Div.1, Div.2, based on Lipetsk Team Olympiad) Editorial | |
| 1033 | Timber | combinatorics dp fft math | Statement | F | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 2797 | Rearrange Brackets | dp greedy math sortings | Statement | E | Educational Codeforces Round 147 (Rated for Div. 2) {1821} | PROGRAMMING | 115296 | ||
| 7944 | Gardening Friends | brute force dfs and similar dp graphs trees | Statement | F | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
| 1427 | Random Walk | dp graphs math probabilities trees | Statement | F | Codeforces Round 868 (Div. 2) {1823} | PROGRAMMING | 2500.0 | 115465 | |
| 1761 | LuoTianyi and XOR-Tree | data structures dfs and similar dp dsu greedy trees | Statement | C | Codeforces Round 872 (Div. 1) {1824} | PROGRAMMING | 1750.0 | CodeForces Round 872(Div. 1&2) Editorial | 2500 |
| 16244 | Running Miles | brute force dp greedy | Statement | D | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2000.0 | Codeforces Round #870 (Div. 2) Editorial | 1700 |
| 2026 | Walk the Runway | bitmasks brute force data structures dp graphs implementation sortings | Statement | E | Codeforces Round 870 (Div. 2) {1826} | PROGRAMMING | 2500.0 | Codeforces Round #870 (Div. 2) Editorial | 2400 |
| 4676 | Range Sorting (Easy Version) | binary search dp dsu greedy trees two pointers | Statement | B1 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2000 |
| 2423 | Range Sorting (Hard Version) | binary search data structures dp greedy | Statement | B2 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2400 |
| 1800 | Palindrome Partition | binary search brute force data structures dp hashing strings | Statement | C | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 1500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2600 |
| 35652 | Gold Rush | brute force dfs and similar dp implementation | Statement | D | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1000 | |
| 16416 | Hits Different | data structures dp implementation math | Statement | G | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1600 | |
| 11562 | Don't Blame Me | bitmasks combinatorics dp math | Statement | H | Codeforces Round 871 (Div. 4) {1829} | PROGRAMMING | Codeforces Round 871 (Div. 4) Editorial | 1700 | |
| 1017 | Mex Tree | brute force dp trees | Statement | D | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 2250.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 420 | The Third Grace | data structures dp | Statement | F | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 3500.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 21999 | Copil Copac Draws Trees | dfs and similar dp graphs trees | Statement | A | Codeforces Round 875 (Div. 1) {1830} | PROGRAMMING | 500.0 | Codeforces Round #875 (Div.1 + Div. 2) Editorial | |
| 2656 | Combinatorics Problem | brute force combinatorics dp | Statement | E | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 2200 | |
| 400 | Zombies | binary search dp | Statement | F | Educational Codeforces Round 148 (Rated for Div. 2) {1832} | PROGRAMMING | 116454 | 3200 | |
| 6624 | Ksyusha and Chinchilla | dfs and similar dp dsu greedy implementation trees | Statement | G | Codeforces Round 874 (Div. 3) {1833} | PROGRAMMING | 116636 | ||
| 5692 | Survey in Class | constructive algorithms data structures greedy implementation sortings | Statement | D | Codeforces Round 879 (Div. 2) {1834} | PROGRAMMING | 1750.0 | Codeforces Round #879 Editorial | |
| 357 | Old Mobile | dp math probabilities | Statement | E | Codeforces Round 880 (Div. 1) {1835} | PROGRAMMING | 2250.0 | Codeforces Round 880 Editorial | |
| 60904 | Grasshopper on a Line | constructive algorithms math | Statement | A | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
| 1963 | Count Supersequences | combinatorics dp math | Statement | E | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 2250.0 | Codeforces Round #877 (Div. 2) Editorial | |
| 1613 | Decreasing Game | constructive algorithms dp greedy interactive | Statement | E | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 2750.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 2777 | Ball Sorting | data structures dp sortings | Statement | D | Codeforces Round 876 (Div. 2) {1839} | PROGRAMMING | 2250.0 | Codeforces Round #876 (Div. 2) Editorial | |
| 2175 | Railguns | dfs and similar dp graphs implementation | Statement | F | Codeforces Round 878 (Div. 3) {1840} | PROGRAMMING | Codeforces Round #878 (Div.3) Editorial | ||
| 9301 | Ranom Numbers | brute force dp greedy math strings | Statement | C | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 5435 | Pairs of Segments | data structures dp greedy sortings | Statement | D | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 650 | Monocarp and a Strategic Game | dp geometry sortings | Statement | F | Educational Codeforces Round 150 (Rated for Div. 2) {1841} | PROGRAMMING | 117262 | ||
| 1153 | Tenzing and Random Real Numbers | 2-sat bitmasks dp probabilities | Statement | H | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 3750.0 | CodeTON Round 5 Editorial | |
| 1801 | Tenzing and Random Operations | combinatorics dp math probabilities | Statement | G | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 3000.0 | CodeTON Round 5 Editorial | |
| 1917 | Tenzing and Triangle | data structures dp greedy | Statement | E | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 2000.0 | CodeTON Round 5 Editorial | |
| 176 | Tenzing and Necklace | divide and conquer dp greedy | Statement | I | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 5000.0 | CodeTON Round 5 Editorial | |
| 17232 | Tenzing and Balls | dp greedy | Statement | C | CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) {1842} | PROGRAMMING | 1000.0 | CodeTON Round 5 Editorial | |
| 22593 | Apple Tree | combinatorics dfs and similar dp trees | Statement | D | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 2283 | Omsk Metro (hard version) | data structures dfs and similar divide and conquer dp implementation math trees | Statement | F2 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 6542 | Omsk Metro (simple version) | data structures dfs and similar dp greedy math trees | Statement | F1 | Codeforces Round 881 (Div. 3) {1843} | PROGRAMMING | Codeforces Round #881 (Div. 3) Editorial | ||
| 314 | Multiple of Three Cycles | combinatorics dp dsu math | Statement | H | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 4000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
| 17302 | Strong Password | binary search dp greedy strings | Statement | C | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 9414 | Rating System | brute force data structures dp greedy implementation math | Statement | D | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 1739 | Boxes and Balls | dp implementation math | Statement | E | Educational Codeforces Round 151 (Rated for Div. 2) {1845} | PROGRAMMING | 117791 | ||
| 6172 | Rudolf and CodeVid-23 | bitmasks dp graphs greedy shortest paths | Statement | G | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
| 15074 | Vampiric Powers, anyone? | bitmasks brute force data structures dp greedy | Statement | C | Codeforces Round 882 (Div. 2) {1847} | PROGRAMMING | 1500.0 | Tutorial | |
| 12834 | Binary String Copying | binary search brute force data structures hashing strings | Statement | C | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 10605 | Array Painting | brute force constructive algorithms dp greedy | Statement | D | Educational Codeforces Round 152 (Rated for Div. 2) {1849} | PROGRAMMING | 118752 | ||
| 13779 | Nastya and Potions | dfs and similar dp graphs greedy shortest paths sortings | Statement | E | Codeforces Round 888 (Div. 3) {1851} | PROGRAMMING | 118667 | ||
| 681 | Miriany and Matchstick | constructive algorithms dp greedy | Statement | D | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 2000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 152 | Panda Meetups | data structures dp flows | Statement | F | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 3000.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 2192 | Ina of the Mountain | data structures dp greedy math | Statement | C | Codeforces Round 887 (Div. 1) {1852} | PROGRAMMING | 1250.0 | Codeforces Round 887 (Div 1, Div 2) Tutorial | |
| 4450 | Earn or Unlock | bitmasks brute force dp | Statement | B | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 153 | Mark and Spaceship | dp | Statement | F | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 3250.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 1990 | Expected Destruction | dp math probabilities | Statement | C | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 1500.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
| 19719 | To Become Max | binary search brute force data structures dp | Statement | C | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1250.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 1849 | PermuTree (hard version) | bitmasks dp implementation trees | Statement | E2 | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1500.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 6669 | PermuTree (easy version) | dfs and similar dp trees | Statement | E1 | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 1500.0 | Codeforces Round #890 (Div. 2) Editorial | |
| 3278 | Trees and Segments | binary search brute force constructive algorithms data structures dp greedy two pointers | Statement | D | Codeforces Round 893 (Div. 2) {1858} | PROGRAMMING | 2000.0 | Codeforces Round #893 (Div. 2) Editorial | 2200 |
| 8121 | Andrey and Escape from Capygrad | binary search data structures dp dsu greedy sortings two pointers | Statement | D | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1750.0 | Video solutions from Geothermal. | |
| 18977 | Another Permutation Problem | brute force dp greedy math | Statement | C | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 1250.0 | Video solutions from Geothermal. | |
| 2186 | Maximum Monogonosity | brute force dp math | Statement | E | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 2250.0 | Video solutions from Geothermal. | |
| 3714 | Balanced String | bitmasks constructive algorithms dp | Statement | D | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 23844 | Not a Substring | constructive algorithms dp strings | Statement | A | Educational Codeforces Round 153 (Rated for Div. 2) {1860} | PROGRAMMING | Educational Codeforces Round 153 Editorial | ||
| 2125 | Non-Intersecting Subpermutations | combinatorics dp | Statement | E | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 8174 | Sorting By Multiplication | dp greedy math | Statement | D | Educational Codeforces Round 154 (Rated for Div. 2) {1861} | PROGRAMMING | Educational Codeforces Round 154 Editorial | ||
| 7842 | Magic Will Save the World | binary search bitmasks brute force dp | Statement | F | Codeforces Round 894 (Div. 3) {1862} | PROGRAMMING | Tutorial | ||
| 1410 | Divide, XOR, and Conquer | bitmasks dp | Statement | F | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 2500.0 | ||
| 3312 | Speedrun | brute force data structures dfs and similar dp graphs sortings | Statement | E | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 1750.0 | ||
| 138 | Redundant Routes | constructive algorithms dp trees | Statement | I | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 4000.0 | ||
| 116 | Goldberg Machine 3 | dp trees | Statement | H | Pinely Round 2 (Div. 1 + Div. 2) {1863} | PROGRAMMING | 3500.0 | ||
| 7782 | Matrix Cascade | brute force constructive algorithms dp greedy | Statement | D | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 636 | Asterism Stream | dp math matrices probabilities | Statement | H | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 3500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 16860 | Swap and Reverse | greedy sortings strings | Statement | B | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 1000.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
| 595 | Keen Tree Calculation | binary search dp geometry trees | Statement | K | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 1021 | Mighty Rock Tower | combinatorics dp math probabilities | Statement | M | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 3476 | Completely Searching for Inversions | dfs and similar dp graphs | Statement | C | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 575 | Elevators of Tamem | dp | Statement | E | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 454 | Jackets and Packets | dp | Statement | J | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 981 | Imagination Castle | dp games two pointers | Statement | I | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 1619 | Digital Wallet | dp greedy | Statement | D | COMPFEST 15 - Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1866} | PROGRAMMING | COMPFEST 15 Preliminary — Editorial | ||
| 2826 | Candy Party (Hard Version) | bitmasks constructive algorithms dp graphs greedy implementation math | Statement | B2 | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 750.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 1416 | Travel Plan | combinatorics divide and conquer dp math trees | Statement | C | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 1000.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 127 | Min-Sum-Max | dp greedy | Statement | E | Codeforces Round 896 (Div. 1) {1868} | PROGRAMMING | 2500.0 | Codeforces Round 896 (Div. 1, Div. 2) Editorial | |
| 13412 | Colorful Table | binary search data structures dp implementation math sortings two pointers | Statement | C | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 1500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 3118 | Another MEX Problem | bitmasks dp graphs shortest paths | Statement | E | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 2750.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 129 | Standard Graph Problem | data structures graphs greedy trees | Statement | H | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 4000.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 1447 | Jellyfish and Math | bitmasks dp graphs shortest paths | Statement | B | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 1250.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 517 | Jellyfish and OEIS | dp | Statement | F | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 4000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 169 | Jellyfish and Inscryption | dp | Statement | G | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 5000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 2267 | Jellyfish and EVA | dp graphs greedy math probabilities | Statement | C | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 1500.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 776 | Jellyfish and Hack | dp math | Statement | E | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 3000.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 1033 | Jellyfish and Miku | dp math probabilities | Statement | D | Codeforces Round 901 (Div. 1) {1874} | PROGRAMMING | 2250.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 11869 | Jellyfish and Mex | dp | Statement | D | Codeforces Round 901 (Div. 2) {1875} | PROGRAMMING | 1250.0 | Codeforces Round 901 (Div. 1, Div. 2) Editorial | |
| 2868 | Autosynthesis | 2-sat constructive algorithms dfs and similar dp flows graphs trees | Statement | C | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 1250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 377 | Ball-Stackable | constructive algorithms data structures dp trees | Statement | E | Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) {1876} | PROGRAMMING | 2250.0 | Codeforces Round #902 (Div. 1, Div. 2, based on COMPFEST 15 — Final Round) Editorial | |
| 29805 | Make it Alternating | combinatorics dp greedy | Statement | C | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 1300 | |
| 11345 | Sum of XOR Functions | bitmasks combinatorics dp | Statement | D | Educational Codeforces Round 155 (Rated for Div. 2) {1879} | PROGRAMMING | 120773 | 1700 | |
| 10157 | Minimum Maximum Distance | dfs and similar dp graphs shortest paths trees | Statement | F | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 26351 | Block Sequence | dp | Statement | E | Codeforces Round 903 (Div. 3) {1881} | PROGRAMMING | 121327 | ||
| 7454 | Tree XOR | bitmasks dfs and similar dp greedy trees | Statement | D | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 2000.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 14686 | Card Game | dp greedy | Statement | C | Codeforces Round 899 (Div. 2) {1882} | PROGRAMMING | 1500.0 | Codeforces Round 899 (Div. 2) Editorial | |
| 4352 | Counting Rhyme | brute force combinatorics dp math number theory sortings | Statement | D | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 2500.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 7536 | Medium Design | data structures dp sortings | Statement | C | Codeforces Round 904 (Div. 2) {1884} | PROGRAMMING | 1750.0 | Codeforces Round #904 (Div. 2) Editorial | |
| 1930 | I Wanna be the Team Leader | bitmasks dp two pointers | Statement | E | Educational Codeforces Round 156 (Rated for Div. 2) {1886} | PROGRAMMING | Educational Codeforces Round 156 Editorial | ||
| 4014 | Doremy's Drying Plan (Easy Version) | brute force data structures dp greedy sortings | Statement | C1 | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 750.0 | Codeforces Round 906 Editorial | |
| 1235 | Doremy's Drying Plan (Hard Version) | data structures dp | Statement | C2 | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 1500.0 | Codeforces Round 906 Editorial | |
| 224 | Doremy's Average Tree | dp trees | Statement | F | Codeforces Round 906 (Div. 1) {1889} | PROGRAMMING | 3500.0 | Codeforces Round 906 Editorial | |
| 389 | Cacti Symphony | combinatorics dfs and similar dp graphs | Statement | E | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2750.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
| 448 | Two Characters, Two Colors | binary search data structures dp flows geometry | Statement | G | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 13362 | Torn Lucky Ticket | brute force dp hashing implementation math | Statement | C | Educational Codeforces Round 157 (Rated for Div. 2) {1895} | PROGRAMMING | Educational Codeforces Round 157 Editorial | ||
| 215 | Cyclic Hamming (Easy Version) | divide and conquer dp fft math number theory | Statement | H1 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 4000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 174 | Cyclic Hamming (Hard Version) | dp fft math number theory | Statement | H2 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) {1896} | PROGRAMMING | 1000.0 | CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
| 2786 | Transitive Graph | constructive algorithms dfs and similar dp graphs implementation | Statement | E | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 2250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 15568 | Anji's Binary Tree | dfs and similar dp shortest paths trees | Statement | C | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 1250.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 21005 | Laura and Operations | dp math | Statement | B | Codeforces Round 911 (Div. 2) {1900} | PROGRAMMING | 1000.0 | Codeforces Round 911 (Div. 2) Editorial | |
| 2067 | Compressed Tree | dfs and similar dp graphs greedy trees | Statement | E | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial |